Novel Dynamic Delay Allocation Adjustment for Improving Bandwidth Efficiency Export

@article{citeulike:6049227, abstract = {End-to-end delay guarantees are critical to many delay-sensitive applications. To ensure such a guarantee on a flow path, the existing approaches usually statically divide its end-to-end delay requirement into per-hop delay requirements. However, such static path-level resource allocations often cause unbalanced resource reservations and bottlenecks in a network as shown in this paper, limit the total number of sessions accommodated in the network, and result in low network utilization. To address this issue, we propose a Dynamic Allocation Adjustment (DAA) approach to improve bandwidth efficiency by spreading loads over a flow path and other related links not on the path. Our simulation results show that DAA is able to significantly increase the total number of flows admitted into a network by 30\% or more, compared with the best existing solution. Furthermore, it efficiently utilizes bandwidth by greatly reducing the average flow reservation at a link and the total resources reserved for a flow on its entire path.}, author = {Dong, Yingfei and Liu, Xiaojiang}, citeulike-article-id = {6049227}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.comcom.2009.10.009}, citeulike-linkout-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0140366409002746}, day = {25}, doi = {10.1016/j.comcom.2009.10.009}, issn = {01403664}, journal = {Computer Communications}, month = {October}, posted-at = {2009-10-31 17:09:57}, title = {Novel Dynamic Delay Allocation Adjustment for Improving Bandwidth Efficiency}, url = {http://dx.doi.org/10.1016/j.comcom.2009.10.009}, year = {2009} }

TY - JOUR ID - citeulike:6049227 L3 - citeulike-article-id:6049227 N2 - End-to-end delay guarantees are critical to many delay-sensitive applications. To ensure such a guarantee on a flow path, the existing approaches usually statically divide its end-to-end delay requirement into per-hop delay requirements. However, such static path-level resource allocations often cause unbalanced resource reservations and bottlenecks in a network as shown in this paper, limit the total number of sessions accommodated in the network, and result in low network utilization. To address this issue, we propose a Dynamic Allocation Adjustment (DAA) approach to improve bandwidth efficiency by spreading loads over a flow path and other related links not on the path. Our simulation results show that DAA is able to significantly increase the total number of flows admitted into a network by 30% or more, compared with the best existing solution. Furthermore, it efficiently utilizes bandwidth by greatly reducing the average flow reservation at a link and the total resources reserved for a flow on its entire path. JF - Computer Communications SN - 01403664 TI - Novel Dynamic Delay Allocation Adjustment for Improving Bandwidth Efficiency AU - Dong, Yingfei AU - Liu, Xiaojiang PY - 2009/10/25/ UR - http://dx.doi.org/10.1016/j.comcom.2009.10.009 ER -