Abstract: The invention discloses a method and apparatus for assigning link "distance" metrics that result in near optimal routing for a network formed of nodes (routers) and links, where each link has a capacity associated with it, and where source-destination flows are given. The routing optimality is measured with respect to some objective function (e.g., average network delay).

Abstract: Congestion control is implemented at the resources that actually suffer from congestion and, moreover the congestion control is performed within the network as well as at its access points. In a particular embodiment, congestion control is continuously performed at each resource. Use of each resource is controlled according to a head-of-the-line weighted round-robin service discipline thereby assuring fairness and full use of bandwidth for all active channels. Also, in order to control conditions of congestion, the queue of data elements waiting for service at each resource is regulated by a global congestion indicator for the entire queue. The data elements of each channel that are waiting for service are further regulated in response to specific local congestion indicators that are individualized for each channel. The global and local congestion indicators are used to guarantee predetermined levels of service for each channel.

Abstract: This invention is a method of and apparatus for implementing a service scheduling discipline to enable data devices efficient access to data resources. According to the invention, information identifying one or more data packets of each data batch is sorted into one or more of a plurality (N) of epoch queues, such that for each data batch, no information identifying more than a predetermined number (P) of data packets from a particular channel is inputted into each epoch queue. Each epoch queue is then cyclically served exhaustively by outputting the identified data packets to the facility. Data that cannot be placed in the epoch queues is temporarily placed in an overflow queue. The overflow queue data is subsequently sorted into the epoch queues and transmitted.

Abstract: A multi-user Time Division Multiplex (TDM) system includes a plurality of stations and at least one erasure node located between groups of the stations. When a station reads the destination identification bits of a received time slot and determines that it is the destination for that slot, it sets the status of a slot-read bit, which follows the destination identification bits, to indicate that the slot has been read. When an erasure node detects a set slot-read bit it erases all or part of the associated slot, thereby enabling the reuse of that slot by subsequent stations. An interface apparatus, which enables the TDM system to connect the other TDM systems, filters intra-system communications from inter-system communications using the slot-read bit. When the interface apparatus detects a set slot-read bit it knows that the slot has been read and, therefore, is an intra-system communication which should be blocked or discarded.

Abstract: A multi-user Time Division Multiplex (TDM) system includes a plurality of stations and at least one erasure node located between groups of the stations. When a station reads the destination identification bits of a received time slot and determines that it is the destination for that slot, it sets the status of a slot-read bit, which follows the destination identification bits, to indicate that the slot has been read. When an erasure node detects a set slot-read bit it erases all or part of the associated slot, thereby enabling the reuse of that slot by subsequent stations. An interface apparatus, which enables the TDM system to connect the other TDM systems, filters intra-system communications from inter-system communications using the slot-read bit. When the interface apparatus detects a set slot-read bit it knows that the slot has been read and, therefore, is an intra-system communication which should be blocked or discarded.