Theoretical analysis of network cranback protocols performance
Sander Stepanov, Ofer Hadar

TL;DR
This paper provides a theoretical framework for analyzing the performance of network crankback protocols, deriving formulas for key probabilities and optimizing protocol parameters using analytical methods.
Contribution
It introduces a mathematical analysis approach to evaluate and optimize crankback protocol performance based on statistical characteristics.
Findings
Formulas for false alarm probability and success crossing probability
Analytical expressions for protocol optimization
Main equations for parameter tuning
Abstract
Suggested the decision of the network cranback protocols performance analyzing problem from Eyal Felstine, Reuven Cohen and Ofer Hadar, " Crankback Prediction in Hierarchical ATM networks", Journal of Network and Systems Management, Vol. 10, No. 3, September 2002. It show that the false alarm probability and probability of successful way crossing can be calculated. The main optimization equations are developed for cranback protocol parameters by using analytical expressions for statistical protocol characteristics.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMobile Ad Hoc Networks · IPv6, Mobility, Handover, Networks, Security · Network Packet Processing and Optimization
