Sciweavers

1815 search results - page 99 / 363
» Path Planning for Network Performance
Sort
View
ICDCS
2010
IEEE
13 years 10 months ago
Minimizing Probing Cost and Achieving Identifiability in Network Link Monitoring
Continuously monitoring the link performance is important to network diagnosis. Recently, active probes sent between end systems are widely used to monitor the link performance. I...
Qiang Zheng, Guohong Cao
INFOCOM
2007
IEEE
14 years 2 months ago
Finding Minimum-Cost Paths with Minimum Sharability
Abstract— In communication networks, multiple communication paths sharing minimum number of links or/and nodes may be desirable for improved performance, resource utilization and...
Si-Qing Zheng, Bing Yang, Mei Yang, Jianping Wang
GECCO
2006
Springer
200views Optimization» more  GECCO 2006»
14 years 6 hour ago
A new approach for shortest path routing problem by random key-based GA
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
Mitsuo Gen, Lin Lin
28
Voted
APNOMS
2006
Springer
14 years 2 days ago
Network-Adaptive QoS Routing Using Local Information
In this paper, we propose the localized adaptive QoS routing scheme using POMDP(partially observable Markov Decision Processes) and Exploration Bonus. In order to deal with POMDP p...
Jeongsoo Han
GCC
2005
Springer
14 years 1 months ago
Dynamic Zone-Balancing of Topology-Aware Peer-to-Peer Networks
Building a topology-aware peer-to-peer overlay network can bring many advantages, such as providing locality-aware connectivity and reducing routing path length. While its benefit...
Gang Wu, Jianli Liu