A model for the estimation of buffer requirements in computer networks

مقدم أطروحة جامعية

Khawatreh, Salih A.

مشرف أطروحة جامعية

Khanfar, Khalid

الجامعة

الأكاديمية العربية للعلوم المالية و المصرفية

الكلية

كلية نظم و تكنولوجيا المعلومات

القسم الأكاديمي

قسم نظم المعلومات الحاسوبية

دولة الجامعة

الأردن

الدرجة العلمية

دكتوراه

تاريخ الدرجة العلمية

2008

الملخص الإنجليزي

A computer network can be defined as a network of data processing nodes that are interconnected for the purpose of data communication, or alternatively as a communications network in which the end instruments are computers.

This dissertation addresses the problem of estimation the buffer requirements that should be available at each node in computer networks that none of the arriving messages is to be lost.

In computer networks, a message may encounter several types of delays to reach its destination.

One of these may be due to the buffer limitations.

The objective of this dissertation is to compute the minimum number of buffers that should be available at each node of a computer networks that none of the arriving messages is lost due to insufficient buffer size.

A buffer is a collection of sub-buffers and each sub-buffer is of a fixed size so the buffer size is the multiplication of the sub-buffer size by the number of sub-buffers.

To estimate the buffer size available at each node in a computer networks, a priority assignment strategy is implemented where the processing of arriving messages is scheduled according to a preemptive priority driven policy.

A star network is treated in chapter three in view of simple routing algorithm where a central node R receives messages from nodes B1 to Bi.

A full analytical model is presented.

The analytical model is simulated to study the impact of the interarrival and processing times variation on the network performance.

The analysis shows that the number of buffers required at each node is directly proportional with the load factor.

The load factor is defined to be the ratio between the maximum processing time and the minimum interarrival time for a certain node.

It has been shown that if the load factor is about unity, the number of buffers increases almost exponentially.

The analysis that was made on the star network had been extended in chapter four to be applied on the most general case where messages are assumed to be generated externally IX and internally.

Also the analysis was made with adaptive and nonadaptive routing algorithms.

The presented study in this dissertation may help in designing reliable networks by making sure that, early in the design stages, sufficient amount of buffer space is provided to avoid message loss and unnecessary delays thereby increasing the network throughput.

It can help in finding optimal routing in the sense of minimizing the number of required buffers which potentially can help reducing the cost of the network.

It also helps in finding an alternative route in case of route failure.

التخصصات الرئيسية

تكنولوجيا المعلومات وعلم الحاسوب

الموضوعات

• الاتصالات السلكية و اللاسلكية
• معالجة البيانات
• شبكات الحاسوب
• الاتصالات الرقمية
• شبكات المعلومات
• مستودعات البيانات

عدد الصفحات

92

قائمة المحتويات

• APA
• MLA
• AMA

لغة النص

الإنجليزية

نوع البيانات

رسائل جامعية

رقم السجل

BIM-306355