Green Internet with a Hop-by-Hop Routing method

Authors(1) :-K. Hasna

We look at the fundamental problem of designing congestion control protocols for background traffic with the minimum impact on short tcp flows while achieving a definite desired average throughput over time. In this paper we study energy conservation within the internet. we have a tendency to observe that totally different traffic volumes on a link may end up in several energy consumption; this is often in the main as a result of such technologies as trunking (IEEE 802.1AX), adaptive link rates, etc. we have a tendency to style a inexperienced net routing theme, wherever the routing will lead traffic in a approach that's green. We have a tendency to disagree from previous studies wherever they switch network elements, like line cards and routers, into sleep mode. We have a tendency to don't prune the web topology. We have a tendency to initial develop a power model, and validate it exploitation real business routers. Rather than developing a centralized optimization rule, which needs extra protocols like MPLS to hap within the net, we elect a hop-by-hop approach. Itís so a lot of easier to integrate our theme into the present net. We have a tendency to increasingly develop 3 algorithms, that are loop-free, substantially reduce energy consumption, and jointly think about green and QoS requirements like path stretch. We have a tendency to more analyze the facility saving ratio, the routing dynamics, and therefore the relationship between hop-by-hop green routing and QoS requirements.

Authors and Affiliations

K. Hasna
MCA Sri Padmavathi College Of Computer Sciences And Technology Tiruchanoor, Andhra Pradesh , India

hop-by-hop green routing, throughput, protocols.

  1. M. A. Marsan, L. Chiaraviglio, D. Ciullo, and M. Meo, "Optimal energy savings in cellular access networks," in Proc. IEEE Int. Conf. Commun. Workshops, 2009, pp. 1-5.
  2. A. P. Bianzino, C. Chaudet, D. Rossi, and J. Rougier, "A survey of green networking research," IEEE Commun. Surveys Tuts., vol. 14, no. 1, pp. 3- 20, Feb. 2012.
  3. C. Gunaratne, K. J. Christensen, B. Nordman, and S. Suen, "Reducing the energy consumption of Ethernet with adaptive link rate (ALR)," IEEE Trans. Comput., vol. 57, no. 4, pp. 448-461, Apr. 2008.
  4. P. Patel-Predd, "Update: Energy-efficient Ethernet," IEEE Spectr., vol. 45, no. 5, pp. 13-13, May 2008.
  5. M. Gupta and S. Singh, "Greening of the Internet," in Proc. SIGCOMM, 2003, pp. 19-26.
  6. N. Bansal, T. Kimbrel, and K. Pruhs, "Speed scaling to manage energy and temperature," J. ACM, vol. 54, no. 1, pp. 1-39, Mar. 2007.
  7. H. Chan, W. Chan, T. W. Lam, L. Lee, K. Mak, and P. W. H. Wong, "Energy efficient online deadline scheduling," in Proc. 18th Annu. ACMSIAM Symp. Discr. Algorithms, New Orleans, LA, USA, Jan. 7-9, 2007, pp. 795-804.
  8. M. Garrett, "Powering down," Commun. ACM, vol. 51, no. 9, pp. 42-46, 2008.
  9. F. F. Yao, A. J. Demers, and S. Shenker, "A scheduling model for reduced CPU energy," in Proc. 36th Annu. Symp. Found. Comput. Sci., Milwaukee, WI, USA, Oct. 23-25, 1995, pp. 374-382.
  10. A. Medina, N. Taft, K. Salamatian, S. Bhattacharyya, and C. Diot, "Traffic matrix estimation: Existing techniques and new directions," in Proc. SIGCOMM, 2002, pp. 161-174.
  11. R. G. Gallager, "A minimum delay routing algorithm using distributed computation," IEEE Trans. Commun., vol. COM-25, no. 1, pp. 73-85, Jan. 1977.
  12. M. Andrews, A. Fernández Anta, L. Zhang, and W. Zhao, "Routing for power minimization in the speed scaling model," IEEE/ACM Trans. Netw., vol. 20, no. 1, pp. 285-294, Feb. 2012.
  13. Y. Wang, G. Lu, and X. Li, "A study of Internet packet reordering," in Proc. Int. Conf. Inf. Netw. (ICOIN), 2004, pp. 350-359.
  14. J. A. Aroca, A. Chatzipapas, A. Fernández Anta, and V. Mancuso, "A measurement-based analysis of the energy consumption of data center servers," in Proc. 5th Int. Conf. Future Energy Syst. e-Energy, 2014, pp. 63-74.
  15. T. Bingmann and D. Yordanov, "Robert Gallager’s minimum delay routing algorithm using distributed computation," in Proc. Seminar (WS’07), 2007, pp. 15-31.
  16. R. T. Marler and J. S. Arora, "Survey of multi-objective optimization methods for engineering," Struct. Multidiscip. Optim., vol. 26, no. 6, pp. 369-395, 2004.
  17. L. Zadeh, "Optimality and non-scalar-valued performance criteria," IEEE Trans. Autom. Control, vol. AC-8, no. 1, pp. 59-60, Jan. 1963.
  18. D. Lee and N. Brownlee, "Passive measurement of one-way and two-way flow lifetimes," ACM SIGCOMM Comput. Commun. Rev., vol. 37, no. 3, pp. 17-28, 2007.
  19. J. Charzinski, "HTTP/TCP connection and flow characteristics," Perform. Eval., vol. 42, nos. 2-3, pp. 149-162, 2000.
  20. S. Uhlig, B. Quoitin, J. Lepropre, and S. Balon, "Providing public intradomain traffic matrices to the research community," Comput. Commun. Rev., vol. 36, no. 1, pp. 83-86, 2006

Publication Details

Published in : Volume 3 | Issue 4 | March-April 2018
Date of Publication : 2018-04-30
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 496-500
Manuscript Number : CSEIT1833422
Publisher : Technoscience Academy

ISSN : 2456-3307

Cite This Article :

K. Hasna, "Green Internet with a Hop-by-Hop Routing method ", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 3, Issue 4, pp.496-500, March-April-2018.
Journal URL :

Article Preview