Promoting the use of end-to-end congestion control in the Internet
IEEE/ACM Transactions on Networking (TON)
YESSIR: a simple reservation mechanism for the Internet
ACM SIGCOMM Computer Communication Review
Optimal policy for label switched path setup in MPLS Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
A comparison of hard-state and soft-state signaling protocols
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
A comparison of hard-state and soft-state signaling protocols
IEEE/ACM Transactions on Networking (TON)
End-to-end optimal algorithms for integrated QoS, traffic engineering, and failure recovery
IEEE/ACM Transactions on Networking (TON)
Bandwidth guaranteed routing with fast restoration against link and node failures
IEEE/ACM Transactions on Networking (TON)
Improving RSVP for Better Support of Internet Multimedia Applications
ICMCS '99 Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02
A taxonomy for congestion control algorithms in packet switching networks
IEEE Network: The Magazine of Global Internetworking
Efficient Management and Packets Forwarding for Multimedia Flows
Journal of Network and Systems Management
Fair and optimal dynamic admission control of elastic flows
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
This paper addresses the resource reservation problem in a packet switching network. REBOOK, the presented algorithm, provides deterministic, fast (real-time) dynamic resource allocation and release. Based on a stateful approach, it handles faults and network errors, and recovers from route changes and unexpected flows shutdown. The distributed scheme used to store flows information avoids the need of searching for entries within the routers' control memory when packets are received and guarantees constant complexity. REBOOK can be implemented in hardware and is compatible with any packet switching network. In the Internet, it can be integrated in TCP or used with UDP to make it network friendly. Moreover, a slightly extended implementation of RSVP can be used as signalling and hosting protocol. A software implementation as standalone protocol has been developed to prove its effectiveness, robustness, and performance.