Sciweavers

35 search results - page 4 / 7
» Improving the Reliability of Internet Paths with One-hop Sou...
Sort
View
CN
2002
195views more  CN 2002»
13 years 10 months ago
A simulation study of the OSPF-OMP routing algorithm
Open shortest path first (OSPF) is the most widely used internal gateway routing protocol on the Internet. However, one shortcoming is that it does not take advantage of the exist...
G. Michael Schneider, Tamás Németh
SIGCOMM
2004
ACM
14 years 4 months ago
Locating internet bottlenecks: algorithms, measurements, and implications
The ability to locate network bottlenecks along end-to-end paths on the Internet is of great interest to both network operators and researchers. For example, knowing where bottlen...
Ningning Hu, Erran L. Li, Zhuoqing Morley Mao, Pet...
GC
2004
Springer
14 years 4 months ago
BGP-Based Clustering for Scalable and Reliable Gossip Broadcast
This paper presents a locality-based dissemination graph algorithm for scalable reliable broadcast. Our algorithm scales in terms of both network and memory usage. Processes only h...
M. Brahami, Patrick Th. Eugster, Rachid Guerraoui,...
SIGMETRICS
2011
ACM
139views Hardware» more  SIGMETRICS 2011»
13 years 1 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...
TELSYS
2002
128views more  TELSYS 2002»
13 years 10 months ago
An Evaluation of Shared Multicast Trees with Multiple Cores
Native multicast routing protocols have been built and deployed using two basic types of trees: singlesource, shortest-path trees and shared, core-based trees. Core-based multicas...
Daniel Zappala, Aaron Fabbri, Virginia Mary Lo