Traffic Engineering Group's Research Page
NOTE: This group was established as a result of NSF Sponsored FIT'03,FIT'04 and HONET'04 Workshops

List of TE Group Members

S. No. Name Email Affiliation Current Research Interests
1 Dr. Junaid Ahmed Zubairi zubairi@fredonia.edu SUNY at Fredonia Bandwidth Management, TE Fault Handling, Constrained Routing
2 Dr. Nasir Ghani nghani@tntech.edu Tennesee Tech University  
3 Dr. M Hassan Zaidi drzaidi@niit.edu.pk NIIT, NUST Routing and Wavelength Assignment
4 Dr. Imran Tassadduq tasadduq@gmail.com SSUET Call admission control for mobile domains
4 Fahad Abdel Kader fahadakader@yahoo.com NED University  
5 Ahsan Ahmad Chaudhry ahsanch@yahoo.com    
6 Kashif Sharif Kashif@niit.edu.pk NIIT, NUST  
7 Ejaz Ahmad ejaz@niit.edu.pk NIIT, NUST  
8 Zahid Hussain zahidsafi@hotmail.com    

Keeping in Touch
We maintain a TE research group mailing list to discuss topics of mutual interest, to define new TE related projects and to report progress to each other for the ongoing projects. Joining the list is very easy, just send an email to listserv@listserv.fredonia.edu with ONLY the following line:

subscribe te-research Your-First-Name Your-Last-Name

Detailed instructions on using mailing lists at SUNY-Fredonia can be found at:

http://www.fredonia.edu/ITS/Helpdesk/Listserv/listserv.asp

List of Topics for Research (Please send your topics of interest to zubairi@fredonia.edu for including in this list)

1) Constrained Routing for MPLS Domains

2) Call Admission Control for Mobile Domains

3) TCP Performance Enhancement in WLAN

Description of Work on Traffic Engineering and Constrained Routing Algorithms in SUNY Fredonia

Traffic Engineering seeks to optimize the handling of the traffic in a network such that the capacity in various parts is utilized efficiently. IETF has developed new protocols and techniques to meet the emerging traffic requirements and to manage and control the network and its services. With MPLS, Diffserv, RSVP-TE/CR-LDP, SLA and COPS in place, manual provisioning of the network is impossible and it is expected that several algorithms will be developed to automate traffic engineering.

An efficient dynamic link-coloring algorithm is developed by Dr. Zubairi. This algorithm is named TELIC (Traffic Engineering With Link Coloring). TELIC engineers QoS paths within a Diffserv aware MPLS domain. It applies a set of rules across the domain to allocate LSP's to traffic trunks based on the Diffserv classes of service and dynamic link metrics. TELIC was implemented by a student programmer (Jason Beuckman '02) in C++ and it was tested using several traffic sets. Initial results of applying the algorithm to meet the demands of a traffic set consisting of several LSP requests with varying classes of service were published in the proceedings of ASTC'02 (Advanced Simulation Technologies Conference).

TELIC's performance was compared with SHORTD (Shortest Distance Routing Algorithm), one of the many constrained routing alogorithms found in the literature. For performance comparison, conjunction factor was specified as a figure of merit. Conjunction factor measures the degree of interference of non-premium traffic with the premium traffic. Conjunction factor computation software was developed and TELIC, SHORTD and CONJ softwares were integrated using shell scripts. The results of CONJ show remarkable success for TELIC as far as minimizing the degree of interference is concerned. These results are being published in the proceedings of ASTC'03.

Ongoing and future work includes improving the bandwidth rejection ratio for TELIC using traffic splitting or increase in bandwidth around bottleneck links. Also we are planning to put TELIC through online test by using probabilistic models to generate traffic trunks on the fly, instead of storing the same on disk. We would like to compare TELIC's performance with some other constrained routing schemes in terms of bandwidth allocation and conjunction factor minimization.

Publications

 

Page maintained by Dr. Zubairi (zubairi@fredonia.edu)