-
Chapter
Minimization of Blocking Probability
In an all-optical WDM network, the route of a pair of communication nodes usually consists of multiple hops. If a transmission can occupy the same wavelength on every hop, it can then remain in optical form wi...
-
Chapter
QоS Guaranteed Multicast
Multicast is a point to multipoint communication, by which a source node sends messages to multiple destination nodes. Multicast uses a tree structure as the route to transmit messages to multipl...
-
Article
Approximations for Steiner Trees with Minimum Number of Steiner Points
Given n terminals in the Euclidean plane and a positive constant, find a Steiner tree interconnecting all terminals with the minimum number of Steiner points such that the Euclidean length of each edge is no more...
-
Article
On Minimum-Weight k-Edge Connected Steiner Networks on Metric Spaces
For a given set of points P in a metric space, let w k(P) denote the weight of minimum-weight k-edge connected Steiner network on P divided by the weight of minimum-weight k-edge connected spanning network on P,...
-
Chapter
On Shortest K-Edge Connected Steiner Networks with Rectilinear Distance
In this paper we consider the problem of constructing a shortest k-edge connected Steiner network in the plane with rectilinear distance for k ≥ 2. Given a set of P of points, let l k(P) denote the ...
