Abstract: Techniques for efficiently updating routing information in a network device such as a router. According to an embodiment of the present invention, the routing information is updated upon creation or deletion of an overlay tunnel without the network device having to regenerate a Shortest Path Tree (SPT) by performing full Shortest Path First (SPF) processing.

Abstract: A network switch includes a service registration database and a service discovery engine that is coupled to the service registration database. The service discovery engine receives a first service registration over a network from a first service included on a first service device and, in response, stores the first service registration in the service registration database. The service discovery engine then receives a multicast service discovery message over the network from a target device. The service discovery message includes a service identification. The service discovery engine then determines that the service identification is associated with the first service registration stored in the service registration database and, in response, sends a unicast service communication message over the network to the target device. The service communication message includes communication information for the first service.

Abstract: A method is provided for automatically providing remote services for a mobile device having an established relationship with a server of a home network. After the relationship between the mobile device and the server has been set-up and the device detects a local network that is separate and remote from the home network, a connection is automatically established between the mobile device and a local network. The device then automatically establishes an Internet connection with the server through the local network, and transmits to the server information that was stored in the mobile device when the relationship was established. In response to the server recognizing the device through the transmitted information, the server automatically activates at least one service to initiate a transfer data, such as uploading images between the device and the server through the local network.

Abstract: Method and system for analyzing a linear programming problem or any other problem involving inequalities constraints set relating to multiple variables. An initial feasible region is calculated based on a sub-set of the constraints set. The feasible region is updated based on the additional constraints added one at a time. The method checks for feasibly, identifies active constraints, and provides end-points of the feasible region. The method may be applied to a control system or to a crossbar switch handling routing between multiple input and multiple outputs, such as digital data networking switch used to route TDM digital data streams being packet, frame or cell based, in a LAN, WAN, MAN or Internet application.

Abstract: A communication managing apparatus (CMA) that manages transmission of data employing a token passing system in a network in which a plurality of communication apparatuses (CAs) are connected via a transmission line. The CMA includes a network-presence checking unit performing network presence checking processing for transmitting, by broadcast, a network presence check frame for recognizing the CAs, receiving, from the CAs, frames including thereof, and generating connection information indicating a connection state via the ports. The CMA further comprises a unit determining token circulation order using the connection information, a setup processing unit performing, based on the token circulation order, setup processing for notifying the communication apparatuses of a communication apparatus to which a transmission right is giving next, and a data-fame-communication processing unit performing transmission and reception of a data frame using a token frame.

Abstract: Methods, apparatus, and other embodiments associated with automatically configuring a secure wireless connection are described. According to one embodiment, an apparatus includes a security logic in a first device. The security logic is configured to determine a security code for wirelessly connecting to a second device by sending a request to initiate communication to the second device. The security logic is further configured to receive a reply from the second device in response to the request. The apparatus also includes a communication logic configured to establish a secure wireless connection to the second device from the first device by automatically initiating a Wi-Fi Protected Setup (WPS) based, at least in part, on the security code.

Abstract: An approach is provided in which a local module receives a discovery message from a virtual network endpoint that is devoid of a corresponding virtual IP address. The local module sends one or more unicast network configuration messages to a dynamic configuration service and, in turn, the local module receives one or more unicast network configuration responses from the dynamic configuration service. One of the unicast network configuration responses includes one or more network configuration parameters. The local module configures the virtual network endpoint according to one or more of the network configuration parameters.

Abstract: A communication apparatus is provided. The communication apparatus includes an RF module, a down converter coupled to the RF module and a detector coupled to the down converter. The RF module receives an RF signal. The down converter down converts the RF signal in response to a channel select signal to generate a converted signal, wherein the channel select signal controls the down converter to alternately sweep a plurality of scan trains during a scan frame, and each of the scan trains comprises a plurality of channels. The power detector determines whether the RF signal comprises an ID packet according to the converted signal corresponding to the channels of the plurality of scan trains.

Abstract: The duration of receiver on-times may be minimized by sensing and reacting to communication channel power levels at intervals. When no energy is detected on the communication channel, then the receiver may be turned off for a channel sampling interval. If energy is detected on the channel, then the receiver may remain on to determine if a received message is associated with the device. Receiver on-time may also be minimized by adjusting the timing of messages used for broadcast messages sent by routing or other protocols. Broadcast messages, such as network routing topology messages, may be controlled in two phases. In a first phase, the broadcast messages are sent with at a high rate to allow nodes to join the network rapidly. In a second phase, the broadcast messages are sent with at a lower rate to minimize interference with data and other messages in the network.

Abstract: A method of replacing a first router with a second router within a network may comprise placing the second router in client mode within the network such that the second router is not configured to route network traffic and is configured to search for a network access point provided by the first router. A protocol may then be invoked on the first and second routers, the protocol being configured to enable an exchange of the network name and password information from the first router to the second router in client mode. The second router, in client mode, may be configured according to the obtained network name and password information. The second router may then be switched from client mode back to router mode and enabled to route network traffic on the network. The first router may then be replaced with the second router.

Abstract: There are disclosed a method of and system and apparatus for performing an uplink feedback, applicable to a dynamic sub-frame system, so as to avoid collision of ACK/NACK resources between a non-dynamic system and a dynamic system from occurring.

Abstract: A method of efficiently disseminating various types of information throughout a mesh network is disclosed. Information is typically propagated through the network using a variety of protocols and messages. However, in one embodiment, a single message, communicates all of this information at once. The message includes data originating at the leader, which does not change as the messages are propagated through the network, as well as topology and link information that is created by the forwarding nodes. The data originating at the leader includes the identity of the leader node and a sequence number. Additionally, a version number is included by the leader which represents the state of the quasi-static information. Quasi-static information may include, for example, the identity of a node that has access to a central control system or the internet. This compact message format allows improved efficiency and use of the network.

Abstract: A communication apparatus may form a first wireless network so as to establish a wireless connection with a first external apparatus, in a case where a first wireless connection request is obtained from the first external apparatus and it is determined that a connection number has not reached an upper limit. The communication apparatus may newly form a second wireless network while maintaining a state of the first wireless network being formed, so as to establish a wireless connection with a second external apparatus, in a case where a second wireless connection request is obtained from the second external apparatus in the state of the first wireless network being formed and it is determined that the connection number has not reached the upper limit. In the first and second wireless networks, the communication apparatus may be configured to operate as a parent station.

Abstract: A method provides for selecting a communication interface towards an access point by a wireless communication device. The method includes receiving one or more HELLO messages from the access point; determining whether any of a plurality of communication links is being used to reach the access point by evaluating at least one field of each of the received HELLO messages; penalizing a link metric of a communication link when the communication link is being used; and selecting a communication interface towards the access point, wherein the selected communication interface is coupled to a best communication link having a best link metric.

Abstract: An on-demand method of routing data between a plurality of local peer groups (LPG) of plural moving nodes comprises transmitting a route request message from a source node, relaying the route request message to a native boundary node; forwarding the route request message to a foreign boundary node, determining if the destination node is within an LPG for the foreign boundary node; relaying the route request message to another boundary node if the destination node is not within the LPG, relaying the route request message to the destination node if the destination node is within the LPG, receiving the routing request message at the destination node, transmitting a routing response to the source node, relaying the routing response to the source node through a path discovered by the route request, receiving the routing response at the source node, and transmitting the data, upon receipt of the routing response.

Abstract: Routing activities for a collection of routing devices in a network are coordinated. Link state information representative of connections among the devices is received from the devices. The received link state information is processed for each of the network devices. The processed link state information is provided to the network devices to enable the network devices to determine how to route network traffic. The processed link state information may represent the topology of the network differently to different devices in order to influence device routing behavior.

Abstract: A computer program product comprising computer executable instructions stored on a non-transitory medium of an upstream node in a network system comprising a plurality of nodes that when executed by a processor cause the node to advertise an upstream assigned label to a downstream node, receive a message from the downstream node, and if the received message confirms that no conflict with the upstream assigned label exists at the downstream node, assign the upstream-assigned label, or if the received message confirms that a conflict with the upstream-assigned label exists at the downstream node, either select a new upstream-assigned label or wait until indication is received that the label resource has become available.

Abstract: A first processor assigns switches and/or switch ports to a virtual stack according to configuration information and stores the virtual topography of the virtual stack in a mapping table. The mapping table correlates switches, switch ports, computer processors, and virtual stacks. The first processor receives a data unit from a first switch that includes a source address and a destination address. The destination address identifies a switch and switch port. The first processor compares the destination address to the mapping table to determine a second computer processor and sends the data unit to the second computer processor, the second computer processor corresponding to a switch and/or switch port identified in the destination address of the data unit.

Abstract: Various exemplary embodiments relate to a method for determining peer status in a pseudowire (PW) node, the method including: sending a first PW status request message to a peer node including a PW node local message ID, PW node remote message ID, and request flag; starting a first retry timer; starting a second retry timer when the first retry timer expires and no response to the first PW status request message is received; starting a first request timer when the second retry timer expires and no response to the first PW status request message is received; and starting a third retry timer when the first request timer expires and no response to the first PW status request message is received.

Abstract: Various aspects of the instant disclosure are directed towards a method for communicating time-based data in a power line communication system. In accordance with one or more example embodiments, firmware is downloaded to a multitude of endpoints over power distribution lines carrying alternating current (AC) power. Endpoint devices targeted for changes to stored firmware are grouped and the firmware is delivered in chunks to each group. As devices receive a particular chunk of firmware, the device advances to a next stage and provides information indicative of this stage, based upon which subsequent chunks of firmware are communicated. This occurs (e.g., on a daily cycle) until the endpoint has received all firmware for an update, after which the endpoint(s) are re-started using the firmware. Accordingly, such updates can be carried out in a cyclic and verifiable manner.

Abstract: An apparatus and method for a wireless home mesh network with a network topology visualizer is described. In one embodiment, the method may include collecting node topology information by a node of a wireless home mesh network, where the node topology information includes a list of neighbor nodes for the node. Thereafter, a communication socket is opened, and a node topology packet, including a lust of neighbor nodes, is transmitted in order to produce a global network topology map. Other embodiments are described and claimed.

Abstract: Systems and methods are disclosed for graph-based distributed parameter coordination in a communication network. In general, discrete local parameters to be coordinated among communication nodes in the communication network and their respective performance metrics, or costs, are modeled using a factor graph. Based on the factor graph, a variant of the sum-product algorithm, namely the min-sum algorithm, is applied in order for the communication nodes, through iterative message passing with their neighboring communication nodes, to decide upon optimal values for the local parameters for the communication nodes that collectively optimize a global performance metric across the communication network. In one embodiment, the communication network is a wireless communication network. In one specific embodiment, the wireless communication network is a cellular communication network.

Abstract: An example method includes storing a portion of virtual PortChannel (vPC) information in a TRansparent Interconnect of Lots of Links network environment, deriving, from the portion of vPC information, a physical nickname of an edge switch to which a frame can be forwarded, and rewriting an egress nickname in a TRILL header of the frame with the physical nickname. In example embodiments, the vPC information can include respective vPC virtual nicknames, EtherChannel hash algorithms, hash values, and physical nicknames of edge switches associated with vPCs in the network environment. In some embodiments, the portion of vPC information can be derived from an Interested vPC Type Length Value (TLV) information of an Intermediate System to Intermediate System (IS-IS) routing protocol data unit (PDU).

Abstract: Methods and systems for association management within a wireless node network of nodes and a server are described. A method may identify a first node as a potential for associating with a second node based, for example, upon status information about the nodes. An association request is transmitted by the second node to the server. The server may determine the locations of the nodes, determine if associating the nodes is desired based on the locations, and record new association data if association should occur. Upon receiving a permissive response from the server, which may include one or more authorization credentials, the first node and second node may be associated. Then with authorization credentials, the first and second nodes may securely connect and share data. And once associated, responsibility for a task previously done by the first node may be shifted to the second node after the nodes are associated.

Abstract: The present invention provides, in one embodiment, a method for detecting another device performed by a first device having a converged personal network service (CPNS) enabled entity. The method for detecting another device comprises the steps of: performing a procedure for a physical connection with a second device, if the CPNS enabled entity within the first device is set to a personal network entity (PNE) mode; and receiving a search request message from the second device, in order to prevent the duplication of information between the CPNS enabled entity and the second device. Preferably, said search request message can be used to obtain one or more pieces of information, among the mode information of one or more devices detected while the procedure for the physical connection is performed and the information on a network to which one or more said detected devices belong.

Abstract: The invention relates to a method for establishing deterministic communication routes in a large computer network, wherein all affected end systems and switches of the computer network have a global time and a deterministic communication route is generated on the basis of an existing communication route between two or more end systems of the computer network in that a time-triggered connection manager (TTCM) of an end system reserves the deterministic communication route in a reservation phase by sending a reservation message to each network switch of the existing communication route up to the reservation commitment time (KZPT), and then confirms this deterministic communication route in an accept phase by sending an accept message to the network switches of the existing communication route before the KZPT.

Abstract: In one embodiment, a method comprises a path computation device receiving device information from member network devices, each member network device belonging to a directed acyclic graph to a destination in a low power lossy network; and the path computation device classifying each member network device belonging to a directed acyclic graph as belonging to a dominating set, for generation of optimized routes distinct from any directed acyclic graph, for reaching any one of the member network devices of the dominating set.

Abstract: Described herein are techniques related to wireless communication systems that may implement microwave backhaul for connectivity between network elements deployed by the wireless communication systems. This Abstract is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims.

Abstract: A method for acquiring information includes: receiving an Internet Protocol (IP) address acquisition request or Packet Data Network (PDN) address allocation information sent by User Equipment (UE); determining a PDN address capability according to the IP address acquisition request or the PDN address allocation information; and sending the determined PDN address capability to the UE. An UE and network equipment are also provided. The PDN address capability is determined by the network and is sent to the UE, so as to indicate to the UE the IP address information that may be acquired in a current PDN connection, such that when the network cannot provide an IP address for the UE any more, the UE is prevented from acquiring other IP addresses in other manners, avoiding service abnormality.

Abstract: A calculation processing apparatus includes a monitor, a CPU, a memory and a hard disk. The hard disk stores an initial program input from outside, a network creation program, a network modifying program, network information, node operation definition, and learning variables. The CPU executes the network creation program, and creates network information related to a network representing an algorithm structure of the initial program. Further, the CPU executes the network modifying program and modifies the network information based on the result of calculation by the network, using a learning algorithm.

Abstract: An electronic device, e.g., a mobile device, having access to a wireless network roams from one access point (AP) to another using access point detection based on location and learning. A learning scheme may modify a list of nearby access points determined based on location to identify neighboring access points where roaming is possible. The identified neighboring access points where roaming is possible may be ordered based on roaming history, such as the frequency of the roams to a particular AP. The roaming history may be maintained on a per client basis or aggregated across all clients using an AP.

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

Abstract: A mobile terminal and a method of controlling the mobile terminal are provided. The mobile terminal includes: a display; a wireless Internet module; and a controller for acquiring information about a plurality of voice over Internet protocol (VoIP) accounts that can communicate through the wireless Internet module and for distinguishing information about a first user group corresponding to the acquired plurality of VoIP accounts from information about a second user group not corresponding to the acquired plurality of VoIP accounts and for displaying the information in the display. Therefore, by displaying to distinguish information about a user group corresponding to a plurality of VoIP accounts from other information, a function can be easily selected through a plurality of VoIP accounts.

Abstract: A method, apparatus, and computer program for operating a Bluetooth network is presented. The method comprises providing a Bluetooth system comprising a plurality of Bluetooth devices forming Bluetooth piconets disconnected from each other; and providing a route for a data packet between two remote Bluetooth devices through the Bluetooth system by sequentially changing structures of the Bluetooth piconets, wherein at least some of the plurality of Bluetooth devices sequentially create and terminate connections with different Bluetooth devices as a result of the sequential change of the structures of the Bluetooth piconets.

Abstract: A technique for explicit path control for traffic forwarding in a network comprising multiple nodes is described. A device embodiment comprises a path computation element that is configured to receive, from an edge node, control protocol data units of a control protocol. The path computation element is further configured to determine an explicit path from information contained in the received control protocol data units and to instruct the edge nodes to perform an action to have the explicit path installed in the network.

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: A method for improving performance of a network includes identifying at least two communities of users within the network, analysing a structure of each community and clustering the communities according to community performance. The method further includes comparing a structure of a lower performing community with a structure of a higher performing community, and changing the structure of the lower performing community substantially to resemble the structure of the higher performing community. Related computer program product for carrying out a method of introducing connections among users of a network and an apparatus configured to introduce connections among users in a network are disclosed.

Abstract: A coordination task to interface with VM, SDS and SDN environments to guarantee that the overall QoS of the combined SDN and SDS meet desired levels. The coordination task performs this coordination when virtual targets are originally developed, when the virtual targets are modified and when the accessing servers are reconfigured, such as when a VM moves.

Abstract: A method comprising determining at least one event criteria from a received event function request; determining an event impact from the at least one event criteria and a general function impact; determining whether the event impact interferes with at least one implemented function instance; and generating a coordination output based on the determination whether the event impact interferes.

Abstract: One embodiment of the present invention provides a switch. The switch includes a fabric switch module and a border module. The fabric switch module maintains a membership in a first fabric switch. The fabric switch includes a plurality of switches and operates as a single logical switch. The border module determines that the egress switch identifier in a first encapsulation header of a first packet is associated with a switch outside of the fabric switch. The first packet is forwardable in the first fabric switch based on the first encapsulation header. In response to the determination, the border module changes the ingress switch identifier in the first encapsulation header of the first packet to a first virtual switch identifier associated with a first virtual switch. This first virtual switch externally represents the first fabric switch.

Abstract: A method, non-transitory computer readable medium, and apparatus for discovering and analyzing a network topology includes obtaining information regarding a network including a relationship of a plurality of nodes of the network. At least one value for each of a plurality of centrality parameters is determined for each of the plurality of nodes. At least one topology score for each of the plurality of nodes is generated based on one or more of the centrality parameter values. One or more relatively significant nodes are identified based on one or more of the topology scores and output.

Abstract: A method of reducing data transfer while increasing image information over an 802.15.4 network includes obtaining an image with a sensor, modulating a representation of the image using a first 802.15.4 modem, sending the representation of the image to a coordinator, demodulating the representation of the image using a second 802.15.4 modem, and digitally enhancing at least one of the representation of the image and the image. A system for communication over an 802.15.4 network includes a sensor for obtaining data, the size of the data being at least an order of magnitude greater than the size of an 802.15.4 packet, a first 802.15.4 modem coupled to the sensor, a buffer for temporarily storing the data to allow transmission of portions of the data; the buffer being coupled to the sensor, a coordinator coupled to the sensor, the coordinator being capable of communicating with a computer, and a second 802.15.4 modem coupled to the coordinator.

Abstract: A first communication device comprising memory in which data is stored may receive a request packet from a second communication device, measure received signal strength for the request packet, and determine whether to perform the requested search of the data stored in the memory based on the received signal strength and the power at which the request packet was transmitted. The search request packet may comprise a request to search the data stored in the memory, and a transmit power field that indicates a power at which the request packet was transmitted. The determining may be based on a result of a comparison between the received signal strength and a threshold and/or based on a comparison of a relative power and a threshold. The relative power may be calculated utilizing the received signal strength and the power at which the packet was transmitted.

Abstract: An autonomous system (AS) comprising a topology transparent zone (TTZ) comprising a plurality of TTZ nodes, wherein the plurality of TTZ nodes includes an edge node and an internal node, wherein each of the plurality of TTZ nodes is configured to connect to another TTZ node via an internal link, and a plurality of neighboring external nodes connected to the TTZ edge nodes via a plurality of external links, wherein no link state advertisements (LSAs) describing the internal links are distributed to the neighboring external nodes.

Abstract: A method is implemented in a network element that functions as one of a plurality of controllers for one of a plurality of areas of a split architecture network. The controller provides a control plane for the area of the split architecture network where the controller is remote from a plurality of switches providing a data plane for the area of split architecture network. The controller facilitates optimized routing across the plurality of areas of the split architecture network by providing limited intra-area link cost data to other controllers of other areas of the split architecture network and to traditional routers of a network including the split architecture network. The limited intra-area link cost data provides costs of each possible shortest path traversal of the area of the controller without providing all internal link cost data.

Abstract: Method for switching to an appropriate network topology type in a telecommunication network including of a node (b) sending to a further node a message (M1) including of a discovery request, receiving from further nodes of the telecommunication network messages (M3, M11) including of discovery results, thereafter, sending a message (M5) including of a proposal of a network topology type and switching to an appropriate network topology type.

Abstract: In one embodiment, a method includes generating for a client device associated with an access point, a partial association identifier based on an association identifier assigned to the client device and a hash of a basic service set identifier the client device is associated with, and transmitting a packet to the client device, the packet comprising the partial association identifier. The partial association identifier indicates that the packet is intended for the client device. An apparatus is also disclosed.

Abstract: A method for discovering resources includes identifying one or more geographically fixed transceivers with which a mobile device is in communication and through which the mobile device can communicate with other devices. A resource geographically associated with the identified one or more transceivers is identified. Identification occurs without regard to a signal strength or strengths experienced between the mobile device and the one or more transceivers. The mobile device is caused to display data corresponding to the identified resource.

Abstract: A method for configuring a router is disclosed. The method comprises providing router configuration information. The router configuration information is sent to the router over a cellular data network.

Abstract: Methods and systems for reliable neighbor discovery in wireless ad hoc networks are provided herein. In one aspect, embodiments of the present invention provide methods and systems for analyzing the quality of a communication link. In embodiments, several factors affecting link quality may be incorporated in the analysis, and basic and/or complex statistical and/or probabilistic analysis may be used. In another aspect, embodiments of the present invention provide methods and systems for neighbor node discovery that adapt to network and/or node operating conditions and that dynamically maintain a neighbor node set at a given node according to these conditions. In a further aspect, embodiments of the present invention extend the utility of neighbor node discovery beyond the customary role of data routing support into the problem of deploying an ad hoc network by providing a display module for displaying node connectivity information.