Electrical computers and digital processing systems: multicomput – Multiple network interconnecting
Reexamination Certificate
2006-06-06
2006-06-06
Dharia, Rupal (Department: 2141)
Electrical computers and digital processing systems: multicomput
Multiple network interconnecting
C709S238000, C709S251000, C370S245000, C370S292000
Reexamination Certificate
active
07058730
ABSTRACT:
A method and system for routing an externally generated message in a network includes receiving at an ingress port of a network a message from an external network. The message includes Internet protocol (IP) source and destination addresses and message data. The IP source and destination addresses are translated to internal addresses that are non-forwardable in the external network. The message data is routed in the network based on the internal addresses.
REFERENCES:
patent: 5229990 (1993-07-01), Teraslinna
patent: 5231633 (1993-07-01), Hluchyj et al.
patent: 5461624 (1995-10-01), Mazzola
patent: 5590133 (1996-12-01), Billström et al.
patent: 5771370 (1998-06-01), Klein
patent: 5781534 (1998-07-01), Perlman et al.
patent: 5818842 (1998-10-01), Burwell et al.
patent: 5825772 (1998-10-01), Dobbins et al.
patent: 5850399 (1998-12-01), Ganmukhi et al.
patent: 5852606 (1998-12-01), Prince et al.
patent: 5946308 (1999-08-01), Dobbins et al.
patent: 5956341 (1999-09-01), Galand et al.
patent: 6018766 (2000-01-01), Samuel et al.
patent: 6028842 (2000-02-01), Chapman et al.
patent: 6058113 (2000-05-01), Chang
patent: 6058431 (2000-05-01), Srisuresh et al.
patent: 6075767 (2000-06-01), Sakamoto et al.
patent: 6205158 (2001-03-01), Martin et al.
patent: 6308226 (2001-10-01), Kainuma
patent: 6317426 (2001-11-01), Afanador et al.
patent: 6331905 (2001-12-01), Ellinas et al.
patent: 6353593 (2002-03-01), Chen et al.
patent: 6353616 (2002-03-01), Elwalid et al.
patent: 6359857 (2002-03-01), Ahmad et al.
patent: 6366556 (2002-04-01), Ballintine et al.
patent: 6457061 (2002-09-01), Bal et al.
patent: 6515966 (2003-02-01), Bardalai et al.
patent: 2001/0025310 (2001-09-01), Krishnamurthy et al.
patent: 0 512 495 (1992-11-01), None
patent: 0 849 970 (1998-06-01), None
patent: 0 959 641 (1999-11-01), None
patent: WO 97/40610 (1997-10-01), None
patent: WO 98/00954 (1998-01-01), None
patent: WO 99/11090 (1999-03-01), None
patent: WO 99/66675 (1999-12-01), None
patent: WO 00/10357 (2000-02-01), None
patent: WO 00/21254 (2000-04-01), None
patent: WO 00/24164 (2000-04-01), None
PCT International Search Report in International Application No. PCT/US 01/13695, dated Oct. 9, 2001, 6 pages.
Law A M et al: “Simulation Software for Communications Networks: The State of the Art,” IEEE Communications Magazine, IEEE Service Center. Piscataway, N.J., US, vol. 32, No. 3, Mar. 1, 1994, p. 1, col. 2, line 4-p. 2, col. 1, line 39, p. 4, col. 1, line 3-p. 6, col. 1, paragraph 6; XP 000442186.
International Search Report in International Application No. PCT/US01/14615, dated Apr. 5, 2002, 7 pages.
International Preliminary Examination Report in International Application No. PCT/US01/13725, dated Jun. 4, 2002, 5 pages.
International Preliminary Examination Report in International Application No. PCT/US01/13732, dated Jul. 12, 2002, 5 pages.
International Preliminary Examination Report in International Application No. PCT/US01/13695, dated Oct. 30, 2002, 4 pages.
Form PCT/IPEA/416,Notification of Transmittal of International Preliminary Examination Report, with attached Form PCT/IPEA/409,PCT International Preliminary Examination Report( 5 pages), for PCT/US01/13694 dated Mar. 19, 2003.
Kermani, et al., “Virtual Cut-through: A New Computer Communication Switching Technique”, Computer Networks, vol. 3, Cover, Table of Contents and pp. 267-285, 1979.
Cidon, et al., “MetaRing—A Full Duplex Ring with Fairness and Spatial Reuse”, IEEE Transactions on Communications, vol. 41, Cover and pp. 110-120, Jan. 1993.
Ofek, et al., “METANET: Principles of an Arbitrary Topology LAN”, IEEE Transactions on Networking, vol. 3, No. 2, Cover and pp. 169-180, Apr. 1995.
West, “Introduction to Graph Theory”, Prentice Hall, ISBN 0-13-227828-6, QA166.W43 1996, 7 pages Cover, ISBN page, Table of Contents, and pp. 51-85.
Hunter, et al., “WASPNET: A Wavelength Switched Packer Network”, IEEE Communications Magazine, 2-page cover and pp. 120-129, Mar. 1999.
Hernandez-Valencia, “A Simple Data Link(SDL)Framing Protocol for High-Speed Optical Packet Networks”, OIF99.043.0, pp. 1-21, May 4, 1999.
Simpson, “The Point-to-Point Protocol(PPP)”, Daydreamer, RFC-1661, 50 pages, Jul. 1994.
Katz, et al., “Traffic Engineering Extensions to OSPF”, IETF Draft, draft-katz-yeung-ospf-traffic-01.txt, pp. 1-8, Oct. 1999.
Crawley, et al., “A Framework for Qos Based Routing in the Internet,”, RFC 2386, 35 pages, Aug. 1998.
Wimer, et al., FORE Systems, Inc., “OSPF Sub-Areas”, IETF Draft, draft-wimer-ospf-sub-areas-00.txt, 13 pages, Oct. 1999.
Wimer, et al., FORE Systems, Inc., “Additional OSPF Extensions for Traffic Engineering and Qos Routing”, IETF Draft, draft-wimer-ospf-traffic-00.txt, 5 pages, Feb. 1999.
Yeung, “OSPF Extensions for Traffic Engineering”, IETF Draft, draft-yeung-ospf-traffic-00.txt, 9 pages, Feb. 1999.
Apostolopoulos, et al., “Qos Routing Mechanism and OSPF Extensions”, RFC 2676, 47 pages, Aug. 1998.
Smit, et al., “IS-IS Extensions for Traffic Engineering”, IETF Draft, draft-ietf-isis-traffic-00.txt, 10 pages, May 1999.
Awduche, et al., UUNET (MCI WorldCom), “Requirements for Traffic Engineering Over MPLS”, RFC 2702, 28 pages, Sep. 1999.
Blake, et al., “An Architecture for Differentiated Services”, RFC 2475, 34 pages, Dec. 1998.
Braden, et al., “Resource ReSerVation Protocol(RSVP)”,Version 1 Functional Specification, RFC 2205, 105 pages, Sep. 1997.
Wroclawski, “Specification of the Controlled-Load Network Element Service”, RFC 2211, 18 pages, Sep. 1997.
Shenker, et al., “Specification of Guaranteed Quality of Service”, RFC 2212, 19 pages, Sep. 1997.
Reynolds, et al., ISI, “Assigned Numbers”, RFC 1700, 215 pages, Oct. 1994.
Jacobson, et al., “An Expedited Forwarding PHB”, RFC 2598, 11 pages, Jun. 1999.
Heinanen, et al., “Assured Forwarding PHB Group”, RFC 2597, 11 pages, Jun. 1999.
Manchester, et al., Bell Laboratories, “IP over SONET”, IEEE Communications Magazine, vol. 36, No. 5, cover and pp. 136-142, May 1998.
Heinanen, Telecom Finland “Multi-Protocol Encapsulation over ATM Adaptation Layer 5”, RFC 1483, 15 pages, Jul. 1993.
The ATM Forum, Technical Committee, “Private Network-Network Interface Specification Version 1.0”, af-pnni-0055.000, cover, introduction, acknowledgements and table of contents (18 pages) and 366 pages of text, Mar. 1996.
Callon, Digital Equipment Corporation, “Use of OSI IS-IS for Routing in TCP/IP and Dual Environments”, RFC 1195, 80 pages, Dec. 1990.
Moy, Ascend Communications “OSPF Version 2”, RFC 2328, 204 pages, Apr. 1998.
Malkin, Bay Networks, “RIP Version 2”, RFC 2453, 37 pages, Nov. 1998.
Rekhter, et al., “A Border Gateway Protocol 4(BGP-4)”, RFC 1771, 54 pages, Mar. 1995.
Goguen, et al., “RSVP Label Allocation for Backup Tunnels”, draft-swallow-rsvp-bypass-label-00.txt, IETF Document, 10 pages, Oct. 1999.
Callon, et al., “A Framework for MPLS”, draft-ietf-mpls-framework-05.txt, IETF document, 69 pages, Sep. 1999.
Rosen, et al., “Multiprotocol Label Switching Architecture”, draft-ietf-mpls-arch-06.txt, IETF Document, 62 pages, Feb. 1999.
Rosen, et al., “MPLS Label Stack Encoding”, IETF document, draft-ietf-mpls-label-encaps-07.txt, 22 pages, Sep. 1999.
Andersson, et al., “LDP Specification”, IETF document, draft-ietf-mpls-1dp-06.txt, 124 pages, Oct. 1999.
Jamoussi, Nortel Networks Corp., “Constraint-Based LSP Setup Using LDP”, draft-ietf-mpls-cr-Idp-03.txt, IETF Document, pp. 1-39, Sep. 1999.
Guerin, “Qos Routing in Networks with Inaccurate Information: Theory and Algorithms”, IEEE/ACM Transactions on Networking, vol. 7, No. 3, cover and pp. 350-364, Jun. 1999.
Parekh, et al. “A Generalized
Bayard Djenane M.
Dharia Rupal
LandOfFree
Unique address space and method for a transport network does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Unique address space and method for a transport network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Unique address space and method for a transport network will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3679521