Energy Conservation in an Internet Routing of a Packet Delivery by Routing Algebra

Mutyala Venkata Roa, G Tatayya Naidu, M. Veerabhadra Rao

Abstract


We rather pick a hop-by-hop approach. Such an approach is appropriate for the systems without MPLS conveyed. All the more particularly, every router can independently figure next hops, the same as what they do in Dijkstra today. We would then be able to effectively join the routing algorithm into the OSPF protocol. We initially build up a power demonstrate and approve the model utilizing genuine examinations in business routers. We at that point create standards and a benchmark hop-by-hop green routing algorithm that ensures circle free directing. The algorithm takes after the generally known steering variable based math with isotonic property. We additionally build up a propelled algorithm that generously enhances the pattern algorithm in energy preservation. We likewise build up an algorithm that simultaneously considers energy protection and way extend. We assess our algorithm utilizing thorough reproductions on manufactured and genuine topologies and activity traces.


References


J. Carter and K. Rajamani, “Designing energy-efficient servers and data centers,†Computer, vol. 43, no. 7, pp. 76–78, Jul. 2010.

V. Siddhartha, P. V. Ramakrishna, T. Geetha, and A. Sivasubramaniam, “Automatic generation of energy conservation measures in buildings using genetic algorithms,†Energy Buildings, vol. 43, pp. 2718–2726, 2011.

M. Zhang, C. Yi, B. Liu, and B. Zhang, “GreenTE: Power-Aware Traffic Engineering,†in Proc. IEEE Int. Conf. Netw. Protocol, Oct. 2010, pp. 21–30.

N. Vasic, P. Bhurat, D. Novakovic, M. Canini, S. Shekhar, and D. Kostic, “Identifying and using energy-critical paths,†in Proc. 7th Conf. Emerging Netw. Experiments Technol., 2011, p. 18.

S. Avallone and G. Ventre, “Energy efficient online routing of flows with additive constraints,†Comput. Netw., vol. 56, no. 10, pp. 2368–2382, 2012.

A. Cianfrani, V. Eramo, M. Listanti, M. Marazza, and E. Vittorini, “An energy saving routing algorithm for a green OSPF protocol,†in Proc. IEEE Conf. Comput. Commun. Workshops, Mar. 2010, pp. 1–5.

A. Cianfrani, V. Eramo, M. Listanti, and M. Polverini, “An OSPF enhancement for energy saving in IP networks,†in Proc. IEEE Workshop Green Commun. Netw., Apr. 2011, pp. 325–330.

F. Cuomo, A. Abbagnale, A. Cianfrani, and M. Polverini, “Keeping the connectivity and saving the energy in the internet,†in Proc. IEEE Conf. Comput. Commun. Workshop GCN, Apr. 2011, pp. 319–324.

A. P. Bianzino, L. Chiaraviglio, and M. Mellia, “Distributed algorithms for green IP networks,†in Proc. IEEE Conf. Comput. Commun. Workshop Green Netw. Smart Grid, Mar. 2012, pp. 121–126.

A. P. Bianzino, L. Chiaraviglio, M. Mellia, and J.-L. Rougier, “GRiDA: GReen distributed algorithm for energy-efficient IP backbone networks,†Comput. Netw., vol. 56, no. 14, pp. 3219–3232, 2012.

Y. M. Kim, E. J. Lee, H. S. Park, J.-K. Choi, and H.-S. Park, “Ant colony based self-adaptive energy saving routing for energy efficient Internet,†Comput. Netw., vol. 56, no. 10, pp. 2343–2354, 2012.

E. Amaldia, A. Caponea, and L. Gianoli, “Energy-aware IP traffic engineering with shortest path routing computer networks,†Comput. Netw., vol. 57, no. 6, pp. 1503–1517, 2013.

Y. Yang, M. Xu, and Q. Li. “Towards fast rerouting-based energy efficient routing,†Comput. Netw., vol. 70, no. 9, pp. 1–15, 2014.

Q. Li, M. Xu, Y. Yang, L. Gao, Y. Cui, and J. Wu. “Safe and practical energy-efficient detour routing in IP networks,†IEEE/ACM Trans. Netw., vol. 22, no. 6, pp. 1925–1937, Dec. 2014.

C. Hou, F. Zhang, A. F. Anta, L. Wang, and Z. Liu, “A Hopby- hop energy efficient distributed routing scheme,†ACM SIGMETRICS Performance Evaluation Review, vol. 14, no. 3, pp. 101–106, 2013.


Full Text: PDF [Full Text]

Refbacks

  • There are currently no refbacks.


Copyright © 2013, All rights reserved.| ijseat.com

Creative Commons License
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.

Â