This paper addresses the problem of evaluating routing algorithms via simulation in packet-switched networks when elastic traffic is involved. It highlights some deficiencies of classical approaches that fail to capture both the complex interactions of connections traversing multiple bottlenecks and common user behaviors. The paper describes an approach devised to overcome these limitations which is particularly suited for the evaluation of routing algorithms in presence of best-effort traffic. The simulation results presented offer a deeper insight into well-known routing algorithms. Through this analysis it is clear that quantitative and also qualitative behaviors of dynamic routing algorithms based on traffic measurements may be fairly different depending on the nature of the traffic loading the network, as well as depending on its interactions with the network parameters and behavior
A Realistic Model to Evaluate Routing Algorithms in the Internet / Casetti, CLAUDIO ETTORE; LO CIGNO, R; Mellia, Marco; Munafo', MAURIZIO MATTEO; Zsoka, Z.. - STAMPA. - 3:(2001), pp. 1882-1885. (Intervento presentato al convegno Global Telecommunications Conference, 2001. GLOBECOM '01. IEEE tenutosi a San Antonio, Texas nel November 25-29, 2001) [10.1109/GLOCOM.2001.965901].
A Realistic Model to Evaluate Routing Algorithms in the Internet
CASETTI, CLAUDIO ETTORE;MELLIA, Marco;MUNAFO', MAURIZIO MATTEO;
2001
Abstract
This paper addresses the problem of evaluating routing algorithms via simulation in packet-switched networks when elastic traffic is involved. It highlights some deficiencies of classical approaches that fail to capture both the complex interactions of connections traversing multiple bottlenecks and common user behaviors. The paper describes an approach devised to overcome these limitations which is particularly suited for the evaluation of routing algorithms in presence of best-effort traffic. The simulation results presented offer a deeper insight into well-known routing algorithms. Through this analysis it is clear that quantitative and also qualitative behaviors of dynamic routing algorithms based on traffic measurements may be fairly different depending on the nature of the traffic loading the network, as well as depending on its interactions with the network parameters and behaviorPubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/1662548
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo