Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword
Like this
1Activity
0 of .
Results for:
No results containing your search query
P. 1
An Efficient Fair Queuing Model for Data Communication Networks

An Efficient Fair Queuing Model for Data Communication Networks

Ratings: (0)|Views: 157|Likes:
Published by ijcsis
The advent of data communication networks has been one of the greatest discoveries that can ever be witnessed by mankind. Despite the benefits derived from application of communication networks, there are several factors confronting the use of communication networks. One of them is Traffic congestion, which reduces throughput and causes delay of data items. The aim of the paper is to develop an efficient fair queuing model that is capable of reducing congestion by allocating resources on the network between contending users. The proposed model gives higher priority to real time in order to allow them to have dependable performance. Stimulation of this proposed model is carried out using queuing performance parameters like complexity, through put and delay time of the information. Our simulations and analysis demonstrate the effectiveness of our proposed model. It is adequately compared with previous fair queuing schemes.
The advent of data communication networks has been one of the greatest discoveries that can ever be witnessed by mankind. Despite the benefits derived from application of communication networks, there are several factors confronting the use of communication networks. One of them is Traffic congestion, which reduces throughput and causes delay of data items. The aim of the paper is to develop an efficient fair queuing model that is capable of reducing congestion by allocating resources on the network between contending users. The proposed model gives higher priority to real time in order to allow them to have dependable performance. Stimulation of this proposed model is carried out using queuing performance parameters like complexity, through put and delay time of the information. Our simulations and analysis demonstrate the effectiveness of our proposed model. It is adequately compared with previous fair queuing schemes.

More info:

Published by: ijcsis on Apr 10, 2011
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

04/10/2011

pdf

text

original

 
AN EFFICIENT FAIR QUEUING MODEL FORDATA COMMUNICATION NETWORKS
M. A. Mabayoje
1*
,
 
A.O. Ameen
1,
O.C. Abikoye
1
R. Muhammed
1,.
 
1
Department of Computer Science,Faculty of Communication and Information Sciences,University of Ilorin, PMB1515, Ilorin, Kwara-Nigeria.
S. O. Olabiyisi
2,
 2
Department of Computer Science and Engineering,Ladoke Akintola University of Technology, Ogbomosho,Oyo-Nigeria.*Corresponding Author (mabayoje.ma@unilorin.edu.ng.)
 
ABSTRACT---The advent of data communication networkshas been one of the greatest discoveries that can ever bewitnessed by mankind. Despite the benefits derived fromapplication of communication networks, there are severalfactors confronting the use of communication networks. One of them is Traffic congestion, which reduces throughput andcauses delay of data items.The aim of the paper is to develop an efficient fairqueuing model that is capable of reducing congestion byallocating resources on the network between contending users.The proposed model gives higher priority to real time in orderto allow them to have dependable performance. Stimulation of this proposed model is carried out using queuing performanceparameters like complexity, through put and delay time of theinformation.Our simulations and analysis demonstrate theeffectiveness of our proposed model. It is adequately comparedwith previous fair queuing schemes.
Keywords: Communication; Networks; Queuing Mode; Traffic;Congestion.
INTRODUCTION
Communication plays a central role in entire worldwhere retrieval and processing of information are important.From anywhere in the world, one can access the entirewealth of information such as monitor the latest swing onthe stock exchange, read and listen to news, search for academic information and so on.Despite numerous benefits associated with theadvent of data communication network, some complexitiesare becoming increasingly and rapidly associated with it.This is observed with the introduction of new functions,services and increase in connectivity. As more people aregetting connected to a given network to make use of limitedresources on it, there is much increase probability of datatraffic congestion on the network.Fair queuing is a technique that reduces congestion byallowing each flow to pass through network devices to havea fair share of network resources [1]. However, suchmechanism usually needs to maintain state, manage buffer or perform packet scheduling on a per flow basis, and thiscomplexity may prevent them from being cost effectivelyimplemented, reduce delay for real-time traffic and widelydeploy.In this paper, a new efficient fair queuing modelthat significantly reduces this implementation yet stillachieves approximately fair bandwidth allocation withminimal delay for real time traffic is implemented.
RELATED WORKSCommunication Networks Classification
The type of data communication facility to be usedby any organization depends on the nature of theapplication, the number of computers involved and their physical separation facilities. Two basic network types areLocal Area Networks (LANs) and wide-area (or long-haul)networks (WANs) [2].Local Area Networks (LANs) connect computersand peripheral devices in a limited physical area, such as abusiness office, laboratory, or college campus, by means of permanent links (wires, cables, fiber optics) that transmitdata rapidly. A typical LAN consists of two or morepersonal computers, printers, and high-capacity disk-storagedevices called file servers, which enable each computer onthe network to access a common set of files. LAN operatingsystem software, which interprets input and instructsnetworked devices, allows users to communicate with each
(IJCSIS) International Journal of Computer Science and Information Security,Vol. 9, No. 3, March 2011206 http://sites.google.com/site/ijcsis/ISSN 1947-5500
 
other; share the printers and storage equipment; andsimultaneously access centrally located processors, data, or programs (instruction sets).Wide-Area Networks (WANs) connect computersand smaller networks to larger networks over greater geographic areas, including different continents. They maylink the computers by means of cables, optical fibers, or satellites, but their users commonly access the networks viaa modem (a device that allows computers to communicateover telephone lines). The largest wide-area network is theInternet, a collection of networks and gateways linkingmillions of computer users on every continent [2, 3].
Mode of Data Transfer
Mode of data transfer on the network specifiesmethod by which information or data can be transferred over transmission media on the network [3]. Mode of datatransfer can be described in three following ways:
Simplex transmission:
This is one-way transmissionbetween a transmitter and a corresponding receiver. Thecommunication is unidirectional as on a one-way road.
Half-duplex transmission:
Two-way transmission ispossible, but it cannot take place simultaneously; data mustfirst be transmitted in one direction before transmission inthe reverse direction is possible.
Full-duplex transmission:
This is simultaneous transmissionin both directions. Both stations can simultaneously transmitand receive data from each other [4, 5]. Figure 1 belowillustrates three mode of data transfer.
Figure 1. Simplex transmission, Half-duplextransmission and Full-duplex transmission
Congestion Control in Data Communication Network
 
Traffic congestion is said to occur on the network when there are too much demand for a particular resourcesbeyond what the network can handle. This invariable givesrise to unpleasant delay and through put of data network.Unlike tradition voice communication, where an active callrequires constants bit rates from the networks [6]. A typicaldata session may require very low data rate during periodsof inactivity and much higher rate at other times.Consequences, there may be times when incoming traffic toa network exceeds its capacity and result into low level of data throughput.
Fair Queuing
Fair Queuing is a technique that control traffic congestionon the network by allowing each flow passing through anetwork device to have a fair share of network resources.[7].
Roles of Fair Queuing in Congestion Control.
Data networks such as the internet, becauseof their reliance on statistical multiplexing, must providesome mechanism to control congestion. The current internetwhich has mostly first-in first-out (FIFO) queuing and drop-tail mechanisms in its routers relies on end-to-endcongestion control in which hosts curtail their transmissionrates when they detect that the network is congested.
Fair Queuing Performance Metrics
There are varieties of quality services of metrics or measuresof a fair queuing performance. The relevance of a particular metric depends upon the type of network (connectionoriented or connectionless) [6, 7].I. Packet Delay: The total time, the network takes todeliver the data packet from the time the first bit of thepacket enters the network to the time the first bit of thepacket is delivered to the destination.II. Throughput: The measure of the amount of datadelivered per unit time. It often measured in packet per second.III. Delay Jitter: An important metric in some virtual circuitpacket networks. It is a measure of the degree of variabilityin the time between succession packets delivered in a virtualcircuit.IV. Blocking probability: It is a fundamental metric of mostconnection oriented networks, that is, circuit switch andvirtual-circuit switch network. In these networks, anapplication requests bandwidth in the form of a connectionbefore transmitting data into the network. If insufficientresources are available for the connection (as determine bythe type of network, a description of the desired resourcesand network policy) the request is blocked.V. Fairness in network use: This is the notion of treating allsessions in the network equally.VI. Algorithm complexity: This is the measure of efficiencyof queuing scheme in respect to time and space utilization.
Definition of Terms
I. REAL-TIME FLOW: Flows that are delay sensitive, itcould comprise of audio and video.II. BEST-EFFORT FLOW: Flows of data that are notsensitive to delay, it made up of textual data.III. THROUGHPUT: Measure of amount of packetdelivered per time.IV. PACKET: In data communication, the basic logical unitof information transferred. A packet consist of a certainnumber of data bytes wrapped or encapsulated in header and
One way onlyDeviceDeviceCan go both ways, ut not at the same time
 
DeviceDeviceCan go both ways, at the same timeDeviceDevice
SimplexHal -du lexFull-duplex
(IJCSIS) International Journal of Computer Science and Information Security,Vol. 9, No. 3, March 2011207 http://sites.google.com/site/ijcsis/ISSN 1947-5500
 
trailers that contain information about where the packetcame from where its going and so on.
Fair Queuing Models
There are various queuing models appliedto improve the performance of networks and other systemswhere users statically share resources. Some of these modelsexactly predict the performance under some assumed trafficconditions, while others are only approximate [7]. Some arestatistical, some are deterministic and some have simpleanalytical solution, while other requires numericalcomputation.
First Come First Serve (FCFS)
Most routers use First-come first serve [8]on output links. Here, the order of packet arrival completelydetermines the allocation of packets to output buffers. Thepresumption is that congestion control is implemented bythe source in such a way that connection are supposed toreduced their sending rate when they sense congestion.However, a rough flow can keep increasing its share of thebandwidth and cause other flows to reduce their share.
Nagles’ Fair Queuing
Nagle proposed an approximate solution tothe first come first serve (FCFS) by identifying flows usingsource-destination address and separate output queues for each flow. The queues are serviced in round-robin fashion.This prevents a source from arbitrarily increasing its shareof the bandwidth [9]. When a source sends packets tooquickly, it merely increases the length of its own queue.Despite its merits, there is a flaw in this scheme it ignorespackets lengths. The assumption is that the average packetsize over the duration of a flow is the same for all flows inthis case each flow gets an equal share of the output rate.
Bit-By-Bit Round Robin (BR
)In BR scheme, each flow sends one bit at atime in round robin fashion, since it is impossible to becalculated .The packet is then inserted into a queue of packets sorted on departure times. Unfortunately, it isexpensive to insert into a sorted queue. The best-knownalgorithm for inserting into a sorted queue find out requires0log (n) times; where (n) is the number of flows. While theBR guarantees fairness, the packet processing cost makes ithard to implement cheaply at high speed.
Self-Clocked Fair Queuing (SCFQ)
The scheme is based on virtual timefunction that makes computation of the packet departuretime from their respective queues to be simpler [10]. Virtualtime function, serves as the measure for the work progress inthe system to be evaluated for every packet. Moreover, it isshown that the SCFQ scheme is nearly optimal in the sensethat the maximum permissible difference among thenormalized services offered to the back logged sessions isnever more than two times the corresponding figure for anypacket based queuing system. Since the virtual functionevaluated for every packet in the head of the queuing issimply extracted from the packet in the head of the queue,its generation involves minimal data processing. However,there are still computational cost associated with the sortingtechnique used in SCFQ because virtual time computationretains 0 (log (n)) sorting complexity.
 Deficit Round Robin (DRR)
DRR is a scheme that provides solution tothe unfairness caused by possible different packet by sizesused by different flows [1]. Flows are assigned to queuessuch that each queue would be served in round robinarrangement. The only different from the traditional roundrobin is that if a queue was not able to send a packet in theprevious round because its packet size was too large, theremainder from the previous quantum is added to thequantum for the next round. One of the elements of DRR isthe possibility that two or more flows will collide, whichwill equally leads to sharing of bandwidth by the collidingflows.
 Priority Queuing
When different traffic types (voice anddata) share common network resources, such transmissionlines, and router and so on, they may be given (World WideWeb) different service requirements. For example, in asingle server system, delay sensitive traffic may be servedbefore delay to tolerant traffic. One possible scenario is todivide traffic into L priority classes with class “I” heavingpriority over class “IH” and maintain a separation queue for each priority class. When a server becomes free, it startsserving a packet from the highest priority queue.
METHODOLOGY
Identification of these difficulties and others makeit imperative to propose another queuing model that laysemphasis on delay of real-time flows and fair allocation of resource with reduced Implementation complexity.Since data communication network consists of bothreal-time and best effort traffic, scheduling of resources isachieved in a way that incoming flow to the router isidentified as real-time flow or best-effort traffic. Each real-time and best-effort flow is temporarily stored in separatebuffer before allocation process commences. Higher priorityby first providing service to them using ordinary packet bypacket round robin while best-effort flows are then servedusing deficit round robin schemes. The major reason behindserving real-time flows first is to dependence performancewith respect to throughput and delay time.
Queuing Model Analysis and Design
Data communication network support different typesof services that include real-time, best-effort and manyothers. These networks support link sharing, which allowresources sharing among application that require differentnetwork services. Different services classes interact witheach other at the same output link of a switch. The queuingscheme at the switching node plays a critical role in
(IJCSIS) International Journal of Computer Science and Information Security,Vol. 9, No. 3, March 2011208 http://sites.google.com/site/ijcsis/ISSN 1947-5500

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->