Sciweavers

84 search results - page 16 / 17
» On Degree Constrained Shortest Paths
Sort
View
PODC
1997
ACM
14 years 2 months ago
Dynamic Wavelength Allocation in Optical Networks
This paper proposes algorithms for allocation of wavelengths to connections (lightpaths) in optical wavelength division multiplexed networks, predominantly for ring topologies. Th...
Ornan Ori Gerstel, Galen H. Sasaki, Shay Kutten, R...
BROADNETS
2007
IEEE
14 years 4 months ago
Reduced flow routing: Leveraging residual capacity to reduce blocking in GMPLS networks
— Traffic engineering has been extensively studied to maximize network resource utilization while minimizing call blocking [1]. As the the demand for high data rate services ove...
Xiaolan J. Zhang, Sun-il Kim, Steven S. Lumetta
CIC
2004
118views Communications» more  CIC 2004»
13 years 11 months ago
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
Gang Feng
PVLDB
2008
154views more  PVLDB 2008»
13 years 9 months ago
Indexing land surface for efficient kNN query
The class of k Nearest Neighbor (kNN) queries is frequently used in geospatial applications. Many studies focus on processing kNN in Euclidean and road network spaces. Meanwhile, ...
Cyrus Shahabi, Lu-An Tang, Songhua Xing
IJRR
2007
181views more  IJRR 2007»
13 years 9 months ago
Optimal Rough Terrain Trajectory Generation for Wheeled Mobile Robots
An algorithm is presented for wheeled mobile robot trajectory generation that achieves a high degree of generality and efficiency. The generality derives from numerical lineariza...
Thomas M. Howard, Alonzo Kelly