Abstract
This paper presents high through put routing algorithm. Modified depth Breadth routing algorithm takes a decision in moving forward packet in the next node which will visit to reach its final destination. Load balancing to improve the performance of distributed by processing power of the entire system to smooth out process of very high congestion at individual nodes, by transferring some of the load of heavily loaded nodes to the other nodes for processing. This achieves a 306.53 average time for packet, compared with the DB routing which achieves 316.13 average time for packet. Results shows that the proposed Modified depth Breadth achieves 348 average time when compared to DB routing which gives 548 for 3500 packets on 5 × 5 grid. Further results show that no of dead packets significantly reduced in the case of MDB. This focuses on Routing Network and Tables. These Network tables includes the information used by a routing algorithm to take a decision in moving forward the packet in the next node which will visit to reach its final destination. Load balancing try to improve the performance of a distributed system by processing power of the entire system to smooth out periods of very high congestion at individual nodes, which is done by transferring some of the load of heavily loaded nodes to other nodes for processing.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Welzl, W. Eddy, Congestion Control in the RFC Series, University of Innsbruck, October 30, 2012
A. Warrier, S. Janakiraman, S. Ha, I. Rhee, DiffQ: Differential Backlog Congestion Control for Multi-hop Wireless Networks, INFOCOM 2009
S. Floyd, ICSI Center for Internet Research and EddieKohler, UCLA Computer ScienceDepartment, Datagram Congestion Control Protocol, USA, 2009
G. Di Caro, F. Ducatelle, and L.M. Gambardella. AntHocNet: an adaptive nature-inspired algorithm for routing in mobile ad hoc networks. European Transactions on Telecommunications, 16(5), October 2005
C. Solnon, Ants can solve constraint satisfaction problems. IEEE Transactions on Evolutionary Computation 6(4), 347–357 (August 2002)
K. A. Weinger, Passive auto configuration of mobile ad hoc networks, IEEE J. Sel. Areas Commun. 23(3), 507–519 (2005)
D. Merkle, M. Middendorf, and H. Schmeck. Ant colony optimization for resourceconstrainedproject scheduling. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000), pp. 893–900. Morgan Kauffmann, 2000
J. Handl, J. Knowles, and M. Dorigo. On the performance of ant-based clustering. In Design and application of hybrid intelligent systems, volume 104 of Frontiers in Artificial intelligence and Applications. IOS Press, Amsterdam, The Netherlands, 2003
S. Floyd (ed.), Metrics for the Evaluation of Congestion Control Mechanisms (March 2008)
C. Blum. Ant colony optimization for the edge-weighted k-cardinality tree problem. In GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 27–34, 2002
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Anuradha, S., Raghu Ram, G. Dynamic Congestion Control using MDB-Routing Algorithm. J. Inst. Eng. India Ser. B 95, 37–41 (2014). https://doi.org/10.1007/s40031-014-0075-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40031-014-0075-2