Abstract:
A method and apparatus for providing quality driven streaming content from a source (102) to a destination terminal (114) in a closed network (100) is disclosed. Every time a new stream is requested information regarding the required bandwidth is gathered. It is then determined if the network has the required bandwidth to transmit the new stream. When the network does not have the required bandwidth, the bandwidth of all streams presently being transmitted is reduced so as to enable the new stream to be sent to the destination terminal (114) when the network does not have the required bandwidth. The bandwidth reduction can be evenly distributed, proportionate based on a stored hierarchy of users, or be performed only on selected streams.
Abstract:
The invention relates to the transfer of packet data from a first subsystem via a network node in a second subsystem to a terminal in the second subsystem. The method comprises negotiating identifiers identifying a data flow of the first subsystem via a separate signalling element during the set-up of an application-plane logical connection of the terminal. The identifiers are transmitted from the signalling element to the network node. In the method, a filter is generated at least on the basis of the identifiers for directing the mapping of at least one data flow of the first subsystem to at least one data flow of the second subsystem. The filter is bound to at least one data flow of the second subsystem, and at least one data flow of the first subsystem is mapped to at least one data flow of the second subsystem on the basis of the filter.
Abstract:
A centralized resource manager (300) for distributed networks manages resources available on the network, such as network bandwidth, CPU allocation, TV tuners (48), MPEG encoders (114), disk bandwidth, and input/output devices. The centralized resource manager (300) also allocates the resources of network clients (46) and a network-associated media server (14), in response to requests for media services via the distributed network. The centralized resource manager may include means for discovering when devices are added or removed from the network; a current, IR, or electromagnetic Field sensing system for determining when video devices are turned off so that resources associated with any device not in use may be reallocated elsewhere; or a power switching system (307) for controlling the ON or OFF state of such devices so that resources associated with any device in the OFF state may be reallocated elsewhere.
Abstract:
A method of bandwidth allocation for delivery of stored digital content from at least one server device to at least one client device by way of a network is disclosed. The method begins by prescribing a control variable which represents a target flow rate from the server device to each client device. Next, time-varying constraints on the flow rate of the content are determined. A cost function of the control variable for each client is determined. The cost function corresponds to a maximized value of the control variable. Finally, bandwidth is prescribed to each client based upon the value of the control variable maximized by the cost function. In this respect, the method achieves optimal allocation of bandwidth between the server and the respective clients.
Abstract:
A communications system operator provides to each user of a multi-user communications system a committed information rate (CIR). When a user requests bandwidth for transmission, a system controller queues the user in a high-priority subclass A. The system controller allocates bandwidth to the user at the head of the queue as requested but if the user's bandwidth, measured as an average over a sampling time, exceeds its CIR, it is moved into a low-priority subclass B. The user can then only obtain further bandwidth after other users in the high-priority subclass have been alloctaed bandwidth up to their CIRs. If a user in the low-priority subclass only receives allocation of a small amount of bandwidth, so that its average information rate falls below its CIR, it is moved back into the queue in the high-priority subclass.
Abstract:
The present invention proposes a method for enabling a subscriber entity to actively communicate in a communication network, a subscriber entity being identified by at least one assigned subscriber identity (IMSI, MSISDN), said communication network comprising at least one database entity of a first type(5a, 5b) keeping a first record of data of subscriber entities enabled to actively communicate in a communication network, the method comprising the steps of: storing said at least one assigned subscriber identity of at least one subscriber entity not enabled to actively communicate in said communication network in a database entity (4) of a second type, informing (S2a, S2b) said database entity (4) of said second type about a need to enable said at least one not enabled subscriber entity to actively communicate in said communication network, and, upon being informed, transferring (S3) information related to a subscriber entity not enabled, from said database (4) of said second type to a selected one (5b) of said at least one database entity of said first type (5a, 5b). Also, the present invention proposes an accordingly adapted database entity of the above mentioned second type and a register entity for interaction with said database entity of said second type.
Abstract:
A packet-based communication system and method of call control that allows variable numbers of calls of potentially multiple types (e.g., conventional and trunking calls) to proceed concurrently over shared links of an IP network (100) without exceeding available bandwidth. Call counts are determined for one or more paths (160, 162, 164) between endpoints, defining numbers of calls that are supportable by the one or more paths. The call counts may be established using a reservation-based method, whereby reservations of call units of bandwidth are requested (402) by a first host (e.g., zone controller (116)) on behalf of a second host (e.g., repeater (122)) and granted (408) or denied (416) by the network based on the availability of the requested bandwidth. Then, upon the zone controller receiving (502) a call request, the zone controller grants (506), busies or denies (510) the request based on the path(s) needed for the call, the number of reserved call units associated with the path(s) and the amount of call units required to support the call.
Abstract:
A system and method for synchronizing internal clocks of receiving stations of a locating system are described. A beacon transmits reference data packets at a known position. A first arrival time is compared to a second arrival time to determine a correlated arrival time data. The first arrival time is a time of reception of the reference data packets by a first receiving station, and the second arrival time is a time of reception of the reference data packets by a second receiving station. A linear polynomial fit is computed as a function of the correlated arrival time data and the first and second arrival times. Times of arrival of data packets at the first and second receiving stations is synchronized as a function of the linear polynomial fit.
Abstract:
The invention relates to a method for implementing multipoint codes in an exchange with which it is possible to e.g. carry out a network consolidation and connect additional network providers in an existing network. A network identifier of a message transfer part area (25) which is not in use is adapted to a network identifier of a message transfer part area (24) which is in use, a new point code is allocated to the message transfer part area (25) which is not in use, and a loop (23) is connected between the used and unused message transfer part area.
Abstract:
Method, apparatus, and systems for implementing flexible credit exchange within high performance fabrics. Available buffer space in a receive buffer on a receive-side of a link is managed and tracked at the transmit-side of the link using credits. Peer link interfaces coupled via a link are provided with receive buffer configuration information that specifies how the receive buffer space in each peer is partitioned and space allocated for each buffer, including a plurality of virtual lane (VL) buffers. Credits are used for tracking buffer space consumption and in credits are returned from the receive-side indicating freed buffer space. The peer link interfaces exchange credit organization information to inform the other peer of how much space each credit represents. In connection with data transfer over the link, the transmit-side de-allocates credits based on an amount of buffer space to be consumed in applicable buffers in the receive buffer. Upon space being freed in the receive buffer, the receive-side returns credit ACKnowledgements (ACKs) identifying a VL for which space has been freed.