Abstract
A Manhattan street network (MSN) is a regular, two-connected local area network. It has multiple paths between each pair of nodes that improve the reliability and throughput relative to single-loop networks. The authors evaluate reliability for accurate and approximate MSN models. Via both simulation and theoretical analysis, they show that there is little difference between the exact and approximate models. Because it is not practical to calculate the reliability for either model for large networks, simple upper and lower bounds are developed. They also determine the availability of MSNs for several repair disciplines for servicing failed links. Approximate Markov chain models for two different smart repair discipline models are analyzed. It is shown that the smart repair disciplines provide significant improvements in availability over the simple FCFS discipline, and simulations with confidence intervals are provided.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.