Sciweavers

2677 search results - page 441 / 536
» Locally Served Network Computers
Sort
View
FOCS
1995
IEEE
15 years 9 months ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos
NSDI
2008
15 years 8 months ago
UsenetDHT: A Low-Overhead Design for Usenet
Usenet is a popular distributed messaging and file sharing service: servers in Usenet flood articles over an overlay network to fully replicate articles across all servers. Howeve...
Emil Sit, Robert Morris, M. Frans Kaashoek
CORR
2010
Springer
79views Education» more  CORR 2010»
15 years 5 months ago
A Multi-hop Multi-source Algebraic Watchdog
In our previous work (`An Algebraic Watchdog for Wireless Network Coding'), we proposed a new scheme in which nodes can detect malicious behaviors probabilistically, police th...
MinJi Kim, Muriel Médard, João Barro...
CCR
2004
86views more  CCR 2004»
15 years 5 months ago
IPv4 address allocation and the BGP routing table evolution
The IP address consumption and the global routing table size are two of the vital parameters of the Internet growth. In this paper we quantitatively characterize the IPv4 address ...
Xiaoqiao Meng, Zhiguo Xu, Beichuan Zhang, Geoff Hu...
JACM
2000
77views more  JACM 2000»
15 years 5 months ago
The fault span of crash failures
A crashing network protocol is an asynchronous protocol whose memory does not survive crashes. We show that a crashing network protocol that works over unreliable links can be driv...
George Varghese, Mahesh Jayaram