Development of Inducible Leucine-rich Repeat Kinase 2 (LRRK2) Cell Lines for Therapeutics Development in Parkinson’s Disease.pdfVIP

TESTING IP ROUTING PROTOCOLS - FROM PROBABILISTIC ALGORITHMS TO A SOFTWARE TOOL Ruibing Hao, David Lee*, Rakesh K. Sinha, and Dario Vlah Bell Laboratories, Lucent Technologies Murray Hill, New Jersey 07974 *Bell Laboratories Research China Beijing, China {rhao.lee. rksl.dv}@research.bell-I Abstract We present probabilistic algorithms for testing IP routing protocols. Different than commercial testing tools, which select their test cases in an ad-hoc manner, our technique chooses test cases with a guaranteed fault coverage. Our algorithms are applied to testing RIP, OSPF, and BCP routing protocols. We test the routing table correctness, database information consistency with network topology and packet forwarding behaviors. We provide an analysis of test execution time and fault cover- age. The algorithms are part of a software tool SOCRATES, developed at Bell laboratories. SOCRATES also creates a testing environment so that the generated test cases can be executed in real time on high speed routers. Keywords: IP protocol, RIP, OSPF, BCP, router fault detection, fault coverage 1. INTRODUCTION Internet is a packet-switching network that enables its attached com- puters to exchange information by sending packets to each other. As packets are sent from source to destination, routing decisions are made by special purpose computers, called IP routers. To route packets cor- rectly and efficiently, routers follow a set of rules, which are implemented as distributed algorithms and are called routing protocols [5]. New so- phisticated functions and services, such as service differentiation,