Abstract: Provided are a routing table generating method, a data transmission method, and a routing route formation method for multi-hop communication in high rate wireless personal networks. In a high rate WPAN environment including a plurality of piconets, a piconet controller (PNC), which performs a topology server function to provide the optimal route, collects link state information from the PNCs or DEVs (devices) belonging to a sub-tree that serves as a root and applies a minimum cost algorithm based on the collected link state information to calculate the optimal route for all pairs of originations and destinations existing within the sub-tree in consideration of QoS. The optimal route information is transmitted to the origination PNC via the destination PNC/DEV. During performing this, the optimal route between the pairs of originations and destinations is set.

Abstract: A method for communication includes simultaneously computing a shortest path and a backup path through a network between a pair of nodes. Packets are routed through the network using at least one path selected from among the shortest path and the backup path.

Abstract: A distributed event detection system for detecting a complex event by a distributed detection process, includes a plurality of broker nodes for routing events and a route node for distributing the complex event, wherein the route node comprises a detection formula decomposing unit which decomposes a complex event detection formula for detecting the complex event into a plurality of complex sub-event detection formulae; a sub-route node assignment unit which assigns a broker node as a sub-route node with respect to each of the complex sub-event detection formulae decomposed by the detection formula decomposing unit; and a complex event detecting unit which detects the complex event based on a complex sub-event detected by the sub-route node assigned by the sub-route node assignment unit.

Abstract: A system and method is provided whereby a client device adaptively optimizes the selection of a network device from a plurality of network devices hosting information desired by the client device. Each of the network devices hosting information desired by the client device is associated with a common host name and a different IP address, and the client selects an optimal network device based on a rank assigned to the one or more network devices. A rank assigned to the optimal network device indicates the greatest desirability, from the client device's perspective, of the optimal network device relative to the other network devices. Furthermore, the ranks assigned to the one or more network devices are adaptively determined based upon a determination of an estimated latency, determined from the client device's perspective, between the client device and the one or more network devices.

Abstract: Methods, systems, and machine readable media are disclosed for managing bandwidth utilization including off-peak, background delivery of content. According to one embodiment, a method of managing bandwidth used for delivering content to a plurality of users can comprise determining one or more destinations for the content and determining available bandwidth for delivering the content to the one or more destinations. A set of criteria can be applied to the content, the one or more destinations for the content, and the available bandwidth. A schedule for delivery of the content can be generated based on applying the set of criteria. The content can be delivered to the one or more destinations based on the schedule.

Abstract: Techniques described herein describe a proxy used in an instant messaging system. The proxy, upon receiving an instant message (IM) from a first mobile device and addressed to a second mobile device, dynamically determines whether, and for how long to store the IM on a local proxy. Otherwise the IM is forwarded to a server.

Abstract: Minimum cost networks, such as fiber optic networks used in telecommunications, are obtained by defining available network elements having cost, required pairs, connectivity and penalty cost values and selecting from these available elements using an iterative rounding approximation method that constructs an LP relaxation incorporating the element parameters, finds an optimal basic solution, applies a selection criterion to pairs and edges in the optimal basic solution, and constructs a residual LP relaxation with selected pairs and edges. By fixing selected pairs and edges values to 1 in the residual LP, successive iterations of the method provide a design which is a 3-approximation solution to the minimum cost design problem.

Abstract: A client in a home entertainment network can communicate with other components, including the server, over both a wired and a wireless link, with the particular path being selected based a component preference, and/or a bandwidth capability, and/or an occupancy ratio. Both links may be simultaneously used.

Abstract: Link used variables are defined for links related to an interconnection fabric. The links used variables are representative of whether or not a link is used for handling flows between a plurality of hosts and devices. Constraints for links, and hop counts or port counts are also defined. An objective function is used by an integer programming solver to determine connections as a function of the definitions.

Abstract: One embodiment receives at a first node in at least a portion of a network a routing table, the portion of the network comprising the first node and one or more second nodes, the routing table specifying the immediate neighbor that provides each of the best paths in the portion of the network based on a total cost; using the routing table, determines at the first node every second node that is necessary for the first node to reach all edges of the network, the second nodes that are necessary for the first node to reach all edges of the network comprising an active set for the first node; and sends a message from the first node to every second node to facilitate determining whether to shut down the second node.

Abstract: The invention provides an enforcement mechanism for limiting the propagation of content to a predefined proximity in a heterogeneous network. The protection mechanism determines the distance associated with wireless links of the heterogeneous networks and verifies that the distance is within the predefined proximity limits. The distance may be measured by evaluating the signal strength of received signals. The protection mechanism further uses round trip time determinations to enforce the proximity limits on wired or unknown segments of the heterogeneous network. Specifically, the round trip time associated with a wired or unknown segment may be determined using the round trip time associated with the wireless segments and the total round trip time of the network as a whole. The round trip time of the wired or unknown segment is then compared to a round trip time limit associated with the proximity requirement for distributing content.

Abstract: A communication routing arrangement includes two or more wireless routers coupled to a communication network, and a user device adapted to couple with the communication network through a communication path including at least one of the two or more wireless routers. The communication path between the user device and the communication network is selected based on available resources of the two or more wireless routers.

Abstract: Techniques are described for providing managed virtual computer networks that have a configured logical network topology with virtual networking devices, such as by a network-accessible configurable network service, with corresponding networking functionality provided for communications between multiple computing nodes of the virtual computer network by emulating functionality that would be provided by the virtual networking devices if they were physically present.

Abstract: A method and system for extracting and building end-to-end route information in a multi-area Internet protocol (IP) autonomous system (AS) is disclosed. The method and system enable a user, such as a network administrator, to explicitly identify a full set of paths (links and routers) that a given IP packet would potentially traverse from its entry point in the source area of the AS where it originates until its exit point in its intended destination area.

Abstract: A system is provided for selecting connection paths in a telecommunications network having a multiplicity of nodes interconnected by a multiplicity of links. The system identifies multiple constraints for connection paths through the network between source and destination nodes, and identifies paths that satisfy all of the constraints for a connection path between a selected source node and a selected destination node.

Abstract: The present disclosure presents systems and methods for policy-based redirection of network traffic, by an intermediary device, to a horizontally deployed WAN device. An intermediary receives a request from a client to access a server. The request was previously modified by a first WAN device to include information in an option field of a transport layer. The intermediary may determine, responsive to a redirection policy, to send the request to a second WAN device deployed horizontally from the intermediary, instead of the server. The intermediary transmits the request to the second WAN device, while maintaining the information from the option field. The intermediary device receives the request including the information identifying the first WAN optimization device to the second WAN device. The intermediary receives a modified request from the second WAN device, the modified request determined by the intermediary to be sent to the destination server.

Abstract: A plurality of landmarks selected from a source weighed graph on which a path search is performed; and the shortest path lengths between landmarks, and the shortest path lengths from vertices to landmarks adjacent to the respective vertices are calculated, and are stored in a memory device so as to be later referable. Routines for calculating upper and lower limits of the shortest path length corresponding to two vertices v and w are prepared by using expressions derived from quadrangle inequalities formed of the two vertices v and w as well as two landmarks adjacent to the respective vertices v and w. In response to a call from an A* search program, these routines return the upper limit or the lower limit of the shortest path length corresponding to v and w by referring to the shortest path lengths between landmarks, and the shortest path lengths from vertices to landmarks adjacent to the respective vertices, which have been previously stored in the memory device.

Abstract: Methods, apparatus, and products are disclosed for optimizing a physical data communications topology between a plurality of computing nodes, the physical data communications topology including physical links configured to connect the plurality of nodes for data communications, that include carrying out repeatedly at a predetermined pace: detecting network packets transmitted through the links between each pair of nodes in the physical data communications topology, each network packet characterized by one or more packet attributes; assigning, to each network packet, a packet weight in dependence upon the packet attributes for that network packet; determining, for each pair of nodes in the physical data communications topology, a node pair traffic weight in dependence upon the packet weights assigned to the network packets transferred between that pair of nodes; and reconfiguring the physical links between each pair of nodes in dependence upon the node pair traffic weights.

Abstract: A method and device for determining a route including: presetting the number N of routes, performing a K shortest paths algorithm after a route query request is received, calculating the routes by group according to the number N of the routes, whenever N routes are calculated, outputting the N calculated routes as a group, and assigning resources to the group of routes; and stopping calculating the routes if a route on which resource matching is successful is obtained from the group of routes, and using the route on which the resource matching is successful as the determined route; otherwise, performing the resource matching on the next group of output routes to determine a route; where N is a positive integer and 1<N<K.

Abstract: A wireless networking system uses mobile and fixed transceivers to achieve a network with changing topology. A routing process includes quality-of-service considerations in the network to allow for features such as file or other data transfer, streaming audio and video, digital telephone communications, etc. The routing process adapts to transceiver units entering, leaving, or moving within, the network. Auxiliary networks such as the Internet, campus or corporate intranets, home networks, etc., can be accessed through the wireless network. Features, designs and user interfaces for the units are described. Security and access control of media content and other data is presented.

Abstract: An Internet protocol (IP)-based ubiquitous sensor network (USN) system is disclosed. The IP-based USN includes a plurality of sensor nodes having unique IP addresses and an IP-USN router. The IP-USN router has a table that stores each location address of the sensor nodes and periodically broadcasts its own presence information for updating the location addresses stored in the table. The sensor nodes in the IP-based USN system have unique IP addresses. Therefore, desired information and services from any external network may be obtained.

Abstract: One or more techniques and/or systems are disclosed for identifying a list of destination servers ordered by round-trip time (RTT) for a requesting machine. When a client interacts with an address, such as an IP address, when accessing a remote service, an RTT is collected for the address, or the RTT may be derived for a range of addresses, and saved in a database. When the client subsequently requests access to a remote service, a list of destination servers are returned, respectively identified by corresponding addresses. The destination servers can be sorted in order of efficiency by determining an expected RTT associated with a matching address, or range, in the database, and sorting the destination servers by their respective expected RTTs.

Abstract: An exemplary method includes monitoring a performance of at least one of a plurality of layer-2 network paths connecting a layer-2 network switch device to another layer-2 network switch device and selecting an optimal one of the plurality of layer-2 network paths over which to forward data traffic based on a path selection heuristic and the monitored performance of the at least one of the plurality of layer-2 network paths. At least a portion of the exemplary method may be performed by a layer-2 network switching system. In certain embodiments, the selecting of the optimal one of the plurality of layer-2 network paths over which to forward the data traffic is based on at least one of a latency parameter, a congestion parameter, and a cost parameter associated with the at least one of the plurality of layer-2 network paths. Corresponding systems and methods are also disclosed.

Abstract: In one embodiment, providing multi-layer address security incorporating Layer 2 Media Access Control (MAC) addresses and corresponding Layer 3 Internet Protocol (IP) addresses for host machines on a routed access network is provided.

Abstract: A multiprocessor computer system comprises a dragonfly processor interconnect network that comprises a plurality of processor nodes and a plurality of routers. The routers are operable to route data by selecting from among a plurality of network paths from a target node to a destination node in the dragonfly network based on one or more routing tables.

Abstract: A multiprocessor computer system comprises a dragonfly processor interconnect network that comprises a plurality of processor nodes and a plurality of routers. The routers are operable to adaptively route data by selecting from among a plurality of network paths from a target node to a destination node in the dragonfly network based on one or more of network congestion information from neighboring routers and failed network link information from neighboring routers.

Abstract: An extensible, multi-tenant software-as-a-service business application platform is provided for hosting multiple organizations. Organization services are provided by virtual or physical servers with dedicated data stores assembled in scalable groups. Distributed interaction between components of the scalable groups may enable extensibility and reliability, while changes in locations of organization services are provided to the client(s) for seamless continuation of the client's access to the services. Customizable and dynamic APIs for accessing each organization's data and applications isolated from the others and pluggable third party authentication services may also be integrated into the platform.

Abstract: A load balancing routing method for networks is disclosed. The routing method includes following steps. A network topology graph and a plurality of expected bandwidth demands corresponding to a plurality of source-destination pairs are received by a network server. A plurality of link criticalities of a plurality of links established according to the source-destination pairs is calculated by the network server according to the network topology graph and the expected bandwidth demands. A plurality of expected loads of the links is calculated by the network server according to the link criticalities. A plurality of cost values is calculated according to a plurality of residual capacities of the links and the corresponding expected loads. A better transmission path corresponding to each of the source-destination pairs is selected by the network server according to the weighted sum of the cost values corresponding to the links in the source-destination pair.

Abstract: An apparatus and a method for layer-2 and layer-3 VPN discovery are disclosed. The apparatus is incorporated in a network, and the network includes a first carrier network. The first carrier network includes at least two layer-1 provider edge devices. Layer-1 VPN information is created within the first carrier network. BGP next hop information passes within the first carrier network. The BGP next hop information is for a selected one of the following: a layer-2 VPN-based provider edge device, a layer-3 VPN-based provider edge device, and a layer-2 and layer-3 VPN-based provider edge device. The network also includes a second carrier network within which the BGP next hop information is used for VPN discovery.

Abstract: A cryptographic processor for redundantly-processing cryptographic operations is disclosed. The cryptographic processor includes a number of input ports, a first and second cryptographic engines, comparison logic and a plurality of output ports. The number of input ports is configured to accept both plaintext and ciphertext. Each of the number of input ports is coupled to both the first and second cryptographic engines. The comparison logic is configured to determine if the first and second cryptographic engines produce a result that is different. The number of output ports is configured to produce both plaintext and ciphertext.

Abstract: A recording medium storing a program for performing collective communication of unique-messages by a computer. According to the program, a space in which nodes are arranged is equally split into regions according to directions from the origin of a relative coordinate system, and a region to which each node belongs is determined on the basis of the relative coordinates of the node. When the computer receives an instruction to execute collective communication of unique-messages, messages are submitted to nodes in turns so that the numbers of messages addressed to the respective regions and submitted per predetermined unit time are equated, and each message submitted to one of the nodes contains data unique to the node.

Abstract: A router receives a transaction message. The router determines whether the transaction message may include an affinity indicating a preference regarding processing of the transaction message. The transaction message may be modified to include an identification of a server system to process the modified transaction message based on the determination of the affinity. The router may route the modified transaction message to a coupling facility. A notification message may be received from the coupling facility, where the notification message requests a server associated with or including the router to send a bid to process the modified transaction message. The router may send the bid to process the modified transaction message to the coupling facility. An authorization message, to process the modified transaction message, may be received from the coupling facility based on a timestamp of the bid.

Abstract: A method and apparatus is provided in which a multi-site load balancing system directs a client to a site best able to respond to the client's request based on a combination of balancing methods. Performance metric balancing is employed to select sites having the best performance metrics to participate in network latency balancing to determine the site best able to respond the request. The sites participating in the network latency balancing are selected based on having performance metrics within an allowable deviation of the best performance metric. Alternatively, network latency balancing is employed to select sites having the least network latency to participate in performance metric balancing to determine the site best able to respond to the request.

Abstract: Resource availability profiles are received, wherein each resource availability profile describes a resource associated with a server. Each resource is assigned a plurality of weights corresponding to a plurality of policies. The weights are determined by, for each of the plurality of the policies, determining a weight for each resource based a given policy and selected information in the resource availability profiles corresponding to the resources. The method further comprises determining a policy from the plurality of the policies corresponding to a given a context associated with a connection request. A first of the load-balanced servers is selected for the connection request based on the weights assigned to the plurality of resources for the policy for the given context.

Abstract: A method may include constructing an auxiliary graph for a network comprising a plurality of network elements, the network elements having an Internet Protocol layer, a lower layer, and a wavelength layer, the auxiliary graph including a plurality of directed edges, the plurality of directed edges indicative of connectivity of components of the plurality of network elements. The method may further include: (i) deleting directed edges from the auxiliary graph whose available bandwidth is lower than the required bandwidth of a selected demand; (ii) finding a path for the demand on the auxiliary graph via remaining directed edges; (iii) deleting at least one directed edge of the auxiliary graph on the wavelength layer along the path; (iv) adding lower layer lightpath edges to the auxiliary graph for a lower layer lightpath for the path; and (v) converting lower layer lightpaths to Internet Protocol lightpaths if a conversion condition is satisfied.

Abstract: A method, computer readable medium, and apparatus for reducing latency in network connections include receiving at a web content optimization apparatus a request from one of one or more client devices for network content hosted at one of one or more server devices. The web content optimization apparatus determines whether an automatic redirect parameter is enabled for the request. The request from one proxy processing device acting as the requesting one of the client devices within the web content optimization apparatus is sent to another proxy processing device within the web content optimization apparatus when the automatic redirect parameter is determined to be enabled. One or more redirect messages with one or more optimized cookies associated with the requested network resource are obtained from the one or more server devices at the another proxy processing device within the web content optimization apparatus.

Abstract: An apparatus comprising a network aware (NA) global load balancing (GLB) component configured to associate with a local data center (DC), couple to an end user via a network, select a server in the DC or in one or more remote DCs coupled to the network based on application resource information and network resource information, and select a route in the network based on the application resource information and the network resource information.

Abstract: Methods and apparatus to characterize and predict network health status are presented. A particular method of characterizing and predicting a health status of a network node includes receiving a plurality of report values associated with the network node, where each report value is one of alert and normal, and where each report value is received at a corresponding time. The method includes calculating a current report weight associated with a current report value received at a current time. When a first previous report value was received at a first previous time before the current time, the current report weight is calculated based at least partially on the current report value and at least partially on a first previous report weight associated with the first previous value. The method includes storing the current report weight at a memory device.

Abstract: Systems and methods of the present invention provide for returning website content after being requested by a client. A dynamic component and a rewritten URL may be requested and a static component may be requested, which may be updated. The combination of static and dynamic website content may be returned to the client.

Abstract: Technologies are described herein for routing a service request to an appropriate web service. A first service request is routed from a first web service to a second web service. Routing factors associated with the second web service are monitored. A determination is made as to whether the routing factors indicate that the second web service is no longer appropriate for handling service requests. If the routing factors indicate that the first web service is no longer appropriate for handling service requests, then a second service request is routed from the first web service to a third web service. The first web service, the second web service, and the third web service are included in a composite service.

Abstract: A client in a home entertainment network can communicate with other components, including the server, over both a wired and a wireless link, with the particular path being selected based a component preference, and/of a bandwidth capability, and/or an occupancy ratio. Both links may be simultaneously used.

Abstract: According to one embodiment, an apparatus that makes improved routing decisions is provided that includes a receiver, a retriever, a proximity engine, and a transmitter. The receiver may be configured to receive a request from a source. The retriever may be configured to retrieve a plurality of providers capable of servicing the request. The proximity engine may be configured to rank the plurality of providers based on weights indicative of a network distance. The weights may correspond to a first Border Gateway Protocol (BGP) community attribute associated with the source and at least a second BGP community attribute associated with at least one of the providers in the plurality of providers. The transmitter may be configured to transmit the request to the provider in the plurality of providers with the highest ranking.

Abstract: Web request routers are used to route requests to content within a network. The web request routers run on general purpose computing devices that are configured to receive requests, parse the requests and route the requests to the appropriate destination. The web request routers may be configured to perform different routing methods and operations. For example, the web request routers may route requests based on: a type of network traffic (e.g. user/machine); application specific logic, URL patterns and/or other programmed logic. The web request routers may be configured to route the request based on a determined affinity (e.g. document, Uniform Resource Locator (URL), directory path, site collection) of the request. The web request routers may also be configured to perform QOS operations such as auditing, logging, metering, throttling network traffic, prohibiting network traffic and the like.

Abstract: The present invention supports a method for transmitting information packets across network firewalls. A trusted entity is provisioned with an address designation for a pinhole through the firewall during setup of a communication session between two communication devices. This pinhole address is used throughout the communication session between the two communication devices to transmit information packets onto and out of the communication network. Information packets addressed to the communication device inside the firewall are received by the trusted entity, which replaces address header information in the information packet with the address for the pinhole. The information packet is routed to the pinhole where it passes onto the network for routing to the communication device inside the firewall. Information packets transmitted from the network are also routed to the trusted entity for routing toward the communication device outside the firewall.

Abstract: Technologies are described herein for rerouting a service request between service endpoints. The service request is received, at a first web service, from a second web service. The first web service and the second web service may be components of a composite service. The service request is routed to an initial service endpoint configured to respond to the service request according to a service level agreement between the first web service and the second web service. Service criteria associated with the initial service endpoint are monitored. A determination is made as to whether the service criteria meet a performance threshold specified by the service level agreement. If the service criteria do not meet the performance threshold specified by the service level agreement, then the service request is rerouted from the initial service endpoint to an alternate service endpoint.

Abstract: A method and system for providing a network and routing protocol for utility services are disclosed. In one embodiment, a computer-implemented method comprises discovering a utility network, wherein a utility device (for example, a constant powered meter) sends network discovery messages to find the utility network. Neighboring meters are discovered and the device listens for advertised routes for one or more networks from the neighbors. The device is then registered with one or more utility networks, receiving a unique address for each network registration. Also illustrated in this invention disclosure is how each device of a class of devices (for example, battery powered meter) finds and associates itself with another device (for example, constant powered meter). The constant powered meter also registers its associate battery powered meter with the utility networks. The constant powered meter registers itself with the access points and the upstream nodes in the path out of each network.

Abstract: The present invention provides a traffic engineering apparatus which performs traffic engineering, including: an optimal branch point determination unit which determines an optimal branch point in a network to realize a predetermined policy; and a traffic flow regulation unit which regulates a traffic flow rate into the local node during reception of traffic based on the optimal branch point determined by the optimal branch point determination unit.

Abstract: A method and apparatus for routing a data stream through a plurality of data movers independent of a network interface type is provided. In one embodiment, the method for routing the data stream to a destination with indifference to network interface type includes segregating the data stream into a plurality of data blocks at an application layer, wherein the plurality of data blocks are to be routed to a destination through the plurality of data movers and coordinating data path selection for communicating the plurality of data blocks to the plurality of data movers over a plurality of data paths.

Abstract: Systems and methods for managing and providing content and services on a network system. Aspects of the invention include location-based determination of network content and services that may be provided to client computers. Other aspects of the invention include authorization and authentication components that determine access rights of client computers. Additional aspects include systems and methods for redirecting client computers to different network content. The disclosed systems and methods may be used in numerous network system applications.

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 network. 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.