SIGCOMM '92 Conference proceedings on Communications architectures & protocols
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Generalized Guaranteed Rate Scheduling Algorithms: A Framework
Generalized Guaranteed Rate Scheduling Algorithms: A Framework
Efficient network QoS provisioning based on per node traffic shaping
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
Generalized guaranteed rate scheduling algorithms: a framework
IEEE/ACM Transactions on Networking (TON)
A hierarchical fair service curve algorithm for link-sharing, real-time and priority services
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
IEEE/ACM Transactions on Networking (TON)
Providing deterministic delay guarantees in ATM networks
IEEE/ACM Transactions on Networking (TON)
Packet routing with arbitrary end-to-end delay requirements
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Instability of FIFO in session-oriented networks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The effects of temporary sessions on network performance
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Real-Time Transport of MPEG Video with a Statistically Guaranteed Loss Ratio in ATM Networks
IEEE Transactions on Parallel and Distributed Systems
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Traffic Shaping at a Network Node: Theory, Optimum Design, Admission Control
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
General Methodology for Designing Efficient Traffic Scheduling and Shaping Algorithms
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Efficient Admission Control for EDF Schedulers
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Instability of FIFO in session-oriented networks
Journal of Algorithms - Special issue: SODA 2000
Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule
Journal of Algorithms
Source routing and scheduling in packet networks
Journal of the ACM (JACM)
EUROMICRO '05 Proceedings of the 31st EUROMICRO Conference on Software Engineering and Advanced Applications
Wireless Personal Communications: An International Journal
Instability of FIFO in the permanent sessions model at arbitrarily small network loads
ACM Transactions on Algorithms (TALG)
Minimizing end-to-end delay in wireless networks using a coordinated EDF schedule
INFOCOM'10 Proceedings of the 29th conference on Information communications
Efficient network QoS provisioning based on per node traffic shaping
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
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
Approximation algorithms for throughput maximization in wireless networks with delay constraints
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
This paper addresses the problem of providing perconnection end-to-end delay guarantees in a high-speed network. We assume that the network is connection oriented and enforces some admission control which ensures that ihe source traffic conforms to specified traffic characteristics. W e concentrate on the class of Rate-Controlled Service (RCS) disciplines, in which traffic from each connection is reshaped at every hop, and develop end-to-end delay bounds for the general case where different reshapers are used at each hop. In addition, we establish that these bounds can also be achieved when the shapers at each hop have the same "minimal" envelope. The main disadvantage of this class of service disciplines is that the end-to-end delay guarantees are obtained as the sum of the worst case delays at each node, but we show that this problem can be alleviated through "Proper" reshaping of the trafic. We illustrate the impact of this reshaping by demonstrating its use in designing RCS disciplines that outperform GPS-based service disciplines.