Abstract: An information processing apparatus communicates through a network. The apparatus includes an updating decision section, a notification information production section, an output controller, a receiver, and an operation controller. The updating decision section decides whether at least one of a plurality of connection priority degrees between a different information processing apparatus and opposite parties of communication including the information processing apparatus has been updated. The notification information production section produces notification information to be used for notification of the connection priority degree between the different information processing apparatus and the information processing apparatus. The output controller controls the output of the notification information produced by the notification information production section. The receiver receives data from the different information processing apparatus.

Abstract: A load balancing technique uniformly distributes data transmitted by a server over a plurality of underlying physical links of a virtual interface or aggregate within a computer network. According to the invention, the unit of data granularity is preferably a datagram, rather than an Internet protocol (IP) fragment or packet. The load balancing technique implements a round robin scheduling policy among the links based on an identifier (ID) associated with each datagram. As a result, the technique ensures that all fragments of a datagram are forwarded over the same physical link of the aggregate on the basis of a similar IP ID.

Abstract: A pipeline configuration is described for use in network traffic management for the hardware scheduling of events arranged in a hierarchical linkage. The configuration reduces costs by minimizing the use of external SRAM memory devices. This results in some external memory devices being shared by different types of control blocks, such as flow queue control blocks, frame control blocks and hierarchy control blocks. Both SRAM and DRAM memory devices are used, depending on the content of the control block (Read-Modify-Write or ‘read’ only) at enqueue and dequeue, or Read-Modify-Write solely at dequeue. The scheduler utilizes time-based calendars and weighted fair queueing calendars in the egress calendar design. Control blocks that are accessed infrequently are stored in DRAM memory while those accessed frequently are stored in SRAM.

Abstract: Systems and methods employing a flexible mesh structure for hierarchical scheduling are disclosed. The method generally includes reading a packet grouping configured in a two dimensional mesh structure of N columns, each containing M packets, selecting and promoting a column best packet from each column to a final row containing N packets, reading, selecting and promoting a final best packet from the final row to a next level in the hierarchy. Each time a final best packet is selected and promoted, the mesh structure can be refreshed by replacing the packet corresponding to the final best packet, and reading, selecting and promoting a column best packet from the column containing the replacement packet to the final row. As only the column containing the replacement packet and the final row are read and compared for each refresh, the mesh structure results in reduced read and compare cycles for schedule determination.

Abstract: Methods and apparatus for the provision of differentiated services in a packet-based network may be provided in a communications device such as a switch or router having input ports and output ports. Each output port is associated with a set of configurable queues that store incoming data packets from one or more input ports. A scheduling mechanism retrieves data packets from individual queues in accord with a specified configuration, providing both pure priority and proportionate de-queuing to achieve a guaranteed QoS over a connectionless network.

Abstract: A spectral reuse transceiver-based communication system conducts communications between a master site and a plurality of remote sites using a selected portion of a communication bandwidth containing a plurality of sub-bandwidth channels. Each remote site transceiver monitors the communication bandwidth for activity on the sub-bandwidth channels, and informs a master site transceiver which sub-bandwidth communication channels are absent communication activity and therefore constitute clear channels. The master site transceiver compiles an aggregate list of clear channels from all the remote sites and then broadcasts the aggregate list to the remote sites. The master site and a remote site then conduct communications therebetween by frequency-hopping and/or orthogonal frequency multiplexing among the clear channels using an a priori known PN sequence.

Abstract: A system and method to multicast guaranteed and best-effort traffic in a communications network are disclosed. According to one embodiment, incoming traffic is separated into unicast traffic and multicast traffic. Each root cell of the multicast traffic is classified based on multiple corresponding classes of service. Each root cell is then stored into a root cell buffer of multiple root cell buffers within an egress memory, each root cell buffer being associated with a corresponding class of service. According to one embodiment, each root cell is retrieved from the corresponding root cell buffer within the egress memory according to the associated class of service. Each root cell is then stored in a corresponding replication queue of multiple replication queues based on its associated class of service, with predetermined replication parameters assigned to each replication queue.

Abstract: A connection in an optical communication system is routed over a sequence of cross-connects and aggregated links comprising multiple links. A different link selection algorithm is used for service provisioning than is used for restoration, i.e., after a cable cut or other failure or incident has made one or paths in the network suddenly unavailable. In particular, a special link selection algorithm called the Interleave algorithm is used for restoration different from the well known Best-Fit algorithm used for provisioning. The Interleave algorithm substantially reduces the probability of glare while maintaining near-optimum capacity utilization.

Abstract: A method for determining and enforcing rate constraints on process flows in a network, the method comprising receiving at least one process flow. A flow rate vulnerability (FRV) factor and a required bandwidth (RBW) parameter are determined for the at least one process flow. A rate constraint is calculated for the at least one process flow and the rate constraint is enforced on the at least one process flow.

Abstract: Packet signal-to-noise ratio (SNR) values and historical delivery ratio information are combined to predict a delivery ratio for a communication link. Since packet SNR may be available with every received packet on the link, link SNR level is both accurate and easy to obtain. In one embodiment, a link quality classification algorithm uses delivery ratio and SNR history, based on local classification methods (such as k-Nearest-Neighbor, Kernel-based method) and global classification methods (e.g. Support vector machines) to classify links as either good or bad. In further embodiments, links may be classified at multiple different levels to indicate predicted link quality.

Abstract: The present invention is to disclose a scheduler which comprising a priority tagging module for receiving a plurality of information chucks, a plurality of output lines, and a WRR (weighted round robin) module. In this regards, each information chucks are tagged with a priority tag by said priority tagging module according to a priority classification scheme. In addition, the WRR module further comprises a bucket list, which has a plurality of buckets, and a control module. Each bucket stores a ticket, which comprises an identification representing one of the plurality of output lines and an associated weight value of the represented output line. Besides, the control module receives the tagged information chucks from the priority tagging module and schedules the tagged information chucks into the plurality of output lines according to a scheduling scheme based on said bucket list.

Abstract: An apparatus including a holding portion temporarily holding packets for each individual quality class; a counter counting the amount of data of packets output from the holding portion for each individual quality class; a comparison portion comparing count values of the counter for individual quality classes with threshold values which are threshold values for the quality classes, respectively, the ratio of the threshold values for the quality classes being coincident with the weighting ratio between the quality classes; an output portion outputting packets held in the holding portion based on results of comparisons made by the comparison portion; and a control portion which, according to the results of the comparisons, subtracts values corresponding to the threshold values for the quality classes from the count values of the counter for the individual quality classes.

Abstract: A method of setting up a new call in a signal processor includes selecting a signal processor that has sufficient bandwidth to open a new channel while assuming that the new channel and any open but unestablished channels on the signal processor require more than a minimum amount of bandwidth per channel. When selecting a signal processor to hold the new channel, the method can assume, for example, that each of the open but unestablished channels will require a maximum amount of bandwidth per channel. Once a signal processor is selected, the new channel is opened in the selected signal processor and an amount of bandwidth is preallocated to that channel. However, if it is later determined that the selected signal processor cannot accommodate bandwidth requirements of the new channel, an amount of preallocated bandwidth for a channel can be immediately released and made available for use by another channel.

Abstract: Provided are an apparatus and method for limiting bandwidths of burst aggregate flows according to the present invention. The apparatus comprises: a bandwidth measuring unit measuring a bandwidth of at least one input aggregate flow; a grade determining unit determining abnormal grades according to abnormal levels of the input aggregate flows; a bandwidth limit determining unit determining a bandwidth volume and aggregate flow to be limited; a bandwidth limiting unit inputting a result determined by the bandwidth limit determining unit, limiting or releasing a bandwidth of a aggregate flow selected among the input aggregate flows and outputting the selected aggregate flow; and a status information storage unit storing status information including a usage bandwidth, an abnormal grade, and a limited bandwidth volume of the input aggregate flow.

Abstract: The adaptive bandwidth throttling system implements a graceful diminution of services to the clients by delaying a first class of services provided by a network server in response to the effective bandwidth utilized by this network server exceeding a first threshold. If the demand for the bandwidth by this network server exceeds a second threshold, the bandwidth throttling system escalates the throttling response and blocks the first class of services from execution and can also concurrently delay execution of a second class of services. The implementation of the throttling process can be varied, to include additional levels of response or finer gradations of the response, to include subsets of a class of services. In addition, the threshold levels of bandwidth used to trigger the throttling response can be selected as desired by the system administrator.

Abstract: For transporting data packets of a data stream between a packet-oriented network (LAN) and a channel-oriented data stream processing module (VMOD), a data stream controller (ST) is provided which, via a data channel allocation module (VMUX), accesses an interface module (PS) for exchanging the data packets with the network (LAN) and/or accesses the data stream processing module (VMOD). The data stream controller (ST) transmits a data channel allocation information item (DKl1, DKl2) to the interface module (PS) and/or to the data stream processing module (VMOD). Using a data channel allocation information item (DKl1, DKl2) in each case transmitted, the data packets are transmitted directly between the interface module (PS) and the data stream processing module (VMOD), bypassing the data channel allocation module (VMUX).

Abstract: In some embodiments of the present invention, applications presenting user information streams at a service access point (SAP) to AAL-2 above the Common Part Sublayer (CPS) may provide values for predefined parameters that may determine how frames of information in the user information streams are segmented in run-time into CPS packets and packed into CPS protocol data units (CPS-PDU), each of which forms the payload of an ATM cell. These parameter values may be defined per channel identifier (CID) or for a group of CIDs.

Abstract: An apparatus and method for controlling the transmission of data packets from a base station in a wireless network to a plurality of mobile stations in a coverage area of the wireless network. The apparatus comprises a transmission scheduler for accessing a plurality of data packets received from a plurality of user devices requesting to transmit data packets to the mobile stations. The transmission scheduler receives a plurality of physical parameters associated with the data packets and calculates a plurality of scheduled priority values. Each of the scheduled priority values is associated with data packets from one of the requesting user devices. Each scheduled priority value is calculated by summing a plurality of products. Each product is determined by multiplying a variable derived from a physical parameter by a weighting factor.

Abstract: A method, system and transport unit to combine and transport multiple variable data rate LAN streams and fixed data rate voice streams through a plurality of transmission links used as a conduit for transmission of data between local area networks are disclosed. Combining both TDM and packetized network traffic into packets for transfer between LANs using a framed protocol for the transfer is further disclosed.

Abstract: The present invention provides a system for controlling isochronous data admission, within a WLAN system (102) that transports both isochronous and asynchronous data. The system includes an apparatus (300), functioning as an access point within a WLAN system. The apparatus comprises a memory (306) and a transceiver (312) communicatively coupled to the memory. The apparatus further comprises an access coordinator (302), communicatively coupled to the memory, and adapted to: evaluate actual access times of previous isochronous data streams, to determine projected access times needed by a new isochronous data stream, and to decide to admit or reject the new isochronous data stream based on an evaluation of the actual and projected access times.

Abstract: The adaptive bandwidth throttling system implements a graceful diminution of services to the clients by delaying a first class of services provided by a network server in response to the effective bandwidth utilized by this network server exceeding a first threshold. If the demand for the bandwidth by this network server exceeds a second threshold, the bandwidth throttling system escalates the throttling response and blocks the first class of services from execution and can also concurrently delay execution of a second class of services. The implementation of the throttling process can be varied, to include additional levels of response or finer gradations of the response, to include subsets of a class of services. In addition, the threshold levels of bandwidth used to trigger the throttling response can be selected as desired by the system administrator.

Abstract: The adaptive bandwidth throttling system implements a graceful diminution of services to the clients by delaying a first class of services provided by a network server in response to the effective bandwidth utilized by this network server exceeding a first threshold. If the demand for the bandwidth by this network server exceeds a second threshold, the bandwidth throttling system escalates the throttling response and blocks the first class of services from execution and can also concurrently delay execution of a second class of services. The implementation of the throttling process can be varied, to include additional levels of response or finer gradations of the response, to include subsets of a class of services. In addition, the threshold levels of bandwidth used to trigger the throttling response can be selected as desired by the system administrator.

Abstract: The adaptive bandwidth throttling system implements a graceful diminution of services to the clients by delaying a first class of services provided by a network server in response to the effective bandwidth utilized by this network server exceeding a first threshold. If the demand for the bandwidth by this network server exceeds a second threshold, the bandwidth throttling system escalates the throttling response and blocks the first class of services from execution and can also concurrently delay execution of a second class of services. The implementation of the throttling process can be varied, to include additional levels of response or finer gradations of the response, to include subsets of a class of services. In addition, the threshold levels of bandwidth used to trigger the throttling response can be selected as desired by the system administrator.

Abstract: The present invention relates to a scheduling unit adapted to aggregate data units from a plurality of input ports to a common output port according to a service sequence. The service sequence identifies which particular input port must be served for a particular service slot. A scheduling unit according to the present invention features optimized jitter and queue occupancy figures. This is achieved by allotting a number of service slots to each input port in proportion to its service share, next by determining for each input port a corresponding number of candidate positions uniformly spaced over the service sequence, finally by resolving any contention between the so-determined candidate positions. A service slot is assigned first and foremost to the input port which has the highest number of candidate positions considered while determining the service sequence yet not assigned to any service slot, next which gets the highest service share.

Abstract: In one embodiment, a bandwidth monitoring device comprises a packet receiving circuit configured to receive packets; a counter configured to count a total packet length by adding up inputted packet lengths including a packet length of a next input packet and subtracting outputted packet lengths to produce a counted value; a timer configured to time a packet receiving time; a memory configured to store a number of packet receiving times and a number of counted values counted by the counter which correspond to the packet receiving times, respectively; a counter rate-of-change calculating portion configured to calculate a change rate by a first counted value corresponding to an oldest packet receiving time stored in the memory representing an oldest time at which a packet was received and a second counted value corresponding to a latest packet receiving time stored in the memory representing a latest time at which a packet was received; and a determining portion configured to decide whether the next input packet

Abstract: Disclosed herein are systems and methods for communicating a number of data flows on a single communications channel. In one embodiment, a method of communicating a number of data flows on a shared communications channel includes the acts of (1) calculating a set of optimum goodput rates for the data flows, in order to maximize a total utility of the data flows, (2) calculating a set of optimum throughput rates for the data flows based on the optimum goodput rates, and (3) transmitting the data flows on the shared communications channel with the optimized throughput rates. Optimization is preferably done using utility functions that indicate the utility of the data flows as a function of their goodput rates. The method can additionally block temporarily a transport layer of at least one of the data flows if the transport layer of that data flow is bottlenecked.

Abstract: A method and apparatus are provided for implementing hierarchical scheduling of oversubscribed virtual paths with underutilized bandwidth that works for both ATM (cell) and IP (frame) scheduling. A scheduler includes a first calendar for pipes and autonomous flows and a second calendar for pipe flows. A winner of a pipe or an autonomous flow is identified from the first calendar. Responsive to an identified winner pipe, a pipe queue is checked for an associated pipe flow for the winner pipe. Responsive to identifying an empty pipe queue for the winner pipe, a pipe win credit is assigned to the pipe without reattaching the winner pipe to the first calendar. Then a next winner is identified from the first calendar. When a winner pipe flow is identified from the second calendar and the pipe win credit is assigned to the pipe for the winner pipe flow, then the winner pipe flow is serviced without delay.

Abstract: A method and system for use in data communications. The method and system substantially ensure that actual data transmission per unit time from at least one cross-point buffer switch ingress to at least one cross-point buffer switch egress substantially satisfies a designated target amount of actual data transmission per unit time.

Abstract: A wireless LAN comprises an access point with a data communicator for data communicated over different channels, each using a respective wireless technology, and at least one mobile communications device with a data communicator for data communicated over the channels and using the wireless technologies. A first of the channels uses a wireless technology operating at a first frequency bandwidth, and a second of the channels uses a different wireless technology operating at a second, non-overlapping frequency bandwidth. The wireless technology used for the downlink channel operates at a higher data rate than the wireless technology used for the uplink channel. The controller controls data communications over the downlink channel and the uplink channel to maximise the downlink data communication QoS.

Abstract: Achieved bandwidths for existing subscribers are collected and organized into a statistical bandwidth table utilizing characterizing information, such as the Central Office (CO) that provided the service, the type of xDSL service that was provided, the primary, secondary, and other cable segments over which service was provided, and the subscriber loop length increment. To estimate anticipated bandwidth for a new subscriber, the new subscriber's characterizing information is obtained and used to select one or more entries from the statistical bandwidth table of statistical actual bandwidths achieved by other users that most closely matches the new subscriber's characterizing information. The statistical bandwidth information for the other similarly situated subscribers is used as an estimate bandwidth information for the new subscriber.

Abstract: A cut-through system and method are provided for scheduling information in an information distribution device. The method receives a plurality of information streams. A master schedule is created to select messages from the information streams for transfer to a corresponding plurality of remote links. The messages (e.g., packets) may have either a fixed or variable length. The master schedule is responsible for managing a communication link overall maximum bandwidth, and a message bandwidth for each remote link. Concurrently, an underrun schedule is created to select segment rates for a first group of messages destined to corresponding first group of remote links, and manage the message segment rate for the first group of messages. For example, the first group of messages may be destined to remote links that are sensitive to underrun.

Abstract: A communication switch that includes a multiprocessor control block and a method therefore is presented. The multiprocessor control block includes a centralized resource and routing processor that controls resource allocation and routing functionality within the switch. A plurality of intermediate processors operably coupled to the resource and routing processor perform call processing for corresponding portions of the connections supported by the switch, where such call processing includes issuing resource allocation requests to the resource and routing processor. Each of the intermediate processors further performs functions associated with a signaling layer portion of the protocol stack. The multiprocessor control block also includes a link layer processor operably coupled to the plurality of intermediate processors, where the link layer processor also couples to a switching fabric of the communication switch.

Abstract: Provided are method and apparatus for dynamically allocating unlink bandwidth in Ethernet PON. In the method and apparatus, report value, which are received for each logical link identifications (LLID), is controlled to be less than a maximum gate value set for each LLID in sequence for all of LLIDs without a predetermined interval. A gate having a length corresponding to the restricted report value is generated. LLIDs are grouped into classes and processing is done class by class. For each class processing, if maximum processing time is reached or maximum total allocation is reached, the processing is switched to a lower class. Also each class processing, if any higher class has its maximum yield processing time or maximum yield allocated gate reached, the processing is switched to that higher class.

Abstract: Resources which are to be related to a first interface between a terminal and a first network node and to a second interface between the first network node and a second network node are jointly determined during the allocation of radio technical resources for data transmission for a subscriber. Throughput and transmission characteristics of the first interface requested by a subscriber are taken into account and coherence of the resources which are to be allocated to the first interface and the resources which are to be allocated to the second interface is taken into account. Allocations of other subscribers are considered and the value to all subscribers is optimized.

Abstract: A network device includes multiple packet processing engines implemented in parallel with one another. A spraying component distributes incoming packets to the packet processing engines using a spraying technique that load balances the packet processing engines. In particular, the spraying component distributes the incoming packets based on queue lengths associated with the packet processing engines and based on a random component. In one implementation, the random component is a random selection from all the candidate processing engines. In another implementation, the random component is a weighted random selection in which the weights are inversely proportional to the queue lengths.

Abstract: A system for scheduling access times for transmitting data traffic in a WLAN including both isochronous streams and asynchronous bursts characterized by widely varying parameter values generates a succession of service periods, each having adjustable length and including two or other number of primary access intervals. The service periods may also be adapted to include one or more asynchronous burst periods, each immediately following a primary access interval. Access times for each isochronous stream are scheduled only during a primary access interval, or an immediately following extension period. Asynchronous bursts are scheduled for access times only during asynchronous burst periods. Epoch lengths fluctuate dependent on the dynamic needs and priorities of user traffic. Thus, an access time scheduling is made available that can readily adapt WLAN access to continually changing data traffic conditions, and thereby provide QoS by scheduling access times accordingly.

Abstract: A method for distributing digital subscriber line (xDSL) data traffic includes receiving xDSL traffic at a DSLAM including a plurality of input ports and a plurality of output queues. Each input port includes a plurality of virtual circuits. Each of the plurality of virtual circuits are dynamically assigned to one of the plurality of output queues. The assignment of any particular virtual circuit to one of the plurality of output queues is independent of which of the plurality of input ports the particular virtual circuit is associated with. In accordance with the particular embodiment, the total number of virtual circuits is greater than a total number of output queues.

Abstract: Presuming a case of dividing a control plane of a base station controller (RNC) into an apparatus to control a cell resource and an apparatus to control each of mobile stations (MS), it is a problem to be solved to distribute a load on the mobile station controller by setting an additional mobile station controller due to an increase in subscribers. Cell control radio control servers (Cell control RCS) 7a, 7b are nodes to control common resources, e.g., radio common channel, cell spread code, electric power, etc., bound to a cell, mobile station control radio control servers (Serving RCS) 8a, 8b are nodes to control each of mobile stations (MS) 5, and movement control/location management of the mobile stations (MS) 5, radio individual channel control, etc. are performed.

Abstract: One embodiment relates to a communication system. The communication system includes a central node that is coupled to a communication channel and configured to individually communicate with a number of network nodes over a frequency range. One of the network nodes can identify a common frequency band that is within the frequency range and on which the central node and network nodes can transmit a signal. Other methods and systems are also disclosed.

Abstract: Bandwidth allocated between the traffic classes of a network path is dynamically reallocated when one or more traffic classes have insufficient available bandwidth to support a service request for the traffic classes, wherein the reallocation occurs without modifying the traffic class bandwidth allocations enforced by router mechanisms. A provisioning system maintains an available bandwidth indication for each traffic class, which indications are decremented as a service request is admitted to the path. If a requested traffic class has insufficient available bandwidth to support a request, one or more other traffic classes can loan bandwidth to the requested traffic class by decrementing the available bandwidth indicators for the one or more other traffic classes in the amount of the insufficiency, thereby indicating that less bandwidth is available in these classes for future requests.

Abstract: An apparatus for switching data between a first set of bitstreams and a second set of bitstreams, each of said bitstreams being divided into recurring frames and each of said recurring frames being divided into time slots, is disclosed. The switch comprises a first set of switching elements, at least one intermediate set of switching elements, and a last set of switching elements. Each switching element comprises a number of input ports and a number of output ports. The input ports of the first set of switching elements are arranged to receive the first set of bitstreams and the output ports of the last set of switching elements are arranged to provide said second set of bitstreams. Furthermore the switching elements are arranged so that there are more than one path from a switching element in the first stage to a switching element in the last stage.

Abstract: In a DBA (Dynamic Bandwidth Allocation) method for an E-PON including an OLT and ONUs, DBACNs (DBA Control Nodes) corresponding to processes in a tree algorithm are arranged in multi-level stages with the ONUs being in the lowermost stage. DBACNs or ONUs in a specific stage are connected to a DBACN from its immediately higher stage in a tree structure. A process of allowing a DBACN to collect bandwidth request information from DBACNs or ONUs in its immediately lower stage is performed sequentially from the lowermost DBACNs to the uppermost DBACN. The uppermost DBACN allocates the smaller one of a total available allocation-bandwidth and a total requested bandwidth to DBACNs in its immediately lower stage in their priority order. DBACNs, other than the uppermost DBACN, each allocate a bandwidth allocated down from a DBACN in the immediately higher stage to DBACNs or ONUs in the immediately lower stage in their priority order.

Abstract: A technique for providing access to a switch fabric is disclosed. In some embodiments, the method comprises determining scheduling information specific to a link to the switch fabric and using the scheduling information to determine a queue to be serviced by the link. In some embodiments, the system comprises a buffer configured to store a plurality of queues, and a queue scheduler associated with the buffer and configured to determine scheduling information specific to a link to the switch fabric and use the scheduling information to select one of the plurality of queues as the next queue to be serviced by the link.

Abstract: A method and apparatus are provided for performing a virtual network connection merge. In one example, the method assembles at least one data unit from data traffic of at least one network connection. A credit is calculated for each network connection. A chosen data unit to be transmitted to an output channel is determined based on the credits of the network connections. The chosen data unit is then transmitted to the output channel.

Abstract: A method and system for sharing over-allocated bandwidth between different classes of service in a wireless network. Traffic is transmitted for a first service class in excess of bandwidth allocated to the first service class using unused bandwidth allocated to a second class. After transmitting traffic for the first service class in excess of bandwidth allocated to the first service class using unused bandwidth allocated to a second class, traffic for a third service class is transmitted in unused bandwidth remaining in the second service class.

Abstract: A bifurcated selector for transmitting transactions from a plurality of transaction queues out a port of a switch. A transaction scheduler selects transactions of the queues for transmission to a device coupled to the port. A policy manager enforces a scheduling policy of the queues. An interface couples the policy manager to the transaction scheduler. The interface includes first signals for the transaction scheduler to receive from the policy manager a priority for each queue. The transaction scheduler selects the transactions for transmission to the device based on the priorities. The interface also includes second signals for the policy manager to receive from the transaction scheduler transaction transmission information for each queue. The policy manager updates the priorities based on the transaction transmission information. The transaction transmission information comprises an indication of which of the queues a transaction was selected from for transmission.

Abstract: Network channel access protocol is disclosed. More particularly, a distributed, locally determined, channel access protocol that adapts to load, avoids interference and controls access by a group of nodes to a set of shared channels is disclosed. Shared channel space is divided into a number of communication slots that are repeated at a predetermined interval. Permission to use a slot to communicate between any two nodes is dynamically adjusted by the channel access protocol, which locally: (i) estimates load to neighboring nodes; (ii) allocates or deallocates slot usage to adapt to load and avoid interference; and (iii) asserts and advertises slot usage within an interference area about itself.

Abstract: A system and method for measuring data transmission activity through a port of a switch device interconnecting nodes of a storage area network, the port transmitting data as words of predetermined length, one data word indicating idle port activity. The method includes steps of: counting a number of transmitted words received from the port in a first counter device; and, for each word counted, comparing that word with a predetermined word indicating no (idle) port transmission activity. In response to the comparing, a number of matches are counted in a second counter device. In this manner, a ratio of a number of counted matches with a total amount of words counted indicates available bandwidth for transmitting additional data over that link. Preferably, this value is communicated to a processor device for controlling bandwidth over the link.

Abstract: A subscriber unit (100) determines that there is information to transmit, and requests an amount of bandwidth. Upon receipt of the request for bandwidth from the subscriber unit, the fixed network equipment (FNE; 102) determines whether the requested bandwidth is available. If yes, the FNE dynamically determines at least a first timer value to be used by the subscriber unit to detect a loss of granted bandwidth, and transmits a reservation grant to the subscriber unit granting the request. The reservation grant comprises the at least first timer value. Upon receipt of the reservation grant, the subscriber unit extracts the at least first timer value from the reservation grant and uses the at least first timer value to detect loss of granted bandwidth.

Abstract: An ATM switch includes a first stage, a second stage and a third stage each of which stages includes at least one basic switch, wherein the first stage, the second stage and the third stage are connected. The basic switch includes a part which refers to time information written in a header of an input cell and switches cells to an output port in an ascending order of the time information. In addition, the ATM switch includes a cell distribution part in the basic switch of the first stage. The cell distribution part determines a routes of a cell to be transferred such that loads of routes within the ATM switch are balanced. The ATM switch further includes an adding part which adds arriving time information to an arriving cell as the time information.