Abstract: Apparatus and systems, as well as methods and articles, may operate to conduct radio measurement request and response operations between two stations to determine receive channel power indicator values associated with direct and indirect wireless links, and to select one of the links for use by the stations based on estimated link capacities.

Abstract: A virtual network has a plurality of nodes. Each node has the capability to provide a service to another node. Each node maintains a list for storing entries each representing a link to another node; each entry contains the address of the other node and a label identifying a service that that other node may provide. Each node also has a store for storing messages received from other nodes, these messages serving to propose a link and containing the identity of the node originating the message, a label identifying a service that that other node may provide and a label identifying a service that that other node requires. When a node needs a service that it is not itself able to provide, it searches the link list for a link having a label that matches the service needed, and in the event that such a link is found it transmits to the node identified by the link a message requesting the service.

Abstract: Methods, devices and computer program products for facilitating the selection of a sourcing peer in peer-to-peer (P2P) streaming environment are disclosed. These methods allow peers to select candidate source peers in an informed manner with low overhead and minimized complexity. These and other features are accomplished by signalling detailed information regarding the buffer contents to one or more requesting peers. This information includes the presence or absence of requested content segments and a listing of gaps in the requested content segments, which allow the requesting peers to select an appropriate sourcing peer. The selection of a sourcing peer is also effected by considering network connectivity and/or network congestion status between the sourcing and the requesting peers.

Abstract: Disclosed are, inter alia, methods, apparatus, data structures, computer-readable medium, mechanisms, and means for withdrawing routes based on a tag. One implementation receives one or more messages identifying multiple routes and a tag associated with the multiple routes. A routing database is updated to include the routes. A particular message associated with a route withdraw operation is received, with the particular message including an indication of the tag. The multiple routes are removed from the routing database in response to receiving the tag. For example, the tag may be a Border Gateway Protocol attribute, a Border Gateway Protocol communities attribute, or some other indication. When some devices do not support this feature, before other nodes will typically send to a particular device a message to withdraw multiple routes based on a tag, the particular device must first advertise that it has this capability and/or it will withdraw multiple routes based on a tag.

Abstract: A device provides layer two (L2) services between customer networks that are coupled by one or more intermediate computer networks. The device comprises a routing process that receives label information for a label switched path (LSP) through the intermediate networks. The device further comprises a L2 service that receives L2 service information from a device associated with second customer networks. In accordance with the label information, the device transports L2 communications between the first and second customer networks through the one or more intermediate networks. By utilizing label information in this manner, the device may minimize the impact of providing L2 services through the intermediate networks.

Abstract: In an information delivery system including a plurality of node devices mutually communicable through a network, transfer destination node information is respectively memorized in the node devices, and at least one piece of delivery information is distributed and stored therein, and a registration message including storage source node information indicative of one node device storing the delivery information is sent out and transferred to a node device for managing delivery information location through relay node devices in accordance with the transfer destination node information, and the storage source node information is memorized in the relay node devices and the node device for managing delivery information location, wherein the relay node device includes: a memory means; a node information change detection means; a storage source node information extraction means; a reregistration message generation means for generating a reregistration message including the storage source node information; and a rer

Abstract: A method of creating a tunnel for transporting at least one data flow in a label-switched telecommunication network, the telecommunication network comprising at least one ingress edge router, a server able to define tunnels, called static tunnels, in the telecommunication network based on traffic forecasts in the telecommunication network. The method includes the steps, performed by an ingress edge router receiving an admission request from a client to transfer a data flow in the telecommunication network, of determining whether a static tunnel defined by the server in the telecommunication network is able to transport the data flow, creating a tunnel, called dynamic tunnel, able to transport the data flow in the telecommunication network if no static tunnel defined by the server is able to transport the data flow.

Abstract: Methods, edge routers and an edge-router-refresh network signalling message used to update state information in edge routers. A data session is established on a path from a source towards a destination connected from the source via a plurality of Autonomous Systems (AS). The edge-router-refresh network signalling message is created by an edge router acting an an ingress edge router. The edge-router-refresh network signalling message comprises an identifier of the data session, an identifier of the edge router, which issued the edge-router-refresh message and an indication that the edge-router-refresh message is meant to be used by the edge routers present on the modified path. Optionally, the edge-router-refresh network signalling message further comprises a list of the plurality of AS traversed by the path before the modification.

Abstract: In an example embodiment, a method for determining backhaul channel assignments for multi-channel dual radio mesh nodes. The method comprises acquiring collision domain data for each access point of an associated mesh network. A cost function is calculated for each access point of the associated mesh network, the cost function assigning a weighted value for each access point in a collision domain based on a number of access points in the collision domain. Backhaul channel assignments for selected for each access point that minimizes the cost function.

Abstract: Systems and methods are described for supporting routing intelligence for evaluating routing paths based on performance measurements. The routing intelligence may include processes executed in a self-contained device. This device may control one or more edge routers, based on performance data from end users. In other embodiments, the routing intelligence device may be used solely to monitor one or more edge routers, producing reports but not effecting any changes to routing. Routing decisions may be injected to the edge routers via BGP updates. The devices may be stationed at the premises of a multihomed organization, such as an enterprise, ISP, government organization, university, or other organization supporting a sub-network coupled to an internetwork. In other embodiments, the routing intelligence comprises processes executed on a router.

Abstract: A robot server for controlling a robot, a system for providing content having the same, and a method thereof are provided. The robot server communicating with the robot includes a virtual robot object and a virtual robot object manager. The robot server executes commands that are generated in correspondence to the robot and received from the robot, and controls the robot. The virtual robot object manager generates the virtual robot object corresponding to the robot and activates the virtual robot object when connected to the robot.

Abstract: A method and apparatus for maintaining routing information in a Peer-to-Peer (P2P) network are provided. The method includes that: a super maintenance node receives routing update information of an ordinary node in its home area; the super maintenance node sends routing update information to super maintenance nodes in other network areas; the super maintenance nodes in other network areas notify ordinary nodes in their home network areas to update routing information. With the present invention, a node of strong processing capabilities at the network area border is chosen to act as a super maintenance node and other nodes as ordinary nodes; when a node joins or fails, an ordinary node sends detected routing update information only to the super maintenance node in the local network area; the super maintenance node then forwards the update information to super maintenance nodes in other network areas.

Abstract: Session initiation protocol (SIP) control traffic routing decisions, such as rapid failure detection and recovery mechanisms, are based on detection of events and/or conditions that may result in suboptimal performance. The disclosed approach ensures that the SIP traffic is routed or rerouted on an optimal basis. Sample inputs to the SIP routing decisions, include integration with BFD, system metrics and other criteria to determine network and systems conditions, for dynamic decisions on where to optimally route SIP traffic. Examples leverage the B2BUA model, which maintains call state and participates in call processing, however, the examples introduce an improved routing model that is able to not only reroute SIP traffic based on failures but also upon the detection of other suboptimal conditions, e.g. excessive cost. The exemplary techniques provide significant savings by ensuring SIP peering decisions are automatically performed considering costs of peering arrangements, congestion and/or other criteria.

Abstract: The present invention discloses a method and apparatus for providing decentralized load sharing, e.g., providing a protocol that can be used to address load balancing without the need of a central proxy device. Specifically, in one embodiment, the present invention addresses the decentralized load sharing problem, by allowing a group of servers to detect when more than one server attempts to process the same “work request” from a client. To address the potential conflict, each server will implement a back-off strategy for negotiating which server will actually process the work request.

Abstract: A method and system for providing a network protocol for utility services are disclosed are disclosed. In one embodiment, a computer-implemented method comprises discovering a utility network, wherein a constant powered meter sends network discovery messages to find the utility network. Neighboring meters are discovered, wherein the constant powered meter sends hello messages periodically. The constant powered meter is registered with the utility network. Further, the battery powered meter finds and associates itself with a constant powered meter. The constant powered meter also registers its associate battery powered meter with the utility network. The constant powered meter sends a node registration message to the gateway of the utility network. The constant powered meter can sense outage problems with the gateway and the neighbors of its network, and search and migrate to an alternate network.

Abstract: A system and method for serverless distributed monitoring anomaly detection for a service oriented architecture is provided. The method includes selecting a number of nodes, e.g. super peers, to form an overlay network which is configured to facilitate bidirectional information flow creating a peer-to-peer monitoring framework through replication chains. The method continues with mapping the overlay network to data by assigning each of the selected nodes to a data region related to its surroundings. The method continues with distributing the data regions among the nodes via the aforementioned replication chain, where each replication chain is sensitive to the type of application that requests data duplication in monitoring the data by collecting information from each of those nodes that correspond to an assigned or distributed data region. This method may also include taking corrective action if the node detects an anomaly.

Abstract: Embodiments of a peer-to-peer-based content sharing/distribution network (CDN). In embodiments, some peers are content publishers while other peers are content consumers. When a consumer peer gets content from a content publisher, the consumer peer may become a content publisher that may be accessed by other peers. If a peer desires a particular content, the peer may get the content from a nearby content publisher, saving access to a central server. The more a content is in demand, the more likely it is to be replicated, and hence more likely to be found by consumer peers on nearby content publisher peers. If a content publisher peer does not have all of a requested content, the requesting peer may be redirected to another content publisher peer to obtain the missing content. Embodiments may be implemented in peer-to-peer networks implemented according to a peer-to-peer platform.

Abstract: A contention-based network which allows real-time traffic to exist as multiple independent linked-list chains or under certain conditions to be assembled into multiple linked-list chains. A time separation is enforced between the various multiple chains, which are limited to a predetermined maximum number of stations that each can have in order to allow non-real-time stations to obtain timely access to the medium. Ones of the multiple chains may also be joined into a single chain. Blackburst contention is used to enable a chain to be reconstituted robustly from non-anticipated interruptions, such as the failure of one of its stations.

Abstract: A method, and corresponding system, for managing a service delivery network. The method includes steps to add a service to the network including receiving a request for a new service, such as a service provided by a service application. The request is processed to identify resources within the service delivery network for providing the new service including a host for running the service application. A container is provided on the host and is configured to encapsulate the service application. The method continues with establishing membership of the container in a virtual local access network, which includes configuring the container for data packet communications utilizing VLAN tagging.

Abstract: A method and system for aggregating configuration information from friend devices is provided. The aggregation system attempts to foil attacks on the privacy of data contributed to a request by aggregating data from a cluster of friend devices in such a way that it is difficult for a device in the cluster and an attacking device outside the cluster to determine the contribution of an individual device to the data. The aggregation system of an initiator device may also determine the cardinality of a parameter so that the corresponding parameter vector can have a size large enough to support the number of possible values. The aggregation system determines the cardinality by counting nonzero hash values of the actual values that are provided by the devices.

Abstract: A system and method that provides dynamic network policy management. The system enables a network administrator to regulate usage of network services upon initiation of and throughout network sessions. The system employs a method of identifying selectable characteristics of attached functions to establish static and dynamic policies, which policies may be amended before, during and after any session throughout the network based on the monitored detection of any of a number of specified triggering events or activities. Particular policies associated with a particular identified attached function in prior sessions may be cached or saved and employed in subsequent sessions to provide network usage permissions more rapidly in such subsequent sessions. The cached or saved policy information may also be used to identify network usage, control, and security. The system and method of the present invention provides static and dynamic policy allocation for network usage provisioning.

Abstract: A system that associates physical locations with network-linked devices in a network to which such devices are connected. This system employs a variety of techniques for establishing device location. The system configuration can vary and can include any type of data network, including LANs, MANs, Wide Area Networks (WANs), Personal Area Networks (PANs), and Home Networks. The system provides location information for particular devices to the network devices and management, and may be used in any of a variety of ways to improve configuration accuracy, control, and security. The location information may also be used to control or secure a device itself.

Abstract: Routing in a peer-to-peer network is described. In an implementation, a method includes receiving at one of a plurality of nodes in a peer-to-peer network, an indication of a change in membership in the peer-to-peer network by another node in the peer-to-peer network. A report is broadcast that describes the change. The report is for receipt by each node referenced in a routing table included in the one node.

Abstract: The present invention extends to methods, systems, and computer program products for broadcasting communication within a rendezvous federation. Embodiments of the invention include inter-ring and intra-ring communication. Inter-ring communication includes sending a message to destination rings included in a node's Collateral Ring Set entry table. When a node identifies a destination ring that has not yet received a message, the node can send a ring notification message. The ring notification message propagates towards a publishing node until a responsible node in the message path to the publishing node is identified. The responsible node updates its entry table to include the ring and forwards the message to the destination ring. Intra-ring communication can include recursively partitioning ranges of nodes within a ring and forwarding the message to nodes included the partitioned ranges.

Abstract: A method includes receiving a media signal at an interface device in communication with and disposed between an Internet Protocol private branch exchange (IP-PBX) and a first endpoint. The media signal is associated with the first endpoint and is associated with a session established between the first endpoint and a second endpoint within a session over internet protocol network. The session is established at least in part by the IP-PBX based on a session control signal received at the interface device from the first endpoint and sent from the interface device to the IP-PBX. The method also includes modifying the media signal at the interface device based on a per-device service associated with at least one of the first endpoint or the second endpoint.

Abstract: Methods and apparatus for relaying data in a peer-to-peer network.

Abstract: One routing device which connects plural networks on which a plurality of other routing devices, including a parent router, are connected. The parent router manages network identification data to identify the plural networks. Master router data is included for each corresponding other routing device. Master router data includes master router identification data identifying whether the corresponding other routing device is a “master router” located on a path to the parent router or a “slave router” which is a routing device other than the master router, and includes network identification data identifying a network to which the corresponding other routing device connects. Upon startup of the one routing device, the master router data is acquired from the other routing devices on the networks to which the one routing device connects. It is determined whether a router function of the one routing device is enabled based on the acquired master router data.

Abstract: The present invention is directed to a method and system for use on a computer for the automated generation of commands or other data to populate tables of a database. The automated generation process of the present invention entails separating business logic from device specific logic, defining the organization of incoming data, identifying and setting default data parameters, defining the format for the output data, and implementing the command generating object oriented classes in program source code, to generate device specific commands.

Abstract: A telephony application host has a web service environment and a telephony application proxy. The web service environment is adapted to host one or more instances of a telephony application. The telephony application proxy is adapted to receive telephony messages associated with the one or more instances of the telephony application and to proxy each received telephony message into a web request. The telephony application is adapted to process the web request within the web service environment.

Abstract: A method and system for communicating information in a cooperative relay network of wireless nodes. The wireless nodes including a source, a set of relays, and a destination. Channel state information for each channel between a particular relay of the set of relays and the destination is estimated. A subset of the relays is selected based on the channel state information. The channel state information is fed back to the subset of relays. The source node can then broadcasting data packets from the source to the subset of relays, and the subset of relays forward coherently the data packets from the subset of relays to the destination using beamforming based on the channel state information, while adjusting power to minimize a total energy consumption in the network.

Abstract: A method and system for improving control of an instant messaging system. Multiple instant message (IM) instances are initiated with identical credentials of a user of multiple users participating in an IM session controlled by an IM server. A front-of-screen representation enables the user to manage instance attributes and allows any user to view conversational connectivity information. The IM server receives the user's selection of a graphical element that represents a remote IM instance of the multiple IM instances. Via the first IM instance, the IM server receives the user's request for a computing device to perform an action that includes an interaction with the remote IM instance. The computing device performing the action is located remotely from the user and is executing the remote IM instance. The action is performed by controlling a remote system function of the computing device.

Abstract: A system and method related to efficiently searching for an object in a network including a plurality of realms, e.g., a plurality of local area networks (LANs). The method may ensure that nodes within a LAN are able to locate objects within that LAN using only computing resources on the local LAN. Thus, expensive WAN transfers may be avoided where possible. The system may also scale to many nodes. Nodes may not be required to know about every other node in the system. Mechanisms for re-distributing object location information among nodes as nodes are added to and removed from the system are also described.

Abstract: Systems, methods, devices and techniques can be used in networks including resilient packet ring networks and other types of ring topology networks to adjust the flow of data traffic to MAC clients associated with stations on the network. In one example, adjusted fairness rates and/or messages associated with a network communication protocol are used to reduce traffic destined for a particular station and/or a MAC client associated with that station. In another example, station MAC clients or other components implement virtual destination queues and transmit information associated with the rate at which they receive data. The information and queues are used to reduce traffic destined for a particular station and/or a MAC client associated with that station.

Abstract: A structured peer-to-peer overlay performs a key-based routing (KBR) that achieves a strong routing consistency guarantee as well as reasonable scalability. The key space of the structured overlay is partitioned into zones, each separately managed by a group membership service that provides total ordering of membership query and change actions. The strongly consistent KBR has two phases: first, a key value is routed to a contact node in its zone via a weakly consistent KBR protocol; and then performing a lookup of the destination node for the key value by the contact node using the group membership service of the zone. By appropriately tuning the zone size, the strongly consistent KBR balances the trade-off between scalability and routing liveness. The KBR can maintain this balance by merging and splitting zones to account for system chum and scale changes.

Abstract: A channel merging method for a VOD system, said method comprises the steps of: in response to requests from a plurality of clients for a video program, establishing a root channel (S1) and at least one sub-channel (S11), said root channel (S1) being established according to a request from a client that makes the earliest request, each of said sub-channels (S11) being established in response to a request from a client that makes a later request; and monitoring variation of the number of the clients that are using each of said established channels, and maintaining the channel if the number of the clients using the monitored channel is not zero, and closing the channel if the number of the clients using the monitored channel becomes zero.

Abstract: The invention comprises an overlay network that can be under full control of a service provider. Routing of packets between nodes in said overlay network is performed by means of an underlying large communication network. The nodes in the overlay network comprises specific nodes in the large communication network. Therefore, routing of packets according to the invention is transparent for nodes not belonging to the overlay network. One or more federative nodes manages the routing information. The federative nodes are connected to the network and comprise a computer and software, designed for providing said management of the routing information. The management of routes in the overlay network may of course be distributed over several hosts, for scalability of large overlay networks and reliability reasons. A purpose of the invention is to enable a user organization to control the routing of packets for their overlay network via different external networks.

Abstract: An intelligent network interface card (INIC) or communication processing device (CPD) works with a host computer for data communication. The device provides a fast-path that avoids protocol processing for most messages, greatly accelerating data transfer and offloading time-intensive processing tasks from the host CPU. The host retains a fallback processing capability for messages that do not fit fast-path criteria, with the device providing assistance such as validation even for slow-path messages, and messages being selected for either fast-path or slow-path processing. A context for a connection is defined that allows the device to move data, free of headers, directly to or from a destination or source in the host. The context can be passed back to the host for message processing by the host. The device contains specialized hardware circuits that are much faster at their specific tasks than a general purpose CPU.

Abstract: A data delivery system and method of the present invention according to one embodiment includes establishing connections between computers regardless of NAT, transporting data between computers in a reliable fashion, creating a secure stream of packets from stored or streaming data on a server, organizing a plurality of computers to cooperatively transport secure packet streams, transporting and correcting secure packet streams in a cooperative environment, and rendering the original stored or streaming data from a secure packet stream thereby reducing demand on the server.

Abstract: A resource unit has a request interface to allow the unit to receive a request and associated data. The resource unit also has a hashing engine to create a hash of the associated data, a modulo engine to create a modulus result, a read engine to perform a memory read, and a results interface to allow the device to return results.

Abstract: Methods of controlling media server resources in a VoIP network are disclosed. In an embodiment, an IP node provides a service request. An application server receives the service request and sends a request for media server resources to a media server resource broker. The media server resource broker determines that the request should be handled by a first media server. The media server resource broker queries the first media server to obtain an IP address and port number for use in establishing a call between the IP node and the first media server. The media server resource broker then provides a signal to the IP Node so that it can establishing the call with the appropriate port on the media server. In an embodiment, the media server resource broker updates a database module that tracks assignment levels of the first media server so as to reflect the most recent request, thus decreasing the number of ports available for the first media server.

Abstract: Methods and apparatuses for distributing network address translation. By having a gateway inform inside devices of global addresses, the gateway can avoid performing many functions of a traditional NAT box. Specifically, an inside device is informed of a global address shared by all devices on the inside device's network segment. Each device on that segment would be assigned a range of ports to distinguish messages from separate devices that use the same global address.

Abstract: A method for processing network traffic data includes receiving a packet, and determining whether the packet is a previously dropped packet that is being retransmitted. A method for processing network traffic content includes receiving a plurality of headers, the plurality of headers having respective first field values, and determining whether the first field values of the respective headers form a first prescribed pattern. A method for processing network traffic content includes receiving a plurality of packets, and determining an existence of a flooding attack without tracking each of the plurality of packets with a SYN bit.

Abstract: Disclosed is a technique for data synchronization. A first identifier for a portion of data on a primary volume is determined, wherein a unique identifier is associated with each portion of data at the primary volume. A second identifier for a portion of corresponding data at a secondary volume is determined, wherein a unique identifier is associated with each portion of data at the secondary volume. The first and second identifiers are compared. When the first and second identifiers do not match, the portion of corresponding data at the secondary volume in a storage device is replaced with the portion of data at the primary volume.

Abstract: Improved systems and methods for implementing data-driven protocols are provided. In one embodiment, improved implementations of multicast routing protocols are provided. Separation between multicast forwarding and control elements are provided by use of a powerful yet simple application program interface (API) for inter-module communication. The API is multicast-routing-protocol-independent and can be used to express the forwarding state of any existing multicast protocol. Efficient platform-specific implementations are facilitated.

Abstract: Computers on a local computer network, such as a home network or a small business network, are formed into a secured network group that provides common user access control and enables resource sharing among the computers in the group. A computer on the local network discovers whether there are secured network groups existing on the local network. If one secured network group is found, the computer indicates to a second computer in the group its desire to join the group, and establishes trust with that computer, such as by entering a proper user name and password, or a secret identification number. Once the trust is established, the first computer joins the group. Within the secured network group, user accounts and user profiles are replicated to each of the computers in the group. The establishment of trust and the replication of user accounts and profiles among the computers in the group enable the implementation of security policies and user access control in a group-wide manner.

Abstract: Systems and methods for transmitting data across a firewall are described. A representative method includes: receiving a request to transmit data to a destination; searching for a firewall associated with the destination, the firewall being configured to prohibit communication to the destination via a primary communication protocol and allow communication to the destination via a secondary communication protocol. If the firewall is detected, automatically configuring the data for communication with the secondary communication protocol; and transmitting the data to the destination by utilizing the secondary communication protocol. Other devices and programs are disclosed.

Abstract: A method for receiving messages containing data conveyed over a network, using a network adapter coupled to a computing device having a system memory associated therewith. At least one queue of descriptors is generated in the system memory, each such descriptor indicating a disposition of the data contained in the messages to be received over the network. At least one of the descriptors is prefetched from the at least one queue in the system memory to a cache memory in the network adapter. When one of the messages is received at the network adapter, the adapter processes the at least one of the received messages so as to cause the data contained therein to be distributed in accordance with the at least one prefetched descriptor in the cache memory.

Abstract: Methods and apparatus for implementing peer-to-peer relay. In one implementation, a peer-to-peer relay network includes: a plurality of N peer systems; wherein each peer system is connected to a number of other peer systems that is less than or equal to a connection limit, said connection limit is greater than or equal to 2, said connection limit is less than or equal to N?2, and each peer system is configured to relay data to peer systems connected to that peer system according to a set of one or more relay rules.

Abstract: A virtual ring representing a community of interest is constructed from an interconnected mesh of nodes in a packet network. The virtual ring instantiates ring labels in respective forwarding tables for each node in the virtual ring and then advertises the ring labels to all other nodes in the virtual ring, for example by flooding BGP advertisements. Data packets entering the ring are assigned a ring label which is then stripped off when exiting the ring. The data packets are forwarded around the virtual ring using the ring labels. The virtual ring can operate using BGP/LDP Multi Protocol Label Switching (MPLS). Multiple virtual rings can be bridged together using a central hub or alternatively multiple virtual rings can be redundantly bridged together using tandem hubs.

Abstract: Methods and apparatuses for distributing network address translation. By having a gateway inform inside devices of global addresses, the gateway can avoid performing many functions of a traditional NAT box. Specifically, an inside device is informed of a global address shared by all devices on the inside device's network segment. Each device on that segment would be assigned a range of ports to distinguish messages from separate devices that use the same global address.