US6137798A — Connectionless network for routing cells with con…

Claim 1

Independent Claim 189 words

A data communication system comprising: a plurality of interworking units for accommodating local area networks, said interworking units segmenting a packet received from said local area networks into a plurality of cells for transmission to an asynchronous transfer mode (ATM) network, said cells containing a connectionless address designating one of said local area networks, a virtual path identifier (VPI) designating a permanent virtual connection, and a virtual channel identifier (VCI) identifying said packet; and the ATM network comprising a plurality of cross-connect nodes interconnected by communication links, said cross-connect nodes establishing a plurality of said permanent virtual connections between said interworking units and said nodes and between said nodes in pairs, receiving the cells from the interworking units and routing the cells having VCIs of equal value through the permanent virtual connections to said one of the interworking units according to the connectionless address and the VPI contained in the cells, said one of the interworking units assembling the cells having VCIs of equal value into a packet and routing the packet to said one of the local area networks according to the connectionless address transmitted by the packet.

Claim 2

Dependent Claim 189 words

A data communication system comprising: a plurality of interworking units for accommodating local area networks, said interworking units segmenting a packet received from said local area networks into a plurality of cells for transmission to an asynchronous transfer mode (ATM) network, said cells containing a connectionless address designating one of said local area networks, a virtual path identifier (VPI) designating a permanent virtual connection, and a virtual channel identifier (VCI) identifying said packet; and the ATM network comprising a plurality of cross-connect nodes interconnected by communication links, said cross-connect nodes establishing a plurality of said permanent virtual connections between said interworking units and said nodes and between said nodes in pairs, receiving the cells from the interworking units and routing the cells having VCIs of equal value through the permanent virtual connections to said one of the interworking units according to the connectionless address and the VPI contained in the cells, said one of the interworking units assembling the cells having VCIs of equal value into a packet and routing the packet to said one of the local area networks according to the connectionless address transmitted by the packet.

Claim 3

Dependent Claim 57 words

A data communication system as claimed in claim 1, wherein each of said interworking units comprises: a counter for incrementing a count value in response to one of said cells that define the beginning of a packet; and means for writing said count value into a VCI field of each of said cells that comprise said packet.

Claim 4

Dependent Claim 191 words

A data communication system as claimed in claim 1, wherein each of said interworking units comprises: a VCI status memory for storing a status indication of each of a plurality of VCIs in a plurality of storage locations; a counter for incrementing a count value in response to one of said cells that defines the beginning of a packet and reading the status indication of one of said VCIs using the count value as an address pointer; a VCI insertion circuit for inserting a VCI into a VCI field of each of said cells; means for writing a busy indication into said one of the locations and causing said VCI insertion circuit to insert said count value into said VCI field if the read status indication is an idle indication; a buffer connected to the output of the VCI insertion circuit for storing a sequence of cells in a queue and forwarding the cells to one of the cross-connect nodes; and means for writing an idle indication into said one of the locations of response to one of the cells from said buffer which corresponds to the end of said packet.

Claim 5

Dependent Claim 140 words

A data communication system as claimed in claim 1, wherein each of said interworking units comprises: a VCI insertion circuit for inserting a VCI into a VCI field of each of said cells; a first-in-first-out (FIFO) memory for storing a plurality of idle VCIs, the FIFO memory being responsive to one of said cells that defines the beginning of a packet for forwarding one of the stored VCIs to said VCI insertion circuit to insert the forwarded VCI into said VCI field; a buffer connected to the output of the VCI insertion circuit for storing a sequence of cells in a queue and forwarding the cells to one of the cross-connect nodes; and means for detecting the VCI of a cell forwarded from said buffer at the end of said packet and storing the detected VCI into the FIFO memory.

Claim 6

Dependent Claim 160 words

A data communication system as claimed in claim 1, wherein each of said interworking units comprises: a VCI status table for storing a status indication of each of a plurality of VCIs in a plurality of storage locations; means for detecting the VCI contained in each of the cells received from the ATM network, reading a status indication from one of said locations of the table corresponding to the detected VCI, writing a busy indication into said one of the locations and recognizing a cell from the ATM network as the beginning of a packet if the read status indication is an idle indication, and writing an idle indication into said one of the locations in response to a cell from the ATM network corresponding to the end of said packet; a buffer; and means for storing the cells from the ATM network into said buffer so that the cells having VCIs of equal value are assembled in a queue.

Claim 7

Dependent Claim 57 words

A data communication system as claimed in claim 1, wherein each of said cross-connect nodes comprises: a counter for incrementing a count value in response to one of said cells that defines the beginning of a packet; and means for inserting said count value into a VCI field of each of said cells that comprise said packet.

Claim 8

Dependent Claim 189 words

A data communication system as claimed in claim 1, wherein each of said cross-connect nodes comprises: a VCI status memory for storing a status indication of each of a plurality of VCIs in a plurality of storage locations; a counter for incrementing a count value in response to one of said cells that defines the beginning of a packet and reading the status indication of one of said VCIs using the count value as an address pointer; a VCI insertion circuit for inserting a VCI into a VCI field of each of said cells; means for writing a busy indication into said one of the locations and causing said VCI insertion circuit to insert said count value into said VCI field if the read status indication is an idle indication; a buffer connected to the output of the VCI insertion circuit for storing a sequence of cells in a queue and forwarding the cells to a communication link; and means for writing an idle indication into said one of the locations of response to one of the cells from said buffer which corresponds to the end of said packet.

Claim 9

Dependent Claim 146 words

A data communication system as claimed in claim 1, wherein each of said cross-connect nodes comprises: a VCI insertion circuit for inserting a VCI into a VCI field of each of said cells; a first-in-first-out (FIFO) memory for storing a plurality of idle VCIs, the FIFO memory being responsive to one of said cells that defines the beginning of a packet for forwarding one of the stored VCIs to said VCI insertion circuit to insert the forwarded VCI into said VCI field; a buffer connected to the output of the VCI insertion circuit for storing a sequence of cells in a queue and forwarding the cells to one of the cross-connect nodes or one of said interworking units; and means for detecting the VCI of a cell forwarded from said buffer at the end of said packet and storing the detected VCI into the FIFO memory.

Claim 10

Dependent Claim 192 words

A data communication system as claimed in claim 1, wherein each of said cross-connect nodes comprises: a VCI status memory for storing a status indication of each of a plurality of VCIs in a plurality of storage locations; means for detecting the VCI contained in each of the cells received via one of said links, reading a status indication from one of said locations of the table corresponding to the detected VCI, writing a busy indication into said one of the locations and recognizing a cell from the ATM network as the beginning of said packet if the read status indication is an idle indication, and writing an idle indication into said one of the locations in response to a cell received via said one of said permanent virtual connections corresponding to the end of said packet; a buffer for storing cells received via said one of said permanent virtual connections; a switch; and means for controlling said switch according to the connectionless address contained in the cells stored in said buffer to establish a connection in said switch and controlling said buffer to forward the stored cells to the established connection.

Claim 11

Dependent Claim 78 words

A data communication system as claimed in claim 9, wherein each of said cross-connect nodes further comprises: means for receiving the cells from said switch and producing an output signal in response to one of the received cells that defines the beginning of a packet; a counter for incrementing a count value in response to said output signal; and means for writing said count value into a VCI field of each of said cells forwarded from said switch.

Claim 12

Dependent Claim 209 words

A data communication system as claimed in claim 9, wherein each of said cross-connect nodes comprises: a VCI status memory for storing a status indication of each of a plurality of VCIs in a plurality of storage locations; means for receiving the cells from said switch and producing an output signal in response to one of the received cells that defines the beginning of a packet; a counter for incrementing a count value in response to said output signal and reading the status indication of one of said VCIs using the count value as an address pointer; a VCI insertion circuit for inserting a VCI into a VCI field of each of said cells; means for writing a busy indication into said one of the locations and causing said VCI insertion circuit to insert said count value into said VCI field if the read status indication is an idle indication; a buffer connected to the output of the VCI insertion circuit for storing a sequence of cells in a queue and forwarding the cells to a communication link; and means for writing an idle indication into said one of the locations in response to one of the cells from said buffer which corresponds to the end of said packet.

Claim 13

Dependent Claim 166 words

A data communication system as claimed in claim 9, wherein each of said cross-connect nodes comprises: a VCI insertion circuit for inserting a VCI into a VCI field of each of said cells; means for receiving the cells from said switch and producing an output signal in response to one of the received cells that defines the beginning of a packet; a first-in-first-out (FIFO) memory for storing a plurality of idle VCIs, the FIFO memory being responsive to said output signal for forwarding one of the stored VCIs to said VCI insertion circuit to insert the forwarded VCI into said VCI field; a buffer connected to the output of the VCI insertion circuit for storing a sequence of cells in a queue and forwarding the cells to one of the cross-connect nodes or one of said interworking units; and means for detecting the VCI of a cell forwarded from said buffer at the end of said packet and storing the detected VCI into the FIFO memory.

Claim 14

Dependent Claim 131 words

A data communication system as claimed in claim 1, further comprising an address resolution server connected via said ATM network to said interworking units via said permanent virtual connections, wherein each of said interworking units further comprising: an address resolution table for mapping said connectionless addresses to destination network addresses; and means for making a search through said address resolution table when a packet is received from one of the local area networks for detecting a connectionless address corresponding to a destination network address contained in the packet and transmitting a request packet to said address resolution server to obtain a reply packet if the corresponding connectionless address is not found in said address resolution table and updating the address resolution table with a connectionless address contained in the reply packet.

Claim 15

Dependent Claim 177 words

A data communication system for a plurality of user end systems, the communication system comprising: an asynchronous transfer mode network having a plurality of connecting points at the periphery of the network, said network comprising: means for segmenting a packet from said user end systems into a plurality of cells containing a connectionless address designating one of said connecting points, a virtual path identifier (VPI) designating one of a plurality of permanent virtual connections, and a virtual channel identifier (VCI) identifying said packet; means for routing the cells having VCIs of equal value through a permanent virtual connection designated by the VPI contained in the cells toward a destination connecting point designated by the connectionless address contained in the cells, and rewriting the VPI and VCI of said cells when the cells are routed via a further permanent virtual connection until said destination connecting point is reached; and means for assembling the cells having VCIs of equal value at the destination connecting point into a packet and transmitting the packet to one of the user end systems.

Claim 16

Dependent Claim 177 words

A data communication system for a plurality of user end systems, the communication system comprising: an asynchronous transfer mode network having a plurality of connecting points at the periphery of the network, said network comprising: means for segmenting a packet from said user end systems into a plurality of cells containing a connectionless address designating one of said connecting points, a virtual path identifier (VPI) designating one of a plurality of permanent virtual connections, and a virtual channel identifier (VCI) identifying said packet; means for routing the cells having VCIs of equal value through a permanent virtual connection designated by the VPI contained in the cells toward a destination connecting point designated by the connectionless address contained in the cells, and rewriting the VPI and VCI of said cells when the cells are routed via a further permanent virtual connection until said destination connecting point is reached; and means for assembling the cells having VCIs of equal value at the destination connecting point into a packet and transmitting the packet to one of the user end systems.

Claim 17

Dependent Claim 55 words

A data communication system as claimed in claim 14, wherein said segmenting means comprises: a counter for incrementing a count value in response to one of said cells that defines the beginning of a packet; and means for writing said count value into the VCI field of each of said cells that comprise said packet.

Claim 18

Dependent Claim 179 words

A data communication system as claimed in claim 14, wherein said segmenting means comprises: a VCI status memory for storing a status indication of each of a plurality of VCIs in a plurality of storage locations; a counter for incrementing a count value in response to one of said cells that defines the beginning of a packet and reading the status indication of one of said VCIs using the count value as an address pointer; a VCI insertion circuit for inserting a VCI into a VCI field of each of said cells; means for writing a busy indication into said one of the locations and causing said VCI insertion circuit to insert said count value into said VCI field if the read status indication is an idle indication; a buffer connected to the output of the VCI insertion circuit for storing a sequence of cells in a queue; and means for writing an idle indication into said one of the locations in response to one of the cells from said buffer which corresponds to the end of said packet.

Claim 19

Dependent Claim 128 words

A data communication system as claimed in claim 14, wherein said segmenting means comprises: a VCI insertion circuit for inserting a VCI into a VCI field of each of said cells; a first-in-first-out (FIFO) memory for storing a plurality of idle VCIs, the FIFO memory being responsive to one of said cells that defines the beginning of a packet for forwarding one of the stored VCIs to said VCI insertion circuit to insert the forwarded VCI into said VCI field; a buffer connected to the output of the VCI insertion circuit for storing a sequence of cells in a queue; and means for detecting the VCI of a cell forwarded from said buffer at the end of said packet and storing the detected VCI into the FIFO memory.

Claim 20

Dependent Claim 146 words

A data communication system as claimed in claim 14, wherein said assembling means comprises: a VCI status table for storing a status indication of each of a plurality of VCIs in a plurality of storage locations; means for receiving cells and detecting the VCI contained in each of the cells, reading status indication from one of said locations of the table corresponding to the detected VCI, writing a busy indication into said one of the locations and recognizing a received cell as the beginning of a packet if the read status indication is an idle indication, and writing an idle indication into said one of the locations in response to a received cell corresponding to the end of said packet; a buffer; and means for storing the received cells into said buffer so that the cells having VCIs of equal value are assembled in a queue.

Claim 21

Dependent Claim 190 words

A data communication system as claimed in claim 14, wherein said routing means comprises: a VCI status table for storing a status indication of each of a plurality of VCIs in a plurality of storage locations; means for detecting the VCI contained in each of the cells received via one of said links, reading a status indication from one of said locations of the table corresponding to the detected VCI, writing a busy indication into said one of the locations and recognizing a cell from the ATM network as the beginning of said packet if the read status indication is an idle indication, and writing an idle indication into said one of the locations in response to a cell received via said one of said permanent virtual connections corresponding to the end of said packet; a buffer for storing cells received via said one of said permanent virtual connections; a switch; and means for controlling said switch according to the connectionless address contained in the cells stored in said buffer to establish a connection in said switch and controlling said buffer to forward the stored cells to the established connection.

Claim 22

Dependent Claim 153 words

A data communication method for a network which includes a plurality of connecting points at the periphery thereof, comprising: segmenting a packet from a source user end system into a plurality of cells containing a connectionless address designating one of said connecting points, a virtual path identifier (VPI) designating one of a plurality of permanent virtual connections, and a virtual channel identifier (VCI) identifying said packet; routing the cells having VCIs of equal value through a permanent virtual connection designated by the VPI contained in the cells toward a destination connecting point designated by the connectionless address contained in the cells; rewriting the VPI and VCI of said cells when the cells are routed via a further permanent virtual connection until said destination connecting point is reached; assembling the cells having VCIs of equal value at the destination connecting point into a packet; and transmitting the packet to a destination user end system.

Claim 23

Dependent Claim 153 words

A data communication method for a network which includes a plurality of connecting points at the periphery thereof, comprising: segmenting a packet from a source user end system into a plurality of cells containing a connectionless address designating one of said connecting points, a virtual path identifier (VPI) designating one of a plurality of permanent virtual connections, and a virtual channel identifier (VCI) identifying said packet; routing the cells having VCIs of equal value through a permanent virtual connection designated by the VPI contained in the cells toward a destination connecting point designated by the connectionless address contained in the cells; rewriting the VPI and VCI of said cells when the cells are routed via a further permanent virtual connection until said destination connecting point is reached; assembling the cells having VCIs of equal value at the destination connecting point into a packet; and transmitting the packet to a destination user end system.

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	2003-10-24	2004-04-24	2004-10-24	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	2007-10-24	2008-04-24	2008-10-24	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	2011-10-24	2012-04-24	2012-10-24	$7700.00	Window Closed / Lapsed

Connectionless network for routing cells with connectionless address, VPI and packet-identifying VCI

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag