spacer
Research
spacer
Quick Links
spacer
Posters
spacer
Monthly Presentations
spacer
home > research > monthly presentations > fall 2008
 

Fall 2008

 
spacer For the Fall semester 2008, the schedule of the monthly meetings and invited presentations at OpNeAR lab. is the following (Please check again for updates):
 
spacer
Date
Time
Room
Speaker
Presentation Title
8/22 4-5 PM ECSN 4.728 Reza Roshani Tabrizi Reconfigurable Optical Networks: a Cross Layer Approach
11/07 5-6 PM ECSN 2.718 Kumaran Vijayasankar and Azar Taufique Speech Multi-Class Aided Real-Time (SMART) Protocols
11/14 4-5 PM ECSN 4.728 Juanjuan Yu A Queueing Model Framework of PCE-based Inter-area Path Computation
 
spacer August 22, 2008, 4-5 PM, ECSN 4.728

Reconfigurable Optical Networks: a Cross Layer Approach
Speaker: Reza Roshani Tabrizi

This paper presents the Pruning with Memory (PWM) algorithm, which computes a cross layer optimal reconfiguration sequence in reconfigurable IP/MPLS over optical networks.


 
spacer November 07, 2008, 5-6 PM, ECSN 2.718

Speech Multi-Class Aided Real-Time (SMART) Protocols
Speakers: Kumaran Vijayasankar and Azar Taufique

Speech Recognition is one of the fastest growing applications. This presentation focuses on the support of Speech Recognition in bandwidth scarcity scenarios using Speech Multi-Class Aided Real Time (SMART) Protocols. SMART protocols using techniques like differentiating frame size (DFS) and differentiating maximum retry limit (DMR) are considered. Simulations are carried out using speech data from TIMIT corpus. Results show that performance improvements in terms of word error rate (WER) at many bandwidth scarce cases as compared to conventional Quality of Service (QoS) protocols can be obtained. However it is observed that further study is required to determine the optimal choice of SMART protocol at a given bandwidth.


 
spacer November 14, 2008, 4-5 PM, ECSN 4.728

A Queueing Model Framework of PCE-based Inter-area Path Computation
Speaker: Juanjuan Yu

Path computation elements (PCE's) are used to compute end-to-end paths across multiple areas. Multiple PCE's may be dedicated to each area to provide sufficient path computation capacity and redundancy. An open problem is which PCE should be chosen to send the path computation request to, that may be a non trivial problem if PCE's have uneven processing capacities. This paper presents a product form queueing model to estimate the latencies in path computation while accounting for the arrival rate of path computation requests. The model is used to find the PCE selection policy to minimize the overall expected latencies in path computation. The model is validated against two simulation benchmarks obtained using OPNET, i.e., a network of queues and the multi protocol label switching with traffic engineering (MPLS-TE) network running the PCE communication protocol (PCEP). The study shows that the use of product form yields approximations that are up to 15\% at practical offered loads. Moreover, the PCE selection policy derived under the product form assumption is showed to be effective in minimizing the overall expected latencies in path computation.


spacer
  HomeActivitiesResearchProjectsPublicationsPeopleTarget LabContact UsSearchSite Map
spacer
© 2007. All rights reserved.
Open Networking Advanced Research Lab
Dept. of Electrical Engineering
The University of Texas at Dallas. USA.