Node, packet communication network, packet communication...

Multiplex communications – Data flow congestion prevention or control – Control of data admission to the network

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S238000, C370S395210, C370S395520

Reexamination Certificate

active

07457240

ABSTRACT:
The present invention relates to a node, a packet communication network, and a packet communication method and program. The node of the present invention is one which includes a section which advertises to other nodes link state information which indicates the state of links which are connected to this node, a section which establishes a packet forwarding path according to the link state information which is included in the advertisement by the advertisement section, and a traffic observation section which observes the traffic and outputs its observations as traffic observation results.

REFERENCES:
patent: 5825772 (1998-10-01), Dobbins et al.
patent: 6480468 (2002-11-01), Kishigami et al.
patent: 6708000 (2004-03-01), Nishi et al.
patent: 7136357 (2006-11-01), Soumiya et al.
patent: 2003/0118027 (2003-06-01), Lee et al.
patent: 2004/0091198 (2004-05-01), Graves
patent: 1 152 631 (2001-11-01), None
patent: 10-065687 (1998-03-01), None
patent: 10-242989 (1998-09-01), None
patent: 10-285168 (1998-10-01), None
patent: 10-327163 (1998-12-01), None
patent: 11-098183 (1999-04-01), None
patent: 11-98183 (1999-04-01), None
patent: 2000-078188 (2000-03-01), None
patent: 2000-138688 (2000-05-01), None
patent: 2001-045053 (2001-02-01), None
patent: 2002-026990 (2002-01-01), None
patent: WO-01/69862 (2001-09-01), None
J. Moy; “OSPF Version 2”; IETF RFC 2328; pp. 1-244; Apr. 1998.
R. Coltun; “The OSPF Opaque LSA Option”; IETF RFC 2370; pp. 1-15; Jul. 1998.
A. Banerjee et al.; “Generalized Multiprotocol Label Switching: An Overview of Routing and Management Enhancements”; IEEE Communications Magazine; p. 144-150; Jan. 2001.
A. Banerjee et al.; “Generalized Multiprotocol Label Switching: An Overview of Signaling Enhancements and Recovery Techniques”; IEEE Communications Magazine; pp. 144-151; Jul. 2001.
K. Kompella et al.; “OSPF Extentions in Support of Generalized MPLS”; Internet Draft, draft-ietf-ccamp-ospf-gmpls-extensions-08.txt (work in progress); pp. 1-12; Aug. 2002.
E. Oki et al.; “Multi-Layer Traffic Engineering in Photonic IP Networks”; The Institute of Electronics; Information and Communication Engineers; Technical Report of IEICE, PS2001-102; pp. 43-46; Jan. 18, 2002.
E. Oki et al.; “A Heuristic Multi-Layer Optimum Topology Design Scheme Based on Traffic Measurement for IP + Photonic Networks”; Proc. of Optical Fiber Communications (OFC) 2002; pp. 104-105; Mar. 2002.
E. Oki et al.; “Multi-Layer Traffic Engineering in GMPLS Networks”; The Institute of Electronics; Information and Communication Engineers; B-7-118; p. 345; Mar. 2001.
K. Sato et al.; “GMPLS-Based Photonic Multilayer Router (Hiraki Router) Architecture: An Overview of Traffic Engineering and Signaling Technology”; IEEE Communications Magazine; vol. 40, No. 3, pp. 96-101; Mar. 2002.
N. Yamanaka et al.; “Traffic engineering and signaling technologies in photonic-GMPLS-router networks”; 2002 Workshop on High Performance Switching and Routing; pp. 142-146; May 2002.
G. Apostolopoulos et al.. “RFC2676: QoS Routing Mechanisms and OSPF Extensions”, Aug. 1999.

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

Node, packet communication network, packet communication... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Node, packet communication network, packet communication..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Node, packet communication network, packet communication... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4047741

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