Download:
|
by Ahmed Helmy, Deborah Estrin, Eep Gupta
ftp://ftp.usc.edu/pub/csinfo/tech-reports/papers/99-696.ps.Z
Add To MetaCart
Abstract:
The advent of multipoint (multicast-based) applications and the growth and complexity of the Internet has complicated network protocol design and testing. In this paper, we present a method for automatic synthesis of worst and best case scenarios for multipoint protocol performance evaluation. As a case study, we analyze variants of the timer suppression mechanism used in multipoint protocols in the Internet. We use our method to evaluate the mechanism with respect to two performance criteria: number of responses per request, and response time. The results are applied to examples in reliable multicast protocols. The method uses a fault-oriented test generation (FOTG) algorithm for searching the protocol and system state space to synthesize the scenarios. The algorithm is based on a global finite state machine (GFSM) model. We have extended the algorithm with timing semantics to handle end-to-end delays and address performance criteria. We introduce the notion of a virtual LAN to represent the underlying multicast distribution tree. We hope this method can serve as a model for applying more systematic test generation to other network protocols as well. I.
Citations
|
1362
|
RTP: A Transport Protocol for Real-Time Applications
– Schulzrinne, Casner, et al.
- 1996
|
|
924
|
A Reliable Multicast Framework for Light-weight Sessions and Application Level Framing
– Floyd, Jacobsen, et al.
- 1997
|
|
588
|
Kantz ”A comparison of mechanisms for Improving TCP Performance over Wireless Links
– Balakrishnan, Padmanabhan, et al.
|
|
387
|
A Computational Logic Handbook
– Boyer, Mooer
- 1988
|
|
297
|
Formal methods: State of the art and future directions
– Clarke, Wing
- 1996
|
|
275
|
An Active Service Framework and Its Application to Real-Time Multimedia Transcoding
– Amir, McCanne, et al.
- 1998
|
|
189
|
Internet group management protocol, version 2
– Fenner
- 1997
|
|
170
|
Understanding Z - A Specification Language and its Formal Semantics. Cambridge Tracts in Computer Science 3
– Spivey
- 1988
|
|
132
|
Using partial orders to improve automatic verification methods,” in Proc. Computer Aided Verification Workshop
– Godefroid
- 1990
|
|
101
|
Adaptive web caching: Towards a new global caching architecture
– Michel, Nguyen, et al.
- 1998
|
|
43
|
Protocol verification using reachability analysis: the state space explosion problem and relief strategies
– Lin, Chu, et al.
- 1987
|
|
34
|
Verification Techniques for Cache Coherence Protocols
– Pong, Dubois
- 1997
|
|
33
|
Scalable coordination in sensor networks
– Estrin, Govindan, et al.
- 1999
|
|
26
|
Session Directories and Scalable Internet Multicast Address Allocation
– Handley
- 1998
|
|
23
|
StarBurst Multicast File Transfer Protocol (MFTP) Specification
– Miller, Robertson, et al.
- 1997
|
|
20
|
Fault-oriented test generation for multicast routing protocol design
– Helmy, Estrin, et al.
- 1998
|
|
19
|
Simulation-based ‘STRESS’ testing case study: A multicast routing protocol
– Helmy, Estrin
- 1998
|
|
18
|
Virtual InterNetwork Testbed: Status and research agenda
– Bajaj, Breslau, et al.
- 1998
|
|
12
|
A recovery approach to the design of stabilizing communication protocols
– Saleh, Ahmed, et al.
- 1995
|
|
8
|
The Address Allocation Protocol
– Handley
- 1998
|
|
7
|
Large-scale weakly consistent replication using multicast
– Govindan, Yu, et al.
- 1998
|
|
3
|
SCAN: Large-Scale Fault Isolation
– Govindan, Alaettinoglu, et al.
|
