Την Τρίτη 22 Φεβρουαρίου 2011 στις 14:00 θα έχουμε μια επιπλέον παρουσίαση του εβδομαδιαίου
ερευνητικού σεμιναρίου (colloquium) του Τομέα Λογισμικού. Ομιλητής είναι ο Γιάννης Ψαρράς
από το Networks and Services Research Lab του UCL.
Το συνολικό πρόγραμμα της επόμενης εβδομάδας:
Δευτέρα 21/02/2011, 14:30
Ομιλητής: Αντώνιος Γαστεράτος, Τμήμα Μηχανικών Παραγωγής και Διοίκησης, Δημοκρίτειο Πανεπιστήμιο Θράκης
Τίτλος: Τεχνητή όραση: εφαρμογή σε ρομποτικά συστήματα
Τρίτη 22/02/2011, 14:00
Ομιλητής: Ioannis Psaras, Networks and Services Research Lab, UCL
Τίτλος: Modelling and Evaluation of CCN-caching Trees
Σεμινάριο του Τομέα Λογισμικού: Κύκλος διαλέξεων 2010-2011
Τρίτη 22/02/2011, 14:00
Εργαστήριο Τομέα Λογισμικού, Ισόγειο κτιρίου Α, Πανεπιστημιούπολη
Ομιλητής: Ioannis Psaras, Networks and Services Research Lab, UCL
Title: Modelling and Evaluation of CCN-caching Trees
Abstract:
Networking Named Content (NNC) was recently proposed as a new networking paradigm to realise Content Centric Networks (CCNs). The new paradigm changes much about the current Internet, from security and content naming and resolution, to caching at routers, and new flow models. In this paper, we study the caching part of the proposed networking paradigm in isolation from the rest of the suggested features. In CCNs, every router caches packets of content and reuses those that are still in the cache, when subsequently requested. In this talk, we model and evaluate this caching feature of CCNs.
Our modelling proceeds both analytically and by simulation. Initially, we develop a mathematical model for a single router, based on continuous time Markov-chains, which assesses the proportion of time a given piece of content is cached. This model is extended to multiple routers with some simple approximations. The mathematical model is complemented by simulations which look at the caching dynamics, at the packet-level, in isolation from the rest of the flow.
Our findings indicate that, as expected, there is a clear network-wide performance gain for popular content, but this gain: i) goes down to almost zero for unpopular content, which is, however, the case most of the times, ii) depends heavily on the size of the router-cache and iii) is different between edge/leaf and core Internet routers.
Paper can be found at: http://www.ee.ucl.ac.uk/~uceeips/ccn-ca ... psaras.pdf
BIO:
Ioannis Psaras received a diploma in Electrical and Computer Engineering from Democritus University of Thrace, Greece in 2004, and a Ph.D. degree from the same institute in 2008. He won the Ericsson Award of Excellence in Telecommunications for his diploma dissertation in 2004. He has worked as a research intern at DoCoMo Eurolabs (May–September 2005) and at Ericsson Eurolab (May–September 2006). His research interests are in the area of congestion control, delay-tolerant networks and user- and content-centric networks. He is currently a researcher at the Networks and Services Research Lab at UCL. Further information can be found at: http://www.ee.ucl.ac.uk/~uceeips.