Abstract: The present invention is an apparatus for controlling client node access to data items maintained in a storage device. The data items include volatile data items. The apparatus comprises a communication device for communicating with multiple client nodes; and a processor, coupled to the storage device for polling the client nodes to exchange (e.g., retrieve and/or transmit) data related to the volatile data items, via the communication device. The processing system further controls client node access to the data items of the storage device. In this way, the apparatus and method of the present invention remedies the problems associated with directory server overload.

Abstract: The present invention is a directory server for monitoring network access requests, which includes a storage device for storing data items and an identifier associated with a monitoring node for at least a selected data item of the data items; a communication device for transmitting signals to the monitoring node; and a processing device, coupled to the storage device and the communication device. The processing device receives a network access request for the selected data item and, responsive to receipt of the request, automatically transmits a signal notifying the monitoring node of the request via the communication device, thereby enabling the monitoring node, e.g., a third party, to enforce traffic class priorities and access characteristics of the network.

Abstract: A method and apparatus are provided for scheduling the transmission of cells of a plurality of data streams in a communications network. An earliest deadline first (EDF) scheduler is provided for scheduling the transmission of cells of a plurality of data streams in a communications network to ensure that the connection or data stream with the earliest deadline is transmitted first. Each of the multiple data streams has a delay bound or deadline. Data of each data stream is enqueued to a corresponding data cell queue. A timing wheel time slot based on an identified target transmission time for each data cell queue is calculated utilizing an addition of a maximum delay value. A move forward timing mechanism includes a scan forward feature to identify a succession of virtual connection or data stream cell queues for transmission. A multiple tier cell scheduler is provided that includes at least two scheduling timing wheels.

Abstract: A method and apparatus are provided for resource allocation with guarantees. A resource allocator is coupled to a controller. The resource allocator allocates resources between a plurality of arrival processes. A dedicated resource pool and a shared resource pool are provided. When an arrival process is identified, the resource allocator obtains a predefined characterizing value for the identified arrival process. Responsive to the obtained predefined characterizing value, resource from one of the dedicated resource pool or the shared resource pool is allocated to the arrival process. The controller is utilized for tracking resource use and for providing the predefined characterizing value for each of the plurality of arrival processes. The dedicated resource pool has a predetermined capacity greater than or equal to the total of all the low threshold values for each of the arrival processes.

Abstract: The present invention addresses the issue of controlling delay variations (jitter) in packet-switched networks by enhancing the capabilities of existing scheduling policies. The idea is to use a few bits in the header of packets to send jitter control information to the downstream network elements, so that the delay variation caused by the upstream network element, is compensated for by the downstream network element. The key point to observe is that packets (or cells in ATM) may be small, and therefore, not contain many bits in the header that can be used for jitter control. We describe a unique scheme, that utilizes the bits that are available for jitter control in an efficient manner, allowing for the desired jitter to be obtained with as few bits as possible.