Abstract: Systems, methods and computer-readable media for utilizing spare link capacities of links within a communications network are described. According to one aspect, a method for utilizing spare network capacity on a communications network includes determining a spare capacity of a plurality of links within the communications network. Upon determining the spare capacity of the plurality of links, a portion of the plurality of links according to the spare capacity of the plurality of links is selected. A standby network including the selected portion of the plurality of links is established, and traffic is routed through the standby network.

Abstract: Methods and apparatus to reassign quality of service (QoS) priorities in a communication network are disclosed. An example method disclosed herein comprises performing a temporary QoS priority reassignment for network traffic between a first network element associated with a first user of a communication network and a second network element associated with a second user of the communication network without intervention by a service provider providing the communication network to the first and second users, the first user authorized by the service provider to temporarily reassign a QoS priority associated with the second user, and terminating the temporary QoS priority reassignment based on a monitored termination criteria.

Abstract: A method and apparatus for improving data throughput in a network are disclosed. For example, the method receives at least one packet from a first device, and generates an acknowledgement message for verifying a receipt of the at least one packet, wherein the acknowledgement message comprises a precedence value that indicates that the acknowledgement message is to be handled with a priority in accordance with the precedence value. The method sends the acknowledgement message to the first device.

Abstract: Methods and systems for facilitating preemptive based radio access control are provided. The methods and systems include receiving queue data corresponding to a set of requests for highly prioritized communications included on a prioritized queue and utilizing the queue data to determine whether a set of conditions for involuntarily terminating a radio communication session has been met. Session data corresponding to characteristics for each of a plurality of radio communication sessions are also received and utilized to determine which of the plurality of radio communication sessions to terminate if the set of conditions for involuntarily terminating a radio communication session have been met.

Abstract: To automatically discover the port connections for all nodes in a network, a master node generates a predetermined optical signal and transmits the predetermined optical signal to a neighboring node, which signal identifies the port on which the master node transmitted the predetermined signal. The recipient transmits a reply signal to the predecessor node and to the master node via a control channel, which identifies a port on which the predetermined optical signal was received by the neighboring node. By successively repeating this process in a methodical manner, the master node can discover all of the port interconnections in the optical network. Also each node can discover all its port interconnections to its neighbors. Moreover, by selecting controlling the state (e.g., terminate, open) of the ports of the non-master nodes in the network, the master node can control which nodes receive the predetermined signal, thereby ensuring proper port discovery.

Abstract: A technique for allocating protection-switching mechanisms operates on a per wavelength basis. This allows a designer of an optical network to select a particular protection switching mechanism for a given traffic type, which is usually specific to a particular wavelength in an optical network. For another traffic type, the designer can allocate a different protection switching mechanism, thereby providing optimal protection switching for each traffic type.

Abstract: Methods, computer program products, and systems for providing called party initiated priority marking are provided. The method includes receiving a request from a called party to mark a telephone call currently in session as a priority telephone call. The telephone call is initiated by a calling party and received by the called party. It is determined if the called party has authorization to mark the telephone call as a priority telephone call. The telephone call is marked as a priority telephone call if it is determined that the called party has authorization to mark the telephone call as a priority telephone call.

Abstract: To automatically discover the port connections for all nodes in a network, a master node generates a predetermined optical signal and transmits the predetermined optical signal to a neighboring node, which signal identifies the port on which the master node transmitted the predetermined signal. The recipient transmits a reply signal to the predecessor node and to the master node via a control channel, which identifies a port on which the predetermined optical signal was received by the neighboring node. By successively repeating this process in a methodical manner, the master node can discover all of the port interconnections in the optical network. Also each node can discover all its port interconnections to its neighbors. Moreover, by selecting controlling the state (e.g., terminate, open) of the ports of the non-master nodes in the network, the master node can control which nodes receive the predetermined signal, thereby ensuring proper port discovery.

Abstract: A method and apparatus for enabling prioritization of signaling messages in a communication network are disclosed. For example, the method receives at least one signaling message, and classifies each of the at least one signaling message. The method schedules each of the at least one signaling message for processing, and discards selectively one or more signaling messages that have been scheduled under an overload condition.

Abstract: A method and apparatus for providing bandwidth allocation for a network are disclosed. For example, the method receives data from a plurality of subscribers for transmission, and allocates a minimum reserved bandwidth to each of the plurality of subscribers. The method then allocates a portion of a shareable bandwidth to at least one of the plurality of subscribers in accordance with a weight factor.

Abstract: A method for merging protection switching messages in an optical network enables a control of the amount of message bandwidth used for sending protection switching messages. A method for performing protection switching in an optical network does so in an optimal manner by performing the protection switching actions in the various nodes of a protection path in parallel rather than in sequence. To do so, a channel failure message is transmitted from an end node A in the optical network upon detecting a failure in a link in the optical network that includes the end node A. If a failure can be detected at both end nodes, the channel failure messages are transmitted from both end nodes the moment they detect failure without any further waiting. Upon receiving the first channel failure message regardless its originating end node, switching actions in intermediate nodes are initiated.

Abstract: A method and apparatus for performing traffic engineering, e.g., allocating bandwidth, on a wireless access network are disclosed. For example, the method determines a number of subscriber stations (SSs) that a Base Station (BS) is capable of supporting in accordance with at least one performance objective for voice traffic, wherein the at least one performance objective for voice traffic comprises a type of codec. The method then allocates bandwidth by the base station in accordance with the number of subscriber stations that the base station is capable of supporting.

Abstract: A method for merging protection switching messages in an optical network enables a control of the amount of message bandwidth used for sending protection switching messages. A method for performing protection switching in an optical network does so in an optimal manner by performing the protection switching actions in the various nodes of a protection path in parallel rather than in sequence. To do so, a channel failure message is transmitted from an end node A in the optical network upon detecting a failure in a link in the optical network that includes the end node A. If a failure can be detected at both end nodes, the channel failure messages are transmitted from both end nodes the moment they detect failure without any further waiting. Upon receiving the first channel failure message regardless its originating end node, switching actions in intermediate nodes are initiated.

Abstract: A method for performing protection switching in an optical network does so in an optimal manner by performing the protection switching actions in the various nodes of a protection path in parallel rather than in sequence. To do so, a channel failure message is transmitted from an end node A in the optical network upon detecting a failure in a link in the optical network that includes the end node A. If a failure can be detected at both end nodes, the channel failure messages are transmitted from both end nodes the moment they detect failure without any further waiting. Upon receiving the first channel failure message regardless its originating end node, switching actions in intermediate nodes are initiated. The channel failure messages are forwarded from the intermediate nodes to their corresponding next nodes before completing switching actions in the intermediate nodes.

Abstract: The present invention provides a method, computer-readable medium and device for dynamically managing allocation of bandwidth in a packet network using a Dynamic Setting Scheme (DSS) for Class Based Queuing (CBQ). The method includes the steps of maintaining a minimized reserved portion of bandwidth to minimize delay jitter and maximizing a shared portion of bandwidth to maximize overall bandwidth utilization. Allocation of bandwidth may be based on a sharing tree hierarchical scheme that provides for temporary borrowing of bandwidth by real-time applications from bandwidth of non-real-time applications and blocks borrowing of bandwidth by non-real-time applications from bandwidth of real-time applications. DSS typically provides for using measurable parameters, such as queue length and number of borrowing attempts per a predetermined length of time/observation window, as control triggers for implementing adjustment of bandwidth allocation.

Abstract: The present invention provides a method, computer-readable medium and device for dynamically managing allocation of bandwidth in a packet network using a Dynamic Setting Scheme (DSS) for Class Based Queuing (CBQ). The method includes the steps of maintaining a minimized reserved portion of bandwidth to minimize delay jitter and maximizing a shared portion of bandwidth to maximize overall bandwidth utilization. Allocation of bandwidth may be based on a sharing tree hierarchical scheme that provides for temporary borrowing of bandwidth by real-time applications from bandwidth of non-real-time applications and blocks borrowing of bandwidth by non-real-time applications from bandwidth of real-time applications. DSS typically provides for using measurable parameters, such as queue length and number of borrowing attempts per a predetermined length of time/observation window, as control triggers for implementing adjustment of bandwidth allocation.

Abstract: To automatically discover the port connections for all nodes in a network, a master node generates a predetermined optical signal and transmits the predetermined optical signal to a neighboring node, which signal identifies the port on which the master node transmitted the predetermined signal. The recipient transmits a reply signal to the predecessor node and to the master node via a control channel, which identifies a port on which the predetermined optical signal was received by the neighboring node. By successively repeating this process in a methodical manner, the master node can discover all of the port interconnections in the optical network. Also each node can discover all its port interconnections to its neighbors. Moreover, by selecting controlling the state (e.g., terminate, open) of the ports of the non-master nodes in the network, the master node can control which nodes receive the predetermined signal, thereby ensuring proper port discovery.

Abstract: A method and system for dynamically triggering flow-based quality of service shortcuts through a router is disclosed. The method further includes the steps of receiving a data packet at a router, determining whether a shortcut has been set up for a data flow to which said packet belongs, checking the status of an onset trigger counter when no shortcut exists, and when a current value of said onset trigger exceeds an onset trigger value, setting up a new shortcut for said data packet belonging to said data flow. The method of the present invention includes a dynamic system for adjusting state variable to control the number of shortcuts in existence and the adjusting the shortcut set up rate for optimal router switching efficiency.

Abstract: In a node that receives cells for many connections, a method selects cells for discarding when the node's buffer is full. The connection from which a cell is discarded is chosen based on the individual traffic loads of all the connections, on the traffic load of the chosen connection, and on the desired Quality-of-Service for the various connections. An embodiment is presented where a fair ratio of loss is defined for each of the set of connections that are active in the node based on the aforementioned traffic and QoS considerations. When an incoming cell finds the buffer full, a connection is selected in accordance with the computed fair ratio of loss values. When the connection thus selected does not have a cell to be discarded, another connection is selected for discarding a cell.

Abstract: In a node that receives cells for many connections, a method discards entire packets when the node's buffer is full. The selected connection is one that includes at least one cell that corresponds to the beginning of a packet. In another embodiment, the connection is chosen by first making an initial selection, determining whether that selection can stand, and if not, by making an alternate selection. When an alternate selection is made, a credit factor associated with the initial selection is decremented, while the credit factor of the alternate selection is incremented. The initial selection can be carried out by considering the overall traffic load at the node, the individual traffic loads that comprise the overall traffic load of the node, and the QoS that is desired for the various connections that are active in the node.