Abstract: A system and method for signaling and transmitting uplink reference signals are provided. A method for communications controller operations includes signaling information about a set of sequence groups to a first communications device, where the first communications device uses a sequence in the set of sequence groups to modulate a reference signal. The method also includes selecting a sequence group from the set of sequence groups and signaling information about the selected sequence group to the first communications device.

Abstract: A method for discontinuous reception (DRX) configuration is disclosed, and the method includes: configuring DRXs for a plurality of component carriers, and selecting one or more component carriers as anchor component carriers; controlling the DRXs of other non-anchor component carriers by the anchor component carrier. A system for discontinuous reception (DRX) configuration is also disclosed, and the system includes: a selection and configuration unit, which is used to configure DRXs for a plurality of component carriers and select one or more component carriers as anchor component carriers; a control unit, which is used to control the DRXs of other non-anchor component carriers by the anchor component carrier. By the method and the system, the DRX solution based on the primary carrier is clarified, and the DRX solution based on primary carriers in the stage of conception is improved and concretely implemented.

Abstract: A Hierarchical Cluster Tree (HCT) overlay network reflects underlying physical network topology including inter-node distances (e.g., hop count), and an HCT structure groups nodes based on distance measurements. Local area networks (LANs) are basic building blocks. The network includes first and second level-1 clusters of LANs, each LAN including computerized data processing and/or storage nodes. A distance between LANs in the level-1 clusters is less than or equal to a predefined level-1 maximum distance. The LANs of the first and second level-1 clusters form a level-2 cluster of LANs in which a distance between cluster medoid nodes of the level-1 clusters is less than or equal to a predefined level-2 maximum distance greater than the level-1 maximum distance. Clustering can be extended to higher levels having successively greater maximum distances.

Abstract: A method apparatus and computer readable medium for facilitating uninterrupted transmission of internet protocol (IP) transmissions containing real time transport protocol (RTP) data during endpoint changes. When an IP transmission is received at the caller RTP port or the callee RTP port, a call record having a caller RTP port identifier or a callee RTP port identifier matching a destination port identifier in the IP transmission is located and when the destination port identifier in the IP transmission matches the caller RTP port identifier of the record, a source IP address identifier and source port identifier from the IP transmission are set as the caller IP address identifier and caller port identifier respectively of the record when the caller IP address identifier and caller port identifier do not match the source IP address identifier and source port identifier respectively and a received SSRC identifier in the IP transmission matches the caller SSRC identifier.

Abstract: Methods, apparatus, and computer readable storage media for accumulating traffic statistics. A traffic receiver may receive a packet and determine a flow identifier associated with the received packet. A hash function may be applied to the flow identifier to generate a memory pointer. One or more records may be retrieved from a statistics memory based on the memory pointer. A determination may be made if the flow identifier associated with the received packet matches a flow identifier value contained in one of the one or more retrieved records. When a match occurs, the retrieved record containing the matching flow identifier value may be updated and the updated record may be stored in the statistics memory.

Abstract: In one embodiment, a particular node in a shared communication network determines a current path cost in a routing topology from itself to a root node via a current parent node. The particular node also determines a respective path cost from each reachable potential parent node of the particular node to the root node via each potential parent and a respective link metric to each potential parent node. A set of acceptable parent nodes are determined from the potential parent nodes that have a respective path cost that is less than the current path cost plus an acceptable cost increase, and also have a respective link metric that is within an acceptable range. By determining a respective number of child nodes for each acceptable parent node, the particular node may then select a new parent node based on giving preference to those having a greater respective number of child nodes.

Abstract: A wireless communication relay station apparatus, a wireless communication apparatus, a wireless communication relay method and a wireless communication method are presented that effectively utilize resources and prevent loop interference. A wireless communication relay station relays communication between a first wireless communication apparatus and a second wireless communication apparatus in at least two or more frequency bands and includes a transmitter for using a first subframe to transmit a first uplink signal to the first wireless communication apparatus in a first frequency band, and transmitting a first downlink signal to the second wireless communication apparatus in a second frequency band. A relay station receiver receives a second downlink signal from the first wireless communication apparatus in the first frequency band, and receives a second uplink signal from the second wireless communication apparatus in the second frequency band.

Abstract: Disclosed is a method of paging an idle-mode terminal in a multi-hop relay communication system, the method including receiving an idle mode request message from the terminal, sending an idle mode response message to the terminal, the idle mode response message including paging information, receiving a superframe from a base station, the superframe including a paging message of the terminal, and staggering the superframe number by a multi-hop count apart from the base station so as to send to the terminal.

Abstract: In the mobile communication system according to the present invention, when the RSRP or RSRQ in a non-serving cell of SCC within “MeasObject” is larger than the sum of the RSRP or RSRQ in an Scell within the “MeasObject” and a predetermined offset value (Offset) for a predetermined period (Time-To-Trigger), the mobile station UE determines that “ReportConfig-A6” is satisfied.

Abstract: In one embodiment, the network node receives a packet traffic aggregated from one or more concurrent application streams in a packet switched network. A number of the one or more concurrent application streams is estimated as a granularity of the packet traffic. A drop probability Pd is calculated based on the estimated granularity and the current traffic load of the network node. The calculated drop probability Pd is provided for a congestion control.

Abstract: A method of reducing interference between two communication systems operating in adjacent frequency bands and coexisting in a communication device is provided, and the two communication systems are a first communication system and a second communication system. The method includes deciding whether to perform an arbitration procedure on a downlink subframe of the first communication system according to a CINR of the first communication system and a RSSI of the second communication system; deciding whether to perform the arbitration procedure on an uplink subframe of the first communication system according to a transmit power of the first communication system and a RSSI value of the second communication system; and when deciding to perform the arbitration procedure on the downlink or uplink subframe, further deciding whether to send a specific packet to request one or more stations not to send packets to the second communication system.

Abstract: Techniques are provided for a switch to assign proxy FCIDs to endpoint device so that the endpoint devices may achieve FCID mobility by retaining their originally assigned FCIDs. At a switch in a network, e.g., a Virtual Storage Area Network (VSAN), a fabric login request is received from a first endpoint device that is associated with a first FC identifier (FCID) that was previously assigned to the first endpoint device by another switch in the VSAN. The fabric login request is responded to with the first FCID. The first endpoint device is assigned a second FCID associated with a domain of the switch where the endpoint device is directly attached to, and the second FCID is used as a proxy FCID within the VSAN for the first endpoint device. A frame is received from the first endpoint device with a source FCID comprising the first FCID and a destination FCID comprising an FCID for a second endpoint device. The source FCID in the frame is overwritten with the second FCID.

Abstract: A transport control server coupled to a plurality of nodes in a network through which a plurality of traffics passes through is provided. The transport control server is configured to receive bandwidth information from each of the nodes when the traffics pass through the nodes. For each of the traffics, the transport control server calculates bandwidths at an entry edge node and at an exit edge node based on the received bandwidth information. The transport control server defines as a first traffic, based on the calculated bandwidths at the entry edge node and the exit edge node, a traffic having a discarded bandwidth that is larger than a first predetermined bandwidth. Also, the transport control server defines as a second traffic, based on the received bandwidth information, a first traffic having a bandwidth at the two or more nodes that exceeds a specified second bandwidth.

Abstract: Techniques are provided to generate a transmit power plan comprising transmit powers to be used by wireless access point devices in a wireless network. A wireless network controller receives, from each of a plurality of wireless access point devices configured to provide wireless service in corresponding coverage areas to client devices, data indicating receive signal strength information with respect to signals received from others of the plurality of wireless access point devices. Overlap of coverage areas of wireless access point devices is computed from the received signal strength information. A plurality of candidate transmit power plans are generated each from a deterministic or random sequence of selections of wireless access point devices. One of the plurality of candidate transmit power plans is selected to achieve a desired amount of coverage area overlap while maximizing overall coverage by the plurality of wireless access point devices.

Abstract: The packet transmission device including: a first and a second storage module to store a token value; a token controller to add a predetermined token value to a first total token value, and subtract a predetermined token value from the first total value in response to the output of the packet; an overrun state controller to add an excess of the first total token value over a predetermined upper limit value to a second total token value, in the case where the first total token value added by addition control is greater than or equal to the predetermined upper limit value; and an underrun state controller to subtract a predetermined token value from the second total token value and add the subtracted token value to the first total token value, in the case where the subtracted first total token value is less than the predetermined upper limit value.

Abstract: A queue scheduling method and apparatus is disclosed in the embodiments of the present invention, the method comprises: one or more queues are indexed by using a first circulation link list; one or more queues are accessed respectively by using the front pointer of the first circulation link list, and the value acquired from subtracting a value of a unit to be scheduled at the head of the queue from a weight middle value of each queue is treated as the residual weight middle value of the queue; when the weight middle value of one queue in the first circulation link list is less than the unit to be scheduled at the head of the queue, the queue is deleted from the first circulation link list and the weight middle value is updated with the sum of a set weight value and the residual weight middle value of the queue; the queue deleted from the first circulation link list is linked with a second circulation link list.

Abstract: A communication network includes a plurality of network elements—communicating nodes—that are enabled to request the establishment of connections—flows—among each other, and a plurality of network elements—switches (3)—that support the routing of the flows. The network further includes elements for intercepting requests for flow establishment, at least one calculation module configured to preselect for each flow a set of possible network paths that are compliant with the flow's performance requirements and/or quality constraints, wherein each path includes a specific set of switches the flow has to traverse, and at least one selection module configured to apply a selection algorithm that analyzes the load of switches that are contained in any network path of the preselected set of network paths for determining a single network path from the preselected set of network paths that is most suitable in terms of energy efficiency.

Abstract: A session bundle allocation capability enables dynamic allocation of bundles of sessions being handled by a network element to modules of the network element (e.g., modules such as processing modules configured to perform one or more of traffic processing, traffic switching, and like functions). A bundle of sessions may be allocated by associating a plurality of sessions to form thereby a bundle of sessions, and assigning the bundle of sessions to a processing module group including one or more processing modules configured for processing traffic for the sessions of the bundle of sessions. A bundle of sessions may have a bundle identifier associated therewith and may be migrated from a first processing module group to a second processing module group by changing a mapping of the bundle identifier from being associated with the first processing module group to being associated with the second processing module group.

Abstract: A network coordinator can assign an association identifier (AID) and/or a group identifier (GID) to identify a client station to which a packet is to be transmitted and to enable the client station to determine whether to receive an incoming packet. The network coordinator can randomly generate a base AID that is representative of the network coordinator and can assign at least one AID to client stations to minimize the probability of client stations associated with proximate network coordinators being assigned the same AIDs. The network coordinator can also randomly assign at least one GID to a group of client stations to minimize the probability of groups of client stations associated with the proximate network coordinators being assigned the same GID. The client station can analyze indications of a received AID and/or received GID to determine whether to receive the packet or whether to switch to an inactive power state.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for channel scanning. In one aspect, a method includes, while maintaining an association with a first access point on a first channel during first, second, and third consecutive time slices: (i) monitoring, by a client device, a single second channel during the first time slice and the third time slice, and (ii) monitoring, by the client device, the first channel during the second time slice; receiving a beacon from a second access point during the first time slice or the third time slice; and determining a property of the client device or the second access point using the beacon, without using the beacon to determine whether to establish an association with the second access point.