← Back to Patent Explorer
US6343322B2 Expired / Lapsed US ⏱️ 0.0 years remaining

IP over ATM system using control messages to set up cut-through paths or bypass pipes in routers

Assignee: Toshiba Corp
•
Filing: 1998-07-27
•
Granted: 2002-01-29
•
Expires: 2018-07-27
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A packet transfer scheme for transferring packets at a boundary of a plurality networks is disclosed. A network interconnection apparatus (router) communicates with a previous hop node in one of the plurality of networks by a first control message including a first identification information for identifying an upstream path from the previous hop node and a specification information for specifying a group of packets to be transferred on the upstream path, and with a next hop node in another of the plurality of networks by a second control message including a second identification information for identifying a downstream path to the next hop node and a specification information for specifying a group of packets to be transferred on the downstream path. Then, the network interconnection apparatus stores a first identifier at a layer lower than layer 3 of the upstream path and a second identifier at a layer lower than layer 3 of the downstream path corresponding to the upstream path, according to the first and second control messages, and transfers a packet from the upstream path to the corresponding downstream path, referring to the memory.

Inventors

  • 👤 Kenichi Nagami
  • 👤 Junko Ami
  • 👤 Yasuhiro Katsube
  • 👤 Takeshi Saito
  • 👤 Hiroshi Esaki

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-25 07:09
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/28; H04L12/46; H04L12/4604; H04L12/4608; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0478; H04L12/54; H04L12/56; H04L12/5601; H04L2012/5619; H04L2012/562; H04L2012/5638; H04L2012/5665; H04L2012/5667

Claims Analysis

Total Claims: 25
Claim 1
Independent Claim 216 words
A network interconnection apparatus for transferring packets at a boundary of a plurality of networks, the apparatus comprising: a control message processing unit configured to communicate with a previous hop node in one of the plurality of networks by a first control message including a first identification information for identifying an upstream path from the previous hop node to the network interconnection apparatus and a specification information for specifying a group of packets to be transferred on the upstream path, and configured to communicate with a next hop node in another of the plurality of networks by a second control message including a second identification information for identifying a downstream path from the network interconnection apparatus to the next hop node and a specification information for specifying a group of packets to be transferred on the downstream path; a memory unit configured to store a first identifier at a layer lower than layer 3 of the upstream path and a second identifier at a layer lower than layer 3 of the downstream path corresponding to the upstream path, according to the first and second control messages used by the control message processing unit; and a transfer unit configured to transfer a packet from the upstream path to the corresponding downstream path, referring to the memory unit.
Claim 2
Dependent Claim 216 words
A network interconnection apparatus for transferring packets at a boundary of a plurality of networks, the apparatus comprising: a control message processing unit configured to communicate with a previous hop node in one of the plurality of networks by a first control message including a first identification information for identifying an upstream path from the previous hop node to the network interconnection apparatus and a specification information for specifying a group of packets to be transferred on the upstream path, and configured to communicate with a next hop node in another of the plurality of networks by a second control message including a second identification information for identifying a downstream path from the network interconnection apparatus to the next hop node and a specification information for specifying a group of packets to be transferred on the downstream path; a memory unit configured to store a first identifier at a layer lower than layer 3 of the upstream path and a second identifier at a layer lower than layer 3 of the downstream path corresponding to the upstream path, according to the first and second control messages used by the control message processing unit; and a transfer unit configured to transfer a packet from the upstream path to the corresponding downstream path, referring to the memory unit.
Claim 3
Dependent Claim 61 words
The apparatus according to claim 1 , further comprising: another memory unit configured to store a destination information including a layer 3 address regarding a destination and a corresponding next hop information, wherein the control message processing unit communicates with the next hop node according to the destination information and the corresponding next hop information stored in said another memory unit.
Claim 4
Dependent Claim 44 words
The apparatus according to claim 2 , wherein the control message processing unit starts to communicate with at least one of the next hop node and the previous hop node when said another memory unit indicates a new information based on a routing protocol.
Claim 5
Dependent Claim 41 words
The apparatus according to claim 2 , further comprising a transfer processing unit configured to transfer a packet to the next hop node, referring to said another memory unit according to a layer 3 address regarding a destination of the packet.
Claim 6
Dependent Claim 61 words
The apparatus according to claim 4 , further comprising a receiving unit configured to receive a packet through a virtual connection, and to transfer the packet to the transfer unit when said memory unit stores an identifier of the virtual connection as the first identifier that corresponds to the second identifier and otherwise transfer the packet to the transfer processing unit.
Claim 7
Dependent Claim 54 words
The apparatus according to claim 5 , wherein the receiving unit transfers a packet to the transfer processing unit when the packet is received through a prescribed virtual connection, and the control message processing unit processes the first control message indicating another virtual connection other than the prescribed virtual connection as the upstream path.
Claim 8
Dependent Claim 29 words
The apparatus according to claim 1 , wherein the transfer unit uses a first virtual connection as the upstream path and a second virtual connection as the downstream path.
Claim 9
Dependent Claim 35 words
The apparatus according to claim 7 , wherein the memory unit stores an identifier of the first virtual connection as the first identifier and an identifier of the second virtual connection as the second identifier.
Claim 10
Dependent Claim 59 words
The apparatus according to claim 8 , wherein, when at least one of the first and second virtual connections pass through a switch for switching virtual connections, the control message processing unit uses an identification information for identifying said at least one of the first and second virtual connections uniquely in a corresponding one of the plurality of networks.
Claim 11
Dependent Claim 49 words
The apparatus according to claim 9 , further comprising a setup unit configured to set up said at least one of the first and second virtual connections by signaling before the memory unit stores a corresponding one of the first and second identifiers as available for the transfer unit.
Claim 12
Dependent Claim 37 words
The apparatus according to claim 1 , wherein the control message processing unit uses at least one of addresses regarding a source or a destination of the group of packets to be transferred as the specification information.
Claim 13
Dependent Claim 50 words
The apparatus according to claim 1 , wherein the transfer unit transfers another packet from the upstream path to the corresponding downstream path, said packet being toward one destination and said another packet being toward another destination, both said packet and said another packet belonging to the group of packets.
Claim 14
Dependent Claim 46 words
The apparatus according to claim 1 , wherein the control message processing unit uses the first identifier to be stored in the memory unit as the first identification information, and uses the second identifier to be stored in the memory unit as the second identification information.
Claim 15
Dependent Claim 49 words
The apparatus according to claim 1 , wherein the control message processing unit starts to communicate with one of the next hop node and the previous hop node when the other of the next hop node and the previous hop node starts to communicate with the network interconnection apparatus.
Claim 16
Dependent Claim 50 words
The apparatus according to claim 1 , wherein the control message processing unit starts to communicate with one of the next hop node and the previous hop node when the network interconnection apparatus receives a packet from the previous hop node or transmits a packet to the next hop node.
Claim 17
Dependent Claim 40 words
The apparatus according to claim 1 , wherein the control message processing unit starts to communicate with one of the next hop node and the previous hop node according to statistical information regarding transferring packets to the next hop node.
Claim 18
Dependent Claim 98 words
The apparatus according to claim 1 , wherein the control message processing unit communicates with another previous hop node by a third control message including a third identification information for identifying another upstream path from said another previous hop node to the network interconnection apparatus and a specification information for specifying a group of packets to be transferred on said another upstream path, and the memory unit stores a third identifier at a layer lower than layer 3 of said another upstream path, such that the first and third identifiers are stored in correspondence with the second identifier.
Claim 19
Dependent Claim 55 words
The apparatus according to claim 17 , wherein the transfer unit transfers all packets of one protocol data unit from the upstream path of the first identifier or said another upstream path of the third identifier to the downstream path of the second identifier before starting to transfer a packet of another protocol data unit.
Claim 20
Dependent Claim 42 words
The apparatus according to claim 1 , wherein the memory unit stores the second identifier while communication regarding the second control message is repeated and deletes the second identifier when the communication regarding the second control message stops for a predetermined period.
Claim 21
Dependent Claim 36 words
The apparatus according to claim 1 , wherein the memory unit deletes the second identifier when a delete control message is received from at least one of the next hop node and the previous hop node.
Claim 22
Dependent Claim 33 words
The apparatus according to claim 1 , wherein the memory unit deletes the first identifier when a packet from the upstream path of the first identifier is not received for a predetermined period.
Claim 23
Independent Claim 182 words
A method of transferring packets at a boundary of a plurality of networks, the method comprising the steps of: communicating with a previous hop node in one of the plurality of networks by a first control message including a first identification information for identifying an upstream path from the previous hop node and a specification information for specifying a group of packets to be transferred on the upstream path; communicating with a next hop node in another of the plurality of networks by a second control message including a second identification information for identifying a downstream path to the next hop node and a specification information for specifying a group of packets to be transferred on the downstream path; storing, in a memory, a first identifier at a layer lower than layer 3 of the upstream path and a second identifier at a layer lower than layer 3 of the downstream path corresponding to the upstream path, according to the first and second control messages; and transferring a packet from the upstream path to the corresponding downstream path, referring to the memory.
Claim 24
Independent Claim 182 words
A method of transferring packets at a boundary of a plurality of networks, the method comprising the steps of: communicating with a previous hop node in one of the plurality of networks by a first control message including a first identification information for identifying an upstream path from the previous hop node and a specification information for specifying a group of packets to be transferred on the upstream path; communicating with a next hop node in another of the plurality of networks by a second control message including a second identification information for identifying a downstream path to the next hop node and a specification information for specifying a group of packets to be transferred on the downstream path; storing, in a memory, a first identifier at a layer lower than layer 3 of the upstream path and a second identifier at a layer lower than layer 3 of the downstream path corresponding to the upstream path, according to the first and second control messages; and transferring a packet from the upstream path to the corresponding downstream path, referring to the memory.
Claim 25
Dependent Claim 68 words
The method according to claim 22 , further comprising: storing, prior to the step of communicating with the next hop node, a destination information including a layer 3 address regarding a destination and a corresponding next hop information in another memory, wherein the step of communicating with the next hop node communicates according to the destination information and the corresponding next hop information stored in said another memory.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2005-01-28 2005-07-30 2006-01-29 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2009-01-28 2009-07-30 2010-01-29 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2013-01-28 2013-07-30 2014-01-29 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag