In interconnected networks, the performance of a network
is affected heavily by the traffic transmitted from
other networks. A network may become subject to congestion
when the internetwork traffic increases rapidly.
It is well known that congestion gives rise to a degradation
in network performance. In this paper, we evaluate
window-based congestion control mechanism in an internetwork
environment. We also propose and study two
dynamic window congestion control algorithms. These
algorithms provide further control to window mechanism
by adjusting the window size in accordance with
the availability of the network resources at the destination.
Dynamic algorithms are evaluated as compared
with fixed window control by means of computer simulation.
NW:Netvork
GN:G.leWay
Figur

Ulusoy Ozgur, Baray Mehmet

Bilkent University Institutional Repository

Dynamic Congestion Control in Interconnected Computer Networks Ozgur Ulusoy, Mehmet Baray Bilkent University Department of Computer Engineering and Information Sciences Maltepe, Ankara, TURKEY 06572 Abstract In interconnected networks, the performance of a net- work is affected heavily by the traffic transmitted from other networks. A network may become subject to con- gestion when the internetwork traffic increases rapidly. It is well known that congestion gives rise to a degrada- tion in network performance. In this paper, we evaluate window-based congestion control mechanism in an inter- network environment. We also propose and study two dynamic window congestion control algorithms. These algorithms provide further control to window mecha- nism by adjusting the window size in accordance with the availability of the network resources at  the destina- tion. Dynamic algorithms are evaluated as compared with fixed window control by means of computer simu- lation. NW:Netvork GN:G.leWay Figure 1: Internetwork structure 1 .Introduction The objective of congestion control in a computer net- work is to prevent or minimize the degradation in the system performance caused by the overload of messages. Various congestion control strategies have been proposed and implemented [5],[7]. Window mechanism is one of the effective congestion control schemes.The window mechanism limits the number of packets injected into the network by a source. The maximum number of packets allowed to be in transit gives the 'window size' between a source and destination. The packets in transit are the ones that have been transmitted, but not yet acknowl- edged by the destination [7]. In this paper, a window based congestion control mech- anism is evaluated in an interconnected network ('in- ternetwork' for short) environment. With the window mechanism, each network is allowed to send up to a cer- tain number of messages to another network without getting acknowledgement. The control is intended for the purpose of preventing congestion in gateways and attached networks caused by the overload of internet- work messages. First, an evaluation of fixed window con- trol mechanism is provided. Then two dynamic window congestion control algorithms are proposed and studied. The algorithms provide further control to window mech- anism by adjusting the window size in accordance with the availability of network resources at  the destination. A comparison of dynamic algorithms with fixed window control is provided in terms of throughput and delay performance. It is shown that dynamic algorithms have considerable performance advantages over the fixed win- dow control. 2. Simulation Model Fig.1 presents the internetwork structure we study on where the individual local networks are connected to the system via their gateways. CH2613-8/88/0000/0092/$01.00 0 1988 IEEE 92 Figure 2: Model for a destinatiork gateway and its con- nected network Our study is concerned primarily with investigating the effect of internetwork traffic on the performance of con- nected networks and providing gateway-to-gateway level congestion control to prevent internetwork message over- load at the gateways and networks. In Fig.2 a model is provided for a gateway and its adjacent network within the internetwork. The parameters appearing in the model can be described as follows: Xji(packets/second) : Arrival rate of internet messages transmitted from network j to network i where X j j = O  and j=l. .K (assuming that K individual networks are interconnected). Xi(packeis/second) : Total arrival rate of internet mes- sages to network i (Xi = K j=1 X j i ) .  mi(packels) : Buffer capacity of gateway i. pi  (packetslsecond) : Message processing rate at gate- way i. GOj(packeis/second) : Rate of internet packets pro- cessed at gateway i to its destination network. ni : number of nodes within network i. Gli(packets/second) : Total intranet traflic rate within network i .  It  is the sum of the rates of internal messages generated by each node. The assumptions for the internetwork simulation model ;-.- --..--__ ---.-- .. -- I lo* I .;' Fired window control Total Internet Intranet SI :. A( h'bps)  I.. n. I.. m I" '" , 7. t" n ,.' w = 5 I Figure 3: Throughput of a network versus internetwork load are: 0 The arrival process of internet and intranet mes- sages follows a Poisson process. 0 No multipacket message exists in the system, that is all messages consist of one packet only. 0 Message lengths are exponentially distributed with the average length of 1 for both internet and intranet messages. 0 The gateway has a finite number of buffers and each buffer can store only one packet. Service time dis- tribution for the internet messages at the gateway is exponential. 0 The transmission error rate is negligible. The resource limitations for internetwork messages arriv- ing at the destination are buffer size and message service rate of the gateway connected to the destination network and the link capacity of the network. Some of the in- ternetwork messages can be discarded at the destination gateway because of unavailable buffer space. A copy of each packet is kept at its source until the acknowl- edgement of that packet returns from the destination. If the acknowledgement doesn't come within a prespecified period of time (i.e. timeout period), the packet will be retransmitted. 3.Fixed W i n d o w  Control We first evaluate the throughput and delay performance of a network in an internetwork environment where the 93 4.Proposed Congest ion Control  Algori thms '''1 Delay(msec) Fized window c m i r o l  Internet Figure 4: Average message delay versus internetwork load Table 1: System parameters in simulation model maximum number of messages in transit between a net- work pair (i.e. internetwork window size) is restricted to a fixed value. An extensive study on fixed window congestion control is presented in [9]. Figs. 3,4 provide the performance characteristics of both internetwork and intranetwork messages for the network model where the internetwork traffic changes from light to heavy load. The system parameters used for this evaluation are given in Table 1, where T denotes the timeout period for internetwork messages and Ci is used to denote the speed of the network i .  The fixed inter- network window size is W=5. Carrier Sense Multiple Access (CSMA) method is used for the transmission of messages within the network. It can be observed from the figures that for large val- ues of offered internetwork load, a degradation in the throughput and delay performance of the messages is observed due to the increasing number of rejections at the destination gateway. If there exists a further control to reduce the window size in the case of a congestion at the destination, then fewer number of rejections occur resulting in a drop in the average delay of internetwork messages. This is the idea behind the proposed dynamic congestion control algorithms. We propose two control algorithms, namely Algorithm-1 and Algorithm-:! that can adjust internetwork window size dynamically according to the availability of network resources. The main difference between the algorithms is the location of the control of internetwork traffic. In the first algorithm, internetwork traffic is regulated at its destination while in the second one source networks control the traffic flow. The first algorithm adjusts the window size based on the utilization rates of the resources at  the destination gate- way. Let ri denote the rejection rate of messages and ui the utilization rate of buffers at  the gateway adjacent to network i .  The algorithm enforces the system to operate without exceeding some threshold values of these system parameters to prevent the overloading of the system due to internetwork messages. Initially the internetwork operates with an initial win- dow size of Winit between network pairs. The choice of initial window size value has not much effect on the per- formance over a long period since by executing dynamic window algorithms, the window size will soon have a proper value due to the congestion state at  the destina- tion. We can start at the maximum window size value (W,,,) allowed by the destination network. The lower limit on window size is one (Wmin=l). The following algorithm is executed periodically at  gateway i for the messages destined to network i. Algorit hm-1 If (ri 2 R) or (ui 2 U) then If ( Wji > Wmin) then Send a control message to source gateways to decrease the window size by 1 (For each source network j w.. - w.. - 1 ) 1: - J' Otherwise If (Wji < W,,,) then Send a control message to source gateways to increment the window size by 1 (For each source network j w.. - w.. 1 1 8 -  J I +  94 Wjj denotes the current value of window size between the source network j and destination network i .  It can take the values between Wmjn and Wmaz. The maximum window size (WmaZ) between network pairs is decided at the start by the destination network depending on the availability of its resources. R and U are the threshold values for the rejection rate of internet messages and utilization rate of buffers at the destination gateway. Algorithm2 is a different version of Algorithm-1 in the sense that in this case the control is provided by the gateway next to the source network. When a source gateway senses the congestion at a destination, it lim- its the number of packets destined to that network by dynamically adjusting its window size. The control is provided for each source-destination gateway pair inde- pendently. The control parameters used in the algorithm are the retransmission rate and response time of mes- sages transmitted by the source network. For the source network j and the destination network i assume that njj and tjj denote the retransmission rate of messages and average response time of messages re- spectively. The following algorithm is executed periodically by the gateway adjacent to network j .  Algorithm-2 For each destination gateway i do If (njj 1 N )  or (tji 2 T )  then If (Wji > Wmin) then Decrease the window size by 1 ( Wji = Wji - 1 ) 0 t herwise If (Wji < Wmar) then Increase the window size by 1 ( wji = wjj + 1 ) N and T denote the threshold values for the control pa- rameters. Wji is the current window size value between the networks j and i .  5.Performance Measures In this section comparative performance results are pre- sented for fixed and dynamic window control. The prin- cipal performance criteria employed are total throughput Total throughput(Kbps) f i r e d  Figure 5: Total throughput versus internetwork load f i z e d  I*.. 1tOb 1008 IO IC& lii Figure 6: Average internet delay versus total throughput and average internetwork message delay as a function of the offered internetwork load. Fig.5 presents a comparison of the fixed and dynamic window control on the basis of total message through- put versus offered internetwork load. At light loads there is no difference in the throughput values since no con- gestion is observed and the dynamic control algorithms do not intend to reduce the load. At moderate and high load, message throttling effect of the control algorithms prevents the congestion, and thus, the decrease in the throughput value while the internet load is increasing. Although there does not exist much difference in the throughput values, the dynamic algorithms are effective in preventing the decrease in throughput for large inter- network loads. Fig.6 exhibits the behaviour of average internetwork 95 '"1 Rejection rate Figure 7: Rejection rate at destination gateway message delay with respect to total network throughput. Delay increases with increasing throughput because of the contention at gateway and network resources. When the throughput reaches the maximum value attainable, the increase of delay becomes very steep. After that point, further increase in the offered internet load may lead to both a decrease in throughput and an increase in delay. Dynamic algorithms are effective in preventing the sudden rise of delay. Fig.7 gives the rejection rate of internet messages at  the destination gateway for the fixed and dynamic window control. For the large values of offered internetwork load, dynamic control algorithms try to reduce the increase in the number of rejections by adjusting the window size value to the current system load. The next point to evaluate is the fairness of our dynamic control algorithms under different networking condi- tions. We simulated the control algorithms with many different possible configurations[lO]. Here we present only average internetwork delay versus total throughput curves for some of these configurations. In the previous example we evaluated the system per- formance for 6 networks connected to the internetwork. Fig.8 provides internetwork delay characteristics for rel- atively small and large number of networks. I t  can be observed from the figures that regardless of the size of interconnected network, dynamic window algorithms are effective in preventing the adverse effects of message overload on the system performance. In Figs. 9,lO similar graphs are presented for different gateway buffer sizes and gateway message service rates. We can conclude from the figures that for many possi- ble configurations equally good performance results are '7 Internet delay(msec) '7 Internet delay(msec) , f i r e d  Figure 8: Average internet delay versus total throughput for different number of networks connected to internet- work achieved by the dynamic control algorithms. 6.Conclusions From the above discussion, the following points can be concluded for the efficiency of the dynamic control algo- rithms: 0 The performance of a network comprising an inter- net is affected heavily by the internetwork messages. For the large values of offered internetwork load a degradation in the performance is observed due to the increasing number of rejections at the destina- tion. The dynamic algorithms provide a solution to the overload case by adjusting the internetwork traffic. rate to the current system load. 96 ‘1 Internet delay(msec) I1 fised ”* *@e m 111 I Internet delay(msec) fired l l b  I** f ired  : arg.1 Gateway buffersire m = 6 throughput(kbps: 07 Internet delay(msec) lob Gateway buffersire m = 15 Total throughput(KbPS Figure 9: Average internet delay versus total throughput for different buffersizes of destination gateway 0 The dynamic algorithms are effective for moder- ate and large internetwork load values. For the light values of offered load, since no congestion is observed the message transmission operates under normal conditions. I t  is guaranteed by the algo- rithms that when the system is lightly loaded, net- works operate at maximum window size allowed which is a desired property to make full use of the available resources. 0 The dynamic control algorithms provide a stable throughput behaviour, in the sense that for the large values of internetwork load throughput does not de- crease with increasing load value. 0 In fixed window control the number of rejections at the destination and thus the number of retrans- missions of the internet messages increase without bound with the increasing load due to limited net- work resources. This will cause a steep increase Total throughput(Kbps: 1 1  m I Internet delay(msec) fired “‘1 I Gateway service rate p = :I Figure 10: Average internet delay versus total through- put for different gateway service rates in the delay of messages when the system is over- loaded. The dynamic control algorithms reduce the number of rejections by limiting the number of mes- sages in transmission under overload conditions. As a result, large message delays are prevented. Dy- namic control algorithms are superior to fixed win- dow control in end-to-end delay of internet mes- sages. 0 Dynamic control algorithms yield satisfactory net- work performance under different load conditions, and different network patterns. Various system pa- rameters (i.e. number of networks within internet, gateway buffersize, gateway service rate) have been used in the evaluation of fairness of the algorithms. I t  has been observed that network performance is not sensitive to the values of different system pa- rameters when the dynamic control algorithms are applied. 91 The comparison of two dynamic control algorithms shows that, under heavy load conditions better per- formance characteristics can be obtained with the control at  destination gateway (Algorithml). This results from the fact that, the destination gateway is capable of providing a lack of traffic effectively for the large values of internet load since it can throttle all source networks in case of a possible congestion. In the 2nd algorithm source networks try to prevent congestion a t  the destinations of their messages by estimating the current load at  the destinations. References [l] E. Benhamou, J. Estrin ”Multilevel Internetwork- ing Gateways: Architecture and Applications”, IEEE Computer, Sept. 1983, pp. 27-34. [2] W.Bux, D. Grillo”F1ow Control in Local Area Net- works of Interconnected Token Rings”, IEEE Trans. Comm., Oct. 1985, pp.1058-1066. [3] J.Hammond, P.0’Reilly ”Performance Analysis of Local Computer Networks”, Addison Wesley, 1986. [4] R.Jain ” A  Timeout-Based Congestion Control Scheme for Window Flow-Controlled Networks”, IEEE Journal on Selected Areas in Comm., Oct.1986, pp.1162-1167. [5] L.I<leinrock, M. Gerla ”Flow Control: A Compara- tive Survey”, IEEE Trans. Comm., April 1981, pp. 553-574. [GI C.H. Sauer, K.M. Chandy ”Computer Systems Per- formance Modeling”, Prentice Hall, 1981. [7] M. Schwartz, S. Saad ”Analysis of Congestion Con- trol Techniques in Computer Communication Net- works”, Febr. 1979, pp.113-130. [8] A. Tanenbaum ”Computer Networks”, Prentice Hall, 1981. [9] 0. Ulusoy ”Congestion Control in Interconnected Computer Networks”, M.S. Thesis, Bilkent Univer- sity, June 1988. [lo] 0. Ulusoy, M. Baray ”Dynamic Window Conges- tion Control Algorithms in Interconnected Com- puter Networks”, Technical Report, Bilkent Univer- sity, SERC, 1988. 98 

Dynamic congestion control in interconnected computer networks

http://repository.bilkent.edu.tr/bitstream/11693/27837/1/Dynamic%20congestion%20control%20in%20interconnected%20computer%20networks.pdf

Dynamic congestion control in interconnected computer networks

Abstract

Similar works

Full text

Available Versions

Bilkent University Institutional Repository