Call for Paper - January 2023 Edition
IJCA solicits original research papers for the January 2023 Edition. Last date of manuscript submission is December 20, 2022. Read More

'Traffic analyzer' Congestion Control Algorithm for Datacenters

Print
PDF
International Journal of Computer Applications
© 2012 by IJCA Journal
Volume 50 - Number 23
Year of Publication: 2012
Authors:
Mehdi Mohtashamzadeh
Mehdi Harizi
Aref Saiahi
10.5120/7963-1283

Mehdi Mohtashamzadeh, Mehdi Harizi and Aref Saiahi. Article: Traffic analyzer Congestion Control Algorithm for Datacenters. International Journal of Computer Applications 50(23):19-23, July 2012. Full text available. BibTeX

@article{key:article,
	author = {Mehdi Mohtashamzadeh and Mehdi Harizi and Aref Saiahi},
	title = {Article: Traffic analyzer Congestion Control Algorithm for Datacenters},
	journal = {International Journal of Computer Applications},
	year = {2012},
	volume = {50},
	number = {23},
	pages = {19-23},
	month = {July},
	note = {Full text available}
}

Abstract

Ever increasing amount of data in networks may lead to congested networks, routers with full queues, increase of loss rate, and end-to-end latency. As a result effective throughput in networks would be plummeted. To deal with such challenges routers have to route packets faster and more precise. This concern seems to be more important in the backbones and regions near datacenters (which are crucial segments of nowadays networks), since they must tolerate with tremendous amount of traffic. Researchers have proposed different routing lookup algorithms, but since most of those need some memory accesses, routing process speed is limited to memory speed. In this paper, concentration is on flooding traffic beyond datacenters. Beyond doubt decreasing traffic volume in the regions close to datacenters, which absorb large proportion of traffic, can effectively improve congestion status and overall throughput of network. This research proposes that network can be segmented into regions according to distance of nodes from datacenters and backbones and different policies and routing algorithms would function in each segment. This method can effectively deduct the load on hardware and software in networks. Results show notable improvements in Round Trip Time (RTT), latency, and queue length parameters in routers.

References

  • Talbot, B. , Sherwood, T. , and Lin, B. 1999. IP caching for terabit speed routers. In proceedings of the Globecom conference.
  • Chiueh, T. C. and Pradhan, P. 1999. Cache Memory Design for Network Processors. In proceedings of the HPCA Symposium on High-Performance Computer Architecture.
  • Liu, H. 2001. Routing Prefix Caching in Network Processor Design. In proceedings of the ICCCN conference on Computer Communications and Networks.
  • Saihan, F. and Issarny, V. 2003. Cooperative Caching in Ad Hoc Networks. In proceedings of the MDM conference on Mobile Data Management.
  • Johnson, D. and Maltz, D. 1996. Dynamic Source Routing in mobile ad-hoc networks. In Mobile Computing, Kluwer Academic Publishers.
  • http://www. nsnam. org
  • Martin, J. , Nilsson, A. , and Rhee, I. 2003. Delay based congestion avoidance in TCP. IEEE/ACM transactions on networking, vol 11, no 3, pp. 53-61.
  • Brennan, R. and Curran, T. 2001. SCTP Congestion Control: Initial Simulation Studies. In proceedings of the Tele-traffic Congress (ITC 17) conference.
  • Crovella, M. and Bestavors, A. 1996. Self-similarity in World Wide Web traffic: Evidence and possible causes. In proceedings of the ACM SIGMETRICS conference on measurement and modeling of computer systems.
  • Paxon, V. and Floyd, S. 1995. Wide-area traffic: The failure of poison modeling. IEEE/ACM Transactions on Networking, Vol 3, No 3, pp. 226-244.