Multiplex communications – Wide area network – Packet switching
Patent
1993-07-12
1995-01-10
Marcelo, Melvin
Multiplex communications
Wide area network
Packet switching
370 17, 370 60, 370 941, H04L 522, H04L 1256
Patent
active
053814045
ABSTRACT:
A communication network and method of design thereof uses end-to-end delay distribution functions and loss probabilities as design constraint to ensure that all packets of all traffic classes on all end-to-end node pairs of the network reach a destination within a predetermined maximum allowable delay with a given probability. An end-to-end delay distribution function is determined for every end-to-end path for all traffic classes to find a path with a minimum distribution probability value. A distribution function is determined for each link of the path having a minimum distribution probability value to determine a most congested link, the capacity of which is increased until a given minimum probability value of distribution is determined.
REFERENCES:
patent: 4979118 (1990-12-01), Kheradpir
patent: 5038340 (1991-08-01), Ochiai
patent: 5163042 (1992-11-01), Ochiai
patent: 5267232 (1993-11-01), Katsube et al.
Tokumi Yokohira et al., "Fault Tolerant Packet-Switched Network Design and Its Sensitivity", Oct. 1991, IEEE Transactions on Reliability, vol. No. 4, pp. 452-460.
T. Yokohira et al., "Capacity Assignment Algorithm for Packet-Switching Network with Unreliable Links", Sep. 1991, Electronics and Communications in Japan, Part 1, vol. 74, No. 9, pp. 13-20.
E. D. Sykas et al., "Link Capacity Allocation In ATM Broadband Communication Networks", May 1991, 6th Mediterranean Electrotechnical Conference, vol. 1, pp. 497-500.
Gerla et al, IEEE Transactions on Communications, vol. COM-25, No. 1, pp. 48-60, Jan. 1977, "On the Topological Design of Distributed Computer Networks."
Nakajima et al, Transaction of IEICE of Japan, vol. 170-A, pp. 271-277, Feb., 1987, "Optimization of Packet-Switched Networks Under End'to-End Packet Transit Delay Constraints."
Saksena, IEEE Journal on Selected Areas in Communications, vol. 7, No. 8, pp. 1243-1252, Oct., 1989, "Topological Analysis of Packet Networks."
Maruyama et al, IBM Journal of Research and Development, vol. 21, May 1977, pp. 254-263, "Discrete Link Capacity and Priority Assignments in Communication Networks."
Maruyama et al, IBM Journal of Research and Development, vol. 21, Jul. 1977, pp. 360-369, "Heuristic Design Algorithm for Computer Communication Networks with Different Classes of Packets."
Maruyama et al, Proceeding of the Third International Computer Communication Conference, Toronto, Aug., 1976, pp. 92-97, "Discrete Link Capacity Assignments in Communication Networks."
Garbow et al, ACM Transactions on Mathematical Software, vol. 14, No. 2, Jun. 1988, pp. 163-170, "Software for an Implementation of Weeks' Method for the Inverse Laplace Transform Problem."
Garbow et al, ACM Transactions on Mathematical Software, vol. 14, No. 2, Jun. 1988, pp. 171-176, "Algorithm 662 a Fortran Software Package for the Numerical Inversion of the Laplace Transform Based on Weeks."
Miyahara Hideo
Murata Masayuki
Sugano Masashi
Marcelo Melvin
Mita Industrial Co. Ltd.
LandOfFree
Packet-switching communication network and method of design does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Packet-switching communication network and method of design, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Packet-switching communication network and method of design will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-856207