• Traffic grooming on the path

Treffer: Traffic grooming on the path

Title:
Traffic grooming on the path
Authors:
BERMOND, Jean-Claude, BRAUD, Laurent, COUDERT, David
Source:
Structural information and communication complexity (SIROCCO 2005)Theoretical computer science. 384(2-3):139-151
Publisher Information:
Amsterdam: Elsevier, 2007.
Publication Year:
2007
Physical Description:
print, 30 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Combinatoire. Structures ordonnées, Combinatorics. Ordered structures, Combinatoire, Combinatorics, Plans d'expériences et configurations, Designs and configurations, Théorie des graphes, Graph theory, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Recherche information. Graphe, Information retrieval. Graph, Divers, Miscellaneous, Conception, Design, Diseño, Contrainte, Constraint, Coacción, Coût, Costs, Coste, Informatique théorique, Computer theory, Informática teórica, Largeur bande, Bandwidth, Anchura banda, Longueur onde, Wavelength, Longitud onda, Multiplexeur, Multiplexer, Multiplexor, Noeud, Node, Nudo, Partition, Partición, Routage réseau, Network routing, Réseau, Network, Red, Trafic, Traffic, Tráfico, Transmission, Transmisión, 05Bxx, 05C78, 68R10, Design theory, Graph, Traffic grooming, WDM
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Mascotte Project, 13S (CNRS/UNSA) and INRIA, Sophia-Antipolis, France
ENS-Lyon, Lyon, France
ISSN:
0304-3975
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=19109039
Rights:
Copyright 2008 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems

Mathematics
Accession Number:
edscal.19109039
Database:
PASCAL Archive

Weitere Informationen

In a WDM network, routing a request consists in assigning it a route in the physical network and a wavelength. If each request uses at most 1/C of the bandwidth of the wavelength, we will say that the grooming factor is C. That means that on a given edge of the network we can groom (group) at most C requests on the same wavelength. With this constraint the objective can be either to minimize the number of wavelengths (related to the transmission cost) or minimize the number of Add Drop Multiplexers (shortly ADM) used in the network (related to the cost of the nodes). We consider here the case where the network is a path on N nodes, PN. Thus the routing is unique. For a given grooming factor C minimizing the number of wavelengths is an easy problem, well known and related to the load problem. But minimizing the number of ADMs is NP-complete for a general set of requests and no results are known. Here we show how to model the problem as a graph partition problem and using tools of design theory we completely solve the case where C = 2 and where we have a static uniform all-to-all traffic (one request for each pair of vertices).