Link state routing techniques

Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing – Prioritized data routing

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S238000, C370S351000

Reexamination Certificate

active

07047316

ABSTRACT:
A link state routing communication device allowing path precalculation satisfying the required quality of a connection and reducing the call blocking probability is disclosed. A path satisfying a connection request can be selected from a plurality of precalculated paths which are stored for each destination in a memory. The precalculated paths reflect the latest link resource information using the feasibility check operation or precalculated path update operation. Therefore, a blocking probability of connection setup using precalculated paths can be decreased. In a border node, summarized information is calculated based on precalculated paths and therefore high-speed summarized information calculation is allowed, resulting in reduced computation load.

REFERENCES:
patent: 5845091 (1998-12-01), Dunne et al.
patent: 5933425 (1999-08-01), Iwata
patent: 6542468 (2003-04-01), Hatakeyama
patent: 6633544 (2003-10-01), Rexford et al.
patent: 6687229 (2004-02-01), Kataria et al.
patent: 5-130144 (1993-05-01), None
patent: 9-36 873 (1997-02-01), None
patent: 9-116573 (1997-05-01), None
patent: 2723097 (1997-11-01), None
patent: 10-65733 (1998-03-01), None
patent: 10-135980 (1998-05-01), None
patent: 10-154979 (1998-06-01), None
patent: 10-164074 (1998-06-01), None
patent: 11-252106 (1999-09-01), None
patent: 2000-174755 (2000-06-01), None
“ATM Routing Algorithms with Multiple QOS Requirements for Multimedia Internetworking” (IEICE, Transactions on Communications, vol. E79-B. No. 8. pp 999-1007, Aug. 1996).
“Source-Oriented Topology Aggregation with Multiple QoS parameters in Hierarchical ATM Networks” (IEEE/IFIPIWQoS'99 pp. 137-146, Jun. 1999).
Japanese Office Action dated Oct. 8, 2003 with Partial English Translation.
Norihito Fujita, et al., “QoS Control with MPLS over ATM Model”,The Institute of Electronics, Information and Communication Engineers, Mar. 19, 1999, pp. 81-86.
European Search Report dated Apr. 13, 2004.
Nina Taft-Plotkin, et al., “QoS-Routing in ATM Networks”, Aug. 1998, XP-002273503.
Nina Taft-Plotkin, et al., “Quality-of-Service Routing Using Maximally Disjoint Paths”, IEEE, XP-010335391, May 31, 1999, pp. 119-128.
Atsushi Iwata, et al., “PNNI Routing Algorithms for Multimedia ATM Internet”, vol. 38, No. 1, 1997, pp. 60-73, XP 000694589.
Ariel Orda, et al., “QoS Routing: The Precomputation Perspective”, Proceedings IEEE Infocom 2000, vol. 3 of 3, Mar. 26, 2000, pp. 128-136, XP-001004241.
Shigang Chen, et al., “An Overview of Quality of Service Routing for Next-Generation High-Speed Networks: Problems and Solutions”, IEEE Networks, vol. 12, No. 6, Nov. 1998, pp. 64-79, XP-000873129.
Hui Xie, et al., “Performance Analysis of PNNI Routing In ATM Networks: Hierarchical Reduced Load Approximation”, 1997 IEE, Nov. 2, 1997, pp. 998-1002, XP010260807.
E. Crawley, et al., RFC 2386: A Framework for QoS-based Routing in the Internet, IETF RFC, Aug. 1998, XP-002219363.
European Search Report dated Sep. 13, 2004.
Plet Van Mieghem, “Topology Information condensation in hierarchical networks”, Computer Networks, Elsevier Science Publishers B.V., Amsterdam, NL, vol. 31, No. 20, Sep. 27, 1999, pp. 2115-2137, XP004304619 ISSN: 1309-1286.
Whay C. Lee, “Topology Aggregation for Hierarchical Routing in ATM Networks”, Computer Communication Review, Association For Computing Machinery. New York, US, vol. 25, No. 2, Apr. 1, 1995, pp. 82-92, XP000570739 ISSN: 0146-4833.
“Private Network-Network Interface Specification Version 1.0 (PNNI 1.0), af-pnni-0055.000”, ATM Forum Technical Committee, Mar. 1996, pp. 1-190, XP002247350.
Atsushi Iwata, et al., “QOS aggregation algorithms in hierarchical ATM networks”, Communications, 1998. ICC 98. Conference Record. 1998 IEEE International Conference on Atlanta, GA, USA Jun. 7-11, 1998, New York, NY, USA, IEEE, US, Jun. 7, 1998, pp. 243-248, XP010284456 ISBN: 0-7803-4788-9.
Peyravian M. et al., “Network path caching:—Issues, algorithms and a simulation study”, Computer Communications, Elsevier Science Publishers BV, Amsterdam, NL, vol. 20, No. 8, Aug. 25, 1997, pp. 605-614, XP004126714 ISSN: 0140-3664.
Apostolopoulos G. et al., “On reducing the processing cost of on-demand QoS path computation”, Network Protocols, 1998. Proceedings. Sixth International Conference On Austin, TX, USA Oct. 13-16, 1998, Los Alamitos, CA, USA, IEEE Comput. Soc, US, Oct. 13, 1998, pp. 80-89, XP010309351 ISBN: 0-8186-8988-9.
Srihari Nelakuditi, et al., “Quality-of-Service Routing without Global Information Exchange”, Quality of Service, 1999, IWQOS '99. 1999 Seventh International Workshop on London, UK May 31-Jun. 4, 1999, Piscataway, NJ, USA, IEEE, US, May 31, 1999, pp. 129-131, XP010335383 ISBN: 0-7803-5671-3.
Liang Guo et al., “On State Aggregation for Scalable QoS Routing”, ATM Workshop Proceedings, 1998 IEEE Fairfax, VA, USA May 26-29, 1998, New York, NY, USA, IEEE, US, May 26, 1998, pp. 306-314, XP010280535 ISBN: 0-7803-4874-5.
Anees Shaikh et al., “Efficient Precomputation of Quality-of-Service Routes”, Workshop on Network and Operating Systems Support for Digital Audio and Video, Jul. 1998, XP002290856.
Atsushi Iwata, et al., “ATM Routing Algorithms with Multiple QOS Requirements for Multimedia Internetworking”, IEICE Transactions on Communications, Institute of Electronics Infomation and Comm. Eng. Tokyo, JP, vol. E79-B, No. 8, Aug. 1, 1996, pp. 999-1007, XP000628636 ISSN: 0916-8516.
Crawley, et al., “RFC 2386: A Framework for QoS-based Routing in the Internet”, IETF RFC, Aug. 1998, pp. 1-37, XP002219363, retrieved from the Internet: URL:ftp://ftp.isi.edu/in-notes/rfc2386.txt.
Hui Xie et al., “Performance Analysis of PNNI Routing in ATM Networks: Hierarchical Reduced Load Approximation”, MILCOM 97 Proceedings Monterey, CA, USA Nov. 2-5, 1997, New York, NY, USA, IEEE, US, Nov. 2, 1997, pp. 998-1002, XP010260807 ISBN: 0-7803-4249-6.
Shigang Chen et al., “An Overview of Quality of Service Routing for Next-Generation High-Speed Networks: Problems and Solutions”, IEEE Network, IEEE Inc. New York, US, vol. 12, No. 6, Nov. 1998, pp. 64-79, XP000873129 ISSN: 0890-8044.
Ariel Orda, et al., “QoS Routing: The Precomputation Perspective”, Proceedings IEEE INFOCOM 2000. The Conference on Computer Communications. 19th. Annual Joint Conference of the IEEE Computer and Communications Societies. Tel Aviv, Israel, Mar. 26-30, 2000, Proceedings IEEE INFOCOM. The Conference on Computer COMMU, vol. 3 of 3, Conf. 19, Mar. 26, 2000, pp. 128-136, XP001004241 ISBN: 0-7803-5881-3.
Nina Taft-Plotkin et al., “Quality-of-Service Routing Using Maximally Disjoint Paths”, Quality of Service, 1999. IWQOS '99. 1999 Seventh International Workshop on London, UK May 31-Jun. 4, 1999, Piscataway, NJ, USA, IEEE, US, May 31, 1999, pp. 119-128, XP010335391 ISBN: 0-7803-5671-3.
Nina Taft-Plotkin, et al., “QoS-Routing in ATM Networks”, SRI International, Aug. 1998, XP002273503.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Link state routing techniques does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Link state routing techniques, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Link state routing techniques will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3627051

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.