Results 1  10
of
48
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
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
Bounds on Traffic Grooming in Star and Tree Networks
, 2001
"... We consider the problem of grooming traffic in WDM star and tree networks to minimize equipment cost. We prove an important result regarding wavelength assignment in both topologies. We present a series of lower and upper bounds on the optimal solutions for both star and tree networks. The bounds al ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We consider the problem of grooming traffic in WDM star and tree networks to minimize equipment cost. We prove an important result regarding wavelength assignment in both topologies. We present a series of lower and upper bounds on the optimal solutions for both star and tree networks. The bounds
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
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
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
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
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
Star: Steinertree approximation in relationship graphs
 IN ICDE
, 2009
"... Large graphs and networks are abundant in modern information systems: entityrelationship graphs over relational data or Webextracted entities, biological networks, social online communities, knowledge bases, and many more. Often such data comes with expressive node and edge labels that allow an i ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
, this translates into computing the best Steiner trees between the given nodes, a classical NPhard problem. In this paper, we present a new approximation algorithm, coined STAR, for relationship queries over large relationship graphs. We prove that for n query entities, STAR yields an O(log(n))approximation
STAR: Steiner Tree Approximation in RelationshipGraphs
, 2008
"... We would like to thank Gerard de Melo for the thorough proof reading of Largescale graphs and networks are abundant in modern information systems: entityrelationship graphs over relational data or Webextracted entities, biological networks, social online communities, knowledge bases, and many mor ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
block for many search, ranking, and analysis tasks. From an algorithmic point of view, this translates into computing the best Steiner trees between the given nodes, a classical NPhard problem. In this paper, we present a new approximation algorithm, coined STAR, for relationship queries over large
Minimum Wavelength Assignment for Multicast Traffic in AllOptical WDM Tree Networks
"... Abstract — We study the problem of assigning wavelengths to a given set of multicast traffic requests with the objective of minimizing the number of wavelengths used per fiber. We assume that the underlying optical network is a tree and that alloptical networking paradigm is employed. First, we pro ..."
Abstract
 Add to MetaCart
Abstract — We study the problem of assigning wavelengths to a given set of multicast traffic requests with the objective of minimizing the number of wavelengths used per fiber. We assume that the underlying optical network is a tree and that alloptical networking paradigm is employed. First, we
Approximation Algorithms for the Traveling Purchaser Problem and its Variants in Network Design
, 1999
"... . The traveling purchaser problem is a generalization of the traveling salesman problem with applications in a wide range of areas including network design and scheduling. The input consists of a set of markets and a set of products. Each market offers a price for each product and there is a cos ..."
Abstract

Cited by 27 (6 self)
 Add to MetaCart
location, set cover and group Steiner tree problems as its special cases. We give an approximation algorithm with a polylogarithmic worstcase ratio for the traveling purchaser problem with metric travel costs. For a special case of the problem that models the ringstar network design problem, we
Efficient mapping of virtual networks onto a shared substrate
, 2006
"... Virtualization has been proposed as a vehicle for overcoming the growing problem of internet ossification [1]. This paper studies the problem of mapping diverse virtual networks onto a common physical substrate. In particular, we develop a method for mapping a virtual network onto a substrate networ ..."
Abstract

Cited by 51 (2 self)
 Add to MetaCart
network in a costefficient way, while allocating sufficient capacity to virtual network links to ensure that the virtual network can handle any traffic pattern allowed by a general set of traffic constraints. Our approach attempts to find the best topology in a family of backbonestar topologies
Results 1  10
of
48