Page
%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 ...
-
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,...
-
Book
-
Chapter
Introduction
Nowadays as more and more users start to use data networks, and their usage patterns evolve to include more and more bandwidth-intensive networking applications such as data browsing on the worldwide web, java...
-
Chapter
Wavelength Assignment
Wavelengths are limited resource in WDM networks. State-of-the-art technology allows close to 300 wavelengths in the laboratory. However, less than 64 wavelengths can be used in real systems. Thus how to make ...
-
Chapter
Placement of Wavelength Converters
The number of wavelengths available in a network is always limited due to the restriction of hardware structure of optical routers/switches. An important goal of the design of WDM networks is to use less wavel...
-
Chapter
Minimization of Wavelength Conversions
In multihop WDM networks where wavelength converters are equipped at some routing nodes, a connection between two communication nodes consists of one or more lightpaths. A wavelength conversion is required at ...
-
Chapter
Multicast under Multi-Drop Models
In the preceding chapter we have discussed how to establish QoS guaranteed multicast connections in WDM networks. It was assumed that all nodes in the network were equipped with multicast-capable optical switc...
-
Chapter
Routing for Load Balance
The load balancing problem, as one of the most significant and extensively studied problems in computer communication networks, is addressed not only in wavelength routed optical networks but also in general c...
-
Chapter
Design of Logical Topologies
As we addressed in the previous chapter, in single-hop systems of WDM networks a connection is set up by selecting a path of physical links and assigning a (reserved) wavelength to these links. Because of limi...
-
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
3-D profile measurement for complex micro-structures
Micro-structures 3-D profile measurement is an important measurement content for research on micromachining and characterization of micro-dimension. In this paper, a new method involved 2-D structure template,...
-
Article
ACO-Steiner: Ant Colony Optimization Based Rectilinear Steiner Minimal Tree Algorithm
The rectilinear Steiner minimal tree (RSMT) problem is one of the fundamental problems in physical design, especially in routing, which is known to be NP-complete. This paper presents an algorithm, called ACO-...
-
Chapter and Conference Paper
Connected Set Cover Problem and Its Applications
We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity constraint. We first propose two algorithms ...
-
Article
Dedication on the occasion of the thirtieth anniversary of the founding of Institute of Applied Mathematics
-
Article
Measurement and analysis of exhaust noise from muffler on an excavator
Through analyzing the harm of the exhaust noise from the excavator, this paper illuminated the importance of the noise measurement and analysis work,. According to some correlative measurement standards, using...
-
Article
Improved algorithm for broadcast scheduling of minimal latency in wireless ad hoc networks
A wide range of applications for wireless ad hoc networks are time-critical and impose stringent requirement on the communication latency. One of the key communication operations is to broadcast a message from...
-
Article
Risk models for the Prize Collecting Steiner Tree problems with interval data
Given a connected graph G = (V,E) with a nonnegative cost on each edge in E, a nonnegative prize at each vertex in V, and a target set V′ ⊆ V, the Prize Collecting Steiner Tree (PCST) problem is to find a tree T ...
