Node apparatus

Multiplex communications – Pathfinding or routing – Switching a message which includes an address header

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S395210, C370S473000

Reexamination Certificate

active

07974289

ABSTRACT:
To satisfy a quality required for each traffic and perform switching for a packet segmented into cells without packet reassembly, there is provided a node apparatus including a header processing section (2) for determining an output destination of an incoming packet and a quality class from the header information of the packet, a route table (3), and a quality description table (4), and storing the packet in an output queue (6) determined by the determined output destination and quality class, an output control section (7) for reading out a packet from the output queue in accordance with the quality set for each output queue (6) and sending out the read packet through a VC determined by the determined output destination and quality class, and a quality description table (4) which has at least a virtual dedicated network number field, a destination address/mask length field, a source address/mask length field, a fourth-layer protocol/destination port number field, and a destination port number field and in which each field is made blank when any value can be set. In the node apparatus, a packet segmented into cells and arriving from each input VC is temporarily stored in a packet queue (26) corresponding to each input VC. When the final cell of the packet arrives, 1-packet cells are moved altogether to an output queue (27) corresponding to the destination IP address contained in the start cell and output to a corresponding output VC by an output section (28).

REFERENCES:
patent: 5455825 (1995-10-01), Lauer et al.
patent: 5930259 (1999-07-01), Katsube et al.
patent: 5936958 (1999-08-01), Soumiya et al.
patent: 5963555 (1999-10-01), Takase et al.
patent: 6034964 (2000-03-01), Fukushima et al.
patent: 6067298 (2000-05-01), Shinohara
patent: 6091709 (2000-07-01), Harrison et al.
patent: 6104713 (2000-08-01), Nagami et al.
patent: 6144635 (2000-11-01), Nakagawa
patent: 6188697 (2001-02-01), Umehira et al.
patent: 6195331 (2001-02-01), Tani
patent: 6212163 (2001-04-01), Aida
patent: 6259699 (2001-07-01), Opalka et al.
patent: 6262986 (2001-07-01), Oba et al.
patent: 6292489 (2001-09-01), Fukushima et al.
patent: 6345051 (2002-02-01), Gupta et al.
patent: 6381244 (2002-04-01), Nishimura et al.
patent: 6538992 (2003-03-01), Subbiah et al.
patent: 6611522 (2003-08-01), Zheng et al.
patent: 6721329 (2004-04-01), Van Driel
patent: 6738381 (2004-05-01), Agnevik et al.
patent: 7289517 (2007-10-01), Shimonishi
patent: 6-62038 (1994-03-01), None
patent: 7-273801 (1995-10-01), None
patent: 8-130543 (1996-05-01), None
patent: 9-93256 (1997-04-01), None
patent: 9-98189 (1997-04-01), None
patent: 9-149035 (1997-06-01), None
patent: 9-321770 (1997-12-01), None
patent: 10-56452 (1998-02-01), None
patent: 10-56456 (1998-02-01), None
patent: 10-56459 (1998-02-01), None
patent: 10-294736 (1998-11-01), None
patent: WO 97/50276 (1997-12-01), None
Supplementary European Search Report corresponding to EP 99 929 821.9 dated Jun. 22, 2009, 6 pages.
P. Vaananen et al., “Framework for Traffic Management in MPLS Networks”, Mar. 1998, XP015036369, pp. 1-55.
D. Grossman et al., “Multiprotocol Encapsulation over ATM Adaptation Layer 5”, Sep. 1999, XP015008467, pp. 1-23.

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 apparatus 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 apparatus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Node apparatus will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2685974

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