Sciweavers

272 search results - page 46 / 55
» On properties of multicast routing trees
Sort
View
TON
2008
126views more  TON 2008»
13 years 7 months ago
Hyperbolic embedding of internet graph for distance estimation and overlay construction
Estimating distances in the Internet has been studied in the recent years due to its ability to improve the performance of many applications, e.g., in the peer-topeer realm. One sc...
Yuval Shavitt, Tomer Tankel
MASCOTS
2008
13 years 9 months ago
Network Information Flow in Network of Queues
Two classic categories of models exist for computer networks: network information flow and network of queues. The network information flow model appropriately captures the multi-ho...
Phillipa Gill, Zongpeng Li, Anirban Mahanti, Jingx...
CN
2007
102views more  CN 2007»
13 years 7 months ago
The "Global-ISP" paradigm
We present a new paradigm, called “Global ISP” (G-ISP). Its goal is to solve, or at least alleviate, problems of inter-domain routing, such as slow convergence, and lack of Qo...
Reuven Cohen, Amnon Shochot
TON
2012
11 years 10 months ago
Independent Directed Acyclic Graphs for Resilient Multipath Routing
—In order to achieve resilient multipath routing we introduce the concept of Independent Directed Acyclic Graphs (IDAGs) in this study. Link-independent (Node-independent) DAGs s...
Sangman Cho, Theodore Elhourani, Srinivasan Ramasu...
GLOBECOM
2008
IEEE
13 years 7 months ago
Many-to-Many Traffic Grooming in WDM Mesh Networks
In many-to-many communication, a session consists of group of users (we call them members) where each one of the members transmits its traffic to all other members in the group. Th...
Mohammad A. Saleh, Ahmed E. Kamal