Abstract: A method and device for changing between a long address and a short address in a packet is provided. According to one embodiment, a method of converting a long address to a short address by an processing element in a communication network, comprises receiving a packet having a first long address, retrieving a first short address associated with the first long address from a data repository, replacing the first long address in the standard packet with the first short address forming an improved packet with a control field and sending the improved packet toward a subsequent device.

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: An Electronic device including Asynchronous Transfer Mode (ATM) switching capabilities or including interior fixed length packet/cell processing for use in telecommunication networks. The electronic device includes a buffer of incoming cells of packets, the cells are assigned, each within Virtual Path Identifier (VPI) and Virtual Channel Identifier (VCI), such that all cells of the same packet bear the same VCI. Each VCI is associated with data that include data item serving for packet efficiency mechanism. The device further includes storage medium storing data representative of data structure for storing selected number from the specified data items. The device further includes processor associated with the storage medium that is configured to perform the processing procedures that include: for each incoming cell whose VCI is associated with data item that is stored in the data structure constructing a search key that enables to access said data item at substantially O(1).

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).