Abstract: An address of a terminal on a network is fixed during the session. The present invention provides an electronic apparatus that can be connected to a network, including, a communication unit communicating with another electronic apparatus existing on the network, a temporary-address setting unit setting a temporary address that is temporarily valid on the network, an address-requesting unit requesting that an address management apparatus connected to the network should set an address at a predetermined timing, when the temporary address is set, and an address-request stopping unit inhibiting the address-requesting unit from operating, while the communication unit is communicating with the other electronic apparatus, by using the temporary address.

Abstract: A system for automated installation of a communication line using an optimal route between a source location and a destination location is disclosed. The system includes a routing module configured to provide an automated design process for rendering the optimal route. The routing module utilizes a routing algorithm to select the optimal route from a graph of capacity links defining a plurality of possible routes between the source and destination locations. If, at any time during the design process, the optimal route or capacity links defining the optimal route are detected as unavailable for any reason, the routing module re-initiates the design process and thereafter selects a new optimal route based upon a new capacity graph built without the previously unavailable capacity link. A command and control engine manages the process for assigning the optimal route in the provisioning system.

Abstract: A system and method of processing data and managing protocol timers in a stateful protocol processing system configured to process multiple flows of messages is disclosed herein. The method includes receiving a first plurality of messages of a first of the flows comporting with a first stateful protocol. The method further includes assigning a first protocol processing core to process event information derived from the first plurality of messages. A first flow timer associated with the first of the flows is set, and a first timeout expiration event is generated upon expiration of the first flow timer. The first timeout expiration event is then forwarded to the first protocol processing core, and a first flow state associated with the first flow is retrieved in response thereto.

Abstract: The present invention relates to a device and method for managing inbound and outbound communications for a multi-homed network. A connection manager is located on a local network that is connected to an external network, such as the Internet, through multiple service provider connections. The connection manager intercepts all communication packets that are inbound to the local network from the external network and all packets that are outbound from the local network to the external network. The connection manager then associates the packets with a particular ISP connection based on the availability and bandwidth load status of the ISP connections.

Abstract: A method and system facilitate communications between an unassociated device and a server via a mesh network and a wide area network. The method may include receiving transmissions from candidate proxy devices, wherein each candidate proxy device is associated with a mesh network. The method may include selecting a proxy device from the candidate proxy devices. The method may include communicating with a server via the proxy device and the associated mesh network.

Abstract: According to particular embodiments, determining disjoint paths includes receiving a graph representing a network comprising nodes and links. The graph is transformed such that the number of intermediate nodes of a path indicates the number of regenerators for the path. A set of seed paths from a source node to a destination node of the transformed graph is generated. For each seed path, a shortest path from the source node to the destination node is determined to yield one or more pairs of disjoint paths from the source node to the destination node. An optimized pair of disjoint paths is selected, where the optimized pair of disjoint paths has an optimized number of regenerators.

Abstract: An admission control system is disclosed in combination with a network and a computing system in communication with the network. The computing system is configured to determine a class of service requirement from a service request. The computing system is furnished with topology information about the network, a portion of the topology being based on a protocol (e.g., Multiple Spanning Tree protocol) whereby multiple paths are created for provisioning a connection for the service request. A mechanism is configured to determine if at least one path is available that satisfies the class of service requirement and to admit the service request into the network when the path is available for provisioning the connection. Bandwidth usage may be tracked and used in provisioning decisions. Requests may be made to the network to add bandwidth (e.g., through additional optical wavelengths) to accommodate service requests.

Abstract: Techniques for determining user types based on multi-modal clustering are provided. The topology, content and usage of a document collection or web site is determined. The user paths are identified using longest repeating subsequence techniques and a multi-modal information need vector is determined for each significant user path. Multi-modal vectors for each document in the significant path, content, uniform resource locators, inlink and outlink multi-modal vectors are determined and combined based on path position and access frequency. Multi-modal clustering is performed based on a multi-modal similarity function and a specified measure of similarity using a type of multi-modal clustering such as K-means or wavefront clustering. The identified clusters may be further analyzed based on changes to the weighting of the corresponding content, url, inlinks and outlinks multi-modal feature vectors.

Abstract: Techniques are described for reducing the amount of data traffic carried on inter-chassis links within a multi-chassis router. A multi-chassis router is described in which the packet forwarding engines (PFEs) of each chassis receive and modify forwarding structures, generated in accordance with various load-balancing protocols, to exhibit a chassis-local link preference. Each of the PFEs may implement a selection bias for forwarding paths that egress from the multi-chassis router at the member chassis that includes the ingress PFE.

Abstract: Techniques are disclosed for network distribution and provisioning of applications, such as transactional applications and parallel applications, across multiple administrative domains that ensure compliance with service level agreements. For example, a method of provisioning one or more resources in a distributed computing network to ensure compliance with a service level agreement associated with a computer application includes the following steps. Network performance is monitored between a local domain and one or more cooperating domains connected to the local domain by network paths. A present or predicted violation of the service level agreement is identified based on at least a portion of results of the monitoring step. One or more cooperating domains are selected that can effect compliance with the service level agreement by instantiating one or more network resources within at least one of the selected cooperating domains in response to a request from the local domain.

Abstract: The present invention provides a method and an apparatus for abstracting logical topology information of a Peer-to-Peer (P2P) network. The method includes: obtaining a set of Points of Presence (POPs) of peer clients in the P2P network; using a relevant algorithm of a routing protocol to calculate a best path between any two POPs in the set of POPs and a weight value of the best path; and collecting calculation results of the best path and the weight value that are obtained on each POP to obtain a set of abstract logical topology records of the P2P network. The embodiments of the present invention provide a universal and efficient method for abstracting logical topology information, which greatly reduces network topology information that needs to be transmitted, mitigates a risk of exposing lower-layer network topology information, and transmits the network topology information to a P2P application server securely and concisely.

Abstract: A method of establishing a secure communication channel between end nodes of an IP communication network via one or more intermediate nodes using the Secure Shell, SSH, protocol, the method comprising defining an SSH configuration file containing a plurality of sections, each section defining parameter values for a corresponding hop of the tunnel and an identification of the section defining parameter values for any subsequent hop. At that end node, a first instance of an SSH client is established, with the name of the configuration file being an initialization value for the first instance, and using the parameter values contained in a first section of the configuration file to establish a first SSH connection to the next node in the sequence.

Abstract: A transaction message is received at a router. A determination is made whether the transaction message includes an affinity. The affinity indicates an administrator-specified preference regarding processing of the transaction message. When the transaction message includes the affinity, a server system to process the transaction message is identified based on the affinity and based on a system affinity of the server system. The system affinity specifies processing characteristics of the server system. The server system includes a set of servers. The transaction message is modified to identify the server system and routed to a message queue.

Abstract: A system computes link costs for a multi-hop wireless network. During operation, the system receives topological information for the multi-hop wireless network which includes a set of nodes, a set of links, and a success probability for a respective link. The system then obtains an average media access time for the multi-hop wireless network. The system also obtains a retransmission time for a respective node in the set of nodes. Next, the system computes a link metric value for a respective link based on the corresponding link success probability, the average media access time, and the corresponding retransmission time. The system then produces a link cost for the link based on the associated link metric value.

Abstract: A method and system for rerouting data over a local area network is provided. The method comprises defining at least one port group associated with a bridging device, each port group including interfaces linked to the bridging device. A plurality of statuses for each port group is defined, the status being dependent on the individual statuses of the interfaces linked to the bridging device. At least one target port associated with each port group, each target port relating to a path for data. The method further comprises defining an action for each status of a port group and monitoring the status of the interfaces forming part of each port group. In response to determining the status of a port group, triggering the predefined action associated with the port group status at one of the port group's target ports.

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: The present invention is generally directed to a system, method and article of manufacture for accessing data represented abstractly through an abstraction model. In one embodiment, a data repository abstraction layer provides a logical view of an underlying data repository that is independent of the particular manner of data representation. A query abstraction layer is also provided and is based on the data repository abstraction layer. A runtime component performs conversion of an abstract query (i.e., a request for results or a request to modify data) into a form that can be used against a particular physical data representation. Abstract and/or physical queries are transformed according to model entities which define a relationship between logical fields of the data repository abstraction layer.

Abstract: A system, method, and computer readable medium for optimizing throughput of a stream processing system are disclosed. The method comprises analyzing a set of input streams and creating, based on the analyzing, an input profile for at least one input stream in the set of input streams. The input profile comprises at least a set of processing requirements associated with the input stream. The method also comprises generating a search space, based on an initial configuration, comprising a plurality of configurations associated with the input stream. A configuration in the plurality of configurations is identified that increases throughput more than the other configurations in the plurality of configurations based on at least one of the input profile and system resources.

Abstract: A method for measuring trust in a transaction over a public key certificate network includes associating each edge KA?KB of an public key certificate network connecting two public keys KA and KB with a probability p that information about KB is reliable, and a confidence c that is a total dollar amount of transactions which have involved using edge KA?KB. One or more authentication paths are formed in the public key certificate network starting from public key KS and ending with a target public key KT. A limit l of an amount of insurance that an owner of KS is willing to provide to a user interested in a transaction with an owner of KT is calculated, and for each amount m<l, a premium for which the owner of KS is willing to sell insurance to the user for an amount of m is calculated.

Abstract: Systems and methods for performing storage operations over multi-stream data paths are provided. Prior to performing a storage operation, it may be determined whether multi-streaming resources are available to perform a multi-stream storage operation. Availability of multi-streaming resources may be related to network pathways capable of supporting multi-stream storage operations, existing network load related to other storage operations being or to be performed, availability of components capable of supporting multi-stream storage operation, and other factors. If system resources to support multi-stream storage operations are not available, the system may optionally perform a traditional storage operation that does not incorporate multiple data streams.

Abstract: A system for optimizing the performance of a website that runs on one or more HTTP servers and is configured to receive HTTP requests from one or more clients via user agents and provide HTTP responses to the one or more clients includes an intermediary component configured to connect to the clients and the servers via network connections. The intermediary component includes a traffic management system (TMS) that includes means for managing HTTP requests originating from the clients and targeting the servers and HTTP responses originating from the servers and targeting the clients and means for redirecting the HTTP requests to the intermediary component. The intermediary component further includes a traffic processing system that includes means for receiving the redirected HTTP requests and the HTTP responses and means for applying optimization techniques to the redirected HTTP requests and the HTTP responses.

Abstract: In a network that executes a link state routing protocol, a network node receives periodic disseminations of link state information from other network nodes. The link state information includes neighboring node identity and link cost metrics. The network node calculates the initial routing paths based on the received link state information by using a link state routing algorithm. It then adapts the calculated path based on both the current link state information and past link state information through a reinforcement learning process. The network node then selects a routing path to each destination node based on the adaptation and updates the routing table accordingly.

Abstract: The idea of the present invention is to provide a challenge-response mechanism to acquire work scope split range information from the application's Work Scope Split component of the over-utilized resource. By using the work scope split range information, the provisioning system is able to add a new resource, install a new application for that new resource, configure the new and the over-utilized resource's application, and reconfigure the load-balancer in accordance with the work scope split range information. The present invention adds scalability to complex and stateful application programs and allows dynamic provisioning of resources for these application programs.

Abstract: In some networking situations, securing an inner packet of a tunnel packet requires an intermediary networking device knowing a destination address of the secured inner packet. Consequently, an identity of a secured network is known to others and presents a security risk. The provided technique addresses this risk by: i) establishing at a first security interface a first secured network connection between a first and second secured network, the connection established for a first packet addressed to a virtual security interface and destined for the second secured network; and ii) responding to a network condition by establishing at a second security interface at least one second secured network connection between the first and second secured network, the connection established for a second packet addressed to the virtual security interface and destined for the second secured network.

Abstract: When path status information is updated, the time at which the update is effective is recorded. A packet arrival time in each path is predicted based on new status information and data transmission history after the effective time. The packet is transmitted to the path that provides a fastest packet arrival time. This reflects the path status available from the reception side on the data transmitted in past, so that an actual data arrival time, an arrival time close to a reception completion time, or a reception completion time can be predicted.

Abstract: A technique for enforcing a database relationship is disclosed. The technique includes specifying within a database schema a reference type that associates two structures and specifies the relationship between the two structures, and automatically generating code that checks the relationship between the two structures based on the specified reference in the database schema.

Abstract: Systems, methods, and computer-readable storage media are disclosed for a computer system determining a transport path for a data duplication job. A data duplication job request, being a request that data stored on a source device be duplicated, may be received. A plurality of possible transport path components may be enumerated. The plurality of possible transport path components may include one or more possible destination devices, one or more possible means of transport, and one or more possible media servers. A ranking may be determined for at least a subset of the possible transport path components. An availability may be determined for at least a subset of the possible transport path components. A transport path may be selected based on the determined rankings and the determined availabilities. The data duplication job may be performed using the selected transport path.

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 invention provides multicast communication using distributed topologies in a network. The control nodes in the network build a distributed topology of processor nodes for providing multicast packet distribution. Multiple processor nodes in the network participate in the decisions regarding the forwarding of multicast packets as opposed to multicast communications being centralized in the control nodes.

Abstract: Method and system for load balancing in providing a service. A request for a service, represented by a single IP address, is first received by a router in the network. The router accesses information received from one or more advertising routers in the network. Each of the advertising routers advertises, via the single IP address, the service provided by at least one server in a server pool associated with the advertising router. The advertisement includes metrics indicating a health condition of the associated server pool. The router selects a target router based on, at least in part, the metrics of the server pools associated with the advertising routers to achieve a first level load balancing and forwards the request for the service to the target router. A local server load balancer (SLB) connected with the target router then identifies a target server from the associated server pool to provide the requested service thereby to achieve a second level load balancing.

Abstract: In one embodiment, a method can include: (i) classifying a packet in a server load balancer (SLB) for determining if the packet is destined for a virtual Internet protocol (VIP) address hosted on the SLB; (ii) selecting a server from a group of servers representing the VIP address; (iii) changing a destination IP address of the packet from the VIP address to a real IP address of the selected server; and (iv) recirculating the packet for repeating the classifying.

Abstract: A communication system comprises a node that receives a packet with a process rule sequence including a plurality of process rules that should be set in a process rule storage unit of a node on a data transfer network, and sets a process rule in the process rule storage unit of own node according to the process rule sequence.

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: A data redirection system and method comprises a first and second redirector in one or more embodiments. The first redirector may receive and respond to requests for a network service by redirecting a client's request to the second redirector. The second redirector may receive and respond to the redirected request by sending a network address of a gateway. The gateway may provide an enhanced communication link with a network resource providing the network service. In this manner, communications used to provide the network service may be redirected to the enhanced communication link. The requests for a network service and responses to the requests will typically be communicated over a standard communication link.

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

Abstract: Using the ALTO Service, networking applications can request through the ALTO protocol information about the underlying network topology from the ISP or Content Provider. The ALTO Service provides information such as preferences of network resources with the goal of modifying network resource consumption patterns while maintaining or improving application performance. This document describes, in one example, an ALTO server that implements enhancements to the ALTO service to enable initiating incremental updates of network and cost maps to ALTO clients upon receiving status information from a content delivery network (CDN) node.

Abstract: Using the ALTO Service, networking applications can request through the ALTO protocol information about the underlying network topology from the ISP or Content Provider. The ALTO Service provides information such as preferences of network resources with the goal of modifying network resource consumption patterns while maintaining or improving application performance. This document describes, in one example, an ALTO server that intersects network and cost maps for a first network with network and cost maps for a second network to generate a master cost map that includes one or more master cost entries that each represent a cost to traverse a network from an endpoint in the first network to an endpoint in the second network. Using the master cost map, a redirector may select a preferred node in the first network with which to service a content request received from a host in the second network.

Abstract: The subject matter disclosed herein relates to communication between a client and a server in a communications network. In one particular example, a server is selected from a plurality of servers to provide a resource and/or a service to a client.

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

Abstract: A distributed processing system 100 includes: a plurality of application servers 1031 to 103n that execute a plurality of applications 1321 to 132n and detect a communication state between a client 105 and the applications 1321 to 132n; a load distribution control server 101 that decides a communication path between the client 105 and the applications 1321 to 132n on a basis of the communication state detected by the application servers 1031 to 103n to perform load distribution; and an intermediate communication apparatus 102 that transfers flow data between the client 105 and the application servers 1031 to 103n.

Abstract: Each mobile router in a mobile ad hoc network is configured for measuring a minimum interval of stable relative proximity (SProxMIN) between at least one neighbor before initiating convergence of a routing protocol. The minimum interval of stable relative proximity requires any variation in relative proximity between at least one neighbor to be stabilized below a prescribed stability threshold (S) for the prescribed minimum interval (SProxMIN) before initiating convergence of a routing protocol. Hence, mobile routers in a mobile ad hoc network can be configured to avoid prematurely initiating reconvergence according to a routing protocol due to an instability introduced into the network.

Abstract: According to one embodiment, a method of decreasing latency in an anonymity network includes filtering a list of anonymity routers for a client device based on one of (i) loads of the anonymity routers on the list and (ii) distances of the anonymity routers from the client device.

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

Abstract: A method for reducing delay of playing media includes: a user node obtaining information on a list of nodes that can provide a desired program content; selects a best node among the nodes that can provide the program content corresponding to one or more time segments, wherein the program content is to be played in more than one time segment and the best node is closest to the user node among all the nodes; creating a connection with the selected best node; receiving media stream data of the program content from the best node; and playing the media stream data. An apparatus for reducing delay of media playing herein includes: a node information obtaining module, a best node selecting module, a connection creating module, and a playing module.

Abstract: Methods and computer-readable media are provided to allow for the establishment of an Internet protocol (IP) data session with a dual-stack mobile communications device by authenticating the device. An IP data session is requested, and a home agent sends an indication of this request. A DNS server that will be assigned to a device is identified by querying a database and is identified based on the device's capabilities. The device capabilities are determined by a device-capability identifier that is associated with the user of the device or the device itself, such as a network access identifier. The capabilities may include the device type, applications, programs, or services that the user of the device is subscribed to, or capabilities that are inherent to the phone. Once the DNS server is identified, a server identifier is sent to the home agent, which assigns the DNS server to the device.

Abstract: A communications terminal selection unit acquires, upon receipt of a call origination request, presence information including terminal information on terminals available to a call terminator from a presence management unit, and selects a specific terminal, if there are a plurality of terminals available to the call terminator based on the presence information, based on terminal selection information in which at least whether communication quality or charge takes priority is defined beforehand by the call terminator, notifying a call transfer unit of the selected terminal as a transfer destination terminal for call transfer.

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 path control apparatus of the present invention includes: a status change detecting unit that detects a status change of a network; a path calculating unit that decides a path in accordance with the status of the network; and a calculation execution node deciding unit that compares a shortest path tree, which is established before occurrence of a change in the status of the network calculated by the path calculating unit, with a shortest path tree, which is established after the occurrence of the change in the status of the network calculated by the path calculating unit, and creates information required for determining whether a node apparatus in the network needs a path update, when the change occurs in the status of the network.

Abstract: An ad-hoc network system for computing a proposed number of node-clusters that enable a relative threshold data rate. The ad-hoc network system includes a source terminal, a destination terminal, a plurality of relay terminals, and a cluster determination engine. The source terminal sends a network communication to a destination terminal via a plurality of relay terminals. The cluster determination engine computes a threshold data rate, C, for a number of hops, N, based on a transmission power constraint. The cluster determination engine determines a proposed route for the wireless communication from the source terminal to the destination terminal according to the threshold data rate, C.

Abstract: A client terminal CT transmits an acquisition request for musical composition information. An associated information provision server KS continuously receives the acquisition request at a given time interval. The associated information provision server KS transmits timing specification information along with the musical composition information corresponding to the acquisition request to the client terminal CT. The timing specification information specifies timing for the client terminal CT to transmit the acquisition request next. The associated information provision server KS controls a polling interval for acquisition requests. In this manner, acquisition requests can be distributed to those transmitted at a given time interval and those received in accordance with the timing specification information. A simple method can be used to prevent acquisition requests from being concentrated on the associated information provision server KS.