Abstract: Systems and methods for social graph data analytics and node traversal are described herein. A social graph may comprise two or more nodes that each represents an individual, group, or entity, and links may connect the two or more nodes. A distributed graph storage/computation system may be configured to store node and link elements of one or more network communities in a distributed fashion. For example, the distributed graph storage/computation system may include a cluster registry, one or more node storage clusters, and one or more edge storage clusters. The cluster registry, node storage clusters, and edge storage clusters may each provide functions for providing node and link information and for traversing the social graph.

Abstract: Computer systems and methods in various embodiments are configured to test the security of a server computer by simulating a wide range of attacks from one or more bot-nets. In an embodiment, a computer system includes a memory; a processor coupled to the memory; a plurality of network cards coupled to the processor and the memory, the computer system being located in a home geographic region; wherein each of the plurality of network cards is configured to send one or more requests to a remote server computer through one of a plurality of geographic regions, that is different than the home geographic region; wherein, for each of the plurality of network cards, the processor is configured to store in the memory one of a plurality of geo-mappings, wherein the geo-mapping indicates the certain geographic region the network card is configured to send the one or more requests to the remote server computer through.

Abstract: In one embodiment, a method includes receiving a trace request packet at a service node in a service chain, the trace request packet comprising a service path identifier, a service index, and a service index limit, processing the trace request packet at the service node, generating a trace report packet at the service node, the trace report packet comprising service function information for the service node, and transmitting the trace report packet. An apparatus and logic are also disclosed herein.

Abstract: Communication is performed by selecting any one of or two or more paths from among multiple paths existing between a communication apparatus and the other party in communication. In addition to measuring an effective rate itself, the effective rate is estimated from a combination of Phy rate, received power, Phy rate, and statistics information. Then, on the basis of information about the effective rate of each path, a path used for data transmission is selected according to a single selection method for selecting a single path or a multi-selection method for selecting multiple paths at a time. The single selection method can be classified into a method for each session or a physically exclusive method. The multi-selection method includes weighting method and redundancy degree attaching method.

Abstract: A method for determining an intermediate routing node, including: determining at least one intermediate routing node that is used to transfer to-be-transmitted data between the two routing nodes when there is a fault in a communication path between two routing nodes, adding a channel dependency relationship between a to-be-verified intermediate routing node and the two routing nodes to a channel dependency graph of a routing network in which this fault has not occurred in order to enable the channel dependency graph to become an updated channel dependency graph, and determining the to-be-verified intermediate routing node as a final intermediate routing node that is used to transfer the to-be-transmitted data when the updated channel dependency graph does not have a dependency relationship loop. The determined intermediate routing node can be used to transfer to-be-transmitted data, which improves resource utilization of a routing network.

Abstract: System and method of ad hoc on-demand routing by virtue of central control. A central controller of a network can communicate directly with a route-requesting network device regarding discovery of a data transmission path and perform route computation. A source network device may query the central controller with a unicast route request. In response, the central controller can identify a feasible route based on the topology information of the network. The central controller may also receive a broadcast route request along with other network nodes. As a result, the source device can be offered to select from two resultant routes, one provided by the central controller in a centralized manner and the other provided by the destination device. Further, the central controller can be used specifically for computation of constrained routes by incorporating global constraints. The central controller may be a software defined network (SDN) controller.

Abstract: In the electromagnetic operating device, the driving power supply is composed of two types of power supplies: a capacitor power supply serving as a power supply which is for performing opening/closing operation in a normal time with respect to the vacuum valve; and a DC power supply which is for performing opening/closing operation in an emergency. The capacitor power supply which is for performing opening/closing operation in the normal time includes: capacitors that store electric power to be supplied to the electromagnetic coil; and a control board which controls a current to be supplied from the capacitors to the electromagnetic coil in response to an open-contact or close-contact command to the vacuum valve. Then, the DC power supply which is for performing opening/closing operation in the emergency is to directly supply DC electric power to the electromagnetic coil.

Abstract: A routing control apparatus that constructs a transmission path for transmitting communication data in a wireless mesh network includes: a previous hop state managing unit that receives a first control signal for constructing a portion of the transmission path, and manages first information indicating operability, which is availability of a previous hop apparatus in a future, the portion being from a source apparatus to the routing control apparatus; an operation state managing unit that manages second information indicating operability of the routing control apparatus; and a routing control processing unit that compares the first information and the second information, and, if the operability of the routing control apparatus is higher than or equal to the operability of the previous hop apparatus, transmits a second control signal for constructing a remaining portion of the transmission path other than the portion.

Abstract: One of the embodiments of the present invention relates to a method for operating a routing device in a network. The method comprises: receiving, during routing table calculation for a first topology change associated with a first routing device, a message indicative of a second topology change associated with a second routing device; determining a time duration of a hold time period based on a running time required for performing shortest path first calculations for a shortest path between the routing device and the second routing device, wherein the running time is retrieved from a running time database and the running time database is configured to store plural values each of which is indicative of a running time required for performing shortest path first calculations for a shortest path between the routing device and each of other routing devices in the network, wherein during the hold time period, the routing device does not perform any further routing table calculation.

Abstract: The present disclosure describes methods and apparatus for beaconing within a wireless network based on an indication of distance. For certain example embodiments, in a wireless network in which a master device is a device configured to transmit a beacon within the wireless network, a first wireless communication device may determine, based on an indication of distance between two wireless communication devices, if the first wireless communication device is to act as a master device. For example, a wireless signal may be received. Based at least partially on the received wireless signal, an indication of distance between two wireless communication devices in a wireless network may be obtained. And based at least partially on the obtained indication of distance between the two wireless communication devices, it may be determined if a first wireless communication device is to act as a master device within the wireless network.

Abstract: An RB includes a grouping unit that groups VLANs in a TRILL network into patterns by using the low 3 bit sequence of a VLANID; a calculating unit that calculates the number of redundant paths with equal costs among physical paths in the TRILL network; and a sorting unit that sorts the patterns of VLANs, which are to be assigned to the physical paths, into the groups that are equivalent to the number of redundant paths according to a predetermined order. The RB includes an assignment table for managing, with respect to each of the groups, an assignable output destination path among the physical paths. The RB includes a control unit that refers to the assignment table, determines the output destination path for each of the groups, and collectively assigns all the VLANs of all the patterns of an appropriate group to the output destination path of the group.

Abstract: The present invention provides a method for seamless multi-link network connectivity, wherein such method utilizes a plurality of connections at the same time by providing an application-sensitive seamless connectivity between two end systems via several links so that the data are seamlessly transmitted among these links. In the method of the present invention when one link fails, the traffic is automatically transmitted via the available links of said plurality of connections and when it comes back up, it is automatically used again. In the method of the present invention when more than one link is active and the Quality of Service needs of an application can't be met by using a single link, more than one link is used through load-balancing mechanism. Said method provides the best possible service for each type of application based on its own Quality of Service requirements.

Abstract: Systems and methods for managing a network are described. A view of current state of the network is maintained where the current state of the network characterizes network topology and network constituents, including network entities and network elements residing in or on the network. Events are announced that correspond to changes in the state of the network and one or more network elements can be configured accordingly. Methods for managing network traffic are described that ensure forwarding and other actions taken by network elements implement globally declared network policy and refer to high-level names, independently of network topology and the location of network constituents. Methods for discovering network constituents are described, whereby are automatically configured. Routing may be performed using ACL and packets can be intercepted to permit host to continue in sleep mode. The methods are applicable to virtual environments.

Abstract: A system and method are disclosed for forwarding data in hybrid wireless mesh networks. The method includes configuring a number of mesh network nodes as potential relay nodes (PRNs) in an overlay network associated with a hybrid wireless mesh network, streaming data packets from a source node to a destination node using a native data forwarding algorithm of the hybrid wireless mesh network, dynamically identifying relay nodes (RNs) among PRNs in the overlay network, creating secondary paths for sending data packets towards selected RNs in the overlay network, and relaying data packets from RNs to the destination node using the overlay network.

Abstract: A method includes receiving at a branch device an assigned first hub device and an assigned second hub device associated with a data center, establishing a VPN data tunnel to the assigned first and second hub devices, designating the first hub device as a primary device, designating the second hub device as a secondary device and switching traffic destined for the primary device to the secondary device based, at least in part, on a cost of a link.

Abstract: A system and method for efficiently accessing replicas of a storage object. A first node may perform a find operation to determine a plurality of nodes that each store a replica of a first storage object. For each node in the plurality of nodes, the first node may establish a direct connection to the node. The first node may then access the replicas of the first storage object using the respective direct connections to the plurality of nodes. In one embodiment, the nodes may be nodes in a peer-to-peer network. Establishing a direct connection to each storage object replica may enable the first node to communicate with each node in a single hop without having to pass messages via intermediate nodes in the peer-to-peer network.

Abstract: Embodiments of the present invention provide an information query method and device, which can reduce a waste of resources in an information query process, and decrease power consumption. The method includes: sending, by a requesting device in a broadcast manner, a first query request message, where the first query request message carries a first query condition and information about a group identity; and when the requesting device receives a first query response message sent by a responding device that meets the first query condition, sending, by the requesting device, a second query request message that uses the group identity as a receiving address, so that the responding device processes the second query request message.

Abstract: Systems, methods, and other embodiments associated with swarm management are described. One example system comprises a communication component configured to establish a communication link with at least one element, where the at least one element is part of a swarm. The example system also comprises a management component configured to manage performance of a task list by the swarm through the communication link.

Abstract: A delay tolerant network is built with the use of a plurality of information transfer devices each of which includes: a communication unit to communicate to and from another device within a communication range that is connected to the information transfer device; and a storing unit to store and keeps collected notification information, and each of which holds delay tolerant communication by exchanging the collected and kept notification information with another device when the exchange becomes possible. Each information transfer device includes a control unit to exchange environment information with another information transfer device, and to execute deriving processing an assigned range that is assigned autonomously to its own information transfer device, based on the environment information that is kept by its own information transfer device, through a planarization search processing in which a value is evened out between its own information transfer device and other information transfer devices.

Abstract: A network includes a route reflector peered with client routers. From a perspective of the route reflector, a best path to the destination address is selected by applying to candidate paths ordered comparison tests that progress from policy tests through one or more additional tests until the best path is selected. A determination is made as to whether the best path was selected based on the policy tests exclusively. If the best path was selected based on the policy tests exclusively, the best path is assigned to each of the client routers. If the best path was not selected based on the policy tests exclusively, from a perspective of each client router, a respective best path is selected by applying to the candidate paths the one or more additional tests, and the respective best paths are assigned to the respective client routers.

Abstract: Monitoring a network is provided. A set of predicted network topology snapshot graphs of nodes in the network are generated based on a set of network topology prediction models for the network. A subset of the nodes is selected as monitors in the set of predicted network topology snapshot graphs of the network so that each link in a set of selected network links is identifiable using end-to-end measurements between the monitors. Network states of interest are determined in the set of selected network links within a selected time window based on the end-to-end measurements between the monitors.

Abstract: A method and apparatus for path detection are disclosed. In the method and apparatus, a data path may link two path-end nodes in a network. Event data for the network may be received and may be used to determine, for each node resident on the path, proximity measures to each path-end node. The proximity measure of network nodes may be evaluated to determine whether a path exists between the two path-end nodes.

Abstract: The disclosed embodiments include a computer implemented method for managing network communications. In one embodiment, the method includes gathering, using performance information packet (PIP) data packets, network performance information from a communications network that includes network performance information from a set of egress points between the communications network and an outside network. The method selects a network connection including an egress point and an egress packet path within the communications network to the egress point offering the best quality of service between the communications network and an outside network based on the network performance information. The method then establishes the network connection between the communications network and the outside network for routing communications.

Abstract: A method is implemented by a network device executing a local computation engine and a link state routing protocol. The local computation engine and the link state protocol support automatic establishment of redundant paths and cautious restoration in a packet network. The method includes receiving an explicit path (EP) type length value (TLV) via a link state routing protocol, executing a shortest path algorithm to obtain a shortest path for loose hops of a path identified by the EP TLV, the shortest path to be a primary path, updating a network graph to prune links of the primary path or bias links of the primary path, and calculating a backup path using the shortest path algorithm on the updated network graph.

Abstract: A method for solving an under-determined inverse problem or network inference/tomography problem in per-flow size, delay, loss and throughput inference in a computer network, through a system is presented. The method includes the following steps, which are not necessarily in order. First, establishing the computer network having a plurality of nodes wherein the per-flow size, the delay, the loss and the throughput inference are unknown. An original observation or routing matrix determines how flows are appeared on the links and construct the measurements. Next, performing a learning phase to obtain an optimal observation matrix or pseudo-optimal observation matrix. After that, performing a computer controller adaptive measurement and inference phase to estimate the set of unknowns using the measurement quantities, and a function of one of the set consisting of: the optimal observation matrix, the original observation matrix, or both.

Abstract: A method is provided in one example and includes receiving a current bandwidth characteristic for a link, where the current bandwidth characteristic is determined under fading conditions associated with signal propagation on the link. The method can also include calculating a new cost for the link that is different from a nominal cost associated with a nominal bandwidth of the link without the fading conditions. The method could also include routing at least a portion of a plurality of flows that are to traverse the link away from the link based, at least in part, on the new cost. Another example method includes receiving the current bandwidth characteristic for the link, comparing the current bandwidth characteristic with a preconfigured low watermark corresponding to a class-specific MTR topology associated with a class of traffic traversing the link, and removing the link from the MTR topology based on the current bandwidth characteristic.

Abstract: A method for determining a path in an optical network, implemented by one or more controllers associated with a control layer, includes receiving a path request specifying start and end points, an associated bandwidth, and a longevity parameter providing an anticipated length during which the path is required; determining a route in the optical network through a routing algorithm executed by the controller, wherein the routing algorithm utilizes the start and end points, the associated bandwidth, and the longevity parameter to determine the path; and provisioning the path through a plurality of switches along the route.

Abstract: A network element (NE) in a network, comprising a memory configured to store time-based traffic engineering (TE) information associated with network resource reservations on a link attached to the NE in a series of time intervals each having a predetermined start time and a predetermined end time, and a processor coupled to the memory and configured to reserve, at a first current time, a network resource for a temporal tunnel service (TTS) on the link to carry traffic during a scheduled time interval subsequent to the first current time, wherein the scheduled time interval comprises a scheduled start time and a scheduled end time, and update, at the first current time, the time-based TE information in the scheduled time interval according to the network resource reserved to produce a first updated TE information in the scheduled time interval.

Abstract: Aspects of the present invention include selecting a route based on energy cost. Energy cost is evaluated based on a power metric. The power metric is determined based on an energy cost related attribute and a corresponding weight. In embodiments of the present invention, money can be saved based on electricity savings. In embodiments of the present invention “green” power can be used more often than fossil fuel power.

Abstract: Systems and methods for decoupled searching and optimization for one or more data centers, including determining a network topology for one or more networks of interconnected computer systems embedded in the one or more data center, searching for routing candidates based on a network topology determined, and updating and applying one or more objective functions to the routing candidates to determine an optimal routing candidate to satisfy embedding goals based on tenant requests, and to embed the optimal routing candidate in the one or more data centers.

Abstract: Methods and devices for processing packets are provided. The processing device may include an input interface for receiving data units containing header information of respective packets; a first module configurable to perform packet filtering based on the received data units; a second module configurable to perform traffic analysis based on the received data units; a third module configurable to perform load balancing based on the received data units; and a fourth module configurable to perform route lookups based on the received data units.

Abstract: A method for reducing response times in an information-centric network includes receiving an indication from an ingress node of a content object entering a network, the content object associated with a new delivery flow through the network. An egress node in the network for the content object and a size of the content object are identified. A backlog and bandwidth for the new delivery flow is determined based in part on the size of the content object. Backlogs and bandwidths for existing delivery flows in the network are determined. A set of candidate paths in the network for the new delivery flow from the ingress node to the egress node is determined. For each candidate path, a total response time is estimated for completion of all delivery flows for each candidate path based on the backlog and bandwidth. The candidate path having the lowest total response time is selected for the new delivery flow.

Abstract: Each compute node of a cluster compute server generates and maintains route information for routing messages to other nodes of the server. Each compute node identifies the other nodes connected to a fabric interconnect and generates, based on a set of routing constraints, routes to each of the other nodes. Each compute node communicates messages to other nodes of the server via the generated routes. Because the routes are generated at each compute node the processing load to generate the routes is distributed among the compute nodes.

Abstract: A capability is provided for predicting the performance of a communications network, such as a multi-stage communications network. The predicted performance includes, in one aspect, predicting the amount of bandwidth that a server of the communications network could deliver with a full load on the network. In one aspect, the predictive capability includes determining an aggregate load for each server of the network being analyzed; performing normalization on the loads of the links used by the servers to obtain updated link and/or server bandwidths; and determining for each server, a minimum bandwidth over the links in the server's route.

Abstract: A Spontaneous Area Network (SPAN) is formed by mobile and fixed nodes using wireless transmission links between nodes, usually in a nearby geographical area. Applications allow users to create, join, leave, and manage SPANs and groups in a SPAN. Automatic procedures allow nodes to join other SPANs. Transmission power of the wireless network interface is dynamic, varying depending on battery level, type of information to transmit, state and topology of the network. A delay tolerant object layer abstraction creates, modifies, deletes, publishes, and handles Delay Tolerant Distributed Objects (DTDOs). A Patient Transport Protocol (PTP) ensures a reliable transport of information through the network while avoiding congestion conditions. An aggressive and explosive network protocol (AGENET) has routing and forwarding capacities and uses datagrams to establish communication between different nodes of the SPAN.

Abstract: A method for determining a route for communication across a network in real-time, said method including: collecting a set of network delay information at a caller device; storing the set of network delay information at the caller device; based on a stored set of network delay information at the caller device and the callee device, determining, by the caller device, in cooperation with the callee device, a set of relay server candidates to be used to relay data packets between the caller device and the callee device; and based on calculated round trip times for probing data packets set out and sent back, selecting, by the caller device in cooperation with the callee device, a shortest routing path as an active routing path for use for transporting a first data packet between the caller device and the callee device.

Abstract: A Policy and Charging Enforcement Function (PCEF) device of a network having a Policy and Charging Rules Function (PCRF) device. The PCEF device includes a processing unit that detects a tunneled packet and the packet's Internet Protocol version type and determines whether activation of PCC rules in accordance with the IP version type of the tunneled packet is required from the PCRF device. The PCEF device includes a network interface unit in communication with the processing unit and the network that requests from the PCRF device required activation of PCC rules and identifies the IP version type of the tunneled packet to the PCRF device with the request and receives from the PCRF device the PCC rules activation. The processing unit enforces the PCC rules on the tunneled packet. Methods of handling and enforcing rules at a PCEF device of a network and at a PCRF device are also disclosed.

Abstract: A method for configuring a network device. The method includes writing a route for a destination IP prefix to the forwarding information base (FIB), and after writing the route, obtaining a set of routes and writing the set of routes to a routing information base (RIB). The method further includes, after writing the set of routes to the RIB and after the expiration of a timer: identifying, in the RIB, a set of ECMP routes from the plurality of routes for the destination IP prefix, processing the set of ECMP routes for the destination IP prefix, and updating the FIB of the network device based on set of processed ECMP routes.

Abstract: Various embodiments of systems and methods to efficiently use a compute element to process a plurality of values distributed over a plurality of servers using a plurality of keys. In various embodiments, a system is configured to identify (or “derive”) the various server locations of various data values, to send requests to the various servers for the needed data values, to receive the data values from the various servers, and to process the various data values received. In various embodiments, requests are sent and data values are received via a switching network. In various embodiments, the servers are organized in a key value store, which may optionally be a shared memory pool. Various embodiments are systems and methods with a small number of compute elements and servers, but in alternative embodiments the elements may be expanded to hundreds or thousands of compute elements and servers.

Abstract: An approach is provided for pooling bandwidth provided by mobile devices in an ad hoc group. Based on information in data plans provided by wireless carriers to the mobile devices, amounts of data that will be unused at the end of respective billing cycles are estimated. Based on the estimated amounts, contributions of data from the mobile devices are determined. Based on capabilities of the mobile devices, time periods during which the respective mobile devices are subscripted for providing at least some of the respective contributions of data are determined. Hand-offs among the mobile devices are coordinated to provide a cooperative usage of the bandwidth among the mobile devices which minimizes redundant streaming or downloading of content to more than one of the mobile devices. The streamed or downloaded content is presented to the ad hoc group of mobile devices.

Abstract: Example embodiments relate to a method of, and device for facilitating, resilient peer-to-peer application message routing. The method comprises storing a network routing table comprising destination addresses of applications hosted on peer nodes of a network, and providing the peer nodes with a copy of the routing table via which routing table an application message from any one of the peer nodes is routed to a destination address designating a destination application hosted by a destination peer node.

Abstract: An intermediate network device performs service aware path selection. For example, the intermediate network device comprises a network interface that receives network traffic and a control unit that couples to the network interface. The control unit comprises a storage medium that stores a first set of cost factors for a first path from the intermediate network device to another intermediate network device. The first set of cost factors includes at least one optimization cost factor corresponding to intermediate optimization capabilities available to the intermediate network device that offset other cost factors of the first set. The storage medium also stores a second set of cost factors for a second path between the devices. The control unit selects either the first path or the second path over which to forward the network traffic based on the first and second sets of cost factors.

Abstract: WS-Addressing EndpointReferences represent Web service endpoints and are propagated in the SOAP Envelope as part of Web service interactions. There is disclosed a method, apparatus and computer program for resolving (or modifying) aspects of the EndpointReference at the time of its propagation based on the EndpointReference recipient. Different recipients will potentially receive differing EndpointReferences. Aspects of the EndpointReference are re-resolved as the SOAP XML representing the EndpointReference is generated for the EndpointReference's propagation. For example, the location of the recipient might make a difference to the address propagated—if the recipient is outside a firewall, it may be appropriate to provide the recipient with the address of the firewall itself and to allow the firewall to re-route any request from the data to the web service endpoint.

Abstract: The present disclosure relates to a method and an apparatus for failure detection in a storage system. One embodiment provides a method for failure detection in a storage system. The method includes determining an amount of data received by a plurality of switches in the storage system within a predetermined time window so as to obtain a plurality of data amounts; determining a count of check errors detected by the plurality of switches in the data to obtain a plurality of check error counts; and calculating a failure risk for the plurality of switches based on the plurality of data amounts and the plurality of check error counts. Another embodiment of the present invention provides a corresponding apparatus.

Abstract: Exemplary methods include a first network device participating in an election process to determine a designated bit forwarding router (D-BFR). The methods include in response to determining the first network device is elected to be the D-BFR, performing D-BFR operations comprising determining an elected bitmask (BM) length of a BM based on maximum local BM lengths advertised by other BFRs in the network, wherein each bit of the BM will correspond to a bit forwarding egress router (BFER), and advertising the determined elected BM length to other BFRs. The methods may further include one or more of determining an elected tree type based on supported tree types advertised by other BFRs in the network, assigning one or more BM positions (BMPs) to one or more BFERs, and advertising the elected determined tree type and/or the assigned one or more BMPs.

Abstract: Example implementations described herein are directed to a configurable building block, such as a router, for implementation of a Network on Chip (NoC). The router is parameterized by a software layer, which can include the number of virtual channels for a port, the number of ports, the membership information of the virtual channels, clock domain, and so forth. The router may further be configured to implement arbitration techniques and flit processing techniques based on the parameters specified by the software layer.

Abstract: The invention is directed to systems, methods and computer program products for optimizing a configuration associated with a network. An exemplary method comprises: determining a node of the network is running a data session associated with an amount of data greater than a predetermined amount of data, and associated with a duration greater than a predetermined duration; configuring the network such that the node acts as an access point; and establishing a direct connection between the access point and a backbone of the network.

Abstract: A mobile communication system performs downlink multi-antenna transmission by applying a precoder matrix that defines transmission directionality of downlink and a rank that defines number of signal sequences of the downlink. The mobile communication system comprises a user terminal that feeds back feedback information of a target frequency band, to a base station. The feedback information includes combinations of precoder matrix information indicating the precoder matrix and rank information indicating the rank.

Abstract: A method for updating location information includes detecting a change in mobility of a second device, and determining whether an update condition has been met. When the update condition has been met, the method also includes updating a first location management function in accordance with location information of the second device, and forwarding the location information of the second device to a second location management function.

Abstract: An access point may schedule concurrent peer-to-peer transmissions for different stations in a basic service set (BSS) of an Institute of Electrical and Electronics Engineers (IEEE) 802.11 architecture.