Towards resource-optimal routing plans for real-time traffic

Authors:
Alessandro Lori;Giovanni Stea;Gigliola Vaglini
Affiliations:
Dipartimento di Ingegneria dellíInformazione, University of Pisa, Pisa, Italy;Dipartimento di Ingegneria dellíInformazione, University of Pisa, Pisa, Italy;Dipartimento di Ingegneria dellíInformazione, University of Pisa, Pisa, Italy
Venue:
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Year:
2010

Citing 19
Cited 0

Virtual clock: a new traffic control algorithm for packet switching networks

SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round-robin

IEEE/ACM Transactions on Networking (TON)
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks

IEEE/ACM Transactions on Networking (TON)
Latency-rate servers: a general model for analysis of traffic scheduling algorithms

IEEE/ACM Transactions on Networking (TON)
Routing with end-to-end QoS guarantees in broadband networks

IEEE/ACM Transactions on Networking (TON)
Optimal partition of QoS requirements on unicast paths and multicast trees

IEEE/ACM Transactions on Networking (TON)
Traffic Engineering with MPLS

Traffic Engineering with MPLS
Tradeoffs between low complexity, low latency, and fairness with deficit round-robin schedulers

IEEE/ACM Transactions on Networking (TON)
Optimal and heuristic algorithms for quality-of-service routing with multiple constraints

Performance Evaluation
Tight end-to-end per-flow delay bounds in FIFO multiplexing sink-tree networks

Performance Evaluation
Stochastic Network Calculus

Stochastic Network Calculus
WF2Q: worst-case fair weighted fair queueing

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Optimal link scheduling for real-time traffic in wireless mesh networks in both per-flow and per-path frameworks

WOWMOM '10 Proceedings of the 2010 IEEE International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)
Optimal Network Rate Allocation under End-to-End Quality-of-Service Requirements

IEEE Transactions on Network and Service Management
A framework for end-to-end deterministic-delay service provisioning in multiservice packet networks

IEEE Transactions on Multimedia
Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications

IEEE Journal on Selected Areas in Communications
Eligibility-based Round Robin for fair and efficient packet scheduling in wormhole switching networks

IEEE Transactions on Parallel and Distributed Systems
An overview of quality of service routing for next-generation high-speed networks: problems and solutions

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss the issue of computing resource-optimal routing plans in a network domain. Given a number of known traffic demands, with associated required delays, we discuss how to route them and allocate resources for them at each node so that the demands are satisfied. While a globally optimal routing plan requires joint computation of the paths and of the associated resources (which was claimed to be NP-hard), in this paper we stick to existing approaches for path computation, and use mathematical programming to model resource allocation once the paths are computed. We show that the problem is either convex or non-convex, depending on the scheduling algorithms adopted at the nodes. Our results show that, by computing resources per-path, instead of globally, the available capacity can be exceeded even at surprisingly low utilizations.