|Publication number||US7177277 B2|
|Application number||US 09/957,336|
|Publication date||Feb 13, 2007|
|Filing date||Sep 20, 2001|
|Priority date||Aug 31, 2001|
|Also published as||US20030043777|
|Publication number||09957336, 957336, US 7177277 B2, US 7177277B2, US-B2-7177277, US7177277 B2, US7177277B2|
|Inventors||Juha Koponen, Janne Kalliola, Hannu Mallat, Hannu Kari|
|Original Assignee||First Hop Oy|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (27), Non-Patent Citations (3), Referenced by (20), Classifications (25), Legal Events (6)|
|External Links: USPTO, USPTO Assignment, Espacenet|
The present invention is related to an accelerating system and upgrading performance and transmission capacity in a wireless network, such as a GPRS (General packet Radio Service) network.
As the Internet has become very successful, the efforts to bring the Internet also to mobile and wireless devices have been considerable. Most of the prior art techniques presently in use are based on the global system for mobile communications (GSM) standard.
The services enabling communication between a mobile station and an Internet ser-vice are termed bearer services. Some bearer services are circuit-based and some message-based. Circuit-based communication requires a certain size of bandwidth allocation regardless of its usage. On the other hand, message-based communication does not require a certain size of bandwidth allocation but it uses the bandwidth avail-able.
Circuit switched data (CSD) and high-speed circuit switched data (HSCSD) are examples of circuit-based bearer services. General packet radio services (GPRS) is an example of a message-based service.
According to GSM/GPRS parlance, a mobile station is a GPRS radio device, such as a GPRS phone, a GPRS PCMCIA card or a built in GPRS radio that may be integrated to a variety of devices. A mobile client device is, for example, a laptop or a personal digital assistant (PDA). A mobile client device communicates with a server located in a GPRS network. An end-user is a person having a mobile client device.
The Internet is a packet switched network whose nodes have an Internet peripheral address (IP address). Each IP address consists of four numbers between 1 and 255, and dots separating each number; for example, 188.8.131.52. Internet addresses are divided into a network address and a host address. The division between host and network address is controlled by a netmask. The routers of the Internet locate the correct receiver by its IP address. Since the Internet is a packet-switched network, no circuit is allocated for the connection. Instead, documents are transmitted in packets from the sender to the receiver, and packets of other connections may be transmitted in the same circuit.
An IP packet usually includes 1–1500 characters. The small size of a packet ensures that transmission capacity, or the lack of the capacity, is divided between end users of a network. Each IP packet includes the following information: from which node a packet is sent, to which node it is sent, which application will receive the packet, and what is its serial number. The serial numbers of packets are required when the content of a document will be composed at the receiving site. Transmission control protocol/Internet protocol (TCP/IP) is a set of protocols that determine how IP packets are transmitted in the Internet.
When using TCP/IP the packets have a sequence number. Thus, a receiver can detect if one or more packets are missing. Then the receiver sends a retransmission request for each missing packet. In another protocol a receiver may send an acknowledgement message in response to receiving a packet or a group of packets. User datagram protocol (UDP) is the most common alternative to TCP/IP. UDP offers a transmission with a minimum of protocol overhead. Therefore retransmission requests or packet acknowledgements are not used in UDP. For the same reason a sender cannot know whether a receiver has received the packets sent.
The world wide web (WWW or web) is an Internet-based, distributed hypermedia information system. The web pages are traditionally represented using hypertext markup language (HTML). HTML and its successor, extensible markup language (XML), are intended for forming structured documents to be interchanged in the web. Structured documents are searched and read through software that is termed a browser. Hypertext transfer protocol (HTTP) determines how structured documents are transferred in the Internet.
Wireless markup language (WML) is a formal language that allows the text portions of structured documents to be presented via wireless network on mobile client devices. WML is a part of wireless application protocol (WAP).
Though the computing capabilities of mobile client devices as well as the Computing capabilities of the Internet servers have increased, the transmission capacity of a bearer service has remained rather low. It has become feasible to carry out extensive real-time optimisations of the traffic. An end-user may access the Internet via the networks based on CSD or HSCSD bearer service. Because these bearer services allocate a certain amount of bandwidth, the bandwidth capacity of a network is poorly utilized. To be more specific, quite a limited number of end-users can use the network at the same time. The number of simultaneous end-users is much higher in a network based on GPRS bearer service.
GPRS supports TCP/IP protocols and their packet nature over a wireless network. The upper limit of transmission capacity is in theory about 170 kb/s per end-user. However, a GPRS is a connectionless bearer service. Therefore a varying number of end-users may use the same channel at the same time and the transmission capacity per end-user varies depending on the number of simultaneous end-users. In practice, the transmission capacity per end-user is in the order of 10-30 kb/s. Thus, end-user experience is slightly better with the GPRS communication than with the CSD communication of 9.6 kb/s, but worse than with the HSCSD communication of 43.2 kb/s. Though GPRS increases the number of simultaneous end-users compared to CSD and HSCSD, its transmission capacity is relatively low.
Universal mobile telecommunications system (UMTS) is a part of the International Telecommunications Union's (ITUs) vision of a global family of third-generation mobile communications. UMTS will deliver low-cost, high-capacity mobile communications offering data rates up to 2 Mb/s.
TCP/IP protocols and especially HTTP are best suited for high-speed, fixed networks. Many Internet applications operate badly in GPRS networks. The performance of Internet applications can be improved by software termed an accelerating system. Also the term “performance enhancing proxy” has been used in the prior art.
An accelerating system includes at least an accelerating server connected to a network, and optional accelerating clients placed in end-users' mobile client devices. There are two kinds of solutions: a client-server solution or a server solution. The client-server solution includes the accelerating clients and server. The server solution includes only the accelerating server.
Packing is an acceleration technique that is most widely used. There are several packing algorithms usable for packing the content of packets. The packing reduces the transmission capacity needs, thus the transmission is accelerated compared to the transmission of unpacked packets.
The European telecommunications standards institute (ETSI) has defined GPRS and the operation of the SGSN and GGSN nodes; service description, stage 2, GSM 03.60 version 7.4.1 Release 1998 and ETSI EN 301 344, V74.1, 2000-09.
The SGSN and GGSN are also used in UMTS. Their functionality is very similar in UMTS and GPRS networks. Thus, the following description of the SGSN and GGSN also concerns UMTS.
The GGSN is connected to the packet switched-networks external to the GPRS system, for example, the operator specific intranet or external Internet. When end-user data is transmitted between the GGSN and a mobile station, it is tunneled by using GPRS specific packet headers. The headers are added to IP packets. One function of the GGSN is collecting charging and billing data. Depending on the network operator, the charging may be based on the amount of bits sent between the mobile station and the Internet. Also fixed charges may be possible. Typically, the traffic from a mobile station to the Internet, and vice versa, is billed.
The SGSN keeps track of the individual mobile station's location and performs security functions and access control. The SGSN is connected to a radio part (see
The SGSN and GGSN act as relay functions. They store and transfer packets which are termed PDP PDUs (packet data protocol, protocol data units). PDP may be the Internet, X.25, or corresponding protocol. The SGSN, as well as the GGSN, has a buffering window for storing the packets for a maximum holding time. A buffering window can be also termed a buffer with a certain size, for example 64 kB. If the buffering window is full or the maximum holding time is reached, the packets are discarded. The discarding protects the resources of a radio part from useless transfer attempts.
The GGSN collects billing information based on the amount of bytes of packets going through the GGSN. If the buffering window of the SGSN is full or the maximum holding time of the SGSN is reached, packets are discarded. However, the GGSN charges for all the packets transmitted to the SGSN. Therefore an end-user is sometimes billed for packets that he/she has never received. The buffering window size and maximum holding time may vary depending on the load of a GPRS network, but both of them are, of course, limited.
The accelerating systems known in the prior art still have certain drawbacks, which are discussed next.
The first drawback is that when the load of a GPRS network is high, a lot of packets are discarded, which causes slowness in the usage of Internet services.
The second drawback is that billing based on the amount of transmitted bits is erroneous when packets are discarded in the SGSN.
The third drawback is that repeatedly retransmitted packets may cause overload in a GPRS network, especially in the SGSN.
The fourth drawback is that acceleration actions are not necessarily targeted to those packets which cause the overload of a network.
The objects of the invention are to solve the above-mentioned drawbacks. Due to overall network bandwidth limitations, individual end user experience also varies, and it is desirable to fairly divide the available bandwidth between all users. A method in accordance with the present invention optimizes the Internet data transmission so that end-user experience is the best possible.
The method has at least one class set for estimating the network load, wherein each class set consists of classes. The method estimates the network load by each class of the class set. For example, a class set may consist of classes so that there is a class per each cell of the network. (in these specifications, the word cell is used equivalently to a network node.) Then the method may detect, for example, that the packets sent to a certain cell cause a lot of retransmission requests and thus a lot of retransmissions. In this way the method can target acceleration actions especially to the packets causing the overload.
The method preferably estimates the network load by counting retransmission requests or packet acknowledgements related to the above-mentioned class sets. Therefore at least a portion of the network traffic would preferably operate in accordance with a protocol containing retransmission requests or packet acknowledgements. Alternative method of estimating network load is by measuring or estimating the total level of network traffic, or a portion thereof as described above. The example provided herein relates primarily to activating accelerating actions in response to retransmission requests and acknowledgement count. It should be clear however that the invention is equally applicable to triggering those actions responsive to other network utilization indicators, relating to the whole network or to portions such as geographical areas, individual or groups of subscribers, etc.
An aspect of the invention includes four new acceleration actions that can be used independently or in combination within themselves as well as together with the prior art acceleration actions to accelerate the network traffic.
The first new acceleration action is termed “prioritizing”. Prioritizing means that the packets to be transmitted via the GGSN to the SGSN are given a priority. Then the SGSN handles its buffering window as follows: if the buffering window is full or the maximum holding time is reached, the SGSN removes one or more packets having the lowest priority.
The second new acceleration action is termed “buffering”. Buffering means that certain packets are placed in a buffer. Buffering is an alternative to prioritizing, or it may cooperate therewith. Generally speaking, less important packets are placed in a buffer. Different packet types have different impacts on the end user experience. For example a large number of dropped voice or music packets will severely impact the end user listening experience, while dropping an advertisement in a web page will likely have a positive impact. Differentiation between packet types may be carried out by marking certain packets in a manner indicative of their content or by their protocols.
The third new acceleration action is termed “ordering”. Ordering means the transfer order of the packets is changed so that important packets are transferred before less important packets. Ordering requires buffering, i.e. packets are placed in the buffer.
The fourth new acceleration action is termed “filtering”. Filtering differs from packing, which is known in the art, in that filtering purposely reduces the quality of content. For example, if the content is a video, the resolution of the video can be reduced. There are several ways to reduce the quality of videos or other audio and/or visual information. Filtering also concerns the quality of text. A formatted piece of text, such as a Word document, can be transformed to plain text, e.g. to ASCII text. Thus filtering allows the total transferred bit volume to be reduced.
Various aspects of the invention enable operator-specific, user-specific, group-specific, and content provider-specific acceleration settings that determine how and when the optimization is performed, i.e. which acceleration actions are used in a certain case.
The invention is described more closely with reference to the accompanying drawings, in which
One aspect of the invention provides for counting the number of packets sent and/or the number of retransmission requests by using at least one class set. A class set may concern, for example, the content of packets. Or, a class set may concern network areas. A network area could be e.g. the geographical area of a cell.
Each class set composes a statistical table in which each class of the class set is related to the current number of retransmission requests. In addition, each class of the class set can be related to at least one predefined level for retransmission requests.
Alternatively, each class set composes a statistical table in which each class of the class set is related to the current number of the packets downloaded and the current number of packet acknowledgements. In addition, each class or each class of the class set can be related to at least one predefined level for a ratio between the packet acknowledgements and the number of the packets downloaded.
A predefined level may define the normal level of unsuccessful transmission. Exceeding that predefined level triggers acceleration actions which should accelerate the network traffic and drive the volume of unsuccessful transmission to the normal level or preferably under it. However, a predefined level may also define other parameters and ratios such as, for example, a user-specific or user specified level of communication events, so that exceeding or falling below said level starts such acceleration actions which should improve the end-user experience. In this case, reduction of network may be of secondary importance.
The number of active end-users, radio interferences, and corresponding features varies in the cells of a network. At a certain time a lot of retransmission requests may arise in some network areas and in other network areas only a few. A preferred embodiment of the invention avoids a block that causes an overload in the SGSN 35. The block might arise as follows: 1) packet transmission fails in a certain area, 2) the SGSN receives retransmission requests from a radio part 30 and transmits them via the GGSN 40 and the accelerating server 45 to the Internet, 3) the packets to be retransmitted are stored in the buffering window of the SGSN, 4) the packets and other packets are discarded because their maximum holding time is reached, and 5) retransmission requests are received when the receiving stations attempt to complete the interrupted transmission sequence. During the block the buffering window of the SGSN is full or almost full and the processor time is wasted for handling the buffering window.
The system avoids a block in the SGSN by either prioritizing or buffering packets in the accelerating server. The prioritizing/buffering is based on at least one class set and the statistics resulting from the calculation. For example, the accelerating server may maintain the tables shown in
As can be seen in
Thus, there are four new acceleration actions. In addition, some prior art acceleration actions, such as packing, can be executed for a packet before sending it to the radio part. Next the new acceleration actions are described in detail and after that the accelerating settings.
Prioritizing is a transparent acceleration action, i.e. packets are not modified. The accelerating server marks packets with a priority identifier. Marking can be done for example, by adding an information header to a packet. For example, the packets with priority identifier 1 have higher priority than the packets with identifier 2. There can be arbitrarily many levels of priorities.
Special software needs to be installed in the SGSN that can then read the priority identifiers of the packets and determine which packets should be discarded. For example, if the total size of the stream is 40 kb/s, and one half of the packets are marked with priority 1 and the other half of the packets with priority 2, the SGSN discards the packets with the lower priority 2. After that, the mobile terminal receives a stream of 20 kb/s including all the packets with priority 1.
This is especially advantageous if the stream is coded so that by dropping the lower priority packets the stream does not break, but its quality, such as picture resolution or color richness is downgraded. For example, MPEG4 is a streaming standard supporting this feature.
If there is a stream of which the full rate is 75 kb/s, it can be prioritized as follows: priority 1 with 5 kb/s contains the audio data, priority 2 with 10 kb/s contains the coarsest graphical information, priority 3 with 20 kb/s contains more graphical information, and priority 4 with 40 kb/s contains even more graphical information.
If this stream would be used for example for video conferencing, the end user would always receive at least the tone if the minimum bit rate would be 5 kb/s. The full 75 kb/s would provide the full quality. The benefits are that 1) the stream would not be broken and 2) the packet discard in SGSN would be done intelligently.
Buffering is a transparent acceleration action. The buffer size can be deduced from the number of retransmission requests or other similar phenomena. The buffer size should dynamically change if also the buffering window size of the SGSN or GGSN dynamically changes, for example, depending on the network load.
Preferably, the buffer is located in the accelerating server. The buffering is based on at least one class set and a statistic resulting from a calculation. For example, the content of packets can be used as a class set. In this case the accelerating server counts the quantities related to different content types, such as text, picture, program, etc. The accelerating server may count, for example, the number of packets sent and the number of retransmission requests. The said calculation results in the statistic whereby a predefined level of retransmission requests is determined.
When there are a lot of retransmission requests, the predefined level is exceeded and the buffering is started. Then the accelerating server stores the packets related to the retransmission requests in the buffer. The accelerating server may continue the buffering until the predefined level of retransmission requests is reached.
Ordering is a transparent acceleration action. Also this acceleration action uses a buffer. Thus, certain packets are transferred at once and certain other packets are stored in the buffer and transferred later.
For example, if a web page includes graphic images as well as text, the packets containing the images can be stored in the buffer and transferred later if required. Another example concerns emails. If emails are downloaded, and at the same time, web pages are accessed, it is possible to guarantee a certain fraction of the bandwidth for the emails.
Filtering is not a transparent acceleration action, i.e. information is removed. The filter manipulates packets so that their size decreases. This can be done in many ways: some packets can be dropped, the format of files can be changed, unnecessary features may be taken away etc. An example of a very crude filter is the filter which transforms Microsoft Word*.doc files to pure ASCII form.
The filtering of data streams is very important when reducing load in a GPRS network. This applies also to the streams in UMTS. The data streams to be filtered may be audio/video streams. The quality of a video stream can be downgraded, for example, by decreasing the resolution, by changing the picture format, or by changing a color stream to a black and white stream. Similar downgrading can also be done for audio streams.
The stream downgrading heavily loads the accelerator server. If this is made for each user individually, a very powerful server should be used. Instead, it is advantageous to define certain standard downgrading filters for the streams and make the stream downgrading only once per stream in accordance with a set of downgrading parameters. Downgraded streams are downloaded to the accelerator server and end-users can choose which stream they want to subscribe to.
The acceleration settings determine: 1) actions i.e. which acceleration actions a user wants to select, 2) targets i.e. how the selected acceleration actions are targeted, and 3) triggers i.e. which conditions trigger the selected acceleration actions.
The operator of an accelerating system has operator-specific values for the acceleration settings. Instead of the operator-specific values it is possible to use user-specific, group-specific, or content provider-specific values for the acceleration settings. However, if the predefined level of network load is exceeded, the operator-specific values are obeyed in order to treat the users with justice. The term “user experience” refers not only to end-user experience but also the experience of a group or a service provider, because a group or a service provider can be considered as the users of an accelerating system.
The selected acceleration actions can be targeted, for example, as follows:
Any combination of the following conditions may trigger the selected acceleration actions:
The embodiments of the invention concern many aspects of the composition of the accelerating system. The system is able to operate with or without client accelerators. If an end user has an accelerating client, the optimization is more efficient. If there is no accelerating client in a mobile client device, the accelerating server acts as a proxy gateway for application software installed in the mobile client device. The application software can be e.g. a browser.
If a client mobile device cannot find any accelerating server, it passes all the traffic through. The benefit is now that the proxy configurations in the client mobile device do not have to be altered. The client mobile device checks, for example, every 5 minutes whether the server is up. When it is up, the client mobile device starts to use the accelerating server.
Also the accelerating client may use buffering, especially for video streams. For example, when the accelerating client downloads one minute of a video stream, it could store the stream in the buffer in order to display a continuous video in the mobile client device.
An accelerating server is preferably duplicated so that a spare server can continue accelerating if the active server is for some reason out of order. If there is a lot of traffic it is preferable to compose a system that consists of a duplicated master server and a set of slave servers. Then the active master server forwards the packets to slave servers.
It is important to notice that there should be only one point in the network through which all the acceleration actions are coordinated. If there would be two or more accelerating servers accelerating traffic independently, i.e. without knowing each other's acceleration actions, the said servers would just worsen the traffic.
Optionally, it is possible to define a message interface between the SGSN and accelerating server so that the accelerating server would obtain additional load information other than retransmission requests and/or packet acknowledgements from the SGSN. Better load information could increase the performance of the accelerating system. It is also possible to define a message interface between the SGSN and GGSN so that the SGSN would inform the GGSN if it discards a packet. Then the GGSN could avoid erroneous charging.
A common message interface between the GGSN, SGSN, and accelerating server could be based on simple network management protocol (SNMP). SNMP is intended for the management of IP networks. Its approach of management is to view a network as a set of cooperative communicating nodes. In principal, there are two types of nodes: management nodes and managed nodes. Relating to an accelerating system, the accelerating server could be, for example, the manager node and the GGSN and SGSN the managed nodes.
An SNMP agent is software that resides on a managed node and is responsible for communicating with the manager nodes. The agent has two main tasks: 1) to respond to requests from manager nodes and 2) to generate traps to inform manager nodes of certain events occurring at the node, such as a malfunction.
A manager node communicates with an agent by messages that are in the form of requests. The manager node does not need to know any internal details about the object managed by an agent. The agent does not need to know the context of the request. The agent validates the request, services it, and enters a passive state to await the next request.
Management information base (MIB) is an SNMP data structure that is used to store data relating to the managed nodes. MIB's describe objects by specifying the names, types, and the order of the fields that compose the objects. Relating to the accelerating system in accordance with the invention, a MIB may, for example, describe a statistical table mentioned above. When the GGSN, SGSN, and accelerating server have common MlBs they can communicate with each other and share information, such as load information and information about discarded packets.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US5235595 *||Jan 6, 1989||Aug 10, 1993||Fischer & Porter Company||Packet switching|
|US6018516||Nov 14, 1997||Jan 25, 2000||Packeteer, Inc.||Method for minimizing unneeded retransmission of packets in a packet communication environment supporting a plurality of data link rates|
|US6118765||Jan 13, 1998||Sep 12, 2000||Qualcomm Inc.||System method and computer program product for eliminating unnecessary retransmissions|
|US6144996 *||Aug 12, 1998||Nov 7, 2000||Compaq Computer Corporation||Method and apparatus for providing a guaranteed minimum level of performance for content delivery over a network|
|US6211881 *||Aug 12, 1998||Apr 3, 2001||Compaq Computer Corporation||Image format conversion with transparency color adjustment|
|US6300959 *||Aug 12, 1998||Oct 9, 2001||Compaq Computer Corporation||Method and system condensing animated images|
|US6317418 *||Apr 27, 1998||Nov 13, 2001||Nokia Mobile Phones Limited||Method for transmitting packet switched data in a mobile communications system|
|US6389460 *||Aug 12, 1998||May 14, 2002||Compaq Computer Corporation||Method and apparatus for efficient storage and retrieval of objects in and from an object storage device|
|US6449658 *||Nov 18, 1999||Sep 10, 2002||Quikcat.Com, Inc.||Method and apparatus for accelerating data through communication networks|
|US6510469 *||Aug 12, 1998||Jan 21, 2003||Compaq Information Technologies Group,L.P.||Method and apparatus for providing accelerated content delivery over a network|
|US6578073 *||Aug 12, 1998||Jun 10, 2003||Hewlett-Packard Development Company, L.P.||Accelerated content delivery over a network using reduced size objects|
|US6587985 *||Nov 30, 1999||Jul 1, 2003||Matsushita Electric Industrial Co., Ltd.||Data transmission method, data transmission apparatus, data receiving apparatus, and packet data structure|
|US6590893 *||Apr 7, 1999||Jul 8, 2003||Legerity, Inc.||Adaptive transmission system in a network|
|US6601207 *||Mar 2, 2000||Jul 29, 2003||Nokia Corporation||Method and a device for re-transmitting data transfer packets|
|US6810488 *||May 22, 2001||Oct 26, 2004||Webex Communications, Inc.||Adaptive selective retransmission of packets|
|US6836862 *||Apr 24, 2000||Dec 28, 2004||3Com Corporation||Method of indicating wireless connection integrity|
|US6987730 *||Aug 15, 2001||Jan 17, 2006||Matsushita Electric Industrial Co., Ltd.||Transmission apparatus and method for changing data packets priority assignment depending on the reception feedback|
|US20010001268 *||Dec 19, 2000||May 17, 2001||Opuswave Networks, Inc.||Wireless local loop system supporting voice/IP|
|US20020009157 *||May 10, 2001||Jan 24, 2002||Jussi Sipola||Data transmission in radio system|
|US20020010758 *||May 2, 2001||Jan 24, 2002||Chung Chan||Global data network using existing wireless infrastructures|
|US20020010765 *||Jul 12, 2001||Jan 24, 2002||John Border||Method and system for prioritizing traffic in a network|
|US20020016851 *||Jul 12, 2001||Feb 7, 2002||John Border||Method and system for providing buffer management in a perormance enhancing proxy architecture|
|US20020107971 *||Mar 1, 2001||Aug 8, 2002||Bailey Brian W.||Network transport accelerator|
|US20020108059 *||Mar 1, 2001||Aug 8, 2002||Canion Rodney S.||Network security accelerator|
|US20020133621 *||Mar 19, 2001||Sep 19, 2002||Expand Networks Ltd||Method and system for accelerating receipt of data in a client to client network|
|US20020169818 *||Apr 24, 2002||Nov 14, 2002||Compaq Computer Corporation||Method and apparatus for efficient storage and retrieval of objects in and from an object storage device|
|US20020194350 *||Apr 30, 2002||Dec 19, 2002||Lu Leonard L.||Content-aware web switch without delayed binding and methods thereof|
|1||"Network Congestion Monitoring and Detection Using the Infrastructure Paralell Processing", Takeo Saioh et al. , Proceedings, 1999 International Conference on. On pp. 462-469, Sep. 21-24, 1999, Aizu-Wakwamatsu, Japan, ISVBN 0-7695-0350-0.|
|2||"Nonintrusive TCP Connection Admission Control for Bandwidth Management of an Internet Acces Link", Anurag Kumar et al. IEEE Communications Magazin, vol. 38, Issue 5, May 2000. ISSN 0163-6804.|
|3||"TCP-SMART: A technique for Improving TCP Performance in a Spotty Wide Band Environment" Moncef Elaoud et al. Communications, 2000 ICC 2000. 2000 IEEE int. Conf. pp. 1783-1787, vol. 3, Jun. 18-22, 2000, New Aurleans, LA ISBN: 0-7803-6283-7.|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US7474426 *||Dec 18, 2002||Jan 6, 2009||Oce Printing Systems Gmbh||Method, device system and computer program for saving and retrieving print data in a network|
|US7913529 *||Apr 11, 2008||Mar 29, 2011||Cisco Technology, Inc.||Centralized TCP termination with multi-service chaining|
|US7921686 *||Apr 11, 2008||Apr 12, 2011||Cisco Technology, Inc.||Highly scalable architecture for application network appliances|
|US8094560||Jan 10, 2012||Cisco Technology, Inc.||Multi-stage multi-core processing of network packets|
|US8443069 *||Mar 24, 2011||May 14, 2013||Cisco Technology, Inc.||Highly scalable architecture for application network appliances|
|US8484370 *||Apr 16, 2002||Jul 9, 2013||Trimble Navigation Limited||Method and system for efficient extended data communications using GPRS|
|US8667556||May 19, 2008||Mar 4, 2014||Cisco Technology, Inc.||Method and apparatus for building and managing policies|
|US8677453||May 19, 2008||Mar 18, 2014||Cisco Technology, Inc.||Highly parallel evaluation of XACML policies|
|US8982839||Jul 20, 2012||Mar 17, 2015||Core Wireless Licensing S.A.R.L.||Method and apparatus for improving a mobile station cell change operation in the general packet radio system (GPRS)|
|US9100371||Apr 10, 2013||Aug 4, 2015||Cisco Technology, Inc.||Highly scalable architecture for application network appliances|
|US9325456 *||Mar 22, 2005||Apr 26, 2016||Intel Corporation||Method and apparatus for delayed recovery for block acknowledgement bursting in a wireless network|
|US20050117176 *||Dec 18, 2002||Jun 2, 2005||Viktor Benz||Method, device system and computer program for saving and retrieving print data in a network|
|US20060215563 *||Mar 22, 2005||Sep 28, 2006||Intel Corporation||Method and apparatus for delayed recovery for block acknowledgement bursting in a wireless network|
|US20060259348 *||Mar 21, 2006||Nov 16, 2006||Youbet.Com, Inc.||System and Methods of Calculating Growth of Subscribers and Income From Subscribers|
|US20080096523 *||Jul 22, 2003||Apr 24, 2008||Niklas Lundin||An Arrangement, a Node and a Method Relating to Handling of Lost/Discarded Data Packets|
|US20090063688 *||Apr 11, 2008||Mar 5, 2009||Rohati Systems, Inc.||Centralized tcp termination with multi-service chaining|
|US20090285228 *||Nov 19, 2009||Rohati Systems, Inc.||Multi-stage multi-core processing of network packets|
|US20090288104 *||May 19, 2008||Nov 19, 2009||Rohati Systems, Inc.||Extensibility framework of a network element|
|US20100070471 *||Mar 18, 2010||Rohati Systems, Inc.||Transactional application events|
|US20110173441 *||Jul 14, 2011||Cisco Technology, Inc.||Highly scalable architecture for application network appliances|
|U.S. Classification||370/235, 370/477, 370/345|
|International Classification||H04J3/24, H04L, H04L29/08, H04L1/00, H04L12/56|
|Cooperative Classification||H04L47/2458, H04L47/11, H04L47/25, H04L47/14, H04W28/06, H04W28/10, H04L47/10, H04L1/1887, H04L1/1874|
|European Classification||H04L47/14, H04L47/24F, H04L47/10, H04L47/25, H04L47/11, H04W28/06, H04L1/18T7, H04L1/18T3|
|Nov 28, 2001||AS||Assignment|
Owner name: FIRST HOP OY, FINLAND
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:KOPONEN, JUHA;KALLIOLA, JANNE;KARI, HANNU;AND OTHERS;REEL/FRAME:012380/0954;SIGNING DATES FROM 20010815 TO 20010829
|Jan 5, 2007||AS||Assignment|
Owner name: FIRST HOP OY, FINLAND
Free format text: CHANGE OF NAME;ASSIGNOR:FIRST HOP OY;REEL/FRAME:018718/0338
Effective date: 20070104
|Aug 4, 2010||FPAY||Fee payment|
Year of fee payment: 4
|Dec 12, 2012||AS||Assignment|
Owner name: MAVENIR SYSTEMS OY, FINLAND
Free format text: CHANGE OF NAME;ASSIGNOR:AIRWIDE SOLUTIONS OY;REEL/FRAME:029457/0744
Effective date: 20110819
|Dec 18, 2012||AS||Assignment|
Effective date: 20081102
Owner name: AIRWIDE SOLUTIONS OY, FINLAND
Free format text: CHANGE OF NAME;ASSIGNOR:FIRST HOP OY;REEL/FRAME:029495/0292
|Feb 17, 2014||FPAY||Fee payment|
Year of fee payment: 8