@article{MAKHILLAJIT20191886771,
    title = {Modelling a Gossip-based Protocol for Enhanced Dynamic Routing},
    journal = {Asian Journal of Information Technology},
    volume = {18},
    number = {8},
    pages = {203-206},
    year = {2019},
    issn = {1682-3915},
    doi = {ajit.2019.203.206},
    url = {https://makhillpublications.co/view-article.php?issn=1682-3915&doi=ajit.2019.203.206},
    author = {Elliot,Stephen and},
    keywords = {Disseminating,properties,algorithm,knowledge,routing},
    abstract = {Gossip-based protocols for group
communication have attractive scalability and reliability
properties. The gossip schemes studied so far typically
assume that each group member has full knowledge of the
global membership and chooses gossip targets uniformly
at random. In this study, we present a design of a routing
algorithm that has the properties of gossip style of
disseminating link state updates with the intention of
making it faster than the current algorithms.}
    }