Abstract: According to some embodiments, a method and apparatus are provided to receive, at a cache entity, a refresh request associated with a resource. A determination is made, via a processor, and based on the refresh request, to reload the resource from a server. The reloaded resource is replaced at the cache entity.

Abstract: A system and method for storage and retrieval of neighboring switch tokens includes a switch including one or more processors, memory storing a first token, and a first port configured to couple the switch to a second switch. The one or more processors are configured to send a first token storage request to the second switch, send a first token retrieval request to the second switch requesting the information associated with the first token, and receive a first retrieved token message from the second switch. The first token storage request includes information associated with the first token. The first retrieved token message includes first information associated with the first token.

Abstract: A method in a network element that forwards packets to destination nodes includes identifying groups of the destination nodes. Respective performance metrics of multiple different candidate network paths, over which the destination nodes in a given group are reachable from the network element, are estimated jointly for all the destination nodes in the given group. A network path is selected from among the candidate network paths based on the estimated performance metrics. The packets addressed to the destination nodes in the given group are forwarded over the selected network path.

Abstract: In one embodiment, a capable node in a computer network may host a path computation element, receive one or more neighborhood discovery messages including neighborhood information from a plurality of nodes in the computer network, and compute a minimum spanning tree (MinTree) for the computer network based on the neighborhood information. The MinTree may divide the plurality of nodes in the computer network into a first subset of routing nodes and a second subset of host nodes. The first subset of routing nodes may form one or more interconnected paths of routing nodes within the MinTree, and each host node within the second subset of host nodes may be located within one hop of at least one routing node. The capable node may then communicate a MinTree message to the plurality of nodes in the computer network to build the MinTree by enabling routing on each routing node.

Abstract: Each router in a group of routers (110R.2, 110R.3) includes an interface (P4) assigned a common virtual address for multicast (VAM). The common VAM is advertised in router advertisings for multicast traffic; other addresses are advertised for unicast. The member routers in the group share multicast forwarding databases. Increased throughput is therefore provided for multicast traffic without traffic replication. Any router in the group can service requests from end-point sources and receivers of multicast traffic, e.g. requests to join or leave a multicast group, or requests presented as multicast packets for forwarding to a multicast group.

Abstract: Embodiments are directed towards previewing results generated from indexing data raw data before the corresponding index data is added to an index store. Raw data may be received from a preview data source. After an initial set of configuration information may be established, the preview data may be submitted to an index processing pipeline. A previewing application may generate preview results based on the preview index data and the configuration information. The preview results may enable previewing how the data is being processed by the indexing application. If the preview results are not acceptable, the configuration information may be modified. The preview application enables modification of the configuration information until the generated preview results may be acceptable. If the configuration information is acceptable, the preview data may be processed and indexed in one or more index stores.

Abstract: A wireless communication terminal (100) includes a TCP connection keep-alive timer, and a controller configured to optimize keep-alive timer operation by reducing the frequency with which the terminal transmits keep-alive messages. In one implementation, the controller re-sets the keep-alive timer, before expiration thereof, upon sending or receiving a message at the terminal during a TCP connection, wherein the terminal transmits a TCP connection keep-alive message only upon expiration of the keep-alive timer. The terminal may transmit a register request message indicating whether the terminal supports optimized keep-alive timer operation.

Abstract: A network system that reduces the computational resources to centrally-control network nodes in a border gateway protocol (BGP) network. More particularly, the systems and methods describe the control of a plurality of individual network nodes by a centralized controller, and the use of a route control server (RCS), which is connected to the centralized controller, or OpenFlow Controller (OFC). By treating the plurality of individual network nodes as a single combined network node, the route control server is able communicate using a single BGP speaker, and hence, reduce the computational resources from that required to run an individual BGP speaker for each individual network node.

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

Abstract: A method of protecting a data network from denial of service (DOS) attacks is described. The method may use various network tools to selectively block or disable portions of a data trunk experiencing a DOS attack, thereby preventing the DOS attack from reaching at least some resources on the network. In one embodiment, a network switch identifies a virtual LAN (VLAN) carrying suspect data on a data trunk. The network switch then adjusts a spanning tree for the network so that one or more ports on the compromised VLAN are blocked or disabled, while non-compromised VLANs are allowed to continue carrying data. Other approaches are also presented for avoiding the loss of valid data when a network blocks one or more VLANs or other portions of a network in response to a DOS attack or other intrusion.

Abstract: A network capacity management system and method are disclosed.

Abstract: The present invention relates to telecommunication systems providing multiple services which could require possible adaptations based on the capabilities of the terminal used to access those services. Master databases in the telecommunication system take the responsibility to map between terminal and user identifiers. Applications and services are thus able to query terminal related capability information based on a user identity. In accordance with the invention, a Terminal Capabilities database (TC-DB) is introduced in order to establish a temporary relationship between a user and a terminal operated by such user. When a user attaches to the network, a terminal identifier is sent to the network that forwards that identity to the TC-DB. For retrieval of terminal capabilities the application servers send a request message to the TC-DB by using the user identity as a correlating key.

Abstract: In one embodiment, a method receives a software upgrade package for a management computer and main computer. The management computer upgrades software of the management computer using the software upgrade package where the upgrading replaces an image of the software of the management computer with an image from the software upgrade package. Upon upgrade of the management computer, the management computer initiates an upgrade of the main computer. The main computer withdraws use of the services, and upon the withdrawing, the management computer reboots the main computer. Then, the main computer upgrades software of the main computer using the software upgrade package upon rebooting where the upgrading replaces an image of the software of the main computer with an image from the software upgrade package. Upon the upgrading, the main computer restores the use of the services.

Abstract: Example methods, apparatus and articles of manufacture to manipulate packet routing are disclosed. A disclosed example method includes receiving a first route advertisement from a first provider edge router, the first route advertisement including next-hop routing information associated with a destination and a label associated with an interface of the first provider edge router; modifying the next-hop routing information to form first modified next-hop routing information, the first modified next-hop routing information to redirect a packet addressed to the destination; and sending a second route advertisement to a second provider edge router, the second route advertisement including the first modified next-hop routing information and the label.

Abstract: Methods, computer-readable media, and apparatuses for network flow state preservation include migration of at least one application hosted on a first server device to a second server device coupled to a second traffic management device is detected at a first traffic management device. At least a portion of connection state information associated with a network connection between at least one client device and the application is communicated by the first traffic management device to the second traffic management device via a communication channel between the first and second traffic management devices. The application is provided by the first traffic management device to the at least one client device during the migration based upon the connection state information.

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

Abstract: A computing device implemented method, in one embodiment, can include a cloud transformation module transforming content for a compute platform. Additionally, the method can include a cloud control module receiving the content from the cloud transformation module. The method can also include the cloud control module provisioning a virtual machine appliance to form the compute platform. Furthermore, the method can include a cloud instantiation module executing the provisioning of the cloud control module. In addition, the method can include a cloud appliance module adding middleware to a virtual machine to create the virtual machine appliance. Moreover, the method can include a cloud virtualization module producing a virtualized representation of the compute platform.

Abstract: Unified Communication and Collaboration (UC&C) systems are enabled to dynamically enlighten a set of network elements (NEs) and/or network infrastructure with application awareness so that an accurate set of rules or actions can be applied for a given session without needing to lookup the payload of every packet or applying a somewhat ineffective expensive heuristic mechanisms. Taking advantage of typically longer communication session durations and separate control and media planes, a UC&C control point programs a set of NEs for a given UC&C media flow within a scalable and timely manner. Quality of Service (QoS), security, monitoring, and similar functionality may also be programmed into the NEs through the UC&C control point.

Abstract: A method of operating a communication network comprises receiving loopback addresses from a plurality of edge networks at a provider router of a core backbone network, the edge networks and the core backbone network being logically distinct from each other, advertising the loopback addresses to a transport route reflector element, propagating the advertisement of the loopback addresses to other provider routers of the core backbone network using a protocol for communicating between autonomous systems, and using the transport route reflector element to advertise at least one of the loopback addresses to a service route reflector element in one of the plurality of edge networks.

Abstract: A computer-implemented method for facilitating access to shared resources within computer clusters may include (1) identifying a computer cluster, (2) identifying at least one node within the computer cluster that has been selected to execute an application, (3) identifying at least one different node within the computer cluster that has not yet been selected to execute the application, (4) importing a read-write configuration of at least one shared resource to the node, (5) importing a read-only configuration of the shared resource to the different node, (6) determining, after importing the read-only configuration of the shared resource to the different node, that the different node has been selected to execute the application, and then (7) converting, in response to this determination, the different node's read-only configuration of the shared resource to the read-write configuration of the shared resource. Various other systems, methods, and computer-readable media are also disclosed.

Abstract: The present invention relates to a method and node for efficiently distributing electronic content in a content distribution network (CDN) comprising a plurality of cache nodes. Embodiments of the present invention include a virtual node logically representing a set of cache nodes. The set of cache nodes is in turn defined based on an internal communication cost between the cache nodes. In each of the cache nodes represented by the virtual node statistics regarding content requests is collected, and based on this statistics it is determined whether specific content is to be cached in the virtual node or not. If it is determined to cache specific content in the virtual node, the specific content may be caused to be cached in one or more of the cache nodes represented by the virtual node.

Abstract: A weighting process may be used to select between alternate neighbors in a RAPID calculation to enable policy and/or traffic engineering considerations to affect the selection of an alternate path through the network. The information used to weight the neighbors may static administratively assigned weighting information or dynamic weighting information such as local statistical traffic condition information. The process may take into account the amount of traffic being handled by the current primary next hop for the destination, the available capacity of the available alternate neighbors, the ability of the alternate neighbors to handle the additional traffic, and other considerations. Weighting may occur after a set of available loop free alternate neighbors has been determined. Alternatively, weighting may occur before the RAPID calculation has been performed to cause the neighbors to be ordered prior to RAPID processing. This may enable RAPID calculation to stop without considering all available neighbors.

Abstract: MPLS segment routing is disclosed. In one embodiment, a first core router generates a first data structure that maps first portcodes to respective identities of first neighbor routers or respective first links, wherein the first portcodes identify respective first ports of the first core router, and wherein the first ports are coupled to the first neighbor routers, respectively, via the first links, respectively. The first core router generates and transmits a first link-state packet, wherein the first link-state packet comprises an identity of the first core router and the first data structure.

Abstract: In one implementation, downloading of streaming content using a security as a service (SecaaS) system is more efficient because portions of the streaming content may not be inspected by the SecaaS. A first request to download content from a content provider is received, and a connection is initiated with a security provider, which inspects the first chunk of the content and generates a routing instruction based on the inspection of the first chunk of content. Based on the routing instructions and the inspection of the first chunk, a request for a second chunk of the streaming content is addressed to the content provider. The second chunk of the streaming content, circumvents the SecaaS system.

Abstract: According to an example a router includes a control plane CPU, a data plane CPU, a first memory area and a second memory area independent from the first memory area. When the router upgrades its software, the control plane CPU is reset and clears the first memory area. After being reset, the control plane CPU loads a new version control plane program into the first memory area and runs the new version control plane program in the first memory area.

Abstract: Apparatus and methods for determining a switching device and port to which a user selected end-node in a computer network is connected may include receiving an address of a user determined end-node and discovering a switching device that forwards traffic to no other device on the same port as the switching device forwards traffic to the selected end-node. The apparatus and methods may output an address of the discovered switching device and port to the user.

Abstract: A method begins by a first device determining an error coding distributed routing protocol and transmitting a set of encoded data slices, identity of a second device, and the error coding distributed routing protocol to a network, wherein the set of encoded data slices represents data that has been dispersed storage error encoded. The method continues with the network routing a plurality of sub-sets of the set of encoded data slices via an initial plurality of routing paths towards the second, comparing anticipated routing performance with a desired routing performance, and altering the routing path to obtain a favorable comparison. The method continues with the second device receiving at least some of the set of encoded data slices from the network and decoding at least a threshold number of encoded data slices to reproduce the data when at least the threshold number of encoded data slices have been received.

Abstract: Techniques are described for implementing one or more logical routers within a single physical routing device. These logical routers, as referred to herein, are logically isolated in the sense that they achieve operational and organizational isolation within the routing device without requiring the use of additional or redundant hardware, e.g., additional hardware-based routing controllers. The routing device may, for example, include a computing platform, and a plurality of software process executing within the computing platform, wherein the software processes operate as logical routers. The routing device may include a forwarding component shared by the logical routers to forward network packets received from a network in accordance with the forwarding tables.

Abstract: A system and method are provided for routing content requests. On a given server network, content requests comprising a character string may be routed up a hierarchical network topology until a linear chain, corresponding to the character string, is identified. Thus, the content request is forwarded up the hierarchy until an intersecting server network is reached. Then the content request is forwarded down the hierarchy until, along a published linear chain corresponding to the character string, until a content source is reached. Content is provided to the requestor along a reverse path of the content request.

Abstract: A system and method uses path information to project traffic information from flow- or IPFix-type messages onto one or more paths that may have been taken by packets corresponding to such messages. Traffic information from a message is projected from the router interface from which the message was received, along the path or paths the packets corresponding to the message may have taken, but only to the next router interface that provides such messages.

Abstract: A hybrid network device can implement an address management scheme for maintaining consistency between source/destination addresses and corresponding source/destination communication interfaces. In one embodiment, a first network device can select a first network path from a plurality of network paths associated with the communication network for transmitting a packet to a second network device. A source address can be determined from a plurality of addresses associated with a plurality of communication interfaces of the first network device. A destination address can be determined from a plurality of addresses associated with a plurality of communication interfaces of the second network device based, in part, on the selected first network path. The packet including at least the source address and the destination address can be transmitted via the first network path from a source communication interface of the first network device to a destination communication interface of the second network device.

Abstract: Rather than using a large number of transceivers (transmitter/receiver pairs) operating in parallel, Access Points with multiple channels are used to aggregate, or stack, transmitted response communications, e.g., transmitting multiple acknowledgements (ACKs) in a single packet to one or more sources of received packets. The method includes sending on a plurality of channels, by each of a plurality of respective first nodes, a communication to a second node, receiving on the plurality of channels, by the second node, the communication from each of the plurality of first nodes and sending, by the second node, a transmission that contains a response to each communication that was successfully received from each of the plurality of first nodes. The response to each of the plurality of first nodes is part of a single message sent by the second node.

Abstract: The present invention relates to an autonomic network management system which includes: an active measurement unit that measures and analyzes a network state in an active measurement scheme; a passive measurement unit that measures and analyzes the network state in a passive measurement scheme; an autonomic management control unit that respectively receives the measured and analyzed results of the network from the active measurement unit and the passive measurement unit to determine the network state; and a transmission path control unit that receives a transmission path message from the autonomic management control unit to control a transmission path according to the transmission path message.

Abstract: A distributed computing system includes a primary device and one or more backend devices. The primary device provides a management interface for the distributed computing system. A plurality of applications may be installed on the backend devices for execution. The primary device generates registration data that associates the applications with management interface commands or configuration parameters in response to messages received from the applications. Subsequently, when the primary device receives a particular command at the management interface, the primary device identifies, based on the registration data, a particular application from among the plurality of applications. In response to identifying the application, the primary device may send to the application an outgoing message.

Abstract: Systems and methods are provided that dynamically route messages based on the availability of a message consumer on any given route, and which adapt to changes in message consumer availability throughout a messaging network. In various embodiments, changes to message routing criteria at a destination broker in the network are propagated to each source broker for the destination broker, which in turn propagates the changes to their source brokers until the entire network is adapted.

Abstract: A system, method, and computer-readable medium for updating request routing information associated with client location information are provided. A content delivery network service provider receives a DNS query from a client computing device. The DNS query corresponds to a resource identifier for requested content from the client computing device. The content delivery network service provider obtains a query IP address corresponding to the client computing device. Based on routing information associated with the query IP address, the content delivery network service provider routes the DNS query. The process further includes monitoring performance data associated with the transmission of the requested resource and updating routing information associated with the query IP address based on the performance data for use in processing subsequent requests form the client computing device.

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

Abstract: An edge node or cache server of an autonomous system (AS) can process an interest for the autonomous system. During operation, the system can receive an interest for a content object, and determines whether the local node can satisfy the interest. If the local network node does not satisfy the interest, the system determines a label indicating network information for another AS node, attaches the label to the interest, and forwards the interest to the other AS node based on the label. Further, a route server of the AS processes an interest by determining a label that corresponds to the interest, and attaching the label to the interest. The route server then forwards the interest to the egress network node based on the label, which allows the egress network node to forward the interest to the remote autonomous system based on the attached label.

Abstract: The present disclosure is directed to updating routing patterns in an enterprise network. In some implementations, a method for routing sessions includes identifying information associated with call sessions in an enterprise network. The information includes costs to an enterprise for using carrier services during the call sessions. Routing patterns for call sessions are dynamically updated through at least a portion of the enterprise network based, at least in part, on the costs associated with the call sessions.

Abstract: An object is to create a convergent mediation system (10) and method that meet the technical requirements of low latency time and high reliability. According an aspect of the invention, these objects are achieved by providing a convergent mediation system (10) that comprises a plurality of independent processing nodes (120, 125) adapted to form processing streams (200) for the online processing (12) and off-line processing (14) of data. Each of the processing streams (200) comprises at least two independent nodes (120, 125) in sequence and buffers (145) between the nodes (120, 125). Furthermore, random access memory is utilized such that at least one of the buffers (145) in each of the online processing streams (212) is formed by a dedicated memory area in the random access memory.

Abstract: Embodiments of the invention relate to providing dynamic absolute-path symbolic links. According to one embodiment, indication of a symbolic link is received, which references a target, the indication including an absolute path of the target that includes a target mount point and a name of the target. A current mount point of the target is identified, and a verification is made that the target mount point is identical to the current mount point. When the target mount point is identical to the current mount point, a string length of the current mount point is determined, and an in-memory record of the symbolic link is created. The in-memory record includes the string length of the current mount point associated with the symbolic link.

Abstract: A method is provided in one example embodiment and includes communicating a message to a remote data plane element in order to request a data plane resource for hosting a session. The method also includes receiving a response at a network element acknowledging the message. Data plane traffic is managed at the remote data plane element based on enforcement rules. The enforcement rules are provisioned in a table element at the remote data plane element, and the table element reflects a portion of a master table element included in the network element.

Abstract: A method for routing data at a first node of a network including a second node. The method includes: providing the first node with a database storing an association between: an URL component identifying content at the first node, and a unique identifier associated to the second node, the unique identifier being specified by the second node; registering content locally stored in the second node by storing in the database an association between an URL component identifying the locally stored content and the unique identifier of the second node; and, upon reception from a requesting entity, by the first node, of a content request having a content identifier, the method includes: checking in the database whether the content identifier includes the URL component, and forwarding the content request to the second node if the content identifier includes the URL component associated with the unique identifier of the second node.

Abstract: Methods and apparatus for event distribution and routing in peer-to-peer overlay networks. A method is provided for event distribution and routing in a peer-to-peer overlay network that comprises a plurality of nodes. The method includes identifying a plurality of buckets on the overlay network, wherein each bucket includes one or more nodes, respectively, identifying bucket groups, wherein each bucket group includes a selected number of buckets, respectively, distributing events based on the bucket groups, and updating a routing table based on the events. A node includes a transceiver and a processor coupled to the transceiver and configured to identify a plurality of buckets on the overlay network, wherein each bucket includes one or more nodes, respectively, identify bucket groups, wherein each bucket group includes a selected number of buckets, respectively, distribute events based on the bucket groups, and update a routing table based on the events.

Abstract: A deploy service is provided to determine a set of software artifacts that needs to be transmitted to a target machine upon receiving an application deployment request from a user of a client device. For instance, the deploy service may compare versions of software artifacts on the target machine with the software artifacts of the application that the user desires to deploy to determine the set of software artifacts that needs to be transmitted. Instead of having to transmit the entire application, some embodiments transmit only a small portion that is reflective of what has been changed between the old version of the application and the new version of the application. This enables the transfer of large files across the Internet to be more efficient.

Abstract: Methods, apparatus and systems for routing information flows in networks based on spanning trees and network switching element resources. One or more controllers are used to assign information flows to network switching elements (NSEs) through use of spanning trees derived from link path costs. NSEs generate status information relating to resources they employ to facilitate information flows that is sent to the controller(s). The status information is used to derive link costs, which are then used to generate spanning trees that support routing between the NSEs without any path loops. Information flows are assigned to the NSEs such that the routing paths for the flows use the links in the spanning tree. The link costs and spanning trees are dynamically computed during ongoing operations, enabling the network routing and flow assignments to be reconfigured in response to dataplane events and changes to the information flow traffic.

Abstract: A method of mapping a location of an event that is scheduled in a calendar application includes steps of identifying a contact associated with the event, determining address information associated with the contact, obtaining map data for the address information, and generating a map of the location associated with the contact based on the map data. Meeting or event locations can thus be mapped even if there is no event location or address information specified directly in the meeting request or appointment.

Abstract: A port number is stored in a memory in association with one or more addresses using a data block by which at least one port number associated with a predetermined number of consecutive addresses is written into the memory. Further, a first port number assigned to output ports each being provided for different one of a plurality of relay nodes is stored in association with first consecutive addresses in such a manner that one or more data blocks including the first port number associated with the first consecutive addresses are written into the memory.

Abstract: A method and system for broadcasting a multimedia message are disclosed. The method includes: a broadcasting source node packs multimedia content to be broadcasted into a multimedia message, and sends the multimedia message to a reception end node in structural Peer-to-Peer which establishes a virtual connection with the present broadcasting source node; the reception end node receiving the multimedia message forwards the multimedia message to other reception end nodes establishing a virtual connection with the present reception end node. The method and system can save bandwidth and processing capability resources of the whole overlay network, and can make loads be distributed to nodes except the broadcasting source node more evenly to prevent the broadcasting source node from being bottleneck.

Abstract: A data unit processing entity 4 is described, which has a decision part 41 for setting a forwarding address FA on the basis of an identifying address in a received data unit, by referring to decision data stored in a decision data memory 42. A management part 43 is provided, which is arranged to provide a network control function 51 with access to the decision data in the decision data memory 42, in order to change said decision data, independently of any access given to mobile nodes.