| Entries |
| Document | Title | Date |
|---|
| 20080244089 | INTERFACE FOR A DELAY-TOLERANT NETWORK - The present disclosure provides a method for delay tolerant networking. According to one exemplary embodiment, the method may include transmitting a file from a first node associated with a first network to at least one intermediate node via a file-system interface. The method may also include receiving the file at the at least one intermediate node via the file system interface. The method may further include transmitting the file from the at least one intermediate node to at least one node of an additional network via the file-system interface and receiving the file at the at least one node of the additional network via the file-system interface. Of course, additional embodiments, variations and modifications are possible without departing from this embodiment. | 10-02-2008 |
| 20080244090 | Access Device Routing Device and Method Thereof Supporting Stateless Address Configuration Communication Network - The present invention relates to an IPv6-based access device, edge router and method for stainless address configuration for IPv6 user equipment in an Ethernet access network, wherein, the access device adds the relay agent ID indicating the access device itself and the relevant port identifier indicating the user equipment to a router solicitation message sent by the user equipment in the form of a newly defined option, and forwards the message to the relevant edge router; and the edge router configures a dedicated address prefix for the user equipment according to the relay agent ID and port identifier, combines the address prefix, the relay ID and the port identifier into a router response message, and sends the response message to the relevant access equipment indicated by the relay ID; the access device sends a router advertisement message only including the address prefix via the line port indicated by the port identifier to user equipment. By allocating the dedicated address prefix to every data subscriber line for IPv6 service, IPv6 stainless address configuration is achieved to solve the security and scalability problems in the prior art. | 10-02-2008 |
| 20080263224 | System and Method for Pushing Encrypted Information Between a Host System and a Mobile Data Communication Device - A redirector scheme operable to redirect messages from a plurality of messaging hosts disposed in a wide-area data network, wherein each messaging host is operable to receive messages for a set of users. In one embodiment, a redirector system comprises, inter alia: a plurality of receive agents and a corresponding plurality of send agents, wherein each pair of receive and send agents interacts together as a redirector agent with respect to a corresponding messaging host; means for automatically detecting arrival of a data item at the redirector agent from the corresponding messaging host for a particular user served by the corresponding messaging host; and means for processing at least a portion of an instance of the data item for transmission to a mobile data communication device associated with the particular user. | 10-23-2008 |
| 20080263225 | Context-Sensitive Confidentiality within Federated Environments - Techniques are disclosed for achieving context-sensitive confidentiality within a federated environment for which content is aggregated in a distributed Web portal (or similar aggregation framework), ensuring that message portions that should be confidential are confidential to all entities in the federated environment except those entities to which the message portions may properly be divulged. The federation may comprise an arbitrary number of autonomous security domains, and these security domains may have independent trust models and authentication services. Using the disclosed techniques, messages can be routed securely within a cross-domain federation (irrespective of routing paths), thereby ensuring that confidential information is not exposed to unintended third parties and that critical information is not tampered with while in transit between security domains. Preferred embodiments leverage Web services techniques and a number of industry standards. | 10-23-2008 |
| 20080276003 | System and Method for Enhanced Messaging Intermediary - An intermediary infrastructure that facilitates the interconnection of multiple IP Multimedia Subsystem (IMS) networks. The interconnections may span one or more of the IMS logical planes Services Plane, Control Plane, and Network or Transport Plane. The intermediary offers among other things a process, routing, and switching complex that is able to among other things process incoming messages including using a comprehensive routing repository to complete message routing operations. | 11-06-2008 |
| 20080281982 | Contents distribution system, node apparatus and information processing method thereof, as well as recording medium on which program thereof is recorded - To provide a contents distribution system, method and the like, wherein even a node apparatus with a small storage capacity, such as in the case of a set-top box, can function as a root node apparatus in a P2P type of contents distribution system having a plurality of node apparatus disposed dispersed in a network by a DHT (Distributed Hash Table), or the like. A node apparatus includes a distribution source information storage section having a management information storage area storing first position information, which is position information of a management subject contents holding node apparatus holding contents data which are a subject of management, and an extension management information storage area storing second position information, which is position information of a node apparatus holding position information of the management subject contents holding node apparatus. Then, in the event that it is determined that a message received via a network is a request addressed to the node apparatus itself for a transmission of contents data distribution source information, the node apparatus selects the first position information or the second position information from the distribution source information storage section. | 11-13-2008 |
| 20080307111 | MOST ELIGIBLE SERVER IN A COMMON WORK QUEUE ENVIRONMENT - A system and method for managing servers. The system comprises a plurality of servers for processing messages, at least one client for transmitting messages to and receiving messages from the servers, and processor means for maintaining a list indicating whether at least one of the servers is eligible to process messages. Preferably, the servers are adapted to process messages of different types; and the processor means includes means to indicate on said list whether, for each of the different types of messages, at least one of the servers is eligible to process each of the different types of messages. Also, in the preferred embodiment, each of the clients includes means to read the list, before the client transmits a message of a given type to one of the servers, to determine whether at least one of the servers is eligible to process messages of the given type. In addition, the processor means may notify the clients when changes are made to the list, and each of the clients may include means for removing messages from the servers in case there is no longer a server eligible to process the messages. | 12-11-2008 |
| 20080320165 | Method for Supporting Ipv6 Neighbor Discovery in Point-To-Point Oriented Broadband Wireless Network - Provided are a method and system for supporting IPv6 Neighbor Discovery in a point-to-point oriented broadband wireless network. The method includes: an access router in the broadband wireless network receiving a message from a first subscriber station in the broadband wireless network; the access router detecting a Neighbor Discovery message from the received message; and the access router relaying the Neighbor Discovery message to a second subscriber station in the broadband wireless network. The method can support IPv6 Neighbor Discovery where hosts in the point-to-point oriented broadband wireless network share one or multiple prefixes. | 12-25-2008 |
| 20080320166 | AUTOMATIC PRIORITIZATION OF BGP NEXT-HOP IN IGP CONVERGENCE - In one embodiment, an inter-domain routing protocol stores an inter-domain routing protocol route having an associated next-hop address. A routing table is searched for an for an intra-domain routing protocol route that may be used to reach the next-hop address of the inter-domain routing protocol route. Such route is marked as an important route for convergence. Later, in response to a change in the network requiring a routing table update, the intra-domain routing protocol route marked as an important route for convergence is processed by an intra domain routing protocol before any other intra-domain routing protocol routes are processed that are not marked as important routes for convergence. | 12-25-2008 |
| 20090013091 | CUSTOMER BASED MESSAGE ROUTING - A method and system for messaging, and more particularly archiving of messages in a distributed network of archiver nodes, by routing and grouping of the messages by customer, utilizing traditional recipient email addresses in SMTP is disclosed. | 01-08-2009 |
| 20090024760 | METHOD AND SYSTEM FOR MANAGING COMMUNICATION-SESSIONS IN A NETWORK - A method for managing communication-sessions at a Communication Diversion Notification Server (CDNS) ( | 01-22-2009 |
| 20090031040 | Distributed denial-of-service attack mitigation by selective black-holing in IP networks - In an IP network during a DDoS attack on a website or other internet entity having an IP address, selective black-holing of attack traffic is performed such that some of the traffic destined for the IP address under attack continues to go to the IP address under attack while other traffic, destined for the same IP address is, rerouted via BGP sessions to a black-hole router. Such a selective black-holing scheme can be used to allow some traffic to continue in route to the IP address under attack, while other traffic is diverted. | 01-29-2009 |
| 20090037601 | System and Method for Updating State Information in a Router - Systems and methods consistent with the present invention enable routing table updates are performed by optimally utilizing the resources of a node without exceeding the resources of the node. Using feedback on the amount of resources available to the nodes, such as in terms of available memory, the node may make new connections before breaking old one where those updates will not exceed available resources. This is referred to as make-before-break. When not enough resources are available, the node will break old connections before making new ones. This is referred to as break-before-make. Unlike the strict make-before-break and break-before-make models, this “loose” make-before-break method considers the amount of available resources in view of the resources required to perform the routing table updates without a node failure. Routes may also be tagged to prioritize the addition of more important routes and the deletion of less significant routes. Methods and systems consistent with the present invention, therefore, provide a routing table update method with which routing table updates are achieved without crashing and at the same time minimizing black hole intervals. | 02-05-2009 |
| 20090043912 | Providing Full Point-To-Point Communications Among Compute Nodes of an Operational Group in a Global Combining Network of a Parallel Computer - Methods, apparatus, and products are disclosed for providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer, each compute node connected to each adjacent compute node in the global combining network through a link, that include: receiving a network packet in a compute node, the network packet specifying a destination compute node; selecting, in dependence upon the destination compute node, at least one of the links for the compute node along which to forward the network packet toward the destination compute node; and forwarding the network packet along the selected link to the adjacent compute node connected to the compute node through the selected link. | 02-12-2009 |
| 20090043913 | Cloning Hand Drawn Images - A method for cloning hand drawn images includes identifying, within an environment, a position of a wand with respect to each of a first plurality of user selected physical points. A virtual plane identified by the first plurality of points is defined. The virtual plane corresponds to a first marking surface. An electronic page is associated with the first virtual plane. A motion of the wand is tracked. The motion corresponds to a use of the wand to draw a first mark on the first marking surface. A path traced across the first virtual plane is identified. The path is defined by the tracked motion. The electronic page is updated to include a digital image representative of the path. The digital image is a clone of the mark. | 02-12-2009 |
| 20090049194 | Updating state in edge routers - Methods, edge routers and an edge-router-refresh network signalling message used to update state information in edge routers. A data session is established on a path from a source towards a destination connected from the source via a plurality of Autonomous Systems (AS). The edge-router-refresh network signalling message is created by an edge router acting an ingress edge router. The edge-router-refresh network signalling message comprises an identifier of the data session, an identifier of the edge router, which issued the edge-router-refresh message and an indication that the edge-router-refresh message is meant to be used by the edge routers present on the modified path. Optionally, the edge-router-refresh network signalling message further comprises a list of the plurality of AS traversed by the path before the modification. | 02-19-2009 |
| 20090083438 | NETWORK SYSTEM, NETWORK ADMINISTRATION APPARATUS, COMMUNICATION APPARATUS, PATH SETTING METHOD AND PROGRAM - The present invention provides a network system, a network administration apparatus, a communication apparatus, a path setting method and a program that can set a path by autonomous distributed control through an autonomous distributed control non-adaptive apparatus in a network including both an autonomous distributed control adaptive apparatus and the autonomous distributed control non-adaptive apparatus. For this purpose, a network system according to the present invention includes both an autonomous distributed control adaptive network and an autonomous distributed control non-adaptive network, and includes a network administration apparatus that can set predetermined paths in the autonomous distributed control adaptive network and the autonomous distributed control non-adaptive network, wherein the network administration apparatus has a function of setting an autonomous distributed control non-adaptive path as part of an autonomous distributed control adaptive path based on information indicating the autonomous distributed control non-adaptive path being set in the autonomous distributed control non-adaptive network. | 03-26-2009 |
| 20090113071 | Methods and Systems for Providing Efficient Provisioning of Data Flows - A system and method may include receiving a new flow request, the new flow request for requesting provisioning of a flow between a computer and the server, identifying a path of one or more network elements between the computer and the server, and determining whether provisioning the flow between the computer and the server violates a constraint. The system and method may further include updating an oversubscription factor and available bandwidth for an interface of each of the one or more network elements in the event the constraint is not violated, and determining whether a second path exists between the computer and the server in the event the constraint is violated. | 04-30-2009 |
| 20090138618 | RATE-CONTROLLABLE PEER-TO-PEER DATA STREAM ROUTING - Difficulties associated with choosing advantageous network routes between server and clients are mitigated by a routing system that is devised to use many routing path sets, where respective sets comprise a number of routing paths covering all of the clients, including through other clients. A server may then apportion a data stream among all of the routing path sets. The server may also detect the performance of the computer network while sending the data stream between clients, and may adjust the apportionment of the routing path sets including the route. The clients may also be configured to operate as servers of other data streams, such as in a videoconferencing session, for example, and may be configured to send detected route performance information along with the portions of the various data streams. | 05-28-2009 |
| 20090150566 | VIRTUALLY SYNCHRONOUS PAXOS - A variant of Paxos is referred to as Virtually Synchronous Paxos (VS Paxos). VS Paxos is a self-reconfigurable protocol that allows for delay only for reconfiguration decisions, without placing an artificial limit on regular decisions. In an implementation of VS Paxos, subject to any restriction on reconfiguration decisions, a leader may activate an unbounded number of consensus instances ahead. A VS Paxos technique permits unlimited progress during stability periods, in that a leader may initiate commands at any number of consensus instances without bound. VS Paxos waits for command completion only when configuration-changing commands occur. | 06-11-2009 |
| 20090157902 | Virtual Networks - A virtual network has a plurality of nodes. Each node has the capability to provide a service to another node. Each node maintains a list for storing entries each representing a link to another node; each entry contains the address of the other node and a label identifying a service that that other node may provide. Each node also has a store for storing messages received from other nodes, these messages serving to propose a link and containing the identity of the node originating the message, a label identifying a service that that other node may provide and a label identifying a service that that other node requires. When a node needs a service that it is not itself able to provide, it searches the link list for a link having a label that matches the service needed, and in the event that such a link is found it transmits to the node identified by the link a message requesting the service. If, however, no such link is found, it searches the message store for a message identifying another node where the label identifying a service that that other node may provide matches the service needed and the label identifying a service that that other node requires matches the service that the node needing the service has the capability to provide. In the event that such a message is found it initiates the creation of a corresponding entry in the link list. If no such message is found, the node needing the service generates a message serving to propose a link and containing its own identity, a label identifying a service that it has the capability to provide and a label identifying the service that it needs. | 06-18-2009 |
| 20090172192 | Mapless Global Traffic Load Balancing Via Anycast - Techniques are described for directing connections between clients and the closest web server. Authoritative DNS resolvers of a network are placed at edges of the network. Using anycast, the authoritative DNS resolvers advertise routes of their destination netblock to the Internet. A request from a client to connect to the network is routed, based upon BGP tables, to the closest particular authoritative DNS resolver. Once the request is received, a response is sent to the client with the IP address of the closest web server. The closest web server is determined through in-network health check measurements, with the authoritative DNS resolvers dynamically selecting IP addresses closest to themselves. Routing protocols that directed the packet to the closest authoritative DNS resolver also dictate the route of subsequent traffic to the network. Thus, the closest web server selected by the authoritative DNS resolver is also the closest web server to the client. | 07-02-2009 |
| 20090198833 | METHOD FOR DISTRIBUTING CONTENT DATA PACKAGES ORIGINATED BY USERS OF A SUPER PEER-TO-PEER NETWORK - A method for distributing content data packages | 08-06-2009 |
| 20090210556 | Time division address management device and time division routing information management device - There is provided an address management device, which includes an address storage unit configured to store an address used for communication for a local network and a global address used for communication for a global network, an address switch judgment unit configured to judge timing for switching between the address for the local network and the global address, and an address switch unit configured to switch between the address for the local network and the global address in accordance with a judgment result of the address switch judgment unit. | 08-20-2009 |
| 20090234969 | Automatic MEP Provisioning in a Link State Controlled Ethernet Network - Ethernet OAM MEPs are automatically configured in a link state protocol controlled Ethernet network. A node operating in the link state protocol controlled Ethernet network receives a Link State PDU (LSP) containing a TLV having a MEP associated with the Ethernet MAC node ID of a second node in the link state protocol controlled Ethernet network, where the path between the first and second node includes a plurality of links. The node updates a forwarding table to indicate an association between the MEP ID and a Ethernet MAC node ID of the second node. An Ethernet OAM maintenance endpoint is produced in a link state protocol controlled Ethernet network by hashing a Sys-ID to produce a MEP; storing the MEP in a TLV; and forwarding the TLV over the link state protocol controlled Ethernet network in an LSP. | 09-17-2009 |
| 20090254677 | DISCOVERY FOR FIBRE CHANNEL OVER ETHERNET DEVICES - Techniques are provided for performing discovery in a Fibre Channel over Ethernet (FCoE) network. An FCF discovers other FCoE Forwarders (FCFs) connected to its network segment by transmitting a solicitation message to the multicast MAC address “All-FCF-MACs”. All FCFs receive packets with this multicast MAC address including the solicitation message that announces the presence of the FCF. Each FCF replies with a unicast advertisement message that provides the new FCF with a MAC address of the responding FCF. The FCF builds a list of the FCFs available on its network segment and may then establish a virtual link with one or more of the FCFs through an exchange link parameter (ELP) exchange. | 10-08-2009 |
| 20090282168 | SERVER, P2P NETWORK SYSTEM, AND METHOD FOR ROUTING AND TRANSFERRING RESOURCE KEY ASSIGNMENT THEREOF - A server, a P2P network system, a method for routing, and a method for transferring resource key assignment are provided. The server comprises a routing processing module and a storage module connected therewith. The P2P network system comprises a structured P2P network and a server configured therein. The server routes the searching node to the node storing the resource key assignment based on the stored information, to thereby achieve a quick route. The method for routing is realized by searching for the node storing the resource key assignment via the server. Therefore, it merely takes two hops, i.e., the server and the node storing the resource key assignment, for the node to find the resource key assignment in search. | 11-12-2009 |
| 20090287846 | Method and Apparatus for Load Balancing in Network Based Telephony Based On Call Length - Techniques are disclosed for load balancing based on call length in networks such as those networks handling telephony applications. By way of example, one method for directing requests associated with calls to servers in a system comprised of a network routing calls between at least one caller and at least one receiver wherein the network comprises a load balancer sending requests to a plurality of servers comprises the following steps. A first request of a call is received. A server s | 11-19-2009 |
| 20090300215 | SERVERLESS DISTRIBUTED MONITORING AND ANOMALY DETECTION FOR A SERVICE ORIENTED ARCHITECTURE - A system and method for serverless distributed monitoring anomaly detection for a service oriented architecture is provided. The method includes selecting a number of nodes, e.g. super peers, to form an overlay network which is configured to facilitate bidirectional information flow creating a peer-to-peer monitoring framework through replication chains. The method continues with mapping the overlay network to data by assigning each of the selected nodes to a data region related to its surroundings. The method continues with distributing the data regions among the nodes via the aforementioned replication chain, where each replication chain is sensitive to the type of application that requests data duplication in monitoring the data by collecting information from each of those nodes that correspond to an assigned or distributed data region. This method may also include taking corrective action if the node detects an anomaly. | 12-03-2009 |
| 20090319688 | PARTICIPATING IN CLOUD AS TOTALLY STUBBY EDGE - A Totally Stubby Edge (TSE) participates in a cloud under the condition that the TSE may select paths for frames that the TSE introduces to the cloud, but may not transit frames between nodes in the cloud. The edge submits, to an administrator of the cloud, a request to join the cloud. If the administrator allows the request, then the edge is given access to the address tables that define the structure of the cloud, and may insert itself into the structure. The edge may use the address tables to select paths for frames that the edge introduces to the cloud. Normally path decisions are made by devices that the administrator trusts and controls. However, since the TSE selects paths for its own frames but does not transit frames between other nodes in the cloud, the TSE may select paths even if it is untrusted by the administrator. | 12-24-2009 |
| 20090319689 | METHOD AND DEVICE FOR MANAGING MULTICAST GROUPS - A method for managing multicast traffic in a data network, and devices using said method. The hosts store for each multicast group an included source record and an excluded source record, and the network interfaces of the hosts send to the router a message containing information about the included source record and information about the excluded source record. The router also stores for each multicast group an included source record and an excluded source record, and updates them when it receives through its network interface a message from the hosts containing information about an included source list and/or information about an excluded source list. The devices are a router, host equipment and network equipment compatible with the method. | 12-24-2009 |
| 20100042745 | Workflow diagram generation program, apparatus and method - In a computer for executing a process in accordance with a workflow diagram generation program, a path extractor extracts processing paths from program information indicating the procedure of a business program, and generates path information indicating read and update processes performed in the individual processing paths and operation screens displayed in the processing paths. A path associator associates each transition relation, which is the relation between two data sets successively updated, with a processing path of which the data set to be read agrees with the data set of the transition source and of which the data set to be updated agrees with the data set of the transition destination. A flow diagram generator generates a workflow diagram which indicates the data sets as nodes and the transition relations as links and in which information indicating the operation screens displayed in the processing paths are annexed to the corresponding links. | 02-18-2010 |
| 20100049868 | Maintaining protocol adjacency state with forwarding failure - In one embodiment, a method generally includes establishing a routing protocol peer relationship and a Bidirectional Forwarding Detection (BFD) session with a neighbor node, receiving a DOWN BFD event signal from the neighbor node, and maintaining a routing protocol adjacency down state following successful exchange of routing protocol packets with the neighbor node. An apparatus for maintaining protocol adjacency state with a forwarding failure is also disclosed. | 02-25-2010 |
| 20100049869 | Methods and Apparatus for Event Distribution and Routing in Peer-to-Peer Overlay Networks - 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. | 02-25-2010 |
| 20100049870 | DENSE MODE CODING SCHEME - A lookup table for searching for a longest prefix match for a key is disclosed. The lookup table provides a match for a key in a single search cycle. The number of matches stored in the lookup table is maximized by storing each match in only one location in the lookup table. The binary tree is divided into a plurality of levels and each level has a plurality of subtrees. A subtree descriptor stored for a subtree includes a field for each node in the subtree. The state of the field indicates whether an entry for the node is stored in the table. The bit vector allows indexing of the single match stored for the key. | 02-25-2010 |
| 20100088428 | INDEX RANK OPTIMIZATION SYSTEM AND METHOD - An index ranking optimization system and method are provided herein. | 04-08-2010 |
| 20100100639 | METHOD FOR PROVIDING INTERNET PROTOCOL HANDOFF OF MOBILE NODE UNDER MULTIPLE MOBILE AGENT PLATFORM ENVIRONMENT - Provided is a method for providing Internet protocol (IP) handoff of a mobile node (MN) under a multiple mobile agent platform (MAP) environment. In the method, a registration request message for an IP handoff is received from an MN in a network including a plurality of MAPs, and information about the MN is shared with an MAP managing an area in which the MN is located before through a signal packet path. The signal packet path is established separately from a data packet path for transmitting signal packets associated with IP handoff. An IP handoff for the MN is provided based on the shared information. Therefore, a rapid IP handoff is possible since the two MAPs share information about the MN with each other. | 04-22-2010 |
| 20100106856 | System and Method for Providing a Routing Service in Distributed Computing Environment - A system for providing a routing service that enables a client to locate a target service in distributed computing environment that supports multiple communications protocols. The system includes a main database and a routing mechanism. The main database has routing information. The routing mechanism can be distributed in multiple instances. The routing mechanism includes a local database. The local database stores an extract of the main database. The routing mechanism uses the local database to make routing decisions. To locate the target service, the client first obtains a reference to the routing mechanism. The client then sends a request with input parameters to the routing mechanism. The routing mechanism then returns output parameters to the client. The output parameters contains a reference and/or associated properties of the target service depending on the type of the target service. The client analyzes the returned output parameters and locates the target service. | 04-29-2010 |
| 20100115129 | CONDITIONAL PROCESSING METHOD AND APPARATUS - A conditional processing method and apparatus for efficient memory management are provided. A conditional processing method includes generating a parse tree by loading a plurality of nodes of data structured based on a declarative description language in a memory in series; evaluating, when a parsing switch node having an attribute describing a condition for conditional processing exists among the nodes, child nodes of the parsing switch node according to the attribute; loading only the child nodes fulfilling the attribute in the memory; and outputting the child nodes retained on the memory. | 05-06-2010 |
| 20100115130 | TIME SLOT ALLOCATION METHOD FOR REDUCING CONSUMPTION OF ENERGY IN WIRELESS SENSOR NETWORK - Disclosed is a time slot allocation method for reducing consumption of energy in a wireless sensor network, including transmitting and receiving, by an upper node, a report request and a response to and from at least one lower node in order to identify whether there is data to be transmitted between the upper node and the at least one lower node, transmitting, by the upper node, information required for data transmission to the at least one lower node based on the report request and response, and transmitting and receiving, by the upper node, data to and from the at least one lower node based on the information required for data transmission. | 05-06-2010 |
| 20100125675 | UPDATING ROUTING INFORMATION BASED ON CLIENT LOCATION - 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. | 05-20-2010 |
| 20100138558 | SYSTEM, DEVICE, METHOD AND COMPUTER-READABLE MEDIUM FOR PROVIDING NETWORK SERVICE INFORMATION - A system, device, method and computer-readable medium are disclosed. The system includes a server and a client. The server provides a plurality of network services and includes a service list module for generating a network service information list. The network service information list at least includes network paths of the plurality of network services. The client, coupled to the server, includes an automatic information retrieving handler. The automatic information retrieving handler sends a request to the service list module of the server upon detecting a network path, inputted by an user, pointing to the server, receives at least a portion of network service information from the network service information list of the server, and selectively displays at least a portion of the network service information to the user. | 06-03-2010 |
| 20100138559 | SYSTEMS AND METHODS FOR DIRECTION OF COMMUNICATION TRAFFIC - An Internet traffic redirection architecture is disclosed that allows for directing of trash traffic to specified sites. The system or method allows a controller, such as an ISP, to benefit from mistyped Internet addresses so that participating partners of the ISP are presented to the customer when the requests a web site that is not found or does not exist. The system decreases lost traffic by means of capturing unresolved “trash” traffic on the Internet and redirecting said traffic to a search engine partner and/or other partners. | 06-03-2010 |
| 20100146150 | MANAGEMENT NETWORK FOR NETWORK MANAGEMENT, ITS MANAGEMENT METHOD, AND NETWORK ELEMENT USED THEREFOR - A management network for managing networks managed individually by a plurality of groups, wherein authorization and unauthorization of access for supervision and control are automatically set. Each network element is assigned a TID, as a prefix, having a group ID identifying a group to which the network element belongs. Topology information considered from each network element to all network elements includes a group ID. When a group ID included in the received topology information matches the prefix of the TID assigned to its own network element, the source is registered at the authorized side of the access authorization list (step | 06-10-2010 |
| 20100146151 | ROUTING PATH ESTABLISHMENT APPARATUS AND METHOD IN ZIGBEE NETWORK - An apparatus and method for establishing a routing path in a ZigBee network including a device in sleep mode is provided. The method includes receiving a route request command, and establishing a path with reference to sleep information of a destination device and of all devices located on a path to the destination device. Accordingly, while the devices are allowed to sleep for energy efficiency even in a non-beacon-enabled mode, an ad-hoc on-demand distance vector (AODV)-based mesh routing method which uses a route request command (RREQ) and a route reply command (RREP) can be used as is, and thus the ZigBee network can be utilized in more various application fields. | 06-10-2010 |
| 20100180048 | Server-Centric High Performance Network Architecture for Modular Data Centers - Disclosed are systems and methods for network architecture that is a server-centric network architectural design. | 07-15-2010 |
| 20100211694 | ROUTING USERS TO RECEIVE ONLINE SERVICES BASED ON ONLINE BEHAVIOR - Tools and techniques for routing users to receive online services based on online behavior are provided. These tools may receive representations of activity involving different users in interacting with online services, and may analyze these representations of user activity. The tools may also compute scores for the users based on this previous user activity. The scores may indicate a server system, out of several server systems, which the user is to be routed to obtain online services. The tools may also store the user's score as associated with the user. | 08-19-2010 |
| 20100211695 | CONTEXT-AWARE COMMUNICATIONS - There is provided a system having a processor, and a memory having instructions stored therein in a form that is readable by the processor. The instructions, when read by the processor, cause the processor to perform steps of: receiving a first signal that indicates an initiation of a communication from a calling device to a called device; receiving a context parameter of the called device; evaluating the context parameter; and generating a second signal, based on the step of evaluating, to control a routing of the communication. | 08-19-2010 |
| 20100241761 | Content Engine for Mobile Communications Systems - An exemplary content engine includes a content gateway configured to analyze and route content requests to a content server. The content server can be a cache server or a mobile content server. The cache server can be configured to receive and store cacheable web content from a controller that is configured to receive the cacheable web content from at least one cacheable web content provider, such as a web server, and route the content to the cache server. The mobile content server can be configured to receive, from the controller, and store the digital media content. The controller can be further configured to receive the digital media content from at least one external content server and route the content to the mobile content server. The content gateway can be further configured to receive non-cacheable web content from at least one non-cacheable web content provider. | 09-23-2010 |
| 20100287306 | COMPUTER SUPPORTING REMOTE SCAN - A computer acquires first connection information related to a path connecting a host computer and a local storage, and acquires second connection information related to a path connecting storage systems. The computer creates route management information based on the connection information. The route management information is information related to a plurality of routes. A single route is configured from two or more nodes connected in series and an inter-node path. The start node of the two or more nodes is a host computer, and the other node of the two or more nodes is a storage system. Based on the route management information, the computer selects, as the host computer for executing a remote scan, the host computer that is the start node of the optimum route from among the plurality of routes having the scan-targeted remote storage as the end node. | 11-11-2010 |
| 20100293295 | LIMITED BROADCAST, PEERING AMONG DHTs, BROADCAST PUT OF LIMITED CONTENT ONLY - In system of networks that are not fully meshed with each other and that are capable of processing distributed hash table (DHT) Put and Get messages, message flooding of GET messages is limited by maintaining a list of DHTs the GET has visited. Also, PUT messages include not only the storage location key in the home network but also a list of networks that the PUT has visited, in essence establishing a dynamically changing path within the PUT back to the home network. | 11-18-2010 |
| 20110004701 | PROVISIONING HIGHLY AVAILABLE SERVICES FOR INTEGRATED ENTERPRISE AND COMMUNICATION - A development, deployment and execution environment for a plurality of application components present in a distributed system in a service oriented architecture paradigm, the plurality of application components comprising both enterprise application components and communications application components and a method for application component life cycle management as well as registration, discovery, routing and processing of both synchronous and asynchronous service requests among the plurality of application components. | 01-06-2011 |
| 20110022728 | LINK STATE ROUTING PROTOCOLS FOR DATABASE SYNCHRONIZATION IN GMPLS NETWORKS - The present invention relates to a method and apparatus for synchronizing local databases maintained control plane (CP) nodes in a GMPLS network. CP nodes that are not involved in path computation do not need to store the TE information contained in opaque link state advertisements (LSAs). These CP nodes only store that part of an opaque LS which is used during the flooding procedure to verify if the LS is new or updated. This verification is based on a few fields of the LSA that contain link state (LS) identifying information. A CP node that is not involved in path computation stores only the LS identifying information and discards the remainder after the LSA is relayed to it neighbor CP nodes. | 01-27-2011 |
| 20110022729 | SUPPORTING NON-DELIVERY NOTIFICATION BETWEEN A SWITCH AND DEVICE IN A NETWORK - Provided are a computer program product, system, and method for supporting non-delivery notification between a switch and device in a network. A login with a switch is initiated including a test service parameter requesting a non-delivery notification service to cause the switch to return a non-delivery notification in response to a test path request indicating a destination node that is unavailable. Indication is made that the test service is available for the login in response to receiving a reply from the switch that the switch accepts the login with the non-delivery notification service. The test path request is sent to the switch to determine whether the destination node is available in response to determining that the non-delivery notification service is available for the switch login. The non-delivery notification is received from the switch in response to the switch determining that the destination node to which the test path request is directed is unavailable. | 01-27-2011 |
| 20110040893 | Distributed Internet caching via multiple node caching management - Distributed Internet caching via multiple node caching management. Caching decisions and management are performed based on information corresponding to more than one caching node device (sometimes referred to as a distributed caching node device, distributed Internet caching node device, and/or DCN) within a communication system. The communication system may be composed of one type or multiple types of communication networks that are communicatively coupled to communicate there between, and they may be composed of any one or combination types of communication links therein [wired, wireless, optical, satellite, etc.]). In some instances, more than one of these DCNs operate cooperatively to make caching decisions and direct management of content to be stored among the more than one DCNs. In an alternative embodiment, a managing DCN is operative to make caching decisions and direct management of content within more than one DCNs of a communication system. | 02-17-2011 |
| 20110047292 | METHOD AND SYSTEM FOR INTELLIGENT ROUTING OF REQUESTS OVER EPP - Method and system for routing EPP requests over a network are provided. The EPP request can include XML namespace information and optionally XML sub-product information. A gateway can receive the request and analyze the namespace and in some instances, sub-product information to determine the service to which the request is directed. Thereupon, the gateway can route the request to the appropriate service by consulting a routing table that can have status and connectivity information for all the available services. | 02-24-2011 |
| 20110047293 | APPLICATION NETWORK COMMUNICATION METHOD AND APPARATUS - A method and apparatus is provided to discover and integrate applications in an application router framework. The discovery operation includes receiving a registration notification for an application on a network, adding information describing the application to a repository into a data structure and publishing the data structure onto an application router. The association operations include querying one or more application routers on an application network for meta-data and other information on applications, exchanging the meta-data and other information between the application routers and associating the applications together automatically using their respective application protocols. Routing operations include receiving application information in an application protocol format, converting the application information in the application protocol format into a neutral protocol format and forwarding the application information in the neutral protocol format along with state information to other application router devices on the network. | 02-24-2011 |
| 20110055426 | DYNAMIC AND EVOLUTIONARY PLACEMENT IN AN EVENT-DRIVEN COMPONENT-ORIENTED NETWORK DATA PROCESSING SYSTEM - Method, system and computer readable program code for dynamic and evolutionary 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 operator 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 and the routing values are updated according to an update rule that represents a chromosome in a routing probe. The update rule in a routing probe is selectively updated from a plurality of update rules at the consumer. The probability of selecting a particular update rule is reinforced or decayed based on the success of an update rule in allowing routing probes to create many different efficient routes. At each producer, nests of scouting probes are adaptively selected from an available set of nests and dispatched to execute hypothetical placement of a query by an independent agent called a “leader”. A placement of the operator components that minimizes performance cost of the system relative to the hypothetical placement is selected. Each scouting probe contains chromosomes that guide placement. Scouting probes in two different nests have different chromosomes. The performance cost of the hypothetical changed placement is evaluated and the performance evaluation is used to evolve at least one chromosome of a scouting ant in each nest. | 03-03-2011 |
| 20110072157 | METHOD, DEVICE, AND COMMUNICATIONS SYSTEM FOR MANAGING QUERYING MAPPING INFORMATION - The present invention discloses a method, a device, and a communications system for managing and querying mapping information. The method for managing mapping information includes: signing a mapping information pair by using a private key of a certificate corresponding to a prefix in the mapping information pair to generate a signed mapping pair; submitting the signed mapping pair to a registration agent (RA) in a transit network; and sharing, by the RA, the signed mapping pair with other RAs through data synchronization. With the mapping information management method, data transmission method, devices and communications system provided by the present invention, the security of mapping information in registration, query, and synchronization operations is guaranteed. | 03-24-2011 |
| 20110119399 | DEADLOCK-FREE CLASS ROUTES FOR COLLECTIVE COMMUNICATIONS EMBEDDED IN A MULTI-DIMENSIONAL TORUS NETWORK - A computer implemented method and a system for routing data packets in a multi-dimensional computer network. The method comprises routing a data packet among nodes along one dimension towards a root node, each node having input and output communication links, said root node not having any outgoing uplinks, and determining at each node if the data packet has reached a predefined coordinate for the dimension or an edge of the subrectangle for the dimension, and if the data packet has reached the predefined coordinate for the dimension or the edge of the subrectangle for the dimension, determining if the data packet has reached the root node, and if the data packet has not reached the root node, routing the data packet among nodes along another dimension towards the root node. | 05-19-2011 |
| 20110119400 | DISTRIBUTED ROUTING TABLE ARCHITECTURE AND DESIGN - A Distributed Routing Table (DRT) mesh can comprise two or more nodes, each of which maintains its own routing table that represents some or all of the overall routing knowledge of the DRT mesh. Each node can be comprised of modular components that can perform various defined functions such that the features and abilities of the node can be customized by an application based on which modular components are instantiated. A routing table management module can maintain individual routing tables at each node, and can ensure that only entries that are close to the node, in a network topology sense, are maintained in the routing table. In addition, a security module can verify received messages based on an agreed-upon root certificate. | 05-19-2011 |
| 20110153864 | System and Method to Discover Clients Associated with Local Domain Name Server using Sampling - A system includes an analyzer module, a content request data collection module, and a domain name server. The content request data collection module is configured to receive a content request sent to a tracking address, collect content request information about the content request, and provide the content request information to the analyzer module. The domain name server is configured to receive an address request from a local domain name server for a cache server address, provide a tracking address to the local domain name server, collect address request information about the address request, and provide the address request information to the analyzer module. The analyzer module is configured to receive the address request information and the content request information, and determine properties of clients served by the local domain name server based on the address request information and the content request information. | 06-23-2011 |
| 20110191494 | SYSTEM AND METHOD FOR BACKWARDS COMPATIBLE MULTI-ACCESS WITH PROXY MOBILE INTERNET PROTOCOL - A system and method of changing traffic from a first access associated with a first access router to a second access associated with a second access router utilized by a terminal in a telecommunication network using PMIP. The method begins by the terminal sending a first message to a Local Mobility Anchor (LMA), through the second access router, requesting a change of access from the first access to the second access. The LMA receives the first message and installs a new routing state associated with the second access router and the second access. A second message is then sent from the LMA to the terminal acknowledging the change in access of the terminal to the second access. The routing state associated with the second access router and the second access is then installed in the terminal. | 08-04-2011 |
| 20110191495 | SYSTEMS AND METHODS FOR DISCERNING AND CONTROLLING COMMUNICATION TRAFFIC - Communication traffic redirection systems and methods are disclosed that allow for redirection of communication traffic over the Internet based, at least in part, on the type of higher-level communication protocol intended to be used. The systems and methods permit redirection of only certain types of communication traffic of interest, for example HTTP traffic, while permitting other types of communication, for example SMTP traffic, to pass without redirection. The systems and method can employ a training and dynamic feedback procedure to ensure only traffic of interest is redirected. The systems and methods provide efficient redirection of specific types of traffic to redirect landing pages, and allow for efficient methods of generating revenue through advertising. | 08-04-2011 |
| 20110196985 | METHOD FOR TRACKING TRANSMISSION STATUS OF DATA TO ENTITIES SUCH AS PEERS IN A NETWORK - A method for tracking a transmission status of one or more data elements to one or more devices. In one example, the method includes providing a list including one or more devices and one or more data elements; processing the list to determine a data element of the one or more data elements to transmit to a device of one of the one or more devices; and upon successfully transmitting the data element to the device, adjusting the list so that the list indicates that the device has received the transmitted data element. In this manner, the status of whether a particular data element has been sent to a particular device can be easily derived from the list. | 08-11-2011 |
| 20110238864 | System and domain name server for ad-hoc networks - The present invention relates to a system and domain name server for ad-hoc networks. Embodiments of the present invention provide a mobile router providing connectivity to end users in an ad-hoc network. The mobile router includes a domain name server (DNS server) configured as a master DNS server at a node associated with the mobile router for end users that enter the ad-hoc network through the node. The DNS server stores records of name-address translations for the end users. A management structure of the DNS server at the node includes a domain name for the node coinciding with a domain name at a lowest level in a hierarchy of a domain name system. | 09-29-2011 |
| 20110271008 | Selective TCP Large Receive Aggregation Based On IP Destination Address - An information handling device receives a packet and determines a packet destination for the packet. In turn, the information handling device either aggregates the packet in response to determining that the packet destination is a local destination, or forwards the packet in response to determining that the packet destination is a non-local destination. | 11-03-2011 |
| 20110271009 | INTERFACE GROUPING FOR MEDIA ACCESS CONTROL ADDRESS PINNING IN A LAYER TWO NETWORK - An example network device includes a set of interfaces, a control unit, and a forwarding engine. The control unit includes an interface group information repository that stores data defining interface groups. Each interface group includes one or more interfaces. The forwarding engine includes a media access control (MAC) address repository that stores a mapping of a first interface to a source MAC address, and a MAC address management module that determines whether an interface group to which the first interface is assigned is the same interface group as the interface group to which a second interface is assigned. The control unit is configured to receive a layer two (L2) communication via the second interface, wherein the L2 communication includes the source MAC address. The forwarding engine dynamically updates the MAC address repository based on the determination of the MAC address management module. | 11-03-2011 |
| 20120005371 | System and Method to Implement Joint Server Selection and Path Selection - An apparatus comprising a content router configured to couple to a customer node and implement joint server selection (SS) and path selection (PS) to meet a user request for content and achieve load balancing for transporting the requested content in a provider network. Also disclosed is a network component comprising a receiver unit in a content router or switch configured to receive a user request for content, a content routing engine configured to implement a joint SS and PS algorithm to select a plurality of servers that comprise the content and a plurality of paths that achieve load balancing for transporting the content, and a transmitter unit configured to indicate the selected servers and paths to a provider network. | 01-05-2012 |
| 20120011278 | Systems and Methods for Removing Stale Mapping Entries for Network Element - A method may include updating a routing table on a first network element based on a shortest path first calculation in response to a network change event. For each deletion from the routing table, a message may be broadcasted to a second network element adjacent to the first network element indicative of such deletion, the message including a target identifier (TID) associated with such deleted entry, wherein the second network element is configured to invalidate its associated TID address resolution protocol (TARP) cache in response to receiving the message. For each deletion from the routing table, a local TARP cache of the first network element may be searched to determine if an entry exists in the local TARP cache mapping the TID associated with such entry to a NASP associated with such entry. The local TARP cache may be invalidated in response to determining that the entry exists. | 01-12-2012 |
| 20120042097 | System and Method for Advanced Interoperability - Enhanced interoperability (e.g., connectivity, communication, processing, routing, billing, etc.) capabilities are provided through an IP eXchange (IPX) facility that among other things may offer a simple, consolidated, etc. interface mechanism and which may leverage various pools of data to expeditiously process and route a quanta of data (including conventional SMS, MMS, etc. messaging; VoIP and other audio/video data streams; SIP-addressed artifacts; signaling data; voice call data; application data; etc.). | 02-16-2012 |
| 20120066409 | APPARATUS AND METHOD FOR CONTROLING NETWORK USING IDENTIFICATION INFORMATION OF OBJECT - Provided is an apparatus and method for controlling a network using identification information of an object. The network controlling apparatus may include an extractor to extract identification information of a receiving object from received data, and a controller to verify, from a database, forwarding information that is stored in correspondence to the identification information, and to transfer the data to a gateway associated with a second domain designated by the forwarding information, when the receiving object is not included in a first domain. | 03-15-2012 |
| 20120084460 | METHOD AND SYSTEM FOR DYNAMIC TRAFFIC STEERING - A method and system for dynamic traffic steering is described. In one embodiment, a method for dynamic traffic steering involves receiving a request for content at a steering component, comparing information in the request with steering criteria in the steering component, steering the request based on the comparing, and continuously updating the steering criteria based on requests that are subsequently received at the steering component. Other embodiments are also described. | 04-05-2012 |
| 20120102228 | INTER-DOMAIN ADVERTISEMENTS IN MULTI-DOMAIN NETWORKS - In a multi-domain network each domain, or Autonomous System (AS), has a route calculation entity (PCE A) which is responsible for computing paths between domains on behalf of clients. The route calculation entity (PCE A) sends advertisement messages to a route calculation entity (PCE B) in another domain. The advertisement message carries at least one of: inter-domain resource information and aggregated intra-domain information, such as simplified topology information or cumulative traffic engineering (TE) metrics. The inter-domain resource information can be inter-domain route or reachability information which is normally discarded by a routing protocol such as the Border Gateway Protocol (BGP) and can include inter-domain Traffic Engineering (TE) information such as reservable bandwidth. | 04-26-2012 |
| 20120124238 | PRIORITIZATION OF ROUTING INFORMATION UPDATES - Various exemplary embodiments relate to a method and related network node including one or more of the following: receiving, at the node, a network state update message; updating a first portion of a first set of routing information based on the network state update message; after updating the first portion of the first set of routing information, beginning an update of a second set of routing information; and after beginning the update of the second set of routing information, updating a second portion of the first set. In various alternative embodiments, the step of updating the first portion includes one or more of the following: determining at least one other node within the network for which routing information should be used to update the second set of routing information; and updating routing information associated with the at least one other node in the first set of routing information. | 05-17-2012 |
| 20120144066 | DYNAMICALLY GENERATING APPLICATION-LAYER TRAFFIC OPTIMIZATION PROTOCOL MAPS - In general, techniques are described for using routing information obtained by operation of network routing protocols to dynamically generate network and cost maps for an application-layer traffic optimization (ALTO) service. For example, an ALTO server of an autonomous system (AS) receives routing information from routers of the AS by listening for routing protocol updates outputted by the routers and uses the received topology information to dynamically generate a network map of PIDs that reflects a current topology of the AS and/or of the broader network that includes the AS. Additionally, the ALTO server dynamically calculates inter-PID costs using received routing information that reflects current link metrics. The ALTO server then assembles the inter-PID costs into a cost map that the ALTO server may provide, along with the network map, to clients of the ALTO service. | 06-07-2012 |
| 20120158997 | NETWORK SYSTEM AND METHOD OF ADDRESS RESOLUTION - A network system and a method of address resolution are provided. The network system includes a network, a plurality of virtual machines, a routing module and a path directory module. Each virtual machine includes an internet protocol (IP) address and N media access control (MAC) addresses, so as to connect the network through N transmission routes. The routing module detects and calculates states of the transmission routes. The path directory module receives and decodes an address resolution protocol (ARP) request presented by at least one source virtual machine to reply path information, which includes N MAC addresses corresponding to an IP address of a destination virtual machine and states of the N transmission routes. Thus, the virtual machines present the ARP request without broadcast, so that the problem of network congestion is solved. | 06-21-2012 |
| 20120191873 | RELAY APPARATUS, COMMUNICATION NETWORK SYSTEM, AND LOAD DISTRIBUTION METHOD - In a network where a plurality of large-scale network address translation (LSN) devices are disposed, a relay apparatus acquires the numbers of sessions held by the plurality of LSN devices in the network and allocates a packet received from a subscriber to the LSN device holding the smallest number of sessions or to the LSN device having a fewer number of sessions than a predetermined threshold, thereby distributing subscriber sessions evenly to the plurality of LSN devices. | 07-26-2012 |
| 20120210018 | System And Method for Lock-Less Multi-Core IP Forwarding - Described herein are systems and methods using lock-less multi-core IP forwarding having dedicated forwarding cores. The exemplary embodiments may offer wire-rate on multiple gigabit links while guaranteeing packet order. One embodiment relates to a system including a plurality of forwarding cores within a network, and a routing table, wherein a first forwarding core of the plurality of forwarding cores polls data received from an input interface for routing information, references the routing table based on the routing information, determines a destination for the data based on the routing table, and transmits the data to the destination at a wire-rate, the wire-rate is independent from a further wire-rate corresponding to a further forwarding core of the plurality of forwarding cores. | 08-16-2012 |
| 20120226820 | SYSTEM AND METHOD OF TRAFFIC INSPECTION AND STATEFUL CONNECTION FORWARDING AMONG GEOGRAPHICALLY DISPERSED NETWORK APPLIANCES ORGANIZED AS CLUSTERS - A peering relationship among two or more network appliances is established through an exchange of control messages among the network appliances. The peering relationship defines a cluster of peered network appliances, and at each network appliance of the cluster traffic flow state information for all the network appliances of the cluster is maintained. Network traffic associated with traffic flows of the network appliances of the cluster is managed according to the state information for the traffic flows. This managing of the network traffic may include forwarding among the network appliances of the cluster (i.e., to those of the appliances handling the respective flows) at least some of the network traffic associated with one or more of the traffic flows according to the state information for the one or more traffic flows. The traffic flows may be TCP connections or UDP flows. | 09-06-2012 |
| 20120226821 | APPARATUS AND METHOD FOR LAYER-2 AND LAYER-3 VPN DISCOVERY - An apparatus and a method for layer-2 and layer-3 VPN discovery are disclosed. The apparatus is incorporated in a network, and the network includes a first carrier network. The first carrier network includes at least two layer-1 provider edge devices. Layer-1 VPN information is created within the first carrier network. BGP next hop information passes within the first carrier network. The BGP next hop information is for a selected one of the following: a layer-2 VPN-based provider edge device, a layer-3 VPN-based provider edge device, and a layer-2 and layer-3 VPN-based provider edge device. The network also includes a second carrier network within which the BGP next hop information is used for VPN discovery. | 09-06-2012 |
| 20120254465 | Method and system for improved routing - Method for use in updating a routing table of a router of a plurality of routers, said routing table comprising the route(s) to be used for at least one destination, wherein update messages with routing information are sent between said plurality of routers, typically BGP routers, wherein the following steps are performed at the router: receiving of an update message containing a path or a withdrawal of a path for a destination; determining if the (withdrawn) path is associated with a path exploration event; deciding on the updating of the routing table taking into account the result of the determination. | 10-04-2012 |
| 20120265900 | UPDATING ROUTING INFORMATION BASED ON CLIENT LOCATION - 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. | 10-18-2012 |
| 20130054834 | ROUTE SEARCH DEVICE, ROUTE SEARCH METHOD, AND ROUTE SEARCH PROGRAM - The first route searching unit searches among multiple routes from a start node toward a goal node for a first route by using topology information. The topology information changing unit changes the topology information by excluding the first route from the multiple routes and setting, to configuration links constituting the first route, additional links whose direction is opposite to that of the configuration links. The port information changing unit changes port information such that communication in a direction from the goal node toward the start node is permitted in the configuration links and the additional links. The second route searching unit searches for a second route by using the changed topology information and the changed port information. The redundant route searching unit searches for a pair of redundant routes by eliminating the configuration links that overlap on the first route and the second route. | 02-28-2013 |
| 20130124757 | Methods and Apparatus for Secure Routing of Data Packets - Methods and arrangements for supporting a forwarding process in routers when routing data packets through a packet-switched network, by employing hierarchical parameters in which the hops of a predetermined transmission path between a sender and a receiver are encoded. A name server generates and distributes router-associated keys to routers in the network which keys are used for computing the hierarchical parameters. | 05-16-2013 |
| 20130138834 | SERVER DEVICE, COMPUTER-READABLE STORAGE MEDIUM, AND METHOD OF ASSURING DATA ORDER - A stop unit stops transmitting data to a plurality of nodes for every predetermined period. An acquisition unit acquires versions of routing tables, which are updated in accordance with movement of a query, from the plurality of nodes when the transmission of the data is stopped. A comparison unit compares the versions of the routing tables of the plurality of nodes that are acquired. when there is a node in which the routing table of an old version is stored as a result of the comparison, an update unit updates the routing table of the node. | 05-30-2013 |
| 20130159550 | ASSISTED INTELLIGENT ROUTING FOR MINIMALISTIC CONNECTED OBJECT NETWORKS - In one embodiment, a distributed intelligence agent (DIA) collects local state information from a plurality of minimalistic connected objects (MCOs) in a computer network, the local state information for each MCO comprising a corresponding neighbor list and a selected next-hop for the respective MCO, where one or more of the MCOs are configured to select their next-hop without any self-optimization. The DIA may then analyze a current routing topology, which is the combined result of the selected next-hops, in comparison to a computed optimal routing topology, and (optionally) in light of required service level agreement (SLA), to determine whether to optimize the current routing topology. In response to determining that the current routing topology should be optimized, the DIA may transmit a unicast routing instruction to one or more individual MCOs to instruct those individual MCOs how to optimize the current routing topology, accordingly. | 06-20-2013 |
| 20130254426 | METHOD AND SYSTEM OF PROVIDING IP-BASED PACKET COMMUNICATIONS IN A UTILITY NETWORK - One example embodiment provides a method and system where a node in a utility network registers with one or more access point devices associated with one or more local area utility networks. The utility node generates a unique network address using a network address prefix of a network address associated with the access point device. The utility node registers with a DNS server. Messages sent to the utility node are routed through the access point corresponding to the received prefix used to generate the unique network address for the utility node. The network address for the utility node and access point may be IPv6 addresses and the network address prefix may be an IPv6 prefix, or may be an IPv4 address. | 09-26-2013 |
| 20130262697 | System and Method for Routing Content Based on Real-Time Feedback - A method includes receiving at a cache server a content request from a client system, determining that the cache server is overloaded in response to receiving the content request, and in response to determining that the cache server is overloaded, returning to the client system a domain redirection response including a load status of the cache server. | 10-03-2013 |
| 20130262698 | METHOD AND ROUTER FOR SERVICE NAMED ROUTING - A first router sends to neighboring routers an interest packet associated with the at least one service including a service name indicator and a unique interest tag. A second router receives the interest packet, sends the interest packet to a server of the at least two servers and stores the interest tag together with the incoming and outgoing connection port in its interest route table. The server attaches data including load data of the at least one service to the interest packet and sends the interest packet back to the second router. The second router calculates service performance data based on the data attached, stores the service performance data in its service performance table and updates the routing table based on an evaluation of the service performance data, and sends the interest packet via its incoming connection port as associated by the interest route table to the first router. | 10-03-2013 |
| 20130318256 | DYNAMIC TABLE SHARING OF MEMORY SPACE WITHIN A NETWORK DEVICE - A network device for processing data on a data network includes a port interface configured to receive a data packet from a data network and to send a processed data packet to an egress port of the plurality of ports, a packet evaluation module configured to parse the received data packet and modify the received data packet to form the processed data packet and a search engine configured to perform searches of lookup tables using parsed data packet values and to return search results to the packet evaluation module to assist in modifying the received data packet. At least one lookup table shares at least two different types of entries in that same at least one lookup table, where the search engine is configured to distinguish between the at least two different types of entries in that same at least one lookup table. | 11-28-2013 |
| 20140006639 | Rich Media Status and Feedback for Devices and Infrastructure Components Using in Path Signaling | 01-02-2014 |
| 20140019640 | SYSTEM AND METHOD FOR DYNAMICALLY RE-CONFIGURING COMMUNICATIONS SESSION ROUTING BASED ON LOCATION INFORMATION - System and method for dynamically re-directing communications sessions destined for a particular entity in a communications system, each communications session being associated with at least one predefined route. Location information indicative of a current location of the particular entity is obtained and applied to a predefined set of conditional routing rules associated with the particular entity. This rules-based processing generates a routing result, on the basis of which the at least one predefined route associated with each communications session destined for the particular entity is dynamically updated. | 01-16-2014 |
| 20140052875 | Service Migration - At a migration server separate from a first server, a plurality of incoming internet protocol, IP, packets directed at an IP address associated with an IP service are received. On the basis of one or more source characteristics associated with IP packets in the plurality, it is determined that a first subset of packets in the plurality originated from one or more client devices which have not been migrated to a second server and that a second subset in the plurality originated from one or more client devices which have been migrated to the second server. IP packets determined to be in the first subset are forwarded to a first physical address associated with the first server for processing at the first server. IP packets determined to be in the second subset are processed at the second server. | 02-20-2014 |
| 20140075048 | Apparatus, System, and Method for Cloud-Assisted Routing - Among other aspects, the present disclosure provides a computer implemented method of routing information. A first routing information base is received at a proxy router. The first proxy router compares the first routing information based with a second routing information base associated with an assisted router. The proxy router updates the second routing information base based on the first routing information base. The proxy routing transmits updated routing information to the assisted router. | 03-13-2014 |
| 20140082216 | PERFORMING OFFLINE BGP PREFIX ORIGIN AND PATH VALIDATION AT ROUTE REFLECTORS - In one embodiment, an edge router receives an update message from a neighboring EBGP edge router, creates a modified origin validation state extended community, prepares a modified update message by attaching the modified origin validation state extended community to the update message, and sends the modified update message to a route reflector. The route reflector receives the modified update message, performs a prefix origin validation and a path validation based on the information contained in the modified update message, prepares a validation message based on the prefix origin validation and path validation, and sends the validation message to the edge router and to all other neighboring IBGP edge routers. The edge routers receive the validation message from the route reflector, parse the validation message, and inherit a validation state parsed from the validation message. | 03-20-2014 |
| 20140089523 | SYSTEMS AND METHODS FOR PROVIDING DNS SERVER SELECTION USING ANDSF IN MULTI-INTERFACE HOSTS - Systems and methods for extending Inter System Routing Policies (ISRPs) of an ANDSF to enable domain name system (DNS) flows to be identified by a queried domain may be disclosed. Such systems and methods may include providing an ISRP with a routing rule that may be used to select a DNS sever or interface thereof and resolve DNS for a target domain name and/or corresponding target URL for a website. | 03-27-2014 |
| 20140129736 | Data Routing - A routing device includes a routing table. The routing table has a set of entries, each entry including: a content name attribute containing a content name value identifying a content, a faces attribute containing a faces value identifying a set of devices storing data related to the content name value, and a mask type attribute containing a mask type value identifying a type of mask to be used for performing a routing table lookup. The routing device is configured to perform a routing table lookup, the routing table lookup including the use of the mask type value of an entry to determine a covering relation between the content name value of the said entry and a content name value to be searched. The routing device is further configured to update the routing table depending on the determined covering relation. | 05-08-2014 |
| 20140136730 | GROUND SYSTEM FOR VEHICLE DATA DISTRIBUTION - Techniques for delivering data or information to a vehicle include a ground based data distribution system that has a ground based determination engine and port networks, and is communicatively connected to access networks. The ground based determination engine determines a content of the data to be delivered to the vehicle, and/or determines one or more predicted locations of the vehicle. The ground based system causes the data to be delivered to the one or more predicted locations, and, at a particular predicted location, the delivered data is transferred to the vehicle, such as by using an information distribution device that is on-board the vehicle. Determination of the data content and of the one or more predicted locations may be performed while the vehicle is en route or is at a port. Data delivery may occur while the vehicle is en route or is at a port. | 05-15-2014 |
| 20140164645 | ROUTING TABLE MAINTENANCE - Among other things, one or more techniques and/or systems are provided for maintain a routing table. The routing table may comprise a routing statement associated with a destination. The routing statement may comprise a domain identifier, such as a URL, for the destination and a gateway identifier, such as an IP address, for a gateway through which communication traffic to the destination may be routed. During routing of a request, an IP address for the destination may be dynamically resolved based upon the domain identifier within the routing statement. The IP address may be cached for a restricted period of time so that subsequent requests may utilize the cached IP address. Because the routing statement is based upon a domain identifier (e.g., as opposed to a hardcoded static IP address), the routing statement may remain valid even though an IP address of the destination may change. | 06-12-2014 |
| 20140195696 | INFORMATION PROCESSING DEVICE, INFORMATION PROCESSING METHOD, AND INFORMATION PROCESSING SYSTEM - There is provided an information processing device including a communication unit that transmits a domain name of a server belonging to a first network, and receives, from a mapping device that maps an IP address on a first network corresponding to the domain name to an IP address on a second network, an IP address on the second network that corresponds to the domain name, an estimator that, from the IP address on the second network received by the communication unit and the IP address on the first network of the server, estimates a mapping rule that maps an IP address on the first network to an IP address on the second network, and a generator that, on the basis of an estimated mapping rule, generates an IP address on the second network from an arbitrary IP address on the first network. | 07-10-2014 |
| 20140250239 | System and Method for Routing Data to Devices within an Information Handling System - An information handling system includes a management controller and a router. The management controller includes a universal serial bus hub and first and second devices. The management controller to assign the first device to a first server node, to assign the second device to a second server node, and to create a routing table associated with the assignment of the first and second devices respectively to the first and second server nodes. The router is in communication with the management controller. The router to receive the routing table from the management controller, to receive data from the first server node, and to route the data to the first device based on the routing table. The universal serial bus hub communicates with the router via a single physical port of the management controller. | 09-04-2014 |
| 20140281028 | DELIVERY DEVICE, DELIVERY METHOD, ASSOCIATION INFORMATION GENERATION DEVICE, ASSOCIATION INFORMATION GENERATION METHOD, CONTROL PROGRAM, AND RECORDING MEDIUM - A secondary delivery server includes a route determination unit that determines a delivery route of each component by using component management information that contains route information used to identify a delivery route of the component, and a delivery control unit that delivers the component using the delivery route determined by the route determination unit. | 09-18-2014 |
| 20140330985 | SYSTEM AND METHOD OF UTILIZING A FRAMEWORK FOR INFORMATION ROUTING IN LARGE-SCALE DISTRIBUTED SYSTEMS USING SWARM INTELLIGENCE - In some embodiments, the invention involves information routing in networks, and, more specifically, to defining a framework using swarm intelligence and utilization of the defined framework for routing information in the network, especially for cloud computing applications. In an embodiment, information about available information/services is pushed to network nodes using information packets (ants). Nodes requiring services send query packets (ants) and a node may send a response to a query ant when information is available. Ants may be forwarded throughout the network based on popularity of nodes, freshness of information/requests, routing table information, and requests or interest by consumer nodes captured in information routing table. Other embodiments are described and claimed. | 11-06-2014 |
| 20140351452 | Chaining Service Zones by way of Route Re-Origination - Presented herein are techniques for use in a network environment that includes one or more service zones, each service zone including at least one instance of an in-line application service to be applied to network traffic and one or more routers to direct network traffic to the at least one service, and a route target being assigned to a unique service zone to serve as a community value for route import and export between routers of other service zones, destination networks or source networks via a control protocol. An edge router in each service zone or destination network advertises routes by its destination network prefix tagged with its route target. A service chain is created by importing and exporting of destination network prefixes by way of route targets at edge routers of the service zones or source networks. | 11-27-2014 |
| 20140365684 | DIAMETER ROUTE LEARNING - Various exemplary embodiments relate to a method and related network node including one or more of the following: receiving a message at the network device; constructing a route key based on the message, wherein the route key comprises at least one value carried by the message; determining whether the network device stores a previous route record associated with the route key; and if the network device does not store a previous route record associated with the route key, generating a new route record based on the route key, and provisioning a new route based on the new route record into a routing table of the network device. | 12-11-2014 |
| 20140379938 | HIERARCHICAL LOAD BALANCING IN A NETWORK ENVIRONMENT - An example method for load balancing in a network environment is provided and includes receiving a packet from a first stage load-balancer in a network environment, where the packet is forwarded from the first stage load-balancer to one of a plurality of second stage load-balancers in the network according to a hash based forwarding scheme, and routing the packet from the second stage load-balancer to one of a plurality of servers in the network according to a per-session routing scheme. The per-session routing scheme includes retrieving a session routing state from a distributed hash table in the network. In a specific embodiment, the hash based forwarding scheme includes equal cost multi path routing. The session routing state can include an association between a next hop for the packet and the packet's 5-tuple representing a session to which the packet belongs. | 12-25-2014 |
| 20150019755 | DATA-CENTRIC COMMUNICATIONS SYSTEM, NODE, AND DATA FORWARDING METHOD - A node, when an object request message includes a location ID of a destination, sets the location ID of the destination as a search key to search the location-ID forwarding table thereof and forwards the object request message to a node that is a next hop obtained as the search result; and when the object request message does not include the location ID of the destination, sets the object ID included in the object request message as a search key to search the object-ID forwarding table thereof to forward the object request message to the node that is the next hop obtained as the search result. | 01-15-2015 |
| 20150019756 | COMPUTER SYSTEM AND VIRTUAL NETWORK VISUALIZATION METHOD - A computer system according to the present invention includes a managing unit which outputs a plurality of virtual networks managed by a plurality of controllers in a visually perceivable form with the plurality of virtual networks combined, on the basis of topology data of the virtual networks, the topology data being generated based on communication routes. This enables centralized management of the whole of a virtual network controlled by a plurality of controllers which use an OpenFlow technology. | 01-15-2015 |
| 20150026362 | Dynamic Service Path Creation - Presented herein are techniques for dynamic creation of a unique service path for a service chain. In one example, a service controller and a plurality of service nodes are provided, each service node configured to apply a service function to traffic that passes through the respective service node. The service controller defines a service chain identifying a set of service functions and an order in which they are applied. The service controller receives an indication that the service chain has been instantiated at a classifier, and creates a unique service path for the service chain, wherein the unique service path includes the service chain and the classifier at which the service chain is instantiated. | 01-22-2015 |
| 20150074287 | Multi-Protocol Routing System and Method Driven by Application and Network in Convergence - The present invention relates to a multi-protocol routing system, comprising a route determining module and a forwarding module which are located in network layer, wherein the route determining module is used for determining, based on the related information of applications and networks, the types of routable protocols and the next-hop path which are to be selected in the current routing phase; the forwarding module, including different routable protocols and corresponding routing information, is used for periodically calculating the newest remaining network resources and the state of link during a routing process and updating the forwarding table in current state. By integrating various characteristics and states of applications as well as different routable protocols, the present invention realizes real-time protocol selection and dynamic routing. Moreover, the present invention is easy to be expanded to other protocols, thus being adaptive to the continuous development and evolution of network services. | 03-12-2015 |
| 20150074288 | ADDRESS MANAGEMENT IN MOBILE IP ENVIRONMENTS - A data unit processing entity | 03-12-2015 |
| 20150095514 | Content Centric M2M System - 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. | 04-02-2015 |
| 20150100705 | DYNAMIC SYMBOLIC LINKS FOR REFERENCING IN A FILE SYSTEM - 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. | 04-09-2015 |
| 20150113166 | METHOD AND APPARATUS FOR A NAMED NETWORK WITHIN AN AUTONOMOUS SYSTEM - 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. | 04-23-2015 |
| 20150113167 | 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-23-2015 |
| 20150127852 | SYSTEM AND METHOD FOR FACILITATING ROUTING - 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. | 05-07-2015 |
| 20150149657 | Path Optimization for Adaptive Streaming - 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. | 05-28-2015 |
| 20150149658 | SOFTWARE UPGRADE OF ROUTERS - 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. | 05-28-2015 |
| 20150295815 | Autonomous System (AS) Policy-Adaptive Confederations with Selective Advertisement of AS Numbers to Non-Members - In one embodiment, an autonomous system (AS) policy-adaptive confederation selectively manipulates the ordered list of traversed AS's using AS's of members of the policy-adaptive confederation and/or the AS of the policy-adaptive confederation itself when advertising to routers of AS's outside the policy-adaptive confederation. In one embodiment, a first member router of a first autonomous system (AS) within a policy-adaptive confederation identified by a confederation AS receives from a second member router of a second AS within the policy-adaptive confederation a route advertisement for a first route associated with a first ordered AS list identifying one or more AS's within the policy-adaptive confederation. The first member advertises the first route associated with the first ordered AS list not including the confederation AS to a first external router external to the policy-adaptive confederation. | 10-15-2015 |
| 20150312144 | TECHNOLOGIES FOR DISTRIBUTED ROUTING TABLE LOOKUP - Technologies for distributed table lookup via a distributed router includes an ingress computing node, an intermediate computing node, and an egress computing node. Each computing node of the distributed router includes a forwarding table to store a different set of network routing entries obtained from a routing table of the distributed router. The ingress computing node generates a hash key based on the destination address included in a received network packet. The hash key identifies the intermediate computing node of the distributed router that stores the forwarding table that includes a network routing entry corresponding to the destination address. The ingress computing node forwards the received network packet to the intermediate computing node for routing. The intermediate computing node receives the forwarded network packet, determines a destination address of the network packet, and determines the egress computing node for transmission of the network packet from the distributed router. | 10-29-2015 |
| 20150319073 | GROUND SYSTEM FOR VEHICLE DATA DISTRIBUTION - Techniques for delivering data or information to a vehicle include a method of distributing information to a vehicle. Information corresponding to the vehicle is first received while the vehicle is en route between an origination point and a destination from a computing device that is not being transported by the vehicle. A first computing device or a second computing device determines a destination port at which the vehicle is to arrive, the destination port included in a plurality of ports at which vehicles arrive and from which vehicles depart. The first computing devices causes data to be routed to a third computing device communicatively connected to the first computing device, the third computing device corresponding to the destination port, and at least one of the data or the third party computing device determined based on the information received at the first computing device. | 11-05-2015 |
| 20150319079 | Service Node Using Services Applied by an Application Node - Packets are encapsulated and sent from a service node to an application node for applying one or more Layer-4 to Layer-7 services to the packets, with service-applied packets being returned to the service node. An identification of a virtual private network (VPN) may be carried within a request packet, encapsulating a particular packet, sent by a service node to an application node for applying a service to the particular packet; with the corresponding response packet sent to the service node including an identification of the VPN for use by the service node in forwarding the services-applied packet. Additionally, parameters may be included in a request packet to identify a particular service of a general service to be applied to a particular packet encapsulated in the request packet. | 11-05-2015 |
| 20150326467 | BRIDGING CLOUDS - Technology is disclosed for bridging clouds of computing devices for compute and data storage. The technology can receive a virtual routing table (VRT), wherein the VRT indicates an association with a virtual local area network (VLAN) and defines neighbors for each route wherein at least one neighbor is defined for each of the two different cloud service providers, wherein the route definition creates a private transitive network between the neighbors; receive from a first node a first message destined for a second node; determine that the first message employs the route specified by the VRT; forward the first message to the second node; receive from a third node a second message destined for the second node; determine that the second message does not employ the route specified by the VRT; and fail to forward the second message to the second node. | 11-12-2015 |
| 20150326468 | System and Apparatus of a Software-Service-Defined-Network (SSDN) - A network apparatus for coupling control plane controllers and data plane switches in a global software service defined network (SSDN), wherein the global SSDN comprises a plurality of local SSDNs, comprising a network software service layer (NSSL) service bus comprising a processor, wherein the NSSL service bus is coupled to a plurality of network controllers and to a plurality of network switches, wherein the NSSL service bus is configured to coordinate the actions of the plurality of network controllers, wherein the NSSL service bus is configured to expose the plurality of controllers as services addressable by service names, wherein the NSSL service bus is configured to extend a local SSDN into a global SSDN network; and wherein the NSSL service bus is configured to provide the network controllers with global network information, such that the network controllers provide end-to-end service routing in the global SSDN network. | 11-12-2015 |
| 20150334003 | NETWORK APPARATUS AND METHOD FOR COMMUNICATION BETWEEN DIFFERENT COMPONENTS - The present invention discloses a method for communication among different components, including integrating a Network Forwarding Component (NFC) for forwarding messages and at least one Independent Application Component (IAC) for performing other service processing into one network device; setting at least one cooperation mode in the NFC and each of the at least one IAC; and communicating with each other, by the NFC and the at least one IAC, according to the at least one cooperation mode. The cooperation mode may be any or any combination of a host mode, a mirror mode, a redirection mode and a pass-through mode. According to the present invention, the NFC and the IAC may communicate according to the cooperation mode so as to ensure that the NFC and the IAC can cooperate to provide various service capabilities including message forwarding and other additional service capabilities. | 11-19-2015 |
| 20150350058 | CALCULATING A ROUTE - According to an example, in a method for calculating a route, a first network device may add a protocol attribute supported by a link to a link state protocol data unit (LSP) of the first network device according to a protocol attribute supported by a port of the first network device and a protocol attribute supported by a port of a neighbor network device when establishing an adjacency, and may flood the LSP. The first network device may receive a LSP from a neighbor network device, parse a protocol attribute supported by a link contained in the received LSP, record the protocol attribute supported by the link contained in the received LSP in local network topology information, to obtain updated network topology information. And the first network device may calculate a route according to the updated network topology information. A network device and a computing device may calculate a route. | 12-03-2015 |
| 20150372915 | INCREMENTAL UPDATE OF A SHAPE GRAPH - A router has a shape graph that is a compressed form of a trie that represents routing information for routing data packets in a network, and an update data structure that includes plural entries corresponding to nodes of the shape graph, the plural entries containing count values indicating respective numbers of nodes of the tie represented by the corresponding nodes of the shape graph. The router incrementally updates the shape graph as a portion of the routing information changes, where the incremental updating uses information in the update data structure. | 12-24-2015 |
| 20160006644 | METHOD AND DEVICE FOR LONG-TERM STORAGE OF CROSS-DOMAIN PATH INFORMATION - A method and device for long-term storage of cross-domain path information are provided. The method is applied on a stateless PCE. In the method, a first PCE computes a path; a path head node sends, to the first PCE, query information for querying intra-domain path information of the first domain corresponding to a first PATH-KEY, generates, on the basis of a query result returned by the first PCE, a third PATH-KEY having a unique identifier and corresponding to the intra-domain path information of the first domain and stores the third PATH-KEY; the path head node sends, to a head node in a second domain, an inter-domain path establishment signalling comprising the third PATH-KEY and a second PATH-KEY, to make the head node in the second domain send, to a second PCE, query information for querying intra-domain path information of the second domain corresponding to the second PATH-KEY, generate, on the basis of a query result returned by the second PCE, a fourth PATH-KEY having a unique identifier and corresponding to the intra-domain path information of the second domain, and store the fourth PATH-KEY; and, the path head node modifies information of the path from the path head node to the path tail node on the basis of a reverse signalling returned by the path tail node and comprising the third PATH-KEY and the fourth PATH-KEY. | 01-07-2016 |
| 20160036691 | ADAPTOR IMPLEMENTATION FOR INTERNET PROTOCOL ADDRESS AND PORT HOPPING - A system and method of deploying a network hopping adaptor is disclosed. In some embodiments, a network hopping adaptor may be configured to manipulate network traffic so as to change at least one network characteristic of the network traffic, and at least one network interface of a machine selected from a group of machines may be configured to send the network traffic to the network hopping adaptor. The network hopping adaptor may manipulate such characteristics as an IP address, a port number, an encryption algorithm or a compression algorithm. The group of machines may be deployed as virtual machines being executed by a virtualization server, and the network hopping adaptor may be implemented on another virtual machine being executed by the virtualization server. Alternatively, or in addition, the group of machines or the network hopping adaptor may be implemented as physical machines. | 02-04-2016 |
| 20160036692 | Propagating Routing Awareness for Autonomous Networks - Techniques for propagating routing awareness for autonomous networks are described. In at least some embodiments, routing awareness refers to attributes of autonomous networks that route communication sessions between different endpoints. According to various embodiments, routing awareness indicates whether a particular autonomous network supports a protocol for propagating routing awareness among different autonomous networks. Routing awareness may also include performance attributes of autonomous networks. Such routing awareness enables entities involved in routing communication sessions to make informed decisions regarding routing and handling of communication sessions. | 02-04-2016 |
| 20160050140 | FORWARDING PACKET FRAGMENTS USING L4-L7 HEADERS WITHOUT REASSEMBLY IN A SOFTWARE-DEFINED NETWORKING (SDN) SYSTEM - A network element of a software-defined networking (SDN) system forwards IP packet fragments without reassembly is disclosed. The network element receives an IP packet fragment and determines whether the fragment is the first fragment of an original IP packet. If the fragment is the first fragment, then fields in the first fragment that are associated with open systems interconnection layers (OSI) 4-7 are retrieved and placed in an entry in a fragment information table so that the entry is associated with the original IP packet. If the received fragment is not the first fragment, then a matching entry in the fragment information table is to be identified and the associated OSI layers 4-7 information is retrieved for processing the non-first fragment. | 02-18-2016 |
| 20160087876 | METHOD, EQUIPMENT AND SYSTEM FOR FORWARDING PACKETS IN INFORMATION CENTRIC NETWORK (ICN) - Disclosed are a method, equipment and system for forwarding packets in an Information Centric Network (ICN). The method includes: content request packets sent by a first route node in a Virtual Private Network (VPN) are received by a first route node in a public network; the content request packets carry the content name of the request content and the private identification for identifying the request content as the private content; the container identification of the first container for storing the request content is obtained; the content request packets are forwarded according to the container identification of the first container so as to forward the content request packets to a second route node in the VPN, and the content response packets carrying the request content are returned according to the content name of the request content. | 03-24-2016 |
| 20160142311 | Routing to Multiple Diameter Peers with the Same Identity Via Stack Manipulation - Various exemplary embodiments relate to a method performed by a Diameter Routing Agent (DRA) or processing a Diameter message, the method including: determining that more than one peer of the DRA have the same Diameter identifiers (IDs); receiving a Diameter message at the DRA associated with one of the peers with the same Diameter ID; determining a correct peer of the peers with the same Diameter ID associated with the received Diameter message and it assigned IP address; instructing a Diameter stack to transmit the Diameter message to the peer based upon the IP address. | 05-19-2016 |
| 20160254984 | METHOD AND SYSTEM FOR DELIVERING SERVICE-ENABLED FLOW PATHS ACROSS MULTIPLE DOMAINS IN SDN NETWORKS | 09-01-2016 |
