Abstract: Methods and systems for configuration management of computer applications implemented in different configurations use configuration parameters having assigned scopes of applicability. A method includes storing configuration parameters for a computer application for the different configurations. The stored configuration parameters have assigned scopes of applicability. At least one of the assigned scopes of applicability is selected and used to select a set of configuration parameters from the stored configuration parameters for application to a corresponding running instance of the computer application.

Abstract: A system for indicating and determining a master unit from a plurality of logic units is described. The system includes a first logic unit configured to output a first obey signal and receive a first input signal, and a second logic unit configured to output a second obey signal and receive a second input signal. At least one of the first obey signal and the second obey signal is clocked, and a phase relationship of the second obey signal relative to the first obey signal is controllable by the first and second input signals. The system also includes a mastership determination logic unit configured to monitor the first and second obey signals. The mastership determination logic unit is configured to indicate that the first logic unit is the master unit when only the first obey signal is being clocked and to indicate that the second logic unit is the master unit when only the second obey signal is being clocked.

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 system and method for monitoring and maintaining a plurality of modules are described. Each module of the plurality of modules includes at least one link slave device, and a link controller is connected to link slave devices via a plurality of individual serial, bidirectional connections. The link slave devices and the link controller include protocol logic for communication according to a bidirectional protocol. At predefined time segments and predefined periodicity, the link slave devices drive the corresponding bidirectional link to the controller to provider maintenance information to the controller. At other predefined time segments, the controller drives the bidirectional link to issue commands to the link slave devices.

Abstract: An Asynchronous Transfer Mode switch and method which facilitate priority arbitration of point-to-point and point-to-multipoint transmission are disclosed. To execute point-to-multipoint operation a bandwidth arbiter maintains a first list of connections and bit vectors indicating designated destination ports. The list maintained by the bandwidth arbiter is then compared to an unassigned output port bit vector to determine matches therebetween at which point-to-multipoint transmission may be made by utilizing instantaneously unused bandwidth within the switch. To execute point-to-point operation each input port maintains a list of connections associated with each output port, and those lists are used in conjunction with output port request information per input port in the bandwidth arbiter to match requests to the unassigned output port bit vector. The bandwidth arbiter may also assign priority to connections in the list.

Abstract: Each switch along a call setup path in a network decides whether the call request should be upgraded from a non-flow-controlled service type to a flow-controlled service type. Each switch bases the decision on whether a boolean variable for the calling subscriber that appears in a management information base (MIB) is set to a value indicating that the subscriber is entitled to the upgrade. In addition, the upgrade is performed only if an interface on the route to the called party on which the call setup request is to be forwarded supports flow-controlled connections. When the call is to be upgraded, the switch replaces the service type indicator in the setup message with a value indicating a flow-controlled service type, and forwards the setup message toward the called subscriber.

Abstract: Network interface logic includes first logic executing a credit-based flow-control protocol (e.g., Quantum Flow Control or QFC) and second logic executing a rate-based flow control protocol (e.g. Explicit Rate or ER). The second logic transfers data cells between a network link and the first logic and inserts and extracts forward (FRM) and backward (BRM) flow-control/resource management (RM) cells. The second logic further (i) obtains cell buffer utilization information from the first logic, (ii) supplies transmission credits to the first logic based on rate information in BRM cells, (iii) induces the first logic to emit “dummy” RM cells when an RM cell is to be transmitted, and (iv) converts the dummy cells to either FRM or DRM cells for forwarding on the link. Rate information in the transmitted RM cells is calculated from the buffer utilization information and rate information in extracted BRM cells.

Abstract: An asynchronous transfer mode (ATM) based service consolidation switch (10) includes an input/output module (22) having a to-switch port (TSPP) processor (90) and a from-switch port processor (FSPP) (92). The TSPP (90) and the FSPP (92) communicate with a bandwidth arbiter (114), multipoint topology controllers (116), and a data crossbar (117) on a switch control module (32). The TSPP (90) receives traffic over links for conversion into an internal cell format. Internal cells are buffered until allowed to transfer to an appropriate FSPP (92). Multipoint topology controllers (116) performs translations for internal switch flow control through interactions between the TSPPs (90), FSPPs (92), and the bandwidth arbiter (114). The bandwidth arbiter (114) performs appropriate bandwidth arbitration to allow internal cells to flow from TSPPs (90) to FSPPs (92) over the data crossbar (117).

Abstract: A method and apparatus for providing buffer state accounting at a link level, otherwise known as link flow control, in addition to flow control at the virtual connection level. Link flow control enables receiver cell buffer sharing while maintaining per-connection bandwidth with lossless cell transmission. High link level update frequency is enabled without a significant sacrifice in overall link forward bandwidth. A higher and thus more efficient utilization of receiver cell buffers is achieved.

Abstract: A system (10) is provided for identifying a processing port (12) and a link (22) at which a cell (24) is received. The system (10) includes a logical link table (14) having a plurality of logical link entries (30). Each logical link entry (30), which corresponds to a particular link (22) of a processing port (12) associated with the logical link table (14), specifies a numerical value. The processing port (12) may receive the cell (24) at one of a plurality of links (22). The processing port (12) can convert the cell (24) by replacing a numerical value of an identification field, such as a virtual channel identification field (28), of the cell (24) with the numerical value specified by the logical link entry (30) corresponding to the link (22) at which the cell (24) is received. A switch control module (18), which is connected to the processing port (12), may receive the converted cell (38).

Abstract: A system for allocating resources at network elements along a path through a communications network. Resources are allocated at a network element along the path in response to a connection request message. The delay budget is the minimum of a calculated cell transfer delay and a calculated cell delay variation. The calculated cell transfer delay is determined by finding a difference between a target end to end cell delay and an accumulated cell delay, and then dividing that difference by a number of network elements remaining in the path between the network element and the end of the path. To determine the calculated cell delay variation, the network element first finds a difference between the Max CDV QoS parameter and the sum of the accumulated cell delay variation and the switching delay for the network element. The calculated cell delay variation is then equal to that difference divided by the number of network elements remaining in the path between the network element and the end of the path.

Abstract: A mechanism enabling plural queues in a downstream telecommunications network element to be treated as a single, joint queue for purposes of connection-level flow control. A pointer in at least one queue descriptor points to a queue descriptor in which is maintained a set of shared, joint counters. Other flow control elements are maintained individually with respect to each queue descriptor. This mechanism enables flow control elements associated with a single transmitter queue to flow control plural connections terminating in plural queues associated with a single receiver processor.

Abstract: An Asynchronous Transfer Mode switch and method which facilitate point-to-multipoint transmission are disclosed. Each input port within the switch includes a switch allocation table ("SAT") which manages bandwidth allocation and delay. Each SAT includes a plurality of sequentially ordered cell time slots, a subqueue and a synchronized pointer which is directed to one of the slots such that at any given point in time each of the pointers is directed to the same slot location in the respective SAT with which the pointer is associated. To execute point-to-multipoint operation where output port conflicts are present the switch transmits copies of the cell to the output ports at different points in time. More particularly, the switch transmits copies of the cell to available output ports, and tracks such transmission for managing future transmission to unserviced output ports. To track transmission the switch includes a map and scoreboard.

Abstract: In a link-level flow controlled system, a method and apparatus providing the ability to partition a buffer resource among multiple prioritized buffer subsets through definition of at least one threshold, the buffer resource being shared by a plurality of connections. Different category of service levels, in terms of delay bounds, are thus enabled. The presently disclosed link-level flow controlled system provides for zero cell loss. The shared buffer resource is divided among N priority pools, defined by N-1 threshold levels, each priority pool attributable to a respective category of service. Link-level counters and registers, disposed in a transmit element, as well as an indication of priority level associated with each connection, are employed in realizing the shared buffer resource.

Abstract: A mechanism enabling plural queues in a downstream telecommunications network element to be treated as a single, joint queue for purposes of connection-level flow control. A pointer in at least one queue descriptor points to a queue descriptor in which is maintained a set of shared, joint counters. Other flow control elements are maintained individually with respect to each queue descriptor. This mechanism enables flow control elements associated with a single transmitter queue to flow control plural connections terminating in plural queues associated with a single receiver processor.

Abstract: In a link-level flow controlled system, a method and apparatus providing the ability to partition a buffer resource among multiple prioritized buffer subsets through definition of at least one threshold, the buffer resource being shared by a plurality of connections. Different category of service levels, in terms of delay bounds, are thus enabled. The presently disclosed link-level flow controlled system provides for zero cell loss. The shared buffer resource is divided among N priority pools, defined by N-1 threshold levels, each priority pool attributable to a respective category of service. Link-level counters and registers, disposed in a transmit element, as well as an indication of priority level associated with each connection, are employed in realizing the shared buffer resource.

Abstract: A method and apparatus for providing a minimum per-connection bandwidth guarantee and the ability to employ shared bandwidth thereabove in an environment having both virtual-connection and link-level flow control. A buffer pool downstream of a transmitter and disposed in a receiver is divided among a first portion dedicated for allocated bandwidth cell traffic and a second portion for dynamic bandwidth cell traffic. Link flow control enables receiver cell buffer sharing while maintaining the per-connection bandwidth guarantee. No cell-loss due to buffer overflows at the receiver is also guaranteed, resulting in high link-utilization in a frame traffic environment, as well as low delay in the absence of cell retransmission. A higher and thus more efficient utilization of receiver cell buffers is achieved.

Abstract: Methods and apparatus for scheduling cell transmission over a network link by a switch. The switch includes a plurality of queues associated with each link. Lists of queues are maintained for each link. In one embodiment, each link is associated with more than one type of list (with the list type corresponding to a scheduling category) and more than one prioritized list of each type (with the priority of the list corresponding to a quality of service). The scheduling lists are accessed to permit cell transmission from a queue contained therein in a predetermined sequence as a function of scheduling category, priority within a particular scheduling category and whether the bandwidth requirement for the particular scheduling category has been met. With this arrangement, maximum permissible delay requirements for each scheduling category are met.

Abstract: An apparatus and a method are disclosed for arbitrating between streams of ATM cells, or sources for a connection, on multiple input port processors vying for an opportunity to be transmitted as a fixed bandwidth, or allocated, connection on a single output port through a network switch. The network switch maintains a plurality of input port processors, at least one output port, and input and output buffers associated with the respective input and output ports. Streams of ATM cells enter the network switch as sources for a connection through the multiple input port processors and are buffered in the input buffers. The ATM cells are then routed from the input buffers to an output buffer in the output port. The network switch also provides a multipoint topology controller (MTC) and a bandwidth arbiter (BA) for performing the arbitration.

Abstract: A method and apparatus is disclosed for allocating bandwidth within a network switch having a plurality of input ports coupled to a plurality of output ports through a switch fabric to assure that a minimum bandwidth is allocated for predetermined scheduling lists. A switch allocation table is provided for each of a plurality of input ports. Each switch allocation table is organized as a circular table which is sequentially indexed via an associated index counter. Respective entries in the switch allocation table comprise scheduling list numbers which serve to identify cells requiring switch bandwidth. The respective index counters are synchronized such that all switch allocation tables have a corresponding entry selected. The amount of bandwidth and delay through the network switch is controlled for each of the scheduling lists based upon the number and spacing of entries in the respective switch allocation table.