TY - GEN
T1 - Optimizing circuit allocation for bandwidth reservations in dynamic virtual circuit networks
AU - Shi, Li
AU - Sharma, Sushant
AU - Katramatos, Dimitrios
AU - Yu, Dantong
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2015/3/26
Y1 - 2015/3/26
N2 - Modern research and education networks, such as ESnet and Internet2, offer the capability to increase the reliability and predictability of big data transfers through the reservation of bandwidth in the form of dynamic (on-demand) virtual circuits interconnecting pairs of geographically distant end sites. Because each end site utilizes a circuit in the same manner as a VLAN, the number of circuits that can be simultaneously active is limited. In this paper, we address the problem of maximizing the number of bandwidth reservations that can be serviced by a set of virtual circuits while minimizing the number of required virtual circuits. We develop an algorithm, called CA, that solves this problem and compare its performance with a simplified version, called S-CA, and a baseline FCFS algorithm, through both offline and online simulations. We demonstrate that CA performs up to 30% better than S-CA and up to three times better than FCFS.
AB - Modern research and education networks, such as ESnet and Internet2, offer the capability to increase the reliability and predictability of big data transfers through the reservation of bandwidth in the form of dynamic (on-demand) virtual circuits interconnecting pairs of geographically distant end sites. Because each end site utilizes a circuit in the same manner as a VLAN, the number of circuits that can be simultaneously active is limited. In this paper, we address the problem of maximizing the number of bandwidth reservations that can be serviced by a set of virtual circuits while minimizing the number of required virtual circuits. We develop an algorithm, called CA, that solves this problem and compare its performance with a simplified version, called S-CA, and a baseline FCFS algorithm, through both offline and online simulations. We demonstrate that CA performs up to 30% better than S-CA and up to three times better than FCFS.
UR - http://www.scopus.com/inward/record.url?scp=84928041661&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84928041661&partnerID=8YFLogxK
U2 - 10.1109/ICCNC.2015.7069451
DO - 10.1109/ICCNC.2015.7069451
M3 - Conference contribution
AN - SCOPUS:84928041661
T3 - 2015 International Conference on Computing, Networking and Communications, ICNC 2015
SP - 817
EP - 823
BT - 2015 International Conference on Computing, Networking and Communications, ICNC 2015
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2015 International Conference on Computing, Networking and Communications, ICNC 2015
Y2 - 16 February 2015 through 19 February 2015
ER -