Abstract: The present invention relates to a method and network node for distributing a network parameter information among network nodes of a transmission network. A spanning tree of routing paths corresponding to the shortest paths from said network node to other nodes is determined based on a topology information of the transmission network, and is used to distribute the network parameter information from the network node to the other network nodes. Thereby, the updating message or packet traffic can be reduced dramatically as compared to the conventional flooding scheme.

Abstract: A simple admission control mechanism for IP based networks is provided. The decision on whether a new flow is accepted is based on the link load information on the paths from the source to destination. The new flow is accepted when the link load is less than a threshold. When at least one of the links on all of the available paths is larger than the acceptable threshold, access is denied to the flow. More than one threshold level may be used. Under the multiple threshold scenario, the traffic may be divided into different classes. The admission control mechanism helps to ensure a network that is not heavily congested.

Abstract: Apparatus, methods and computer program products provide improved silence suppression detection that may be utilized, for example, in conjunction with an extended real-time polling service (ertPS) in a worldwide interoperability for microwave access (WiMAX, IEEE 802.16 standard) system. In one non-limiting, exemplary embodiment, a method includes: in response to receiving an uplink frame, setting or resetting a connection-specific timer; and in response to the connection-specific timer expiring, detecting a silence suppression interval and allocating a minimum amount of periodic resources for the associated connection.

Abstract: The exemplary embodiments of this invention provide a method that includes time stamping packets when the packets enter a queue; when a packet is taken from the queue updating an average queuing delay estimate; and comparing a resulting average queuing delay estimate to an admission threshold for making an admission decision. The exemplary embodiments of this invention also provide a method that includes, in response to at least one slot being granted to a certain connection, updating an average throughput of the connection; dividing the averaged connection throughput by a minimum bandwidth requirement of the connection; calculating an average throughput over all (N) normalized throughputs; and comparing the result to a throughput threshold. Corresponding apparatus and computer program(s) stored in a computer readable medium are also disclosed.

Abstract: A scheduling system for IP routers is provided. A programmable scheduler for IP routers can support single stage and multistage scheduling. This allows flexible combinations of scheduling and widens dramatically the available QoS solutions to operators. With this kind of scheduling the router can be configured to support almost any known scheduling method or combination. Priority Queuing (PQ) and Deficit Round Robin (DRR) scheduling is scheduling is used according to one embodiment of the invention.

Abstract: The present invention relates to a method and network node for distributing a network parameter information among network nodes of a transmission network. A spanning tree of routing paths corresponding to the shortest paths from said network node to other nodes is determined based on a topology information of the transmission network, and is used to distribute the network parameter information from the network node to the other network nodes. Thereby, the updating message or packet traffic can be reduced dramatically as compared to the conventional flooding scheme.

Abstract: The present invention relates to a method and network device for selecting a combining point at which at least two redundant transmission paths are combined to a single transmission path in a transmission network comprising at least two selectable combining points (B-J). The combining point is selected by a method using at least two measurement-based selection criteria to which different priorities are allocated. The selection result of a selection criterion with a higher priority is used as a constraint for a selection based on a selection criterion with a lower priority. The selection criteria are applied to lengths or loads of the redundant transmission paths or the single transmission path. Thereby, an optimized combining point can be obtained to thereby lower delays for combined traffic and increase efficiency of network utilization.

Abstract: A method of for controlling the admission of a connection comprising; a) providing a plurality of classes; b) reserving for at least one class a portion of a bandwidth; c) determining usage related information by at least one of the classes to which a respective portion of said bandwidth has been reserved; and d) controlling admission of at least one class, different to the at least one class for which usage has been determined, said admission taking into account said determined usage related information.

Abstract: The present invention relates to a method for scheduling data packets in a network element of a packet data network, such as an IP network, wherein queue weights and sizes are adjusted at the same time so that the maximum queuing delay is as predictable as possible. Respective sizes of at least two data packet queues are adjusted at a predetermined or triggered timing based on at least one predetermined parameter indicating a change in the traffic mix routed through the network element or within a set of network elements. Thereby, more predictable maximum delays can be achieved.

Abstract: A scheduling system for IP routers is provided. A programmable scheduler for IP routers can support single stage and multistage scheduling. This allows flexible combinations of scheduling and widens dramatically the available QoS solutions to operators. With this kind of scheduling the router can be configured to support almost any known scheduling method or combination. Priority Queuing (PQ) and Deficit Round Robin (DRR) scheduling is scheduling is used according to one embodiment of the invention.

Abstract: A simple admission control mechanism for IP based networks is provided. The decision on whether a new flow is accepted is based on the link load information on the paths from the source to destination. The new flow is accepted when the link load is less than a threshold. When at least one of the links on all of the available paths is larger than the acceptable threshold, access is denied to the flow. More than one threshold level may be used. Under the multiple threshold scenario, the traffic may be divided into different classes. The admission control mechanism helps to ensure a network that is not heavily congested.