Name
Abstract | ||
|---|---|---|
As communications networks are expanding to larger areas the control and maintenance of routing information are becoming a formidable task. To cope with its size and complexity and to make the network reliable and scalable hierarchical network has been proposed with new features to support the information infrastructure. However, the network hierarchy adds more complications to the network design and implementations and that hampers the network reliability and quality of services. Conformance testing is known to be a powerful tool for network fault detection yet most of the works in the published literature are on networks without hierarchy. We present probabilistic algorithms for testing hierarchical networks along with the added features. Based on a formal model of the networks, we provide a formal analysis that shows that our probabilistic algorithms guarantee a high fault coverage with a feasible number of tests. To further reduce the number of tests we identify test equivalence classes and that enables us to significantly reduce the number of tests yet without losing the fault coverage. Experimental results on Internet OSPF protocol are reported. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11430230_18 | TestCom |
Keywords | Field | DocType |
feasible number,network reliability,scalable hierarchical network,probabilistic testing algorithm,network hierarchy,probabilistic algorithm,network design,communications network,network fault detection,fault coverage,hierarchical network,quality of service,information infrastructure,conformance testing,fault detection | Fault coverage,Network planning and design,Fault detection and isolation,Computer science,Algorithm,Formal specification,Probabilistic analysis of algorithms,Conformance testing,Hierarchical network model,Probabilistic logic,Distributed computing | Conference |
Volume | ISSN | ISBN |
3502 | 0302-9743 | 3-540-26054-4 |
Citations | PageRank | References |
1 | 0.39 | 14 |
Authors | ||
2 | ||