Abstract: A method for transmitting acknowledgement (ACK)/non-acknowledgement (NACK) in a wireless communication system employing a relay station is provided. The method includes receiving data, and transmitting an ACK/NACK for the data according to a specific rule when the ACK/NACK cannot be transmitted in the synchronous ACK/NACK transmission rule. It is possible to solve a problem caused by ACK/NACK transmission between a base station and a relay station.

Abstract: A method and an apparatus for controlling transmitter power of a femto base station in a broadband wireless communication system are provided. In the method, a femto base station receives a signal having an intensity of a threshold or more from UE and transmits a message reporting power-on of a transmitter to a femto base station controller. The UE transmits a message reporting downlink signal measurement results of femto base stations to the femto base station controller via a macro base station. The femto base station controller determines a femto base station which becomes a handover target of the UE using report messages of the femto base stations and the UE. The femto base station controller transmits a handover procedure start message to the macro base station and the determined femto base station.

Abstract: The present invention extends to methods, systems, and computer program products for adaptive electronic message scanning. Embodiments of the invention relate to dynamically (and potentially unpredictably) varying the depth/thoroughness of classifying electronic messages to protect against undesirable message content (e.g., SPAM, viruses, digital leakage, etc.). A minimum effectiveness is maintained and, when available resources permit, can be exceeded to provide increased protection. An optimal subset of available message classification rules can be selected on a per message basis. The selection of rules is based on available system resources, minimum desired effectiveness (e.g., defined in a Service Level Agreement (“SLA”)), and rule characteristics. Feedback loops can be used to optimize selected classification rule subsets.

Abstract: A method and an apparatus for providing multi-homing to an aggregate endpoint device over a network are disclosed. In one embodiment, the method receives a session request directed towards a user endpoint device by a routing device. The method receives at least one Public User Identity (PUID) for the user endpoint device if the session request is for a subscriber of a service with multi-homing via an aggregate endpoint device. The method selects a route for sending the session request in accordance with the at least one PUID and a route priority information of the PUID associated with the user end point device, wherein the route with a highest priority is selected, and forwards the session request via the selected route.

Abstract: A network device may include a lawful interception module, a routing module, and a multicast distribution table. The lawful interception module may receive a lawful interception request for a subscriber, may inform the routing module about the subscriber, and may provide, to the routing module, a tap interface corresponding to the subscriber. The routing module may receive a multicast join request from the subscriber, and may insert, when the multicast join request is received, the tap interface in the multicast distribution table, as a forwarding interface.

Abstract: In accordance with embodiments of the present disclosure, a switch may include a processor and a plurality of line cards, each line card including a table of addresses. The processor may be configured to: (i) read, from a first line card of the plurality of line cards, addresses relating to all flooding domains present on the first line card; (ii) store the addresses read from the first line card on a memory accessible to the processor; (iii) determine a second line card of the plurality of line cards, the second line card having the presence of at least one flooding domain not present on the first line card; (iv) read, from the second line card, addresses relating to all flooding domains present on the second line card; and (v) store the addresses read from the second line card on the memory.

Abstract: A method of controlling traffic flow through a service node located within a packet network, which traffic flow originates at a plurality of sending nodes and is destined for a receiving node. The service node is one of a multiplicity of service nodes configured in a tree or other acyclic structure, e.g. of an overlay network. The method comprises receiving a challenge from said receiving node or a downstream service node, generating and caching a further challenge, and combining that further challenge with the received challenges to generate a modified challenge. The modified challenge is then sent to a sending node or to an upstream service node. Subsequently, a request is received, destined for said receiving node and originating at a sending node. A solution accompanying said request is validated using the cached further challenge, and the request forwarded towards said receiving node only if the solution is valid. Otherwise, the request is dropped.

Abstract: The present invention relates to configuration procedures and transmission of a ranging channel for a synchronization of an uplink of user equipment and a relay station in a communication system which supports a relay, in that the configuration of the ranging channel for acquiring an uplink synchronization may vary in accordance with a variety of frame structures, thereby reducing uplink interferences and performing an uplink synchronization in a stable and quick manner.

Abstract: A method and apparatus to shape packet traffic rates of packets in-transit from a plurality of channels to a port, monitor a status of each queue, subtract a CIR from a port load value when an empty queue becomes active, add the CIR to the port load value when an active queue becomes empty, add a difference between an EIR and the CIR for a channel to a port excess value when a queue of the channel becomes excess, subtract the difference for the channel from the port excess value when the excess queue for the channel becomes not excess, calculate an oversubscription ratio based on the port load value and port excess value, calculate a shaping rate for each of the plurality of channels, and shape the traffic for each of the plurality channels using the shaping rate.

Abstract: An Apparatus and methods for communicating in a wireless access system using a medium access control protocol data unit (MAC PDU) is disclosed.

Abstract: The method for controlling signal transmission includes: determining the first reference variable according to the number of transition points from downlink to uplink in a wireless frame of the system and the system frame number (S502); determining the second reference variable according to the number of transition points from downlink to uplink in a wireless frame and the time slot number (S504); determining the third reference variable according to the sub-frame offset of the signal (S506); and determining signal transmission times according to the first reference variable, the second reference variable and the third reference variable, so as to control the signal transmission (S508).

Abstract: In one embodiment, an intermediary device situated along a communication path between two endpoint devices may receive communication packets sent along the communication path. If the intermediary device receives a connection-initiating packet having a customization indicator and a connection-acknowledgement packet having a customization indicator, then the intermediary device may install a bypass rule.

Abstract: In one embodiment, network statistics may be monitored for a first directed acyclic graph (DAG) from a first root node, and based on those network statistics, a trigger may be determined to partition the first DAG. As such, a candidate second root node may be selected for each of one or more DAG partitions, and a tunnel may be established between the first root node and the one or more second root nodes. Each second root node may then establish a new DAG partition with itself as the root (and with the same DAG parameters as the first DAG), wherein nodes of the first DAG remain with the first DAG or attach to the new DAG partition based on one or more metrics associated with each respective root (e.g., reachability, cost, DAG rank, etc.).