By Topic

A Drop and Throttle Flow Control Policy for Computer Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Kamoun, F. ; Dept. of Computer Science, Faculté des Sciences de Tunis, Tunis, Tunisia

Store-and-forward packet switched networks are subject to congestion under heavy load conditions. In this paper a distributed drop and throttle flow control (DTFC) policy based on a nodal buffer management scheme is proposed. Two classes of traffic are identified: "new" and "transit" traffic. Packets that traveled over one or more hops are considered as transit packets. Packets that are candidates to enter the communication network are considered as new packets. At a given node if the number of allocated buffers is greater than a limit value, then new traffic is rejected, whereas transit traffic is accepted. Indeed, if the total buffer area is occupied, transit traffic is also rejected and, furthermore, it is dropped from the network. This policy is analyzed in the context of symmetrical networks. A queueing network model is developed whereby network throughput is expressed in terms of the traffic load, the number of buffers in a node and the DTFC limit value. Optimal policies where the limit value is a function of the traffic load are found to prevent network congestion. Furthermore, they achieve a very good network throughput even for loads fifty times beyond the normal operating region. Moreover, suboptimal, easy to implement fixed limit policies offer satisfactory results.

Published in:

Communications, IEEE Transactions on  (Volume:29 ,  Issue: 4 )