Sciweavers

407 search results - page 79 / 82
» Improved Algorithms for Network Topology Discovery
Sort
View
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
13 years 6 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu
INFOCOM
2007
IEEE
14 years 2 months ago
Optimal Provisioning of Elastic Service Availability
Abstract— Service availability is one of the most closely scrutinized metrics in offering network services. It is important to costeffectively provision a managed and differentia...
Dahai Xu, Ying Li, Mung Chiang, A. Robert Calderba...
FOCS
1997
IEEE
14 years 23 days ago
General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate)
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
Matthew Andrews, Antonio Fernández, Mor Har...
JSAC
2008
109views more  JSAC 2008»
13 years 7 months ago
Elastic service availability: utility framework and optimal provisioning
Service availability is one of the most closely scrutinized metrics in offering network services. It is important to cost-effectively provision a managed and differentiated networ...
Dahai Xu, Ying Li, Mung Chiang, A. Robert Calderba...
INFOCOM
2005
IEEE
14 years 2 months ago
Limiting path exploration in BGP
— Slow convergence in the Internet can be directly attributed to the “path exploration” phenomenon, inherent in all path vector protocols. The root cause for path exploration...
Jaideep Chandrashekar, Zhenhai Duan, Zhi-Li Zhang,...