Abstract: Traffic recovery is supported at a switching node (20) of an OpenFlow network (5). The switching node (20) has a flow table (23) for storing flow entries (24) which determine forwarding of received packets between the ports. A switching node (20) installs (102) a flow entry for a back up path in the flow table (23). The switching node (20) renews (104, 105) the flow entry for the backup path based on at least one of: (i) an association between the flow entry for the backup path and a flow entry for a working path at the switching node, wherein the flow entry for the backup path is renewed when the flow entry for the working path is used to forward a received packet; (ii) receiving a flow entry renewal packet from another switching node on the backup path. A backup path can be configured for each of multiple points of failure in the working path.

Abstract: The present disclosure relates to a method performed by a network node configured for making automatic predictions in a telecommunication network. The method comprises obtaining a first value of a first key performance indicator (KPI) for a first network entity (NE) in the telecommunication network. The method also comprises obtaining a second value of a second KPI for a communication route between said first NE and a second NE. The method also comprises predicting, automatically and based on the obtained first and second values, that an alarm will be triggered at the second NE.

Abstract: A system and method in which each node in a Content Distribution Network (CDN) maintains information about the most-recent state of the CDN as a whole to decide what bandwidth to use when serving a content subscriber so that the total bandwidth of the entire multimedia content streamed/delivered to the subscriber through various nodes in the CDN remains within a pre-defined bandwidth cap for the subscriber. The entire CDN is thus treated as a single edge node. Each node in a CDN may periodically transmit to all other nodes in the CDN, information about any activity that occurs at the transmitting node. Instead of reporting to all the nodes, the transmitting node may report details of its node-specific activity to a subset of “interested” nodes. Once each node has a model of what the entire CDN system is currently doing, that node can implement bandwidth management in a coherent manner.

Abstract: A hybrid device may independently select a next hop for a packet stream based upon a path selection algorithm. The path selection algorithm includes calculating end-to-end path capacity for candidate paths to a destination device. End-to-end path capacity is calculated based upon contention groups of particular links in at least one of the plurality of paths. Selected paths are recorded in a stream forwarding table for use with subsequent packets of a packet stream.

Abstract: Techniques and solutions for distributing routing updates using timing information are described. For example, inter-device messaging protocols can support timing information (e.g., routing protocols be extended to support timing information). The timing information can indicate a time at which the routing update is to be put into effect where the time decreases the further away a given routing device is from the source of the routing update. For example, each routing device can determine a decayed update reference time when the given routing device will put the routing update into effect according to a decay mode. Routing updates can be managed between routing devices that support timing information and routing devices that do not support timing information.

Abstract: A method is implemented by a centralized control plane device for a software defined networking (SDN) network. The method performs joint inter-domain and intra-domain traffic engineering as a single optimization process with location varying objectives. The method includes generating a joint representation of interdomain and intradomain traffic demand with spatial differentiation where each domain can have individually defined optimization objectives. The method further includes determining a set of candidate paths for each source-destination pairs (SD) in the SDN network using the joint representation, selecting a candidate path from the set of candidate paths for each SD pair in the SDN network, and programming a set of switches in the data plane of the SDN network to forward the data traffic according to the selected candidate path.

Abstract: Network node and method therein for admission control in a communication system applying shared channels for communication. The method comprises receiving a request for a bearer setup, and deciding whether to accept or reject the request for a bearer setup based on information on current bearers carrying data having a QoS value, and for which bearers a transmission of the data fulfills a criterion, the criterion representing a probability of violating the QoS value. Information on bearers carrying data which do not have a QoS value and information on bearers for which a transmission of data having a QoS value does not fulfill the criterion is disregarded.

Abstract: The present disclosure pertains to systems and methods for assessing reliability of communication links in a software defined network (SDN). In one embodiment, a system may include an SDN architecture subsystem configured to generate SDN architecture information and a bandwidth subsystem configured to generate bandwidth information. A latency subsystem may receive the bandwidth information from the bandwidth subsystem and may be configured to generate latency information using the bandwidth information. A failover subsystem may receive the SDN architecture information, the bandwidth information, and the latency information and generate a failover assessment and a failover route for the communication link. A reliability assessment subsystem may receive the SDN architecture information, the bandwidth information, and the latency information, and the failover assessment and generate a reliability assessment.

Abstract: The present disclosure discloses a method for automatically setting network connection parameters in a networking device, comprising: accessing a network; acquiring all network connection manners supported by the network; selecting a network connection manner to be used from the acquired network connection manners; and automatically setting network connection parameters for the selected network connection manner. Accordingly, the efficiency of setting network connection parameters may be improved.

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: The present invention relates to a method of and a device for, arranging peers in a P2P network comprising a streaming source and network peers arranged at distribution levels in the P2P network. The method comprises receiving a request from a peer entering the network to receive data content, and determining a distribution level in the P2P network at which the entering peer is to be arranged with respect to the streaming source. Further, the method comprises providing the entering peer with a plurality of peers selected from the network peers from which the requested data content can be downloaded with an expected probability depending on the determined distribution level, and further indicating the distribution level of each of the plurality of peers, wherein the entering peer is enabled to download, with the expected probability, the requested data content from a selected one of said plurality of peers being arranged at a distribution level closest to that determined for the entering peer.

Abstract: Disclosed are systems and methods for network architecture that is a server-centric network architectural design.

Abstract: A method of communicating in a secure communication system, comprises the steps of assembling a message at a sender, then determining a frame type, and including an indication of the frame type in a header of the message. The message is then sent to a recipient and the frame type used to perform a policy check.

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.

Abstract: The example embodiments presented herein are directed towards an Optical Network Element, ONE, node (14), and corresponding method therein, for establishing multiple spectral routing in an optical transport network. The establishment of the multiple spectral routing features the use of a Split-Spectrum Label, SSL, (11) which comprises multiple definitions for spectral slots, where each definition has an absolute starting and an absolute ending frequency allocation.

Abstract: Various of the disclosed embodiments relate to line-of-sight (LOS), e.g., optical, based networks. Systems and methods are provided for connecting nodes based on their topological position in a line-of-sight communication network. Some embodiments may represent each node by a “backbone” and a “subnetwork” rank. The determination of a node's rank can prevent the formation of isolated “islands” of nodes, cut off from the backbone. The ranking can also provide a total ordering of nodes relative to the “fiberpop” node which can be used for healing and routing behaviors.

Abstract: Apparatus for performing load balancing among network servers connected to an internal IPv6 network. The apparatus comprises a first interface coupled to an external IPv4 or IPv6 network for receiving packets sent across the external network and an IP packet creator coupled to said first interface. This IP packet creator is configured, for each received packet at that interface, to select a network server to be allocated to the packet or identify an already allocated network server. The IP packet creator is further configured to create a corresponding IPv6 packet for transmission over said internal network to the selected or identified network server. The apparatus further comprises a second interface coupled to said internal IPv6 network for transmitting created IPv6 packets across the internal network towards respective selected or identified network servers.

Abstract: The method and system according to embodiments of the present invention may enable drivers to drive safely while paying attention to the road, without taking their eyes off the road or touching the screen, and to hear and respond to received various text messages (include instant messages, messengers), in various manners such as, for example, sending a predefined text and/or voice message, calling the sender of the message, etc. Thus, for example, drivers may continue to be available to messages while not being tempted to look at their phone and/or to text-message while driving.

Abstract: A computer-implemented method includes a principal process including performing a computational procedure in which the or each vertex preceding a particular vertex receives a notification that a computational procedure has been completed for the preceding vertex; and calculates new path lengths for the particular vertex by adding the length value attributed to the edge from the preceding vertex to the particular vertex to each of the recorded k shortest path lengths from the first vertex to the preceding vertex. A record of the k shortest path lengths calculated for the particular vertex is maintained. After the new path lengths have been calculated for the or each of the preceding vertices, a notification that the computational procedure has been completed for the particular vertex is issued. The computational procedure is performed with the source vertex as the first vertex and each vertex on a path from the source vertex to the destination vertex as the particular vertex.

Abstract: Provided is a communication control apparatus for controlling data transmission performed by a first communication module and a second communication module, each using a different communication scheme, the apparatus including a receiver to receive traffic information associated with the first communication module, an operating unit to calculate, based on the traffic information, a slack time, starting from a first point in time and ending at a second point in time at which traffic relating to the first communication module occurs, and a transmitter to transmit the slack time to the second communication module, wherein the first point in time is a point in time at which the second communication module requests the slack time from the communication control apparatus in order to transmit data.

Abstract: A method includes asynchronously collecting performance data from distributed devices. The performance data includes information associated with a particular data stream that transits each of the distributed devices. The method further includes ordering the performance data in accordance with a specific metric included in the performance data. The method further includes generating a per-hop perspective of the ordered performance data.

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

Abstract: A server, a user terminal apparatus, and a method for providing a streaming data service are disclosed. The method of providing streaming data to a user terminal apparatus from a server includes receiving a describe message from the user terminal apparatus via a real-time stream protocol scheme, transmitting a response message containing content execution information about at least one content of a streaming data service and content list information pre-stored in relation to at least one content stored in a storage medium to the user terminal apparatus when the describe message is received, and transmitting streaming data about content of the streaming data service or content stored in the storage medium to the user terminal apparatus when streaming data service request is received from the user terminal apparatus based on the response message.

Abstract: A mesh network of wired and/or wireless nodes is described in which a centralized controller provides seamless end-to-end service from the edge of the mesh network to mesh nodes located proximate to subscriber devices. The controller operates to provide a central configuration point for configuring forwarding planes of the mesh nodes of the mesh network, so as to set up transport data channels to transport traffic from the edge nodes via the mesh nodes to the subscriber devices.

Abstract: In one embodiment, a particular device within a client-layer network maintains client-layer topology information including server-layer Shared Risk Link Group (SRLG) information of server-layer devices and links in a server-layer network associated with client-layer links and client-layer nodes in the client-layer network. A determination is made to discover if there is an alternative client-layer path to an established client-layer path between a first packet switching device and a second packet switching device if all server-layer resources of any particular server-layer SRLG of a plurality of total server-layer SRLGs associated with the established client-layer path become unavailable. In one embodiment, the plurality of total server-layer SRLGs includes: an SRLG of a same optical node, an SRLG of a same optical fiber, an SRLG of co-located plurality of optical nodes, and/or an SRLG of co-located plurality of optical fibers.

Abstract: An asymmetrical network switch adapted to auto-discover and advertise into a traffic engineering, TE, domain a switch detailed connectivity matrix, SDCM, containing for each allowed switching combination of interfaces of said asymmetrical network switch at least one switch detailed connectivity matrix entry, SDCME, wherein each said SDCME represents an internal to said asymmetrical network switch potential connection interconnecting the interfaces of said interface switching combination, wherein a SDCME advertisement includes a switch detailed connectivity matrix entry cost vector, SDCME CV, which comprises a set of attributes describing cost penalties in terms of various service characteristics that a network service incurs if it selects a path or a tree traversing the asymmetrical switch in accordance with the SDCME.

Abstract: Provided is a method for communicating with another device through a first device. The communication method includes: receiving a discovery request message including information regarding a mode of a second device; transmitting a discovery response message including information regarding a mode of a first device; receiving a gateway change request message for requesting mode switching to a combined mode from the second device; transmitting a gateway change response message with a result for the requesting to the second device; and changing the mode of the first device to the combined mode if the first device accepts the requesting, wherein the combined mode is a mode in which the first device operates as both a gateway of a first network and a member of a second network simultaneously.

Abstract: Node device calculates reception rate of frames of particular frame type transmitted from adjacent node device, calculates arrival rate of unicast frames on the basis of calculated reception rate and frame length, and calculates inverse number of calculated arrival rate as link cost. Node device obtains from adjacent node device route cost for each route from adjacent node device to each node device that is reachable final destination, calculates route cost of route from node device itself to each node device that is final destination reachable via adjacent node device by integrating calculated link cost and obtained route cost. Node device selects adjacent node device that is transmission destination of data frame on the basis of route cost of route from node device itself to node device that is final destination of data frame when data frame is transmitted.

Abstract: A method, system and computer-usable medium are provide for managing the Open Channel for IMS command correctly the UICC to have knowledge about the specific status codes the ME received from IMS. This knowledge allows the UICC to make a smarter decision on what it attempts to do to access IMS. Accordingly, the UICC is provided with detailed information about the status codes from the IMS service to allow the UICC to make an informed decision. If the UICC does not have such knowledge, it is possible that the UICC will send potentially unwanted commands to the ME to establish access to IMS.

Abstract: An improved data packet design that can be used in a variety of data communication standards used in smart meter systems is disclosed. In an embodiment a smart meter system that comprises of a local server, a coordinator and a plurality of smart meters in the many-to-one data communication system configuration. The smart meter uses a variety of types of radio frequency data packets. The data packets contain the commands, parameters, and data for system control and data transmission. The data packet designs are disclosed for a route discovery command, a get parameter command, a set parameter command, a get data command, a reset command, a relay command, a start command, and a calibration command that are used in the smart meter system.

Abstract: Disclosed herein are systems, methods, and non-transitory computer-readable storage media for providing on-demand quality of service guarantees in a wireless network environment. The system determines an on-demand quality of service for a segment of a communication path between a user equipment communicating with a radio access network connected to a core network and an external network connected to the core network. The system then determines if the on-demand quality of service for the segment meets a quality of service requirement. If the on-demand quality of service for the segment does not meet the quality of service requirement, the system identifies an alternate communication path between the user equipment and the external network, wherein the alternate communication path differs from the communication path. The system can then setup the alternate communication path for traffic between the user equipment and the external network.

Abstract: Provided are a path control method, a wireless communication system, a path control device, and a non-transitory computer readable medium which are capable of securing efficient traffic accommodation, while maintaining communication quality. The path control method controls a communication path by selecting one path from among a plurality of path candidates with respect to a specific piece of traffic in a network constituted of a radio link provided with an adaptive modulation function. A requested band of the piece of traffic is compared with an allocatable band allocatable to a first path candidate that is included in the plurality of path candidates and that satisfies a degree of stability requested by the piece of traffic by a first modulation method.

Abstract: A route for establishing a wireless connection between a wireless device and a node may be selected based on an estimated duration of the route. The route duration may be estimated based on information related to the expected movement of nodes included in the route.

Abstract: A system and method determines an object's lifetime. An object lifecycle engine may work with an object oriented environment. As objects are created, an object graph may be constructed having one or more roots. A root record graph may be constructed, and edges of the root record graph may point in an opposite direction than the edges of the object graph. As objects, entities, and references are added, removed, or deleted from within the environment, the object graph and the root record graph may be updated. A root finder may search the root record graph to determine whether a given root record is no longer rooted. If a root record is no longer rooted, then the object associated with that root record may be determined to be unreachable and at the end of its lifetime. If the root finder search is performed when references are removed, then objects may be destroyed in a deterministic manner.

Abstract: Sensitive pieces of information stored on an individual's device can be protected using a device identification system that applies, for each sensitive piece of information, a function that integrates an identifier of the individual with a respective sensitive piece of information to create a respective identity element. Each identity element can be signed with a signature to create a trust group. The identity element and signature can be uploaded to the individual's device using an application that is configured to provide a subset of the sensitive pieces of information in response to a query.

Abstract: A device may receive a packet that includes a destination address. The device may analyze a first Bloom filter, based on the destination address, in order to identify a prefix range entry associated with the destination address and included in a set of prefix range entries associated with the first Bloom filter. The device may analyze a second Bloom filter, based on the destination address and the identified prefix range entry, in order to identify a prefix length entry associated with the destination address and included in a set of prefix length entries associated with the second Bloom filter. The device may determine routing information associated with the identified prefix length entry. The routing information may identify a longest prefix match associated with the destination address. The device may provide the packet based on the routing information.

Abstract: Disclosed herein are system, method, and computer program product embodiments for calibrating and using a stable storage model. An embodiment operates by generating, by a central computer, an access request for a stable storage, wherein the access request comprises a plurality of page accesses; measuring a cost to execute the access request on the stable storage; amortizing the cost over the plurality of page accesses; and calibrating, by the central computer, a stable storage model based on the amortized cost.

Abstract: The present disclosure provides a method of establishing a SACM network is disclosed. The method comprises deploying a plurality of mesh nodes, wherein each of mesh nodes having a mesh node capability to communicate with the other mesh nodes as well as a gateway capability to provide an access to a service network, wherein the service network provides a wireless communication service; establishing a plurality of links between the mesh nodes, each of the links connecting two of the mesh nodes; searching and selecting a plurality of dynamic gateway nodes from the plurality of the mesh nodes and establishing a plurality of connections between the dynamic gateway nodes and the service network and performing routing and path optimizing to find optimal route paths for all the mesh nodes to access the service network.

Abstract: A CPU architecture is proposed which flexibly allocates chip resources among threads. Execution units (microcores) are arranged in a ring. Instruction fetch units (front-ends) deposit instructions sequentially into storage elements within the microcores. Multiple front-ends can each feed segments of the ring; each such segment is a “smart queue”. If, due to a sustained higher execution rate, a thread catches up to the next thread ahead of it, the slower thread steps aside and lets the faster thread play through. Other circumstances may lead to a thread consuming more than its usual share of resources, possibly even all of the microcores, for a time. The architecture has no instruction set dependencies; it is applicable to existing instruction set architectures and will speed up execution of them significantly as compared to conventional architectures.

Abstract: An electronic device may include a network interface that may enable the electronic device to wirelessly couple the electronic device to other electronic devices. The electronic device may also include a processor that may determine at least one data path to the other electronic devices using a Routing Information Protocol—Next Generation (RIPng) routing mechanism. After identifying at least one data path to the other electronic devices, the processor may determine whether the identified data path(s) is secure using a Datagram Transport Layer Security (DTLS) protocol. If the identified data path(s) is determined to be secure, the processor may send Internet Protocol version 6 (IPv6) data packets to the other electronic devices via the secure data path(s).

Abstract: A communication method of a source device according to an embodiment includes detecting a status of a first link directly connected from the source device to a destination device or a status of a second link connected from the source device to the destination device via a relay device, selecting any one of the first link and the second link based on a result of the detection, and transmitting data using the selected link.

Abstract: A method, apparatus and computer program product are therefore provided in order to provide for efficient selection of a router (206, 208) for providing network services in an infinite link network. A mobile terminal (202) may identify nearby routers (206, 208) using link layer distance metrics in order to select an optimal router. The link layer distance metrics may provide a number of “hops” or other measure of physical distance between the mobile terminal (202) and the router (206, 208) in order to route packets to a router that is physically closest to the mobile terminal, which may result in a minimized number of relays for a packet transmitted from the terminal to the router, and vice-versa.

Abstract: In one embodiment, the techniques herein provide that a node may receive a packet from a neighboring node in a low power and lossy network (LLN). The node may then extract, from the packet, a link-layer source address from a link layer header and an internet protocol (IP) source address from an IP header. The node may then determine whether the neighboring node originated the packet and, based on that determination, the node may correlate the link-layer source address with the IP source address to provide neighbor discovery.

Abstract: A live video matching system provides a matching service between a video demander and a video provider. An orchestration module of the system dynamically adjusts live services provided by SDN edge devices according to network available resources. An SDN edge device of the system dynamically converts and integrates multiple video streams to generate a virtual channel based on results of matching within multiple requests for videos and provides live video channels for interested users.

Abstract: Methods and apparatus are disclosed for monitoring a Maintenance Association (MA) for Connectivity Fault Management (CFM) in a network supporting Equal Cost Multiple Paths (ECMP). A set of ECMP paths is generated for sending data between endpoints in the network. Furthermore, a set of ECMP MAs is created that are used for monitoring the generated ECMP paths between the endpoints. The created set of ECMP MAs is subsequently used for sending monitoring packets. ECMP path MAs therefore conform to existing CFM operation and are compatible with both ECMP point to point path MAs and ECMP multipoint path MAs.

Abstract: Systems and methods for ordering candidates for wireless network association are provided. In certain embodiments, a wireless device, includes a processor that controls data received and data to be transmitted by the wireless device; and a memory, wherein the memory stores a short list that stores network device responses, wherein a network device response is associated with a network device in an environment of the wireless device. In certain implementations, instructions direct the processor to perform a short list search, wherein the wireless device attempts to connect to networks associated with network devices identified in the short list; and when the wireless device fails to connect with the networks associated with the network devices identified in the short list, perform an exhaustive search, wherein the wireless device attempts to connect to additional networks associated with additional network devices based on an ordered arrangement of network identifiers.

Abstract: In one embodiment, a device connected to a network receives at a network interface a first network size indicator for a first network and a second network size indicator for a second network. A difference between the first network size indicator and the second network size indicator is determined and a switching probability is calculated if the difference between the network size indicators is greater than a predetermined network size difference threshold. The device may then migrate from the first network to the second network based on the switching probability.

Abstract: Techniques for resolving single source shortest path for database processing are provided. Graph data for nodes having weights for edges of a database network are iterated producing a new message table and results table in each iteration. The results table stores the minimum path weight. For each iteration the graph data and message table are joined to produce a state of a node and outgoing edge messages. The message table and results table are co-grouped to generate a new message for a next node to process. When done the single source shortest path for the network is produced.

Abstract: Embodiments relate to path selection for packet transfer in a network. An aspect includes a method of selecting a path among a plurality of paths in a network for transfer of a packet from a first system to a second system in the network. The method includes storing, in a memory device, a static path performance vector indicating a tier among a plurality of tiers corresponding with each of the plurality of paths, each of the plurality of tiers corresponding with a relative performance level. The method also includes maintaining a path availability bit vector indicating an availability of each of the plurality of paths, and selecting, using a processor, the path among the plurality of paths based on the path performance vector and the path availability bit vector.

Abstract: A system of evaluating the reliability of deterioration-effect multi-state flow network and method thereof are disclosed in present invention. The system can evaluate the probability that d units of data of flow can be transmitted from a source node to a sink node. In practical application, the flow in a deterioration-effect multi-state flow network may undergo a loss due to deterioration. For example, electrical power will decrease if the transmission distance is too great. Therefore, how to evaluate the reliability of deterioration-effect multi-state flow network becomes an important issue.