Results 1  10
of
130
Traffic Grooming in Star Networks
 In Proceedings of the First Traffic Grooming Workshop
, 2004
"... We study the traffic grooming problem on WDM networks with the physical topology of a star. In star networks, several nodes are connected to a single hub directly through a bidirectional optical fiber, but are not connected to each other. Previous studies concentrated on the objective of minimizing ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
We study the traffic grooming problem on WDM networks with the physical topology of a star. In star networks, several nodes are connected to a single hub directly through a bidirectional optical fiber, but are not connected to each other. Previous studies concentrated on the objective
Traffic Grooming in Path, Star, and Tree Networks: Complexity Bounds and Algorithms
, 2004
"... We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the wellknown logical topology design, and is concerned with the development of techniques for combining low speed traffic components onto high speed channels in order to minimize netw ..."
Abstract

Cited by 41 (12 self)
 Add to MetaCart
network cost. Our contribution is twofold. In the first part of the paper we present a wealth of results which settle the complexity of traffic grooming in path and star networks, by proving that a number of variants of the problem are computationally intractable. Since routing and wavelength assignment
On Optimal Traffic Grooming in Elemental Network Topologies
 In Proceeding of Opticomm 2003
, 2003
"... We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the wellknown logical topology design problem, and is concerned with the development of techniques for combining low speed traffic components onto high speed channels in order to minim ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
to minimize network cost. Our contribution is twofold. In the first part of the paper we settle the complexity of traffic grooming in path and star networks by proving that a number of variants of the problem are computationally hard. Since routing and wavelength assignment in these two topologies is trivial
Traffic Grooming on the Path
"... 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 ..."
Abstract

Cited by 15 (7 self)
 Add to MetaCart
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 ADM’s is NPcomplete for a general set of requests and no results
Hardness and approximation of traffic grooming
 IN THE 18TH INTERNATIONAL SYMPOSIUM ON ALGORITHMS AND COMPUTATION (ISAAC 2007
, 2007
"... Traffic grooming is a central problem in optical networks. It refers to pack low rate signals into higher speed streams, in order to improve bandwidth utilization and reduce network cost. In WDM networks, the most accepted criterion is to minimize the number of electronic terminations, namely the n ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
Traffic grooming is a central problem in optical networks. It refers to pack low rate signals into higher speed streams, in order to improve bandwidth utilization and reduce network cost. In WDM networks, the most accepted criterion is to minimize the number of electronic terminations, namely
Abstract IYER, PRASHANT. The Complexity of Traffic Grooming in Optical Path Networks with Egress
"... We consider the problem of minimizing network costs when grooming traffic in optical networks that support Wavelength Division Multiplexing (WDM). While the general problem has been shown to be NPHard for a number of cost measures, there still exist restricted problems for which no complexity bound ..."
Abstract
 Add to MetaCart
We consider the problem of minimizing network costs when grooming traffic in optical networks that support Wavelength Division Multiplexing (WDM). While the general problem has been shown to be NPHard for a number of cost measures, there still exist restricted problems for which no complexity
Approximating the Traffic Grooming Problem in Tree and Star Networks (Extended Abstract)
, 2006
"... We consider the problem of grooming paths in alloptical networks with tree topology so as to minimize the switching cost, measured by the total number of used ADMs. We first present efficient approximation algorithms with approximation factor of 2ln(δ · g)+o(ln(δ · g)) for any fixed node degree b ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
bound δ and grooming factor g, and2lng + o(ln g) in unbounded degree directed trees, respectively. In the attempt of extending our results to general undirected trees we completely characterize the complexity of the problem in star networks by providing polynomial time optimal algorithms for g ≤ 2
Survivable impairmentaware traffic grooming . . .
"... Wavelength Division Multiplexing (WDM) optical networks offer a large amount of bandwidth using multiple, but independent wavelength channels (or lightpaths), each operating at several Gb/s. Since the traffic between users is usually only a fraction of the capacity offered by a wavelength, several i ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
rings, which are among the most widely deployed optical network topologies. We first show that the survivable impairmentaware traffic grooming problem, where the objective is to minimize the total cost of grooming and regeneration, is NPhard. We then provide approximation algorithms (for uniform
Hierarchical Traffic Grooming in LargeScale WDM Networks
, 2005
"... The advances in fiber optics and wavelength division multiplexing (WDM) technology are viewed as the key to satisfying the datadriven bandwidth demand of today’s Internet. The mismatch of bandwidths between user needs and wavelength capacity makes it clear that some multiplexing should be done to u ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
aim at minimizing the LTE cost to directly target on minimizing the network cost. We look into the grooming problem in elemental topologies as a starting point. First, we conduct proofs to show that traffic grooming in path, ring and star topology networks with the cost function we consider is NP
GROOMING IN WDM NETWORKS
, 2001
"... Wavelength division multiplexing (WDM) in optical fiber networks is widely viewed as the technology with the potential to satisfy the everincreasing bandwidth needs of network users effectively and on a sustained basis. In WDM networks, nodes are equipped with optical crossconnects (OXCs), devices ..."
Abstract
 Add to MetaCart
speed components onto available wavelengths in order to meet network design goals such as cost minimization. Traffic grooming is a hard problem in general which remains computationally intractable even for simple networks. We consider the problem of traffic grooming in ring, star and tree topologies. We
Results 1  10
of
130