Download:
|
by Peter B. Danzig, Dante Delucia, Katia Obraczka, Wide-area Internetworks, Wide-area Internetworks
ftp://catarina.usc.edu//pub/kobraczk/flood.ps.Z
Add To MetaCart
Abstract:
Current and future Internet services will provide a large, rapidly evolving, highly accessed, yet autonomously managed information space. Internet news, perhaps, is the closest existing precursor to such services. It permits autonomous updates, is replicated at thousands of autonomously managed sites, and manages a large database. It gets its performance through massive replication. This paper proposes a scalable mechanism for replicating wide-area, autonomously managed services. We target replication degrees of tens of thousands of weaklyconsistent replicas. For efficiency, our mechanismprobes the network and computes a good logical topology over which to send updates. For scalability, we organize replicas into hierarchical replication groups, analogous to the Internet's autonomous routing domains. We argue that efficient, massive replication does not have to rely on internet multicast. 1
Citations
|
2254
|
Optimization by simulated annealing
– Kirkpatrick, Gelatt, et al.
- 1983
|
|
1411
|
RTP: A Transport Protocol for Real-Time Applications
– Schulzrinne, Casner, et al.
- 1996
|
|
941
|
Multicast Routing in a Datagram Internetwork", Stanford
– Deering
- 1991
|
|
905
|
Graph Theory with Applications
– Bondy, Murty
- 1976
|
|
613
|
End-To-End arguments in system design
– Saltzer, Reed, et al.
- 1984
|
|
109
|
An Electronic Directory Service for the Internet
– Emtage, Deutsch, et al.
|
|
108
|
Designing a Global Name Service
– Lampson
- 1986
|
|
103
|
Weak-consistency group communication and membership
– Golding
- 1992
|
|
83
|
The Clearinghouse: A decentralized agent for locating named objects in a distributed environment
– Oppen, Dalal
- 1983
|
|
73
|
Network News Transfer Protocol: A Proposed Standard for the Stream-Based Transmission
– Kantor, Lapsley
- 1986
|
|
71
|
INTERNET resource discovery services
– Obraczka, Danzig, et al.
- 1993
|
|
71
|
Experience with Grapevine: The Growth of a Distributed System
– Schroeder, Birrell, et al.
- 1984
|
|
32
|
Drinking from the firehose: Multicast USENET news
– Lidl
- 1994
|
|
31
|
Design of Inter-Administrative Domain Routing
– Breslau, Estrin
- 1990
|
|
24
|
The complexity of the network design problem
– Johnson, Lenstra, et al.
- 1978
|
|
23
|
Frequently asked questions (FAQ) on the multicast backbone. file://- venera.isi.edu/mbone/faq.txt
– Casner
- 1993
|
|
15
|
The complexity of designing a network with minimum diameter
– Plesnik
- 1981
|
|
15
|
A System for Discovering Network Characteristics and
– Wood, Coleman, et al.
- 1993
|
|
9
|
Low mean internodal distance network topologies and simulated annealing
– Rose
- 1992
|
|
4
|
An algorithm for construction of a k-connected graph with minimum number of edges and quasiminimal diameter
– Schumacher
- 1984
|
|
3
|
The design of minimum-cost servivable networks
– Steiglitz, Weiner, et al.
- 1969
|
|
2
|
Topology Identification for Traffic and Configuration Management in Dynamic Networks
– Rouvellou, Hart
- 1992
|
|
1
|
Managing Internetowrks with SNMP
– Miller
- 1993
|
