Abstract: A communications system is provided for emergency services personnel that includes a plurality of portable devices and a base station. The portable devices are configured to be carried by emergency services personnel while at an emergency site. The portable devices each have a first transceiver configured to communicate over a first network and a second transceiver configured to communicate over a second network, where the first and second networks operate independent of one another. For example, they may have at least one of different first and second carrier frequencies, protocol, channels and the like. The base station has at least one transceiver for communicating with the portable devices over at least one of the first and second networks. Optionally, the first and second networks may have different transmission characteristics, such as different transmit ranges, power levels and the like.

Abstract: The present invention provides the steps of maintaining a first database containing profiles of a plurality of users in a network; maintaining a second database containing relationship index between some of the users wherein the relationship index is determined based upon degree of correspondence relationship between the users; forming a social network comprising a plurality of nodes and a plurality of links between at least some of the nodes, in association with the relationship index stored in the second database; upon receipt of a request from a first user, searching for at least one route connecting the first user to a second user in the social network based, at least in part, upon said existing links and the relationship index of the links; and evaluating each of the searched routes based, at least in part, upon the relationship indexes of the links which form said respective searched routes.

Abstract: A network administration system for triggering commands in response to receipt of error logs, comprising a user interface for programming execution sets of commands in association with predetermined error logs, and means for receiving error logs and for each of the predetermined ones of the error logs triggering execution of the commands in the execution sets.

Abstract: A network includes a plurality of wirelessly interconnected self-organizing network (SON) devices for relaying signals in a self-organizing network and a field device for originating output signals. The sensor is configured to transmit the output signals to at least one of the SON devices, and the SON devices do not originate signals but only relay signals originated externally. At least one of the SON devices is self-powered by harvesting energy from an adjacent energy source.

Abstract: Systems and methods for providing fractional bandwidth communication channels in classes of service that do not normally support these types of channels. In one embodiment, a method comprises receiving one or more frames, wherein each frame contains non-QoS header information, classifying the one or more frames based on the corresponding non-QoS header information and scheduling delivery of the one or more frames based upon corresponding frame classifications, wherein frames in classifications corresponding to QoS circuits are scheduled in a manner that meets QoS requirements associated with the QoS circuits. When the frames are classified, they are forwarded to dynamically allocated queues corresponding to the respective classifications. Frames are scheduled for delivery from the queues according to a modified bin-filling algorithm that is designed to meet the QoS requirements of the respective circuits. This method may be implemented, for example, in a Fibre Channel Class 2 or Class 3 fabric.

Abstract: In an unstructured overlay network, each node in the network periodically tests logical network links among neighboring nodes to determine whether the links should be reorganized. A Metropolis scheme is used to determine the probability with which the links are reorganized. This probability is computed based on the change in link costs and/or node degrees that would be effected by a proposed reorganization. The Metropolis scheme tends to maintain a consistency among the degrees of the nodes, thereby providing strong failure resilience.

Abstract: A system and method for dynamically updating service information from a service provider to a data terminal in an access point network wherein an access point requests service information from a local server; in response, the access point receives service information from the local server. Subsequently, the access point maps the service information to a link-level communication Service Discovery Protocol (SDP). The access point then sends the mapped service information to a data terminal.

Abstract: A personal multimedia communication system and network for emergency services personnel includes a plurality of personal communication systems linked together and to a base station in a network. Each personal communication system includes a PDA device mounted on a PASS control console, a video camera mounted on the PDA device, a GPS unit, a microphone, and other electronic devices. The various electronic devices are all communicatively connected to the PDA device. Data from the various devices may be collected in the PDA device and wirelessly transmitted to any other node or device in the network, including other personal communication devices. Each personal communication device may serve as a repeater, thus providing a wireless communications link between a device located out of range of the base station.

Abstract: A channel merging method for a VOD system, said method comprises the steps of: in response to requests from a plurality of clients for a video program, establishing a root channel (S1) and at least one sub-channel (S11), said root channel (S1) being established according to a request from a client that makes the earliest request, each of said sub-channels (S11) being established in response to a request from a client that makes a later request; and monitoring variation of the number of the clients that are using each of said established channels, and maintaining the channel if the number of the clients using the monitored channel is not zero, and closing the channel if the number of the clients using the monitored channel becomes zero.

Abstract: Systems, methods, and software for guiding electronic connections between nodes of a computer system are disclosed. A system includes a plurality of servers, each having a plurality of connection ports and a service processor in electronic communication with the connection ports. A plurality of selectively-operable visual indicators are included, each associated with one of the connection ports. One of the service processors controls operation of the visual indicators according to a sequence of electronic connections to be made between the connection ports. Computer usable program code accessible by one of the service processors may be included for selectively operating visual indicators associated with the connection ports according to the sequence of connections to be made between the servers.

Abstract: Methods and apparatus for implementing an access list key for accessing information associated with a packet from an access list are disclosed. The packet includes an IP source address field and an IP destination address field, the IP source address field including an IP source address and the IP destination address field including an IP destination address, the IP source address and the IP destination address each having a number of bits (e.g., 128 bits in the case of IPv6). An IP source address is obtained from the IP source address field of the packet and an IP destination address is obtained from the IP destination address field of the packet. A modified IP source address is generated from the obtained IP source address such that the number of bits in the modified IP source address is less than the number of bits in the obtained IP source address.

Abstract: In one embodiment, a router is deployed on a local area network (LAN) in addition to any routers deployed on a wide area network (WAN) coupled with the LAN having the router. A service management device is coupled between the two routers. The service management device provides management processing, for example, quality of service (QoS) processing, traffic shaping, type of service (ToS) processing, or class of service (CoS) processing. For messages between devices both coupled to the WAN router, the WAN router sends the messages to the LAN router. The LAN router then routes the messages back to the WAN router through the service management device, which provides management processing. The WAN router then sends the processed message to the destination device.

Abstract: Stream data is transmitted from a distribution server to a client without any loss of data. The capacity of a reception buffer to be prepared at the client can be made small and the network bandwidth necessary for data redistribution can be narrowed. A relay server interposed between the distribution server and client buffers stream data in an auxiliary storage device. When the relay server or client detects a loss of stream data, a redistribution request is transmitted to the distribution server or another relay server at the preceding stage.

Abstract: A control program for a co-processor in a video-on-demand system directs the co-processor to perform the steps of: a) obtain a transmission control list, from an external source, which identifies a group of several video data packets and a respective subgroup of internet protocol headers for each video data packet in the group; b) partition into pieces, each video data packet and its respective subgroup of internet protocol headers as identified by the transmission control list; and, c) send the partitioned pieces, along with an additional header for each piece, to an output port during a series of spaced apart time intervals.

Abstract: The principles of the present invention provide for using directional antennas to adaptively communicate in a wireless mesh network. A number of infrastructure components are included in a wireless mesh network environment. Each infrastructure component includes an omni-directional antenna and one or more directional antennas (e.g., electronically steered phased array antennas) that can be used to communicate with other infrastructure component and wireless devices. Directional antennas can utilize one or more directional beams that can be directed towards an infrastructure component or wireless device to communicate with the infrastructure component or wireless device. Infrastructure components can adapt to communicate with the same destination through different intermediary infrastructure components. Since the signal strength of a directional beam can be greater than that of an omni-directional antenna of the same gain, infrastructure components can be separated by greater distances.

Abstract: The disclosure details the implementation of an apparatus, method, and system for an network selector for datacasting in hybrid networks (NSDHN). In one aspect, the disclosure teaches an efficient delivery decision mechanism that takes into account efficiencies that may be achieved by employing one network delivery system over another for any given area. In another aspect, the disclosure teaches how to dynamically select the bearer for IP multicast data delivery in hybrid networks. Also, the disclosure teaches a network delivery selector based on Simulated Annealing and genetic algorithms. The network delivery selector provides an extremely fast mechanism to establish an optimal delivery bearer dynamically. This allows the network delivery selector to combine unicast, multicast and broadcast network bearers in the same hybrid network to exploit their combined best properties and serve as many users as possible.

Abstract: A system and method for providing the ability to selectively share data in a network routing device with an associated host. The system and method employs a hardware firewall in the routing device which restricts the host such that it can only access areas in shared memory which contains data destined for the host. The routing device CPU notifies the host of pending data and the location of that data in the shared memory. The hardware firewall is also notified of the location in shared memory which the host may access. When the host attempts to read the data, the firewall ensures that only the stated memory area or areas are accessed by the host. Once the data has been read by the host, the firewall is notified to cancel the host's ability to access the shared memory until such time as a new packet destined for the host arrives in the routing device.

Abstract: A system for balancing network loads among a group of computer servers. A load balancing module is provided for each server and includes multiple network ports for receiving network traffic and coupling messages to its server or to another module. The interconnect map for the modules is automatically determined by a topology discovery system and maintained by a topology update system. Each module monitors the loading and health of its server and provides this information to the other modules. One or more master modules are directly connected to an external network and route received traffic to their own servers and other servers through other modules or a networking switch based on a priority system. The priority system may be based on dynamic conditions of server capacities and current loading.

Abstract: A network address server is configured to resolve a target network address name label with a network address, with the target address name label defining a branch of one level of a multi-level network address name space. The network address server is one of a plurality of network address servers each being uniquely associated with a respective region of the address name space level. The network server includes an address name database, and an address name processor in communication with the address name database for providing a response to a query for the network address corresponding to the target address name label. The address name database includes a number of database records, each identifying a unique address name label and a network address uniquely associated with the address name label.

Abstract: A complex adaptive routing system and method for routing data packets in a nodal network, in particular, an ad-hoc nodal network. Each data packet contains data representing its routing strategy for routing to a destination node. When a node receives the data packet, it executes an agent program to determine the best route for routing the data packet to its destination node based on the routing strategy and other factors, such as the current conditions of the nodes and paths to the nodes. The agent program updates the strategy data in the data packet, as well as the routing table of the node, before the node sends the data packet to the next node in the selected route. The system and method therefore enables the data packet routing decisions to be dynamically adapted to changing conditions in the network.

Abstract: A method of reducing bandwidth limitations to send events to a set of interested clients within a pre-defined time period as quickly and fairly as possible. The clients can be re-distributed among the servers in a network such that the delay due to server overloading is minimized by moving clients from an overloaded server to a server with available bandwidth. In addition, the latency of client-server communications can be incorporated into an estimation of download times, and the servers can then initiate delivery to respective clients based on those download times. By staggering the send times to account for heterogeneous latencies, more clients can receive the event at the same time, and a fairness of distribution can be achieved.

Abstract: A computer-implemented method and system is disclosed in which a network-based interaction environment includes a plurality of peer-to-peer nodes being able to communicate directly with each other using a peer-to-peer protocol and a peer-to-peer client application, the plurality of peer-to-peer nodes including a first peer-to-peer client and a second peer-to-peer client, a first peer-to-peer client application running on the first peer-to-peer client to maintain persistent buddy information on the first peer-to-peer client, the persistent buddy information including a buddy list identifying trusted peer-to-peer nodes of the plurality of peer-to-peer nodes, and a second peer-to-peer client application running on the second peer-to-peer client to maintain persistent reputation information on the second peer-to-peer client, the persistent reputation information including information related to the reputation of the first peer-to-peer client in the network-based interaction environment.

Abstract: A system and method of controlling a distributed processing system such as a including a first computer that includes a first Java virtual machine and a Java control system that also includes a look-up service. The distributed processing system also includes a second computer that includes a second Java virtual machine and a second Java control system client. The distributed processing system also includes a computer network that couples the first computer and the second computer. The second computer can be configured to register with the look-up service for a first predetermined time period. The second computer registration is examined to determine if the second computer registration will be renewed with the look-up service for a subsequent predetermined time period.

Abstract: Embodiments of a shared resource distributed index mechanism that peers in a peer-to-peer network may utilize to distribute index entries corresponding to resources to indexes of shared resources among one or more other peers. These indexes may be used to direct queries to peers where the queries are most likely to be answered. When a query is received by a rendezvous peer including one or more indexes, contents of the query may be “looked up” in the index to find matches. The results of the lookup may include information on one or peer(s) that may hold advertisement(s) to the resource requested by the query. The query may then be forwarded to one or more peers that may hold the advertisement for the resource. Embodiments may provide “loosely-coupled” distribution of index entries for use in querying for resources in the peer-to-peer network.

Abstract: A personal multimedia communication system and network for emergency services personnel includes a plurality of personal communication systems linked together and to a base station in a network. Each personal communication system includes a PDA device mounted on a PASS control console, a video camera mounted on the PDA device, a GPS unit, a microphone, and other electronic devices. The various electronic devices are all communicatively connected to the PDA device. Data from the various devices may be collected in the PDA device and wirelessly transmitted to any other node or device in the network, including other personal communication devices. Each personal communication device may serve as a repeater, thus providing a wireless communications link between a device located out of range of the base station.

Abstract: A network isolation apparatus is provided that permits data to be sent to a remote computer or network without a return path so that the isolated sensitive network may not be compromised. The isolation device spoofs the network so that the network believes it has a fully functional external connection. The invention has a first media converter for receiving data from a workstation on a sensitive network; this data is then passed to a second media converter and then transmitted to a remote computer. An optical signal generator sends signals to the workstation to imitate a standard transmit and receive connection, and also sends signals to the second media converter to imitate a standard transmit and receive connection. No physical connection exists for the remote computer workstation to compromise the sensitive network.

Abstract: A method of channel routing. The method includes receiving an incoming connection, determining an amount of processing resources required to handle the incoming connection, and selecting a remote access server to handle the incoming connection, responsive to the determined amount of processing resources.

Abstract: A system includes a weighted directional dependency graph defining one or more dependency links in a distributed system having a plurality of nodes. A weight is defined for each of the dependency links. A node ordering module generates a node order based on a cycle-cut set identifying at least one of the dependency links that is part of a cycle in the weighted directional dependency graph to create an output directional dependency graph. A method for ordering a plurality of decision nodes in a distributed system includes generating a weighted directional dependency graph, determining a cycle-cut set identifying one or more dependency links that are part of a cycle in the weighted directional dependency graph, and ordering the plurality of decision nodes based on the cycle-cut set.

Abstract: A communication device (111) determines whether to operate as a cluster head in a network of communication devices (100). The device performs a self-assessment regarding its ability to operate as a cluster head based on a formula that assigns weights to factors related to its capabilities and preferably its environment (410, 420, 430). The ability of the device is combined with a random value component in determining whether to operate as a cluster head (440). In the preferred embodiment, upon assumption of cluster head status, the device communicates with neighboring devices to signal its cluster head status, and to invite others to participate in the formation of a cluster.

Abstract: Embodiments of a decentralized mechanism for detecting the presence of entities in a peer-to-peer network. In one embodiment, using pipes, a peer may uniquely and independently generate an identity for a peer-to-peer network entity. The identity may be used to probe the peer-to-peer network for presence of instances of the corresponding entity on other peers regardless of which peer the identity was generated on and without using a central identity repository or presence system. In one embodiment, net crawling may be used to map identities and resolve the locations of instances of the corresponding entities. An entity may move anywhere on the network, and the decentralized mechanism for detecting entity presence may be used to locate the instance(s) of the entity.

Abstract: Methods, systems, and computer program products for generating a data stream for broadcast to one or more client systems. A source identifier identifies where the data for the data stream may be obtained. Scheduling information associated with the identifier determines when the data should be added to the data stream for broadcast. The data is requested and received from the data source using the identifier and added to the data stream to arrive at the one or more client systems in accordance with the scheduling information. The generated data stream may comprise one or more sub-streams. The scheduling information may be checked or validated to assure consistency and accuracy. Client systems may simultaneously receive data, including real-time data, from multiple sources.

Abstract: A network can be organized for providing virtual private network services to customers into two regions. A network core for providing layer 2 transport and an associated number of logical provider edges. Each logical provider edge is partitioned into first and second portions. The first portion provides virtual private network services to customers. The second portion works with the core network to communicate with any other logical provider edge within the network. The first portion designated as the PE-Edge includes a group of functions such as a function for configuring optical Ethernet layer 2 virtual private network service, a function for service labeling, a function for ingress traffic management, and a function for information exchange between local VPN and core VPN.

Abstract: A network interface adapter includes a network interface, coupled to send and receive data packets over a network and a host interface, for coupling to a host processor and to a system memory associated therewith. The system memory contains context information with respect to a plurality of transport service instances used to send and receive the data packets over the network, each of the data packets belonging to a respective one of the service instances. Packet processing circuitry, coupled between the network interface and the host interface, processes the data packets using the context information of the respective service instances. A cache memory associated with the packet processing circuitry is coupled to load from the system memory and store the context information of the respective transport service instances for the data packets being processed by the packet processing circuitry.

Abstract: A distributed file server system has multiple data servers connected to stream data files continuously over a network to multiple clients. Data files are distributed across the data servers so that data blocks of the data files are stored at each of the data servers. A scheduler is located at each of the data servers to manage distributed portions of a schedule. Each data server sees a different portion of the schedule, but no one data server sees the whole schedule. The scheduler facilitates service of requested data streams from its corresponding data server according to a schedule portion that is available to the data server. The scheduler determines whether to insert a new data stream into the current slot it presently owns in its schedule portion, or to wait for a subsequent slot in the schedule based on a thrifty policy.

Abstract: A method and system for multi-tracking among independent individuals without a monitoring center, where an individual is a person, a vehicle, or any other property, enables the individuals to be networked in a group and each individual to search and track other individuals of interest. The portable multi-tracking system is also capable of tracking personnel inside a building, where a self-contained positioning device provides continuous carrier's position information. In the open area a GPS (Global Positioning System) unit is activated to provide precision absolute position data which can be blended with the self-contained data to improve the accuracy and robustness of the positioning services. Thus the present invention provides excellent position tracking outside a building.

Abstract: A method and system for the simple, fast, and effective maintenance of consistent data files across a multiplicity of computer systems, which functionality is useful in collaborative work, effective backup, and disaster recovery. Consistency is maintained using secure file storage remote from any number of clients the files on which are automatically synchronized consuming minimal network bandwidth. Automated bi-directional “one-click” synchronization is implemented via a method that is neutral with respect to platform, operating system, firewall, and network configuration. The software product based on the invented method has the substantial advantage of installation, setup, and operation all without intervention by system administrators.

Abstract: In a distributed file system, when a user requests a computer to create a distributed file, a management computer acquires a list of computers complying with an allocation rule selected by the user from allocation rules taking the performance, security level, reliability level and utility rate into consideration. When the user requests the computer to access the distributed file, on the other hand, the partial files and the server information are collected from each computer. Each computer evaluates the allocation of the partial files based on the selected allocation rule and the server information from each computer, and if required, selects a destination computer and instructs the partial files to be moved to the destination computer.

Abstract: A scalable video transmission scheme is provided in which client interaction and video content itself are taken into consideration during transmission. Methods and arrangements are provided to prioritize/classify different types of information according to their importance and to packetize or otherwise arrange the prioritized information in a manner such that lower priority information may be dropped during transmission. Thus, when network congestion occurs or there is not enough network bandwidth to transmit all of the prioritized information about an object, some (e.g., lower priority) information may be dropped at the server or at an intermediate network node to reduce the bit rate. Thus, when the server transmits multiple video objects over a channel of limited bandwidth capacity, the bit rate allocated to each object can be adjusted according to several factors, such as, e.g., information importance and client interaction.

Abstract: A system and method are provided to remotely activate options resident on a multi-vendor supported device. The technique includes receiving, at a centralized facility, an activation key sent from a first location and configured to activate an option of an in-field device located in a second location, and sending the activation key and a verification script, from the centralized facility, to the in-field device at the second location. The technique also includes receiving, at the centralized facility, a report generated by the verification script and, if the report is satisfactory, installing the activation key in the in-field device to activate the option and, if the report is not satisfactory, aborting activation of the option.

Abstract: A network interface device provides a fast-path that avoids most host TCP and IP protocol processing for most messages. The host retains a fallback slow-path processing capability. In one embodiment, generation of a response to a TCP/IP packet received onto the network interface device is accelerated by determining the TCP and IP source and destination information from the incoming packet, retrieving an appropriate template header, using a finite state machine to fill in the TCP and IP fields in the template header without sequential TCP and IP protocol processing, combining the filled-in template header with a data payload to form a packet, and then outputting the packet from the network interface device by pushing a pointer to the packet onto a transmit queue. A transmit sequencer retrieves the pointer from the transmit queue and causes the corresponding packet to be output from the network interface device.

Abstract: A method for multicasting a message in a computer network is described, in which at least some nodes of a multicast group transmit fault recovery information to other nodes of the group in addition to, or as part of, the message itself. The fault recovery information allows nodes to determine what dissemination responsibility should be assigned to successor nodes in the event that one or more nodes of the multicast group fail.

Abstract: A method of reducing bandwidth limitations to send events to a set of interested clients within a pre-defined time period as quickly and fairly as possible. The clients can be re-distributed among the servers in a network such that the delay due to server overloading is minimized by moving clients from an overloaded server to a server with available bandwidth. In addition, the latency of client-server communications can be incorporated into an estimation of download times, and the servers can then initiate delivery to respective clients based on those download times. By staggering the send times to account for heterogeneous latencies, more clients can receive the event at the same time, and a fairness of distribution can be achieved.

Abstract: A method and system that includes an IP flow monitor in conjunction with an IP route comparator and an IP route injector to minimize the size of routing tables that need to be stored in a router of an IP network. The IP flow monitor monitors information, such as destination information that identifies and differentiates one IP flow from another. The monitored information is passed to the IP route comparator, which determines if it has stored preferred path information for the IP flow identified by the monitored information. If so, the preferred path information is passed to the IP route injector, which in turn passes it to the router in the edge network. The router updates it routing table in accordance with the new routing information. Other described embodiments include an embodiment having a cache and embodiments in which one or both of the IP route comparator and the IP route injector are local to the network (instead of being local).

Abstract: Various embodiments of a scalable routing system for use in an interconnection fabric are disclosed. In this routing scheme, a routing directive describes a route in the interconnection fabric between a sending node and a destination node. Either the sending node or a sending device connected to the sending node encodes the routing directive in a message to be sent to the destination node. The routing directive may include a variable number of segments. Each segment includes a distance component and a direction component that tell each node along the route how it should send the message. Generally, each distance component describes a distance in the interconnection fabric while each direction component specifies a direction in the interconnection fabric.

Abstract: Peer devices register with a resource locator service so that the peer devices can be uniquely identified in a networking environment. An addressing scheme addresses a peer resource in the networking environment based on the unique identifier of a peer device that is a master publisher of the resource. Based on the addressing scheme, the resource locator service can track the location of the master publisher of the resource as well as additional locations of peer devices that have cached the resource and made it available. In various embodiments, the resource locator service can service requests for peer resources by providing a list of locations where the resource is expected to be available or, in the case of non-compatible requester, provide access to the resource itself.

Abstract: A serverless name resolution protocol ensures convergence despite the size of the network, without requiring an ever-increasing cache and with a reasonable numbers of hops. This convergence is ensured through a multi-level cache and a proactive cache initialization strategy. The multi-level cache is built based on a circular number space. Each level contains information from different levels of slivers of the circular space. A mechanism is included to add a level to the multi-level cache when the node determines that the last level is full. A peer-to-peer name resolution protocol (PNRP) includes a mechanism to allow resolution of names which are mapped onto the circular number space through a hash function. Further, the PNRP may also operate with the domain name system by providing each node with an identification consisting of a domain name service (DNS) component and a unique number.

Abstract: A system provides secure communication of commands from a client (600) to multiple hosts (1200) via a network server (700). The system receives at least one command from the client (600), initiates one or more remote execution processes (1040) for processing the at least one command, and transmits the at least one command to one or more of the hosts (1200) via the one or more remote execution processes (1040). The system obtains, from the one or more remote execution processes (1040), data associated with the one or more hosts (1200) executing the at least one command, formats the data, and sends the formatted data to the client (600).

Abstract: A system that enables decentralized management of a composite e-service by obtaining information which is useful for management of the composite e-service even when the arrangement of e-services that make up the composite e-service are dynamically changing. The system includes mechanisms for generating a set of management information for each of a set of service interactions among the e-services that currently make up the composite e-service. The system includes mechanisms for transferring the sets of management information up a tree structure of the composite e-service to an e-service in the tree structure that provides a portal to the composite e-service. The system also includes mechanisms for combining the management information at each level of the tree structure.

Abstract: A method for performing end-to-end “tree-based ordered multicasting” (TOM) which ensures collective integrity and consistency of distributed operations, and which is applicable to distributed multiparty collaboration and other multipoint applications. The TOM protocol performs cascaded total ordering of messages among on-tree hosts en route from senders to receivers, and does not require the building of a separate propagation graph to compute ordering information. TOM elects sequencer nodes dynamically based on address extensions of the multicast tree. Message ordering is performed by multicasting a message from each source node to receivers, unicasting a control message from a source node across a primary node to an ordering node for the designated multicast group or transmission in the tree, determining a binding sequence number for the message and a multicast to the receiver group, and delivering messages at end hosts according to the agreed-upon sequence numbers.

Abstract: A method and device thereof for managing messages received at a bridging device. A bridging device receives a first message comprising a first contact information and a first distance vector representing a first number of hops the first message has traversed. The first distance vector is compared to a stored second distance vector corresponding to a stored second contact information for the remote electronic device, wherein the second contact information and second distance vector are provided by a second message. The second distance vector represents a second number of hops the second message has traversed. Provided the first number of hops is greater than the second number of hops, the first message is discarded. Alternatively, provided the first number of hops is not greater than the second number of hops, the second contact information and second distance vector are discarded and the first contact information and first distance vector are stored on a computer- readable memory of the bridging device.