The Journal of Korean Institute of Communications and Information Sciences (한국통신학회논문지)

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

Flow Aggregation Criteria in Networks with Rate-Guaranteeing Servers

  • Joung, Jin-Oo (Department of Computer Science, Sangmyung University) ;
  • Song, Jong-Tae (Broadcasting & Telecommunications Convergence Research Laboratory, ETRI) ;
  • Lee, Soon-Seok (Broadcasting & Telecommunications Convergence Research Laboratory, ETRI)
  • 정진우 (상명대학교 컴퓨터과학부) ;
  • 송종태 (ETRI 융합네트워크연구팀) ;
  • 이순석 (한국전자통신연구원 융합네트워크연구팀)
  • Published : 2008.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

An effective method for calculating delay bounds of flows through flow aggregations and deaggregations is given. Based on this calculation, it is suggested a simple criteria for flow aggregation whether the aggregation will induce an increased delay bound. The criteria is evaluated in a few realistic scenarios.

Keywords

References

  1. D. Clark, S. Shenker, and L. Zhang, Supporting Real Time Applications in an Integrated Services Packet Network: Architecture and Mechanism, in Proc. SIGCOMM '92, Sep. 1992
  2. W. Sun and K. G. Shin, End-to-End Delay Bounds for Traffic Aggregates Under Guaranteed-Rate Scheduling Algorithms, IEEE/ACM Transactions on Networking, Vol.13, No.5, Oct. 2005
  3. A. Charny and J.-Y. Le Boudec, Delay bounds in a network with aggregate scheduling, In Proc. First International Workshop of Quality of Future Internet Services (QOFIS), 2000
  4. D. Stiliadis, Traffic Scheduling in Packet-Switched Networks: Analysis, Design and Implementation, Ph.D. Dissertation, U.C. Santa Cruz, June 1996
  5. J. Joung, B. Choe, H. Jeong, and H. Ryu, Effect of Flow Aggregation on the Maximum End-to-End Delay, LNCS Vol.4208, 2006
  6. Dimitris Skyrianoglou, Nikos Passas, and Apostolis K. Salkintzis, ARROW: An Efficient Traffic Scheduling Algorithm for IEEE 802.11e HCCA, IEEE Transactions on Wireless Communications, Vol.5, No.12, Dec. 2006