142results about How to "Avoid network congestion" patented technology

The bypass network is designed to provide fast access and high quality streaming media services anywhere anytime. There are five major components including Peering Gateway, Content Locator, Edge Server, Gateway and Client. The whole bypass network is divided into number of self-managed sub-networks, which are referred as local networks in this document. Each local network contains Edge Servers, gateways, and a Content Locator. The Edge Servers serve as cache storage and streaming servers for the local network. The gateways provide a connection point for the client computers. Each local network is managed by a Content Locator. The Content Locator handles all client requests by communicating with the Peering Gateway and actual web sites, and makes the content available on local Edge Servers. The Content Locator also balances the load on each Edge Server by monitoring the workload on them. One embodiment is designed for home users whose home machine does not move around frequently. A second embodiment is designed for business users who travel around very often where the laptops would self-configure as a client of the network.

A routing mechanism, service or system operable in a distributed networking environment. One preferred environment is a content delivery network (CDN) wherein the present invention provides improved connectivity back to an origin server, especially for HTTP traffic. In a CDN, edge servers are typically organized into regions, with each region comprising a set of content servers that preferably operate in a peer-to-peer manner and share data across a common backbone such as a local area network (LAN). The inventive routing technique enables an edge server operating within a given CDN region to retrieve content (cacheable, non-cacheable and the like) from an origin server more efficiently by selectively routing through the CDN's own nodes, thereby avoiding network congestion and hot spots. The invention enables an edge server to fetch content from an origin server through an intermediate CDN server or, more generally, enables an edge server within a given first region to fetch content from the origin server through an intermediate CDN region.

A routing mechanism, service or system operable in a distributed networking environment. One preferred environment is a content delivery network (CDN) wherein the present invention provides improved connectivity back to an origin server, especially for HTTP traffic. In a CDN, edge servers are typically organized into regions, with each region comprising a set of content servers that preferably operate in a peer-to-peer manner and share data across a common backbone such as a local area network (LAN). The inventive routing technique enables an edge server operating within a given CDN region to retrieve content (cacheable, non-cacheable and the like) from an origin server more efficiently by selectively routing through the CDN's own nodes, thereby avoiding network congestion and hot spots. The invention enables an edge server to fetch content from an origin server through an intermediate CDN server or, more generally, enables an edge server within a given first region to fetch content from the origin server through an intermediate CDN region. As used herein, this routing through an intermediate server, node or region is sometimes referred to as “tunneling.”

One embodiment of the present invention provides a system that avoids network congestion. During operation, the system can detect an onset of congestion in a first queue at a first node. Next, the first node can generate a first control-message, wherein the first control-message contains a congestion-point identifier which is associated with the first queue. The first node can then send the first control-message to a second node, which can cause the second node to delay sending a second message to the first node, wherein the second message is expected to be routed through the first queue at the first node. Next, the second node may propagate the control-message to a third node which may cause the third node to delay sending a third message to the second node, wherein the third message is expected to be routed through the first queue at the first node.

A method, a system, and a computer program product implements traffic shaping by processing as a synchronous request, tasks representing one or more units of work contained within the request. Before a request is sent through the network, the request is inspected in order to derive the amount of work that the request would generate in the network. A traffic manager queries the amount of work in that request compared to the amount of work that the network can support and generates a number of traffic envelopes. Based on the results of this query, “task pruning” may be implemented to break the request into smaller manageable task that fit into the traffic envelopes. Task pruning may also enable only a subset of the work to be performed. Thus, a measure of the amount of work, rather than the amount of data, within a request is considered when scheduling the request.

The present invention discloses a method and node for acquiring content and a content network, and is related to the field of communications. The method includes: receiving a content request, where the content request at least includes an identifier of requested content; determining whether the content corresponding to the identifier can be acquired locally; if yes, acquired the content corresponding to the identifier locally; otherwise, searching, according to the identifier, a name resolution system for a target node that stores the identifier, and acquiring the content corresponding to the identifier from the target node; where the name resolution system comprises a multilevel DHT and a global content resolution structure, and the global content resolution structure supports name aggregation and longest matching search.

A network system and a method of address resolution are provided. The network system includes a network, a plurality of virtual machines, a routing module and a path directory module. Each virtual machine includes an internet protocol (IP) address and N media access control (MAC) addresses, so as to connect the network through N transmission routes. The routing module detects and calculates states of the transmission routes. The path directory module receives and decodes an address resolution protocol (ARP) request presented by at least one source virtual machine to reply path information, which includes N MAC addresses corresponding to an IP address of a destination virtual machine and states of the N transmission routes. Thus, the virtual machines present the ARP request without broadcast, so that the problem of network congestion is solved.

A routing mechanism, service or system operable in a distributed networking environment. One preferred environment is a content delivery network (CDN) wherein the present invention provides improved connectivity back to an origin server, especially for HTTP traffic. In a CDN, edge servers are typically organized into regions, with each region comprising a set of content servers that preferably operate in a peer-to-peer manner and share data across a common backbone such as a local area network (LAN). The inventive routing technique enables an edge server operating within a given CDN region to retrieve content (cacheable, non-cacheable and the like) from an origin server more efficiently by selectively routing through the CDN's own nodes, thereby avoiding network congestion and hot spots. The invention enables an edge server to fetch content from an origin server through an intermediate CDN server or, more generally, enables an edge server within a given first region to fetch content from the origin server through an intermediate CDN region.

A method and system for controlling traffic on a network. A congestion indicator is generated by network components in response to the flow of network traffic. The congestion indicator is received by a network peripheral node that has a threshold variable which controls the flow of traffic flowing from the network peripheral node. The threshold variable corresponding to the congestion indicator will be reduced in order to restrict the flow of traffic flowing from that network peripheral node. If more than one congestion indicator is received by the network peripheral node, then the threshold variable will continue to be reduced thereby further restricting network traffic. If no further congestion indicators are received, then the network peripheral node will terminate the Back-Off Period state of the threshold variable such that the threshold variable can then be increased and network traffic can increase.

The present invention relates to the field of mobile communications and in particular to messaging methods and systems using mobile communications terminals. In particular, but not exclusively, the invention relates to email messaging and in accordance with the invention there is established a connection between at least one mobile communication terminal and a server for a specific period of time which allows messages to be communicated to the terminal. The duration of the connection is typically such as to allow more than one message to be received in any specific time period. The connection time periods are interspersed with periods of non connection and the duration and frequency of said connection time periods may be controlled with respect user selected modes of operation and / or an operating parameter of the mobile communication terminal.

A repeater and method provides a technique to minimize congestion and packet loss, which may be generated when a fault is detected in a ring type packet network or when the network recovers from such a fault. A repeater having a plurality of ports for transmitting and receiving packets in a ring type network for transmitting the received packets on the basis of an address included in a received packet and a transmitting port database indicating an identifier of a port to transmit the packet having the address as the destination, comprises a control packet processing block to detect reception of a fault notifying packet transmitted from a repeater having detected a fault and a control block to update, upon reception of the fault notifying packet from an immediately adjacent repeater, a port identifier of the transmitting port database having a port identifier of the port having received said fault notifying packet into a port identifier of a port connected to another immediately adjacent repeater.

When carrying out a downlink handover, a source base transceiver station from which a mobile node is moving receives packets to be transmitted, via a wireless section, to the mobile node from an IP network, and copies and transfers them to a destination base transceiver station to which the mobile node is moving. On the other hand, when carrying out an uplink handover, the source base transceiver station compares the reliability of transport blocks which are received via a wireless section, from the mobile node and which are demodulated and decoded by the local station with that of transport blocks which are received via an IP network, from another base transceiver station and which are demodulated and decoded thereby, packetizes selected transport blocks with a better quality, and transmits them to a communications-partner node according to a route table, thereby implementing distribution of traffic via the IP network.

A method of optimizing packetization for a sending device of a Voice over Internet Protocol network includes encoding an audio signal, and monitoring a state of the Voice over Internet Protocol network. An optimal count of compressed data frames is determined from the state of the Voice over Internet Protocol network. The optimal count is employed to packetize the encoded audio signal in a payload. The payload is sent in a voice packet to the Voice over Internet Protocol network.

A system for capturing, encoding and transmitting continuous video from a camera to a display monitor via a network includes a user friendly interface wherein a map is provided at a display screen for illustrating the location of the cameras and indicating the direction of the camera angle. The monitor includes a display area for selectively displaying selected cameras and for controlling the selection, display and direction of the cameras from a remote location. The display screen can be configured to display one or any combination of cameras. The cameras can be selected by manual selection, pre-programmed sequencing or by event detection with the selected camera automatically displayed on the display area. Secondary monitors may be incorporated to enhance the display features. The secondary monitors are controlled by the control panel provided on the primary monitor.

The present invention discloses an service realization method for the fair user policy, mainly comprising the following steps: A, the user accesses an accessing server and goes to an AAA server to fulfill the accessing authority inspecting; B, the accessing server receives the grouping data service request of the user and matches the fee calculating rules and the policy information; if the match is successful, the step D comes up, otherwise the fee calculating rules and the policy requests are sent to PCRF; wherein, the fee calculating rules have relative relationships with the user type, the service type and the fee calculating policy, the policy information have relative relationships with the fee calculating policy, the policy cycle, the flux quota and the pointed speed; C, the PCRF server sends fee calculating rules and the policy response to the accessing server and issues the relative fee calculating rules and the policy information; D, the users process the transmission of the service data, access to the network and execute the policy information of the service and add up the data flow rate of the service. The present invention can effectively elevate the justification of the network resources used by the users.

A method implemented in a network apparatus used in a network is disclosed. The method comprises collecting information about network topology from a network controller, collecting information about data movement, deciding routing in the network according to the information about network topology and the information about data movement, and providing information about the routing to the network controller, wherein the network controller enforces the routing in the network. Other methods, apparatuses, and systems also are disclosed.

An auction system and method, which identifies at least one lot to be auctioned, having a plurality of units within the lot and associated auction parameters; transmits a remaining quantity of units within the lot from a central server to a plurality of remote locations; receives bid identifications for remaining units within the lot at the contemporaneous offering price from the plurality of remote locations; and decrements the offering price over time. The decrement may be adaptive to a bid activity pattern, and the bid activity pattern may be stored in a database. A local server may be provided to communicate between the central server and remote locations while changing the format of the information communicated. The packets preferably include compressed information, and preferably include quantity remaining information for a plurality of auction lots.

In a system and method for backward congestion notification (BcN) in a network, when it is determined in advance that congestion is imminent in the network, the system and method enable preventive reduction of packet transmission by transmitting a BcN message, requesting packet transmission reduction, to a network component transmitting packets, thereby preventing congestion and packet discard caused by network congestion.

The invention discloses a routing algorithm of guaranteeing QoS (quality of service) in a data center network based on SDN. Aiming at problems that user terminal transmission time delay is high and a link congestion is generated in the data center network, the routing algorithm of guaranteeing QoS in the data center network is provided. In the algorithm, priority classification is performed on a data flow arriving at a switch so that a high priority data flow which is sensitive to the time delay adopts a time delay guarantee algorithm; a path with minimum data plane time delay is found to carry out flow table issuing; for a low priority data flow which has a high requirement to a bandwidth, a bandwidth guarantee algorithm is adopted; and according to a demand of the data flow for the bandwidth, dynamic bandwidth adjusting is performed. The QoS of a user is effectively guaranteed and a resource utilization rate in the data center network is increased.

Systems and methods which provide network congestion avoidance implementing a fairness scheme in which a cost function is used are shown. Transmission cost, for use in network congestion avoidance packet dropping decisions, may be determined from an amount of air time needed to transmit a data packet, a transmission data rate, a size of a packet, an amount of spectral energy or transmit power associated with transmission, etc. A packet dropping probability for a particular packet is preferably determined as a function of the current flow cost and average flow cost to provide fair allocation of network communications resources. Embodiments additionally implement buffer based packet dropping probability calculation in order to provide a robust network congestion avoidance technique. Cost based packet dropping probability calculation and buffer based packet dropping probability calculation implemented according to embodiments are adapted to accommodate quality of service applications.

The problems of an additional load to an AR having the function of transferring a packet, a BR functioning as a border relay device, and an address management server, a packet loss due to an unnecessary inquiry to the management server, an increasing delay of a packet transfer, etc. can be reduced. According to the address identification information for identification of the type of an address, routers determine to which type the address assigned to a given packet belongs, a terminal identification address for identification of a source terminal and a destination terminal, a packet transfer address for transfer of the packet to another router, or an address requiring no address conversion. Thus, an address conversion network connected to an external IP network can be realized, an increased load by an inquiry about an erroneous address, etc. and a packet loss and delay due to an unnecessary inquiry can be reduced.

An auction system and method, which identifies at least one lot to be auctioned, having a plurality of units within the lot and associated auction parameters; transmits a remaining quantity of units within the lot from a central server to a plurality of remote locations; receives bid identifications for remaining units within the lot at the contemporaneous offering price from the plurality of remote locations; and decrements the offering price over time. The decrement may be adaptive to a bid activity pattern, and the bid activity pattern may be stored in a database. A local server may be provided to communicate between the central server and remote locations while changing the format of the information communicated. The packets preferably include compressed information, and preferably include quantity remaining information for a plurality of auction lots.

The invention provides a method for preparing a rubber-plastic compound. A composite device containing normal-temperature millstone-type elastomer fine crushing machineries is utilized to carry out crushing treatment on a mixture containing formulas of thermosetting elastomer and plastic or / and thermoplastic elastomer, and the mixture comprises the following components in weight ratio: thermosetting elastomer sieved by a sieve with the aperture of 5-40 meshes: plastic sieved by a sieve with the aperture of 1-5mm or / and thermoplastic elastomer sieved by a sieve with the aperture of 1-5 meshes:filler: other adjuvants = 40-90:60-10:0-200:0-10. The invention comprises a method, the composite device for implementing the method, and rubber-plastic compound products produced by the method, wherein a regeneration rubber-plastic compound is included. The invention not only can enable the absorb filler operation to become clean, continuous, normal-temperature and energy saving in the process of preparing new rubber-plastic composite material, but also can enable mixed waste plastic difficult to be reused by the prior art to be conveniently used for high-valued recycling.

A system for transmitting data packets representing a source signal across a packet data network is provided. The encoder comprises a first encoder (110) and a redundancy encoder (120). The redundancy encoding is generated with a bit rate continuously scalable, the bit rate being provided by a bit rate controller (142) that uses input from the network (130) and packet-loss rate information. At the decoder, recovery is performed by a parameter estimator based in part on information transmitted from the first encoder using information from previous and / or future blocks and in addition on redundant information. The method may be added to existing lossy source coding systems or may be used to enhance the quality of the reconstructed source signal even in scenarios without packet loss.

By simply logically connecting a client computer and an office apparatus together for a minimum required amount of time and allowing them to engage in a minimum required amount of interactions, the client computer can fully, easily, and expandably control a desired service of the office apparatus. In addition, the office apparatus can provide the client computer with response information required for processing in the client computer or can fully, easily, and expandably control a desired service provided by another apparatus. The present invention provides an office apparatus, a network system, and their control method all of which enable the above operations.

An edge switch comprises a token bucket control unit (234) which varies the amount of tokens flowing into a token bucket (233) per unit time in accordance with the congestion condition of an IP network, and the output rate of packets to be output onto a packet communication network is adjusted for each line identifier by controlling the output amount of a packet buffer, which defines the output rate of the packets to be output onto the IP network, in accordance with the amount of tokens held in the token bucket; on the other hand, a packet analyzing unit (239) comprises means for determining whether the source address of the received packet matches the address of a preregistered emergency call destination, and the token bucket control unit comprises means for further reducing, upon detection of a call initiated from an emergency call destination, the amount of tokens flowing into the token bucket for any destination address, other than the emergency call destination, that is experiencing congestion, and thereby retaining communication quality for emergency priority communication, thus achieving an edge switch that allows emergency communications to be performed with good voice quality over the IP network.

The invention relates to a high-precision full-automatic decorating machine. The decorating machine comprises a main drive part, a stander part, a transmission belt part, at least six sets of scraping and printing head parts, a net frame part, an auxiliary transmission part, a bedplate bracket part, a bedplate part, a drying device, a humidification device and a control part; the stander part is provided with the main drive part and the transmission belt part; the scraping and printing head parts are connected with the stander part; the net frame part is arranged on the scraping and printing head parts; the stander part is provided with the bedplate bracket part; as the bedplate part is provided with a positioning block and can be matched with a rotation positioning mechanism, the positioning precision is high; as the scraping and printing head parts are designed into a lifting structural form, the bedplate part can conveniently move along a track; as the drying device is mounted, printed paint is rapidly dried so as to avoid color crossing; as the humidification device is mounted, the printed paint is uneasy to dry and solidify so as to avoid blocking a net; and as a computer is adopted to be combined with photoelectric control, positioning precision and automatic degree are high.