KEYWORDS: Receivers, Error analysis, Data transmission, Mathematical modeling, Control systems, Internet, Systems engineering, Computer engineering, Computing systems, Local area networks
Several flow control algorithms have been proposed for attaining
maxmin fair rates. All of these strategies use flow specific
states at all nodes in the network, and are hence unsuitable for
deployment in the current internet. We propose a new approach
which attains maxmin fairness in unicast networks while
maintaining per flow states at the edge nodes only. Next, we
consider multirate, multicast network and argue that any flow
control algorithm must use flow specific states at the forking
points of the multicast tree. This happens because the packet
forwarding rates must be different for different branches at the
forking point, and thus the session specific forwarding rates
must be stored at the forking point. Finally, we present a maxmin
fair bandwidth allocation policy for multirate, multicast
networks, which uses per flow states only at the forking nodes,
and no per flow state at the intermediate nodes.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.