Abstract: A node device in an information communicating system: determines whether or not the node device is communicable over the IPv4; determines whether or not the node device is communicable over the IPv6; acquires a first routing table that is generated using a first node device communicable over the IPv4 from a predetermined device that is connected to a network if communication is possible over the IPv4; and acquires a second routing table that is generated using a second node device communicable over the IPv6 from the predetermined device that is connected to the network if communication is possible over the IPv6. If the controller determines that communication is possible over the IPv4 and the controller determines that communication is possible over the IPv6, the controller acquires one of the first one of the first routing table and the second routing table according to a priority order.

Abstract: A system and method are provided for optimizing maintenance of a geographically distributed data processing system. The method comprises selecting a primary territory having associated operating hours, identifying maintenance hours that exclude the operating hours, and selecting a maintenance time within the available maintenance hours. The midpoint of the maintenance hours may be selected as the maintenance time, or activity distribution data may be analyzed to select a maintenance time corresponding to a low activity time.

Abstract: According to one embodiment, there is provided information processing apparatus, including: a first communication module configured to perform a communication under a first communication scheme which corresponds to a proximity wireless communication requiring no authentication; a second communication module configured to perform a communication under a second communication scheme which has a communicable distance longer than that of the proximity wireless communication; and a communication controller configured to perform a control, after the first communication module has started a data transmission with another information processing apparatus under the first communication scheme, so as to change-over the first communication scheme to the second communication scheme and then perform the data transmission.

Abstract: Methods and apparatus for hierarchical routing in communication networks are disclosed. An example hierarchical routing method for a communication network disclosed herein comprises determining a plurality of constrained weighted paths to connect pairs of border nodes of a cluster in the communication network, each constrained weighted path having a respective bandwidth and a respective weight, a constrained weighted path for a pair of border nodes of the cluster being selected, based on a bandwidth threshold, from a set of possible paths capable of connecting the pair of border nodes, and advertising the plurality of constrained weighted paths determined for the cluster.

Abstract: Distributing information over a network is disclosed. Nodes are grouped into regions. Preferred nodes are designated. A source of content to be delivered to a preferred node using a preferred algorithm is indicated to at least one preferred node. At least one common node is assigned the preferred node as a relay of information.

Abstract: Devices, systems and methods that route a communication link to a proper destination are disclosed. The method may include connecting the communication link to a first destination; requesting a response from the first destination; validating the response from the first destination; and disconnecting the communication link to the first destination if the response from the first destination is not valid. The method may also include connecting the communication link to a second destination; requesting a response from the second destination; and disconnecting the communication link to the second destination if the response from the second destination is not valid. The devices, systems and methods may provide hunt group, call center and conference call features as discussed later herein.

Abstract: A named-data networking (NDN) node, comprising a plurality of faces each of which is coupled to a different node in a content-centric network, and a processor coupled to the faces, wherein the processor is configured to probe the performance of each of the faces for an interest, wherein the interest is associated with multiple ones of the faces, wherein a next-hop is identified by the face, wherein a one of the faces associated with the interest is used to forward the interest when the interest is received by the NDN node, and wherein the one of the faces used is determined based on a selection probability determined from feedback from the probe of the performance of the faces.

Abstract: A method to enhance a graceful restart process in an open shortest path first (OSPF) network is disclosed. The method is implemented on an OSPF enabled router that is adjacent to a plurality of neighboring OSPF enabled routers within a network, where the OSPF enabled router and the plurality of neighboring OSPF enabled routers are within one area of the network. In preparation of a database synchronization process during a graceful restart (GR) session, the OSPF enabled router selects a first neighboring OSPF enabled router from the plurality of neighboring OSPF enabled routers, initiates a first database synchronization with the first neighboring OSPF enabled router. Then the OSPF enabled router initiates a set of database synchronizations with remaining neighboring OSPF enabled routers only after the first database synchronization with the first neighboring OSPF enabled router completes.

Abstract: An energy management system for a data center network may include a central computer to establish an energy use policy for the computer data center network. The system may also include computer nodes in the computer data center network to receive a packet which is a query that obtains energy information from the nodes and/or a transmission reservation that provides instructions for the energy use policy to be implemented at the computer nodes. The computer nodes may reallocate data traffic on the computer data center network based on the energy use policy to improve energy consumption of the computer data center network.

Abstract: In a tool for use by network planners in designing metropolitan IP aggregation networks, several optimization methods are integrated into a tool. A k-means algorithm is used to choose access packet switch locations. A dual-k-means algorithm is used to choose the backbone switch locations. Each access packet switch is dual homed to two backbone packet switches using two diverse paths. The diverse path configuration is found using a maxflow-mincost algorithm on a modified fiber map topology. The link topology connecting the backbone packet switches to each other is designed using a heuristic that creates a skeleton network topology and then adds express links one by one, testing each link to assure reduced overall network cost. The resulting network topology is then improved upon by local search.

Abstract: A method for enabling co-existence of multiple machines with identical addresses within a single data center network. The method includes assigning a unique pseudo identifier to each machine in the network that can be used for routing a packet to a destination machine, replacing a sender media access control address on an address resolution protocol request with a pseudo identifier of the sender at an edge network switch, retrieving a private network identifier from a mapping table based on the sender pseudo identifier and returning a pseudo identifier for the destination address based on the private network identifier, and replacing the pseudo identifier of the destination address with an actual identifier at a destination edge network switch for routing the packet to the destination machine.

Abstract: Systems and methods for providing enhancement of upload and/or download performance based on client and/or server feedback information are disclosed. In an embodiment, the disclosed method detects that a data transfer event is about to occur and based on a set of characteristics associated with the data transfer event, selects a host from a group of hosts as a pathway for transferring data associated with the data transfer event to optimize data transfer performance. The group of hosts can include a server providing cloud-based collaboration and/or storage services, one or more content delivery network servers and/or geographically distributed edge servers.

Abstract: A system and an article of manufacture for enabling co-existence of multiple machines with identical addresses within a single data center network. include assigning a unique pseudo identifier to each machine in the network that can be used for routing a packet to a destination machine, replacing a sender media access control address on an address resolution protocol request with a pseudo identifier of the sender at an edge network switch, retrieving a private network identifier from a mapping table based on the sender pseudo identifier and returning a pseudo identifier for the destination address based on the private network identifier, and replacing the pseudo identifier of the destination address with an actual identifier at a destination edge network switch for routing the packet to the destination machine.

Abstract: Various embodiments implement a set of low overhead mechanisms to enable on-demand routing protocols. The on-demand protocols use route accumulation during discovery floods to discover when better paths have become available even if the paths that the protocols are currently using are not broken. In other words, the mechanisms (or “Route Optimizations”) enable improvements to routes even while functioning routes are available. The Route Optimization mechanisms enable nodes in the network that passively learn routing information to notify nodes that need to know of changes in the routing information when the changes are important. Learning routing information on up-to-date paths and determining nodes that would benefit from the information is performed, in some embodiments, without any explicit control packet exchange. One of the Route Optimization mechanisms includes communicating information describing an improved route from a node where the improved route diverges from a less nearly optimal route.

Abstract: According to an embodiment, a communication device is structured to be connected to a plurality of external devices. The communication device includes an acquisition unit and a selector. The acquisition unit is configured to acquire resource information that represents a resource of cryptographic keys available from each external device. The selector is configured to select a path from among a plurality of paths for one of the external devices, based on a bottleneck and a hop count of the resource on the path.

Abstract: A rule indicates that data having particular characteristics be automatically routed to a particular destination. When software on a switching device detects a new data stream, it is analyzed to determine whether it has characteristics specified by the rule. If it does, the packet is encapsulated with a special tag, indicating that the packet should be routed to the new destination. Also, an entry is added to a quick-lookup table in the switching device. The entry indicates that future packets in the data stream that have the same source and destination port and address should also be routed to the new destination.

Abstract: The present invention relates to a method in a border node of an Autonomous System (AS) and a border node comprising a border route control unit. The border node is configured to route data packets from a source node in an originating Autonomous System to a destination node in a terminating Autonomous System, possibly via intermediate autonomous systems. The method includes determining one inter autonomous system path or multiple inter AS paths constituting a route or multiple routes, respectively, between the originating autonomous system and terminating autonomous system based on at least an energy consumption metrics of transit paths through an own autonomous system and other autonomous systems and a total energy consumption metric for each possible inter autonomous system path. The border node is adapted to store the route or the multiple routes in a border gateway routing table.

Abstract: In one embodiment, a root of a directed acyclic graph (DAG) may determine transmission of critical traffic from a first device to a second device in a computer network using the DAG, and may also determine a maximum tolerable delay of the critical traffic. As such, the root may compute, based on a known topology of the computer network, a constrained shortest path first (CSPF) point-to-point (P2P) path from the first device to the second device to meet the maximum tolerable delay. The root may then inform the first device of the P2P path to the second device to cause the first device to use the P2P path for the critical traffic.

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: Virtual links may be used to divert traffic within an Ethernet network without affecting overall traffic patterns on the Ethernet network. In one embodiment, the virtual link may be established on the network via a routing system in use on the network. Nodes on a defined path for the virtual link will install forwarding state for the virtual link so that traffic may follow the defined path through the network. The logical view of the virtual link, from a routing perspective however, has the same cost as the shortest path between the endpoints of the virtual link and, accordingly, does not affect other traffic patterns on the network. Once established, the end nodes on the virtual path will have two equal cost paths through the network—one following the shortest path tree and one along the path for the virtual link. The end nodes may use a tie breaking process in an Equal Cost Multi Path (ECMP) selection process to preferentially select the virtual link over the shortest path.

Abstract: A system and method for providing multimedia communication between a firewall protected, LAN based endpoint and an endpoint that is external to the LAN. A logical port of a multimedia communications control unit is attached to the LAN behind the firewall. Another logical port of the multimedia communications control unit is attached to the external endpoint. Multimedia communication data, consisting of call management data and media data, can be exchanged between the endpoints via the multimedia communications control unit. The multimedia communications control unit allows only multimedia communication data that strictly adheres to a particular communications protocol to pass through. Thus, the security afforded by the firewall is not compromised.

Abstract: In a method, an apparatus and a computer program product for service decomposition in IP-broadcast networks, a full service bundle is detected within a first transport stream protocol having a plurality of broadcast packets corresponding to respective broadcast services. The respective service identifiers of the plurality of broadcast packets are evaluated, and the full service bundle is decomposed to create a plurality of decomposed broadcast packets on the basis of the service identifiers. For at least one same service identifier the corresponding plurality of decomposed broadcast packets is sent with the first transport stream protocol as a main service bundle, and for at least one remaining same service identifier the corresponding plurality of decomposed broadcast packets is sent with a second transport stream protocol as a sub service bundle. The second transport stream protocol contains synchronization information of the first transport stream protocol.

Abstract: A method and apparatus of allowing client roaming between gateways of a wireless mesh network is disclosed. The gateways are connected through a layer 3 network to an aggregation router. The method includes a first gateway sending a first route update to the aggregation router when a client joins a first cluster of the first gateway, the first gateway aging the route, and a second gateway sending a second route update to the aggregation router when the client roams to a second cluster of the second gateway.

Abstract: Selected modalities of a multimodal communication session may be diverted over different networks by an administrator or automatically to reduce burden on utilized networks. Modalities may be selected and diverted over different networks including the Internet for the same multimodal communication session based on network conditions, communication session attributes, participant attributes, and similar factors.

Abstract: A cost of a path may not be the only factor in searching for a path solution in a network. For example, some applications are delay sensitive and require finding a path that does not exceed a latency constraint for the entire path. Accordingly, a method and corresponding apparatus for searching for a path solution in a network is provided that identifies combinations of partial paths that satisfy an end-to-end path constraint, compares attributes of the combinations of partial paths, prunes the combinations of partial paths based on results of the comparing to identify candidate combinations of partial paths, and selects a candidate combination of partial paths as the path solution. By pruning combinations of partial paths, considerable is saved compared to exhaustive comparing of every possible combination of partial paths and scalability is achieved.

Abstract: A control device includes a storage unit that stores a correspondence relationship between a first information processing device and attribute information of a first virtual machine provided by the first information processing device, and a correspondence relationship between a second information processing device and attribute information of a second virtual machine provided by the second information processing device; and a processor that refers to the storage unit and deploys a deployment object virtual machine to the first information processing device when the number of the first virtual machines with the same attributes as the attributes of the deployment object virtual machine among the first virtual machines provided by the first information processing device is detected to be fewer than the number of second virtual machines with the same attributes as the attributes of the deployment object virtual machine among the second virtual machines provided by the second information processing device.

Abstract: The present disclosure relates to an example of a method for a first router to adaptively determine status within a network. The network may include the first router, a second router and a third router. The method for the first router may comprise determining status information regarding the second router located in the network, and transmitting the status information to the third router located in the network. The second router and the third router may be indirectly coupled to one another.

Abstract: A method includes receiving demand information from edge routers, estimating an optimal request distribution based on the demand information using a bicriteria approximation algorithm, wherein initial programming states for the estimation are specified by (u, F, D, FS, DS, Fexp, Fimp), where u is a current node, F is a vector representing an available facility for large capacity, D is a vector representing an outsourced large client, FS is an amount of cache server capacity offered to small clients, DS is a total demand of outsourced small clients, Fexp is an index of a cache server being exported from a subtree, and Fimp is an index of another cache server of another subtree that is being utilized, and providing each of the edge routers with anycast route information for the cache servers.

Abstract: A firewall cluster having three or more firewall processing nodes sharing the same shared IP address. Port numbers are assigned to the firewall processing nodes within the cluster and are used to distinguish between traffic sent to the cluster. Each network connection is assigned a destination port number. Each node receives the network connection and its assigned port number and determines if the assigned destination port number matches one of its assigned port numbers. If so, the node processes the network connection. If the assigned destination port number does not match one of its assigned port numbers, the network connection is discarded.

Abstract: A system and method identifies topology information of an autonomous system as well as other autonomous systems, and can provide topology information in response to requests.

Abstract: An approach for providing latency measurements for a communication path of a transmission network is described. Measurement of latency associated with one or more communication paths of a transmission network is initiated. An increase in the latency within the transmission network is detected based on the latency measurement. One or more secondary communication paths of the transmission network are determined to address the latency increase. One of the secondary communication paths is selected according to a latency threshold.

Abstract: The present invention includes a network service access method. In one embodiment, such a method comprises: forwarding the domain name resolution requests to a local domain name server of each Internet service provider providing services through access link corresponding with the Internet service provider; receiving Internet Protocol address on the domain name resolution requests which the local domain name server of each Internet service provider returned from the corresponding access link; selecting the Internet Protocol address according to line state of the access link of each Internet service provider providing services and returning the selected Internet Protocol address to the user equipments; and visiting network services by the access link of the Internet service provider returning the selected Internet Protocol address.

Abstract: Embodiments of the present invention a method and a node for finding the shortest path to a cache node in a content delivery network (CDN) comprising requested content and a method for creating a virtual representation of a network. According to an embodiment of the present invention, the virtual representation is in the form of a virtual, hierarchical topology, and the cache nodes correspond to the cache nodes of the real network. All cache nodes are arranged at a first level and with the virtual nodes arranged at higher levels. In the virtual representation, all nodes (cache and virtual) are connected with virtual links such that there exist only one path between any two arbitrary cache nodes. Further, costs to the virtual links are assigned such that the path cost between any two arbitrary cache nodes in the virtual representation generally corresponds to the lowest path cost between corresponding cache nodes in the real network.

Abstract: In one embodiment, a first request is received for a probe link from a client that has downloaded a page. The request is received from an application. A test may be performed to determine a server that could optimally service a content request from the client. After receiving the request, the content router sends a re-direct to the client where the re-direct causes the client to follow the re-direct to the server. The server then sends a re-direct back to the client, which the client follows by sending a second request to the content router. The second request is associated with the client and the round-trip time is calculated for the server. It is then determined if the location for the server should be designated as the content deliverer to the client based on the calculated round-trip time.

Abstract: A method is provided for constructing a packet classifier for a computer network system. The method includes: representing a set of rules for packet classification as a directed graph; formulating a plurality of minimization problems from the directed graph, where subgraphs extending from non-terminal nodes in the directed graph represent a minimization problem (i.e., a one-dimensional packet classifier); solving the plurality of minimization problems; combining solutions for the plurality of minimization problems to yield a reduced set of rules which form a reduced packet classifier; and instantiating the reduced packet classifier in a content-addressable memory device.

Abstract: A system for injecting code into an HTML file comprises a memory and a processor communicatively coupled to the memory. The memory stores code. The processor receives a request for content. The processor determines whether the request for content includes a request for compression and, if so, deletes the request for compression associated with the requested content. The processor retrieves the requested content. If the retrieved content is associated with an HTML file, then the processor injects the code into the HTML file to thereby modify the HTML file. The processor communicates the modified HTML file to a client.

Abstract: Methods and systems are provided for hardware-accelerated packet multicasting in a virtual routing system. According to one embodiment, a virtual routing engine (VRE) including virtual routing processors and corresponding memory systems are provided. The VRE implements virtual routers (VRs) operable on the virtual routing processors and associated routing contexts utilizing potentially overlapping multicast address spaces resident in the memory systems. Multicasting of multicast flows originated by subscribers of a service provider is simultaneously performed on behalf of the subscribers. A VR is selected to handle multicast packets associated with a multicast flow. A routing context of the VRE is switched to one associated with the VR. A packet of the multicast flow is forwarded to multiple destinations by reading a portion of the packet from a common buffer for each instance of multicasting and applying transform control instructions to the packet for each instance of multicasting.

Abstract: A method for routing communications on a network node in a communications network includes: updating a central domain master regarding changes detected in topology, receiving a routing plan from the central domain master, where the routing plan is calculated at least in accordance with the changes, and transmitting data as necessary in accordance with the routing plan. A method implementable on a central domain master for routing communications between network nodes in a communications network includes receiving transmissions regarding changes detected in topology from the network nodes, calculating a routing plan based on at least the transmissions, and distributing the routing plan to the network nodes, where the central domain server is one of the network nodes.

Abstract: A method, apparatus, and system are described for a route server that connects network users to network providers. The route server may connect to network elements, including routers, from a plurality of Internet network service providers (ISP) to the network elements of a plurality of users through the route server. The route server also may make routing decisions for the plurality of users and the plurality of ISPs and is programmed to maintain multiple views of the routing table as well as implement multiple BGP instances, each instance representing different autonomous systems, in a single instance of the route server. The route server also may match a first user to one or more of the ISPs based on criteria including not only the best possible routes of each ISP but a full listing of all possible routes to a destination address from each ISP matching the user's criteria in order to construct a route table to get IP packets of a user to a destination address.

Abstract: Examples described herein provide for generating a multicast consumer search request from a request node in the network. The request is then routed to the interconnected nodes and received at a target node having a directly-connected multicast consumer. Identification information associated with the directly-connected multicast consumer is forwarded from the target node back to the request node.

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 database query comprising a logical table definition and at least one route tracing indicator is forwarded to at least one distributed database node within a distributed network of databases. At least one query response is received including distributed route tracing information associated with each distributed database node that processed the database query along a path associated with the at least one query response. The received distributed route tracing information is processed to characterize query route propagation within the distributed network of databases. This abstract is not to be considered limiting, since other embodiments may deviate from the features described in this abstract.

Abstract: A sensor in a network to which to route a packet is selected, where the sensor is selected independently of energy status of the sensors included in the network, and the sensor is selected by a source sensor. The packet is routed from the source sensor toward the destination sensor.

Abstract: Systems and methods are provided for routing data through a network. In one system, a first node is enabled to overhear packet transmissions from a second node. The cost of transmitting packets from the first node to the second node is updated based on each overheard packet transmission. In another system, when the cost of transmitting packets from a source to an overhearing node to a destination is less than the cost of transmitting packets from the source to the destination, an advertisement is sent to the source causing the packet transmissions to be routed from the source to the destination through the overhearing node. In yet another system, using a safe-sequence tag that is attached to any packet transmitted by any node and updated when it is received by another node, along with stored histories of best metric advertisements, predetermined rules are applied to maintain loop freedom.

Abstract: A method for facilitating a sequenced, anonymous communications session in a communications environment is provided in one example that includes receiving, from a first endpoint, an anonymous, sequenced request for a communication session involving a second endpoint. The communication session is sequenced to occur at designated periods provided by the end user(s) and/or an administrator, while maintaining end user(s) anonymity.

Abstract: Method and system for handling error events on a current path for processing an I/O request for reading information from and writing information to a storage space is provided. A system is able to communicate with the storage space via more than one path. If the current path reports an error event, then an alternate path quality is determined to ascertain whether the alternate path will generate an error similar to the current path. The alternate path quality is determined based on a plurality of factors which are assigned certain weights. The weights are determined based on a likely contribution of each factor to a repetition of the error reported by the current path. If the alternate path quality is equal to or exceeds a programmable threshold value, then the alternate path is selected.

Abstract: Embodiments of a system with a first network device and at least first and second links connecting the first network device and one or more other network devices are disclosed. The first network device determines the costs of the first and the second links using the latencies of the first and the second links and factors that correspond to the bandwidths of the first and the second links.

Abstract: In one embodiment, packet flows are distributed among groups, such as, but not limited to, queues or links. For example in the context of a bundled interface in which multiple links appear as a single logical interface on each of the sender and receiver, packet flows are distributed among these multiple links by the sender. When one or more links become unavailable, packet flows of the affected links are reassigned to other active links, while packet flows assigned to the unaffected links remain associated with the same link in contrast to prior systems which do not attempt to preserve prior associations between packet flows and links. By maintaining these associations, the receiver of the packets does not need to adjust to the different arrival links of packet flows.

Abstract: A content delivery system for providing content from a content delivery network to end users may include a plurality of delivery servers that host one or more content items and an inventory server having an inventory of content. The inventory of content can indicate which of the delivery servers host the content items. The inventory server may receive a request for a content item from an end user system and may access the inventory of content to determine one or more delivery servers that host the content item. In response to this determination, the inventory server may redirect the request for the content item to a selected one of the delivery servers. The selected delivery server can then serve the content item to the end user system.

Abstract: A cooperative packet routing for wireless sensor networks is described. In one aspect, a transient sensor node in a wireless sensor network receives a packet from a source node, wherein the packet is targeted for receipt by a base station. The transient sensor node, responsive to receiving the packet, estimates how much operational energy remains in the sensor node. If the determined amount of energy meets a configurable threshold, the transient sensor node implements a set of cooperative packet routing operations for conditional re-transmission of the packet to the base station. The configurable threshold is set to ensure substantially optimal usage and lifetime of the sensor node in the wireless sensor network. The conditional re-transmission of the packet is based on a set of randomized packet re-transmission criteria.