Multicast routing in datagram internetworks and extended LANs
ACM Transactions on Computer Systems (TOCS)
Data networks (2nd ed.)
Distributed, scalable routing based on link-state vectors
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Building shared trees using a one-to-many joining mechanism
ACM SIGCOMM Computer Communication Review
Quality of service based routing: a performance perspective
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
QoS routing in networks with inaccurate information: theory and algorithms
IEEE/ACM Transactions on Networking (TON)
Multicast tree construction and flooding in wireless ad hoc networks
Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Evaluating the impact of stale link state on quality-of-service routing
IEEE/ACM Transactions on Networking (TON)
Wireless ad hoc multicast routing with mobility prediction
Mobile Networks and Applications
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking
The directed reverse path join (DRPJ) protocol: an efficient multicast routing protocol
Computer Communications
Analysis of an anycast based overlay system for scalable service discovery and execution
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the efficiency of inter-domain state advertising in multi-domain networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Hi-index | 0.00 |
Flooding is a commonly used technique for network resource and topology information dissemination in the data communication networks. However, due to the well-known N-squared problem it causes network delay in response or even congestion. We propose a new flooding technique, called Lazy Flooding; it floods only when links reach a certain status. It significantly cuts down the number of floods and thus improves the data communication network response time. On the other hand, it has negligible effect on the network performance due to the selected flooding.