1st International ICST Conference on Multimedia Services Access Networks

Research Article

Optimizing QoS aware ethernet spanning trees

  • @INPROCEEDINGS{10.1109/MSAN.2005.1489937,
        author={Tibor Cinkler and Istvan Moldovan and  Andras  Kern and Csaba Lukovszki and Gyula  Sallai},
        title={Optimizing QoS aware ethernet spanning trees},
        proceedings={1st International ICST Conference on Multimedia Services Access Networks},
        publisher={IEEE},
        proceedings_a={MSAN},
        year={2005},
        month={8},
        keywords={},
        doi={10.1109/MSAN.2005.1489937}
    }
    
  • Tibor Cinkler
    Istvan Moldovan
    Andras Kern
    Csaba Lukovszki
    Gyula Sallai
    Year: 2005
    Optimizing QoS aware ethernet spanning trees
    MSAN
    IEEE
    DOI: 10.1109/MSAN.2005.1489937
Tibor Cinkler1,2,3,*, Istvan Moldovan1,2,3,*, Andras Kern1,2,3,*, Csaba Lukovszki1,2,3,*, Gyula Sallai1,2,3,*
  • 1: Department of Telecommunications and Media Informatics
  • 2: Budapest University of Technology and Economics
  • 3: Magyar tudosok krt. 2, Budapest, Hungary H-1117
*Contact email: cinkler@tmit.bme.hu, moldovan@tmit.bme.hu, kern@tmit.bme.hu, lukovszki@tmit.bme.hu, sallai@tmit.bme.hu

Abstract

Ethernet is gaining on its importance in both access and metro networks. As a layer 2 technology, Ethernet gives a basic framework for routing, QoS and Traffic Engineering (TE), as well as a protocol for building up trees. IEEE 802.1 standards define default configuration parameters considering the topology only. In this paper we propose methods for resource management in Ethernet networks through spanning tree optimization for both STP (IEEE 802.1D) and MSTP (IEEE 802.1s). As a result of optimization we assign costs to the bridge ports in the network to build trees based on these costs via STP and MSTP. These trees yield optimized routing, TE and support for different QoS classes. We show on typical metro-access networks, that through optimization the total network throughput can be significantly increased for both cases: when enforcing fairness or when allowing starvation of some demands. This gain can be realized by simultaneously assigning demands to trees and routing these trees.