Abstract
This paper presents the lower limit of loss probability in distributed communication networks and shows the limit of loss probability that can be obtained by logical networks based on the virtual networks to be used in the future. The paper analyzes the loss probability of high-quality traffic, whose volume is not large compared to non-copy simple-routing basic traffic. With this assumption, each node copies high-quality traffic data with header and sends it to multiple routes, through which the smallest number of transit switches are passed. On this condition, network topologies between originating and terminating nodes in the distributed network are simplified. The paper derives a methodology to give a loss probability in terms of a polynomial of the blocking rate d of each link. Based on this result, polynomials of d are given for each topology and numerical examples of loss probability are presented. © 1997 Scripta Technica, Inc. Electron Comm Jpn Pt 1, 80(11): 64–75, 1997
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Electronics and Communications in Japan (Part I: Communications)
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.
