Fault diagnosis using automatic test packet generation

Recently networks are growing wide and more complex. However administrators use tools like ping and trace route to debug problems. Hence we proposed an automatic and Methodical approach for testing and debugging networks called Automatic Test Packet Generation (ATPG). This approach gets router configurations and generates a device-independent model. ATPG generate a few set of test packets to find every link in the network. Test packets are forwarded frequently and it detect failures to localize the fault. ATPG can detect both functional and performance (throughput, latency) problems. We found, less number of test packets is enough to test all rules in networks. For example, 4000 packets can cover all rules in Stanford backbone network, while 53 are much enough to cover all links. DOI: 10.17762/ijritcc2321-8169.15030

DESIGNING A DEVICE-INDEPENDENT NON-RUDIMENTARY MODEL FOR NETS

The suggested types of automatic test packet generation might find the kinds of router and can create a model that's device-independent. While automatic test packet generation approach goodies links like common rules of forwarding, its complete coverage assurances testing of every single link inside the network. Two most ordinary reasons for failures of network are hardware failures furthermore to software bugs, which issues will noticeable themselves as throughput degradation. The suggested types of automatic test packet generation will produce packets instantly for testing of performance assertions helping in recognition of errors by individually and methodically testing every forwarding entry, furthermore to packet processing rules within network. To acknowledge the failures we initiate an analogy test packet generation that creates tiniest packet trying to find testing of live lines of fundamental topology and congruence among data plane condition furthermore to specifications of configuration

TRIAL QUERY SACHET COHORT SYSTEM TO SOLVE THE NETWORK COMPLEXITIES

The recommended kinds of automatic test packet generation will discover the sorts of router and can produce a model that's device-independent. While automatic test packet generation approach goodies links like common rules of forwarding, its complete coverage assurances testing of each and every single link within the network. Two most ordinary causes of failures of network are hardware failures in addition to software bugs, which issues will noticeable themselves as throughput degradation. The recommended kinds of automatic test packet generation will produce packets instantly for testing of performance assertions helping in recognition of errors by individually and methodically testing every forwarding entry, in addition to packet processing rules within network. To understand the failures we initiate an example test packet generation that produces tiniest packet looking for testing of live lines of fundamental topology and congruence among data plane condition in addition to specifications of configuration

Network Fault Detection Using Test Packet Generation: A Survey

Networks are becoming larger and a lot of advanced, yet directors think about various tools like ping and traceroute to correct issues. Instead of using different tools to debug the network problems, we introduced an automatic and systematic scheme for testing and debugging networks known as Automatic test Packet Generation (ATPG). This automated approach fetches router configurations to generate a device-independent model. The model is employed to get a minimum set of test packets to analyse each link in the network. The detected failures trigger a separate mechanism to localize the fault by sporadically sending test packets. ATPG will notice each operational (e.g., incorrect firewall rule) and performance problems. ATPG complements however goes on the far side earlier add static checking (which cannot observe functional or performance faults) or fault localization (which solely localizes faults given liveness results). DOI: 10.17762/ijritcc2321-8169.150315

The STRESS Method for Boundary-point Performance Analysis of End-to-end Multicast Timer-Suppression Mechanisms

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. The algorithms used in our method utilize implicit backward search using branch and bound techniques and start from given target events. This aims to reduce the search complexity drastically. 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 scenario generation to other multicast protocols.Comment: 24 pages, 10 figures, IEEE/ACM Transactions on Networking (ToN) [To appear

Satellite Broadcasting Enabled Blockchain Protocol: A Preliminary Study

Low throughput has been the biggest obstacle of large-scale blockchain applications. During the past few years, researchers have proposed various schemes to improve the systems' throughput. However, due to the inherent inefficiency and defects of the Internet, especially in data broadcasting tasks, these efforts all rendered unsatisfactory. In this paper, we propose a novel blockchain protocol which utilizes the satellite broadcasting network instead of the traditional Internet for data broadcasting and consensus tasks. An automatic resumption mechanism is also proposed to solve the unique communication problems of satellite broadcasting. Simulation results show that the proposed algorithm has a lower communication cost and can greatly improve the throughput of the blockchain system. Theoretical estimation of a satellite broadcasting enabled blockchain system's throughput is 6,000,000 TPS with a 20 gbps satellite bandwidth.Comment: Accepted by 2020 Information Communication Technologies Conference (ICTC 2020