Routing Bandwidth Guaranteed Paths with Restoration in Label Switched Networks
Dateien
Datum
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
EU-Projektnummer
DFG-Projektnummer
Forschungsförderung
Projekt
Open Access-Veröffentlichung
Sammlungen
Titel in einer weiteren Sprache
Publikationstyp
Publikationsstatus
Erschienen in
Zusammenfassung
Label switched networks have become increasingly attractive to both network providers and customers. By creating aggregate, bandwidth-reserved flows, these networks are known for their routing flexibility, predictable bandwidth usage, and quality-of-service (QoS) provisioning. This flexibility in routing enables fault-persistent QoS reservations, where connectivity and allotted bandwidth remains available, even if some links or network nodes fail. The automatic switch-over from a now-defunct path to a new, working path is known as restoration. Restoring bandwidth-guaranteed paths requires allocation of resources to be used in presence of faults, so-called backup paths. In this paper, we investigate distributed algorithms for routing with backup restoration. Specifically, we propose a new concept of Backup Load Distribution Matrix, that captures partial network state, greatly reducing the amount of routing information maintained and transmitted while achieving efficient bandwidth usage. We present and simulate two new distributed routing algorithms, which provide significant improvements in rejection rates and provide substantial savings in call setup time compared to existing algorithms.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
Schlagwörter
Konferenz
Rezension
Zitieren
ISO 690
NORDEN, Samphel, Milind M. BUDDHIKOT, Marcel WALDVOGEL, Subhash SURI, 2001. Routing Bandwidth Guaranteed Paths with Restoration in Label Switched Networks. ICNP. Riverside, California, USA, 2001. In: Proceedings / Ninth International Conference on Network Protocols (ICNP 2001). 2001, pp. 71-79BibTex
@inproceedings{Norden2001Routi-6220, year={2001}, title={Routing Bandwidth Guaranteed Paths with Restoration in Label Switched Networks}, booktitle={Proceedings / Ninth International Conference on Network Protocols (ICNP 2001)}, pages={71--79}, author={Norden, Samphel and Buddhikot, Milind M. and Waldvogel, Marcel and Suri, Subhash} }
RDF
<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/6220"> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6220/1/Routing_Bandwith_Guaranteed_paths_with_restoration_.pdf"/> <dc:creator>Waldvogel, Marcel</dc:creator> <dcterms:issued>2001</dcterms:issued> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:10:19Z</dc:date> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:10:19Z</dcterms:available> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:title>Routing Bandwidth Guaranteed Paths with Restoration in Label Switched Networks</dcterms:title> <dc:format>application/pdf</dc:format> <dcterms:abstract xml:lang="eng">Label switched networks have become increasingly attractive to both network providers and customers. By creating aggregate, bandwidth-reserved flows, these networks are known for their routing flexibility, predictable bandwidth usage, and quality-of-service (QoS) provisioning. This flexibility in routing enables fault-persistent QoS reservations, where connectivity and allotted bandwidth remains available, even if some links or network nodes fail. The automatic switch-over from a now-defunct path to a new, working path is known as restoration. Restoring bandwidth-guaranteed paths requires allocation of resources to be used in presence of faults, so-called backup paths. In this paper, we investigate distributed algorithms for routing with backup restoration. Specifically, we propose a new concept of Backup Load Distribution Matrix, that captures partial network state, greatly reducing the amount of routing information maintained and transmitted while achieving efficient bandwidth usage. We present and simulate two new distributed routing algorithms, which provide significant improvements in rejection rates and provide substantial savings in call setup time compared to existing algorithms.</dcterms:abstract> <dc:creator>Buddhikot, Milind M.</dc:creator> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6220"/> <dc:contributor>Buddhikot, Milind M.</dc:contributor> <dc:contributor>Waldvogel, Marcel</dc:contributor> <dc:contributor>Suri, Subhash</dc:contributor> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights> <dc:contributor>Norden, Samphel</dc:contributor> <dc:language>eng</dc:language> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/> <dc:creator>Norden, Samphel</dc:creator> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dc:creator>Suri, Subhash</dc:creator> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6220/1/Routing_Bandwith_Guaranteed_paths_with_restoration_.pdf"/> <dcterms:bibliographicCitation>First publ. as paper in: Proceedings / Ninth International Conference on Network Protocols (ICNP 2001), Riverside, California, USA, 2001, pp. 71-79</dcterms:bibliographicCitation> </rdf:Description> </rdf:RDF>