Abstract: Method for admitting new voice calls to a VoIP network. Various points in the network are polled to generate a link utilization parameter. Parameters denoting threshold values of link utilization in the network are compared to the link utilization parameter. A first comparison is made between a first (current) link utilization parameter and first and second link utilization threshold parameters. Then, a second comparison is made between the current link utilization parameter and a second (previous) value of link utilization. A calculation of new calls allowed into the network is performed based on these comparisons and whether the current level of link utilization is rising or falling when compared to a previous level of link utilization.

Abstract: A method for managing calls of various relative priority levels in an IP network includes polling at least one location in the network to obtain information indicative of a level of utilization said at least one location and computing a status of utilization of said at least one location based on said polled information and assigning a decision policy to said status. A priority level of a new voice call requesting to enter the network is then assessed against relative to priorities of existing calls on the network and the decision policy is invoked on the new voice call according to its relative priority level to the existing calls on the network and the decision policy in effect at the time the new voice call requests entry to the network.

Abstract: A method and apparatus is provided for setting up an IP session from a first node, across a network that uses direct virtual path routing, to a second node. The first node receives a request to set up the session. The second node is identified as the destination of the session, based on the request. A first stack of labels is obtained that defines a first path. A second stack of labels is obtained that defines a second path. A first label identifier is selected that identifies the session in a first direction. A second label identifier is selected that identifies the session in a second direction. Finally the data is transmitted from the first node to the second node and from the second node to the first node using the first stack and second stack of labels and label identifiers, respectively.

Abstract: The problems associated with prior solutions for implementing ATM or IP/MPLS in a large-scale network are overcome by providing an efficient means by which capacity in the network is more fully shared without adversely affecting call or session setup latency, and at the same time simplifying network operations. This is achieved by performing the functions of route setup, route allocation, and capacity management in a network at the edges (e.g., the interfaces existing between each ATM switch or IP/MPLS router and customers) of the network. In accordance with the principles disclosed herein, the edges contain nodes that form the interface between the ATM switches and IP/MPLS routers and the link(s) that interconnect them and the outside world. These nodes comprise controllers and other apparatus that in some cases may be incorporated in, or connected as adjuncts to, the ATM switches or IP/MPLS routers.

Abstract: An admission control and load balancing system controls admission of packet streams or calls to a network and balances the packet traffic across the network, improving quality of service. The system includes a central database which stores information including cost data associated with individual paths and links across the network. A processor, in communication with the database, coordinates the admission control and load balancing decisions, and updates of the database cost data to reflect the dynamic network conditions, based on input from appropriate data sources. In one embodiment, referred to as the exact algorithm, the database is consulted by the admission control points or gatekeepers prior to admitting each arriving packet stream, and the database contents are updated call-by-call to reflect the allocation of resources to each admitted stream.

Abstract: A method and apparatus to control call admission to a packet-based network and achieve load balancing over a packet-based network includes at selected times generating and sending a path status message along a defined path, such as an MPLS path, through the network. As the message travels along the path, a cost metric field within the message is updated. The cost metric may reflect available bandwidth, or percentage utilization of the aggregate bandwidth, on the most congested (bottleneck) link in the path that it tracks. The cost metric is determined for each link at a data measuring point, such as individual routers, along the path. The optimum path between two gateways is determined, and further packet streams are routed onto the optimum path.

Abstract: A method is provided for setting up a communication from a first edge node, across a network that uses direct virtual path routing, to a second edge node. The first edge node receives a request to set up the communication. The second edge node is identified as the destination of the communication, based on the request. A first virtual path identifier (VPI) is obtained that defines a first path from the first edge node across the network to the second edge node. A second VPI is obtained that defines a second path from the second edge node across the network to the first edge node. The first and second VPIs are selected by a routing status database. A first virtual channel identifier (VCI) within the first VPI is selected. A second virtual channel identifier (VCI) within the second VPI is selected. Data is transmitted from the first edge node to the second edge node using the first VPI and first VCI, and from the second edge node to the first edge node using the second VPI and second VCI.

Abstract: An efficient approach and corresponding apparatus for selecting virtual paths in a network for routing datagrams achieves effective sharing of capacity without adversely affecting call setup latency. Edge nodes of the network assign calls to virtual paths based on the destination of the call and the current load status of each of a relatively small number of paths. Each call is assigned a VPI (Virtual Path Identifier) corresponding to the path chosen and a VCI (Virtual Circuit Identifier) corresponding to the identity of the call at that edge node. The ATM backbone nodes route calls based solely on the VPI. Capacity management and load balancing is achieved by each edge node keeping track of the load on each access link from its edge node to the rest of the network and of the congestion status of the various links in the network.

Abstract: An efficient approach and corresponding apparatus for selecting virtual paths in a network for routing datagrams achieves effective sharing of capacity without adversely affecting call setup latency. Edge nodes of the network assign calls to virtual paths based on the destination of the call and the current load status of each of a relatively small number of paths. Each call is assigned a VPI (Virtual Path Identifier) corresponding to the path chosen and a VCI (Virtual Circuit Identifier) corresponding to the identity of the call at that edge node. The ATM backbone nodes route calls based solely on the VPI. Capacity management and load balancing is achieved by each edge node keeping track of the load on each access link from its edge node to the rest of the network and of the congestion status of the various links in the network.

Abstract: A data synchronization system, which in one embodiment, uses a ShuffleNet topology requiring an even number, N=2m, of nodes in the system. These nodes are organized into two sets, X=x.sub.0, . . . , x.sub.m-1 and Y=y.sub.0, . . . , y.sub.m-1, wherein the subscripts are always to be taken modulo m. Each "round" of communication entails simultaneously synchronizing the nodes in X with nodes in Y according to a matching between the two sets. The rounds are grouped into two "batches," batch B.sub.j which consists of rounds R.sub.2j-1 and R.sub.2j-2 for j.gtoreq.1. During each odd batch B.sub.2j-1, each x.sub.i synchronizes with y.sub.2i+2j-2 and with y.sub.2i+2j-1. In another embodiment, the data synchronization is based on a hypercube scheme, wherein each node is labeled by a binary string and any two nodes with their labels differing by one bit are connected by an edge and only adjacent nodes, i.e. those nodes connected by an edge, can communicate and exchange data directly according to an update schedule.

Abstract: A method of routing an interim NP call in which it is determined to give a called number interim NP redirection rather than conventional RCF redirection when the called number is to be ported. When a ported call is to receive interim NP redirection and SS7 networking is used, an Initial Address Message for the call is created with the Called Party Number parameter of the Initial Address Message populated with the Location Routing Number for the switch to which the called number has been ported. The Generic Address Parameter of the Initial Address Message is populated with the called number and the M bit of the Forward Call Indicator parameter of the Initial Address Message is set. The call is then redirected to the switch to which the called number has been ported based on the Location Routing Number in the Called Party Number parameter of an Initial Address Message. This method avoids the use of RCF "shadow numbers" and the need to query an external long-term NP database.

Abstract: A system and method are described for assigning downstream and upstream communication pathways in broadband access networks, such as networks based on the hybrid fiber-coax architecture. In the upstream direction, frequency channel and time slot assignments use a packing opposite methodology, which is dependent on the type of service request. The system assigns the lowest time slot in the lowest frequency available for a DSO service request and the highest time slot in the highest frequency which has the next four contiguous time slots available for an H0 service request. To optimize upstream bandwidth efficiency, a H0 channel occupying the space of four contiguous time slots is used to carry up to six simultaneous voice conversations. A method is described that governs such use of H0 channels by NIUs according to their offered loads.

Abstract: A portable length probe having a length measuring wheel with light transmission holes at equally spaced angular intervals thereon, which wheel is rotatably mounted in an integral one piece nose body having a photo-responsive element and a light-emitting element disposed in aligned facing relation in a common bore formed in the nose body transverse to the wheel. The photo-responsive element is an infrared sensitive photo-transistor and the light emitting element is an infrared light emitting diode (LED), and both are encased in cylindrical opaque cases which fit in generally complementary sliding relation within the bore, the cases each having an optically open end facing one another. Increased accuracy is provided by employing frequency doubler circuitry in conjunction with the wheel, in which the wheel light transmission holes are substantially uniform in angular width and are spaced apart a distance substantially equal to such hole angular width.

Abstract: A portable hand-held length probe with a length measuring wheel and a tracing unit which is mounted adjacent the wheel and is movable by pressing the tracing unit against a surface to be measured. A wheel movement indicative output signal is effected as function of wheel movement, and the probe carries a switch which is actuated as a function of depress-release movement of the tracing unit to enable or disable transmission of the wheel movement indicative output signal.

Abstract: A hand-held portable length probe having a length measuring wheel and a tracing unit disposed adjacent the measuring wheel, the tracing unit being slidably carried by the probe housing and acting to actuate a switch secured in fixed relation on the probe housing. The switch is illustrated as a miniature snap action switch, actuated by the slidable tracing unit either directly or indirectly through an intermediate adjustable spring lever arm; and is also illustrated as a magnetically actuated switch in the form of a reed switch which is actuated by a permanent magnet carried by the sliding tracing unit. The wheel is carried in a removable nose element which serves to aid in anchoring the tracing unit housing to the length probe main housing. The switch is carried, in the illustrative examples, by a retention clip.