About: Reconfiguration of the routing in WDM networks with two classes of services

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Reconfiguration of the routing in WDM networks with two classes of services Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	In WDM backbone networks, the traffic pattern evolves constantly, and a simple policy leads to a poor usage of resources and so to a higher blocking probability. Therefore, it is important to regularly reconfigure the network by rerouting established connections in order to optimize the usage of network resources. In this paper, we consider the network reconfiguration problem that consists in switching existing connections one after the other from the current routing to a new pre-computed routing. In this setting, the network reconfiguration problem consists in going from a routing to another one given that some priority connections cannot be interrupted. Here, we first extend this model to handle priority connections. Then we identify cases where no solution exists. We prove that the reconfiguration problem with priority connections can be reduced to the problem without this constraint. Finally, we propose a new heuristic algorithm that improves upon previous proposals. In WDM backbone networks, the traffic pattern evolves constantly, and a simple policy leads to a poor usage of resources and so to a higher blocking probability. Therefore, it is important to regularly reconfigure the network by rerouting established connections in order to optimize the usage of network resources. In this paper, we consider the network reconfiguration problem that consists in switching existing connections one after the other from the current routing to a new pre-computed routing. In this setting, the network reconfiguration problem consists in going from a routing to another one given that some priority connections cannot be interrupted. Here, we first extend this model to handle priority connections. Then we identify cases where no solution exists. We prove that the reconfiguration problem with priority connections can be reduced to the problem without this constraint. Finally, we propose a new heuristic algorithm that improves upon previous proposals. (en)
Title	Reconfiguration of the routing in WDM networks with two classes of services Reconfiguration of the routing in WDM networks with two classes of services (en)
skos:prefLabel	Reconfiguration of the routing in WDM networks with two classes of services Reconfiguration of the routing in WDM networks with two classes of services (en)
skos:notation	RIV/00216208:11320/09:00206577!RIV10-MSM-11320___
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(1M0545), Z(MSM0021620838)
http://linked.open...vai/riv/dodaniDat	2010
http://linked.open...aciTvurceVysledku	Sereni, Jean-Sebastien
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Univerzita Karlova v Praze / Matematicko-fyzikální fakulta
http://linked.open...dnocenehoVysledku	338389
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/09:00206577
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Reconfiguration; routing; networks; classes; services (en)
http://linked.open.../riv/klicoveSlovo	Reconfiguration services networks routing classes
http://linked.open...ontrolniKodProRIV	[A33A22793AFF]
http://linked.open...v/mistoKonaniAkce	New-Jersey, USA
http://linked.open...i/riv/mistoVydani	New-Jersey, USA
http://linked.open...i/riv/nazevZdroje	Proceedings of the 13th International Conference on Optical Networking Design and Modeling (ONDM 2009)
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	5 (xsd:int)
http://linked.open...vavai/riv/projekt	Institute for Theoretical Computer Science
http://linked.open...UplatneniVysledku	2009
http://linked.open...iv/tvurceVysledku	Sereni, Jean-Sebastien Coudert, D. Huc, F. Mazauric, D. Nisse, N.
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open...ain/vavai/riv/wos	000271704900025
http://linked.open.../riv/zahajeniAkce	2009-01-01 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Moderní metody, struktury a systémy informatiky
number of pages	6 (xsd:int)
http://purl.org/ne...btex#hasPublisher	IEEE
https://schema.org/isbn	978-1-4244-4187-7
http://localhost/t...ganizacniJednotka	11320

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 77 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software