Abstract: A device and method of routing traffic in a network by receiving the network, assigning a maximum temperature value to gateway nodes, calculating temperature values for router nodes, determining self-utilization values for nodes, determining neighborhood-utilization values for router nodes, determining pressure values for gateway nodes, determining pressure values for router nodes, identifying router node sent traffic, identifying neighboring nodes having higher temperatures than router node, identifying neighboring node with lowest pressure value, sending traffic to neighboring node with lowest pressure value, and stopping if the neighboring node is a gateway node, otherwise identifying the node as a router node and returning to the step of finding neighboring nodes.

Abstract: A networked computing system is taught that may be operated as one or more provisioned servers, each of the provisioned servers including capabilities as identified by a corresponding set of specifications and attributes, according to various embodiments. Typically the specifications (or constraints) and attributes are specified with a Server Configuration File. The networked computing system may be provisioned into any combination and number of servers according to needed processing and I/O capabilities. Each of these servers may include distinct compute, storage, and networking performance. Provisioned servers may be managed similar to conventional servers, including operations such as boot and shutting down.

Abstract: In one embodiment, a local network device may determine an inability to establish a connectivity verification protocol (e.g., Bidirectional Forwarding Detection, “BFD”) session to a remote network device, such as from unreturned control messages. In response, the local network device may send at least one connectivity verification protocol echo message to the remote network device destined to be returned to the local network device and forwarded using a forwarding protocol. In response to receiving or not receiving the echo message, the local network device may thus determine whether the forwarding protocol is functioning between the local and remote network devices. In this manner, the local network device may determine whether an inability to establish a connectivity verification protocol session is due to an inability to forward packets between the devices, or due to the connectivity verification protocol not working (or not being configured) on the remote network device.

Abstract: As described herein, a node may include storage to store a cost for each of a number of paths, where a path connects two nodes in a system. A path may be determined between the node and a destination node based on execution of a shortest path first algorithm, the shortest path first algorithm to determine if a cost between two nodes is stored in storage prior to communication with another node to determine cost.

Abstract: Disclosed is a centralized controlling method of the process of delivering a routing packet for content transmission in a content-centric network (CCN). The routing method in a content centric network according to the present invention includes: a content distribution controller in the content centric network receiving a request for specific-content distribution from a user, determining locations of routers storing the content, and finding one of the routers to which the request from the user will be transmitted; and the content distribution controller finding an optimal path in consideration of a traffic distribution status and then transmitting a forwarding information base (FIB) to routers included in the optimal path.

Abstract: A scheme is provided for determining the geographical location of an active IP device coupled to an IP network. A network path to the user device is obtained to identify a last hop device having a known first geographical location. A last leg distance between the last hop device and the user device is calculated. The last leg bandwidth, propagation time, and propagation speed are also characterized to more accurately determine the last leg distance. By combining the known first geographical location and the distance of the last hop device and user device, a geographical location for the user device is obtained. To improve the accuracy of the geographical location of the user device, multiple last hop devices with known geographical locations are employed to obtain multiple geographical areas for the user device. The intersection or overlap of these geographical areas indicates a refined geographical location of the user device.

Abstract: The invention relates in particular to the optimization of routing in a cluster comprising a plurality of nodes and static communication links connecting nodes of the plurality of nodes, said routing being based on load levels associated with the communication links. In order to establish a connection between at least two nodes of the cluster that have been identified (505), at least one route is determined (510) that connects the identified nodes according to the communication links, said route being determined according to the nodes identified, communication links and at least one load level associated with each communication link. A determined route is selected. Subsequently, a value of weight associated with the selected route is estimated (520) and a load level associated with each communication link of the selected route is incremented (525).

Abstract: A source-address independent, multi-path routing method for use in a communication network is disclosed. A network node uses an information packet's destination address to determine a plurality of neighbors it has a proportional likelihood to forward that packet to, such that packets can be sent over multiple paths to a destination node without undesirable looping. Multiple-neighbor proportional forwarding routing tables are determined by computing a directed graph of multiple optimal paths to each destination node. Optimal paths and forwarding proportions are based on link capacities. The multi-path routing method provides maximized throughput, reduced congestion and superior load balancing over single-path routing. Source-address independence also overcomes a major problem of more traditional source-address dependent multi-path routing methods. The source-address independent, multi-path routing method can be implemented in mixed networks where some nodes do not implement the method.

Abstract: A low rate DoS attack detection algorithm is used, which relies on a characteristic of the low rate DoS attack in introducing high rate traffic for short periods, and then uses a proactive test based differentiation technique to filter the attack packets. The proactive test defends against DDoS attacks and low rate DoS attacks which tend to ignore the normal operation of network protocols, but it also differentiates legitimate traffic from low rate DoS attack traffic instigated by botnets. It leverages on the conformity of legitimate flows, which obey the network protocols. It also differentiates legitimate connections by checking their responses to the proactive tests which include puzzles for distinguishing botnets from human users.

Abstract: The present invention relates to methods and apparatus for buying connectivity. A routing engine may receive a buyer request for a connectivity path wherein the buyer request includes a buyer criteria. The routing engine may identify one or more connectivity paths wherein each identified connectivity path comprises one or more connectivity legs. The routing engine may determine one or more available connectivity paths based on the buyer criteria and the routing engine may select an optimal connectivity path from the determined available connectivity paths.

Abstract: A method for managing allocation of paths for transmission, in packets of symbols, of at least a first data content, each content being transmitted from a source node up to a destination node in a meshed communications network comprising a plurality of nodes, each destination node receiving a plurality of copies of a same packet of symbols of the content transmitted to said destination node by a source node, each copy being received by the destination node via a distinct transmission path directly from the source node or via at least one relay node of the meshed communications network, the packets being encoded with an error correction code enabling decoding by erasure of packets symbols.

Abstract: An improved distributed operating system over a network of computer systems is described. Existing distributed operating systems have transmission performance limitations dictated by their inability to (1) reliably handle transient communication failures and rapid node reboots, (2) provide a transmission protocol that adapts to link reliability, and (3) allow transmissions to occur over an arbitrary combinations of communication links. The systems and methods described herein solve these problems by providing a reliable node-to-node session protocol that offers high performance message delivery and multi-interface management and support. This is done by transmitting all data between two nodes of the operating system over a single connection that may dynamically exploit multiple interfaces between the nodes.

Abstract: Aspects of a method and system for networking are provided. In this regard, one or more circuits and/or processors in a network adapter of a first network device may determine whether to communicate traffic between virtual machines running on the first network device via a path that resides solely within the first network device, or via a path that comprises a second network device that is external to the first network device. The determination may be based, at least in part, on characteristics of the traffic. The determination may be based, at least in part, on capabilities and/or available resources of the network adapter. The determination may be based, at least in part, on management information exchanged between the one or more circuits and/or processors and one or more of: software running on the first network device, the second network device, and a third network device.

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: Methods of querying a large number of endsystems are described in which metadata is replicated between endsystems. When a query is injected, an available endsystem receives a message relating to the query which identifies a range of endsystems for which that available endsystem is responsible. The available endsystem then generates completeness data for the range of endsystems based on data stored at the endsystem and this completeness data is transmitted to the sender of the message. The methods may be implemented using device-executable instructions which may be stored on device readable media.

Abstract: System and method for providing cloud computing services is described. In one embodiment, the system includes a cloud computing environment, the cloud computing environment comprising resources for supporting cloud workloads, each cloud workload having associated therewith an internal cloud address; and a routing system disposed between external workloads of an external computing environment and the cloud workloads, the routing system for directing traffic from an external address to the internal addresses of the cloud workloads.

Abstract: The present invention is directed to a method and a mobile node and a node arrangement for performing the method, which method is for selecting a connection (224, 314, 316) for a mobile node (310) arranged to operatively communicate with a network node arrangement (312) via a plurality of connections (224, 314, 316).

Abstract: A CPU executes a process including determining a core node among plural relay nodes on a basis of route information, acquiring a first and a second packets flowing between a server and a terminal apparatus, the second packet being transmitted on a basis of the first packet, calculating a first delay time on a basis of the first and the second packets, the first delay time relating to packet transmission between the server and the terminal apparatus, transmitting a third packet to the core node, receiving a response to the third packet from the core node, calculating a second delay time on a basis of the third packet and the response, the second delay time being a delay time of the core node, and calculating a third delay time being a delay time of an end node on a basis of the first and the second delay times.

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: Virtual connection route selection apparatus and techniques are disclosed. At a communication traffic routing apparatus, metric information associated with multiple different routes for a virtual connection, such as a PseudoWire, toward a destination is collected. The metric information may be collected from one or more remote route computation elements capable of computing routes for virtual connections between the routing apparatus and other routing apparatus over an underlying communication system, or during actual establishment of the virtual connections, for example. An initial or re-optimized route for a virtual connection can then be selected at the routing apparatus based on the collected metric information. In some embodiments, although the virtual connection routes are paths computed by Path Computation Elements (PCEs), actual path selection decisions are distributed to routers.

Abstract: Methods and systems for load balancing and failover among gateway devices are disclosed. One method provides for assigning communication transaction handling to a gateway. The method includes receiving a request for a license from a computing device at a control gateway within a group of gateway devices including a plurality of gateway devices configured to support communication of cryptographically split data. The method also includes assigning communications from the computing device to one of the plurality of gateway devices based on a load balancing algorithm, and routing the communication request to the assigned gateway device.

Abstract: Methods and systems for mobility of mobile nodes in mesh networks are taught wherein the mobile mesh nodes choose an attachment point to another mesh node based on predetermined criteria, such as the characteristics of the attachment point's path to a reference destination, and other factors local to the attachment point, such as load and available capacity. The mobile nodes forward packets on each other's behalf. Static and mobile nodes and the links between them are treated differently from each other in view of their respectively different properties. A special metric is used for paths that include mobile links in addition to the static mesh links and wired mesh links. Mobility is handled completely transparently to any client devices attached to the mesh nodes, where this attachment could be wireless or wired.

Abstract: A content aggregation server (CAS) establishes an IPSec tunnel with a gateway of a home network and discovers content on the home network. The CAS generates a web page that a user of the home network can access remotely to view an index of content hyperlinks, organize the content on the home network, and if desired select a hyperlink to access the content directly through the gateway, not the CAS, which thus is used for listing and managing content but not for hosting the content.

Abstract: An information-processing apparatus operated by a user to carry out communications through a network transmits user-disclosure information to an other information-processing apparatus and receives other user-disclosure information from the other apparatus. The other user-disclosure information includes information about content being displayed by the other apparatus. The apparatus produces a determination result indicating whether a requested connection to the other information-processing apparatus is authorized by the other information-processing apparatus based on a response received from the other information-processing apparatus. The apparatus transmits/receives image and voice data to/from the other apparatus when authorized. The apparatus synthesizes content being displayed by the other apparatus.

Abstract: A computer system connected to a communication network processes image files. A second computer connected to the network includes the image files and the program for processing the image files. The first computer includes a costing program for determining a time cost for the first computer to process the image files stored there, and for determining a combined cost of the first transfer cost, the second processing cost, and the second transfer cost. The image file(s) are transferred over the network from the first computer to the second computer if the costing program determines that the combined cost is smaller than the first processing cost.

Abstract: The present invention extends to methods, systems, and computer program products for organizing resources into collections to facilitate more efficient and reliable resource access. Namespace managers communicate with one another to form a federation namespace infrastructure. The infrastructure can efficiently route, migrate, and process namespace requests, such as, for example, namespace registration requests from providers requesting to manage portions of namespaces and lookup requests from consumers requesting access to managed resources. Resources can be registered in and made accessible from multiple different namespaces. Resources can be identified using nested queries that filter results at multiple levels of a hierarchical namespace.

Abstract: The flow of information to or from an application on a host machine is regulated by a trusted agent operating in conjunction with at least one security element, such as a firewall or a policy server. When a communication to or from the application is detected by the trusted agent, the trusted agent gathers information about the attempted communication, and formulates and sends a message based upon the gathered information to at least one security element. The security element makes a decision to permit or block at least part of the attempted communication based upon the message received from the trusted agent.

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: A blade system and method establishes a shortest path to transmit packets in blade servers of the blade system. The blade system reads status information of each blade server using a shelf manager and connection information among the blade servers. A shortest path among the blade servers is calculated by a depth-first search (DFS) algorithm according to the connection information. The blade system sets a configuration file of the each blade server to transmit the packets among the blade servers according to the calculated shortest path.

Abstract: Provided is a method for assigning a domain host configuration protocol (DHCP) server from a list of available DHCP servers based upon user selected criteria. When a network router receives a request for an IP address from a computer, or “client,” connected to a network, the request is analyzed for information related to both the client and the available DHCP servers. The analysis may be based upon a number of factors such as the number of previous requests to a particular DHCP server and the proximity of the servers to the computer requesting the IP address. Once the router determines an appropriate DHCP server for a particular IP address request, the client request is forwarded to that DHCP server. The process is completely transparent to both the requesting client and to the selected DHCP server.

Abstract: With the advent of virtualization technologies, networks and routing for those networks can now be simulated using commodity hardware rather than actual routers. For example, virtualization technologies such as those provided by VMWare, XEN, or User-Mode Linux can be adapted to allow a single physical computing machine to be shared among multiple virtual networks by providing each virtual network user with one or more virtual machines hosted by the single physical computing machine, with each such virtual machine being a software simulation acting as a distinct logical computing system that provides users with the illusion that they are the sole operators and administrators of a given hardware computing resource. In addition, routing can be accomplished through software, providing additional routing flexibility to the virtual network in comparison with traditional routing. As a result, in some implementations, supplemental information other than packet information can be used to determine network routing.

Abstract: In one embodiment, a more capable device (MCD) in a computer network may determine one or more a critical destinations (CDs), and may transmit an unsolicited reactive routing route request (RREQ) message to each CD. The MCD may then receive a route reply (RREP) message from the CDs having a route from the MCD to the CD, and may store the route at the MCD. Subsequently, the MCD may transmit a RREP message of its own to one or more less capable devices (LCDs) to provide the route from each respective LCD to the CD via the MCD.

Abstract: The solution to the shortest path between a source node and multiple destination nodes is accelerated using a grouping of nodes, where the nodes are grouped based on distance from the source node, and a corresponding set of memory locations that indicate when a group includes one or more nodes. The memory locations can be quickly searched to determine the group that represents the shortest distance from the source node and that includes one or more nodes. Nodes may be grouped into additional groupings that do not correspond to the set of memory locations, when the distance from the source node to the nodes exceeds the range of memory locations. Advantageously, the disclosed system and method provide the ability to reach asymptotically optimal performance.

Abstract: A grid computing system and method is provided for medical data processing. The grid computing system comprises a software infrastructure, and an imaging device capable of interfacing with the software infrastructure over a distributed electronic network. Also included is a plurality of CPUs capable of interfacing with the software infrastructure over the network. The performance of the plurality of CPUs is dependent on balancing load. A large medical dataset is split onto several processing nodes of the plurality of CPUs, respectively, such that performance and power is increased. In the grid computing method, a grid is limited to a nuclear medicine or radiology network. A tight and easy configuration management of computing nodes, and a tight load balancing between standardized nodes are provided. An existing network of CPUs is utilized, such that the greatest benefit is provided at the lowest cost.

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 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 network management device includes a topology information generation unit which generates topology information of multi-layer network, a link identification information setting unit which sets identification information to identify links of the multi-layer network, a topology information transmission unit which transmits, to a route calculation engine, the topology information of the multi-layer network generated by the topology information generation unit, a shortest route calculation request transmission unit which transmits, to the route calculation engine, a calculation request of a shortest route, a multi-layer restriction checking unit which checks a restriction condition to the shortest route information received from the route calculation engine, based on the identification information of each link set by the link identification information setting unit, and an exception link selection unit which selects an exception link when the shortest route information transmitted from the route calculation eng

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: Systems and methods for performing storage operations over multi-stream data paths are provided. A first agent receives a request for a storage operation from a storage manager, identifies folders of a client computing device based on one or more file types of files in the folders of the client computing device, weights the folders based on the amount of data in the folders, and groups the folders into two or more sets of folders based at least in part on a file type of one or more of the files in the folders and the weight of the folders. A second agent transmits data from each of the two or more sets of folders to one or more storage devices in via at least one of two or more streaming communications paths based on pathway characteristics.

Abstract: A system and method for managing private information while using semi-trusted interfaces is described. In an embodiment, an intermediate node may receive a first and second communication between a semi-trusted node and a trusted node. In managing private information, the intermediate node may append private information to the first communication sent from the semi-trusted node to the trusted node, and remove private information from the second communication sent from the trusted node to the semi-trusted node.

Abstract: The present invention extends to methods, systems, and computer program products for organizing resources into collections to facilitate more efficient and reliable resource access. Namespace managers communicate with one another to form a federation namespace infrastructure. The infrastructure can efficiently route, migrate, and process namespace requests, such as, for example, namespace registration requests from providers requesting to manage portions of namespaces and lookup requests from consumers requesting access to managed resources. Resources can be registered in and made accessible from multiple different namespaces. Resources can be identified using nested queries that filter results at multiple levels of a hierarchical namespace.

Abstract: “A method of selecting a stream server to which to direct a content title includes (a) comparing a top-tier cache ease of entry for each of multiple of stream servers, (b) if one of the stream servers has a more favorable top-tier cache ease of entry than each of the other stream servers, selecting the one stream server with the more favorable top-tier cache ease of entry to which to direct the title, (c) if the top-tier cache ease of entry for all of the stream servers is equal, comparing a next-lower-tier cache ease of entry for each of the plurality of stream servers, and (d) if one of the plurality of stream servers has a more favorable next-lower-tier cache ease of entry than each of the other stream servers, selecting the one stream server with the more favorable next-lower-tier cache ease of entry to which to direct the title.

Abstract: The present invention creates an electronic marketplace where owners of Internet domain names can have multiple parties compete for the right to lease their domain names. A marketplace provider supplies a technology for redirecting Internet traffic from leased domain names to domain names specified by parties that win the right to lease domain names.

Abstract: Techniques for routing data between network area are disclosed. In one particular exemplary embodiment, the techniques may be realized as a method for routing data between layer 2 network areas of backbone bridges comprising the steps of receiving data at a network element containing an internally terminated Network to Network Interface (NNI) for a plurality of network areas, identifying a destination address associated with the data, determining a network area of the plurality of network areas associated with the data, and performing one or more data flow treatments associated with the data using the internally terminated Network to Network Interface (NNI).

Abstract: A method of selecting a suitable service for the delivery of a communication across an integrated network is disclosed. Before now, users had to select the service that best suited their needs at the time of each delivery. By providing a computer programmed to act as a purchasing agent with data indicating the desirability of stability in the network service (that data representing the price the user is prepared to pay for stability) an automatic selection of the service to be provided to the communication is enabled. An embodiment is described in which different degrees of stability are given to different content file deliveries in dependence on the importance attached to the recipient by a content provider. The invention could equally be used to provide an appropriate services for many different types of network traffic.

Abstract: A method includes receiving a data unit, determining whether a current state, associated with a deterministic finite automata (DFA) that includes a portion of states in a bitmap and a remaining portion of states in a DFA table, is a bitmap state or not, and determining whether a value corresponding to the data unit is greater than a threshold value, when it is determined that the current state is not a bitmap state. The method further includes determining whether the current state is insensitive, when it is determined that the value corresponding to the data unit is greater than the threshold value, where insensitive means that each next state is a same state for the current state, and selecting a default state, as a next state for the current, when it is determined that the current state is insensitive.

Abstract: Disclosed in a technique for providing a binding update method and the like capable of resolving such a situation that a BA message keeps reciprocating between HAs. According to the technique, there is provided a binding update method, in which a mobile terminal transmits, to a home agent of the mobile terminal, a first message containing an address that is the destination to that the home agent forwards, and the home agent of the mobile terminal updates, based on the first message, a cache in which a home address of the mobile terminal is associated with an address that is the destination to that the home agent forwards, and transmits a second message as a reply to the first message to the mobile terminal, wherein when receiving the second message, the mobile terminal transmits, to the home agent of the mobile terminal, a third message notifying that the second message has been received, and after receiving the third message, the home agent of the mobile terminal updates the cache.

Abstract: Included are embodiments of a method for routing communication data to a plurality of recorders. At least one embodiment of a method includes passively receiving communication data related to a communication and determining to which recorder the received communication data is to be routed in order to achieve a substantially balanced utilization of the plurality recorders. Other embodiments include routing the communication data to the determined recorder.

Abstract: Transferring data in a data processing system network is provided. Transferring data in a data processing system network according to the invention includes determining an adapter among a plurality of adapters that has the lowest transmit latency, and assigning data to be transferred to the adapter determined to have the lowest transmit latency. The data to be transferred is then transferred by the assigned adapter.

Abstract: Example systems and methods associated with router synchronization are described. One example method includes reducing a likelihood that a first network device will be favored over a peer device as a router. This likelihood may be increased after the first network device has received a threshold amount of routing information from the peer device. This may allow the first network device to begin performing non-routing related tasks after it starts up without causing interruption of data streams for which the first network device does not have current routing information.