Benchmarking of Signaling Based Resource Reservation in the Internet

Authors:
István Cselényi;Gábor Fehér;Krisztián Németh
Affiliations:
-;-;-
Venue:
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
Year:
2000

Citing 1
Cited 0

A case for dynamic sender-based reservations in the Internet

Journal of High Speed Networks - Special issue on quality of service routing and signaling

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates the scalability limitations of IP resource reservation protocols using RSVP and Boomerang as examples. The memory and processing time consumption of signaling message primitives were measured as a function of the total number of concurrent reservation sessions on PC-based routers running Linux and on a commercial router. The signaling handling algorithm of the implementations were analyzed as well and critical operations were identified. Our results show that CPU time is a more significant scalability concern than the router memory and also that the former is very dependent on the implementation and complexity of the signaling algorithm. Thus the same Linux PC can handle Boomerang reservation requests several hundred times faster than RSVP requests.