Abstract: A method for traffic engineering of connectionless virtual private network (VPN) services. The method comprises receiving physical connectivity data for a connectionless VPN including service nodes and links between the service nodes. One or more of the service nodes are also edge nodes. Logical connectivity data for the edge nodes is received. A restricted topology is created in response to the physical connectivity data and to the logical connectivity data. The restricted topology includes a single path between each pair of the edge nodes and each path includes a plurality of the service nodes and one or more of the links. A bandwidth requirement for each link in the restricted topology is calculated. The bandwidth requirement is reserved on each link in the restricted topology. The method further comprises directing routing software to force a packet received from an edge node through one of the paths in the restricted topology.

Abstract: A method and system for managing attacks in a computer system is disclosed. The computer system is used in sending, receiving, or sending and receiving a plurality of packets, which include a plurality of administrative packets. The method and system include determining whether a congestion of the administrative packets exists. Congestion of the administrative packets indicates that a potential attack exists. The method and system also include discarding a portion of the plurality of administrative packets if it is declared that the congestion of the administrative packets exists. The portion of the plurality of packets is sufficient to ensure that a remaining portion of the plurality of packets transmitted is not more than a maximum administrative packet bandwidth limit and, if the plurality of administrative packets present a sufficient offered load, not less than a minimum administrative packet bandwidth guarantee.

Abstract: A method of allocating transmission resources to respective terminals in a centrally controlled communication system in which the transmission resource allocation to the terminal is performed by a central unit includes allocating the transmission resources for at least one frame-oriented connection of a deterministic kind, particularly such that operates with a substantially constant data rate, independently of any previously issued resource requests for non-deterministic connections; providing a special designation for such a deterministic connection to distinguish the same from other connections; and correcting non-synchronous timing between the central unit and the affected terminals particularly for such a deterministic connection.

Abstract: A communication technique enables the efficient transmission of data through a low bandwidth and/or time delayed communication link and minimizes the idle time of the communication link by using a deferred acknowledgment of message bundles to temporally pack the communication link. The transmitting system stores messages to be transmitted in a pending message queue and applies a dynamic window to the pending message queue to define a message bundle to be sent through the slow communication link. The transmitting system requests an acknowledgment for at least one message within the bundle, but does not require an acknowledgment for every message within the bundle. Transmitted messages are temporarily stored as outstanding messages in a retransmission queue until the transmitted messages are acknowledged or until a time-out period associated with the messages has lapsed.

Abstract: In one embodiment, the technique dynamically adjusts resource allocations for each traffic class based on actual traffic load measured for each service class. In this way, the per-hop-behavior required by a differentiated service model may be achieved. Core nodes of a network operating according to a differentiated service model dynamically adjust resource allocations for multiple traffic classes without requiring explicit signaling from other network nodes. Policies for sharing resources among multiple service classes can be enforced.

Abstract: Available bandwidth utilization during transfer of large files over a TCP/IP network, is improved by segmenting the file and concurrently transmitting portions in an optimal number of logical distinct data streams which may all utilize a single physical medium and communications path. An initial number of data streams, is used to begin transmission of segments, each on a different data stream. During the first seconds of the transfer, individual and aggregate transmission bandwidths are determined, together with a backbone limit computed from the sliding window and round trip times. If the individual transmission bandwidths are approximately equal to the backbone limit, additional data stream(s) and segment(s) are started. Individual and aggregate transmission bandwidths are again determined, and the process is repeated until no substantial increase in aggregate bandwidth is achieved by adding an additional data stream.

Abstract: A central office receives on-demand requests from customer premises for selected videos. For each request, a network manager determines a maximum aggregate bit rate of in-progress communications in a network between at least one video server and the central office. The maximum aggregate bit rate is based on associated upper bounds of bit rates for in-progress video downloads. The network manager determines if the network is capable of congestion-free communication of the selected video from the at least one video server to the central office concurrently with the in-progress communications based on a capacity of the network, the maximum aggregate bit rate, and an associated upper bound of bit rate for the selected video.

Abstract: The method establishes a number of permanent virtual circuits to be configured on a multiservice access device. At least one of the permanent virtual circuits is configured as an oversubscription (OS PVC). The OS PVC may be configured as a normal PVC with additional parameters. The additional parameters, such as a timer, allow the PVC to assume either an active state or an oversubscription state. It is put into the oversubscription state if the timer expires and there is no traffic during the timer interval. Once in the oversubscription state, the PVC can be activated upon the presence of traffic. The OS PVC may be configured by placing it into a service queue when it has cells to send. The service queue is processed in sequential order until it is empty.

Abstract: A method and device for controlling the flow of a data amount from a sender to a receiver in a packet exchange connection. The packet exchange connection includes a plurality of links connected by routers. The sender determines from the data amount a data sequence to be sent. One or more bandwidth values respectively associated with one or more of the links is automatically determined. One or more bandwidth values is employed in the process of controlling the flow of the sequence from the sender to the receiver. This flow control directly takes properties of the connection into account.

Abstract: A method is provided of allocating bandwidth in a wireless LAN having a plurality of access points, each using the same wireless technology for data communication with users. The method comprises continuously monitoring bandwidth usage by each of the access points, and re-allocating bandwidth from a low bandwidth usage access point to a high bandwidth usage access point.

Abstract: A method is provided for fairly allocating bandwidth to a plurality of devices connected to a communication link implemented as a plurality of point-to-point links. The point-to-point links interconnect the devices in a daisy chain fashion. Each device is configured to transmit locally generated packets and to forward packets received from downstream devices onto one of the point-to-point links. The rate at which each device transmits local packets relative to forwarding received packets is referred to as the device's insertion rate. A fair bandwidth allocation algorithm is implemented in each (upstream) device to determine the highest packet issue rate of the devices which are downstream of that (upstream) device. The packet issue rate of a downstream device is the number of local packets associated with the downstream device that are received at the upstream device relative to the total number of packets received at the upstream device.

Abstract: Method for forming the virtual topology (21-45) of an ATM-layer where the ATM-layer is carried over an optical network (1) where inputs such as the physical topology (2-8, 11-16) and constraints of physical nature are given, thereafter forming node-pairs with end-to-end connections according to some known optimal routing algorithm, and finally applying a non-deterministic mathematical approach to obtain an optimal virtual topology with the objective of minimising the need for necessary electrical processing (50, 60, 70, 80) in the nodes (11-16) of the network (1).

Abstract: A novel method of servicing multiple data queues having different priorities is provided in a network switch. A dequeuing logic circuit services the data queues in a round-robin fashion. Programmable number of data packets is selected from each data queue in each cycle. The dequeuing logic circuit compares the number of data packets selected from a current data queue in a current cycle with the preprogrammed number of data packets set for the current queue, and selects a data packet from the current data queue only if the number of packets selected from the current data queue in the current cycle is less than the preprogrammed number. Selection of a data packet from the current data queue is bypassed, processing a next data queue, if the number of packets selected from the current data queue in the current cycle is not less than the preprogrammed number.

Abstract: A system and method for a cell based wrapped wave front arbiter (WWFA) with bandwidth reservation are disclosed. The method for reserving bandwidth of a given priority using the WWFA for arbitrating bandwidth among virtual links between input and output ports, each virtual link supporting one or more priorities and corresponding to an arbitration unit (AU) of the WWFA generally comprises performing at least one arbitration pass of a wave front of the WWFA where AUs having a reserved bandwidth request of a given priority and reserved bandwidth credit of the given priority compete for the bandwidth associated with the wave front, and where AUs not having a reserved bandwidth request of the given priority and reserved bandwidth credit of the given priority do not compete for the bandwidth, and performing at least one subsequent arbitration pass where AUs having a reserved bandwidth request of the given priority compete for the bandwidth.

Abstract: An apparatus and method for dynamic assignment of classes of traffic to a priority queue. Bandwidth consumption by one or more types of packet traffic received in the packet forwarding device is monitored to determine whether the bandwidth consumption exceeds a threshold. If the bandwidth consumption exceeds the threshold, assignment of at least one type of packet traffic of the one or more types of packet traffic is changed from a queue having a first priority to a queue having a second priority.

Abstract: A so-called digital “wrapper” is employed in conjunction with an optical channel client signal payload envelope to carry optical channel associated optical channel overhead. That is, the digital wrapper transports optical channel associated optical channel overhead and other monitoring information. This is realized by adding additional capacity, i.e., bandwidth, to the client signal payload envelope. The additional capacity is added “around” the payload envelope and the client signal floats in the payload envelope. This is effected in such a manner that the digital wrapper is independent of the type of client signal that is being transported on the optical channel. Indeed, as such the optical payload envelope is essentially a client optical signal independent, constant bit-rate channel. Moreover, in addition to the digital wrapper providing capacity for the optical channel overhead, it can also be employed to provide a forward error correction capability.

Abstract: A reference load model generator for testing ATM communication devices. The generator comprises an interface for specifying a frame size (FS), an inter-frame gap (IFG) and an inter-cell gap (ICG) for modelling frame sources, and generates source ATM cell streams having the specified FS, IFG and ICG of the corresponding frame source. The generator also includes a multiplexer which receives the source cell streams and generates a single output cell stream.

Abstract: In accordance with one embodiment of the present invention, a map of transmission slots for a port of a network element includes a plurality of hierarchical sets of port transmission slots. The hierarchical sets include a plurality of parent sets. Each parent set has its port transmission slots divided between a plurality of child sets. The child sets include interleaved port transmission slots.

Abstract: Capacity design of an optical network for demands of connections forms a linear programming sizing problem for a optimal routing. A dual of the linear programming sizing problem is formed and solved with an approximation algorithm. Edge lengths are initialized based on i) the inverse of the edge's capacity and ii) a scalar constant. Then, the approximation algorithm proceeds in phases to route each commodity over the edges of a graph. During each phase, the demand's flow is sent from the source to destination via multiple iterations. During each iteration, the shortest length-bounded path from the source to the destination is determined, a portion of the flow is sent, and the lengths of the edges that carry the flow are updated. The value employed to scale the network is generated after the last phase from the maximum ratio of edge flow to edge capacity.

Abstract: A packet-based traffic forwarding system with a plurality of contending queues. Each queue has an allocated bandwidth and an associated borrow vector. When a first queue does not consume all of its allocated bandwidth, the borrow vector associated with a second queue is checked to determine whether the second queue is permitted to use the unconsumed allocated bandwidth of the first queue. If the second queue has packets to forward, the second queue forwards the packets using the unconsumed allocated bandwidth of the first queue.

Abstract: A bandwidth control system in a communication device includes a transmission bandwidth controller for making a decision as to whether it is possible to allocate a requested transmission bandwidth for requested data transmission through the link by referring to a bandwidth management table. Based on a result of the decision of transmission bandwidth allocation, a signaling controller controls the processing of a UNI (User-Network Interface) signaling procedure.

Abstract: A packet-switched communication network in accordance with the invention provides a guaranteed minimum bandwidth between pairs of Packet Switches by defining Service Level Agreements (SLAs). An SLA is defined by at least a source identifier, a destination identifier, and a minimum data rate although other information can also be used. Upon arrival at certain networked nodes, packets are classified according to an SLA by reading the source and destination addresses in the packet. Once classified, the packets are placed in a queue and scheduled for transmission. A scheduler ensures that packets are transmitted at the minimum defined data rate for the SLA. The scheduler may use a statistical multiplexing method, such as deficit round robin, or deficit golden ratio, which is part of the present invention. The deficit golden ratio method assures a minimum rate to packets for a particular SLA, but minimizes jitter and delay.

Abstract: A switch for switching traffic from N sources to M destinations, where M and N are each an integer greater than or equal to 2. The switch includes K segments, where K is greater than or equal to 2 and is an integer. Each segment receiving traffic from R of the N sources, where 1≦R<N and is an integer, and all K segments in total receiving traffic from the N sources. Each segment collecting and queuing traffic from the respective R sources. The switch includes an arbitrator which receives information from the destinations regarding if they can receive data or not, and from the K segments about the traffic they have for different destinations. A method for switching traffic from N sources to M destinations, where M and N are each an integer greater than or equal to 2. The method includes the steps of receiving traffic from the N sources at input ports of K segments, where K is greater than or equal to 2 and is an integer.

Abstract: A method and system within a telecommunications network for allocating available bandwidth among a plurality of sessions that share a common data link. First, a repeating unit time interval is designated for conducting the plurality of sessions. Next, the input flow rate from the source node of each of the sessions into the common data link is monitored. Thereafter, a target flow rate is computed and assigned to each of the sessions. The sum of the target flow rates is equal to the available bandwidth of the common data link. Finally, for each of the sessions in which the monitored input flow rate exceeds the assigned target flow rate, the source node is dynamically paused during each repeating unit time interval, such that the monitored input flow rate conforms to the assigned target flow rate for each of the sessions.

Abstract: In a LAN relaying/switching apparatus which can guarantee data to be transmitted, a predetermined amount of transmission line bandwidth is set to a bandwidth control queue unit for a the data flows with a top priority, a remaining transmission line bandwidth is secured for a priority control queue unit according to the order of priority of the remaining data flows. A controller performs a read processing of the priority control queue unit at a timing different from a timing of reading the bandwidth control queue unit.

Abstract: A system for allocating bandwidth in a network element. The system determines whether a bandwidth allocation request is associated with a delay sensitive connection type. If so, the system selects a bandwidth allocation algorithm from a first set of bandwidth allocation algorithms. Otherwise, the system selects a bandwidth allocation algorithm from a second set of bandwidth allocation algorithms. The size of the bandwidth allocation request may be examined when selecting which bandwidth allocation algorithm to use. The system may round up the size of the bandwidth allocation request to a predetermined value. The selected bandwidth allocation algorithm may reserve slots in a bandwidth allocation table. Reserved slots that are equally spaced in the bandwidth allocation table avoid undue delays in servicing an associated connection. A binary tree representation of the table is described, wherein leaves of the binary tree correspond to individual table slots.

Abstract: A scheduler apparatus provides bandwidth guarantees to individual data packet flows as well as to aggregations of those flows (referred to as “bundles”) in a completely transparent manner, i.e., without using any additional scheduling structure. For each bundle, the scheduler determines the ratio between the bandwidth nominally allocated to the bundle and the sum of the individual bandwidth allocations of the flows that are currently backlogged in the bundle. The scheduler uses that ratio to modulate the timestamp increments that regulate the distribution of bandwidth to the individual flows. In this manner, the greater the ratio for that bundle, the more the bandwidth that each backlogged flow in the bundle receives.

Abstract: A novel protocol for scheduling of packets in high-speed cell based switches is provided. The switch is assumed to use a logical cross-bar fabric with input buffers. The scheduler may be used in optical as well as electronic switches with terabit capacity. The proposed round-robin greedy scheduling (RRGS) achieves optimal scheduling at terabit throughput, using a pipeline technique. The pipeline approach avoids the need for internal speedup of the switching fabric to achieve high utilization.

Abstract: A method of detecting a signaling congestion situation in a transmitter within a communications switch and for handling and recovering from the congestion. The method functions to (1) monitor the level of the transmit queue for each output port and (2) to monitor the level of the signaling message buffer memory pool for all ports. When the levels of either pass predetermined thresholds, the signaling congestion state is declared. Once the signaling congestion state is declared, the call control or equivalent entity in the communications device stops routing new calls from/towards all ports that are in the signaling congestion state. The call control continues to handle existing calls from/towards ports that are in the signaling congestion state.

Abstract: A method and apparatus are provided for providing multiple qualities of service to different virtual network connections. In one example, the method receives a token of a cell descriptor of data traffic of a virtual network connection. It is determined whether the token is in conformance with contracted bandwidth parameters of the cell descriptor to obtain a conformance status. Based on the conformance status, one of the following steps is performed: the token is inserted into a first random access memory configured to store the token for immediate output, or the token is inserted into a second random access memory configured to store the token for non-immediate output.

Abstract: The idea of the invention is to negotiate the resource allocation between two network elements on the Application or Transport layer level so that the negotiation is possible over the network, even if the network comprises several physically different networks. To determine the transmission capacity for the allocation, the sending element must first send a request message with a proposal for the capacity and media types. The receiving element either accepts the proposal or makes a new proposal by changing the parameter values so that they are acceptable from the point of view of the receiver, and sends a response to the sending element. Based on the response from the receiving element, the sending element the either accepts or rejects the allocation and informs the receiving element of its decision by sending a confirmation.

Abstract: An adaptive weighted round robin scheduling apparatus and method schedules variable-length frame transmissions from a plurality of output queues having different transmission priorities by first allocating, for each queue, a number of bandwidth segments for a bandwidth cycle and a number of transmission opportunities for a round robin cycle, and then processing the queues consecutively in a round-robin fashion, beginning with a highest priority queue, until none of the queues has any bandwidth remaining. More specifically, during each iteration of a round robin cycle, a queue is permitted to transmit a frame if the queue has at least one remaining transmission opportunity, the queue has a frame ready for transmission, and the queue has at least one remaining bandwidth segment, and furthermore the number of transmission opportunities for the queue is decremented by at least one.

Abstract: A system for receiving network video includes a remote control with a power control input. A video receiver, controlled by the remote control, powers up or powers down based on a control signal indicating activation of the power control input. The video receiver receives video signals from a gateway or gateway source connected to the video network. The gateway decodes signals received from the network into a format acceptable by the receiver. If the gateway receives a control signal from the remote control indicating activation of the power control input and the gateway is currently in the “on” state, the gateway toggles to the “off” state and outputs a predefined channel to the receiver.

Abstract: A method of transmitting interleaved real-time and non-real-time data on a packet based network so as to provide voice Quality of Service comparable to the Time Division Multiplexing realm of traditional telephony. The method reduces packet jitter and delay by employing separate queues for the different types of data as well as through the use of jitter buffers. The interleaving method consists of a number of discrete concepts and mechanisms that when used together in the manner disclosed herein provides consistent high-quality transmission of real-time data over packet/frame/cell-based networks. The elements required for this method include time-slot co-ordination, a dynamic MTU algorithm, and a Multiple queue egress traffic management system.

Abstract: A system and method for load balancing between redundant elements in a system is provided. By using redundant elements overall performance of the system is improved without losing the capability to recover or continue operation upon failure of an element within the system. The solution is of particular use in network systems, networked storage systems as well as location independent file systems.

Abstract: A network switch configured for switching data frames across multiple ports utilizes an efficient arbiter to store the data frames. Each port possesses queuing logic for requesting a free pointer from a free buffer queue. A multi-level arbitration logic arbitrates all the requests of equal priority from the network switch ports in a round robin scheme. The arbitration logic comprises a plurality of cells that cascaded to output an acknowledgement signal in response to an inhibit signal and a request signal as well as a counter that is incremented upon an asserted acknowledgement signal.

Abstract: In an asynchronous transfer mode (ATM) network, ATM cells received are classified to the queues appropriate to the service classes required by the ATM cells. The status registers manage the controlled delay of the ATM cells for the service classes and the queue length of the ATM cells which queue up in the queues. On the basis of the controlled delay and the queue length, the scheduler adaptively determines a weight, on the basis of which the ATM cells queuing up in the queues are to be forwarded to thereby effectively control the delay of ATM cells to be forwarded.

Abstract: An optical access network and method for transmitting optical data in the network utilizes an interleaved polling scheme to efficiently use the available bandwidth of the network. The use of the interleaved polling scheme allows a central terminal of the network to dynamically allocate upstream bandwidth from remote terminals of the network to the central terminal in response to the amount of data that is waiting at the remote terminals to be transmitted to the OLT. In one embodiment, the optical access network is based on Passive Optical Network (PON) technology. In another embodiment, the optical access network utilizes Ethernet protocol to encapsulate data in Ethernet frames for transmission. Thus, in these embodiments, the optical access network includes all of the advantages associated with the PON technology and/or the Ethernet protocol. In addition, since the allocation of upstream bandwidth is on an as needed basis, loss of bandwidth due to unfilled time slots is substantially eliminated.

Abstract: The object of the invention is to create a router which facilitates a simplified load balancing. The router according to the invention contains at least one buffer memory for the intermediate storage of pointers for information packets in at least two different buffer memory areas, a readout unit for reading out the different buffer memory areas one after the other in predetermined time windows, as well as at least one RED processing unit, and is characterised in that a feedback is provided from the readout unit to at least one RED processing unit, in order to control the activation and de-activation of the RED processing unit. According to the invention, indirect information about the occupancy levels of the buffer memory areas is passed via the feedback loop to the at least one RED processing unit. Advantageously, the readout unit operates with the weighted round robin mechanism and transmits information about buffer memory locations processed in the time slots to the at least one RED processing unit.

Abstract: A packet network employs flow control providing assigned rates to sessions in accordance with a general max-min (GMM) rate allocation. The GMM rate allocation accounts for the minimum cell rate and peak cell rate requirements for each session. For one case, a centralized flow control algorithm is employed that sorts sessions based on increasing minimum cell rate. The centralized flow control algorithm employs an iterative process of increasing the rate of the smallest rate session and adding sessions to the process when the smallest rate session equals the next higher rate session. The rates are increased until the rate either reaches the peak cell rate of the session or the link saturates. For a second case, a distributed flow control algorithm is employed with a distributed protocol within the network to allocate capacity of network links to sessions. For the distributed flow control algorithm, an iterative process of rate allocation uses a modified version of the Consistent Marking method.

Abstract: A method for dynamically adjusting the flow rate of a plurality of logical pipes that share a common output queue. In accordance with the method of the present invention, a minimum flow rate and a maximum flow rate are set for each of the pipes. Next a determination is made of whether or not excess queue bandwidth exists in accordance with the output flow rate of the shared queue. The determination of whether or not excess bandwidth exists comprises comparing the output flow rate of the shared queue with a pre-determined threshold queue output value. An instantaneous excess bandwidth signal has a value of 1 if there is excess bandwidth and is otherwise 0 if there is no excess bandwidth. In an alternate embodiment, the instantaneous excess bandwidth signal for a particular pipe is logically ANDed with one or more additional excess bandwidth signals to form a composite instantaneous excess bandwidth signal.

Abstract: Packets of data from multiple queues are transferred onto a single channel. Each queue has associated with it a data rate for servicing a packet within the queue. Each queue has an integer that, relative to the other numbers, represents is inversely related to the assigned data rate. Each queue has associated with it a counter and that is loaded with its corresponding integer. The counter values are compared, and the queue corresponding to the lowest counter value has a packet coupled to the channel. The counter of the selected queue is incremented by its integer. The next queue that is selected is the one that corresponds to the counter with the lowest count value after the counter that corresponds to the previously selected queue has been updated.

Abstract: A method of controlling congestion in data networks wherein data is received by an egress port and buffered in a local buffer associated with a source of the element. For each data element received, the egress port determines whether a global threshold is exceeded and, if so, requests all data sources to reduce their rate of data delivery to the egress port. Similarly, the egress port determines whether a local threshold is exceeded and, if so, requests the one source associated with the local buffer to reduce the data delivery rate to the egress port. Optionally, if the data delivery rate of the one source falls below a predetermined minimum rate, the one source may refuse the request. In response, the egress port requests other data sources to reduce their rate of data delivery to the egress port.

Abstract: When a network element receives a request for an increase in bandwidth via a resource management (RM) cell, the network element determines the rate that it can support. If the rate that the network element can support is less than the requested rate, rather than simply rejecting the requested rate, the network element overwrites the rate encoded in the appropriate field in the arriving RM cell with a lower rate than requested. If the network element can support the requested rate, the rate encoded in the RM cell is left unchanged and the RM cell is transmitted to the network along the connection.

Abstract: An ATM switch having a plurality of input-ports and a plurality of output ports allowing a plurality of priority levels, which is highly modular allowing expansion of the number of cell buffers in a shared buffer pool, thus efficiently handling bursty traffic of one-to-one and one-to-many destination ports, using the bit slicing concept to reduce the operating speed of the switch, and decrease the cell buffer size requirement per slice along with reducing the number of shared queue memories per slice, aiding cost effective and efficient, very large scale integration (VLSI) implementation. It also allows configurability of input link speeds, taking care of the order of cell delivery to the output ports. The switch on receiving the input cell, searches for a free buffer in the shared pool, then routes the cell into this buffer and indexes the pointer into an output queue called the queue management module which uses a shared pool of queue memories.

Abstract: An AAL2 path group (60) comprises plural AAL2 paths (35). Bandwidth of an individual AAL2 path comprising the AAL2 path group is contributed to a total bandwidth of the AAL2 path group rather than to the individual AAL2 path exclusively. An admission decision regarding a connection seeking to use an AAL2 path belonging to the AAL2 path group is based on available bandwidth of the AAL2 path group rather than available bandwidth of an individual AAL2 path. ATM VCCs which comprise the AAL2 path group are transported on a virtual path (VP) together with ATM VCCs of a different type (e.g., a second type which differs from a first type of ATM VCC which comprise the AAL2 path group). The AAL2 path group also features quality of service (QoS) separation, e.g., differing treatment for differing AAL2 connections within the AAL2 path group based on the QoS requirements for the differing AAL2 connections.

Abstract: A method and apparatus are provided for scheduling unicast and multicast data in an input-queued network device. According to one aspect of the present invention, a combined schedule is created by pipelined staging of multicast and unicast scheduling. Multicast cells are scheduled for transmission among multiple interfaces of a crossbar by performing a multicast cell scheduling cycle for multiple classes of service that are supported by the network device. Then, unicast cells are scheduled for transmission among the interfaces at a lower priority than the previously scheduled multicast cells by performing a unicast cell scheduling cycle for the multiple classes of service using only those interfaces that remain unmatched after completion of the multicast cell scheduling cycle.

Abstract: A load-distribution method that transmits packets received from a network to two or more transmission destinations to distribute a load, comprising storing a weight value of distribution and an accumulated value according to actual transmission for every transmission destination, and transmitting the received packets, upon occurrence of a distribution event, to a transmission destination that has a smallest accumulated value.

Abstract: An adaptive weighted round robin scheduling apparatus and method schedules variable-length frame transmissions from a plurality of output queue having different transmission priorities by first allocating, for each queue, a number of bandwidth segments for a bandwidth cycle and a number of transmission opportunities for a round robin cycle, and then processing the queues consecutively in a round-robin fashion, beginning with a highest priority queue, until none of the queues has any bandwidth remaining. More specifically, during each iteration of a round robin cycle, a queue is permitted to transmit a frame if the queue has at least one remaining transmission opportunity, the queue has a frame ready for transmission, and the queue has at least one remaining bandwidth segment, and furthermore the number of transmission opportunities for the queue is decremented by at least one.

Abstract: A packet communication system is constructed with a plurality of terminal side devices and a network side device including a dynamic identifier assigning portion 141 and a time slot allocation portion 1242. The dynamic identifier assigning portion 141 transmits an identifier information assigned to the respective terminal side devices in an initial setting state to the respective terminal side devices by means of a control signal. When an identifier assignment release request is received from an identifier control portion 100 of the terminal side device in a usual state, the dynamic identifier assigning portion changes the state of an identifier assigned to the terminal side device to the non-assigned state.