International Journal of Information Technology & Computer Science ( IJITCS )
Joint Buffer Management and Scheduling (JoBS) algorithm is known for its services in providing loss and delay differentiation independently at each node. Though JoBS have encompassed the main network parameters, another crucial element with respect to network performance namely capacity or bandwidth has not been addressed in term of its limitation. This paper aims to provide the fundamental idea of incorporating bandwidth constraints provisioning in addition to the existing constraints. This proposal is expected to be realized through simulation studies in upcoming work
: Scheduling, buffer management, capacity, bandwidth
- J. Liebeherr, and N. Christin, “JoBS: Joint buffer management and scheduling for differentiated services,” In Proceedings of IWQOS 2001.
- A. Kaur, “An overview of quality of service computer network”, Indian Journal of Computer Science and Engineering (IJCSE), 2011.
- M. Hossien Yaghmaee, “A proportional jitter scheduling and buffer management algorithm for differentiated service network” Journal Of Networks, Vol. 3, No. 8, November 2008.
- O. Gherman, and O. Vulvur, ,“Analysis of Grid scheduler with resource allocation”, 2010.
- G. Liebl, H. Jenkac, T. Stockhammer, and C. Buchner, “Joint buffer management and scheduling for wireless video streaming”, ICN'05, 2005.
- S. Sivavakeesar, and G. Pavlou, “Rate allocation and buffer management for proportional service differentiation in location-aided ad-hoc networks,” WWIC'05, 2005.
- “Capacity and utilization bandwidth”, R-C-TD LM Ericcson, 2008.
- J. F. Kurose, and K. W. Ross, Computer networking a top down approach Featuring the internet (2nd edn). Pearson: Addison Wesley, 2004
- R. Blum, Network performance open source toolkit: using Netperf, tcptrace, NISTnet, and SSFNet, 2003.
- P. Chimento, and J. Ishac, “Defining network capacity,” RFC 5136, February 2008.