The Internet research community is making a great effort in order to define efficient network management and control functions. The goal is to make the best use of the network infrastructure, while meeting the users' requirements at the same time. One of the keys to achieve such a goal is the routing algorithm. A wide variety of traffic engineering and QoS routing algorithms have been proposed aiming to optimize resources and provide QoS to the users. However, the performance of such algorithms have usually been evaluated through simulations. In this paper, we present an architecture which enables to experiment with different routing algorithms in a real network. The performance of the routing algorithms can then be evaluated in terms of number of admitted flow requests, average delay, packet loss and jitter. We describe how we implemented all the components of the proposed architecture and how we setup a testbed consisting of Linux PCs. Finally, we illustrate an experiment we conducted to demonstrate the operation of our architecture.
An Architecture for Experimenting with Traffic Engineering and QoS Routing Algorithms / Avallone, Stefano; Romano, SIMON PIETRO; Ventre, Giorgio. - STAMPA. - (2007), pp. 1-10. (Intervento presentato al convegno TridentCom 2007 tenutosi a Orlando, FL (USA) nel May, 21-23) [10.1109/TRIDENTCOM.2007.4444700].
An Architecture for Experimenting with Traffic Engineering and QoS Routing Algorithms
AVALLONE, STEFANO;ROMANO, SIMON PIETRO;VENTRE, GIORGIO
2007
Abstract
The Internet research community is making a great effort in order to define efficient network management and control functions. The goal is to make the best use of the network infrastructure, while meeting the users' requirements at the same time. One of the keys to achieve such a goal is the routing algorithm. A wide variety of traffic engineering and QoS routing algorithms have been proposed aiming to optimize resources and provide QoS to the users. However, the performance of such algorithms have usually been evaluated through simulations. In this paper, we present an architecture which enables to experiment with different routing algorithms in a real network. The performance of the routing algorithms can then be evaluated in terms of number of admitted flow requests, average delay, packet loss and jitter. We describe how we implemented all the components of the proposed architecture and how we setup a testbed consisting of Linux PCs. Finally, we illustrate an experiment we conducted to demonstrate the operation of our architecture.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.