266results about How to "Guaranteed bandwidth" patented technology

An admission controller and its method of operation for controlling admission of data flows into an aggregate data flow are described. Admitted data flows are aggregated into an aggregate data flow for transmission by a router, for example, over a data network. The aggregate data flow typically follows a pre-established path through the network; for example a multi-protocol label switched (MPLS) path. The path has minimum and maximum bandwidth limits assigned to it. The admission controller controls admission of new data flows into the aggregate data flow by granting or denying new session requests for the new data flows. Congestion notifications received from the network and bandwidth limits of the path are considered in determining whether to grant or deny a new session request. In this way, the admission controller provides elastic sharing of network bandwidth among data flows without exacerbating network congestion and while remaining within the path's bandwidth limits. The data flows may include transaction oriented traffic.

An architecture for quality-of-service (QoS) management creates a logical circuit-switched network within a packet network to support QoS-sensitive demands levied on the network. This QoS-managed network can serve to interwork, e.g., a PSTN with VoIP networks. The architecture can include a connection resource manager (CRM), which oversees bandwidth availability and demand admission/rejection on dynamically provisioned virtual trunk groups (VTGs) within the packet network, and a transport bandwidth controller (TBC). The VTGs serve to transport QoS-sensitive demands across the packet network. The TBC serves the CRM by providing an interface to routers and/or OAM systems of the packet network to size VTGs to meet QoS requirements. Media switches located at the packet network borders serve to mux/demux the demands into/from VTGs. CRMs and TBCs can be implemented as centralized, distributed, or hierarchical, and flat and aggregated variants of the architecture are supported. VTGs can be implemented using MPLS LSPs, VPNs, or source-based routing.

The present invention eliminates a transmission-waiting operation which is unnecessary while accommodating a prioritized traffic. Although a communication station enters a transmission-disallowed state in response to detection of a signal addressed to another station in accordance with medium access control based on CSMA, if the communication station receives a frame transmitted with priority to a local station during the transmission waiting, it cancels the transmission-disallowed state, sends back a frame responding the frame transmitted with priority and effectively operates a transmission prioritized period. The communication station starts a search procedure to perform a processing of evading duplication of the transmission prioritized periods if it judges a possibility of a problem occurring in a time zone in which reception with priority is possible.

Data flows generated in accordance with a connected mode protocol and formatted in packets in accordance with a non-connected mode protocol are transmitted via an ATM network. A set of virtual circuits of the ATM network is assigned in advance to each pair of access points of the ATM network, without allocating transmission rate resources to them. When an access point receives a request, formulated in accordance with the connected mode protocol, to establish a connection between a source address and a destination address accessible via another access point of the ATM network, an available virtual circuit is selected from the set assigned to this pair of access points and a resource management cell containing a request to activate the virtual circuit is transmitted on the selected virtual circuit. When this cell is received by a node of the ATM network located on the selected virtual circuit, a transmission rate resource is allocated, if it is available, to the selected virtual circuit.

A system for scheduling multirate multicast packets through an interconnection network having a plurality of input ports, a plurality of output ports, and a plurality of input queues, comprising multirate multicast packets with rate weight, at each input port is operated in nonblocking manner in accordance with the invention by scheduling corresponding to the packet rate weight, at most as many packets equal to the number of input queues from each input port to each output port. The scheduling is performed so that each multicast packet is fan-out split through not more than two interconnection networks and not more than two switching times. The system is operated at 100% throughput, work conserving, fair, and yet deterministically thereby never congesting the output ports. The system performs arbitration in only one iteration, with mathematical minimum speedup in the interconnection network. The system operates with absolutely no packet reordering issues, no internal buffering of packets in the interconnection network, and hence in a truly cut-through and distributed manner. In another embodiment each output port also comprises a plurality of output queues and each packet is transferred corresponding to the packet rate weight, to an output queue in the destined output port in deterministic manner and without the requirement of segmentation and reassembly of packets even when the packets are of variable size. In one embodiment the scheduling is performed in strictly nonblocking manner with a speedup of at least three in the interconnection network. In another embodiment the scheduling is performed in rearrangeably nonblocking manner with a speedup of at least two in the interconnection network. The system also offers end to end guaranteed bandwidth and latency for multirate multicast packets from input ports to output ports. In all the embodiments, the interconnection network may be a crossbar network, shared memory network, clos network, hypercube network, or any internally nonblocking interconnection network or network of networks.

A computer with a processor, memory, and one or more network interfaces, the computer having a virtualization management unit for managing a virtual computer and a bandwidth control unit for controlling a bandwidth in use in a virtual computer group comprised of one or more virtual computers, in which the virtualization management unit contains an analysis unit for managing a bandwidth in use of virtual network interfaces allocated to the virtual computers, the analysis unit measures the bandwidth in use of the each virtual computer, determines whether there exists a first virtual computer group whose bandwidth in use is smaller than a guaranteed bandwidth, and commands to control the bandwidth of a second virtual computer group whose bandwidth in use is larger than the guaranteed bandwidth, and the bandwidth control unit secures a free bandwidth just equal to a shortage of the guaranteed bandwidth of the first virtual computer group.

A system using scheduled times for transmission at each link guarantees bandwidth for transmitting data across a packet network. A scheduling agent determines availability of data paths across a network according to pre-selected criteria and real-time network topology information. Precise schedules are determined for transmission and reception appointments for data packets to traverse each link and switch in the network including compensation for transmission delays and switch latencies, resulting in a fixed packet flow itinerary for each connection. Itineraries are communicated to schedule-aware switches and endpoints and appointment times are reserved for transmission of the scheduled data packets. Scheduled packets arriving at each switch are forwarded according to their predetermined arrival and departure schedules, rather than their headers or contents, relieving the switches from making real-time routing decisions. Any unscheduled transmission times remain available for routing of unscheduled packets according to their IP headers. Real-time transmission of data can be guaranteed in each scheduled path, and schedule selection criteria may be adjusted according to network utilization and tolerable setup delay and end-to-end delay.

A traffic shaper comprises a bandwidth controller 40 having a plurality of leaky bucket units 41-1 to 41-n prepared in correspondence with buffer memories 20-1 to 20-n, and an output queue designation unit 43 for specifying a buffer memory from which a packet is to be read out. Each of the leaky bucket units 41 has a level counter 416 for decrementing the count value at a predetermined rate, and a level increaser 411 to 417 for increasing the count value of the level counter by a value proportional to the product of the length of a transmitted packet and a unitary increment value which is variable depend on the current count value of the level counter.

The invention relates to a network flow cache method and a network flow cache system based on active guidance. The method comprises the following steps of: 101) analyzing a protocol in network flow, and caching the network flow meeting a requirement to a local cache server; and 102) actively guiding a user to the local cache server by one of the following active guidance modes according to a network protocol used by a user request service, and cutting off linkage between an internal network user and an external network server, wherein by the first mode, the user is guided to the local cache server by adopting a redirection guide mechanism; by the second mode, the user is guided to the local cache server by an intelligent domain name server (DNS) guide method; by the third mode, the user is guided to the local cache server by a false message guide method; and by the fourth mode, the user is guided to the local cache server by a distorted message guide method. The system supports multiple active guidance modes; and after the modes are combined, the network flow can be guided to the cache system for service to the maximum extent.

One embodiment of the present invention sets forth a compression status bit cache with deterministic latency for isochronous memory clients of compressed memory. The compression status bit cache improves overall memory system performance by providing on-chip availability of compression status bits that are used to size and interpret a memory access request to compressed memory. To avoid non-deterministic latency when an isochronous memory client accesses the compression status bit cache, two design features are employed. The first design feature involves bypassing any intermediate cache when the compression status bit cache reads a new cache line in response to a cache read miss, thereby eliminating additional, potentially non-deterministic latencies outside the scope of the compression status bit cache. The second design feature involves maintaining a minimum pool of clean cache lines by opportunistically writing back dirty cache lines and, optionally, temporarily blocking non-critical requests that would dirty already clean cache lines. With clean cache lines available to be overwritten quickly, the compression status bit cache avoids incurring additional miss write back latencies.

A shaping apparatus comprising a plurality of buffer memories allocated for different flows, bandwidth control units associated with the buffer memories, and a read control unit, wherein each of the bandwidth control units issues a first frame output request based on a maximum allowed bandwidth and a second frame output request based on a minimum guaranteed bandwidth, and the read control unit selects a bandwidth control unit to be permitted for frame output execution out of bandwidth control units that are issuing the first or second frame output request, giving priority to the second frame output request.

The invention discloses a video connection control method and video connection control equipment. The method comprises the following steps of: receiving a video connection request, and acquiring a priority and an occupied bandwidth corresponding to the video connection request; if a current residual bandwidth for encoding equipment to access a network is lower than the occupied bandwidth, determining a maximum bandwidth, which can be decreased, of currently established video connection, and judging whether the sum of the maximum bandwidth and the current residual bandwidth is not lower than the occupied bandwidth or not; if the sum of the maximum bandwidth and the current residual bandwidth is not lower than the occupied bandwidth, decreasing code stream parameters of the video connectionaccording to the code stream parameters which can be decreased and are supported by the video connection from the video connection with the lowest priority until the residual bandwidth after the decreasing is not lower than the occupied bandwidth; otherwise denying to establish the video connection. By the method and the equipment, users with high priorities can be ensured to obtain better experiences.

When numbers of node in network increases to a certain scale, network topology interconnection techniques between exchangers are produced. Synthesized interconnection mode of fat tree topology and full net topology is utilized in the invention, that is to say fat tree interconnection is utilized for each branch and full net interconnection mode is applied among branches. Based on number of branch, two branches fat trees, three branches fat trees and four branches fat trees are named. Comparing with network topology structure of nonblocking fat tree under condition of the same number of exchnger, the invented structure possesses advantages of available large scale of networked scale, lowered communication delay, and higher rate of performances/cost.