Systematic Performance Evaluation of Multipoint Protocols

Simple item page
dc.creatorHelmy, Ahmed
dc.creatorGupta, Sandeep
dc.creatorEstrin, Deborah
dc.creatorCerpa, Alberto
dc.creatorYu, Yan
dc.date2000-06-17
dc.date.accessioned2026-07-07T03:16:18Z
dc.date.available2026-07-07T03:16:18Z
dc.descriptionThe advent of multipoint (multicast-based) applications and the growth and complexity of the Internet has complicated network protocol design and evaluation. In this paper, we present a method for automatic synthesis of worst and best case scenarios for multipoint protocol performance 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. As a case study, we use our method to evaluate variants of the timer suppression mechanism, used in various multipoint 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. We expect our method to serve as a model for applying systematic scenario generation to other multipoint protocols.
dc.description23 pages, 12 figures
dc.identifierhttps://arxiv.org/abs/cs/0006029
dc.identifierhttp://arxiv.org/abs/cs/0006029
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30300
dc.subjectNetworking and Internet Architecture
dc.subjectData Structures and Algorithms
dc.subjectC.2.2; C.2.0
dc.titleSystematic Performance Evaluation of Multipoint Protocols
dc.typetext

Files

Collections

arXiv