Sciweavers

1815 search results - page 154 / 363
» Path Planning for Network Performance
Sort
View
SIGMETRICS
2011
ACM
139views Hardware» more  SIGMETRICS 2011»
12 years 11 months ago
Slick packets
Source-controlled routing has been proposed as a way to improve flexibility of future network architectures, as well as simplifying the data plane. However, if a packet specifie...
Giang T. K. Nguyen, Rachit Agarwal, Junda Liu, Mat...
BROADNETS
2005
IEEE
14 years 1 months ago
Dual-link failure resiliency through backup link mutual exclusion
— Networks employ link protection to achieve fast recovery from link failures. While the first link failure can be protected using link protection, there are several alternative...
Amit Chandak, Srinivasan Ramasubramanian
ICC
2008
IEEE
128views Communications» more  ICC 2008»
14 years 2 months ago
Quality-of-Service Routing with Two Concave Constraints
—Routing is a process of finding a network path from a source node to a destination node. A good routing protocol should find the “best path” from a source to a destination...
Ka-Chung Leung, King-Shan Lui, Ka-Cheong Leung, Fr...
ICDCS
2008
IEEE
14 years 2 months ago
DCAR: Distributed Coding-Aware Routing in Wireless Networks
—Recently, there has been a growing interest of using network coding to improve the performance of wireless networks, for example, authors of [1] proposed the practical wireless ...
Jilin Le, John C. S. Lui, Dah-Ming Chiu
WSDM
2010
ACM
199views Data Mining» more  WSDM 2010»
14 years 5 months ago
A Sketch-Based Distance Oracle for Web-Scale Graphs
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
Atish Das Sarma, Sreenivas Gollapudi, Marc Najork,...