End-to-end arguments in system design
ACM Transactions on Computer Systems (TOCS)
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
BGP routing stability of popular destinations
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
ICCC '02 Proceedings of the 15th international conference on Computer communication
Network Congestion Control: Managing Internet Traffic (Wiley Series on Communications Networking & Distributed Systems)
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
REBOOK: A Deterministic, Robust and Scalable Resource Booking Algorithm
Journal of Network and Systems Management
On content-centric router design and implications
Proceedings of the Re-Architecting the Internet Workshop
RSVP: a new resource ReSerVation Protocol
IEEE Network: The Magazine of Global Internetworking
Fair and optimal dynamic admission control of elastic flows
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Well known requirements for handling multimedia flows in routers are resource reservation and fast packets forwarding. The former takes into account the quite stable and long lasting bandwidth occupation, whereas the latter takes into account the large number of packets routed along the same path. Many techniques have been proposed and standardized to face these requirements, but their application is often complex, expensive and sometimes limited by the need of agreements between network managers of the many networks and Autonomous Systems. This paper introduces IMFM (Integrated Multimedia Flows Management), an innovative, scalable, and extremely lightweight technique to provide routers deterministic and dynamic resource reservation and a fast forwarding table lookup. It is based on a distributed linked data structure that allows direct (searchless) access to entries in the routers' tables, extending the resource reservation algorithm REBOOK. Unlike conventional virtual circuits, IMFM does not require any interaction with (nor change in) the underlying routing protocols and autonomously recovers from errors, faults and route changes. If information stored in its data structure becomes obsolete, packet handling is reverted to best-effort, lookup-driven forwarding, so that packets are never dropped nor misrouted. IMFM can be gradually deployed, providing a framework for congestion avoidance solutions and increasing the forwarding speed in IMFM-aware router even along partially IMFM-unaware paths. IMFM has been fully implemented. Experiments have been designed to demonstrate its feasibility and the measured performance is reported and compared with existing techniques.