More Web Proxy on the site http://driver.im/

research-article

End-to-end network QoS via scheduling of flexible resource reservation requests

Authors:

Sushant Sharma,

Dimitrios Katramatos,

Dantong YuAuthors Info & Claims

SC '11: Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis

Article No.: 68, Pages 1 - 10

https://doi.org/10.1145/2063384.2063475

Published: 12 November 2011 Publication History

Abstract

Modern data-intensive applications move vast amounts of data between multiple locations around the world. To enable predictable and reliable data transfers, next generation networks allow such applications to reserve network resources for exclusive use. In this paper, we solve an important problem (called SMR³) to accommodate multiple and concurrent network reservation requests between a pair of end sites. Given the varying availability of bandwidth within the network, our goal is to accommodate as many reservation requests as possible while minimizing the total time needed to complete the data transfers. First, we prove that SMR3 is an NP-hard problem. Then, we solve it by developing a polynomial-time heuristic called RRA. The RRA algorithm hinges on an efficient mechanism to accommodate large number of requests in an iterative manner. Finally, we show via numerical results that RRA constructs schedules that accommodate significantly larger number of requests compared to other, seemingly efficient, heuristics.

References

[1]

S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss, "An architecture for differentiated service," RFC 2475, 1998.

Digital Library

[2]

R. Braden, D. Clark, and S. Shenker, "Integrated services in the Internet architecture: An overview," RFC 1633, 1994.

Digital Library

[3]

C. Chekuri and S. Khanna, "A PTAS for the multiple knapsack problem," in Proc. ACM-SIAM SODA, pp. 213--222, Philadelphia, PA, USA, 2000.

Digital Library

[4]

E. Crawley, R. Nair, B. Rajagopalan, and H. Sandick, "A framework for QoS-based routing in the Internet," RFC 2386, 1998.

Digital Library

[5]

"Energy sciences network," URL:http://www.es.net/

[6]

M. R. Garey and D. S. Johnson, Computers and intractability, a guide to the theory of NP-completeness, W. H. Freeman & Co., New York, 1990.

Digital Library

[7]

J. Gu, D. Katramatos, X. Liu, V. Natarajan, A. Shoshani, A. Sim, D. Yu, S. Bradley, and S. McKee, "StorNet: Co-scheduling of end-to-end bandwidth reservation on storage and network systems for high-performance data transfers," in Proc. IEEE INFOCOM, Workshop on High-Speed Networks, Shanghai, China, April 10--15, 2011.

[8]

R. A. Guerin and A. Orda, "Networks with advance reservations: The routing perspective," in Proc. IEEE INFOCOM, pp. 118--127, Tel-Aviv, Israel, March 26--30, 2000

[9]

"Internet 2," URL: http://www.internet2.edu/

[10]

D. Katramatos, D. Yu, K. Shroff, S. McKee, and T. Robertazzi, "TeraPaths: End-to-end network resource scheduling in high-impact network domains," International Journal On Advances in Internet Technology, vol 3, no. 1--2, pp. 104--117, 2010.

[11]

S. Naiksatam and S. Figueira, "Elastic reservations for efficient bandwidth utilization in LambdaGrids," The International Journal of Grid Computing, vol. 23, no. 1, pp. 1--22, January 2007.

Digital Library

[12]

"ESnet On-demand Secure Circuits and Advance Reservation System (OSCARS)," URL: http://www.es.net/oscars/

[13]

"ARCHSTONE: Advanced resource computation for hybrid service and topology networks," URL: http://archstone.east.isi.edu/

[14]

K. Rajah, S. Ranka, and Y. Xia, "Advance reservation and scheduling for bulk transfers in research networks," to appear IEEE Transactions on Parallel and Distributed Systems.

Digital Library

[15]

H. D. Sherali and W. P. Adams, A reformulation-linearization technique for solving discrete and continuous nonconvex problems, Kluwer Academic Publishers, Boston, 1999.

[16]

O. Younis and S. Fahmy, "Constraint-based routing in the internet: Basic principles and recent research," IEEE Communications Surveys & Tutorials, vol. 5, no. 1, pp. 2--13, 2003.

Digital Library

[17]

L. Zhang, S. Berson, S. Herzog, and S. Jamin, "Resource reservation protocol (RSVP) -- version 1 functional specification," RFC 2205, 1997.

Cited By

Zuo L(2021)Data Transfers Using Bandwidth Reservation Through Multiple Disjoint Paths of Dynamic HPNsJournal of Network and Systems Management10.1007/s10922-021-09585-w29:3Online publication date: 16-Mar-2021
https://doi.org/10.1007/s10922-021-09585-w
Zuo LZhu M(2020)Minimize Cost of Data Transfers Using Bandwidth Reservation on FPVB Paths of Dynamic HPNs2020 International Conference on Computing, Networking and Communications (ICNC)10.1109/ICNC47757.2020.9049789(74-78)Online publication date: Feb-2020
https://doi.org/10.1109/ICNC47757.2020.9049789
Hou AWu CQiao RZuo LZhu MFang DNie WChen F(2020)QoS provisioning for various types of deadline-constrained bulk data transfers between data centersFuture Generation Computer Systems10.1016/j.future.2019.11.039105:C(162-174)Online publication date: 1-Apr-2020
https://dl.acm.org/doi/10.1016/j.future.2019.11.039
Show More Cited By

Index Terms

End-to-end network QoS via scheduling of flexible resource reservation requests

Recommendations

An end-to-end QoS framework with on-demand bandwidth reconfiguration

This paper proposes a new QoS framework, called the On-Demand QoS Path framework (ODP). It provides end-to-end QoS guarantees to individual flows with minimal overhead, while keeping the scalability characteristic of DiffServ. ODP exercises per-flow ...
Framework for parameter mapping to provide end-to-end QoS guarantees in IntServ/DiffServ architectures

With the numerous emerging real-time and multimedia applications, there has been much interest for developing mechanisms which enable real-time services over the Internet. These applications have QoS requirements. From the end-user's point of view, QoS ...
Modeling end-to-end QoS management and real time agreement protocols for resource reservation for multimedia mobile radio network

Wireless networks' Operators still face the dual face problem of end to end resource allocation management wile making efficient use of bandwidth. Relative considerations include user mobility, traffic characteristics, Quality of Service (QoS) ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

SC '11: Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis

November 2011

866 pages

ISBN:9781450307710

DOI:10.1145/2063384

Conference Chair:
Scott Lathrop
University of Chicago
,
Program Chairs:
Jim Costa
Sandia National Laboratories
,
William Kramer
National Center for Supercomputing Applications

Copyright © 2011 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGARCH: ACM Special Interest Group on Computer Architecture
IEEE-CS: Computer Society

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 November 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

U.S. Department of Energy

Conference

SC '11

Sponsor:

SIGARCH
IEEE-CS

SC '11: International Conference for High Performance Computing, Networking, Storage and Analysis

November 12 - 18, 2011

Washington, Seattle

Acceptance Rates

SC '11 Paper Acceptance Rate 74 of 352 submissions, 21%;

Overall Acceptance Rate 1,516 of 6,373 submissions, 24%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

23
Total Citations
View Citations
204
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)1

Reflects downloads up to 10 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zuo L(2021)Data Transfers Using Bandwidth Reservation Through Multiple Disjoint Paths of Dynamic HPNsJournal of Network and Systems Management10.1007/s10922-021-09585-w29:3Online publication date: 16-Mar-2021
https://doi.org/10.1007/s10922-021-09585-w
Zuo LZhu M(2020)Minimize Cost of Data Transfers Using Bandwidth Reservation on FPVB Paths of Dynamic HPNs2020 International Conference on Computing, Networking and Communications (ICNC)10.1109/ICNC47757.2020.9049789(74-78)Online publication date: Feb-2020
https://doi.org/10.1109/ICNC47757.2020.9049789
Hou AWu CQiao RZuo LZhu MFang DNie WChen F(2020)QoS provisioning for various types of deadline-constrained bulk data transfers between data centersFuture Generation Computer Systems10.1016/j.future.2019.11.039105:C(162-174)Online publication date: 1-Apr-2020
https://dl.acm.org/doi/10.1016/j.future.2019.11.039
Zuo LZhu MWu C(2018)Bandwidth Reservation Strategies for Scheduling Maximization in Dedicated NetworksIEEE Transactions on Network and Service Management10.1109/TNSM.2018.279430015:2(544-554)Online publication date: Jun-2018
https://doi.org/10.1109/TNSM.2018.2794300
Lin CBi YHan GYang JZhao HLiu Z(2018)Scheduling for Time-Constrained Big-File Transfer Over Multiple Paths in Cloud ComputingIEEE Transactions on Emerging Topics in Computational Intelligence10.1109/TETCI.2017.27556922:1(25-40)Online publication date: Feb-2018
https://doi.org/10.1109/TETCI.2017.2755692
Hou AWu CFang DZuo LZhu MZhang XQiao RYin X(2018)Bandwidth Scheduling for Big Data Transfer with Deadline Constraint between Data Centers2018 IEEE/ACM Innovating the Network for Data-Intensive Science (INDIS)10.1109/INDIS.2018.00009(55-63)Online publication date: Nov-2018
https://doi.org/10.1109/INDIS.2018.00009
Zhang XWu CZuo LHou AWang YEl-Araby EEl-Ghazawi TPanda D(2018)Bandwidth scheduling with flexible multi-paths in high-performance networksProceedings of the 18th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing10.1109/CCGRID.2018.00-69(11-20)Online publication date: 1-May-2018
https://dl.acm.org/doi/10.1109/CCGRID.2018.00-69
Wang YWu CHou A(2017)Periodic Scheduling of Deadline-Constrained Variable Slot-Bandwidth Reservations for Scientific Collaboration2017 26th International Conference on Computer Communication and Networks (ICCCN)10.1109/ICCCN.2017.8038437(1-9)Online publication date: Jul-2017
https://doi.org/10.1109/ICCCN.2017.8038437
Wang SYin ZKim SHe T(2017)Achieving Spectrum Efficient Communication under Cross-Technology Interference2017 26th International Conference on Computer Communication and Networks (ICCCN)10.1109/ICCCN.2017.8038425(1-8)Online publication date: Jul-2017
https://doi.org/10.1109/ICCCN.2017.8038425
Wang XHuang RMao S(2017)SonarBeat: Sonar Phase for Breathing Beat Monitoring with Smartphones2017 26th International Conference on Computer Communication and Networks (ICCCN)10.1109/ICCCN.2017.8038412(1-8)Online publication date: Jul-2017
https://doi.org/10.1109/ICCCN.2017.8038412
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents