Résuméx

GeoSistemasx

Recherchex

Coursx

Tec de Monterreyx

Softwarex

Donnée GeoSpatialex

SIG Internationalx

SIG Localx

Adresses d'intérêtx

Coordonnées 

|
 
 

Florin Ciucu, Deutsche Telekom Laboratories (T-Labs)
A Modern Tool to Analyze Queueing Systems: Theory and Practice
Viernes 26 de marzo 11am
Auditorio del Tecnológico de Monterrey campus Puebla


Since the early 1990s, the network calculus has been emerging as an attractive analytical tool for approximative queueing analysis. Its main ideas are to use bounds for arrivals and service representation at a queue, and to manipulate these bounds in order to obtain performance metrics such as queueing delay. The attractive feature of the calculus is that it offers an uniform methodology to analyze broad classes of arrivals, service, and scheduling algorithms, and multi-queues scenarios.

The first part of talk provides a brief introduction into the main concepts of the network calculus (e.g., envelope, service curve functions) and the underlying methodology for manipulating these. The second part of the talk illustrates applications of the calculus to some networking problems, in particular the buffer dimensioning of Internet routers and the performance analysis of wireless random networks. Concretely, it is shown how to derive buffering schemes scaling as O(1) in the number of Internet flows, and which is sufficient to guarantee any level of performance guarantees (e.g., bounded delay); this scheme improves over existing O(n) and O(n^(1/2)) schemes. Also, it is shown how to evaluate the throughput and derive stability conditions in wireless random networks employing some forms of randomized algorithms for accessing the wireless channel; of particular interest is determining the distribution of the number of nodes within a contention zone optimizing the throughput.

Speaker's Bio
Florin Ciucu was educated at the Faculty of Mathematics, University of Bucharest (B.Sc. in Informatics, 1998), George Mason University (M.Sc. in Computer Science, 2001), and University of Virginia (Ph.D. in Computer Science, 2007). Between 2007 and 2008 he was a Postdoctoral Fellow in the Electrical and Computer Engineering Department at the University of Toronto. Currently he is a Senior Research Scientist at Deutsche Telekom Laboratories (T-Labs). His research interests are in the stochastic analysis of communication networks, resource allocation, and randomized algorithms. Florin is a recipient of the ACM Sigmetrics 2005 Best Student Paper Award