|Publication number||US6018530 A|
|Application number||US 08/874,303|
|Publication date||Jan 25, 2000|
|Filing date||Jun 19, 1997|
|Priority date||Jun 19, 1997|
|Publication number||08874303, 874303, US 6018530 A, US 6018530A, US-A-6018530, US6018530 A, US6018530A|
|Original Assignee||Sham Chakravorty|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (2), Referenced by (53), Classifications (17), Legal Events (4)|
|External Links: USPTO, USPTO Assignment, Espacenet|
In order to set up a communication between any two or more computer systems or similar other systems, any digitized delivery of voice, video or data has to meet the rules of the five layers of the Internet and other families of protocols. The topmost layer (layer 5) is the Application layer that represents such protocols as File Transfer Protocol (FTP), Simple Mail Transfer Protocol (SMTP), Telnet, and others. The next two protocol layers, layers 4 and 3, are called TCP and Internet Protocol (IP). These are used by the systems attached to the Internet and other private networks. The layer 2 is the Data Link layer protocol. The examples for the layer 2 are Ethernet, Fiber Distributed Data Network (FDDI), Frame Relay (FR) and Asynchronous Transfer Mode (ATM). Some of these layer 2 protocols transgress into other protocol layers, above and below, as dictated by the nature of transmission rules of the protocol. The bottom Physical layer (layer 1) is represented by the physical medium of transmission such as the single-mode or multi-mode fibers used for ATM, twisted copper pairs used in Local Area Networks (LANs), radio channels for Wide Area Networks (WANs), and related hardware.
The conventional mode of transmission of digitized signals, hereinafter called digital transmission or simply data to represent all forms of digital transmissions such as voice, video, text, and image, is generally datagram based. Datagram implies a preassigned set of data bits, grouped together in what is called a packet, that is transferred from one end-system to another more like postal mail delivery system. Each packet has a header that carries information about the packet such as its source system address, destination system address, its length, a methodology to check its accuracy and some other related information. For instance, the header for IP packet, which is a minimum 20 Bytes (160 bits), carries information such as version, length of the header, type of service, total length, identification (of the packet), flags (to activate certain options), fragment offset (identifying a portion of the packet if it is not the whole packet), time to live, protocol number, header checksum source IP address, destination IP address, options, and padding (of bits if necessary). All these can use up to 64 Bytes of data. The data portion of the IP packet follows the header. Any other type of frame or packet (all hereinafter referred to as packet only) has a similar bit make-up.
For smaller packets, such as in the case of ATM packets, a larger overhead of header data compared to its data content (called payload) is employed. Use of such high overhead causes congestion in the traffic channels and slows down transmissions. This is further compounded by the fact that raw data output from an end-system is encapsulated by the protocol packet from the layer below which is further encapsulated by the protocol packet from the layer still below and so on. For example, to the TCP header is added the IP header, to which is added the FR header and so on down the protocol suite to transmit an e-mail coming out of an end-system that rides on, say, an FR network.
Overheads burden transmission and network latency. The current environment of multi-protocol usage both in the LANs and WANs add an inordinate amount of header overheads to raw data, that is raw information content, thereby greatly slowing the process of transmission as well as adding to the potential for errors, traffic congestion and delay. The reasons are obvious: the bulk of bits transmitted and complex rules of individual protocols increase the barriers to a smooth traffic flow significantly. This environment is further complicated by the fact that TCP is session oriented protocol on top of the IP and other protocols which are oriented as datagram protocol. The former (TCP) establishes a virtual or logical connection between two end-systems while the latter (IP) provides real routing of packets along the most suitable path decided by the (packet) routing mechanism.
The proposed invention, comprising TCP switching, eliminates the multi-protocol complexities for the first time. The invention provides the tool for converting the conventional or classical TCP into Fast TCP resulting in the SLAP. In brief, this mechanism establishes a TCP session through TCP switching devices thereby eliminating the need for layer 2 switches, layer 3 routers and all other multiplexing or concentrator devices.
This invention comprises a mechanism that eliminates the need for multiple layers of protocols for transmission of data, voice and video. The mechanism provides the means for switching TCP data traffic in a session oriented mode. This is accomplished by the inclusion of source and destination port addresses of the end-system applications along with the provision for logical links and sub-links for fast transmission between the intermediate switches. The system therefore provides for addressing of TCP data through port addresses as well as virtual communication paths. Additionally, the system provides for establishment of any bandwidth for data transmission limited only by the throughput of physical media of transmission and the end-system buffer sizes. The system, as described in this patent, allows for a session as long or as short as the users or the end-systems system wish.
By using this Fast TCP mechanism, the need for IP packets is eliminated. The user need not use layer 2 protocols either, such as Ethernet or ATM, thereby saving a significant amount of bandwidth for link set ups and controls, and avoiding errors and delays. What is left is then the application running in the end-system which is directly passed on to the TCP switching protocol (layer 4 protocol) and from there to the Physical media (layer 1). So all layer 2 and 3 protocols are totally eliminated. Eliminated also are several layer 4, such as User Datagram Protocol (UDP) and layer 5 (Ping) protocols. This provides for a simple, robust and reliable transfer of data from layer 5 to layer 1 via layer 4 which is now the Fast TCP.
Thus the advantages of using TCP switching as the only transport protocol for sending digitized signals between two or more protocols are many. A summary is provided below.
Since IP datagrams are avoided, no routing of protocols takes place thereby avoiding routing delays such as those caused by the asynchronous receipt of IP datagrams and the subsequent need to resequence the data, router-to-router path identification process, packet forwarding process and also the overhead of the IP header. This is true of the layer 2 protocols also.
Since datagram transmission can take place through any number of unknown routers (especially in case of the Internet) and no checksum of the body of the data is done by the IP layer, the security of data is compromised. Fast TCP, on the other hand, maintains a checksum of both its header and data, flow control, and management at the end-systems as well as the intermediate Fast TCP switches. Any corruption or modification of data in transit is therefore immediately detected. This provides built-in security and data integrity.
Fast TCP also all speeds of data delivery on any type of media in a session oriented mode. So, both voice and video are included with raw data in the transmission process by careful selection of port addresses. All three forms of transmission can travel the same path in Fast TCP so long they are identified separately to port addresses.
All these therefore add to significant cost and time savings providing the most efficient form of digital transmission of voice, data and video as well as in the savings of installed equipment and the staffing required to operate and maintain them.
FIG. 1 is view of the Fast TCP header with Fast TCP Options.
FIG. 2 is a view of the Fast TCP with conventional IPV6 (IP Version 6) header.
Although the disclosure hereof is detailed and exact to enable those skilled in the art to practice the invention, the software and hardware embodiments disclosed herein merely exemplify the invention which may be embodied in other specific software and/or hardware structures.
The scope of the invention is defined in the claims appended hereto.
As shown in FIG. 1, Fast TCP retains the header format of the classical TCP as identified by parts numbered from 1 through 10. The uniqueness of Fast TCP, different from the classical TCP, lies in the assignment of bit patterns to the 6-bit field called Reserved field, which is identified as part number 6, and assigning new functionalities to the Option field, parts identified as 11 through 20, to provide the needed functionalities of Fast TCP.
In the classical TCP, the Reserved field of 6 bits is not used at all. They are all zeros. In the proposed Fast TCP, the first bit of the 6 bits in this field is set (made 1 from zero) prior to the transmission of the Fast TCP segment of the type described here. This indicates to the TCP segment receiver that the format of the Fast TCP has been applied. The remaining parts, 1 through 10 excluding 6, of the first twenty bytes of the classical TCP header are retained in the Fast TCP. In the Fast TCP, three basic options are added in the Option field, identified in parts 11 through 20, prior to the Data field as identified in part number 21. These options begin and end on octet boundaries as in the classical TCP.
The classical TCP allows only three options that are of little consequence and as such add little or no value to the technology. In contrast, the Fast TCP functionalities available in the Option filed add a host of functionalities to classical TCP and render it free of all other protocols in its and other layers below it. These Fast TCP options make the size of the Fast TCP header 32 bytes long including the conventional TCP functionalities, as identified by the parts 1 through 10, which make up a total of 20 bytes.
The three basic Fast TCP options proposed are provided below.
Case 1: The first octet, identified as part 11, defines option kind 3 (00000011). The second octet, identified as part 12, defines length 4 (00000100) in octets. The third and fourth octets together, indicated in part 13, define fixed segment size suitable for voice and video transmissions. This option is used for fixed segment transmissions as in the case of voice. This fixed size is recommended to be 64 bytes in total.
Alternative to the above selection, if a variable length message is used for raw data or image, the above option fields are replaced by the following selection. The first octet, identified as part 11, defines kind 4 (00000100). The second octet, identified as part 12, defines length 4 (00000100) in octets. The third and fourth octets together, identified as part 13, define variable segment size suitable for data and other asynchronous transmissions. The option kinds 3 and 4 are mutually exclusive for the same segment.
Case 2: The first octet, identified as part 14, defines kind 5 (00000101). The second octet, identified as part 15, defines length 4 (00000100) in octets. The third octet, identified as part 16, defines the Path Identification Number (PIN) and if the length identifies four octets in all, then the fourth octet in this option kind, identified as part 1, defines Channel Identification Number (CIN). The PIN identifies a unique path which is analogous to the logical or virtual circuit representation of a trunk circuit implemented in common telephony. The length of the path is allowed to vary from an 8-bit definition to 16-bit definition. There are thus a range of 1 to 255 logical or virtual paths for single octet part 16 and a maximum of 65,535 virtual paths for a two-octet part 16 ignoring all zeros in these octets. Similar to a path and identified by a unique CIN, a channel is a subset of a path and is logically analogous to the channel in common telephony. There are thus a range of 1 to 255 logical channels for a single octet part 1 and a maximum of 65,535 logical or virtual channels in two octet part 1 ignoring all zeros in these octets. The combination of path and channel in option kind 5 identifies a link, which is a virtual circuit, between any two Fast TCP switches or between a Fast TCP switch and a Fast TCP end-system for the duration of a connection. For any connection, there could be one to two octects for a path connection and one to two octets for channel. There will always be a minimum of one path and one channel in any link. Any application running on a Fast TCP end-system will have only one virtual connection to another end-system. Such a connection will be identified by the PIN, CIN, the source port address and the destination port address of the application.
Case 3: The first octet, identified as part 18, defines kind 6 (00000110). The second octet, identified as part 1, defines length 4 (00000100) in octets. The third and fourth octets together, identified as part 20, define Flow Information Notification (FIN). The FIN defines the requirements for flow control and network management variables. Examples are: constant bit rate, variable bit rate, buffer overflow, congestion in the forward direction, congestion in the backward direction, and other traffic and switching parameters.
Constant bit rate connection is identified by one set bit, the last bit, in the fourth octet of this option. Variable rate is identified by two set bits, the last two bits, in the fourth octets of this option. Connections with variable bit rate must negotiate a range of bit rates between two values. These values are minimum and maximum bit rates, and a maximum burst size at the time of connection establishment.
Examples for the last two octets in part 20 are given below.
______________________________________Constant Bit Rate 00000000 00000001Variable Bit Rate 00000000 00000010______________________________________
The maximum bit rate with maximum burst size will define the peak maximum to be used for a connection. The variable bit rate will be used for video and data. The remaining six bits in the fourth octet, identified as part 20, define other flow related parameters. Examples are given below.
______________________________________Forward Congestion Notification (FCN) 00000000 00000100Backward Congestion Notification (BCN) 00000000 00000101______________________________________
Case 4 (Optional case): This is an optional addition to the first four options described above. In this option, the first octet defines kind 7 (00001011), second octet defines length 4 (00000100) in octets, third octet identifies the type of message while the fourth and later octets carry the message itself. All five octets together define Management Information Notification (MIN). This provides administrative, operational, maintenance and security information to the system administrator and users. The examples of such information are: system set up and tear down, system active and inactive, real-time and historical statistical data, network usage at any time, alarm conditions, failures and repairs, undesirable Fast TCP switch or end-system log-ins, undesirable segments in the network, faulty segments, and other similar information.
Instances of the third and fourth octets are provided below for a selection of management functionalities. Implementors or standards bodies will provide same or similar arrangements.
______________________________________Set Up Local System 00000000 00000000Set Up Remote System 1 00000001 00000000Set Up Remote System 2 00000010 00000000 : : : : : :Set Up Remote System 256 11111111 00000000Bring Down Local System 00000000 00000001Bring Down Remote System 1 00000001 00000001Bring Down Remote System 2 00000010 00000001 : : : : : :Bring Down Remote System 256 11111111 00000001Hello Local System 00000000 00000010Hello Remote System 1 00000001 00000010Hello Remote System 2 00000010 00000010 : : : : : :Hello Remote System 256 11111111 00000010No Local System 00000000 00000011No Remote System 1 00000001 00000011No Remote System 2 00000010 00000011 : : : : : :No Remote System 256 11111111 00000011Local System Alive 00000000 00000100Remote System 1 Alive 00000001 00000100Remote System 2 Alive 00000010 00000100 : : : : : :Remote System 256 Alive 11111111 00000100______________________________________
All remote systems in the above description are directly or indirectly connected to the local system. Therefore, the system administrator or user will set up remote system as well as manage remote system from the local system. This provides a unique strength to the Fast TCP protocol.
More messages are built up in this manner for robust and reliable propagation of network management information. It is noteworthy to see that as many 256 messages are available for system administration and operation. This is much wider a selection of network management variables than available in any of the contemporary protocols. If the implementor so chooses, more messages are added by increasing the length of this option on octet boundaries.
The option kind numbering scheme presented above as 3, 4, 5, 6, and 7 are instances of a selection only. These numbers will be different for any Fast TCP standard implementation selected differently but the effect of the implementation will be the same as in fast TCP. Other options are similarly added for other features as Fast TCP standards body would want.
A connection is set up either in the PVC mode or in the SVC mode. Each set up identifies the first message with the SYN Flag bit set in part 7. In case of the PVC set up, the system administrator assigns PIN, CIN and the application source number to each connection as needed. The destination port number is a well-known port assignment. These assignments remain constant for the duration of a connection. A new set of assignments is generated each time a new set of connections is set up. The new set may retain the same PINs and CINs as from the previous suite of connections if desired.
The administrator also selects a number of functionalities that are necessary for the network and system house-keeping. Instances of this are: set up time, log of PIN and CIN of each connection, number of failures of each connection by PIN and CIN, statistical data on failures by connection and time of day, statistical data on FCNs and BCNs, duration of failure of a connection and similar other requirements.
The sequence of events in SVC set up is an automated procedure. The procedure is initiated by an application wanting to send data to a remote location. It works as follows.
1. The local system transmits a Fast TCP segment with option kind 3 (or 4), 5 and 6, as identified in parts 11 through 20, with the SYN Field set, as identified in part 7 to the nearest connected Fast TCP switch identified in the local system's switch availability table. This table is generated at the time the local system is physically connected to one or more remote switches. In this table, each end-system as well as each Fast TCP switch is associated with a group of connected switches that bear hierarchical connections heading toward the desired end-systems. For instance, an end-system in Philadelphia, USA, trying to set up a connection for messages going to Tokyo, Japan, will look for Fast TCP switches connected to Fast TCP continental gateway switches marked for Asia. The continental gateway switches will comprise switching tables for other continental Fast TCP switches listing continents. For connections within a continent, the Fast TCP switches will in turn have listing by country and within a country, by states or regions of the country. Within a region, the listing will go down to the city, county and still more granular levels. The configuration of the Fast TCP switching tables will be determined by the network service providers as well as the local and regional communication control administration.
The cascading switching tables will thus follow rules of connection set up similar to modem digital telephony. The greater the region covered by a switch, larger is its table for referencing the best choice of connection to the remote end-system. The switching table also provides selected characteristics for the connections. The Fast TCP switch availability table has local significance only. The local system or switch thus always selects the nearest Fast TCP switch that is available.
2. The local system issues unique PIN and CIN, identified in parts 16 and 17, starting with 1 and 1 or any other chosen set of two numbers for the connection that is being set up to the nearest available Fast TCP switch.
3. The three way handshake similar to that in the classical TCP connection set up follows with a timer started to track acknowledgment delays.
4. Once the connection is set up, the local system does housekeeping. As a minimum, it maintains a log of PINs and CINs for all connections associated with the remote system applications for the duration of the connection. It starts a timer with the start of a connection to develop a log of statistical data on the connection.
5. The SVC set up continues from local system to the first connected Fast TCP switch which in turn continues the process by sending the Fast TCP message to its nearest connected switch. The process continues from switch to switch until the remote end-system has been connected by the last switch in tandem.
6. The local system then sends the data traffic after receiving the acknowledgment from the remote end-system. Once the data flow starts between the two end-systems, the intermediate Fast TCP switches do not send acknowledgment back to the sending switch system for each segment received, nor do they carry out checksum calculation. Checksum is done after the data is passed through to the next switch. It is done to determine if the received data was corrupted. If so, it sends a MIN message of the appropriate type to the sending switch which helps cascade it down to the sending end-system where the segment is regenerated and sent again. This process is significant in providing the speed in Fast TCP switching. If a subsequent segment is received when the checksum is being done on the previous segment, which was in error, the case is handled in a manner similar to the way an end-system handles such as event in the classical TCP.
No window sliding takes place in a Fast TCP switch. If the receiving buffer in a Fast TCP switch approaches its capacity, a suitable MIN message is sent to the sending System. In case of congestion, FCN or BCN messages are generated and sent by the switch.
Tear down of a SVC connection is much simpler and similar to classical TCP. The system wanting to close the connection sends a message with the FIN Flag in part 7 set. The receiving system, if it is a Fast TCP switch, continues to send the message on the prescribed PIN and CIN.
It is estimated that it will be three to four years before Fast TCP will be adopted by the majority of the users. In order therefore to make a smooth transition from classical TCP to Fast TCP, the IPV6 address is included in the Fast TCP header with a selection of options in the Option field as shown in FIG. 2. This transforms a Fast TCP segment into an IPV6 packet. But the handling of the packet at layer 4 is same as Fast TCP since the options behave as described above. However, all classical layer 2 and 3 protocols will treat such Fast TCP segments as IP packets thereby eliminating the need for emulation of IP packets.
As more and more Fast TCP switches and systems are implemented, pure Fast TCP segments will be used. Therefore, during the transition period, the Fast TCP header will not use the 1 as the first bit in part 6. This implies that a Fast TCP switch and end-system will have the dual capability of acting as a router as well as a Fast TCP switch. As a routers, these switches will route IPV6 packets.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US5784362 *||Apr 17, 1995||Jul 21, 1998||Telefonaktiebolaget Lm Ericsson||Temporary frame identification for ARQ in a reservation-slotted-ALOHA type of protocol|
|US5892924 *||Jan 31, 1996||Apr 6, 1999||Ipsilon Networks, Inc.||Method and apparatus for dynamically shifting between routing and switching packets in a transmission network|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US6233224 *||Sep 24, 1998||May 15, 2001||Sony Computer Laboratory, Inc.||Communication method and data communications terminal, with data communication protocol for inter-layer flow control|
|US6438105 *||Feb 8, 1999||Aug 20, 2002||3Com Corporation||Reliable internet facsimile protocol|
|US6438137 *||Dec 22, 1997||Aug 20, 2002||Nms Communications Corporation||Packet-based trunking|
|US6674994||Dec 1, 1999||Jan 6, 2004||Panamsat Corporation||Pickup and delivery of data files|
|US6738821 *||Jan 24, 2000||May 18, 2004||Adaptec, Inc.||Ethernet storage protocol networks|
|US6985484 *||Jun 28, 2001||Jan 10, 2006||Silicon Graphics, Inc.||Packetized data transmissions in a switched router architecture|
|US7031904||Jan 24, 2000||Apr 18, 2006||Adaptec, Inc.||Methods for implementing an ethernet storage protocol in computer networks|
|US7089320||Jun 1, 2001||Aug 8, 2006||Cisco Technology, Inc.||Apparatus and methods for combining data|
|US7184445||Feb 11, 2004||Feb 27, 2007||Silverback Systems Inc.||Architecture and API for of transport and upper layer protocol processing acceleration|
|US7257118 *||Feb 28, 2003||Aug 14, 2007||At&T Corp.||Frame relay switched data service|
|US7263071||Oct 8, 2003||Aug 28, 2007||Seiko Epson Corporation||Connectionless TCP/IP data exchange|
|US7277963 *||Jun 26, 2002||Oct 2, 2007||Sandvine Incorporated||TCP proxy providing application layer modifications|
|US7392323||Nov 16, 2004||Jun 24, 2008||Seiko Epson Corporation||Method and apparatus for tunneling data using a single simulated stateful TCP connection|
|US7406533||Oct 8, 2003||Jul 29, 2008||Seiko Epson Corporation||Method and apparatus for tunneling data through a single port|
|US7428595||Sep 30, 2002||Sep 23, 2008||Sharp Laboratories Of America, Inc.||System and method for streaming TCP messages in an enterprise network|
|US7577097 *||Mar 22, 2005||Aug 18, 2009||Microsoft Corporation||Compound transmission control protocol|
|US7620181 *||Apr 20, 2005||Nov 17, 2009||Harris Corporation||Communications system with minimum error cryptographic resynchronization|
|US7668095||Dec 21, 2004||Feb 23, 2010||At&T Corp.||Traffic management for frame relay switched data service|
|US7668168 *||Dec 30, 2005||Feb 23, 2010||At&T Corp.||Frame relay switched data service|
|US7903546 *||Jan 14, 2005||Mar 8, 2011||Cisco Technology, Inc.||Detecting unavailable network connections|
|US8004983 *||Aug 15, 2007||Aug 23, 2011||Blue Coat Systems, Inc.||Methods to improve transmission control protocol (TCP) performance over large bandwidth long delay links|
|US8014286 *||Oct 21, 2008||Sep 6, 2011||At&T Intellectual Property Ii, L.P.||Frame relay switched data service|
|US8027257||Dec 27, 2009||Sep 27, 2011||At&T Intellectual Property Ii, L.P.||Traffic management for frame relay switched data service|
|US8547843||Jan 20, 2006||Oct 1, 2013||Saisei Networks Pte Ltd||System, method, and computer program product for controlling output port utilization|
|US8717896||Sep 2, 2011||May 6, 2014||At&T Intellectual Property Ii, L.P.||Frame relay switched data service|
|US8949471||Nov 2, 2001||Feb 3, 2015||Oracle America, Inc.||TCP/UDP acceleration|
|US9276849||May 5, 2014||Mar 1, 2016||At&T Intellectual Property Ii, L.P.||Frame relay switched data service|
|US20030161328 *||Feb 28, 2003||Aug 28, 2003||At&T Corp.||Frame relay switched data service|
|US20030198225 *||May 14, 2003||Oct 23, 2003||Risto Mononen||Method for transmitting packets over circuit-switched network|
|US20040006643 *||Jun 26, 2002||Jan 8, 2004||Sandvine Incorporated||TCP proxy providing application layer modifications|
|US20040062201 *||Sep 30, 2002||Apr 1, 2004||Sharp Laboratories Of America, Inc.||System and method for streaming TCP messages in an enterprise network|
|US20040092251 *||Oct 24, 2003||May 13, 2004||Fell Gail Hegarty||Pickup and delivery of data files|
|US20040111523 *||Nov 2, 2001||Jun 10, 2004||Howard Hall||Tcp/udp acceleration|
|US20040156393 *||Feb 11, 2004||Aug 12, 2004||Silverback Systems, Inc.||Architecture and API for of transport and upper layer protocol processing acceleration|
|US20050078604 *||Oct 8, 2003||Apr 14, 2005||Wai Yim||Connectionless TCP/IP data exchange|
|US20050080919 *||Oct 8, 2003||Apr 14, 2005||Chia-Hsin Li||Method and apparatus for tunneling data through a single port|
|US20050105466 *||Dec 21, 2004||May 19, 2005||Chase Christopher J.||Traffic management for frame relay switched data service|
|US20060104273 *||Dec 30, 2005||May 18, 2006||At&T Corp.||Frame relay switched data service|
|US20060104288 *||Nov 16, 2004||May 18, 2006||Wai Yim||Method and apparatus for tunneling data using a single simulated stateful TCP connection|
|US20060159011 *||Jan 14, 2005||Jul 20, 2006||Mitesh Dalal||Detecting unavailable network connections|
|US20060200517 *||Mar 3, 2005||Sep 7, 2006||Steve Nelson||Method and apparatus for real time multi-party conference document copier|
|US20060227708 *||Mar 22, 2005||Oct 12, 2006||Microsoft Corporation||Compound transmission control protocol|
|US20060239458 *||Apr 20, 2005||Oct 26, 2006||Harris Corporation||Communications system with minimum error cryptographic resynchronization|
|US20070171825 *||Jan 20, 2006||Jul 26, 2007||Anagran, Inc.||System, method, and computer program product for IP flow routing|
|US20070171826 *||Jan 20, 2006||Jul 26, 2007||Anagran, Inc.||System, method, and computer program product for controlling output port utilization|
|US20070285501 *||Jun 9, 2006||Dec 13, 2007||Wai Yim||Videoconference System Clustering|
|US20090041022 *||Oct 21, 2008||Feb 12, 2009||Chase Christopher J||Frame relay switched data service|
|US20090046717 *||Aug 15, 2007||Feb 19, 2009||Qing Li||Methods to improve transmission control protocol (tcp) performance over large bandwidth long delay links|
|US20100157805 *||Dec 27, 2009||Jun 24, 2010||Chase Christopher J||Traffic management for frame relay switched data service|
|USRE40923 *||Apr 16, 2003||Sep 29, 2009||Agere Systems Inc.||Simplified data link protocol processor|
|CN100469190C||Nov 12, 2001||Mar 11, 2009||诺基亚公司||Method for transmitting packets over circuit-switched network and network thereof|
|CN100561990C||Jun 14, 2007||Nov 18, 2009||广东中大讯通软件科技有限公司;中山大学||A digital home gateway device and its processing method|
|WO2002041654A1 *||Nov 12, 2001||May 23, 2002||Nokia Corporation||Method for transmitting packets over circuit-switched network|
|U.S. Classification||370/471, 370/401|
|International Classification||H04L29/06, H04L12/56|
|Cooperative Classification||H04L69/161, H04L69/16, H04L69/167, H04L69/163, H04L49/3009, H04L29/06, H04L49/602, H04L49/351|
|European Classification||H04L29/06J3, H04L29/06J7, H04L29/06J15, H04L49/60A, H04L29/06|
|Aug 13, 2003||REMI||Maintenance fee reminder mailed|
|Jan 26, 2004||LAPS||Lapse for failure to pay maintenance fees|
|Mar 23, 2004||FP||Expired due to failure to pay maintenance fee|
Effective date: 20040125
|May 18, 2006||AS||Assignment|
Owner name: SIGNAFOR, INC., VIRGINIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:CHAKRAVORTY, SHAM;REEL/FRAME:017892/0965
Effective date: 20000926