Optimizing routing schemes for fast moving users in MST-Based networks

  • Authors:

  • Filip De Greve;Frederic Van Quickenborne;Filip De Turck;Ingrid Moerman;Piet Demeester

  • Affiliations:

  • IBBT – IMEC – Department of Information Technology, Ghent University, Gent, Belgium;IBBT – IMEC – Department of Information Technology, Ghent University, Gent, Belgium;IBBT – IMEC – Department of Information Technology, Ghent University, Gent, Belgium;IBBT – IMEC – Department of Information Technology, Ghent University, Gent, Belgium;IBBT – IMEC – Department of Information Technology, Ghent University, Gent, Belgium

  • Venue:
  • EURO-NGI'05 Proceedings of the Second international conference on Wireless Systems and Network Architectures in Next Generation Internet
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

With the currently emerging trials for best-effort internet solutions on trains, solutions are required for delivering multimedia services to fast moving users. Research has already been devoted to dimensioning Ethernet aggregation networks, taking user movement into account while neglecting the experienced network performance. This paper extends this design for resilient networks and aims at minimizing packet loss and packet reordering in the dimensioning and routing process. For deployment in an Ethernet network which supports Multiple Spanning Trees (MSTs), effective path aggregation methods are proposed for finding a minimal set of spanning trees and these are thoroughly evaluated for different scenarios. Moreover the spanning tree assignment problem with predefined backup conditions is studied.