Cost-effective Ethernet routing schemes for dynamic environments

Design of aggregation networks for delivering multimedia services to fast moving users is an interesting topic. Research has already been devoted to the dimensioning taking into account the movement of the users. However, the effects of packet loss and packet reordering when switching paths have not been taken into account before. This paper presents a design method that aims at minimizing packet loss and packet reordering in the dimensioning and routing process. Consequently, various routing techniques are presented and their performance is thoroughly compared. The results show that for some routing strategies only a slight extra installation cost is required for guaranteeing minimal packet loss and reordering. Deployment of routing schemes in Ethernet networks requires mapping of the calculated routes on different spanning tree instances. A path aggregation algorithm is presented that forms a minimal set of spanning tree instances out of a set of routing paths.

[1]  Filip De Turck,et al.  On the management of aggregation networks with rapidly moving traffic demands , 2005, 2005 9th IFIP/IEEE International Symposium on Integrated Network Management, 2005. IM 2005..

[2]  Filip De Turck,et al.  Optimization Models for Designing Aggregation Networks to Support Fast Moving Users , 2004, EuroNGI Workshop.

[3]  Tzi-cker Chiueh,et al.  Viking: a multi-spanning-tree Ethernet architecture for metropolitan area and cluster networks , 2004, IEEE INFOCOM 2004.

[4]  Andrew T. Campbell,et al.  An overview of cellular IP , 1999, WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466).

[5]  Mario Gerla,et al.  QoS-aware multiple spanning tree mechanism over a bridged LAN environment , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[6]  EDDIE KOHLER,et al.  The click modular router , 2000, TOCS.