Abstract: In an embodiment, a method comprises: detecting a change in a multiple-switch configuration in a data communications network comprising a plurality of packet data switches configured as roots of multicast trees. In response to detecting that the multiple-switch configuration has changed, a first value, a second value and a third value representing limits on a number of multicast trees supported in the network and prioritization of the switches are retrieved. The method further comprises determining a type of the multiple-switch configuration change. In response to determining that the type indicates that a first switch was added to the multiple-switch configuration, using at least the first, second and third values, it is determined whether to configure the first switch as a first root in the multiple-switch configuration. The method is performed by one or more computing devices.

Abstract: Example methods disclosed herein include registering a first leaf node to receive multicast data from a source via a first network node in response to receiving, from the first leaf node, a first message addressed to an anycast address, the anycast addressed being assigned to the first network node to associate the first network node with a second hierarchical level of a replication hierarchy. The disclosed example methods also include receiving the multicast data from a second network node associated with a first hierarchical level of the replication hierarchy. The disclosed example methods further include, after registering the first leaf node with the first network node, replicating the multicast data to generate copies of the multicast data to be transmitted via respective unicast paths to respective ones of a plurality of leaf nodes, including the first leaf node, registered with the first network node to receive the multicast data.

Abstract: A method and an apparatus are provided, by which control in a virtual network is performed, in which resources of a network are modeled, wherein the control of the virtual network is carried out according to a first network protocol. Moreover, a network interface is provided between the virtual network and the network the resources of which are modeled. A control part of a network resource is provided in the virtual network, the control part and the network resource requiring a second network protocol for exchanging control signaling. Control information according to one of the first and second network protocols, which are destined to the network element, is encapsulated in control signaling of another one of the first and second network protocols, and the control signaling is sent to the on the network interface to a network control element, which de-capsulates the encapsulated control information from the received control signaling, and forwards the detected control information to the network resource.

Abstract: In accordance with one example embodiment, there is provided a system configured for virtual local area network (VLAN) blocking on a virtual port channel (vPC) member link to handle discrepant virtual network instance (VNI) to VLAN mappings. In other embodiments, the system can be configured for providing Virtual Switch Interface Discovery Protocol (VDP) and virtual switch enhancements to accommodate discrepant VNI to VLAN mappings. In another example embodiment, an apparatus is provided that includes a processor, and a memory coupled to the processor, where the apparatus is configured such that if a server is connected through a virtual port channel, a VDP is used to notify the server of different VNI to VLAN mappings. In another embodiment, the apparatus can extend a VDP Filter Info Field to carry a set of VLANs mapped to a VNI, keyed by leaf MAC addresses that serve as bridge identifiers.

Abstract: An entangled links mechanism to establish and maintain bipartite temporal intimacy between pairs of computers, using an idempotent, reversible token method which presents no observable external “change” until a communication of information needs to occur between the computers, and which maintains the potential for “bounded (or unbounded) reversibility” in case the intended information dispatched by a source computational entity is not captured or properly accepted by a destination computational entity. The mechanism enables distributed computers in a network to remain continuously aware of each other's presence; to communicate on a logically nearest neighbor basis in a secure and reliable manner in which packets passed over these links do not conflict with normal traffic or cause the available resources of the link to be exceeded; and that atomicity, consistency, isolation, and “reversible durability” may be maintained for transactions when perturbations occur.

Abstract: In one embodiment, a multiple spanning tree (MST) region is defined in a network, where the MST region includes a plurality of network nodes interconnected by links. A MST cluster is defined within the MST region, where the MST cluster includes a plurality of network nodes selected from the plurality of network nodes of the MST region. A network node of the MST cluster generates one or more MST bridge protocol data units (BPDUs) that present the MST cluster as a single logical entity to network nodes of the MST region that are not included in the MST cluster, yet enables per-multiple spanning tree instance (per-MSTI) load balancing of traffic across inter-cluster links that connect network nodes included in the MST cluster and network nodes of the MST region that are not included in the MST cluster.

Abstract: Various embodiments of inter-medium bridging are provided. In one aspect, a method may involve an inter-medium bridging device bridging between a plurality of mediums of a network connected to the first inter-medium bridging device at the Data Link Layer of the Open Systems Interconnection (OSI) model. The plurality of mediums may comprise at least a first medium and a second medium that comprise separate communications channels. The method may also involve the inter-medium bridging device facilitating communications between an external device and the network through an application interface of the first inter-medium bridging device.

Abstract: The system and method of the present disclosure relates to technology for a network system supporting multiple topology transparent zones (TTZs) on an edge node. TTZs have a topology including TTZ nodes consisting of edge nodes and internal nodes connected together by internal links. The edge nodes may also be connected to external nodes outside of the TTZ. The edge node is responsible for generating and distributing link state advertisements (LSAs) to generate virtual paths from the edge node to other edge nodes in each of the TTZs. Each TTZ sharing the edge node and each external node neighboring one of the other edge nodes of the TTZs is virtualized by distribution of the LSAs. However, the internal topology of each TTZ is concealed from each of the other TTZs sharing the edge node and from any neighboring external node connected to one of the other edge nodes.

Abstract: Data overhead of mesh-based multicast ad hoc routing protocols are controlled by adaptively adding redundancy to the minimal data overhead multicast mesh as required by the network conditions. The computation of the minimal data overhead multicast mesh is NP-complete, and therefore an heuristic approximation algorithm inspired on epidemic algorithms is employed to increase tractability of a solution. A mobility-aware and adaptive mesh construction algorithm based on a probabilistic path selection is provided, which is able to adapt the reliability of the multicast mesh to the mobility of the network. Simulation results show that the proposed approach, when implemented into On-Demand Multicast Routing Protocol (ODMRP), is able to offer similar performance results and a lower average latency, while reducing data overhead between 25 to 50% compared to the original ODMRP.

Abstract: The disclosed system and method receives, from a media device, a query fingerprint that includes an ordered sequence of frames of content being consumed, and matches the query fingerprint with frame fingerprints by determining a distance between respective frame fingerprints and corresponding ones of the ordered sequence of frames. The matching may be performed by populating a binary tree structure with respective distances, chronologically across leaf nodes of the binary tree structure, and then noting a value of the root node. If below a maximum threshold, then there is a match. The system and method may detect a channel change at the media device by traversing a right or a left sub-tree of the binary tree structure, and locating a low value (or a zero) at the first or second nodes of the sub-tree. This channel change may be useful in targeting media to content being streamed to the media device.

Abstract: In general, techniques are described for dynamically scheduling and establishing paths in a multi-layer, multi-topology network to provide dynamic network resource allocation and support packet flow steering along paths prescribed at any layer or combination of layers of the network. In one example, a multi-topology path computation element (PCE) accepts requests from client applications for dedicated paths. The PCE receives topology information from network devices and attempts to identify paths through a layer or combination of layers of the network that can be established at the requested time in view of the specifications requested for the dedicated paths and the anticipated bandwidth/capacity available in the network. The PCE schedules the identified paths through the one or more layers of the network to carry traffic for the requested paths. At the scheduled times, the PCE programs path forwarding information into network nodes to establish the scheduled paths.

Abstract: A base station apparatus communicates with a mobile station apparatus transmitting a data signal and a reference signal for channel estimation. The base station includes: a simultaneous transmission setting part which sets simultaneous transmission control information indicating whether or not to enable simultaneous transmission of the data signal and the reference signal, a transmission section which transmits the set simultaneous transmission control information to the mobile station apparatus; and a radio resource control section which determines whether or not to enable simultaneous transmission of the data signal and the reference signal on the basis of a power headroom which is notified from the mobile station apparatus, the headroom being a difference between the maximum transmit power value of the mobile station apparatus and a prescribed power value estimated for uplink transmission.

Abstract: A network includes an access point Wi-Fi Direct (AP WFD) device. The AP WFD device includes access point (AP) functionality. A plurality of client WiFi Direct (WFD) devices is coupled to the AP WFD device. The client WFD devices include client functionality. The AP WFD device is configured to synchronize the client WFD devices and to stream multimedia data to the client WFD devices.

Abstract: An array processor composed of processor cells that are programmed by a controlling unit, and that are reprogrammed when a cell has finished a current data processing operation, even while other cell continue to process data with their current programming.

Abstract: A method of constructing and maintaining a circle-mesh overlay network is disclosed. The method of constructing a circle-mesh overlay network includes: (a) determining a reference member number of a circle overlay by using a total number of participating peers; (b) creating a new circle overlay and adding member peers from among the participating peers to the new circle overlay in consideration of the reference member number; and (c) forming a circle-mesh overlay network by way of interconnection between the new circle overlay and a different circle overlay.

Abstract: A member device of a stacked switches system sends a first received unicast packet via an inter-group stack port which belongs to an aggregated stack link group on a forwarding path towards a different stack group when the first received unicast packet is to be egressed by another member device in the different stack group. The member device is further to send a second received unicast packet via an intra-group stack port on a forwarding path towards another member device in a same stack group when the second received unicast packet which is to be egressed by the another member device in the same stack group. The member device is further to send a third received unicast packet via a data port on the member device which associates with a egress port identification of the third received unicast packet when the third received unicast packet is to be egressed by the member device.

Abstract: A path calculation order determining method executed by a calculating apparatus for calculating a shortest path between a node pair in a network, using information on calculated shortest paths between other node pairs, the method including: a step storing calculated shortest path group information on shortest path groups each including calculated shortest paths from a starting node to one or more terminating nodes except the starting node, and topology information of the network, in a memory medium; and a calculation step of calculating shortest paths, starting from its starting node other than the starting node on the calculated shortest paths and having the most nodes that are located downstream therefrom, and terminating at nodes other than its starting node, using the calculated shortest path group information or the topology information for a path not included in the calculated shortest path group.

Abstract: Systems, methods and transitory computer-readable storage media for constructing a loop free multicast tree. The methods include observing a network topology transition affecting a first path from the particular node to a root node, calculating a second path from the particular node to the root node and sending a message to an upstream node requesting that the upstream node be a root port in the calculated second path. If the upstream node agrees to be the root port in the calculated second path, the method further includes creating a new FTAG tree topology view that includes the upstream node as the root port in the second path.

Abstract: Embodiments of the present invention provide an access method and apparatus in a heterogeneous network. The access method in a heterogeneous network include broadcasting a system message to a user equipment. The system message includes configuration information of a cell access port and configuration information of at least one group of hot spot access port, so that the user equipment accesses the cell access port or a hot spot access port according to the system information. The heterogeneous network includes at least one hot spot access port, the at least one hot spot access port is grouped into at least one group, and each group of hot spot access port includes at least one hot spot access port.

Abstract: A method for sending a Transparent Interconnection of Lots of Links (TRILL) data frame, comprising acquiring a user virtual local area network (VLAN) or a combination of a user VLAN and a user multicast medium access control (MAC) address in a first protocol packet, and a first port identifier; storing a correspondence there-between in a forwarding table; searching, according to the user VLAN or the combination of the user VLAN and the user multicast MAC address in a TRILL data frame received, the forwarding table for a second port identifier corresponding to the VLAN or the combination of the user VLAN and the user multicast MAC address in the TRILL data frame, and forwarding the TRILL data frame from a pseudo wire (PW) port corresponding to the second port identifier.

Abstract: Embodiments of the present invention provide a method, a device, and a system for creating a bidirectional multicast distribution tree based on an interior gateway protocol, the method includes: generating, according to a root address of a first node flooded by the first node through an IGP and a shortest path tree algorithm, a shortest path to another node with the first node as a source node, and constructing a flooding tree according to the shortest path; and when receiving layer 3 multicast group information flooded by an edge node, determining, according to the layer 3 multicast group information and a multicast group range that is supported by the first node, a flooding tree corresponding to each layer 3 multicast group, and performing pruning, according to the layer 3 multicast group information, to the flooding tree corresponding to each layer 3 multicast group, to generate a bidirectional multicast distribution tree.

Abstract: A method for operating a source node includes receiving a data path validation request command requesting validation of a path associated with a traffic flow identified in the data path validation request command, and determining a first hop sequence in accordance with the path being validated, wherein the first hop sequence is identical to a second hop sequence associated with a non-validation request packet associated with the path being validated. The method also includes generating, by the source node, a validation request packet in accordance with the data path validation request command, the validation request packet comprises route information associated with the first hop sequence, an alert flag set to a specified value, and a path validation header specifying processing performed by nodes receiving the validation request packet, and transmitting, by the source node, the validation request packet in accordance with the route information.

Abstract: Provided are a communication device and a communication system in which multi-hop communication is possible and management of communication routes is easy. In a distribution-system communication device 100, a port management means 132 is provided in a communication control unit 130, and each of ports provided in a port section 110 can be managed with the port management means 132 by IP addresses of adjacent stations connected to each of the ports. In a port management means 132 of a master station, correspondence information between port numbers of the port section 110 of each of the slave stations and the IP addresses of adjacent stations of a connection destination is input from the port management means 132 of each of the slave stations, and connection states between the ports of each of the slave stations can be managed based on the correspondence information.

Abstract: A method for summarizing topology transparent zone (TTZ) traffic engineering (TE) information, comprising computing a TE link state for every TE link internal to a TTZ from a root node to one or more non-root edge nodes, wherein the TE link state comprises the maximum bandwidth of the link, summarizing the computed TE link state information and storing the summary in a memory, and distributing at least a portion of the information in the summary to at least one neighboring node external to the TTZ connected to the root node via an external link.

Abstract: A communication system includes a first control unit configured to change setting of a communication node(s) belonging to a first hierarchical network, in response to a setting request for the first hierarchical network and to change a topology of a second hierarchical network formed by using the first hierarchical network, and a second control unit configured to change setting of a communication node(s) belonging to the second hierarchical network, using the topology of the second hierarchical network after the change.

Abstract: Automated comparison of Darwin Information Typing Architecture (DITA) documents for revision mark-up includes reading document data from first and second DITA documents into respective document object model trees of nodes, and identifying and collapsing emphasis subtree nodes in the trees into their parent nodes, the collapsing caching emphasis data from the identified subtree nodes. A traversal transforms the model trees into respective node lists and captures adjacent sibling emphasis subtree nodes as single text nodes. The node lists are merged into a merged node list that recognizes matches node pairs having primary sort key information and document structure metadata meeting a match threshold, with differences between matching tokens of the node pairs saved. A merged document object model built from the refined merged node list is transformed into a hypertext mark-up language document.

Abstract: A method and apparatus for handling data between a radio network and a service network, the data comprising Network Aware data. A gateway node in a mobile core network receives a message from the radio network. It then determines whether the message comprises Network Aware data. If it does, then the message is routed to a Packet Data Network Gateway node configured to handle Network Aware data. If it doesn't, then the message is routed to a Packet Data Network Gateway node for message handling. This ensures that non-Network Aware data is handled using regular message handling, and Network Aware data is handled by nodes configured to handle Network Aware data.

Abstract: One embodiment of the present invention provides a system that facilitates reconfirmation of resource records in a cache. The system starts by retrieving the resource record at a client and attempting to establish communication using the data in that resource record. In the event that communication is not successful, the system responds by issuing one or more queries for the resource record in question. The system then waits for a response to the query. If the response to the query is not received in a pre-determined amount of time, the system invalidates the resource record. The response from the device is a multicast response, thereby allowing other clients to update corresponding resource records in their local caches without querying the device, and thus saving network bandwidth.

Abstract: An apparatus and method for controlling bridge protocol data unit bursts is disclosed. The invention in the preferred embodiment is a switching device with a port enabled with a link management protocol and a burst control state machine. The burst control state machine is adapted to receive BPDUs and, under certain conditions, delay responding with its own BPDU falsely advertising itself as the new root bridge. The delay is preferably long enough to enable another bridge to identity the true root bridge. The delay, e.g., a burst control delay, is preferably equal to or less than a Hello time timer value generally defined to be 2 seconds in a Rapid Spanning Tree Protocol standard, for example.

Abstract: Systems, methods and apparatus for recovery from network changes. In some embodiments, a first network device may operating in a network comprising a second network device having a designated role according to at least one communication protocol. The first network device may detect a change relating to the second network device and determine whether the change is of a type among one or more selected types of changes. The first network device may further determine whether to inhibit operation of the first network device based at least in part on whether the change is of a type among the one or more selected types of changes.

Abstract: Disclosed are peer-to-peer group re-formation techniques. The techniques enable automatic reformation of a peer-to-peer group when the Group Owner (“GO”) device is lost. To do so, the techniques enable selection of a one of the peer devices in the peer-to-peer group as a next GO device responsive to detecting the loss of the original GO device. Then, the peer device selected as the next GO device automatically activates as the GO device, while the other peer devices scan for and connect to the next GO device.

Abstract: Techniques are identified for optimizing the MAC flush in Ethernet rings for faster traffic restoration. In one embodiment, flushing of MAC addresses is performed only once on receiving a first control message. For example, when a first control message is received, a network device may switch from a first state to a second state, which may indicate that the MAC addresses are not to be flushed if additional control messages are received. In another embodiment, flushing of MAC addresses is performed on one ring port rather than on both ring ports. For example, a flag field of a control message header may be used to determine on which port to flush. In another embodiment, flushing of MAC addresses is performed on only one ring port of an interconnection node. For example, the ring port can be determined using a flag field and possibly labels associated with the ring ports.

Abstract: Communication devices and methods thereof are provided. In one embodiment, the method comprises the communication device receiving information from one of a first carrier which indicates a second carrier carries a point-to-multipoint data, and the communication device determining to receive the point-to-multipoint data according to the received information.

Abstract: In a mesh-based connected data center network architecture, a mechanism is provided to allow efficient delivery of IP multicast frames within the network. Described approaches avoid replication into VLANs (or SVIs) across the fabric by using the outer encapsulated tree to identify trees on which to replicate the traffic. Replication may be performed at the furthest point from the source (via routing or bridging). Also, multicast traffic may be distributed to dually connected (vPC) hosts on links from various network devices.

Abstract: A machine has a bus, an input port connected to the bus to receive inbound network traffic, an output port connected to the bus to convey outbound network traffic and a processor complex connected to the bus. The processor complex is configured as a pipeline with individual processor cores assigned individual network traffic processing tasks. The pipeline includes a first set of processor cores to construct network traffic trees characterizing the inbound network traffic and the outbound network traffic. Each network traffic tree characterizes traffic type and traffic rate. A second set of processor cores enforces network traffic policies utilizing the network traffic trees. The network traffic policies apply traffic rate control by traffic type for the inbound network traffic and the outbound network traffic.

Abstract: Session data for sessions associated with user equipment in portions of a macrocellular coverage area is accessed and a hierarchical data structure including a plurality of levels is generated. Each entry in a higher level of the plurality of levels encompasses a predetermined number of entries in the next lower level and stores aggregated session data for sessions associated with the encompassed entries. Entries in the hierarchical data structure can be selected to represent a hotspot that overlays the macrocellular coverage area. Session data stored in the selected entries can be aggregated.

Abstract: The disclosed system and method receives, from a media device, a query fingerprint that includes an ordered sequence of frames of content being consumed, and matches the query fingerprint with frame fingerprints by determining a distance between respective frame fingerprints and corresponding ones of the ordered sequence of frames. The matching may be performed by populating a binary tree structure with respective distances, chronologically across leaf nodes of the binary tree structure, and then noting a value of the root node. If below a maximum threshold, then there is a match. The system and method may detect a channel change at the media device by traversing a right or a left sub-tree of the binary tree structure, and locating a low value (or a zero) at the first or second nodes of the sub-tree. This channel change may be useful in targeting media to content being streamed to the media device.

Abstract: Methods, devices and a system for transmitting an SRS and a UE are provided. A network node transmits an SRS configuration information set to a UE, wherein the SRS configuration information set includes first configuration information indicating the configuration of a first SRS and second configuration information indicating the configuration of a second SRS, wherein the first SRS is transmitted on a cellular uplink and used for performing uplink channel measurement during cellular communication; and the second SRS is transmitted on a D2D link and used for performing channel measurement of the D2D link during D2D communication. The solution addresses the problem of the configuration and the transmission of a reference signal existing in the conventional art when D2D communication is introduced into a cellular system, realizes the compatibility of D2D communication with cellular communication and avoids the noticeable increase in UE design and realization complexity.

Abstract: A method in a network utilizing a distributed connection-oriented control plane includes signaling a first path for a first connection from a first source node; storing call information for the first connection at any intermediate nodes in the first path; signaling a second path for a second connection from a second source node; checking at any intermediate nodes in the second path if there is absolute route diversity between the first connection and the second connection responsive to a requirement therein; and responsive to detecting a diversity violation at an intermediate node of the any intermediate nodes in the second path, signaling a crankback to the second source node with the call information for the first connection included therein; and recomputing the second path exclusive of the first path based on the call information responsive to receiving the crankback. A network and node are also described.

Abstract: A method for determining required routes through an Ether based network associated with VLANs by determining a set of spanning trees. The set of spanning trees is determined to provide a number of routes for consideration. Each spanning tree comprising a plurality of links, sorts the VLANs into an order based on one or more VLAN criteria for the network topology, and maps the sorted VLANs onto the set of spanning trees in an order to optimise one or more characteristics relating to the combination of spanning tree and VLAN to determine an optimised VLAN tree mapping for each set of spanning trees for each route. A best primary tree for each route is selected. Possible failures for each link in the best primary tree for each route are analyzed to derive for a backup tree optimised to determine one or more best backup trees in the event of a possible failure.

Abstract: A virtualization manager executing on a processing device adds a host to a list of hosts associated with the virtualization manager. The virtualization manager identifies a list of external VMs running on the host that are not managed by the virtualization manager. The virtualization manager obtains detailed information for each of the external VMs running on the host from an agent running on the host. The virtualization manager then manages the external VMs running on the host using the detailed information.

Abstract: In one embodiment, a method includes splitting a plurality of physical ports distributed across multiple distributed line cards (DLCs) into a plurality of virtual switches, wherein each virtual switch comprises ports of one or more DLC, creating a virtual control domain (VCD) associated with each virtual switch, and autonomously controlling the virtual switches, wherein each DLC is in electrical communication with at least one switch fabric coupler (SFC), and wherein the plurality of physical ports appear to external devices as being part of a single cell switched domain. Other systems and methods are described according to more embodiments.

Abstract: A method for providing Link Aggregation Control between a plurality of systems adapted for Link Aggregation is provided. The plurality of systems includes a primary system, a first secondary system, and a second secondary system. The primary system comprises first primary ports being linked to first ports of the first secondary system by first links. Further, the primary system comprises second primary ports being linked to second ports of the second secondary system by second links. The method comprises forming a link aggregation group, wherein the link aggregation group includes at least one first link and at least one second link. A preferred system among the secondary systems having links within the link aggregation group is selected and further, the method comprises setting the status of the primary ports according to the selection of the preferred system.

Abstract: Methods, systems and computer readable media for quality of service aware hybrid multicast networks are described. A method can include receiving a request for content from a first receiver and initiating a quality of service aware hybrid tree construction by sending a multicast service level specification message to a first overlay tree manager. The method can also include dividing the tree at the overlay tree manager and communicating with other overlay tree managers in the network. The method can further include computing, at each overlay tree manager, a shortest path tree using a constrained algorithm and sending, from each overlay tree manager, a message to each IP manager in the network requesting that the IP managers construct an IP multicast tree and install the tree on one or more corresponding routers. The method can also include enforcing multicast routes and quality of service on the one or more routers.

Abstract: In one embodiment, a system includes at least one distributed line card (DLC) in electrical communication with at least one switch fabric coupler (SFC) and a meta-controller in electrical communication with the at least one DLC, the meta-controller including a processor for executing logic, logic configured for creating more than one virtual switch and a corresponding virtual control domain (VCD) associated with each virtual switch, wherein each virtual switch includes a plurality of physical ports of one or more of the at least one DLC, and logic configured for autonomously controlling the virtual switches, wherein the system appears to a device external of the system as a single cell switched domain. Other systems are described according to more embodiments.

Abstract: Node, computer software and method for selecting a resource that is available at multiple caches connected in a communication network. The method includes receiving from a user a request for the resource; identifying one or more caches of the multiple caches that store the resource; determining a total cost associated with a path between the user and each cache of the one or more caches storing the resource, the total cost including a static cost that reflects a topology of the communication network and a dynamic cost which is indicative of changing conditions of the communication network; and selecting one cache from the one or more caches that store the resource based on a lowest total cost of the one cache.

Abstract: A radio communication base station allocates the same radio resource as a radio resource used for communication between the radio communication base station and a radio communication terminal in other radio communication base station to be a radio resource used in the other radio communication base station for communication between the other radio communication base station and the radio communication terminal. The radio communication base station includes a control unit that performs control to allocate a radio resource used for communication between a radio communication terminal moving at at least a predetermined speed and the other radio communication base station on a priority basis in accordance with content of service in the communication.

Abstract: Service discovery for services on a wireless network is presented. It is determined (e.g., from a received Layer 2 message) that an offering apparatus h made a service available to entities joined to a wireless network. Then in a message, that is available to entities not joined to the network, is placed information about the services and also at least one of location information about the offering apparatus and link metric information about a network path to the offering apparatus. A discovering apparatus reads one or more transmitted messages (from different apparatuses in the same network in different networks), sees the service it wants is available through both, compares the different locations and/or the different link metrics, and based on the comparing chooses which network to join, or with which apparatus on the single network to create a peer link.

Abstract: A clustering-based method of estimating a network metric between a first node and a second node includes determining source clusters of nodes and destination clusters of nodes for each node. Cluster heads are selected for each cluster. Measurements of the network metric between each node and each cluster head for the source clusters and destination clusters are performed, and the network metric for a pair of nodes is estimated based on the measurements for the pair of nodes.

Abstract: A method for transmitting messages in a redundantly operable communication network which includes a first subnetwork with a tree topology and a second subnetwork, wherein messages are transmitted in the first subnetwork in accordance with a spanning tree protocol.