NDLI: Hierarchical Dynamic Traffic Engineering Considering the Upper Bounds of Link Utilizations

Content Provider	IEEE Xplore Digital Library
Author	Ohsita, Y. Miyamura, T. Arakawa, S. Shiomoto, K. Murata, M.
Copyright Year	2011
Abstract	Traffic Engineering (TE) is one efficient approach to handle traffic changes. To perform TE, a server called the Path Computation Element (PCE) collects the traffic information from all nodes within the network. Then, the PCE calculates the routes suitable to the current traffic. However, in a large-scale network, it is difficult for one PCE to collect all traffic information in a short period of time. Thus, it takes time to change the routes according to traffic changes. In this paper, we propose a method that changes the routes suitable to the current traffic soon after the traffic changes. In our method, we hierarchically divide the network into multiple ranges; the ranges of the lowest layer are constructed of a small number of nodes and the ranges of the upper layer are constructed from the multiple ranges of the lower layer. We deploy a PCE for each range. The PCEs in the lowest layer change the routes within a small range in a short interval according to the traffic information within the range to handle the traffic changes that occur in a short period of time. Against the traffic change that cannot be handled in the lower layer, the PCEs in the upper layer change the routes within the large ranges of the upper layer according to the aggregated traffic information collected from the PCEs of the lower layer. We also propose a method to aggregate traffic information and a method to calculate the new routes by using the aggregated traffic information considering the upper bounds of link utilizations. In this method, we aggregate traffic information so that we can calculate the upper bounds of the link utilizations after the route change only from the aggregated traffic information. Then, the PCE obtaining the aggregated traffic information calculates the new routes without causing any new congestion by checking the upper bounds of link utilizations calculated from the aggregated traffic information. In this paper, we evaluate our method by simulation and clarify that our method can mitigate the congestion soon after the traffic changes.
Starting Page	1
Ending Page	6
File Size	2243153
Page Count	6
File Format	PDF
ISBN	9781424492664
ISSN	1930529X
e-ISBN	9781424492688
e-ISBN	9781424492671
DOI	10.1109/GLOCOM.2011.6133539
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-12-05
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Peer to peer computing Upper bound Topology Linear programming Aggregates IEEE Communications Society Educational institutions
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in