Abstract: A passage channel is calculated by taking into account a plurality of requirements having different importance degrees. A channel calculation unit (202) of a transport control server (100) calculates a plurality of passage channel candidates with respect to a passage setting request wherein an active passage candidate and a standby passage candidate are paired in the passage channel candidate; and calculates the occurrence number of phenomena that violate a predetermined requirement relating an operation of the active passage and the standby passage, or a value of a network element for determining whether the requirement is violated, with respect to each passage channel candidate. A cost calculation unit (205) calculates the cost of a passage channel from the calculated number of occurrence, network element value, and a predetermined cost calculation coefficient corresponding to the requirement.

Abstract: A system may include an overlay network linking a plurality of publishers, a plurality of subscribers, and a plurality of brokers. The overlay network may include a first computer network having a first network protocol carried by a second computer network having a second network protocol. The system may also include an agent carried by each of the publishers, the subscribers, and the brokers that adjust the network's topology based upon collected runtime data of condition of each link within the network and/or broker availability to any publisher and subscriber.

Abstract: This disclosure relates to a method, article of manufacture, and apparatus for finding a shortest path in a cloud. In some embodiments, this includes obtaining one or more nodes associated with a tenant, obtaining hop counts for each of the one or more nodes, determining a threshold hop count based on the hop counts, identifying one or more local nodes based on the threshold hop count, and associating the one or more local nodes with the tenant.

Abstract: An event clustering system includes an extraction engine in communication with an infrastructure. The extraction engine receives data from the infrastructure and produces events. An alert engine receives the events and creates alerts mapped into a matrix, M. A sigalizer engine includes one or more of an NMF engine, a k-means clustering engine and a topology proximity engine. The sigalizer engine determines one or more common steps from events and produces clusters relating to the alerts and or events.

Abstract: A method for generating a key hierarchy by a MS in a wireless network is provided. The method includes transmitting an authentication request message to a new BS, receiving an authentication response message as a response message to the authentication request message from the new BS, determining whether to perform a full authentication operation with a H3A server based on the authentication response message, performing the full authentication operation or a crypto-handshake operation with the H3A server based on the determining result, after performing the full authentication operation or the crypto-handshake operation, determining whether a first expected signature value received from the new BS is identical to a first expected signature value calculated by the MS, and if the first expected signature value received from the new BS is equal to a first expected signature value calculated by the MS, determining that an authentication for the new BS has succeeded.

Abstract: A method entails an efficient procedure, namely Compute followed by Network Load Balancing (CNLB), that first maps virtual nodes over physical nodes while balancing computational resources of different types, and finally, maps virtual links over physical routes while balancing network spectral resources.

Abstract: A method in a first device for anonymously delivering data to a part that has initiated a task is provided. The first device and the part initiating a task are participants in opportunistic sensing. The method comprises creating a data sample and encrypting the data sample with a public key of the task initiating part. After communicating the protected sample to one or more intermediate devices, one of the one or more intermediate devices delivers the protected sample to the task initiating part, such that the task initiating part does not know the identity of the first device. The task initiating device only know the identity of the one of the one or more intermediate devices that delivered the protected sample to the task initiating part, wherein the intermediate devices are participants in the opportunistic sensing.

Abstract: Systems, apparatuses, and methods are provided for developing an improved route from a navigation mesh. A route is provided, wherein the route includes a plurality of connected nodes having a starting node, an ending node, and internal nodes. Each internal node of the plurality of connected nodes is scored by an algorithm, wherein the score provided for each internal node based on an importance of the respective internal node to the overall shape of the route. The internal node with a score having a least importance on the shape of the route is removed, so long a valid path between the starting node and the ending node is maintained. The process may be repeated until a threshold simplification of the route has been achieved or until no further internal nodes can be removed without creating an invalid path.

Abstract: Mesh node modules are associated with competitors in an arena to relay through a mesh network formed by the modules competitor biometric and/or parameter information. This information may be selected to be viewed by individual fans accessing their consumer electronics devices during the competition.

Abstract: In one embodiment, a region anchor node may receive a unicasted route request (RREQ) for a target node. The region anchor node may then flood the RREQ to a region within which it resides. Subsequently, the region anchor node may receive one or more reactive routing route replies (RREPs) returned by the target node within the region. Based on the RREPs, the region anchor node may build one or more region routes from the region anchor node to the target node, and returns the one or more region routes to the originator node to cause the originator node to concatenate the one or more region routes and the unicast route of the original RREQ to form a path from the originator node to the target node.

Abstract: A method and apparatus facilitates an enterprise to lease virtual appliances from network services provider. The method operates by deploying a converged networking and computing device at a service location, downloading a virtual machine to the converged networking and computing device, activating the virtual machine by a service in the wide area network, and connecting the virtual machine to a provisioned network path over the wide area network. Different virtual machines can be deployed to different locations. The same virtual machine can be deployed to different locations. Moreover, more than one virtual machine may be deployed to more than one service location.

Abstract: A method of supporting a group communication by a first user equipment (UE) in a wireless communication system is provided. A communication connection is established with a second UE via a first relay UE. The first UE receives, from a first relay UE, a message requesting a relay connection, the message including first information indicating a current hop count, second information indicating a maximum number of allowed hops, and third information on a capacity profile which indicates a maximum number of allowed subordinated UEs. If a condition is satisfied, the relay connection is provided between the first relay UE and a third UE via a second relay UE, the second relay UE being the first UE. If the condition is not satisfied, the relay connection request is rejected.

Abstract: In some implementations, network traffic can be routed along equal cost paths based on weights assigned to each path. For example, weighted equal cost multipath routing can be implemented by assigning weights to each equal cost path (e.g., uplink, next hop node) to a destination device. When the network device receives a packet, the network device can generate a key (e.g., a random value, a hash value based on packet data, a value between 0 and n, etc.). The key can be used to select an uplink or path upon which to forward the packet. A key can be generated for a packet flow or flowlet. Each flow can be associated with the same key so that each packet in a flow will be forwarded along the same path. Each flowlet can be forwarded along a different uplink.

Abstract: A system and method for analyzing a scenario, such as a communications scenario in which the end-to-end quality of communications between end nodes of a communications link may be affected by various factors and conditions. Such factors and conditions may include performance parameters of the end nodes and intermediate nodes, human operational performance, and external conditions, such as weather. Qualitative and quantitative representations of the end-to-end quality of communications are presented simultaneously and in a time-synchronized manner with displays of the relevant performance parameters, indications of human operational actions, and locations of nodes of the communications link and external conditions.

Abstract: Various methods are provided to address the need for improved load balancing. In a one method, a packet loss is determined (101) for traffic sent between a first network node and a second network node. The determined packet loss is then used to determine (103) whether to perform load balancing. In another method, a first network node receives a request from a neighboring network node for a current loading status of the first network node. The first network node sends to the neighboring network node an indication of a backhaul loading level of the first network node.

Abstract: Systems, methods, and devices for wireless service delivery are described herein. In some aspects, a method for wireless service deliver may include transmitting, by a first wireless node, and receiving, from each of a plurality of wireless nodes, a service discovery message for a service. The method may further include selecting one of the plurality of wireless nodes based on a link quality metric associated with each of the plurality of wireless nodes. The method may additionally include establishing a communication pathway to a provider of the service through a link to the selected wireless node.

Abstract: An approach is provided for coordinating information request messages over an ad-hoc mesh network. A module receives at least one request to transmit one or more information request messages over an ad-hoc mesh network. The module determines context information associated with at least a portion of the ad-hoc mesh network, one or more nodes within the at least a portion of the ad-hoc mesh network, or a combination thereof. The module then determines to transmit the one or more information request messages over the ad-hoc mesh network based, at least in part, on the context information.

Abstract: An approach to an optimal application configuration. The approach includes a method that includes computing, by at least one computing device, an actual application impact based on an “N” number of failing information technology (IT) infrastructure components within an application architecture. The method includes determining, by the at least one computing device, a factor in likelihood of failure of the “N” number of IT infrastructure components. The method includes determining, by the at least one computing device, a failure profile for the application architecture based on the actual application impact and the factor in likelihood of failure.

Abstract: Techniques are provided for optimizing bandwidth in a network. Information describing a network bandwidth capacity of a port extender device is received at a switch. The port extender device is connected to the switch. The port extender device is configured to provide ports for the switch. The network bandwidth capacity of the port extender device is compared to a minimum network bandwidth guarantee threshold. If the switch determines that the network bandwidth capacity of the port extender device is below the minimum network guarantee threshold, the switch sends to the port extender device a message configured to cause the port extender to deactivate one or more links between the port extender device and one or more servers in communication with the port extender device.

Abstract: In one embodiment, a node in a communication network receives a label switched path (LSP) request and in response, the node determines at least two equal cost paths, each path having one or more path-nodes. The node may then further determine a total bandwidth-based transition value for each path of the at least two equal cost paths and selects the path having a lower total transition value. Once selected, the node may establish the requested LSP over the selected path.

Abstract: The proposed methodology enables finding the most efficient roots in the network to carry multicast traffic, while further providing a theoretical basis for such selection. It guarantees the minimum expected delivery cost for multicast frames in the absence of any knowledge about the source and receivers.

Abstract: A wireless communication device providing a node in the network includes a wireless transmitter, a wireless receiver, a transmission buffer, and a packet prioritizing unit configured to obtain data relating to packets to be transmitted in the network, obtain indications of the remaining lifetime of the packets, where the indications are based on the time needed for reaching a destination node, prioritize the packets according to the remaining life time indications, where the prioritization is made in ascending order from an indication of a low remaining life time to a high remaining lifetime, and place the packets in the transmission buffer for transmission according to the prioritization.

Abstract: According to one embodiment, an apparatus includes a processor and logic integrated with and/or executable by the processor. The logic is configured to determine paths between a plurality of switches connected together in a system by performing path calculations based on a topology of the system. The logic is also configured to calculate one or more disjoint multi-paths from among the paths, the one or more disjoint multi-paths connecting a source device to a destination device. The source device is connected to a first switch of the plurality of switches, and the destination device is connected to a second switch of the plurality of switches. Moreover, the logic is configured to write the one or more disjoint multi-paths into a forwarding table of at least one device. Other systems and computer program products are presented according to more embodiments.

Abstract: A method for internet traffic management, comprising receiving a request for a path set from an application at a network traffic controller, wherein the request contains an intended traffic destination endpoint, evaluating a plurality of network devices in a network, identifying a plurality of paths usable by the application to transmit traffic from the application to the intended traffic destination endpoint, including the plurality of paths in the path set, and sharing the path set with the application.

Abstract: The present invention relates to a method for setting the optimum transmission path for increasing energy efficiency in a wireless ad hoc network. More particularly, the present invention relates to setting an optimized data transmission path in a multi-hop data transmission environment in a wireless network comprising machine to machine (M2M) communication devices, which operate with limited energy, based on link information of the network, such as the position of a node in the network. And to this end, the present invention relates to a wireless M2M communication network protocol minimizing energy consumption by selecting the optimum transmission method for each of the hops from the following transmission methods: a single input single output (SISO) method; a virtual single input multiple output (V-SIMO) method; and a virtual multiple input multiple output (V-MIMO) method.

Abstract: A disaster response system receives location data and status data from participating devices in an area affected by a disaster. The disaster response system provides data to client devices outside the affected area. The data indicate statuses of people within the affected area. Disaster response system also instructs routers to perform actions to adjust bandwidth available for a particular use during and after the disaster.

Abstract: Techniques for passive positioning of a client station are disclosed. In an example a passive positioning scheme may include detecting an incoming message from an access point, determining a Round Trip Time (RTT) value associated with the access point, generating an acknowledgment message, calculating a time of departure for the acknowledgment message based on the RTT value, and sending the acknowledgment message at the time of departure.

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 network control system that achieves high availability for forwarding state computation within a controller cluster by replicating different levels of table state between controllers of the controller cluster. To build a highly available controller cluster, the tables for storing the forwarding state are replicated across the controllers. In order to take responsibility for a slice, the slave controller of some embodiments performs merging of replicated state on a slice-by-slice basis. The merging is performed in a manner to prevent disruptions to the network state while the slave controller is updated.

Abstract: An access point is configured to pair with other access points in a network. The access point includes at least two interfaces configured to interface to other access points over a link layer therein using heterogeneous backhaul access technologies; and a memory having machine executable code, therein that, when executed by a processor, cause the at least two interfaces to pair with one or more of the other access points using configuration information stored within the memory.

Abstract: The present disclosure relates to methods and systems for testing navigation graph services. Embodiments of the present disclosure may provide a directed graph based on a navigation graph service, determine a set of paths between nodes in the directed graph, and generate a testing script for an arbitrary performance testing tool based on the determined set of paths. The set of paths may comprise edge-disjoint paths between nodes in the directed graph.

Abstract: There is provided a mechanism for conducting data transmission from a network management entity of communication network control element to a terminal or UE with improved robustness. After a multiflow connection for data units via at least one network transceiver device and via at least two different paths is set up towards a terminal, selection criteria are applied so as to decide which data units are sent on which transmission path. Specifically, dependent on the applied selection criteria, data units of specific data are selected to be subjected either to bicasting each selected data unit using the at least two paths, or to dynamic flow switching so as to transmit each selected data unit using one of the at least two paths and wherein each selected data unit can be independently chosen to be transmitted over either of the at least two paths.

Abstract: A test device is located within a broadband communications network. The test device is interconnected with a policy enforcement point of the broadband communications network. Responsive to commencement of a test to be conducted with the test device, the policy enforcement point is signaled, from a policy server of the broadband communications network, so as to set a bandwidth tier for the test to be conducted with the test device. The test is conducted with the test device in accordance with the bandwidth tier. One or more additional tests can be conducted for additional, different, bandwidth tier(s). Related methods, systems, apparatuses, and computer program products are also disclosed.

Abstract: A method and apparatus to manage interference between idle devices is provided. The method may include determining a pair of a target transmission node and a target reception node among nodes included in a multi-hop network. The method includes determining idle devices cooperating to manage interference in the communication based on a transmission mode determined for communication. The method determines and transmitting coordination information for communication between the pair of the target transmission node and the target reception node, to nodes participating in the communication and the cooperating idle devices.

Abstract: 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.

Abstract: A system may comprise a first device and a second device associated with a Clos architecture. The first device may include a first crossbar that comprises a first component, a second component, and a third component. The second device may include a second crossbar that comprises a fourth component, a fifth component, and a sixth component. The first component may connect to the second component and the fifth component. The second component may connect to the first component, the third component, the fourth component, and the sixth component. The third component may connect to the second component and the fifth component. The fourth component may connect to the second component and the fifth component. The fifth component may connect to the first component, the third component, the fourth component, and the sixth component. The sixth component may connect to the second component and the fifth component.

Abstract: Various apparatuses and methods for transmitting uplink data of an application at a user equipment are provided. In one aspect of the disclosure, uplink data of an application at a user equipment (UE) is transmitted to a network. A first amount of the uplink data expected to be buffered at a radio link control (RLC) layer is determined based on a latency of the application. A second amount of the uplink data available for transmission at the RLC layer is determined based on information provided by a modem of the UE. A data rate of the application is dynamically adjusted based on a difference between the first amount and second amount of the uplink data. In another aspect of the disclosure, an amount of the application data buffered at the RLC layer is maintained to be greater than a predetermined threshold that sets a Happy bit at an unhappy setting.

Abstract: Traffic engineering vector operations that are capable of being independently solved can provide near-linear scalability through the exploitation of massively parallel processing. Optimization can be performed simultaneously on different paths in a data plane, as well as on different links within the same path (or within the same set of paths). In some embodiments, the traffic engineering vector operations include an adjustable alpha-fairness variable that allows managers to achieve different levels of fairness/throughput. Hence, embodiment alpha fairness techniques provide flexible policy execution, while maintaining excellent scalability for large network implementations.

Abstract: A transmission terminal communicates with a reception terminal using a first communication path (a 60 GHz band) or a second communication path (a 2.4 GHz band or 5 GHz band). A first communication path connection detector 17 detects the connection or disconnection of the first communication path to or from the reception terminal. A throughput measurement section measures the throughputs of the first communication path and the second communication path. On the basis of the result of the detection of the connection or disconnection and the throughputs of the first communication path and the second communication path, a terminal controller judges whether or not to switch a communication path for data transfer. A communication path switch switches the communication path for data transfer to the first communication path or the second communication path.

Abstract: In a multiple interface, low power and lossy network comprising a plurality of devices, interface options for a source route to minimize self-interferences are desired. The ability to request a interface technology for a device to use with neighboring devices allows multiple transmissions to occur simultaneously without interfering with each other. A root phase device obtains interface option information from the devices. Each device in a network path determines the interface options available, such as powerline communications (“PLC”) and radio frequency (“RF”). The device transmits the interface options to the parent device. The parent device transmits the interface options up the network path toward the root phase device, which collects the interface options and determines transmission routes to any needed endpoint device. The transmission route will comprise the device routes and a interface option for each hop from a parent device to a child device.

Abstract: A method implemented in a network for placing services in a SDN system is disclosed. The network contains a plurality of network devices managed by a SDN controller and offers a set of services to subscribers. Subsets of the set of services are included in ordered service chains for subscribers. The method starts with determining a list of bandwidth consumption entities of a service for each service, where each bandwidth consumption entity is based on one or more chains of services. Then a weight of each service is calculated based on the list of bandwidth consumption entities of the service and a service with the highest weight within a group of services that have not been placed in the SDN system is selected. The selected service is then placed at a network device based at least partially on calculating bandwidth impacts to the SDN system by the service.

Abstract: Provided is process of operating a wireless device configured to act as a node in an ad hoc multi-hop mobile network, the process including: snooping, with a wireless device, a packet transmitted from a sending node to a receiving node in a multi-hop wireless connection, the sending node and the receiving node being in a different location; extracting from the snooped packet an identifier of the sending node and an identifier of the receiving node; determining based on the identifier of the sending node, the identifier of the receiving node, and a record in memory of the wireless device that the wireless device is part of a multi-hop wireless connection including the sending node and the receiving node; determining that a signal strength of a signal conveying the snooped packet exceeds a threshold; and transmitting a kill packet to the sending node and the receiving node that reconfigures the multi-hop wireless connection to bypass the receiving node.

Abstract: Synchronization in a communication system A method and apparatus for a communication system is disclosed. In the system communications occur via a multiple of nodes each providing a stratum for synchronization. It is determined that the stratum of a node is not included in a predefined set of stratums. In response to said determination synchronizing with the node is provided differently from nodes with stratums without taking the order of the stratum into account. Information about the status can be communicated between nodes.

Abstract: A terminal device according to an aspect of the present invention includes a reception module that receives a control channel and a spatially multiplexed data signal channel, a control signal detection module that extracts, from an output from the reception module, a demodulation control information which is a transmission parameter of a signal that is transmitted to the terminal device, in a data signal channel that is output from the reception module, and assistance control information which is a transmission parameter of a signal that is transmitted to a different terminal device, in the data signal channel that is output from the reception module, a channel estimator that obtains a channel estimate by using a reference signal, a signal detection module that demultiplexes the data signal channel by using the demodulation control information, the assistance control information, and the channel estimate, and a decoding module that decodes a signal that is output by the signal detection module, in which infor

Abstract: Some embodiments provide a method that identifies a network topology that is involved in routing of the network traffic between the endpoints in a pair of endpoints. The identified topology covers (1) all the routing paths (e.g., hardware and software-defined paths) between the endpoints and (2) all the forwarding elements (e.g., hardware and software-defined non-edge forwarding elements) along each path that forwards the network traffic (e.g., network packets). The method identifies, and groups together, the receiving interfaces as well as the forwarding interfaces of each forwarding element along different paths between the endpoints. By doing so, the method can identify a real link between a pair of forwarding elements when a set of forwarding interfaces of each one of the forwarding elements in the pair points to the other forwarding element.

Abstract: An access point determines the buffered data for each station of a plurality of stations in a BSS and groups the stations with similar station characteristics. The transmission time to the stations in a group can be apportioned. The groups can be ordered based on station characteristics and a transmission history. A sounding for a group can be performed based on the order. The MU-MIMO transmission for the group can be performed until a first condition is met. If the first condition is met, then the sounding and the MU-MIMO transmission for a next group can be performed, according to the order, until a second condition is met. The first condition can include an apportioned transmission time having expired and/or the buffers for the group being flushed. The second condition can include new data having been buffered by the AP and/or all buffered data having been transmitted.

Abstract: According to one embodiment, there is provided information processing apparatus, including: a first communication module configured to perform a communication under a first communication scheme which corresponds to a proximity wireless communication requiring no authentication; a second communication module configured to perform a communication under a second communication scheme which has a communicable distance longer than that of the proximity wireless communication; and a communication controller configured to perform a control, after the first communication module has started a data transmission with another information processing apparatus under the first communication scheme, so as to change-over the first communication scheme to the second communication scheme and then perform the data transmission.

Abstract: A collaborative distance metric leaning method and apparatus for visual tracking utilizes a distance metric to match the target with the best candidate. A collaborative distance metric learning algorithm is used for visual tracking by fusing two distance metrics learnt for different representations of the target. To further improve the performance of the trained distance metrics, a sample selection mechanism is also used that exploits the intrinsic structure of dense sampling.

Abstract: Virtual connection route selection apparatus and techniques are disclosed. At a communication traffic routing apparatus, metric information associated with multiple different routes for a virtual connection, such as a PseudoWire, toward a destination is collected. The metric information may be collected from one or more remote route computation elements capable of computing routes for virtual connections between the routing apparatus and other routing apparatus over an underlying communication system, or during actual establishment of the virtual connections, for example. An initial or re-optimized route for a virtual connection can then be selected at the routing apparatus based on the collected metric information. In some embodiments, although the virtual connection routes are paths computed by Path Computation Elements (PCEs), actual path selection decisions are distributed to routers.

Abstract: A bridge device at a first tier receives a geographic addressing packet destined for a target region containing a plurality of devices. The bridge device applies a bridging function using the geographic address packet to determine whether to transmit the geographic addressing packet. The bridging function utilizes certain information based on the geographic addressing packet. The bridge device determines to transmit the geographic addressing packet to a second tier based on the bridging function indicating that the geographic addressing packet should be transmitted to the second tier.