Ioannis Stavrakakis

Ioannis Stavrakakis

Auto-generated profile, based on publicly available information

Ioannis Stavrakakis

Department of Informatics and Telecommunications, National and Kapodistrian University of Athens, Athens, Greece

Research Focus & Metrics

Academic Career Length

34Years (1993-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2006 in Performance Evaluation
Verified
Journal Article
Closed access
NLNikolaos Laoutaris
Nikolaos Laoutaris
HCHao Che
Hao Che
ISIoannis Stavrakakis
Ioannis Stavrakakis

22 February 2005
Verified
Conference Paper
Closed access
NLN. Laoutaris
N. Laoutaris
SSS. Syntila
S. Syntila
ISI. Stavrakakis
I. Stavrakakis
Large scale hierarchical caches for Web content have been deployed widely in an attempt to reduce delivery delays and bandwidth consumption and also to improve the scalability of content dissemination through the World Wide Web. Irrespective of the specific replacement algorithm employed in each cache, a de facto characteristic of contemporary hierarchical caches is that a hit for a document at an l-level cache leads to the caching of the document in all intermediate caches (levels l-1,..., 1) on the path towards the leaf cache that received the initial request. This paper presents various algorithms that revises this standard behavior and attempts to be more selective in choosing the caches that gets to store a local copy of the requested document. As these algorithms operate independently of the actual replacement algorithm running in each individual cache, they are referred to as meta algorithms. Three new meta algorithms are proposed and compared against the de facto one and a recently proposed one by means of synthetic and trace-driven simulations. The best of the new meta algorithms appears to be leading to improved performance under most simulated scenarios, especially under a low availability of storage. The latter observation makes the presented meta algorithms particularly favorable for the handling of large data objects such as stored music files or short video clips. Additionally, a simple load balancing algorithm that is based on the concept of meta algorithms is proposed and evaluated. The algorithm is shown to be able to provide for an effective balancing of load thus possibly addressing the recently discovered "filtering-effect" in hierarchical Web caches.

1 February 2005 in Computer Networks
Verified
Journal Article
Closed access
NLNikolaos Laoutaris
Nikolaos Laoutaris
VZVassilios Zissimopoulos
Vassilios Zissimopoulos
ISIoannis Stavrakakis
Ioannis Stavrakakis

25 June 2003
Verified
Conference Paper
Closed access
CSC.A. Santivanez
C.A. Santivanez
BMB. McDonald
B. McDonald
ISI. Stavrakakis
I. Stavrakakis
RRR. Ramanathan
R. Ramanathan

1 January 2007
Verified
Conference Paper
Closed access
NLN. Laoutaris
N. Laoutaris
GSG. Smaragdakis
G. Smaragdakis
KOK. Oikonomou
K. Oikonomou
ISI. Stavrakakis
I. Stavrakakis
ABA. Bestavros
A. Bestavros
The effectiveness of service provisioning in large-scale networks is highly dependent on the number and location of service facilities deployed at various hosts. The classical, centralized approach to determining the latter would amount to formulating and solving the uncapacitated k-median (UKM) problem (if the requested number of facilities is fixed), or the uncapacitated facility location (UFL) problem (if the number of facilities is also to be optimized). Clearly, such centralized approaches require knowledge of global topological and demand information, and thus do not scale and are not practical for large networks. The key question posed and answered in this paper is the following: "How can we determine in a distributed and scalable manner the number and location of service facilities?" We propose an innovative approach in which topology and demand information is limited to neighborhoods, or balls of small radius around selected facilities, whereas demand information is captured implicitly for the remaining (remote) clients outside these neighborhoods, by mapping them to clients on the edge of the neighborhood; the ball radius regulates the trade-off between scalability and performance. We develop a scalable, distributed approach that answers our key question through an iterative re-optimization of the location and the number of facilities within such balls. We show that even for small values of the radius (1 or 2), our distributed approach achieves performance under various synthetic and real Internet topologies that is comparable to that of optimal, centralized approaches requiring full topology and demand information.

1 January 2011 in Computers & Security
Verified
Journal Article
Closed access
CXChristos Xenakis
Christos Xenakis
CPChristoforos Panos
Christoforos Panos
ISIoannis Stavrakakis
Ioannis Stavrakakis