Share Email Print
cover

Proceedings Paper

Achieving fairness in multicasting with almost stateless rate control
Author(s): Saswati S. Sarkar; Tianmin Ren; Leandros Tassiulas
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

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.

Paper Details

Date Published: 8 July 2002
PDF: 15 pages
Proc. SPIE 4868, Scalability and Traffic Control in IP Networks II, (8 July 2002); doi: 10.1117/12.475270
Show Author Affiliations
Saswati S. Sarkar, Univ. of Pennsylvania (United States)
Tianmin Ren, Univ. of Maryland/College Park (United States)
Leandros Tassiulas, Univ. of Maryland/College Park (United States)


Published in SPIE Proceedings Vol. 4868:
Scalability and Traffic Control in IP Networks II
Victor Firoiu; Zhi-Li Zhang, Editor(s)

© SPIE. Terms of Use
Back to Top