The past few years have witnessed unprecedented growth of the Internet. Several new service models have been introduced since. In particular, the advent of the IP multicast technology has contributed to the success of the Internet as a medium for wide-area group communication. Multicast protocols support an important class of applications ranging from multimedia conferencing to network games. Due to this growth, the degree of heterogeneity of the network components has radically increased, leading to added complexity in the design and testing of network protocols. In the presence of network failures, unexpected combinations of events can drive protocols into undesirable states and may lead to errors. Anticipating all such cases is often impossible and at best may require extensive simulation and testing. In large systems, the cost of testing all possible scenarios exhaustively is prohibitive, and many unexpected cases are not observed until deployment. This problem is even more complex in the context of multicast. Unlike the traditional unicast protocols where only a single sender and a single receiver are involved, a multicast group may involve multiple senders and receivers. This characteristic introduces new challenges to the design
|
1362
|
RTP: A Transport Protocol for Real-Time Applications
– Schulzrinne, Casner, et al.
- 1996
|
|
1147
|
Tcl and the Tk Toolkit
– Ousterhout
- 1994
|
|
924
|
A reliable multicast framework for light-weight sessions and application level framing
– Floyd, Jacobson, et al.
- 1997
|
|
592
|
Systematic Software Development Using VDM
– Jones
- 1986
|
|
507
|
A note on two problems in connection with graphs
– Dijkstra
- 1959
|
|
387
|
A Computational Logic Handbook
– Boyer, Mooer
- 1988
|
|
371
|
Distance Vector Multicast Routing Protocol”. RFC 1075
– Waitzman, Partridge, et al.
- 1988
|
|
331
|
A Flexible Framework for Packet Video
– McCanne, Jacobson, et al.
- 1995
|
|
297
|
Formal methods: State of the art and future directions
– Clarke, Wing
- 1996
|
|
295
|
Formal verification for fault-tolerant architectures: Prolegomena to the design of PVS
– Owre, Rushby, et al.
- 1995
|
|
184
|
Multicast Extensions to OSPF
– Moy
- 1994
|
|
170
|
Understanding Z - A Specification Language and its Formal Semantics. Cambridge Tracts in Computer Science 3
– Spivey
- 1988
|
|
138
|
Parallel program design
– Chandy, Misra
- 1988
|
|
132
|
Using partial orders to improve automatic verification methods,” in Proc. Computer Aided Verification Workshop
– Godefroid
- 1990
|
|
111
|
Core based trees
– Ballardie, Francis, et al.
- 1993
|
|
74
|
A failsafe distributed routing protocol
– Merlin, Segall
- 1979
|
|
70
|
Loop-free routing using diffusing computations
– Garcia-Luna-Aceves
- 1993
|
|
60
|
A distributed whiteboard for network conferencing
– McCanne
- 1992
|
|
54
|
A Responsive Distributed Routing Algorithm for Computer Networks
– Jaffe, Moss
- 1982
|
|
48
|
Extending TCL for dynamic object-oriented programming
– Wetherall, Lindblad
- 1995
|
|
43
|
Protocol verification using reachability analysis: the state space explosion problem and relief strategies
– Lin, Chu, et al.
- 1987
|
|
36
|
A correctness proof of a topology information maintenance protocol for a distributed computer network
– Tajibnapis
- 1977
|
|
34
|
Verification Techniques for Cache Coherence Protocols
– Pong, Dubois
- 1997
|
|
31
|
Protocol validation by random state exploration
– West
|
|
27
|
Performance Analysis of Distributed Routing Strategies Free of Ping-Pong-Type Looping
– Shin, Chen
- 1987
|
|
25
|
Performance Assertion Checking
– Perl, Weihl
- 1993
|
|
24
|
A Calculus of Communicating Systems”. Number 92
– Milner
- 1980
|
|
23
|
Verifying a CSMA/CD Protocol withCCS
– Parrow
- 1988
|
|
19
|
Formal Verification of Communication Protocols
– Smith
- 1996
|
|
16
|
Probabilistic verification of communication protocols
– Maxemchuck, Sabnani
- 1987
|
|
16
|
Generalized fair reachability analysis for cyclic protocols
– Liu, Miller
- 1996
|
|
16
|
Testing finite state machines
– Yannakakis, Lee
- 1991
|
|
12
|
Using partial-order semantics to avoid the state explosion problem in asynchronous systems
– Probst
- 1990
|
|
12
|
A recovery approach to the design of stabilizing communication protocols
– Saleh, Ahmed, et al.
- 1995
|
|
10
|
Experience in Guiding Simulation
– Pageot, Jard
- 1988
|
|
8
|
The sdr Session Directory: An
– Handley
- 1996
|
|
7
|
A Survey on Kernel Specification and Verification
– Helmy
- 1997
|
|
6
|
OSI conformance testing. Computer Networks and
– Rayner
- 1987
|
|
4
|
NTE - The UCL Network Text Editor. URL http://www-mice-nsc.cs.ucl.ac.uk/mice-nsc/tools/nthelp: about.html
– Handley
- 1996
|
|
4
|
Protocol Independent Multicast-Sparse Mode (PIM-SM): Implementation Document. Internet Draft. URL http://www.usc.edu/dept/cs/technical reports.html
– Helmy
- 1997
|
|
3
|
Assertional reasoning about pairwise transient interactions in mobile computing
– Roman, McCann, et al.
- 1996
|
|
3
|
Combinatorial optimization: what is the state of the art
– Klee
- 1980
|
|
2
|
A simple protocol whose proof isn't. COM-33(4):330--337
– Hailpern
- 1985
|
|
2
|
Protocol verification by leaping reachability analysis
– Schoot, Ural
- 1996
|
