Entries |
Document | Title | Date |
20080215753 | Use of End-to-End Availability Calculations when Establishing a Connection - A method establishes a connection between a source node and a sing node of a communication network. One or several additional nodes represent nodes of the connection in addition to the source node and the sink node. An end-to-end availability of the connection is determined from one respective availability value of at least the additional node/s of the connection and each individual connection between two respective nodes of the connection. | 09-04-2008 |
20080222305 | NETWORK CACHE-BASED CONTENT ROUTING - Methods and apparatus are described for routing data traffic in a network having a plurality of layers including physical, data link, and network layers. The data traffic is received and one of a plurality of routing options for the data traffic is selected with reference to information outside of the physical, data link, and network layers. The data traffic is then routed according to the selected routing option. | 09-11-2008 |
20080235397 | Systems and Methods for Content-Aware Load Balancing - Improved load balancing techniques are disclosed. For example, in one illustrative aspect of the invention, a method of satisfying requests in a system comprised of a plurality of servers comprises the following steps. At least one load balancer is provided for routing requests to the plurality of servers. At the at least one load balancer, a request sent from a client is obtained. At the at least one load balancer, the request is examined. Costs of satisfying the request by at least two of the plurality of servers are estimated. The estimation is based on at least one of a number and a cost of at least one remote access for satisfying the request. The request is routed to a server of the plurality of servers with a low estimated cost of satisfying the request. | 09-25-2008 |
20080256261 | Proximity Detection Method - The invention relates to a method of determining a proximity between a root node ( | 10-16-2008 |
20080276002 | Traffic routing based on client intelligence - Techniques are described for making the best connection between a client and a server. The best connection is determined based upon the proximity of the client to the server, and the load and availability of the server. Proximity is determined by connection racing in which response times to requests made to various sets of servers are compared. The load is determined by back-end monitoring logic for each set of servers and is indicated in the response sent by the server. The availability of the server is monitored by a virtual IP server located with each set of servers. The virtual IP server selects available servers to respond to the request from the client. When the client receives responses, the client selects a server based on (a) the response times and (b) load information in the responses in order to make the best connection. | 11-06-2008 |
20080313351 | DEVICE FOR MANAGING THE RECEIPT BY TERMINALS OF MULTIMEDIA CONTENT TRANSMITTED BY INFRASTRUCTURES THAT IMPLEMENT DIFFERENT TRANSMISSION TECHNIQUES - A device (D) Is dedicated to managing the receipt of multimedia content, originating from at least two multimedia content transmission infrastructures (TI | 12-18-2008 |
20090055552 | DECRYPTING LOAD BALANCING ARRAY SYSTEM - A decrypting load balancing array system uses a Pentaflow approach to network traffic management that extends across an array of Decrypting Load Balancing Array (DLBA) servers sitting in front of back end Web servers. One of the DLBA servers acts as a scheduler for the array through which all incoming requests are routed. The scheduler routes and load balances the traffic to the other DLBA servers (including itself) in the array. Each DLBA server routes and load balances the incoming request packets to the appropriate back end Web servers. Responses to the requests from the back end Web servers are sent back to the DLBA server which forwards the response directly to the requesting client. | 02-26-2009 |
20090089452 | SYSTEM AND METHOD FOR MANAGING DEVICES CONNECTED TO A COMPUTER NETWORK - According an aspect of the embodiment, there is provided a method for managing management target devices each connected to a computer network and managed by one of a plurality of management servers. A management server list storing IP addresses of the plurality of management servers is provided. A hop count defined as the number of hops, in the computer network, from the management target device to the each of the plurality of management servers is obtained and a management server having the smallest hop count among the plurality of management servers is selected as an optimum management server. Then, the management target device is managed under the control of the selected optimum management server. | 04-02-2009 |
20090150564 | PER-USER BANDWIDTH AVAILABILITY - A system for calculating bandwidth availability for best servicing a user is disclosed. The system optimizes network performance and network utilization by making use of routing table information and bandwidth utilization information between the servers and the user. | 06-11-2009 |
20090150565 | SOA infrastructure for application sensitive routing of web services - Various exemplary embodiments are a system and related method for application sensitive forwarding of a request for a web service including a broker that manages the forwarding of the request, a metric table that stores statistics for the web service, and a database storing the metric table and least one load balancing policy. Various exemplary embodiments include an optimization policy manager that manages forwarding of the request, a class of services table that stores information, and a database storing the class of services table and at least one optimization policy. Various exemplary embodiments include a database storing a security-based policy and a location-based policy defining trust environments, a request processor that receives the request from the client and determines a current environment of the client based on the at least one location-based policy, and a quarantining subsystem that drops the request when the request violates the security-based policy. | 06-11-2009 |
20090172190 | LINK STATE PROTOCOL ROUTING MESSAGE CONTAINMENT - In one example embodiment, a system and method are shown that includes calculating a first SPF tree for a first device, the first SPF tree including a root node and a first child node, the first device being the root node of the first SPF tree. Additionally, the system and method may include calculating a second SPF tree for a second device that is a neighbor of the first device, the second SPF tree including a root node and a first child node, the second device being the root node of the second SPF tree. Further, the system and method may include building a set of interested nodes including the second device, if the first child node if the first SPF tree and the first child node of the second SPF tree are distinct. | 07-02-2009 |
20090172191 | SYSTEM AND METHOD FOR ROUTING SERVICE REQUESTS - A computer-implemented method routes service requests to services in a service framework provided by a plurality of hosts. The method comprises receiving a service request for a service in the service framework and discovering a plurality of candidate hosts that host the service. The plurality of candidate hosts are a subset of the plurality of hosts. The method further comprises selecting a candidate host from the plurality of candidate hosts based on measured latencies for the plurality of candidate hosts and routing the service request to the selected candidate host. | 07-02-2009 |
20090182896 | Various methods and apparatuses for a route server - 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. | 07-16-2009 |
20090193146 | Utilizing Virtual Server Weight for Loadbalancing - In one embodiment, a method includes receiving current weight data from one or more hosts associated with a virtual server and configuring a maximum weight of the virtual server. The method includes communicating the sum of the current weight data from all of the hosts to a global loadbalancer and communicating the maximum weight of the virtual server to the global loadbalancer. | 07-30-2009 |
20090193147 | Methods and Systems for the Use of Effective Latency to Make Dynamic Routing Decisions for Optimizing Network Applications - The present invention relates to systems, apparatus, and methods for implementing dynamic routing. The method includes receiving a request for data located at a content server from a client system and determining latency between the client system and the content server. Based on the latency between the client system and the content server being greater than a first threshold value, the method determines latency between the client system and each of a plurality of acceleration servers. The method selects the acceleration server with the lowest latency, and determines latency between the selected acceleration server and the content server. Furthermore, based on the latency between the selected acceleration server and the content server being less than a second threshold, the method establishes an acceleration tunnel between the client system and the content server through the selected acceleration server and transfers the requested data to the client system using the acceleration tunnel. | 07-30-2009 |
20090234968 | SERVER SELECTION FOR ROUTING CONTENT TO A CLIENT USING APPLICATION LAYER REDIRECTION - 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. | 09-17-2009 |
20090248894 | Determining A Path For Network Traffic Between Nodes In A Parallel Computer - Determining a path for network traffic between a source compute node and a destination compute node in a parallel computer including identifying a group of compute nodes, the group of compute nodes having topological network locations included in a predefined topological shape; selecting, from the predefined topological shape, in dependence upon a global contention counter stored on the source compute node, a path on which to send a data communications message from the source compute node to the destination compute node; and sending, by the messaging module of the source compute node, the data communications message along the selected path for network traffic between the source and destination compute nodes. | 10-01-2009 |
20090248895 | Determining A Path For Network Traffic Between Nodes In A Parallel Computer - Determining a path for network traffic between a source compute node and a destination compute node in a parallel computer including: beginning with an identified group of compute nodes that includes the source compute node and iteratively until an identified group of compute nodes includes the destination compute node: identifying a group of compute nodes, the group of compute nodes having topological network locations included in a predefined topological shape; selecting a path for network traffic between compute nodes having topological network locations included in the predefined topological shape, and when an identified group of compute nodes includes the destination compute node: selecting a final path for network traffic; and sending a data communications message along the path for network traffic between the source compute node and the destination compute node, the path including, in order of selection, the selected paths and the selected final path. | 10-01-2009 |
20090259768 | Application load distribution system in packet data networks - The present invention routes an application request to at least one of a plurality of sites in a packet data network. Session Initiation Protocol (SIP) messages that establish initial dialogs and SIP messages that are stand-alone requests are sent from a call session control function system to a SIP application load distribution system. The SIP application load distribution system routes a SIP message to at least one destination site, based at least in part on user-defined local state data and a user-defined application load distribution policy. Local state data is sent from a plurality of sites to an application management and health checking system. Local state data may be sent autonomously from the plurality of sites. Local state data may also be sent from the plurality of sites in response to a request issued by the application management and health checking system. | 10-15-2009 |
20090259769 | Dynamic Component Placement in an Event-Driven Component-Oriented Network Data Processing System - Method, system and computer usable program code for dynamic component placement in an event processing system having producers, consumers, a plurality of nodes between the producers and the consumers, and a flow graph representing computational components to be executed between the producers and the consumers. A description of a change to the system is received. At each node, next-hop neighbor nodes for each consumer are identified. A routing value is assigned to each next-hop neighbor node for each consumer. Using the routing values in a context of the change, a performance cost of the system is estimated based on hypothetical changed placements of the computational components at nodes along paths from a producer to a consumer through the next-hop neighbor nodes for each consumer, and a changed placement of the computational components that minimizes performance cost of the system relative to the hypothetical changed placements is selected. | 10-15-2009 |
20090319687 | STREAMING OPERATOR PLACEMENT FOR DISTRIBUTED STREAM PROCESSING - A streaming operator assignment system and method for determining a streaming operator assignment that minimizes overload in a data processing system. Embodiments of the streaming operator assignment system include an optimization goals definition module, which defines optimization goals in terms of fundamental quantities that system administrators and application writers want to control, such as minimizing the worst case latency over all periods of time, or minimizing how much the system is backlogged with work. Embodiments of the streaming operator assignment system also include an optimization goals solution module that optimizes and solves a selected optimization goal. A specialized optimization technique is used to find the best operator (or load) assignment using the optimization goals to measure of the value of the assignment. This technique minimizes an optimization goal by iterating over all possible operators assignments over all possible nodes to find the operator assignment that minimizes the desired optimization goal. | 12-24-2009 |
20100017537 | METHOD OF SELECTING NODES - There is provided a method ( | 01-21-2010 |
20100017538 | METHOD AND APPARATUS FOR PROVIDING COMPOSITE LINK ASSIGNMENT IN NETWORK DESIGN - A method and apparatus for composite link assignment are provided such that network capacity is sufficient to handle all the traffic (e.g., load) while an objective function, e.g., the total cost of the capacity is minimized. The present method receives a plurality of weights for a plurality of arcs and a load for the network. An objective function is selected for minimization, where the present method then determines the composite link assignment to handle the load while the objective function is minimized. In one embodiment, the composite link assignment comprises a plurality of different link types for the plurality of arcs. | 01-21-2010 |
20100057935 | RECORD MEDIUM WITH A LOAD DISTRIBUTION PROGRAM RECORDED THEREON, LOAD DISTRIBUTION METHOD, AND LOAD DISTRIBUTION APPARATUS - A record medium on which a load distribution program capable of dynamically determining a service providing server which can provide a service of high quality according to a place where a client is installed is recorded. A delay time determination section analyzes a request sent from a client, identifies a position on a network of the client, and determines processing delay time the client takes to receive a response from each data center on the basis of a communication path between the position of the client and a position on the network of each data center. An allocation determination section preferentially selects a data center which can provide a service to the client after shortest processing delay time as a recommended data center on the basis of the processing delay time determined by the delay time determination section. A service allocation section makes a server in the recommended data center provide the service to the client which outputted the request. | 03-04-2010 |
20100077103 | ROUTE CALCULATION SYSTEM, NETWORK MANAGEMENT DEVICE, ROUTE CALCULATION ENGINE, ROUTE CALCULATION METHOD AND PROGRAM PRODUCT - 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 engine does not satisfy the restriction condition of the multi-layer, wherein when the shortest route information received from the route calculation engine does not satisfy the restriction condition of the multi-layer, the network management device repeats setting the exception link and transmitting a re-calculation request of the shortest route, until the restriction condition of the multi-layer is satisfied. | 03-25-2010 |
20100088427 | Selective Routing of Data Transmission Between Clients - A method for selective routing of data transmission between clients is provided to select a better communication channel from a direct P2P channel and a relay channel according to routing hop counts of the pats. The method obtains a first routing hop count from a first client to a second client assuming a direct P2P channel therebetween, a second routing hop count from the first client to a relay server assuming a relay channel through the relay server, and a third routing hop count from the relay server two the second client assuming the relay channel through the relay server, and compares the sum of the second routing hop count and the third routing hop count with the first routing hop count. The method then selects a better data transmission channel from the direct P2P channel and the relay channel between the first client and the second client based on a comparison result. Also disclosed is a system using the method for selective routing. | 04-08-2010 |
20100198985 | AUTOMATIC NETWORK CLUSTER PATH MANAGEMENT - Automatic network configuration of cluster paths to access data within a cluster is described. Each node of the cluster presents to clients an image of the cluster as a single system. Each node also stores information regarding what node has particular data, as well as information about network addresses and corresponding network capabilities for the various network addresses for each node. When a node receives a request for data, the node determines a node where the request data can be accessed, determines network addresses and network capabilities for each network address of the node, and selects a path to access the node based on the determined information. The receiving node may select the path based on network type and capability, as well as load and performance of the network. | 08-05-2010 |
20100293294 | PEER-TO-PEER COMMUNICATION OPTIMIZATION - A peer-to-peer communication optimizer uses both peer locality and content diversity in a peer group to reduce network usage cost associated with using remote peers in a peer-to-peer system while reducing impact on the download time relative to peer-to-peer protocols operating with locality optimization alone or no localization of peers. The optimizer intercepts control messages in the peer-to-peer system and substitutes peer lists that meet both diversity indicator and network usage cost thresholds. Transparent embodiments operate without requirement to change peer or tracker implementations. Such embodiments include control message redirection, interception, and modification transparent to the client and tracker applications. Other embodiments include proxy designation. Still other embodiments include the use of gateway peers selected as function of diversity of content and network topology. Still other embodiments involve modification to one or more of client and/or tracker software and potentially the use of a standard interface for network topology determination. | 11-18-2010 |
20100299451 | IMS DIAMETER ROUTER WITH LOAD BALANCING - A Diameter router ( | 11-25-2010 |
20100299452 | METHOD AND SYSTEM FOR PROVIDING NETWORK AND ROUTING PROTOCOLS FOR UTILITY SERVICES - A method and system for providing a network and routing protocol for utility services are disclosed. In one embodiment, a computer-implemented method comprises discovering a utility network, wherein a utility device (for example, a constant powered meter) sends network discovery messages to find the utility network. Neighboring meters are discovered and the device listens for advertised routes for one or more networks from the neighbors. The device is then registered with one or more utility networks, receiving a unique address for each network registration. Also illustrated in this invention disclosure is how each device of a class of devices (for example, battery powered meter) finds and associates itself with another device (for example, constant powered meter). The constant powered meter also registers its associate battery powered meter with the utility networks. The constant powered meter registers itself with the access points and the upstream nodes in the path out of each network. Each upstream node can independently make forwarding decisions on both upstream and downstream packets i.e. choose the next hop according to the best information available to it. The constant powered meter can sense transient link problems, outage problems, and traffic characteristics. It uses the information to find the best route out of and within each network. Each network device thus maintains multi-egress, multi-ingress network routing options both for itself and the device(s) associated with it. | 11-25-2010 |
20110022726 | METHOD AND APPARATUS FOR TRAFFIC FORWARDING IN A STACKING APPARATUS - Embodiments of the present invention provide a method and device for traffic forwarding in a stacking apparatus which includes multiple member devices. The method includes: obtaining, by a member device, a forwarding table size of each member device in the stacking apparatus; choosing a member device having the largest forwarding table as a proxy device when a forwarding table of another member device in the stacking apparatus is larger than that of the member device; transmitting all or part of to-be-forwarded traffic to the proxy device which performs traffic forwarding. According to the present invention, forwarding capability of member devices having larger forwarding tables is utilized for providing proxy forwarding for member device having smaller forwarding tables, so that forwarding sizes of the member devices having different forwarding table sizes in the stacking apparatus are unified and forwarding capabilities of the member devices in the stacking apparatus are fully used. | 01-27-2011 |
20110022727 | HANDSET CRADLE - An embodiment of a handset cradle includes a base component and a handset component configured to couple with the base component. The handset component provides an interface with a particular type of handset selected from a plurality of handset types. This interface enables an exchange of data between the base component and a handset interfacing with the handset component. | 01-27-2011 |
20110060844 | Method and Apparatus for Selecting Between Multiple Equal Cost Paths - Each equal cost path is assigned a path ID created by concatenating an ordered set of link IDs which form the path through the network. The link IDs are created from the node IDs on either set of the link. The link IDs are sorted from lowest to highest when creating the path ID to facilitate ranking of the paths. The low and high ranked paths are selected from this ranked list as the first set of diverse paths through the network. Each of the link IDs on each of the paths is then renamed, for example by inverting either all of the high node IDs or low node IDs. After re-naming the links, new path IDs are created by concatenating an ordered set of renamed link IDs. The paths are then re-ranked and the low and high re-ranked paths are selected from this re-ranked list as the second set of diverse paths through the network. Selective naming of node IDs and use of different inversion functions can be exploited to further optimize distribution of traffic on the network. | 03-10-2011 |
20110066754 | Intelligent Device and Media Server Selection for Optimized Backup Image Duplication - 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. | 03-17-2011 |
20110072156 | SYSTEMS AND METHODS FOR NETWORK ROUTING - 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. | 03-24-2011 |
20110093616 | SYSTEM AND METHOD FOR MULTI-LINK COMMUNICATION IN HOME NETWORK - A client in a home entertainment network can communicate with other components, including the server, over both a wired and a wireless link, with the particular path being selected based a component preference, and/or a bandwidth capability, and/or an occupancy ratio. Both links may be simultaneously used. | 04-21-2011 |
20110113155 | METHODS AND SYSTEMS FOR DYNAMICALLY ADAPTIVE ROAD NETWORK HIERARCHY AND ROUTING - A system and method for computing routing on a road network are described. One embodiment includes pre-processing routing data for one or more environmental profiles integrated into a hierarchy, dynamically adding links to the hierarchy in response to real-time data on traffic conditions, and cluster-routing to approximate routing travel costs based on realtime traffic data A further embodiment includes a) identifying one or more portions of a road network as being more preferable than normal based on real-time data, b) expressing the one or more portions of the road network as a sequence of locations comprising a uniquely identifiable path, c) using the sequence of locations comprising a uniquely identifiable path to add one or more links to an already constructed hierarchical network of roads, and d) enabling a pathfinding algorithm to adjust to the real-time data. | 05-12-2011 |
20110138073 | CONNECTION DESTINATION SELECTION APPARATUS AND METHOD THEREOF - A connection destination selection apparatus, in a network in which one reception device receives data distributed from a data distribution device and transfers the data received to another one of a plurality of reception devices which is connected to the one reception device, to select a reception device that becomes a connection destination of a new reception device that newly connects to the network, the apparatus includes, a first route information retaining unit to retain, for each of the reception devices that receives the data, corresponding first route information that is route information from the data distribution device to the each reception device; a second route information acquisition unit to acquire second route information that is route information from the data distribution device to the new reception device; and a connection destination selection unit to select at least one reception device corresponding to the first route information. | 06-09-2011 |
20110173344 | SYSTEM AND METHOD OF REDUCING INTRANET TRAFFIC ON BOTTLENECK LINKS IN A TELECOMMUNICATIONS NETWORK - A system, method and node of masquerading remote hosts at the remote end of the bottleneck link without breaking layer 2 transparency using a cache mechanism. A local edge node stores specified objects of the remote host. Upon request of an initiator host, the edge node sends the stored object to the initiator host without requiring the transfer of the object from the remote host. The present invention also provides for the election of a Local Master Browser (LMB). The method consists of electing one LMB for spreading information for each LAN segment, instead of having one such global node for the entire LAN. The present invention elects one local LMB for each LAN segment, rather than using one global LMB node. | 07-14-2011 |
20110219143 | PATH CALCULATION ORDER DECIDING METHOD, PROGRAM AND CALCULATING APPARATUS - A path calculation order deciding method that is implemented by a calculating apparatus ( | 09-08-2011 |
20110258341 | PATH CONTROL APPARATUS, PATH CONTROL METHOD, PATH CONTROL PROGRAM, AND NETWORK SYSTEM - 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. | 10-20-2011 |
20110258342 | CONTENT DELIVERY NETWORK - 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. | 10-20-2011 |
20110276718 | Decreasing latency in anonymity networks - 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. | 11-10-2011 |
20110276719 | TRADING MECHANISM - The present invention relates to methods and apparatus for buying connectivity. A routing engine | 11-10-2011 |
20110289235 | Distributed processing system and distributed processing method - A distributed processing system | 11-24-2011 |
20110296053 | APPLICATION-LAYER TRAFFIC OPTIMIZATION SERVICE SPANNING MULTIPLE NETWORKS - 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. | 12-01-2011 |
20110302321 | DATA REDIRECTION SYSTEM AND METHOD THEREFOR - 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. | 12-08-2011 |
20110307628 | Communication system, node, control server, communication method and program - 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. | 12-15-2011 |
20110314180 | VIRTUAL SERVER RECIRCULATION - 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. | 12-22-2011 |
20120096183 | DYNAMIC REROUTING OF SERVICE REQUESTS BETWEEN SERVICE ENDPOINTS FOR WEB SERVICES IN A COMPOSITE SERVICE - Technologies are described herein for rerouting a service request between service endpoints. The service request is received, at a first web service, from a second web service. The first web service and the second web service may be components of a composite service. The service request is routed to an initial service endpoint configured to respond to the service request according to a service level agreement between the first web service and the second web service. Service criteria associated with the initial service endpoint are monitored. A determination is made as to whether the service criteria meet a performance threshold specified by the service level agreement. If the service criteria do not meet the performance threshold specified by the service level agreement, then the service request is rerouted from the initial service endpoint to an alternate service endpoint. | 04-19-2012 |
20120102224 | OPTIMIZED CONSUMPTION OF THIRD-PARTY WEB SERVICES IN A COMPOSITE SERVICE - Technologies are described herein for routing a service request to an appropriate web service. A first service request is routed from a first web service to a second web service. Routing factors associated with the second web service are monitored. A determination is made as to whether the routing factors indicate that the second web service is no longer appropriate for handling service requests. If the routing factors indicate that the first web service is no longer appropriate for handling service requests, then a second service request is routed from the first web service to a third web service. The first web service, the second web service, and the third web service are included in a composite service. | 04-26-2012 |
20120102225 | METHOD AND APPARATUS FOR ROUTING REQUESTS FOR SERVICE USING BGP COMMUNITY ATTRIBUTES - According to one embodiment, an apparatus that makes improved routing decisions is provided that includes a receiver, a retriever, a proximity engine, and a transmitter. The receiver may be configured to receive a request from a source. The retriever may be configured to retrieve a plurality of providers capable of servicing the request. The proximity engine may be configured to rank the plurality of providers based on weights indicative of a network distance. The weights may correspond to a first Border Gateway Protocol (BGP) community attribute associated with the source and at least a second BGP community attribute associated with at least one of the providers in the plurality of providers. The transmitter may be configured to transmit the request to the provider in the plurality of providers with the highest ranking. | 04-26-2012 |
20120102226 | APPLICATION SPECIFIC WEB REQUEST ROUTING - Web request routers are used to route requests to content within a network. The web request routers run on general purpose computing devices that are configured to receive requests, parse the requests and route the requests to the appropriate destination. The web request routers may be configured to perform different routing methods and operations. For example, the web request routers may route requests based on: a type of network traffic (e.g. user/machine); application specific logic, URL patterns and/or other programmed logic. The web request routers may be configured to route the request based on a determined affinity (e.g. document, Uniform Resource Locator (URL), directory path, site collection) of the request. The web request routers may also be configured to perform QOS operations such as auditing, logging, metering, throttling network traffic, prohibiting network traffic and the like. | 04-26-2012 |
20120102227 | SYSTEM AND METHOD FOR MULTI-LINK COMMUNICATION IN HOME NETWORK - A client in a home entertainment network can communicate with other components, including the server, over both a wired and a wireless link, with the particular path being selected based a component preference, and/of a bandwidth capability, and/or an occupancy ratio. Both links may be simultaneously used. | 04-26-2012 |
20120117269 | SYSTEMS AND METHODS FOR MULTI-LAYER TRAFFIC GROOMING - 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. | 05-10-2012 |
20120117270 | Methods for reducing latency in network connections using automatic redirects and systems thereof - A method, computer readable medium, and apparatus for reducing latency in network connections include receiving at a web content optimization apparatus a request from one of one or more client devices for network content hosted at one of one or more server devices. The web content optimization apparatus determines whether an automatic redirect parameter is enabled for the request. The request from one proxy processing device acting as the requesting one of the client devices within the web content optimization apparatus is sent to another proxy processing device within the web content optimization apparatus when the automatic redirect parameter is determined to be enabled. One or more redirect messages with one or more optimized cookies associated with the requested network resource are obtained from the one or more server devices at the another proxy processing device within the web content optimization apparatus. The last of the one or more redirects messages with the one or more optimized cookies when the requested network resource is located is sent from the another proxy processing device within the web content optimization apparatus to the one proxy processing device within the web content optimization apparatus. The last of the one or more redirect messages with the one or more optimized cookies associated with the requested network resource is sent from the web content optimization apparatus to the requesting one of the one or more of client devices. | 05-10-2012 |
20120124237 | AFFINITY-BASED TRANSACTION PROCESSING - 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. | 05-17-2012 |
20120137021 | NETWORK SERVER AND LOAD BALANCING ROUTING METHOD FOR NETWORKS THEREOF - A load balancing routing method for networks is disclosed. The routing method includes following steps. A network topology graph and a plurality of expected bandwidth demands corresponding to a plurality of source-destination pairs are received by a network server. A plurality of link criticalities of a plurality of links established according to the source-destination pairs is calculated by the network server according to the network topology graph and the expected bandwidth demands. A plurality of expected loads of the links is calculated by the network server according to the link criticalities. A plurality of cost values is calculated according to a plurality of residual capacities of the links and the corresponding expected loads. A better transmission path corresponding to each of the source-destination pairs is selected by the network server according to the weighted sum of the cost values corresponding to the links in the source-destination pair. | 05-31-2012 |
20120144064 | PROGRESSIVE ADAPTIVE ROUTING IN A DRAGONFLY PROCESSOR INTERCONNECT NETWORK - A multiprocessor computer system comprises a dragonfly processor interconnect network that comprises a plurality of processor nodes and a plurality of routers. The routers are operable to adaptively route data by selecting from among a plurality of network paths from a target node to a destination node in the dragonfly network based on one or more of network congestion information from neighboring routers and failed network link information from neighboring routers. | 06-07-2012 |
20120144065 | TABLE-DRIVEN ROUTING IN A DRAGONFLY PROCESSOR INTERCONNECT NETWORK - A multiprocessor computer system comprises a dragonfly processor interconnect network that comprises a plurality of processor nodes and a plurality of routers. The routers are operable to route data by selecting from among a plurality of network paths from a target node to a destination node in the dragonfly network based on one or more routing tables. | 06-07-2012 |
20120158996 | IDENTIFYING AN EFFICIENT DESTINATION SERVER - One or more techniques and/or systems are disclosed for identifying a list of destination servers ordered by round-trip time (RTT) for a requesting machine. When a client interacts with an address, such as an IP address, when accessing a remote service, an RTT is collected for the address, or the RTT may be derived for a range of addresses, and saved in a database. When the client subsequently requests access to a remote service, a list of destination servers are returned, respectively identified by corresponding addresses. The destination servers can be sorted in order of efficiency by determining an expected RTT associated with a matching address, or range, in the database, and sorting the destination servers by their respective expected RTTs. | 06-21-2012 |
20120166674 | ROUTE DETERMINATION METHOD AND DEVICE - 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 106-28-2012 | |
20120173759 | Systems and Methods for Policy Based Integration to Horizontally Deployed WAN Optimization Appliances - The present disclosure presents systems and methods for policy-based redirection of network traffic, by an intermediary device, to a horizontally deployed WAN device. An intermediary receives a request from a client to access a server. The request was previously modified by a first WAN device to include information in an option field of a transport layer. The intermediary may determine, responsive to a redirection policy, to send the request to a second WAN device deployed horizontally from the intermediary, instead of the server. The intermediary transmits the request to the second WAN device, while maintaining the information from the option field. The intermediary device receives the request including the information identifying the first WAN optimization device to the second WAN device. The intermediary receives a modified request from the second WAN device, the modified request determined by the intermediary to be sent to the destination server. | 07-05-2012 |
20120198092 | Network Topologies for Energy Efficient Networks - One embodiment receives at a first node in at least a portion of a network a routing table, the portion of the network comprising the first node and one or more second nodes, the routing table specifying the immediate neighbor that provides each of the best paths in the portion of the network based on a total cost; using the routing table, determines at the first node every second node that is necessary for the first node to reach all edges of the network, the second nodes that are necessary for the first node to reach all edges of the network comprising an active set for the first node; and sends a message from the first node to every second node to facilitate determining whether to shut down the second node. | 08-02-2012 |
20120198093 | Interconnection Fabric Connection - Link used variables are defined for links related to an interconnection fabric. The links used variables are representative of whether or not a link is used for handling flows between a plurality of hosts and devices. Constraints for links, and hop counts or port counts are also defined. An objective function is used by an integer programming solver to determine connections as a function of the definitions. | 08-02-2012 |
20120198094 | SYSTEM AND METHOD FOR MULTI-LINK COMMUNICATION IN HOME NETWORK - A client in a home entertainment network can communicate with other components, including the server, over both a wired and a wireless link, with the particular path being selected based a component preference, and/or a bandwidth capability, and/or an occupancy ratio. Both links may be simultaneously used. | 08-02-2012 |
20120233350 | TECHNIQUES FOR ROUTING DATA BETWEEN NETWORK AREAS - 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). | 09-13-2012 |
20120239823 | Apparatus, system and method for selecting a stream server to which to direct a content title - “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.” | 09-20-2012 |
20130042021 | System and Method for Assigning Requests in a Content Distribution Network - 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, F | 02-14-2013 |
20130054833 | TRADING MECHANISM - 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. | 02-28-2013 |
20130067113 | METHOD OF OPTIMIZING ROUTING IN A CLUSTER COMPRISING STATIC COMMUNICATION LINKS AND COMPUTER PROGRAM IMPLEMENTING THAT METHOD - 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 ( | 03-14-2013 |
20130111062 | DETERMINATION OF A LOWEST COST PATH BETWEEN NODES | 05-02-2013 |
20130111063 | ROUTING METHOD IN CONTENT-CENTRIC NETWORK | 05-02-2013 |
20130166775 | LOAD BALANCING APPARATUS AND LOAD BALANCING METHOD - Provided are a load balancing apparatus, which is configured to prevent an overload from occurring and perform effectively a load balancing operation even for servers distributed throughout a network, and a load balancing method performed using the same. the method may include determining whether a data packet received from a client may be a packet requiring a load balancing operation, determining at least one of physical servers provided in a distributed server farm as an target server to provide a service to the client, depending on the judgment, determining a forwarding path between the client and the target server, determining a header rewriting node, and referring the forwarding path and the header rewriting node to determine a forwarding rule and load the forwarding rule on a switch provided on the forwarding path. | 06-27-2013 |
20130173824 | PATH FINDING SYSTEM, COMPUTER, CONTROL METHOD, AND PROGRAM - Each node configuring a network performs a process to finding a path in an autonomously and distributed manner without knowing information of the entire network. A computer functioning as a node configuring a network includes: an adjacent-node communication unit that acquires a provisional pressure value and an approximate pressure value of an adjacent node adjacent to the node itself from the adjacent node; an approximate-pressure-value calculation unit that calculates an approximate pressure value of the node itself using a pipe diameter value and the length of each link connected to the node itself, the provisional pressure value of the adjacent node, and a previously given source or sink flux of the node itself; a flux value calculation unit that calculates a flux flowing through each link using the pipe diameter value, the length, the approximate pressure value of the adjacent node, and the approximate pressure value of the node itself; and a pipe diameter value updating unit that updates the pipe diameter value using the flux flowing through each link, the pipe diameter value, and a function representing a feature of slime mold, wherein calculation of the approximate pressure value, calculation of the flux, and updating of the pipe diameter value are iteratively performed at least until the pipe diameter value converges. | 07-04-2013 |
20130191552 | METHODS AND SYSTEMS FOR MAPPING FLOW PATHS IN COMPUTER NETWORKS - Methods and systems are provided for determining a flow path for a flow between a source host and a destination host on a computer network wherein the flow has a tuple associated therewith. In one embodiment, a method comprises receiving flow data from exporters on the network, finding one or more exporters that possibly carry the flow, and using the flow data to determine whether any of the one or more exporters that possibly carry the flow include the tuple. For any exporters that include the tuple, the flow data is used to determine a next hop for such exporter. Connection pairs are created between each exporter that includes the tuple and its next hop. The connection pairs are combined to define the flow path. | 07-25-2013 |
20130219081 | Method and Apparatus for Adaptive Forwarding Strategies in Content-Centric Networking - 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. | 08-22-2013 |
20130227169 | CONNECTIVITY, ADJACENCIES AND ADAPTATION FUNCTIONS - Example embodiments are directed to a method of publishing an element template from a first service provider to an administrative owner to determine an optimal end-to-end connectivity path from a source to a destination across at least one resource domain for data transport. The method includes determining, at the first service provider, adjacencies between a first resource domain of the first service provider and a second resource domain of a second service provider. The first service provider publishes to an administrative owner, an element template that identifies connectivity attributes, including adjacencies and adaptation capabilities of the first resource domain. The AO may develop a plurality of possible paths from a source end-point to a destination end-point to transmit data based on the element template from the first service provider and element templates from other service providers. The AO selects an optimal path from the plurality of possible paths. | 08-29-2013 |
20130282921 | DYNAMIC THREADING GATEWAY FOR EMBEDDED HEALTH MANAGEMENT SYSTEMS - Methods and systems are provided for obtaining information via a plurality of platforms communicatively linked together via a communication network. Each of the plurality of platforms comprising a dynamically threaded gateway comprising a transceiver and a processor. The transceiver is configured to communicate with other of the plurality of platforms along a communication link. The processor is coupled to the transceiver, and is configured to identify a plurality of paths among the plurality of platforms for obtaining requested information, select a desired path of the plurality of paths based on a cost index for the plurality of paths, and obtain the information via the desired path using the transceiver. | 10-24-2013 |
20130311674 | SYSTEM AND METHOD FOR DIRECTING CLIENTS TO OPTIMAL SERVERS IN COMPUTER NETWORKS - A communication protocol includes one or more messages passed between Web routers over a reliable transmission protocol used for inter-Web router communication. These messages include information that allows the Web routers to dynamically update mappings of client addresses or address ranges to information object repository addresses based on client-to-server distance and server load. The mappings are preferably optimal mappings of the client addresses or address ranges to the information object repository addresses and the messages report updated distances from these information object repository addresses to the client addresses or address ranges. For example, the messages may report, for each updated distance, an associated client address or address range and/or an associated anchor address of a Web router co-located with an information object repository that is the subject of the message. | 11-21-2013 |
20140032784 | SEARCHING FOR MULTICAST CONSUMERS IN A NETWORK OF INTERCONNECTED NODES - 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. | 01-30-2014 |
20140068106 | METHOD AND SYSTEM FOR PROVIDING LATENCY DETECTION BASED ON AUTOMATED LATENCY MEASUREMENTS OF COMMUNICATION NETWORK PATHS - 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. | 03-06-2014 |
20140089522 | System and Method for Assigning Requests in a Content Distribution Network - 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, F | 03-27-2014 |
20140129734 | PUSH-BASED SHORT-CUT REQUESTS WITHIN A DIRECTED ACYCLIC GRAPH - 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. | 05-08-2014 |
20140129735 | METHOD AND NODE FOR SUPPORTING ROUTING VIA INTER AS PATH - 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. | 05-08-2014 |
20140143443 | COMMUNICATION DEVICE, COMMUNICATION SYSTEM, AND COMPUTER PROGRAM PRODUCT - 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. | 05-22-2014 |
20140173133 | METHOD AND SYSTEM FOR EFFICIENT GRACEFUL RESTART IN AN OPEN SHORTEST PATH FIRST (OSPF) NETWORK - 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. | 06-19-2014 |
20140359161 | COMPARISON BETWEEN DIFFERENT DESCRIPTIONS OF A WEB SERVICE - In one embodiment, a computer-implemented method for comparing first and second descriptions of a web service includes computing a distance between each type used as a parameter in the first description and each type used as a parameter in the second description. A distance is calculated between methods in each of two or more pairs of methods. Each pair includes a method in the first description and a method in the second description. The calculating is performed by comparing the parameters of the first set of methods and the second set of methods using the computed distances between types. To the calculated distance between each pair of methods is added the distance between the names of the compared methods and the distance between the returned types of the compared methods. For each method in the first description, the method in the second description with the lowest calculated distance is output. | 12-04-2014 |
20140372627 | FAULT-TOLERANT WEB CACHING - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for monitoring capability to process web traffic. At various times, a web proxy announces a most specific route that is received by multiple clients configured to send web traffic for an address to a received most specific route to the address. The web proxy processes web traffic received from one of the clients as a result of announcing the route. When the web proxy determines a decrease in processing capability of the web proxy, the web proxy ceases to announce the most specific route such that one or more of the clients direct web traffic for the address to an alternative less specific route. | 12-18-2014 |
20150052261 | NETWORK CONNECTION CONTROLLING DEVICE AND METHDO FOR CONTROLLING NETWORK CONNECTION - A method for controlling network connection includes: receiving a network accessing task generated by the user via a corresponding terminal device, the network accessing task is a task of accessing a target source. Detecting work parameters of each network accessing path, the work parameters of each network accessing path includes a workload of the network accessing path and a network operator providing the network accessing path. Selecting an optimal network accessing path according to the detected work parameters of each network accessing path based on a workload tactics. In additional, controlling the terminal device to connect the network to execute the network task via the optimal network accessing path. | 02-19-2015 |
20150134850 | METHOD AND APPARATUS FOR PROBE-BASED ROUTING - An approach is provided for providing routing calculations and route guidance based on geographic positioning and/or other sensor data from one or more mobile devices independent of map data. A routing platform processes and/or facilitates a processing of one or more probe data samples associated with at least one mobile device to determine one or more device tracks. The routing platform processes and/or facilitates a processing of the one or more device tracks to determine at least one tessellation, wherein the at least one tessellation is a subdivision of a plane or sphere into one or more tiles and a plurality of segments. The routing platform further determines one or more relationships between one or more of the plurality of segments based, at least in part, on a mapping of the one or more device tracks against the at least one tessellation. | 05-14-2015 |
20150134851 | GEOTAGGED COMMUNICATIONS IN NETWORK SYSTEMS AND COMPONENTS - Aspects of geotagged communications are described herein. In one embodiment, a data unit including a geotag field is received over an ingress port of a network component. In turn, the network component may determine a path for forwarding the data unit to a location associated with the geotag field and with reference to a forwarding decision index. The path may include a least distance hop or a least distance route for forwarding or routing the data unit. With reference to the forwarding path, the network component may identify an egress port for forwarding the data unit. The network component may also forward the data unit over the egress port. According to other aspects, geolocation data may enable a network component to implement geotag-based virtual local area networks, geotag-based multiprotocol label switching, geotag-based fault detection and isolation, or geotag-based firewalls and fencing in wired routers or switches, for example. | 05-14-2015 |
20150319075 | OVERLAY NETWORK - An overlay network is contemplated. The overlay network may be characterized as supporting, or at least virtually supporting, separate networks over a common infrastructure. The common infrastructure may be comprised of a plurality of routers or other devices configured to facilitate directing messages according to various addressing requirements. The use of the separate networks may be dictated according to the particular addressing requirements of each message desired for transport. | 11-05-2015 |
20160028613 | Dragonfly Plus: Communication Over Bipartite Node Groups Connected by a Mesh Network - A communication network includes multiple nodes, which are arranged in groups such that the nodes in each group are interconnected in a bipartite topology and the groups are interconnected in a mesh topology. The nodes are configured to convey traffic between source hosts and respective destination hosts by routing packets among the nodes on paths that do not traverse any intermediate hosts other than the source and destination hosts. | 01-28-2016 |
20160094451 | INLINE LOAD BALANCING - Some embodiments provide a novel method for load balancing data messages that are sent by a source compute node (SCN) to one or more different groups of destination compute nodes (DCNs). In some embodiments, the method deploys a load balancer in the source compute node's egress datapath. This load balancer receives each data message sent from the source compute node, and determines whether the data message is addressed to one of the DCN groups for which the load balancer spreads the data traffic to balance the load across (e.g., data traffic directed to) the DCNs in the group. When the received data message is not addressed to one of the load balanced DCN groups, the load balancer forwards the received data message to its addressed destination. On the other hand, when the received data message is addressed to one of load balancer's DCN groups, the load balancer identifies a DCN in the addressed DCN group that should receive the data message, and directs the data message to the identified DCN. To direct the data message to the identified DCN, the load balancer in some embodiments changes the destination address (e.g., the destination IP address, destination port, destination MAC address, etc.) in the data message from the address of the identified DCN group to the address (e.g., the destination IP address) of the identified DCN. | 03-31-2016 |
20160094452 | DISTRIBUTED LOAD BALANCING SYSTEMS - Some embodiments provide a novel method for load balancing data messages that are sent by a source compute node (SCN) to one or more different groups of destination compute nodes (DCNs). In some embodiments, the method deploys a load balancer in the source compute node's egress datapath. This load balancer receives each data message sent from the source compute node, and determines whether the data message is addressed to one of the DCN groups for which the load balancer spreads the data traffic to balance the load across (e.g., data traffic directed to) the DCNs in the group. When the received data message is not addressed to one of the load balanced DCN groups, the load balancer forwards the received data message to its addressed destination. On the other hand, when the received data message is addressed to one of load balancer's DCN groups, the load balancer identifies a DCN in the addressed DCN group that should receive the data message, and directs the data message to the identified DCN. To direct the data message to the identified DCN, the load balancer in some embodiments changes the destination address (e.g., the destination IP address, destination port, destination MAC address, etc.) in the data message from the address of the identified DCN group to the address (e.g., the destination IP address) of the identified DCN. | 03-31-2016 |
20160182353 | SYSTEM AND METHOD FOR EFFICIENT NAME-BASED CONTENT ROUTING USING LINK-STATE INFORMATION IN INFORMATION-CENTRIC NETWORKS | 06-23-2016 |