108results about How to "Reduce network congestion" patented technology

The invention generally relates to a facility wide sorting and/or sequencing system for improving product processing operations and, more particularly, to a facility wide system and related functionality for simultaneously sorting and sequencing mixed mail pieces such as, for example, flats and letter mail pieces. The flats and letter mail pieces are placed in frames so that all types of mail pieces can be sorted and/or sequenced simultaneously through merging and diverting a stream of filled trays into and out of different streams at a full or substantially full transport speed.

A method and system for Mobile Internet Protocol (IP) device redundancy. As mobile devices roam away from a home network and change a connective status, mobility binding records are sent to a multicast network address on the home network. The multicast network address multicasts the mobility binding records to other active Mobile IP home agent control nodes, standby home agent control nodes and standby home agents on the home network. The method and system allows standby home agent control nodes or standby home agents to be transparently switched for active home agent control nodes or active home agents that fail without downloading or uploading large numbers of mobility binding records after a failure. The method and system may also help reduce failed calls (e.g., data sessions including Voice over IP (VoIP), H.323, etc.), network congestion and improve user satisfaction in Mobile IP systems.

A method is described for calculating a backup connection for restoring a nominal connection in a telecommunication network. The method performs the calculation of the backup connection taking into account updated values of parameters indicating at least one dynamic feature of a group of segments of the network. The dynamic parameters can be a measure of the performance of the segment, the degree of usage of the segment, the bandwidth overbooking of the segment or the bandwidth fragmentation or a combination of these measures.

The present invention is directed generally to an intelligent endpoint or communication device that can collect available bandwidth-related information metrics and/or perform call admission control functions. The present invention is further directed to an architecture comprising a switch or media server in communication with a plurality of subscriber communication devices in which the subscriber communication devices act as network nodes to collect available bandwidth-related information.

Methods and systems for providing necessary and sufficient quality-of-service (QoS), in a packet-based core transport network that utilizes dynamic setting of bandwidth management pipes or thresholds to obviate link congestion are disclosed. Congestion avoidance is a necessary and sufficient requirement in order to guarantee Quality of Service (QoS) in packet-based core networks.

A typical network is composed of a plurality of backbone links connecting edge nodes where backhaul links are aggregated. The backhaul links connect the backbone links to the remote sites serving the subscribers. In order to enforce bandwidth management policies, Access Controllers, which perform traffic shaping, are situated on each remote site.

In the event of a violation of certain link threshold settings, dynamic adjustment of the bandwidth management policies on affected Access Controllers is enforced. Various algorithms in determining the correlation between the link nearing congestion and the source or destination of traffic streams are also discussed. This invention implements a feedback control loop wherein probes at various points in the network checks for congestion states to guide bandwidth management threshold decisions in order to maintain the condition of non-congestion throughout the network. Capacity planning and congestion avoidance mechanisms work hand-in-hand to fulfill Service Level Agreements (SLA).

A method for identifying data is provided that includes receiving a data stream and performing a hashing operation on a portion of the data stream in order to identify a key that reflects an identity associated with the data stream. The method further includes storing a plurality of first and second hash table entries and comparing the key to the first and second hash table entries in order to evaluate if there is a match between the key and the first and second hash table entries.

A method of reducing network congestion and service latency associated with downloading Web pages containing third party advertisements. In one embodiment, pattern recognition algorithms are employed to determine whether a request for a URL may be satisfied by the content associated with a URL which is contained in the client's cache; if there is a pattern match, the cached contents associated with the URL are delivered to the browser to satisfy the request. In another embodiment, images associated with HTML snippet ads are requested and cached by client software before they are requested by the browser downloading the Web page where the images will be displayed. In a third embodiment, latency is reduced by “time shifting,” wherein a cached ad is displayed while client software requests and caches the ad originally requested ad, which will be shown the next time the URL is requested. In other embodiments, this time-shifting technique may also be combined with the pattern-recognition technique and the approach to accelerating delivery of HTML snippet ads.

A process and system for visually displaying to a user at a client computer alternative web pages to a desired web page. The invention locates these alternative web pages in search engines by searching for alternative cached copies of web pages and/or mirror sites. A user may view a hotlink to a desired web page on an accessed web page and either be provided with a table of alternative web pages for manually selecting the alternative web page or the invention may automatically, dynamically select the best alternative web page to the originally selected web page.

A system and method for reducing network node congestion by filtering out comparatively low priority packets prior to execution of other node functions, such as routing and switching, in packet-based network transmissions. The volume of packets is reduced by intercepting the information packets prior to their input to the network node. A portion of the intercepted packets are filtered out based on parameters corresponding to a probable packet acceptability at the network node. The remaining portion of the intercepted packets are forwarded to the network node for processing by the network packet functions.

An information channel and power combined self-configuration method for APs (Access Points) in wireless local area network comprises the steps as follows: the area where the APs to be configured are located is selected as a local network, and the local network is divided into a plurality of grids according to practical conditions; each AP sends out a self-configuration request to a server and simultaneously reports the position coordinate of the AP and the scanned frequency spectrum use information of the ambient environment of the AP; the server analyzes the positions and the ambient environments of the APs according to the self-configuration requests of the APs, and allocates information channels and power parameters to the APs to be configured in combination with the use conditions of AP information channels in neighbor cells under the premises of meeting the coverage rate requirement and minimizing same frequency interference, that is, first the signal energy of each grid is estimated according to a path loss empirical model to learn the network coverage condition, and then the information channel and the power parameter eventually configured for each AP is obtained through calculation based on the principle that the energy efficiency ratio is highest, and are sent to the AP to be configured. The method provided by the invention is quick and effective, guarantees the region coverage requirement, avoids same frequency interference to the maximum extent and guarantees that the energy efficiency ratio of the network is highest.

When transmitting multimedia data associated with a multimedia application, a TCP/IP connection is established between a client application and a server application. UDP data is intercepted at an application level from one or more UDP data ports and channeled into one or more tunneling TCP data connections. TCP data is intercepted at the application level from one or more TCP data ports and re-directed to a tunneling TCP port. The channeled UDP data is received and dispatched to one or more local UDP data ports. Re-directed TCP data is received and then further re-directed to one or more local TCP data ports.

A communication system having a source node, at least one mobile node, and a router that transmits data packets transmitted from the source node to a corresponding one of the at least one mobile node and multiplexes response signals to the data packets received from the corresponding one of the at least one mobile node to transmit the multiplexed response signals to the source node. The communication system includes: a link monitoring unit which calculates a capacity of a wireless link between the router and the corresponding one of the at least one mobile node; and a congestion control and adjustment unit which adjusts window field values in the response signals according to the calculated capacity. The router transmits the response signals, the response signals including the adjusted window field values to the source node, and the source node sequentially transmits the data packets on the basis of the adjusted window field values.

One embodiment of the present invention sets forth a method for updating content stored in a cache residing at an internet service provider (ISP) location that includes receiving popularity data associated with a first plurality of content assets, where the popularity data indicate the popularity of each content asset in the first plurality of content assets across a user base that spans multiple geographic regions, generating a manifest that includes a second plurality of content assets based on the popularity data and a geographic location associated with the cache, where each content asset included in the manifest is determined to be popular among users proximate to the geographic location or users with preferences similar to users proximate to the geographic location, and transmitting the manifest to the cache, where the cache is configured to update one or more content assets stored in the cache based on the manifest.

An improved system and method is provided for packet routing in dynamic router tables. Specifically, the invention relates to a method and system for using tree data structures to select the highest priority rule that matches a destination address in dynamic Internet packet routing tables. In an embodiment, a data structure called BOB (binary tree on binary tree) for dynamic router tables in which the rule filters are nonintersecting ranges and in which ties are broken by selecting the highest-priority rule that matches a destination address is disclosed. Prefix filters are a special case of nonintersecting ranges and the commonly used longest-prefix tie breaker is a special case of the highest-priority tie breaker. When an n-rule router table is represented using BOB, the highest-priority rule that matches a destination address may be found in O(log²n) time; a new rule maybe inserted and an old one deleted in O(log n) time. For the case when all rule filters are prefixes, the data structure PBOB (prefix BOB) permits highest-priority matching as well as rule insertion and deletion in O(W) time, where W is the length of the longest prefix, each. When all rule filters are prefixes and longest-prefix matching is to be done, the data structures LMPBOB (longest matching-prefix BOB) permits longest-prefix matching in O(W) time; rule insertion and deletion each take O(log n) time. On practical rule tables, BOB and PBOB perform each of the three dynamic-table operations in O(log n) time and with O(log n) cache misses. The number of cache misses incurred by LMPBOB is also O(log n).

The invention falls within the technology of multistage interconnection network such as fat-trees, comprising at least one switch located at a stage (s) and configured to send, through an output port from a number (k) of output ports forming an ordered list, at least a data packet containing a destination address identified by a n-tuple with a plurality (n) of components (p_n−1, . . . , p₁, p₀), and sε{0 . . . (n−1)}. The invention has application for both source and distributed routing, as deterministic and as adaptive routing, selecting an output port to be the unique or the default option to forward the packets at the switch which is the output port that has a position in the ordered list of output ports corresponding to the component (p_s) of the destination address at the position given by the stage (s) of the switch.

Methods and apparatus for content delivery and managing and conserving network bandwidth in a content delivery system are described. In accordance with one aspect of some embodiments, when the number content playback devices, e.g., IP set top boxes, iPADs, etc., in a region or service group receiving the same program content via individual unicast streams over a first network, e.g., cable network, exceeds a threshold number large, the IP capable playback devices are instructed to switch to receive the same programming content from a local device, e.g., a gateway device, via a home network. The local device receives the programming content via the cable network over a broadcast or SDV or VOD channel established by the cable service provider's headend/hubsite.

Systems, methods and software useful for overcoming network congestion problems including head-of-line blocking issues and other network congestion problems. In certain aspects, flow control mechanisms implemented in a switch device or other network device manage buffer and system level resources using a scheduler to control the amount of data requested from a local SAN fabric. Switches and other network devices configured according to the present invention monitor each individual SCSI task, and are configured to apply flow control measures to each active session when buffering resources become scarce, such as when buffering data for a slower-speed WAN link or TCP/IP based interconnects of any speed.

An improved system and method is provided for packet routing in dynamic router tables. Specifically, the invention provides a method, computer system, and computer readable media for using Priority Search Trees (PSTs) to match, insert, and delete rules in dynamic routing tables in O(log n) time. In a first embodiment, for a dynamic router table consisting of n pairs of tuples, each tuple comprising an address prefix and next-hop information, the invention provides a system and method, using a PST, for inserting a new tuple, deleting an existing tuple, and searching for the tuple with the longest matching prefix for destination address, wherein each operation is performed in O(log n) time. In a second embodiment, for a dynamic router table consisting of n pairs of tuples, each tuple comprising a range of destination addresses and next-hop information, the invention provides a system and method, using a PST and a set of red-black priority search tree (RBPST), for inserting a new tuple, deleting an existing tuple, and searching for the tuple with the most specific matching range, wherein each operation is performed in O(log n) time. The invention can be implemented in numerous ways to improve dynamic router table performance, including as a system, a device, a method, or a computer readable medium.