Search Images Maps Play YouTube News Gmail Drive More »
Sign in
Screen reader users: click this link for accessible mode. Accessible mode has the same essential features but works better with your reader.

Patents

  1. Advanced Patent Search
Publication numberUS20020122420 A1
Publication typeApplication
Application numberUS 09/938,923
Publication dateSep 5, 2002
Filing dateAug 24, 2001
Priority dateJun 17, 1998
Also published asCA2335021A1, EP1088413A1, EP1088413A4, US6310893, WO1999066662A1
Publication number09938923, 938923, US 2002/0122420 A1, US 2002/122420 A1, US 20020122420 A1, US 20020122420A1, US 2002122420 A1, US 2002122420A1, US-A1-20020122420, US-A1-2002122420, US2002/0122420A1, US2002/122420A1, US20020122420 A1, US20020122420A1, US2002122420 A1, US2002122420A1
InventorsRuixi Yuan, Bora Akyol, William Strayer
Original AssigneeGte Internetworking Incorporated
Export CitationBiBTeX, EndNote, RefMan
External Links: USPTO, USPTO Assignment, Espacenet
Method and system for connectionless communication in a cell relay satellite network
US 20020122420 A1
Abstract
A method and system for communicating a packet over a cell relay satellite network, without establishing a connection in the cell relay satellite network, comprises the steps of segmenting the packet into a number of segments at a source node in the communications network, generating for each of the segments a fixed size cell that includes a cell header and a payload with a prefix, a downlink beam locator, and a source node identifier included in the cell header, and inserting each segment into the payload of each generated cell, respectively, and transmitting the cells to the cell relay satellite. A cell relay satellite receives each transmitted cell from the source node, and broadcasts each cell on a downlink beam corresponding to the downlink beam locator in each cell header. A destination node receives each broadcasted cell on the downlink beam, and re-assembles the packet from the received cells. Specifically, the destination node re-assembles the packet by identifying the cells corresponding to the packet, and appending the segments inside the cell payloads together, in the order of receipt of the identified cells. Finally, the destination node may identify a destination address in the packet, and may route the packet to the identified destination address, which may reside in another communications network.
Images(8)
Previous page
Next page
Claims(13)
What is claimed is:
1. A method for communicating a packet in a communications network comprising a cell relay satellite, said method comprising the steps of:
dividing the packet into segments at a source in the communications network;
generating a cell for each of the segments, wherein each cell includes a first portion and a second portion with a prefix, a downlink beam locator, and a source identifier included in the first portion;
inserting each of the segments into the second portion of each of the generated cells, respectively; and
transmitting the generated cells to the cell relay satellite.
2. The method of claim 1, wherein said generating step further comprises the step of:
including a suffix in each first portion of the generated cells.
3. The method of claim 1, wherein said generating step further comprises the step of:
identifying a destination in the communications network corresponding to the downlink beam locator.
4. The method of claim 1, wherein said dividing step further comprises the step of:
prepending a header portion to the packet;
appending a trailer portion to the packet; and
inserting a null padding portion between the trailer and the packet so that a combined length of the packet, the header portion, the trailer portion, and the null padding portion equals to an integer multiple of the length of the second portion of each of the generated cells.
5. A method for communicating a packet in a first communications network comprising a cell relay satellite, said method comprising the steps of:
receiving, at a first destination in the first communications network, a plurality of cells each comprising:
a first portion including a prefix, a downlink beam locator, and a source identifier; and
a second portion including a segment of a packet; and
re-assembling the packet from the segments in the second portion of the received cells.
6. The method of claim 5, wherein said re-assembling step further comprises the steps of:
identifying the cells corresponding to the packet;
appending the segments together in order of receipt of the identified cells.
7. The method of claim 5 further comprising the steps of:
identifying in the packet an address of a second destination in a second communications network interfacing the first destination; and
routing the packet to the identified second destination in the second communications network.
8. A satellite earth station for communicating a packet without establishing a connection in a communications network comprising a cell relay satellite, said system comprising:
a memory comprising a packet converter program for segmenting the packet into a number of segments, and for generating a cell for each of the segments, wherein each cell includes a first portion and a second portion, and for including a prefix, a downlink beam locator, and a node identifier in the first portion of each generated cell, and for inserting each of the segments into the second portion of the generated cells, respectively;
a processor for running the packet converter program; and
a transmitter for transmitting the generated cells to the cell relay satellite.
9. A satellite earth station for communicating a packet without establishing a connection in a communications network comprising a cell relay satellite, said system comprising:
a receiver for receiving a plurality of cells each comprising:
a first portion including a prefix, a downlink beam locator, and a node identifier; and
a second portion including a segment of a packet;
a memory comprising a packet re-assembler program for re-assembling the packet from the segments in the second portion of the received cells; and
a processor for running the packet re-assembler program.
10. A computer-readable medium capable of configuring a satellite earth station to perform a method for communicating a packet without establishing a connection in a communications network comprising a cell relay satellite, said method comprising the steps of:
dividing the packet into segments at a source in the communications network;
generating a cell for each of the segments, wherein each cell includes a first portion and a second portion with a prefix, a downlink beam locator, and a source identifier included in the first portion;
inserting each of the segments into the second portion of each of the generated cells, respectively; and
transmitting the generated cells to the cell relay satellite.
11. A computer-readable medium capable of configuring a satellite earth station to perform a method for communicating a packet without establishing a connection in a communications network comprising a cell relay satellite, said method comprising the steps of:
receiving, at a first destination in the first communications network, a plurality of cells each comprising:
a first portion including a prefix, a downlink beam locator, and a source identifier; and
a second portion including a segment of a packet; and
re-assembling the packet from the segments in the second portion of the received cells.
12. The computer-readable medium of claim 11, wherein said re-assembling step further comprises the steps of:
identifying the cells corresponding to the packet; and
appending the segments together in order of receipt of the cells.
13. A method for communicating a packet in a communications network comprising a cell relay satellite, said method comprising the steps of:
dividing the packet into segments at a source in the communications network;
generating a cell for each of the segments, wherein each cell includes a first portion and a second portion with a prefix, a downlink beam locator, and a source identifier included in the first portion;
inserting each of the segments into the second portion of each of the generated cells, respectively;
transmitting the generated cells to the cell relay satellite;
receiving the transmitted cells at a destination in the communications network; and
re-assembling the packet from the segments in the second portion of the received cells.
Description
BACKGROUND OF THE INVENTION

[0001] 1. Field of the Invention

[0002] The present invention generally relates to cell relay satellite communication networks, and more particularly, to connectionless cell relay satellite networks.

[0003] 2. Background of the Art

[0004] With the deployment of connection-oriented cell relay networks such as Asynchronous Transfer Mode (ATM) networks, there is a growing need for integrating cell relay networks with the existing packet-based networks, for example, Internet Protocol (IP) networks. In a connection-oriented network, the network must establish a connection (called a virtual circuit) between two nodes in the network with a signaling protocol before any information transfer can take place between the two nodes. Once the network establishes the connection between the two nodes, the network can identify and route the cells transmitted by the two nodes through the network. As a result, the existing cell relay networks must establish a connection between a source node and a destination node in the cell relay networks in order to transport IP traffic over the cell relay networks.

[0005] In general, satellite-based cell relay networks offer certain advantages over terrestrial cell relay networks. For example, a satellite-based cell relay network can provide rapid deployment of communication services over a wide geographical area, including remote, rural, urban, and inaccessible areas. Furthermore, satellite-based cell relay networks offer more flexibility in configuring a network and allocating capacity to different sites. Thus, there is a need for a cell relay satellite network that can support the traffic from the existing packet-based communication networks.

[0006] Connection-oriented cell relay satellite networks, however, have two significant disadvantages when transporting packet-based traffic from the existing networks. First, the connection-oriented cell relay satellite network must establish a connection between a source node and a destination node before any information transfer can take place between the source node and the destination node, and as a result, the information transfer will experience an initial delay due to the connection setup phase. Second, the satellite network must assign a unique identifier to each connection and manage the assignment of the identifiers so that the network can efficiently reuse each identifier when establishing a new connection.

[0007] Each of these two disadvantages are particularly magnified in a cell relay satellite network. A satellite footprint typically covers a wide geographical area, which may include large number of users, and thus, requires a large number of corresponding connection identifiers to support the users. Furthermore, each communication with, for example, a geosynchronous satellite typically experiences a 500 milliseconds round trip delay, which increases the delay due to the connection setup phase.

[0008] Thus, it is desirable to have a method and system for communicating packet-based traffic over a cell relay satellite network without establishing a connection in the cell relay satellite network, and thus, eliminating the above-mentioned disadvantages.

SUMMARY OF THE INVENTION

[0009] The present invention comprises a method and system for communicating a packet over a cell relay satellite network, without establishing a connection in the cell relay satellite network, by dividing the packet into a number of segments at a source node in the communications network, generating for each segment a fixed size cell that includes a cell header and a payload, with a prefix, a downlink beam locator, and a source node identifier inside each cell header, inserting each of the segments into the payload of each of the generated cells, respectively, and transmitting the cells to the cell relay satellite. The cell relay satellite receives each transmitted cell from the source node, and broadcasts each cell on a downlink beam corresponding to the downlink beam locator in each cell header.

[0010] A destination node in the cell relay satellite network receives each broadcasted cell on the downlink beam, and re-assembles the packet from the segments inside the payloads of the received cells. Specifically, the destination node re-assembles the packet by identifying the cells corresponding to the packet, and appending the segments inside the payloads of the identified cells together in the order of receipt of the identified cells. Finally, the destination node may identify a destination address in the packet, and may route the packet to the identified destination address, which may reside in another communications network.

[0011] Methods and systems consistent with the present invention have two notable advantages over the existing cell relay satellite networks: First, a cell relay satellite network consistent with the present invention does not need to establish a connection in the network, and thus, eliminating the initial connection setup delay in the existing cell relay networks. Second, a cell relay satellite network consistent with the present invention does not need to expend valuable network processing resources for managing the assignment of unique identifiers to connections in the network.

[0012] This summary and the following description of the invention should not restrict the scope of the claimed invention. Both provide examples and explanations to enable others to practice the invention. The accompanying drawings, which form part of the description of the invention, show several embodiments of the invention, and together with the description, explain the principles of the invention.

BRIEF DESCRIPTION OF THE DRAWINGS

[0013] In the Figures:

[0014]FIG. 1 illustrates a cell relay satellite network in which systems and methods consistent with the invention may be implemented;

[0015]FIG. 2 illustrates a block diagram of a node in a cell relay satellite network in which systems and methods consistent with the invention may be implemented;

[0016]FIG. 3 illustrates a block diagram of a cell in a cell relay satellite network when using systems and methods consistent with the invention;

[0017]FIG. 4 illustrates a block diagram of a packet, which a node in a cell relay satellite network may communicate through the cell relay satellite network when using systems and methods consistent with the invention;

[0018]FIG. 5 illustrates a block diagram of a packet, which a node in a cell relay satellite network may communicate through the cell relay satellite network when using systems and methods consistent with the invention;

[0019]FIG. 6 illustrates a flow chart of the steps that a node performs to segment a packet into one or more cells for transmission in a cell relay satellite network when using systems and methods consistent with the invention; and

[0020]FIG. 7 illustrates a flow chart of the steps that a destination node performs to reassemble a packet from one or more cells in a cell relay satellite network when using systems and methods consistent with the invention.

DETAILED DESCRIPTION

[0021] The following description refers to the accompanying drawings. Where appropriate, the same reference numbers in different drawings refer to the same or similar elements.

[0022] Methods and systems consistent with the present invention communicate a packet over a cell relay satellite network, without establishing a connection in the cell relay satellite network, by dividing the packet into one or more segments at a source node in the cell relay satellite network. For each segment, the source node generates a fixed size cell that includes a cell header and a payload. The source node includes in each cell header a prefix, a downlink beam locator, and a source node identifier, and inserts the segments into the payloads of the generated cells respectively. The source node then transmits the cells on an uplink beam to the cell relay satellite.

[0023] The cell relay satellite receives each transmitted cell on the uplink beam from the source node. The cell relay satellite reads the downlink identifier in each cell header, and identifies a downlink beam corresponding to the downlink beam locator. The cell relay satellite then broadcasts each cell on the identified downlink beam to a destination node within the footprint of the beam in the cell relay satellite network.

[0024] The destination node receives each broadcasted cell on the downlink beam, and re-assembles the packet from the received cells. Specifically, the destination node identifies the cells corresponding to the packet, and appends the identified segments inside the payloads of the identified cells together in the order of receipt of the identified cells. Finally, the destination node may identify a destination address in the packet, and may route the packet to the identified destination address, which may reside in another communications network.

[0025]FIG. 1 illustrates a cell relay satellite network 110 in which systems and methods consistent with the invention may be implemented. Cell relay satellite network 110 comprises cell relay satellites 150 a through 150 d, and satellite node terminals 100 a through 100 f. Cell relay satellite 150 a communicates with cell relay satellites 150 b and 150 d via beams 155 a and 155 d, respectively. Cell relay satellite 150 b communicates with cell relay satellite 150 c via beam 155 b, and cell relay satellite 150 c communicates with cell relay satellite 150 d via beam 155 c.

[0026] Nodes 100 a through 100 f may include earth station terminals, for example, very small aperture terminals (VSAT), which communicate with each other through cell relay satellites 150 a through 150 d. Specifically, nodes 100 a through 100 c are in the beam footprints of cell relay satellite 150 a, node 100 d is in the beam footprint of cell relay satellite 150 b, and nodes 100 e and 100 f are in the beam footprint of satellite 150 d. Nodes 100 a through 100 f communicate with their respective cell relay satellites 150 a through 150 d via uplink and downlink beams.

[0027] Nodes 100 a and 100 e interface with a packet-based communications network, for example, Internet Protocol (IP) network 120, and nodes 100 b and 100 d interface with a different packet-based communications network, for example, IP network 130. Nodes 100 g through 100 j, which are not in the beam footprint of cell relay satellites 150 a through 150 d, also interface with IP network 130. Similarly, nodes 100 k through 100 m, which are not in the beam footprint of cell relay satellites 150 a through 150 d, interface with IP network 120. Nodes 100 g through 100 m may include, for example, desktop computers, servers, telephone sets, facsimile machines, and video apparatus.

[0028] Nodes 100 g through 100 j may communicate with nodes 100 k through 100 m via satellite cell relay network 110. For example, node 100 k may generate information, for example, voice, data, and/or video, in form of packets, which node 100 k transmits through IP network 120 to a node that interfaces IP network 120, for example, node 100 a. Node 100 a then segments the packets into one or more segments, insert each segment into payload of a cell, and transmits the cells through cell relay satellite 150 a to node 100 b. Node 100 b then reassembles the packets from the cells and routes the assembled packets through IP network 130 to a destination node, for example, node 100 j, whose address is specified in the packets.

[0029]FIG. 2 illustrates a block diagram of a node, for example, node 100 a, in cell relay satellite network 110. Node 100 a comprises a processor 200, a memory 210, a secondary storage 220, a network interface card 230, a transmitter 250, a receiver 260, an antenna 270, and links 255 and 265, all of which are connected together via a bus 240.

[0030] Memory 210 includes Packet Converter 212, Packet Reassembler 214, and IP Protocol Module 216, all of which include data and/or instructions that processor 200 executes. Packet Converter 212 generally segments a packet into one or more segments and inserts each segment into a cell. Packet Reassembler 214 generally reassembles a packet from one or more cells, each including a segment of the packet. IP Protocol Module 216 generally includes Internet Protocol (IP), for example, IP version 4, for communicating packets through IP network 120. Specifically, IP Protocol Module 216 drives Network interface card (NIC) 230 for transmitting and receiving packets through IP network 120. NIC 230 may include hardware and/or firmware for transmitting and receiving packets from IP network 120.

[0031] Secondary storage 220 comprises computer readable medium such as a disk drive and a tape drive. From the tape drive, software and data may be loaded onto the disk drive, which can then be copied into memory 210. Similarly, software and data in memory 210 may be copied onto the disk drive, which can then be loaded onto the tape drive.

[0032] Transmitter 250 connects to antenna 270 via link 255. Transmitter 250 may include a codec and a frequency up converter for transmitting cells via antenna 270 to cell relay satellite 150 a. Receiver 260 connects to antenna 270 via link 265. Receiver 260 may include a codec and a frequency down converter for receiving cells via antenna 270 from cell relay satellite 150 a.

[0033]FIG. 3 is a block diagram of a cell for use in cell relay satellite network 110 in accordance with an implementation of the invention. As shown, cell 300 includes a cell header 310 portion and a payload 320 portion. Cell header 310 has a length of H bytes, and payload 320 has a length of P bytes. Cell 300 may be of any fixed length, for example, 53 bytes, where cell header 310 may have a length of, for example, 5 bytes and payload 320 may have a length of, for example, 48 bytes. Alternatively, cell 300 may be of any other fixed length, with any combination of cell header 310 length and payload 320 length, as a particular length for each is not essential to the practice of the present invention.

[0034] Specifically, cell header 310 includes prefix 330, downlink beam locator 340, source node identifier 350, and suffix 360. Prefix 330 has a fixed length of K bits; downlink beam locator 340 has a fixed length of M bits; node identifier 350 has a fixed length of N bits; and suffix 360 has a fixed length of J bits. In one example, prefix 330 may have a length of 6 bits; downlink beam locator 340 may have a length of 9 bits; node identifier 350 may have a length of 20 bits; and suffix 360 may have a length of 5 bits. Alternatively, prefix 330, downlink beam locator 340, node identifier 350, and suffix 360 may be of any combination of lengths, as a particular length for each is not essential to the practice of the present invention.

[0035] The first 2 bits of prefix 330 may identify the particular protocol, for example, IP version 4, for handling a re-assembled packet. The next 3 bits of prefix 330 may identify the handling instructions within the particular protocol, for example, the relative priority level within IP version 4. The last bit of prefix 330 may, identify the type of payload 320 in cell 300, for example, whether payload 320 includes the last segment of the packet or other segments of the packet. For example, if payload 320 includes the last segment of the packet, the last bit of prefix 330 is set to “1.” Otherwise, the last bit of prefix 330 is set to “0.”

[0036] Downlink beam locator 340 may identify a particular downlink beam in a cell relay satellite, for example, cell relay satellite 150 a, on which cell 300 may be transmitted to a destination node. Alternatively, the first 2 bits of downlink beam locator 340 may identify cell relay satellite 150 a, and the remaining bits in downlink beam locator 340 may identify a particular downlink beam in cell relay satellite 150 a on which cell 300 may be transmitted. Alternatively, downlink beam locator 340 may include a key or pointer, which cell relay satellite 150 a must translate in order to identify the corresponding downlink beam.

[0037] Node identifier 350 may identify a source node, for example, node 100 a that initiated transmission of cell 300. Suffix 360 may include a cell header error check (HEC) for error checking cell header 310.

[0038]FIG. 4 illustrates a block diagram of packet 400, which node 100 a in cell relay satellite network 110 communicates in accordance with an implementation of the invention. Packet 400 includes a packet header 410 portion and data 420 portion. Packet header 410 may have a variable length of I bytes. Data 420 may have a variable length of T bytes. As shown, packet header 410 may include, for example, a version, header length, type of service, total packet length, packet identification, flags, fragment offset, time to live, protocol identifier, packet header checksum, source node address, destination node address, and other IP protocol options. Alternatively, packet header 410 may include any other combination of fields, as the particular format and types of information in packet header 410 are not essential to the practice of the present invention.

[0039] A node in cell relay satellite network 110, for example node 100 a, may receive from another node, for example node, 100 k, packet 400 with packet header 410 specifying destination node address of, for example, node 100 g, which interfaces IP network 130. Specifically, NIC 230 receives packet 400 from IP network 120, and stores packet 400 in memory 210 via bus 240. NIC 230 then generates an interrupt signal in processor 200, and provides the address of packet 400 stored in memory 210 to Packet Converter 212.

[0040]FIG. 6 illustrates a flow chart of the steps that Packet Converter 212 in node 100 a performs to segment packet 400 into one or more cells for transmission in cell relay satellite network 110 in accordance with an implementation of the invention. Packet Converter 212 receives from NIC 230 the memory address of packet 400 in memory 210 (step 600). Packet Converter 212 reads the destination node address in packet header 410 (step 610). Node 100 a then identifies a downlink beam in cell relay satellite network 110 for routing packet 400 to node 100 g (step 620). Specifically, Packet Converter 212 identifies the downlink beam locator by referencing, for example, a stored routing table whose entry maps a destination node address, for example, node 100 g, to a particular downlink beam locator in cell relay satellite network 110. The stored routing table may be generated by, for example, IP Protocol Module 216.

[0041] Packet Converter 212 then segments packet 400 into fixed size segments of, for example, 48 bytes (step 630). Alternatively, as shown in FIG. 5, Packet Converter 212 may prepend header 510 portion, and append null padding 530 portion and trailer 520 portion to packet before segmenting packet 400. Header 510 may have a length of R bytes. Trailer 520 may have a length of L bytes. Furthermore, Packet Converter 212 may determine the length of null padding 530 to be such that the combined length of packet 400, header 530, trailer 420, and null padding 530 becomes a multiple integer of the length of payload 320 in cell 300. This combined length may be determined as follows:

combined length=P*{smallest integer greater than or equal to [(T+I+R+L)/P]},

[0042] where, as described above, P is length of payload 320, I is length of packet header 410, and T is length of data 420 portion of packet 400. From the computed combined length, the null padding 530 length may be determined as follows:

null padding length=combined length−T−I−R−L.

[0043] In this alternative configuration, packet 400 may have a length of, for example, 500 bytes, and cell payload 320 may have a length of, for example, 48 bytes. Header 510 may have a length of 8 bytes, and may include, for example, the identifier “0xAA-AA-03-00-00-00-08-00,” disclosed in “Multiple-Protocol Encapsulation Over AAL5,” Internet Engineering Task Force, RFC 1483. Trailer 520 may also have a length of 8 bytes, whose first 2 bytes represent the length of packet 400, the second 4 bytes include a cyclical redundancy code (CRC) for error checking, and the last 2 bytes are null. Thus, Packet Converter 212 determines the combined length and length of null padding 530 as follows:

[0044] combined length=528 bytes=48 bytes*{smallest integer>=(500 bytes+8 bytes+8 bytes)/48 bytes},

length of null padding=12 bytes=(528 bytes−500 bytes−8 bytes−8 bytes).

[0045] Finally, after prepending header 510, and appending null padding 530 and trailer 520 to packet 400, Packet Converter 212, segments the appended and prepended packet 500 into fixed size segments of 48 bytes.

[0046] Packet Converter 212 then creates cell header 310 for each packet segment (step 640), and prepends cell header 310 to each packet segment (step 650). Specifically, in the cell header 310 prepended to the each segment, Packet Converter 212 sets the first 2 bits of prefix 330 to identify the particular protocol, for example, IP version 4, for handling the reassembled packet. Packet Converter 212 then sets the next 3 bits of prefix 330 to identify the relative priority level within IP version 4. Finally, Packet Converter 212 sets the last bit of prefix 330 to identify the type of payload 320 in cell 300, for example, whether payload 320 includes the last segment of packet 400 or other segments of the packet. If cell header 310 is prepended to the last segment of packet 400, Packet Converter 212 sets the last bit of prefix 330 to “1.” Otherwise, Packet Converter 212 sets the last bit of prefix 330 to “0.”

[0047] Packet Converter 212 sets downlink beam locator 340 in each cell header 310 to the downlink beam identifier that Packet Converter 212 identified in step 620. Furthermore, Packet Converter 212 sets node identifier 350 in each cell header 310 to the address of node 100 a. Packet Converter 212 calculates a header error check (HEC) and includes the HEC in suffix 360 of each cell header 310. Finally, Packet Converter 212 generates an interrupt signal in processor 200, and provides the address of each completed cell in memory 210 to transmitter 250. Transmitter 250 then transmits each cell in order starting with the cell that includes the first packet segment and ending with the cell that includes the last packet segment through antenna 270 and via an uplink beam to cell relay satellite 150 a.

[0048] Cell relay satellite 150 a receives each cell 300 at an input port, which receives the uplink beam. Cell relay satellite 150 a then reads downlink beam locator 340 in each cell header 310, and identifies an output port corresponding to downlink beam locator 340 by, for example, translating downlink beam locator 340 into a unique downlink beam identifier. Cell relay satellite 150 a then relays each cell 300 in order of arrival to the identified output port, which in turn transmits each cell 300 on a downlink beam corresponding to downlink beam locator 340.

[0049] Each node, for example, node 100 b and node 100 c, in the footprint of the downlink bean of cell relay satellite 150 a receives each cell 300. Specifically, receiver 260 in node 100b receives each cell 300 via antenna 270, and stores each cell in memory 210 of node 100 b. Receiver 260 then generates an interrupt signal in processor 200, and provides Packet Reassembler 214 the address of each cell 300 in memory 210, as each cell 300 arrives at node 100 b.

[0050]FIG. 7 illustrates a flow chart of the steps that Packet Reassembler 214 in node 100 b, performs to re-assemble packet 400 from one or more cells received by node 100 b in accordance with an implementation of the invention Packet Reassembler 214 receives from receiver 260 address of cell 300 in memory 210 (step 700). From node identifier 350 in cell header 310, Packet Reassembler 214 identifies the address of the node that transmitted cell 300, for example, node 110 a (step 705). Packet Reassembler 214 then determines whether a partially assembled packet from node 100 a already exists in memory 210 (step 710).

[0051] If Packet Reassembler 214 determines that a partially assembled packet from node 100 a does not exist in memory 210 (step 715), Packet Reassembler 214 starts a new partially assembled packet in memory 210 (step 720). Specifically, Packet Reassembler 214 strips cell header 310 from cell payload 320, which includes a segment of packet 400, and stores the segment in memory 210. Packet Reassembler 214 then waits to receive the address of the next newly arriving cell in memory 210 (step 700).

[0052] If Packet Reassembler 214 determines that a partially assembled packet from node 100 a already exists in memory 210 (step 725), Packet Reassembler 214 strips cell header 310 from cell payload 320, and prepends the segment of packet 400 in cell payload 320 to the partially assembled packet stored in memory 210 (step 730).

[0053] Packet Reassembler 214 then determines whether cell payload 320 includes the last segment of packet 400 (step 735). Specifically, Packet Reassembler 214 may read, for example, the last bit of prefix 330 in cell header 310 to make this determination. If the last bit of prefix 330 is “0”, then Packet Reassembler 214 determines that cell payload 320 does not include the last segment of packet 400 (step 740). Packet Reassembler 214 then waits to receive the address of the next newly arriving cell in memory 210 (step 700). If the last bit of prefix 330 is “1,” then Packet Reassembler 214 determines that cell payload 320 includes the last segment of packet 400 and that packet 400 has been re-assembled in memory 210 (step 745).

[0054] Packet Reassembler 214 then performs error checking on the re-assembled packet 400 (step 750). For example, Packet Reassembler 214 may use packet header checksum field in packet header 410 to perform the error checking step. In the implementation shown in FIG. 5, Packet Reassembler 214 may use the 4 bytes CRC field in trailer 520 to perform error checking on the appended and prepended packet 500. In this implementation, upon successful completion of the error checking step, Packet Reassembler 214 strips header 510, trailer 520, and null padding 530, if any, from the appended and prepended packet 500 to successfully re-assemble packet 400.

[0055] Once node 100 b re-assembles packet 400, node 100 b may identify in packet header 410 the destination node address of packet 400, for example IP address of node 100 g, and may route packet 400 through IP network 130 to node 100 g (step 755). Node 100 c performs the same steps as node 100 b to receive each cell 300 and to re-assemble packet 400. However, when node 100 c identifies in packet header 410 the destination node address of packet 400, node 100 c determines that it cannot route packet 400 to node 100 g, and thus, discards packet 400.

[0056] It will be understood by those skilled in the art that various changes and modifications may be made to the disclosed implementations, and equivalents may be substituted for elements thereof without departing from the true scope of the invention. In addition, many modifications may be made to adapt a particular element, technique or implementation to the teachings of the present invention without departing from the central scope of the invention. Therefore, it is intended that this invention not be limited to the particular implementations and methods disclosed herein, but that the invention include all implementations falling within the scope of the appended claims.

Referenced by
Citing PatentFiling datePublication dateApplicantTitle
US6801941 *Aug 7, 2000Oct 5, 2004Sarnoff CorporationDynamic wireless internet address assignment scheme with authorization
US7154905Nov 7, 2001Dec 26, 2006Silicon ImageMethod and system for nesting of communications packets
US7801128 *Mar 31, 2006Sep 21, 2010Amazon Technologies, Inc.Managing communications between computing nodes
US8509231 *Aug 18, 2010Aug 13, 2013Amazon Technologies, Inc.Managing communications between computing nodes
US8571206Mar 7, 2008Oct 29, 2013Fujitsu LimitedInformation transmitting apparatus, information transmitting method, and computer product
US20100318645 *Aug 18, 2010Dec 16, 2010Amazon Technologies, Inc.Managing communications between computing nodes
Classifications
U.S. Classification370/389, 370/316
International ClassificationH04L12/56, H04Q11/04, H04B7/185, H04B7/15
Cooperative ClassificationH04Q11/0478, H04L2012/5652, H04B7/18582, H04L2012/5645, H04L2012/5608
European ClassificationH04Q11/04S2, H04B7/185S6
Legal Events
DateCodeEventDescription
Nov 15, 2007ASAssignment
Owner name: VERIZON CORPORATE SERVICES GROUP INC., NEW JERSEY
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:BBN TECHNOLOGIES CORP.;REEL/FRAME:020112/0322
Effective date: 20071011
Jul 18, 2005ASAssignment
Owner name: BBNT SOLUTIONS LLC, MASSACHUSETTS
Free format text: CORRECTION OF EXCECUTION DATE OF ASSIGNMENT RECORD;ASSIGNOR:VERIZON CORPORATE SERVICES GROUP INC.;REEL/FRAME:016621/0835
Effective date: 20040421
Jun 9, 2004ASAssignment
Owner name: FLEET NATIONAL BANK, AS AGENT, MASSACHUSETTS
Free format text: PATENT AND TRADEMARKS SECURITY AGREEMENT;ASSIGNOR:BBNT SOLUTIONS LLC;REEL/FRAME:014709/0549
Effective date: 20040326
May 26, 2004ASAssignment
Owner name: BBNT SOLUTIONS LLC, MASSACHUSETTS
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:VERIZON CORPORATE SERVICES GROUP INC.;REEL/FRAME:014696/0756
Effective date: 20010421