Journal of Communications and Networks

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

Optimal Bandwidth Assignment for Packet Rings

  • Hua, Cunqing (Department of Information Engineering, The Chinese University of Hong Kong) ;
  • Yum, Tak-Shing Peter (Department of Information Engineering, The Chinese University of Hong Kong) ;
  • Li, Cheng (NXP Semiconductors)
  • Published : 2007.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

The network throughput is an important performance criteria for the packet ring networks. Since maximizing the network throughput can lead to severe bias in bandwidth allocation among all flows, fairness should be imposed to prevent bandwidth starvation. The challenge here, therefore, is the joint optimization of the network throughput and fairness. In this paper, we present the optimal bandwidth assignment scheme to decompose this optimization problem into two tasks, one for finding fair bandwidth assignment and the other for finding the optimal routing. The network throughput is maximized under the fairness constraints when these tasks are performed iteratively.

Keywords

References

  1. White paper, 'An introduction to resilient packet ring technology,' Aug. 2001. [Online). Available: http://www.rpralliance.org
  2. White paper, 'Spatial reuse protocol technology, cisco systems,' 2000. [Online]. Available: http://www.cisco.com/warp/public/cc/techno/wnty/dpty/tech/srpmc_wp.htm
  3. J.Kao et al., 'Gandalf proposal for ieee standard 802.17,' draft 0.4, Nov. 2001
  4. A. Mekkittikul et al., 'Alladin proposal for ieee standard 802.17,' draft 1.0, Nov. 2001
  5. V. Gambiroza, Y. Liu, P. Yuan, and E. Knightly, 'High performance fair bandwidth allocation for resilient packet rings,' in Proc. ITC Specialist Seminar on Traffic Engineering and Traffic Management, 2002
  6. P. Yue, Z. Liu, and J. Liu, 'High performance fair bandwidth allocation algorithm for resilient packet ring,' in Proc. AlNA, Mar. 2003
  7. C.-C. Huang, H. Peng, F.-J. Yuan, and J. Hawkins, 'A steady state bound for resilient packet rings,' in Proc. Globecom, Dec. 2003
  8. A.K. Parekh and R. G. Gallagher, 'A generalized processor sharing approach to flow control in integrated services networks: The single-node case,' IEEE/ACM Tran. Netw., vol. 1, 1993
  9. J. Chen, I. Cidon, and Y. Ofek, 'A local fairness algorithm for gigabit lan's/man's with spatial reuse,' IEEE J. Sel. Areas Commu., vol. 11, no. 8, Oct. 1993
  10. D. P. Bertsekas, Data Networks. Englewood Cliffs, N.J.: Prentice Hall, 1992
  11. H.-Y. Luo, S.-W. Lu, V. Bharghavan, J. Cheng, and G. Zhong, 'A packet scheduling approach to qos support in multihop wireless networks,' ACM Journal of Mobile Networks and Applications (MONET), vol. 9, no. 3, June 2004
  12. L. Massoulie and J. Roberts, 'Bandwidth sharing: Objectives and algorithms,' in Proc. INFOCOM, 1999, pp. 1395-1403
  13. R. J. La and V. Anantharam, 'Utility-based rate control in the internet for elastic traffic,' IEEE/ACM Trans. Netw., vol. 10, no. 2, pp. 272-286, 2002 https://doi.org/10.1109/90.993307
  14. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge University Press, 2003
  15. R. K. Jain, D.-M. Chiu, and W. Howe, 'A quantitative measure of fairness and discrimination for resource allocation in shared systems,' In DEC Res. Rep. TR-301, Sept. 1984