Journal of Algorithms
Single path routing with delay considerations
Computer Networks and ISDN Systems
Journal of Algorithms
Performance of an adaptive fault-tolerant routing algorithm for multicast communications
NOC '96 Proceedings of the European conference on Networks & optical communications II : ATM, networks and LANs: ATM, networks and LANs
Fault-tolerant linear broadcasting
Nordic Journal of Computing
Automatic Network Clustering for Fast Path Selection
Proceedings of the IFIP TC6/WG6.4 Fifth International Conference on High Performance Networking V
Routing in Ad Hoc Networks of Mobile Hosts
WMCSA '94 Proceedings of the 1994 First Workshop on Mobile Computing Systems and Applications
An integrated multicast connection management solution for wired and wireless ATM networks
IEEE Communications Magazine
Distributed center-location algorithms
IEEE Journal on Selected Areas in Communications
Performance and resource cost comparisons for the CBT and PIM multicast routing protocols
IEEE Journal on Selected Areas in Communications
Medium access control of wireless LANs for mobile computing
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.24 |
Multimedia services, available in wired infrastructure, can now be extended to the users of wireless networks. Emerging solutions make the integration of static and mobile networks applicable, with a guaranteed quality level, but new problems have to be faced in this kind of hybrid architecture. In integrated wired and wireless networks, characterized by a dynamic topology, flooding technique is typically utilized to disseminate information needed by node discovery mechanisms and routing maintenance facilities. As flooding is not efficient in the use of bandwidth, which can be a limiting factor in the successful deployment of multimedia applications, a different approach is proposed in this paper, based on the linear multicasting capabilities of the Depth-First Search (DFS) algorithm. Whenever network information has to be updated at the nodes, to preserve current connections against any occurring topology changes, DFS can be activated to operate in a new and unknown network configuration. In fact, DFS does not need any network information to support multicast communications. Furthermore, unlike flooding, DFS belongs to the family of linear multicast algorithms, that is to say, it provides a multipoint connection through a single path without bifurcations. Such a path, that implies the absence of any packet copying process, crosses hop by hop all the addressed nodes using a low cost route and by minimum use of network resources.