Abstract: A queue control system and method for scheduling fixed size traffic elements for transmission on a link from a number of queues. The system comprises a memory, queues and queue processor. The memory stores a linear array, where each array index corresponds to a transmission priority and is capable of referencing a list of queues. Each queue has an assigned weight and an associated calculation remainder variable stored in a memory. Queues referenced by a low value array index are selected for transmission before queues referenced by higher value array index. The queue processor is arranged so that to repetitively select a queue for transmission in dependence on the referenced position of the queue in the array, and to operate a predetermined function for moving the reference to a queue selected for transmission to a new array index.

Abstract: A system and method of scheduling traffic from a plurality of queues onto a link is disclosed. At least one of the queues has an agreed bandwidth requirement and at least one of the queues has no agreed bandwidth requirement. The method comprises the steps of assigning a weight to each queue having an agreed bandwidth requirement, the weight being determined in dependence on the bandwidth requirement, grouping the queues having no agreed bandwidth requirement into a group, Q*, and assigning a weight to the group, and scheduling the queues for transmission on the link in dependence on their assigned weight and on a last transmission time for the respective queue, wherein if a scheduled queue has no traffic to transmit another queue is scheduled, the group Q* being scheduled after the other queues.

Abstract: A traffic control method and system are disclosed for scheduling fixed size traffic elements from a number of queues for transmission on a link. Each queue has associated traffic parameters. The system comprises a scheduler and a calendar in a memory for storing a transmission schedule of the queues. The scheduler shapes the transmission schedule by updating the schedule in the calendar in dependence on inputted traffic parameters of each queue. The system also includes an amplifier to amplify the traffic parameters by a factor K prior to input to the scheduler, the scheduler and calendar being adapted to operate using the amplified parameters.

Abstract: A system for use in a transport network that connects to the Internet or to a similar IP network, by which the class of service and Quality of Service of the connection to the Internet over the transport network may be dynamically adjusted to meet changing requirements. In contrast to static systems which require manual reconfiguration to change the class of service, a system according to an embodiment of the present invention provides for on-demand changing of the class of service depending on the current needs. A set of tunnels from the transport network's first switch (the “aggregator” or the DSLAM) to the interface between the transport network and the IP network (the “edge router”) is pre-configured to provide the different levels of service that are supported. By selecting the appropriate tunnel through which the connection is made at the time the session is established, dynamic selection of Class of Service, and hence Quality of Service, is effected.

Abstract: A system and method of scheduling traffic from a plurality of queues onto a link is disclosed. At least one of the queues has an agreed bandwidth requirement and at least one of the queues has no agreed bandwidth requirement. The method comprises the steps of assigning a weight to each queue having an agreed bandwidth requirement, the weight being determined in dependence on the bandwidth requirement, grouping the queues having no agreed bandwidth requirement into a group, Q*, and assigning a weight to the group, and scheduling the queues for transmission on the link in dependence on their assigned weight and on a last transmission time for the respective queue, wherein if a scheduled queue has no traffic to transmit another queue is scheduled, the group Q* being scheduled after the other queues.

Abstract: A queue control method for scheduling fixed size traffic elements for transmission on a link from a number of queues is disclosed. Each queue has an assigned weight determined in dependence on predetermined characteristics of the queue and an associated calculation remainder variable. A linear array is maintained in a memory, each array index corresponding to a transmission priority and being capable of referencing a list of queues, queues referenced by a low value array index being selected for transmission before queues referenced by higher value array index.

Abstract: A traffic control method and system are disclosed for scheduling fixed size traffic elements from a number of queues for transmission on a link. Each queue has associated traffic parameters. The system comprises a scheduler and a calendar in a memory for storing a transmission schedule of the queues. The scheduler shapes the transmission schedule by updating the schedule in the calendar in dependence on inputted traffic parameters of each queue.

Abstract: A method, and apparatus, that enables high throughput of complete packets, transmitted under a packet switching protocol, such as the Internet Protocol (IP), over an ATM node. It is based on buffer threshold management, rather than on tracking individual Virtual Channels (VC). The method is particularly useful for cases in which data cells are routed according to their virtual path (VP).