Sciweavers

290 search results - page 38 / 58
» Network as a Computer: Ranking Paths to Find Flows
Sort
View
COMCOM
2008
103views more  COMCOM 2008»
14 years 10 months ago
Fast reroute with pre-established bypass tunnel in MPLS
Internet IP networks utilize multiple-protocol label switching (MPLS), which provides a reliable label switched path (LSP). LSP in MPLS domains needs one label at each Ingress lab...
Wei Kuang Lai, Zhen Chang Zheng, Chen-Da Tsai
IPPS
1998
IEEE
15 years 2 months ago
Capturing the Connectivity of High-Dimensional Geometric Spaces by Parallelizable Random Sampling Techniques
Abstract. Finding paths in high-dimensional gemetric spaces is a provably hard problem. Recently, a general randomized planning scheme has emerged as an e ective approach to solve ...
David Hsu, Lydia E. Kavraki, Jean-Claude Latombe, ...
IPPS
1998
IEEE
15 years 2 months ago
Optimally Locating a Structured Facility of a Specified Length in a Weighted Tree Network
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified...
Shan-Chyun Ku, Biing-Feng Wang
AINA
2004
IEEE
15 years 1 months ago
A GA-based Multi-purpose Optimization Algorithm for QoS Routing
The routing algorithms for multimedia communication should use for routing more than one QoS parameter. This is because new services such as video on demand and remote meeting sys...
Akio Koyama, Leonard Barolli, Kazunori Matsumoto, ...
LCN
2003
IEEE
15 years 3 months ago
Scheduling Resources in Programmable and Active Networks Based on Adaptive Estimations
In active and programmable networks, packet processing could be accomplished in the router within the data path. For efficient resource allocation in such networks, the packet sch...
Fariza Sabrina, Sanjay Jha