Home > Communications Protocols > Wireless Connectivity


[ pdf ] Data Networks Flow Control

Data Networks Flow Control Download
185
times
Topic under  Wireless Connectivity
Source: ee.sharif.edu 
File size: 1.7 MB
File type: pdf
Last download on: Tue Mar 13, 2018 01:20:45 PM
Short Desciption:
Second Edition Data Networks DIMITRI BERTSEKAS Massachusetts Institute of Technology ROBERT GALLAGER Massachusetts Institute of Technology, 6.1 INTRODUCTION In most networks, there are circumstances in which the externally offered load is larger than can be handled even with optimal routing. Then, if no measures are taken to restrict the entrance of traffic into the network, queue sizes at bottleneck links will grow and packet delays will increase, possibly violating maximum delay specifications. Furthermore, as queue sizes grow indefinitely, the buffer space at some nodes may be exhausted. When this happens, some of the packets arriving at these nodes will have to be discarded and later retransmitted, thereby wasting communication resources.

Summary:
In this chapter we identified the major flow control objectives as limiting average delay and buffer overflow within the subnet, and treating sessions fairly. We reviewed the major flow control methods, and we saw that the dominant strategies in practice are based on windows and input rate control. Window strategies combine low overhead with fast reaction to congestion but have some limitations, particularly for networks with relatively large propagation delay. Window strategies are also unsuitable for sessions that require a minimum guaranteed rate. Rate adjustment schemes are usually implemented by means of leaky buckets. However, there remain a number of questions regarding the choice and adjustment of the leaky bucket parameters in response to traffic conditions. We also described two theoretical input rate adjustment schemes. The first scheme extends the optimal routing methodology of Chapter 5 to the flow control context, and combines routing and flow control into a single algorithm. The second scheme assumes fixed, single-path routing for each session, and focuses on maintaining flow control fairness.
Bookmark or share this info on Google+ and leave comment at below :

Bookmark and Share

People who downloaded this also viewed in this sites:

Hacking Wireless Networks for Dummies
This book will show you quite a few of the latest tools, but an exhaustive text covering all currently-available wireless hacking tools would...

Mobile Wireless Communications
Mobile Wireless Communications Mischa Schwartz Department of Electrical Engineering Columbia University, This book, designed as an introductory...

Multiaccess Communication
The subnetworks considered thus far have consisted of nodes joined by point-to-point communication links. Each such link might consist physically of...

    Leave comment :
    "Data Networks Flow Control"

    Name*

    Comment


    Related Free Files

    Point-to-Point Protocols and Links... - Download: 173 times
    Hacking Wireless Networks for Dummies... - Download: 219 times
    Mobile Wireless Communications... - Download: 881 times
    Fundamentals of Wireless Communications... - Download: 480 times
    Algorithms For Wireless Sensor Networks... - Download: 98 times
    Routing in Data Networks... - Download: 87 times
    Energy and Utility Optimization in Wireless... - Download: 131 times
    Multiaccess Communication... - Download: 103 times
    Energy-efficient Wireless Sensor Network MAC... - Download: 121 times
    Introduction to Wireless Communication... - Download: 355 times


    eXTReMe Tracker