Abstract: A signalling gateway for connecting a first network to a second network, the signalling gateway being operable to, receive a signalling message from the first network, the message comprising destination information, read the destination information and, where the destination information corresponds to a predetermined value, forward the message to one of a first entity on the first network and a second entity on the second network in accordance with a distribution rule.

Abstract: Topology-centric resource management for large scale service clusters is described herein. According to certain embodiments of the invention, techniques include 1) creating optimized topology with network switches to connect service modules based on application flows and bandwidth requirements, 2) providing centralized or decentralized monitoring schemes to maintain the topology view of a service cluster, and 3) using the topology information for optimizing load balancing and service information dissemination. Other methods and apparatuses are also described.

Abstract: Methods and systems for targeted data delivery are described. A user profile that includes information about a user is accessed. A root hash of a hash-based directed acyclic graph (HDAG) is computed. The HDAG includes hashed values of items of information in the user profile. The root hash is used in proving that the user profile satisfies selection criteria associated with an offer to deliver data. The user is eligible to be presented with the offer of data provided the user profile satisfies the selection criteria. The data is targeted to the user based on the user profile without requiring a release of any of the information in the user profile.

Abstract: The invention allows routing data packets from a multihomed host. A default gateway is associated with each of network addresses associated with the multihomed host. One of the associated network addresses is assigned to a data packet to be sent from the multihomed host as its source address. A routing table of the multihomed host is searched for a route matching a destination address of the data packet. It is determined, in response to one of no route found and the found route being a default route of the routing table, which of the default gateways is associated with the assigned source address, and the data packet is dispatched to this determined default gateway.

Abstract: A method and apparatus is described that allow the creation of virtual routing domains in an IP network. These virtual routing domains allow individual networks to be configures so that it appears that its routing domain covers the entire IP address space. A network processing system is used to implement the virtual routing domains and to allow network traffic to cross the individual routing domains. The network processing system is able to use application layer information to allow the crossing of virtual routing domain boundaries. By examining application layer information the network processing system is able to look up customer/user information and use that information to determine destination virtual routing domains and route otherwise unroutable addresses between domains.

Abstract: An adaptive modulation and coding (AMC) method for data transmission by various modulation orders and coding rates is provided. A signal-to-noise ratio (SNR) of a transmission channel is estimated. Quality of service (QOS) parameters are provided, defining maximum allowable delay and packet error rate (PER). A retransmission limit is determined from the maximum allowable delay. An optimum packet length is determined based on the QOS parameters and the SNR. A modulation order and a coding rate most suitable for the estimated SNR and the defined PER are selected based on the optimum packet length and the retransmission limit.

Abstract: The present invention provides improved unicast routing, multicast routing and unicast load sharing as compared with conventional methods. Preferred implementations of the invention provide improvements to IEEE 802.1Q. According to preferred aspects of the invention, each bridge is the root of its own multiple spanning tree instance (“MSTI”). Preferred implementations of the invention require no learning of media access control (“MAC”) addresses on the backbone of a network. Some methods of the invention can resolve spanning tree asymmetries. Preferred implementations of the invention require a very low computational load for control protocols.

Abstract: A communication system including a first and second user equipment in communication over a shared floor and a server means for managing the shared floor. According to the system, the server means is arranged to detect an anonymity request from the first user equipment and, responsive to the anonymity request, to prevent the second user equipment from identifying the first user equipment from user plane messages transmitted from the first user equipment to the second user equipment.

Abstract: The invention includes methods for converting between a plurality of unicast sessions and a multicast session. A method for converting from unicast sessions to a multicast session includes receiving a request for establishing a unicast session for delivering content to a first client device, generating a multicast session establishment message adapted for establishing a multicast session with the client device for delivering the content to the client device, and generating at least one multicast session join message for the other client devices, the at least one multicast session join message adapted for enabling the other client devices to join the multicast session. The multicast session establishment message is generated using a threshold number of unicast sessions. A method for converting from a multicast session to a unicast session is provided. A method for converting from a plurality of unicast sessions to a plurality of multicast sessions is provided.

Abstract: Validation of various portions of received data, including validating a cut-through checksum found in a received data packet. The cut-through checksum is based on data found in a packet header, and thus can be validated before the entire packet is received. This feature allows processing of the received data to begin before the entire packet has been received. Many embodiments will also receive a checksum that is based on the entire packet.

Abstract: A communication device, such as a telephone or a personal computer, controls one or more remotely controlled devices solely over a signaling path, without necessarily establishing an audio path, thus eliminating the need for the remotely controlled device, or its controller, to include DTMF detection hardware or software or an RTP stack. The communication device can include authentication information, which the communication device uses to authenticate itself to the remotely controlled device, so a user of the communication device can remotely control the device without necessarily entering additional authentication information, such as a passcode. The remotely controlled device (or a controller that controls the device) can register with an element that detects user interactions, such as keypad button presses, with the communication device. The registration can identify one or more patterns of user input.

Abstract: Packet classification and routing in a data communication network with static routing procedure, wherein the routing is performed without using a routing table. First values for each common address bit of end service points adjacent to a switch as a response to a local subnet mask of the switch are defined. Then the packet flows from the current switch to the adjacent switches are forwarded in response to a value of differentiation bits. Unprocessed packets are forwarded to the main adjacent switch according to the main adjacent switch definition. Unforwarded are processed packets locally as exceptions.

Abstract: Multiplexing data from bitstreams is described. Data status is determined for data of each of the bitstreams. Stream numbers are assigned respectively to the bitstreams, and the data of each of the bitstreams is controllably stored in respective memory. A memory buffer of the memory buffers is controllably selected. The data obtained from the memory buffer selected is parsed to provide an output. The controllably selecting and the parsing are repeated to obtain and parse the data stored in at least one other memory buffer of the memory buffers to provide the output. The output is multiplexed data from the bitstreams respectively associated with the memory buffer and the at least one other memory buffer.

Abstract: The present invention relates to an access unit for coupling a plurality of subscribers to a data communication network, and comprising an auto-configuration control unit adapted to learn, from first auto-configuration data issued by an auto-configuration server and transiting through said access unit towards a particular subscriber coupled to said access unit, a particular network address as being dynamically assigned to said particular subscriber.

Abstract: Efficient interface scheduling that maintains fairness among the scheduled interfaces and remains efficient even when scheduling large numbers of interfaces and even when implemented in software. Systems for scheduling interfaces through a physical port are provided that utilize a bit-mask. Each bit-mask has a bit-mask-level-1 having a plurality of bits, each bit in the bit-mask-level-1 represents a unit of bandwidth with the total number of bits in the bit-mask-level-1 representing the port's line speed, each bit in a bit-mask-level-1 is associated with an interface, and the number of bits associated with each interface determines the bandwidth for that interface. Methods of scheduling interfaces are provided that utilize one or more bit-masks to determine an order in which interfaces are scheduled. The present invention can efficiently implement versions of the dual-token-bucket algorithm.

Abstract: Provided is a method of segmenting a packet using a tree structure in order to reduce headers in the packet when the packet is transmitted or received in a wireless communication system using an adaptive modulation and coding (AMC), and a method of transmitting/receiving a packet using the same. The method includes the steps of: determining whether a transmitting processing data unit (PDU) is a retransmitted PDU; determining whether a size of the retransmitted PDU is a transmittable size allowed by a corresponding adaptive modulation and coding (AMC) option if the transmitting PDU is the retransmitted PDU; and segmenting the retransmitting PDU, inserting a header and a sub header with identification information for reassembling into each of the segmented PDUs and transmitting the segmented PDUs.

Abstract: A method and packet filtering system that accelerates the packet classification problem is made. Using spectral analysis of rules and using real time spectral analysis of packets, it is possible to determine very quickly that a packet does not match any of the possible rules that have been defined. That is to say, using the packet filtering of the invention, there is no possibility of a false negative decision; when a packet is determined not to match any rule, the work of a packet classifier is complete. This method and system are also capable, with a high degree of accuracy, of determining that the packet has matched one of the defined rules, so that the packet may be then directed to a packet classifier to determine the specific rule it matches.

Abstract: A technique is disclosed for managing load balancing operations in a storage area network. A frame is received at a switch in the fibre channel fabric. According to a specific implementation, the frame includes header information including a source device identity and a destination device identity. Zone and/or flow information relating to the identity of the zone/flow which is associated with the frame is identified. Using the identified information, a load balancing mechanism to be used for handling the frame is selected. According to a specific implementation, the selection of the load balancing mechanism is based at least in part upon the identity of the zone and/or flow which is associated with the frame.

Abstract: A method is provided for ensuring that specific traffic flows are adequately prioritized in a public packet communication network even when the network is heavily congested. Per-flow QoS capability is added to VPN tunnels. Connection requests are routed through a specific port in an access provider's network to designated VPN gateway. Deep packet inspection is performed on traffic through the port in an attempt to determine whether the connection request was accepted. If the connection request was accepted, the traffic flows associated with that session may be given a specific priority of QoS level when transiting a packet access network.

Abstract: Multiple peer groups for performing computing, communication, and/or storage tasks. A method may be performed for example, in a computing environment including one or more agents networked together. The method includes providing data to the agents using two or more distinct peer groups. The peer groups include members from among the agents. The method further includes performing at each of the peer groups operations on the data. Each peer group is configured to perform a specific operation. The method also includes coordinating the operations at each of the peer groups such that a common computing, communication and/or storage task is accomplished by aggregating the operations at each of the peer groups.