摘要:
In a floor control system for a network, a floor control server controls a floor-based application for communications between multiple participant terminals. The server carries out a floor determination process that includes an adaptive waiting function. Upon receiving an initial floor request message, the server waits for additional requests before determining the floor winner. The wait time is a function of the floor request load. When the system is lightly loaded, the wait time is generally small. For heavier request loads, the wait time is generally longer, to ensure that a reasonable number of requests are received before awarding the floor. The wait time may be limited by a maximum wait time, which is a function of the floor request load. If a designated number of floor requests is received before the maximum wait time expires, a temporary floor winner is granted the floor if its priority is sufficiently high.
摘要:
In a floor control system for a network, a floor control server controls a floor-based application for communications between multiple participant terminals. The server carries out a floor determination process that includes an adaptive waiting function. Upon receiving an initial floor request message, the server waits for additional requests before determining the floor winner. The wait time is a function of the floor request load. When the system is lightly loaded, the wait time is generally small. For heavier request loads, the wait time is generally longer, to ensure that a reasonable number of requests are received before awarding the floor. The wait time may be limited by a maximum wait time, which is a function of the floor request load. If a designated number of floor requests is received before the maximum wait time expires, a temporary floor winner is granted the floor if its priority is sufficiently high.
摘要:
Various embodiments provide a method and apparatus of providing a non-overlapping ring-mesh network topology which reduces costs (e.g., the number of network links) while providing resiliency to failure and meeting QoS requirements (e.g., network delay attributed to traversing the network architecture). In particular, a set of target nodes belonging to a cluster are connected through N rings. Each node is member of all N rings and no link between nodes in a ring is duplicated in another ring.
摘要:
An example method includes receiving at a scheduling server status information concerning at least one transmit queue for a plurality of optical pass-through switches (OptSws). A schedule for transmissions to take place is determined based on the status information for the OptSws. A control message is forwarded to the plurality of OptSws in order that the schedule may be implemented. In an embodiment, a schedule is determined for a wavelength available to transmit a transmission by removing unsupportable transmissions from a candidate transmission list, determining a first transmission that is the one of the transmissions of the candidate transmission list which most preferably satisfies a given parameter, updating a usage list to reflect determination of the first transmission; and replacing the candidate transmission list with the residue set of the first transmission. The usage list reflects transmissions determined by the scheduler.
摘要:
For voice traffic over-the-air in LTE, persistent schedule (PS) or semi-persistent (SPS) scheduling would be the preferred method as they minimize signaling messages. In PS or SPS, resources are pre-allocated to the UE 402 at regular intervals (e.g., every 20 milliseconds). At each time slot, the UE will generally transmit an IMBE frames which are encoded in ISSI packet. In ISSI, other data streams are multiplexed with the IMBE frame and thus the packet size varies depending on its position within a super-frame. For PS or SPS, eNodeB must allocated sufficient resources to support the largest packet that. Therefore, there is spare capacity when the packet is not of the largest size. The exemplary embodiments specify ways to use spare capacity to transfer data.
摘要:
A method and system for group call control in a broadband wireless network. A group call (push-to-talk) server initiates and regulates group call communication sessions. A wireless base station communicates with one or more group call participants. When a request to participate in a group call is received, it is examined to see if it contains a group call ID or other group call indicator. If not, regular call resources are allocated, if available. If so, it is determined whether another group member is attached to the base station. Group call resources are then reserved, if available, based on this determination. The resources allocated for the group call may also depend on whether the system supports multicast on the downlink to group members, or whether losing audio is supported. In some embodiments, network resources may be reallocated to support the group call.
摘要:
Embodiments of the present invention are directed to providing a method and system for call admission control and preemption of multiple bit-rate applications in a digital communication system. Multiple bit-rate applications such as streaming video can specify a Quality of Service (QoS) profile having multiple levels. When there are insufficient resources in the network to support an incoming multiple bit-rate call, the system determines whether, by reducing the bit-rate of the incoming call or by preemption of lower priority components of existing calls, enough resources can be recovered to support the incoming call.
摘要:
In one embodiment, a method for setting up a flow-through mesh group (FTMG) for transmitting link-state packets (LSPs) in a network having a plurality of nodes interconnected by links. The FTMG is a combination of multiple spanning trees for the network through which LSPs are forwarded. FTMG set-up messages are received at ports of each node of the network from peer ports of linked nodes. FTMG set-up messages identify root nodes of the multiple spanning trees and the transmission modes of the peer ports. The FTMG set-up messages are used to determine (1) a root node for each spanning tree, (2) a root port on each node for each spanning tree, and (3) directionality of ports of the nodes. FTMG set-up messages are then used to determine the transmission mode of ports of the nodes and, subsequently, to update the spanning trees and transmission modes, as needed.
摘要:
A method is provided for establishing a communication session over a path supported at least in part by a telephony network and an ATM network. The telephony network includes ingress and egress telephony switches and the ATM network includes ingress and egress ATM switches. A first call setup request is received at the ingress telephony switch from an originating node and the ingress telephony switch selects a first available trunk from the ingress telephony switch to the ingress ATM switch. A communications path is established over the available trunk to the ingress telephony switch. A second call setup request is transmitted from the ingress telephony switch to the egress telephony switch and the egress telephony switch selects a second available trunk from the egress telephony switch to the egress ATM switch. A third party set up command is transmitted from one of the telephony switches to one of the ATM switches requesting establishment of a virtual connection between the ingress and egress ATM switches over the ATM network. A virtual connection is established between the ingress and egress ATM switches. The egress telephony switch connects the second available trunk to a third trunk in communication with a destination node such that the destination node is informed of a request to establish a communication session with the originating node.
摘要:
Various embodiments provide a method and apparatus of providing a non-overlapping ring-mesh network topology which reduces costs (e.g., the number of network links) while providing resiliency to failure and meeting QoS requirements (e.g., network delay attributed to traversing the network architecture). In particular, a set of target nodes belonging to a cluster are connected through N rings. Each node is member of all N rings and no link between nodes in a ring is duplicated in another ring.