A new polynomial-time algorithm for linear programming
Combinatorica
Understanding Z: a specification language and its formal semantics
Understanding Z: a specification language and its formal semantics
Computer Networks and ISDN Systems - Special Issue: Protocol Specification and Testing
A protocol test generation procedure
Computer Networks and ISDN Systems
A computational logic handbook
A computational logic handbook
SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
An improved branch and bound algorithm for mixed integer nonlinear programs
Computers and Operations Research
Testing finite state machines: fault detection
Selected papers of the 23rd annual ACM symposium on Theory of computing
Formal methods: state of the art and future directions
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Verification techniques for cache coherence protocols
ACM Computing Surveys (CSUR)
A reliable multicast framework for light-weight sessions and application level framing
IEEE/ACM Transactions on Networking (TON)
Session directories and scalable Internet multicast address allocation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
An active service framework and its application to real-time multimedia transcoding
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Adaptive web caching: towards a new global caching architecture
Computer Networks and ISDN Systems - Selected papers of the 3rd international caching workshop
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
A scalable Web cache consistency architecture
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A new technique for generating protocol test
SIGCOMM '85 Proceedings of the ninth symposium on Data communications
Fault isolation in multicast trees
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Advances in Network Simulation
Computer
Fault-oriented Test Generation for Multicast Routing Protocol Design
FORTE XI / PSTV XVIII '98 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XI) and Protocol Specification, Testing and Verification (PSTV XVIII)
Using Partial Orders to Improve Automatic Verification Methods
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Reliable multicasting in the Xpress transport protocol
LCN '96 Proceedings of the 21st Annual IEEE Conference on Local Computer Networks
Systematic testing of protocol robustness: case studies on mobile IP and MARS
LCN '00 Proceedings of the 25th Annual IEEE Conference on Local Computer Networks
Enabling Large-Scale Simulation: Selective Abstraction Approach to the Study of Multicast Protocol
MASCOTS '98 Proceedings of the 6th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Simulation-based `STRESS' Testing Case Study: A Multicast Routing Protocol
MASCOTS '98 Proceedings of the 6th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Impact of Network Dynamics on End-to-End Protocols: Case Studies in Reliable Multicast
ISCC '98 Proceedings of the Third IEEE Symposium on Computers & Communications
Recovery approach to the design of stabilizing communication protocols
Computer Communications
IEEE Communications Magazine
ACM SIGCOMM Computer Communication Review
Cost analysis and optimization for IP multicast group management
Computer Communications
Hi-index | 0.00 |
The advent of multicast and the growth and complexity of the Internet has complicated network protocol design and evaluation. Evaluation of Internet protocols usually uses random scenarios or scenarios based on designers' intuition. Such approach may be useful for average case analysis but does not cover boundary-point (worst or best case) scenarios. To synthesize boundary-point scenarios, a more systematic approach is needed.In this paper, we present a method for automatic synthesis of worst and best case scenarios for protocol boundary-point evaluation. Our method uses a fault-oriented test generation (FOTG) algorithm for searching the protocol and system state space to synthesize these scenarios. The algorithm is based on a global finite state machine (FSM) model. We extend 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 delays of the underlying multicast distribution tree. Our algorithms utilize implicit backward search using branch and bound techniques and start from given target events.As a case study, we use our method to evaluate variants of the timer suppression mechanism, used in various multicast protocols, with respect to two performance criteria: overhead of response messages and response time. Simulation results for reliable multicast protocols show that our method provides a scalable way for synthesizing worst case scenarios automatically. Results obtained using stress scenarios differ dramatically from those obtained through average case analyses. We hope for our method to serve as a model for applying systematic evaluation to other multicast protocols.