CURRICULUM VITAE SURNAME AND NAME Stavrakakis ......CURRICULUM VITAE SURNAME AND NAME Stavrakakis, Ioannis Home Address Phone number Fax number E-mail address [email protected] Nationality

CURRICULUM VITAE

SURNAME AND NAME Stavrakakis, Ioannis

Home Address

Phone number

Fax number

E-mail address [email protected]

Nationality Greek (Hellenic)

Birth date

Academic Position (if the candidate holds a position in a University)

Qualification/Title Professor

University National and Kapodistrian University of Athens

Department Informatics and Telecommunications

Academic Field Computer / Communication Networking

Academic Discipline Electrical & Computer Engineering

Working experience (please use the following table in order to briefly describe the working positions

covered by the candidate)

Dates ( from .. to..) 2002 - PRESENT

Name and address of the Employer (Public or/and

private institution/body)

National and Kapodistrian University of Athens,

Athens, Greece

Position held (for positions in Universities, the

candidate should indicate the

Faculty/College/School and the Department)

Professor,

School of Applied Science,

Dept. of Informatics and Telecommunications

Main activities/responsibilities Teatching, Research

Dates ( from .. to..) 10/2018 -12/2018



Technical University of Darmstadt

Darmstadt, Germany




DFG MAKI Center Mercator Fellow

Dept. of Electrical Engineering and Information

Technology

KOM-Multimedia Communications Lab

Main activities/responsibilities Research

Dates ( from .. to..) 3/2018 – 9/2018



University Carlos III de Madrid,

Leganes (Madrid), Spain




UC3M/Santander Chair of Excellence,

Dept. of Telematics Engineering

Main activities/responsibilities Research and Teaching

Dates ( from .. to..) 3/2017 – 2/2018



University Carlos III de Madrid and IMDEA

Networks Institute, Leganes (Madrid), Spain




Chair of Excellence Comunidad de Madrid,

Dept. of Telematics Engineering

Main activities/responsibilities Research and Teaching

Dates ( from .. to..) 2/2004



University of Trento,

Trento, Italy




Visiting Professor

Dept. of Information Engineering and Computer

Science

Main activities/responsibilities Teaching

Dates ( from .. to..) 1998 - 2002



National and Kapodistrian University of Athens,

Athens, Greece




Associate Professor,

School of Applied Science,

Dept. of Informatics and Telecommunications

Main activities/responsibilities Teatching, Research

Dates ( from .. to..) 1994 - 1998



Northeastern University,

Boston, MA, USA




Associate Professor,

School of Engineering,

Dept. of Electrical and Computer Engineering

Main activities/responsibilities Teaching and Research

Dates ( from .. to..) 5/1994 – 7/1994



CNUCE Institute of the Italian National

Research Council (CNR),

Pisa, Italy.




Visiting Scientist,

Institute of Information Technology


Dates ( from .. to..) 1988 - 1994



University of Vermont,

Burlington, VT, USA




Assistant Professor,

School of Engineering,

Dept. of Electrical Engineering and Computer

Science

Main activities/responsibilities Teaching and Research

Dates ( from .. to..) 1984 - 1988



University of Virginia,

Charlottesville, VA, USA




Research Assistant,

Dept. of Electrical and Computer Engineering


Education and Training (please use the following table to describe Degrees awarded, by only

indicating the information concerning Bachelor’s Degree, Master of Science’s Degree or/and PhD)

Date 1983

Institution which issued the degree Aristotelian University of Thessaloniki

Type of Degree awarded (only Bachelor’s Degree,

Master of Science’s Degree, PhD)

5-year Diploma in Electrical Engineering

Date 1988

Institution which issued the degree University of Virginia

Type of Degree awarded (only Bachelor’s Degree,

Master of Science’s Degree, PhD)

Ph.D. in Electrical & Computer Engineering

EVALUATION FIELDS

1. Scientific Activity

Research activities span over three decades and have been focused on resource allocation protocols,

stochastic traffic management and congestion control for communication networks (peer-to-peer,

mobile, ad hoc, autonomic, delay tolerant, social and future Internet), with recent emphasis on

human driven decision-making in distributed competitive environments and information-centric

networking.

The contributions to “network traffic analysis and resource allocation methodologies”, were

recognized in 2007 by IEEE in granting the Fellow status.

The major activities/ contributions are summarized below.

(1980’s): seminal characterization of output processes of complex (multi-user, random-access)

networks and traffic merging and splitting network elements, based on limited state information

modulating the output process.

(1990’s): innovative resource allocation analysis methodology, employing non-independent

fictitious traffic flows to capture characteristics of a large class of complex, realistic scheduling

strategies, which are then studied employing the introduced unified framework and exploiting

available traffic analysis techniques.

(1990’s): Establishment of capacity of Time Division Multiple Access (TDMA) resource

allocation mechanisms (supporting call admission control function in QoS-supporting wireless

networking standards (IEEE-WLANs, IEEE-802.16, etc)) and deriving policies that deliver the

achievable QoS; also incorporated diverse QoS and wireless channel errors.

(2000’s): seminal work in scalable routing for ad hoc, mobile networks. It was used to measure

the scalability of several existing protocols and considered by Internet Task Force on Ad hoc

Network Scalability group. It led to the development of HSLS protocol which outperformed

existing ones for large networks and was the first (flat) protocol proven scalable with respect to

network size. HSLS was used as baseline for several projects dealing with large networks for the

US military (e.g. BBN's UDAAN, JavaLen, etc.) and was adopted by the MOBILEMAN EU

project, as well as for private, open source, community wireless networks (Champaign-Urbana

Community Wireless Network - CUWiN).

(2000’s): Establishment of capacity of Generalized Processor Sharing (GPS) scheduler by

deriving the (provably) optimal service strategy; GPS schedulers are employed widely in today’s

Internet routers and switches.

(2000’s): Highly cited (especially today) work on information caching. Work on distributed

selfish replication, presenting the first provably sustainable (mistreatment-free) strategy for

cooperative caching.

(2010’s): a series of 3 IEEE transactions papers developed 3 distinct approaches to the

content/service placement problem in distributed fashion with local topology and demand

information. This work is becoming more important today as optimal resource/service

placement is key to optimizing distributed resource engagement / service provision.

(2010’s): Forward-looking, pioneering work on decision making in competitive environments by

departing from mainstream fully rational considerations and factoring in human-behavior driven

bounded rationality. This inter-disciplinary work brought in understanding on how humans take

decisions and assessed the goodness of such decisions.

1.1 The three most important outcomes/results of the research activity of the candidate accompanied

by the tangible and verifiable evidence that the presented results:

are original, significant and due to the determining, prevailing and clearly recognizable

contribution of the candidate;

have been widely spread and have obtained outstanding recognitions by the international

scientific community;

qualify the candidate as a distinguished international expert in his/her own field.

(I) - Work on asymptotically scalable ad hoc routing protocols.

- C. Santivanez, R. Ramanathan, I. Stavrakakis, “Making Link-State Routing Scale for Ad

Hoc Networks,” MobiHoc 2001, Oct.4-5, 2001, Long Beach, CA (Google Scholar citations

252)

- C. Santivanez, B. McDonald, I. Stavrakakis, R. Ramanathan, “On the Scalability of Ad hoc

Routing Protocols,” IEEE INFOCOM’02, N. York, USA. (Google Scholar citations 220)

This is seminal work on scalable networking with direct application to information

dissemination strategies of routing protocols for ad hoc, mobile networks (and not only). It

has two complementary pieces and it is presented in two publications. In the first

publication, a large family of protocols is developed through novel joint time- and space -

modulated transmissions of link state updates (Fuzzy-Sighted Link State). The optimal

protocol of this family (minimizing overhead, as defined under a novel perspective) is

analytically determined (the so called Hazy Sighted Link State (HSLS) protocol) and it is

shown to not only outperform existing techniques for large networks, but it is proven to be

asymptotically scalable with respect to network size, it was the only flat protocol shown to

poses this property. In the second publication, the scalability study methodology applied in

the first paper is generalized into a novel framework for assessing scalability in ad hoc

networks and it is applied in order to assess the scalability of various ad hoc routing

algorithms with respect to network size, mobility and traffic. Protocols studied include: Plain

Flooding (PF), Standard Link State (SLS), Dynamic Source Routing (DSR), Hierarchical

Link State (HierLS), Zone Routing Protocol (ZRP), and Hazy Sighted Link State (HSLS). It

is shown that PF and ZRP scale better with mobility, SLS and ZRP scale better with respect

to traffic, and HSLS scales better with respect to network size. The analysis provides deeper

understanding of the limits and trade-offs inherent in mobile ad hoc network routing. The

analysis is complemented with a simulation experiment comparing HSLS and HierLS. An

important contribution of this paper is that flat routing protocols (e.g., the HSLS) can be

scalable and, thus, it is not necessary to consider (the more complex to implement)

hierarchical approaches for large ad hoc networks; this is a fundamental result with immense

practical importance.

Recognition: Besides the good number of citations of this work, the HSLS protocol has

been adopted as the baseline for several projects dealing with large networks for the US

military (e.g. BBN's UDAAN, JavaLen, etc.) and by the MOBILEMAN EU project, as well

as for private community wireless networks such as the Champaign-Urbana Community

Wireless Network (CUWiN); a search under CUWiN provides ample information about the

software (an open source routing daemon based on the HSLS protocol) that was built and

available for download in order for everyone to form an ad hoc network. In addition, a short

course (20 hours) was presented based on the work in these papers, at the University of

Trento (2004) and several times as part of a graduate course in my own University.

Own Contribution: My contribution in this work amounts to conceiving the basic idea (of

jointly time and space – modulated approach, that was earlier also included in a proposal that

I had submitted to NSF) and supervising and collaborating closely with my Ph.D. student C.

Santivanez, to develop the various models and side-concepts, as well as the derivations

required to prove the asymptotic scalability.

(II) - Work on information caching

- N. Laoutaris, S. Syntila, I. Stavrakakis, “Meta Algorithms for Hierarchical Web Caches,”

IEEE IPCCC, April 2004, Phoenix, Arizona. (Google Scholar citations 194)

- N. Laoutaris, H. Che, I. Stavrakakis, “The LCD interconnection of LRU caches and its

analysis”, Performance Evaluation Journal, Vol. 63, No. 7, pp. 609-634, 2006. (Google

Scholar citations 230)

The main contribution of this work amounts to developing an innovative, yet simple, caching

strategy that is shown to clearly outperform standard ones. This caching scheme has become

popular and substantially cited in very recent years, when information-centric networking

gained much attention. In a multi-level cache, such as those used for web caching, a hit at

some level l leads to caching the requested object in all intermediate caches on the reverse

path. This work shows that a simple modification to this de facto (then) behavior, in which

only the l −1 level cache gets to store a copy, can lead to significant performance gains. The

modified caching behavior is called Leave Copy Down (LCD); it has the merit of being able

to avoid the amplification of replacement errors and also the unnecessary repetitious caching

of the same objects at multiple levels. Simulation results against other cache

interconnections show that when LCD is applied under typical web workloads, it reduces the

average hit distance. The earlier publication presents and investigates a number of caching

strategies (meta-algorithms) while the later (journal) publication focuses – among others - on

developing an approximate analytic model for the case of LCD interconnection of LRU

caches and use it to gain a better insight as to why the LCD interconnection yields an

improved performance.

Recognition: Besides the good number of citations, it should be noted that this work was

only recently discovered by other researchers (since most citations are very recent),

reflecting its relevance to the emerging information-centric networking. Thus, the work

appears to have a long-term appeal and most likely will continue to attract interest in the near

future.

Own Contribution: My contribution in this work amounts to identifying the problem with

the standard caching approaches, providing insights into the design of the new strategy,

closely interacting with and supervising my Ph.D. student N. Laoutaris on the stochastic

modeling aspects of the work and determining the performance metrics and results to

support the merit of the new strategy, as well as overseeing and contributing to the

preparation of the publication of the work.

(III) - Work on (human-driven) distributed resource competition

- E. Kokolaki, M. Karaliopoulos, I. Stavrakakis, “Opportunistically-assisted parking service

discovery: now it helps, now it does not”, Pervasive and Mobile Computing (PMC),

Elsevier, Vol. 8, Iss. 2, pp. 210–227, April 2012. (Google Scholar citations 43).

- E. Kokolaki, M. Karaliopoulos, I. Stavrakakis, “Leveraging information in parking

assistance systems”, IEEE Transactions on Vehicular Technology, 62, 4309–4317, 2013.

(Google Scholar citations 29).

- E. Kokolaki, M. Karaliopoulos, I Stavrakakis, "On the human-driven decision-making

process in competitive environments", Internet Science Conference, April 10-11, 2013,

Brussels. Best student paper award - Special Award mention. (Google Scholar citations 3).

These works form a cluster that opens up fundamental challenges and further activity that is

expected to emerge in the near future. More specifically, the first work illustrates that more,

widely spread resource availability information in a highly connected world increases the

intensity of competition and congestion, and may frequently be counter-productive and

inferior to not providing any information; this key observation has motivated this thread of

research. The second work studies the resource competition from a game-theoretic

perspective under various levels of information and a rational behavior of the players,

pointing again to the benefits of different levels of information, deriving the equilibrium

strategies, assessing the price of anarchy (lack of coordination among the players) and

providing practically useful observations on the impact of the various costs involved in the

game. The third work, brings into the decision arena bounded rationalism, as demonstrated

by humans possessing biases and limited computational capability. It studies the

effectiveness of decisions to compete or not by employing prospect theory and other models

capturing human biases coming from experimental psychology (incorporating a rationality

parameter capturing the range from fully rational to random decisions), including heuristics.

A comparison of the induced costs under the rational and of bounded rationality decision

models and heuristics reveals that human-driven decisions may be far more cost-effective

than those foreseen for rational players under the Nash Equilibrium strategy.

For completeness, the summaries of the three papers are presented below.

The first paper explores the way the discovery of service can be facilitated or not by utilizing

service location information that is opportunistically disseminated primarily by the service

consumers themselves. The study is applied to the real-world case of parking service in busy

city areas. As the vehicles drive around the area, they opportunistically collect and share

with each other information on the location and status of each parking spot they encounter.

This opportunistically assisted scenario is compared against one that implements a “blind”

non-assisted search and a centralized approach, where the allocation of parking spots is

managed by a central server with global knowledge about the parking space availability.

Results obtained for both uniformly distributed travel destinations and a single hotspot

destination reveal that the relative performance of the three solutions can vary significantly

and not always in-line with intuition. Under the hotspot scenario, the opportunistic system is

consistently outperformed by the centralized system, which yields the minimum times and

distances at the expense of more distant parking spot assignments; whereas, for uniformly

distributed destinations, the relative performance of all three schemes changes with the

vehicle volume, with the centralized approach gradually becoming the worst solution and the

opportunistic one emerging as the best scheme. We discuss how each approach modulates

the information dissemination process in space and time and resolves the competition for the

parking resources. We also outline models providing analytical insights to the behavior of

the centralized approach.

The second paper approaches the parking assistance service in urban environments as an

instance of service provision in non-cooperative network environments. We propose

normative abstractions for the way drivers pursue parking space and the way they respond to

partial or complete information for parking demand and supply as well as specific pricing

policies on public and private parking facilities. The drivers are viewed as strategic agents

who make rational decisions attempting to minimize the cost of the acquired parking spot.

The resulting games are formulated as resource selection games and their equilibria are

derived under different expressions of uncertainty about the overall parking demand. The

efficiency of the equilibrium states is compared against the optimal assignment that could be

determined by a centralized entity and conditions are derived for minimizing the related

price of anarchy value. The results provide useful hints for the pricing and practical

management of on-street and private parking resources. More importantly, they exemplify

counterintuitive less-is-more effects about the way information availability modulates the

service cost, which underpin general competitive service provision settings and contribute to

the better understanding of effective information mechanisms.

The emergence of intelligent sensing and communication technologies fosters the generation

and dissemination of huge amounts of information that collectively enriches people’s

awareness about their environment and its resources. With this information at hand, users

then decide how to access these resources to best serve their interests. However, situations

repeatedly emerge where the users’ welfare is better satisfied by the same finite set of

resources and the uncoordinated access to them gives rise to tragedy of commons effects and

serious congestion problems. In the third paper, we study generic scenarios, where some

non-excludable finite resource is of interest to a population of distributed users with variable

perceptions about the resource supply and demand for it. The high-level question we

address is how efficiently the competition about the resources is resolved under different

assumptions about the way the users make their decisions. The users are first viewed as

strategic perfectly informed software agents that make fully rational decisions attempting to

minimize the cost of accessing the acquired resource. We then exploit insights from

experimental economics and cognitive psychology to model agents of bounded rationality

who either do not possess perfect information or cannot exploit all the available information

due to time restrictions and computational limitations. We derive the operational states in

which the competing influences are balanced (i.e., equilibria) and compare them against the

Nash equilibria that emerge under full rationality and the optimum resource assignment that

could be determined by a centralized entity. Our results provide useful insights to the

dynamics emerging from the agents’ behavior as well as theoretical support for the practical

management of limited-capacity resources

Recognition: Although this work has received many less citations than other works, it is

included here as being – in my view – a significant one, due to its potential impact on

emerging and future environments. The overview of this work has been presented in several

seminars (Georgia Tech, Rice University, Technical University of Darmstadt, IMDEA

Networks Institute), in a short publication in the on-line Awareness Magazine (“Competition

Awareness: Understanding decision-making in competitive environments provides useful

insight into the dynamics of agent behavior”), in an invited publication/presentation at the

ICNC’15 conference (“Managing competition for (public) resources in human-centric

networked environments”) and in a keynote talk at the Fifth International Conference on

Information, Intelligence, Systems and Applications - IISA'14 (“Managing competition for

(public) resources: Decision-making and some congestion cost cutting approaches”). This

work has formed the basis for a recently initiated collaboration with UC3M, Spain (Prof.

Angel Sanchez) manifested through (a) a joint publication (under preparation) aiming at

experimentally assessing the analytical results of my aforementioned work and (b) a

proposal submitted on Oct. 4, 2018 by UC3M-GISC Group to the call "Proyectos de I+D de

Generación de Conocimiento 2018" of the Ministerio de Ciencia, Innovación y

Universidades (Spain), where I appear as collaborator and an experimental follow up to my

aforementioned work is included. It should also be mentioned that the third paper received

the second best paper award at the interdisciplinary Internet Science Conference. Finally, the

inter-disciplinarity of the work, together with the non-networking application domain

(parking-case) and the relatively small age of this work are believed to have contributed to

the limited citations to date.

Own Contribution: My contribution in this work amounts to identifying the problem that

wide information dissemination brings to the competition and initiating this thread of work,

providing guidance in formulating the research challenges, closely interacting with and

supervising my Ph.D. student E. Kokolaki on the game-theoretic aspects and guiding into

making the connection to prospect theory and determining the comparison approach between

the rational and of bounded rationality models. Throughout the work, I was also determining

the next major step and checking on / revising proofs and derivations. Finally, I was the main

contributors to the write up of the last 2 papers.

1.2 List of the submitted publications (with a maximum number of 20) in addition to those listed at

point 1.1. For each publication and/or set of publications, the candidate is required to briefly

describe his/her contribution, their scientific/technical significance and individual importance,

the overall impact of the results in the international scientific community.

The significance of the works cited below is based on the quality of the publication venue, the

outlined contribution in the work summary and the citations.

1. P. Pantazopoulos, M. Karaliopoulos, I. Stavrakakis, “Distributed Placement of Autonomic

Internet Services”, IEEE Transactions on Parallel and Distributed Systems, Vol.25, No.7,

pp.1702-12, July 2014. (Google Scholar Citations 9)

The optimal placement of service facilities largely determines the capability of a data network to

efficiently support its users’ service demands. As centralized solutions over large-scale

distributed environments are extremely expensive, inefficient or even infeasible, distributed

approaches that rely on partial topology and demand information are the only credible

approaches to the service placement problem, even at the expense of non-guaranteed optimality.

In this paper, we propose a distributed service migration heuristic that iteratively solves

instances of the 1-median problem pushing progressively the service to more cost-effective

locations. Key to our algorithm is a traffic-aware centrality metric, called weighted

conditional betweenness centrality (wCBC), that captures the ability of a node to act as

service demand concentrator and is employed in both selecting the nodes and setting their

weights for the 1-median problem instance. The assessment of our heuristic proceeds in two

steps. First, assuming (ideal) knowledge of the invoked wCBC metric, we carry out a proof-of-

concept study that demonstrates the effectiveness of the heuristic over synthetic and real-

world topologies as well as its advantages against comparable local-search-like migration

schemes. Next, we devise practical protocol implementations that approximate the heuristic

using local measurements of transit traffic and preserve the excellent accuracy and fast

convergence properties of the algorithm for different routing policies. Our solution applies to a

broad range of networking scenarios, and is very relevant to the emerging trends for in-network

storage and involvement of the end-user in the creation and distribution of lightweight

(autonomic) service facilities.

Own Contribution: I proposed the problem and set the objectives. I was guiding heavily the

work and I devised the new conditional betweeness centrality metric that was key to enabling the

work. I participated in the write up of the work.

2. E. Jaho, M. Karaliopoulos, I. Stavrakakis, “Social Similarity Favors Cooperation: the Distributed

Content Replication Case”, IEEE Transactions on Parallel and Distributed Systems, Vol. 24, Iss.

3, pp. 601-613, March 2013 (Google Scholar Citations 21)

This paper explores how the degree of similarity within a social group can dictate the

behavior of the individual nodes, so as to best trade-off the individual with the social

benefit. More specifically, we investigate the impact of social similarity on the effectiveness

of content placement and dissemination. We consider three schemes that represent well the

spectrum of behavior-shaped content storage strategies: the selfish, the self-aware cooperative,

and the optimally altruistic ones. Our study shows that when the social group is tight (high

degree of similarity), the optimally altruistic behavior yields the best performance for both

the entire group (by definition) and the individual nodes (contrary to typical expectations).

When the group is made up of members with almost no similarity, altruism or cooperation

cannot bring much benefit to either the group or the individuals and thus, selfish behavior

emerges as the preferable choice due to its simplicity. Notably, from a theoretical point of

view, our “similarity favors cooperation” argument is in-line with sociological interpretations of

human altruistic behavior. On a more practical note, the self-aware cooperative behavior could

be adopted as an easy to implement distributed alternative to the optimally altruistic one; it has

close to the optimal performance for tight social groups and the additional advantage of not

allowing mistreatment of any node, i.e., its induced content retrieval cost is always smaller than

the cost of the selfish strategy.

Own Contribution: I proposed the problem and set the objectives. I was guiding the work in all

steps and providing insight into the findings. I participated in the write up of the work.

3. K. Oikonomou, I. Stavrakakis, “Scalable Service Migration in Autonomic Network

Environments", IEEE Journal on Selected Areas in Communications (JSAC), Vol. 28, No. 1, pp.

84-94, Jan. 2010. (Google Scholar Citations 39)

Service placement is a key problem in communication networks as it determines how efficiently

the user service demands are supported. This problem has been traditionally approached through

the formulation and resolution of large optimization problems requiring global knowledge and a

continuous recalculation of the solution in case of network changes. Such approaches are not

suitable for large-scale and dynamic network environments. In this paper, the problem of

determining the optimal location of a service facility is revisited and addressed in a way

that is both scalable and deals inherently with network dynamicity. In particular, service

migration which enables service facilities to move between neighbor nodes towards more

communication cost-effective positions, is based on local information. The migration policies

proposed in this work are analytically shown to be capable of moving a service facility between

neighbor nodes in a way that the cost of service provision is reduced and – under certain

conditions – the service facility reaches the optimal (cost minimizing) location, and locks in

there as long as the environment does not change; as network conditions change, the

migration process is automatically resumed, thus, naturally responding to network dynamicity

under certain conditions. The analytical findings of this work are also supported by simulation

results that shed some additional light on the behavior and effectiveness of the proposed policies.


work of my Ph.D. student, working closely with him in all steps. I participated heavily in the

write up of the work.

4. E. Jaho, I. Stavrakakis, "Joint Interest- and Locality-Aware Content Dissemination in Social

Networks", Sixth Annual Conference on Wireless On Demand Network Systems and Services,

IFIP/IEEE WONS 2009, Feb. 2-4, 2009, Snowbird, Utah, USA. (Google Scholar Citations 44)

Social groups are typically formed by nodes that share common interests (interest-induced social

groups), with no implication on the geographic location of these nodes. In addition to such

groups, mobile nodes form groups also as they move around and come to a locality where they

can establish communication with other nodes (locality-induced social groups). This paper

investigates the intermingling of these distinct types of social groups and proposes an

approach that can enhance content dissemination in the presence of such groups.

Specifically, we introduce a framework for modelling this environment (both, the nodes’

dynamic association to such groups and the dynamic usability of the content) and explore the

conditions under which a proposed cooperative strategy can enhance the content

dissemination process compared to a selfish one. This work basically explores how mobility

and cooperative content storage strategies can help bridge interest-induced social groups, or how

the joint association of nodes with interest- and locality-induced social groups can be exploited

to enhance content dissemination.


work of my M.Sc. student, working closely with her in all steps. I was the main contributor to

the write up of the work.

5. A Panagakis, A Vaios, “On the effects of cooperation in DTNs”, Communication Systems

Software and Middleware, 2007. COMSWARE 2007, January 7-12, 2007, Bangalore, India.

(Google Scholar Citations 117)

In a Delay Tolerant Network (DTN) the nodes may behave autonomously deciding on their own

whether to implement or not the rules of a routing algorithm. In this paper, the effects of node

cooperation (or lack of it) are explored for three well-known routing algorithms proposed

for DTNs with respect to the message delivery delay and the transmission overhead incurred

until message delivery or the termination of the message spreading process. The results show

that the sensitivity of the algorithms to the cooperation degree can be high, to the point of

making them inferior to algorithms they typically outperform under a fully cooperative

environment. Finally, it is demonstrated how a simple mechanism that incorporates the

cooperation degree can help improve effectiveness.

Own Contribution: I proposed the problem and set the objectives. I developed the insight and

was the main contributor to the paper write up. I participated in guiding all other key aspects,

including result selection and presentation.

6. N. Laoutaris, G. Smaragdakis, K. Oikonomou, I. Stavrakakis, A. Bestavros, "Distributed

Placement of Service Facilities in Large-Scale Networks," IEEE INFOCOM'07, May 6-12,

2007, Anchorage, Alaska. (Google Scholar Citations 100)

The effectiveness of service provisioning in largescale 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 reoptimization 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.

Own Contribution: I proposed the problem and set the objectives. I solved the problem of

mapping the outside traffic on the ball surface, which made the approach possible and effective.

I participated in the write up and the selection and assessment of the results.

7. Antonis Panagakis, Athanasios Vaios and Ioannis Stavrakakis, "Study of two-hop message

spreading in DTNs ", 5th Intl. Symposium on Modeling and Optimization in Mobile, Ad Hoc,

and Wireless Networks (WiOpt), April 16-20, 2007, Limassol, Cyprus. (Google Scholar

Citations 29)

In this paper, a delay tolerant network environment is considered where the source is in full

control of the two-hop spreading mechanism by setting key parameters such as the number of

copies allowed to be spread in the network and the delay bound of the messages. The analysis

allows for a differentiation between the source of the message and the intermediate nodes

(in terms of e.g. transmission power or speed). Analytical expressions for the cumulative

distribution function (cdf) of the delivery delay and the induced overhead are extracted,

taking into account the fact that the source node may continue spreading copies after the

message delivery. In addition, a fairly accurate approximate expression for the cdf of the

delivery delay is also derived and validated through simulations.

Own Contribution: I proposed the problem and set the objectives. I participated in deriving the

analytical models. I participated in the write up and the selection and discussion of the results.

8. N Laoutaris, O Telelis, V Zissimopoulos, I Stavrakakis, “Distributed selfish replication”, IEEE

Transactions on Parallel and Distributed Systems 17 (12), 1401-1413, 2006 (Google Scholar

Citations 149).

In this work the initial model of distributed replication group of Leff, Wolf, and Yu (IEEE TPDS

’93) is extended to the case that individual nodes act selfishly, i.e., cater to the optimization of

their individual local utilities. Our main contribution is the derivation of equilibrium object

placement strategies that: (a) can guarantee improved local utilities for all nodes concurrently

as compared to the corresponding local utilities under greedy local object placement; (b) do not

suffer from potential mistreatment problems, inherent to centralized strategies that aim at

optimizing the social utility; (c) do not require the existence of complete information at all

nodes. We develop a baseline computationally efficient algorithm for obtaining the

aforementioned equilibrium strategies and then extend it to improve its performance with respect

to fairness. Both algorithms are realizable in practice through a distributed protocol that requires

only limited exchange of information.

Own Contribution: Except from the formal proofs of convergence, I participated in all other

aspects. I proposed the problem and set the objectives, as well as the environment and metrics to

consider. I was also involved in the write up of the work.

9. N. Laoutaris, V. Zissimopoulos, I. Stavrakakis, “On the Optimization of Storage Capacity

Allocation for Content Distribution”, Computer Networks Journal, Vol. 47, No. 3, pp. 409-428,

2005. (Google Scholar Citations 120)

The addition of storage capacity in network nodes for the caching or replication of popular data

objects results in reduced end-user delay, reduced network traffic, and improved scalability. The

problem of allocating an available storage budget to the nodes of a hierarchical content

distribution system is formulated; optimal algorithms, as well as fast/efficient heuristics, are

developed for its solution. An innovative aspect of the presented approach is that it combines all

relevant subproblems, concerning node locations, node sizes, and object placement, and

solves them jointly in a single optimization step. The developed algorithms may be utilized in

content distribution networks that employ either replication or caching/replacement. In

addition to reducing the average fetch distance for the requested content, they also cater to load

balancing and workload constraints on a given node. Strictly hierarchical, as well as hierarchical

with peering, request routing models are considered.

Own Contribution: Except from the formal proofs, I participated in all other aspects. I proposed

the problem and set the objectives, as well as the metrics to consider. I was also involved in the

write up of the work.

10. K. Oikonomou and I. Stavrakakis, "Analysis of a Probabilistic Topology-Unaware TDMA MAC

Policy for Ad-Hoc Networks," IEEE JSAC Special Issue on Quality-of-Service Delivery in

Variable Topology 22 (7), 1286-1300, 2004 (Google Scholar Citations 71)

The design of an efficient Medium Access Control (MAC) for ad-hoc networks is challenging.

Topology-unaware TDMA-based schemes, suitable for ad-hoc networks, that guarantee a

minimum throughput, have already been proposed. These schemes consider a deterministic

policy for the utilization of the assigned scheduling time slots that never utilizes non-assigned

slots although in such slots collision-free transmissions are possible even under heavy traffic

conditions. A simple probabilistic policy, capable of utilizing the non-assigned slots

according to an access probability, fixed for all users in the network, is introduced and

analyzed here. The conditions under which the system throughput under the probabilistic

policy is higher than that under the deterministic policy are derived analytically. Further

analysis of the system throughput is shown to be difficult or impossible for the general case and

certain approximations have been considered whose accuracy is also investigated. The

approximate analysis determines the value for the access probability that maximizes the system

throughput as well as simplified lower and upper bounds that depend only on a topology

density metric. Simulation results demonstrate the comparative advantage of the probabilistic

policy over the deterministic policy and show that the approximate analysis successfully

determines the range of values for the access probability for which the system throughput under

the probabilistic policy is not only higher than that under the deterministic policy, but it is also

close to the maximum.

Own Contribution: I proposed the problem and set the objectives. I was guiding the work of my

Ph.D. student, working closely with him in all steps. I participated heavily in the write up of the

work.

11. Z. Antoniou, I. Stavrakakis, "Deadline Credit-based Transport for Soft Real-Time Applications",

IEEE/ACM Transactions on Networking, Vol. 10, No. 5, pp. 630-643, 2002. (Google Scholar

Citations 20)

In this paper, an efficient scheme is proposed based on the introduced deadline-credit-based

(DC) policy. This scheme is appropriate for any prerecorded media, but is particularly relevant

for prerecorded semisoft continuous media (CM) applications. Semisoft are applications with

very small initial delay tolerance and, thus, for which very small amount of content may be sent

in advance. The proposed policy pushes content toward the end user during the session by

taking advantage of any bandwidth underutilization periods, exploiting available storage,

and building up fairly a deadline credit to be consumed during periods of overutilization.

The scheduling policy is studied for the single-hop case (applicable to the server of the

content), as well as for the multi-hop case (applicable to the server and network nodes). The

derived results demonstrate the ability of the proposed scheme to decrease the amount of

required bandwidth (or equivalently induced losses) with respect to alternative schemes without

requiring large initial delay, which is not acceptable for semisoft CM applications.


work of my Ph.D. student, working closely with her in all steps. I derived most of the analytical

results. I participated heavily in the write up of the work.

12. N. Laoutaris, I. Stavrakakis, "Adaptive Playout Strategies for Packet Video Receivers with Finite

Buffer Capacity", IEEE International Conference on Communications (ICC'01), June 11-14,

2001, Helsinki. (Google Scholar Citations 61)

Due to random delay variations in current best effort networks, packet video applications rely on

end-system buffering and playout adaptation to reduce the effects of disruptions on the required

smooth stream presentation. To study the effect of buffering and playout adaptation, we present

an analytical model based on the M/G/1 queueing system with finite buffer capacity and

traffic intensity equal to or greater than unity. This model fits well a range of new

applications that have limited buffer resources for the reception of incoming frames. We

introduce the Variance of Distortion of Playout (VDoP), a new metric that accounts for the

overall presentation disruption caused by buffer underflows, intentionally introduced gaps

during slowdown periods and data loss from overflows. VDoP is an elegant and fair metric for

the estimation of playout quality and will hopefully assist the development of better adaptation

algorithms. Furthermore, the effect of finite buffer capacity is examined in relation to stream

continuity, revealing a system behavior not previously accounted for. The sensitivity of the

system to the variance of the arrival process is also examined by means of simulation. Finally, an

online algorithm is presented for the exploitation of our study on implemented systems.

Own Contribution: I proposed the problem and set the objectives. I was guiding the work of my

Ph.D. student, working closely with him in all steps. I participated heavily in the write up of the

work.

13. S. Iatrou, I. Stavrakakis, "A Dynamic Regulation and Scheduling Scheme for Real Time Traffic

Management", IEEE/ACM Transactions on Networking, Vol. 8, No. 1, pp.60-70, Feb. (Google

Scholar Citations 21)

Typical rate-based traffic management schemes for real-time applications attempt to allocate

resources by controlling the packet delivery to the resource arbitrator (scheduler). This control is

typically based only on the characteristics of the particular (tagged) traffic stream and would fail

to optimally adjust to non-nominal network conditions such as overload. In this paper, a

dynamic regulation and scheduling (dynamic-R&S) scheme is proposed whose regulation

function is modulated by both the tagged stream’s characteristics and information

capturing the state of the coexisting applications as provided by the scheduler. The

performance of the proposed scheme—versus an equivalent static one—is investigated under

both underload and overload traffic conditions. The substantially better throughput/jitter

characteristics of the dynamic- R&S scheme are established.


work of my Ph.D. student, working closely with him in all steps. I derived most of the analytical


14. J. Capone, I. Stavrakakis, "Delivering QoS Requirements to Traffic with Diverse Delay

Tolerances in a TDMA Environment", IEEE/ACM Transactions on Networking, Vol. 7, No. 1,

pp. 75-87, Feb. (Google Scholar Citations 25)

The focus of this paper is on determining the call admission region and scheduling policies

for a time-division multiple-access (wireless) system supporting heterogeneous realtime

variable bit rate applications with distinct quality of service (QoS) requirements and traffic

characteristics. The QoS is defined in terms of a maximum tolerable packet delay and dropping

probability. A packet is dropped if it experiences excess delay. The call admission region is

established for policies that are work-conserving (WC) and that satisfy the earliest due date

(EDD) service criterion (WC-EDD policies). Such policies are known to optimize the overall

system performance. In addition to the determination of the call admission region, this study

leads also to the construction of scheduling policies that deliver any performance in the

region established for WC-EDD policies. Finally, an upper bound on the call admission

region that can be achieved under any policy (not limited to the WC-EDD policies) is

determined.


work of my Ph.D. student, working closely with him in all steps. I derived part of the analytical


15. J. Capone, I. Stavrakakis, "Achievable QoS in an Interference/Resource-Limited Shared

Wireless Channel", IEEE Journal on Selected Areas in Communications, Vol. 17, No. 11, pp.

2041-2051, Nov. 1999. (Google Scholar Citations 13)

In this work, the region of achievable quality-of-service (QoS) is precisely described for a

system of real-time heterogeneous variable bit rate (VBR) sources competing for slots (packet

transmission times) of a time division multiple access (TDMA) frame. The QoS for each

application is defined in terms of a maximum tolerable packet-dropping probability. Packets may

be dropped due to delay violations and channel induced errors. The region of achievable QoS is

precisely described for an interference/resource limited network by considering the

underlying TDMA-multiple access control (TDMA-MAC) structure and the physical

channel. A simple QoS-sensitive error-control protocol that combats the effects of the

wireless channel while satisfying the real-time requirements is proposed and its impact on

the region of achievable QoS is evaluated. The results presented here clearly illustrate the

negative impact of a poor channel and the positive impact of the employed error-control

protocol on the achievable QoS. The region of achievable QoS vectors is central to the call

admission problem, and in this work, it is used to identify a class of scheduling policies capable

of delivering any achievable performance.


work of my Ph.D. student, working closely with him in all steps. I derived part of the analytical

results. I conceived and formulated the interference-affected environment and model. I

participated heavily in the write up of the work.

16. R. Landry, I. Stavrakakis, "Study of Delay Jitter With and Without Peak Rate Enforcement",

IEEE/ACM Transactions on Networking, Vol. 5, No. 4, pp. 543-553, Aug.1997 (Google Scholar

Citations 29)

In this paper, the modification of a tagged traffic stream due to statistical multiplexing is studied

by presenting a numerical approach for the calculation of the tagged delay jitter and

interdeparture processes. Both the single- and multiple node cases are considered. Unlike the

past work, the developed approach is applicable under both the standard FCFS policy and a

peak-rate enforcing multiplexing policy. The latter policy can be adopted to reshape the

tagged traffic stream within the network. Restoring a shaped traffic profile within the network

may be necessary to obtain some of the benefits for which the original shaping is carried out at

the network edge. This study also provides results and insight regarding the potential gains

of reregulation within the network.




17. R. Landry, I. Stavrakakis, "Queuing Study of a 3-Priority Policy with Distinct Service

Strategies", IEEE/ACM Transactions on Networking, Vol. 1, No. 5, Oct. 1993 (Google Scholar

Citations 22)

In this paper, a discrete-time, single server, 3-queue system is presented and analyzed. A distinct

service strategy, namely the consistent-gated (c-G), 1-limited (L) and Head-of-Line (HoL),

is applied to each of the queues. It is shown that this queueing system provides for an

accurate analytical model for a DQDB station, as well as a means for an approximate

evaluation of the correlation associated with key traffic processes in that network. In

addition, the developed queueing system could be useful for the modeling of the queueing

behavior of an ATM link shared by high-priority, low priority and control traffic. Through an

asymptotic analysis under heavy low-priority traffic, the worst case performance for the

high priority traffic is determined. Furthermore, it is illustrated that the asymptotic

analysis provides for a potentially tight delay bounding technique. Finally, the delay

performance of the developed queueing system is compared to that of a similar system in which

one of the queues receives 1-limited service and the other two exhaustive.




18. I. Stavrakakis, "Efficient Modeling of Merging and Splitting Processes in Large Networking

Structures", IEEE Journal on selected Areas in Communications, Vol. 9, No.8, Oct. 1991.

(Google Scholar Citations 43)

The packet traffic generated by a source of information undergoes transformation at both the

access points and within a large networking structure, due to merging and splitting operations.

Such points of traffic transformation are present in almost all networking systems, such as high-

speed switching systems, and systems of interconnected LAN’s and B-ISDN’s. In this paper,

simple models are developed for the description of a first-order Markovian (bursty)

process modulated by merging and/or (independent or correlated) splitting operations. The

developed models can be adopted for the packet traffic description in large networking

structures, supporting multimedia packet traffic. This is due to the fact that the complexity of

these models does not change as the number of points of transformation increases. On the

other hand, the bursty traffic model is capable of describing a variety of packet sources. The

induced packet delay at the merging points is evaluated. A queueing system is studied for this

purpose under a general class of arrival processes, which include the adopted packet traffic

models. Numerical results are obtained which are compared with simulations whenever

approximations are involved.

Own Contribution: I am the sole contributor to this work.

19. I. Stavrakakis, D. Kazakos, "On the Approximation of the Output Process of Multi-user Random

Access Communication Networks", IEEE Transactions on Communications, Vol. 38, No. 2, Feb.

1990. (Google Scholar Citations 19)

Bernoulli and first-order Markov processes are used to approximate the output process of a class

of slotted multiuser random-access communication networks. The output process is defined as

the process of the successfully transmitted packets within the network. The parameters of the

approximating processes are analytically calculated for a network operating under a

specific random access algorithm. The applied methods are general and can be used to

calculate these parameters in the case of any random access algorithm within a class. To

evaluate the accuracy of the approximations, a star topology of interconnected multiuser

random-access communication networks is considered. The mean time that a packet spends in

the central node of the star topology is calculated under the proposed approximations of the

output processes of the interconnected networks. The results are compared to simulation results

of the actual system. It turns out that the memoryless approximation gives satisfactory

results up to a certain per network traffic load. Beyond that per network traffic load, the

first-order Markov process performs better.

Own Contribution: I was he prime contributor in all aspects of the work.

20. I. Stavrakakis, D. Kazakos, "A limited Sensing Protocol for Multi-user Packet Radio Systems",

IEEE Transactions on Communications, Vol. 37, No. 4, April 1989. (Google Scholar Citations

9)

A protocol for a multiuser packet radio communication channel is proposed. The basic functions

of this protocol are determined by a modified stack-type limited sensing collision resolution

algorithm. The protocol is a hybrid of a pure random-access scheme and a reservation

scheme. A message consists of a number of packets that are capable of revealing the

current activity of the channel. The performance of the system is investigated in terms of

throughput and average message delay and analytical results are provided.

Own Contribution: I was he prime contributor in all aspects of the work.

1.3 Complete list of all the significant publications of the candidate, including those listed at points

1.1 and 1.2 (to be attached to the end of the Curriculum).

(see end of this document)

2. Coordination of research and technology transfer groups and projects.

Coordination and management of research groups, possibly with international

relationships and collaborations; explicit mention of the number and of the type of PhD

and Post-Doc students, of whom the candidate has been the academic supervisor;

Scientific responsibility (Principal Investigator) of competitive National and

International research projects, awarded through a peer-review process.

Scientific responsibility of National and International research projects, ruled through

partnership agreements with companies and/or public private bodies, which are leaders

in their own sector.

Outcomes obtained in the field of technology transfer, in terms of participation in start-

ups and spin-offs, development, use and commercialization of patents/licenses.

Research Group and International Collaborations

Managing research groups of M.Sc. and Ph.D. students at the University of Vermont

(1988-1994), at Northeastern University (1994-1999) and at the University of Athens

(1999- present - http://anr.di.uoa.gr/).

Numerous international collaborators from USA, Italy, Spain, Germany,

Netherlands, United Kingdom, Cyprus, France and some other countries, mainly (but

not only) through collaborations in the context of EU projects. The resulted

publications are in the list of publications and are those including co-authors with

non-Greek names. Also it is worth mentioning my participation in the examination

committee of 13 Ph.D. students in universities abroad (Spain (2), Netherlands (3),

Germany, UK, France (2), Italy (2), Cyprus (2)).

Supervised Ph.D. Dissertations

1. Ioannis Manolopoulos, “Methodologies for Effective Self-adaptive Decisions in Routing, Signalling, Cooperation, and Other Operations in Diverse Mobile Networks” (2015, University

of Athens). Currently with the Institute of Informatics & Telecommunications NCSR

'Demokritos', Athens, Greece.

2. Panagiotis Pantazopoulos, “Internet Content Management using Complex Network Analysis techniques”, (2014, University of Athens), Currently post-doc, National Technical University of

Athens.

3. Evaggelia Kokolaki, “Information dissemination and consumption in competitive networking urban environments” (2014, University of Athens).

4. Eva Jaho, “Cooperative mechanisms for information dissemination and retrieval in networks with autonomous nodes” (2011, University of Athens). Currently with the Athens Technology

Center (ATC S.A.), Athens, Greece.

5. Emmanouil Kafetzakis, "Effective Capacity-based Stochastic Guarantees for Systems with Time-Varying Servers, with an Application to IEEE 802.11 WLANs” (2011, University of

Athens). Currently with the Institute of Informatics & Telecommunications NCSR 'Demokritos',

Athens, Greece.

6. Leonidas Tzevelekas, "Energy efficient algorithms for topology control and information dissemination/ retrieval in large scale Wireless Sensor Networks” (2010, University of Athens).

Employment: : Greek NREN, GRNet, Athens Greece.

7. Dimitris Kogias, "Study and Design of Algorithms for Information Dissemination in Unstructured Networking Environments", (2010, University of Athens). Employment: TEI

Athens

8. Constantinos Vassilakis, “Content distribution support in modern wireless and wired networks”, (2008, University of Athens). Employment: Greek NREN, GRNet.

9. Athanasios Vaios, “Short-range multi-hop communication extension to Wireless LANS”, (2008, University of Athens). Employment: Information Systems Division, at the University of Athens.

10. Pandelis Balaouras, “Rate Adaptation Schemes for Continuous Media Steams”, (2005, University of Athens). Employment: Multimedia Division at the University of Athens.

11. Nikolaos Laoutaris, “Modeling and Optimization of Content Networks”, (2004, University of Athens). Employment: Marie-Curie Post-Doc Fellow, Boston University – University of Athens;

Post- Doc Fellow at Harvard University; Researcher at Telefonica I&D, Barcelona.

12. Konstantinos Oikonomou, “Topology Unaware MAC Protocols for Ad Hoc Networks”, (2004, University of Athens). Employment: Associate professor, Ionian University, Corfu, Greece.

13. Antonis Panagakis, “Study of the capacity of Static Weight Allocation Scheduling schemes and Wireless Multi-hop Networks”, (2004, University of Athens). Employment: Hellenic

Telecommunications and Post Commission (EETT).

14. Cesar Santivanez, “Mechanisms toward a Multi-mode Routing Protocol for Mobile Ad Hoc Networks”, (2001, Northeastern University, USA). Employment: BBN Technologies, Boston

(USA).

15. Zoe Antoniou, “Scheduling Algorithms for Application-Level QoS Support of Continuous Media Streams”, (1999, Northeastern University, USA). Employment: Nokia Research Center,

Boston (USA).

16. Tamer Dag, “Proactive/Reactive Congestion Control Schemes for High Speed Networks”, (1999, Northeastern University, USA). Employment: Lucent Technologies; Isik University

(Turkey).

17. Jeffrey Capone, “Achievable QoS and Scheduling Policies for Integrated Services Wireless Networks”, (1997, Northeastern University, USA). Employment: Arizona State University

(USA);

18. Mohamed Abdelaziz, “Traffic Management and Congestion Control”, (1995, University of Vermont, USA). Employment: Lucent Technologies;

19. Randall Landry, “Performance Evaluation of Asynchronous Transfer Mode (ATM) Networks”, (1994, University of Vermont, USA). Employment: Texas Instruments, Dallas (USA); Mitre

Corp., Boston (USA).

20. Sophia Tsakiridou, “Queuing Analysis of Resource Allocation Policies for Communication Networks” (1994, University of Vermont, USA). Employment: University of Vermont (USA);

Canadian Research Center (CA); Technical University of Crete.

Supervised Funded Post-Doctoral Research Associates

1. Dr. Evangelia Kokolaki (2014 - 2015), currently with ministry of Education

2. Dr. Leonidas Tzevelekas (2014 - 2015)

3. Dr. Merkourios Karaliopoulos (2009 – 2012). - Marie-Curie Grant Retune, currently with the Athens University of Business and Economics.

4. Dr. Konstantinos Oikonomou (2006-2010), currently Associate Professor, Ionian University

5. Dr. Christos Xenakis (2007-2009), currently Associate Professor, University of Peiraias

6. Dr. Gregoris Karagiorgos (2007-2009), currently Professor, Higher Technological Institute of Sparta.

7. Dr. Giannis Koukoutsidis (2007-2008)

8. Dr. Nikolaos Laoutaris (2006-07), - Marie-Curie Grant CoMig, currently with currently with Telefonica Research I+D, Barcelona.

Funded Research Projects

The funding level to date for the projects listed below amounts to: over 1 million dollars (USA

agents), over 4 million Euros (Greek and European Union funding agencies).

European Funded Research Projects (2000- present)

Title: “SEOP Social Electricity Online Platform)” Lifelong Learning Program. Funding Agency: European Union (EU). Period: 1/1/2014 -31/12/2015. Participating Organizations: University of

Cyprus (CY), MT MIEMA (MT), ECC (AT), EAC (CY), KREA (LT), INTEGRA (SI), MEATH

(IE), CARDET (CY), QUALED (SK). [Principal Investigator for UoA].

Title: “EINS (European InterNet Science)” Network of Excellence, Program: Information Societies Technology – Future Internet Research & Experimentation- FIRE. Funding Agency:

European Union (EU). Period: 1/10/2011 -30/05/2015. Participating Organizations: About 35

research organizations and Universities. [Principal Investigator for UoA].

Title: “RECOGNITION: Relevance and cognition for self-awareness in a content-centric Internet”. Program: Information Societies Technology – Future Emerging Technologies (IST-

FET). Funding Agency: European Union (EU). Period: 1/10/2010 -30/09/2013. Participating

Organizations: Cardiff University (CU), Italian Research Council (CNR), University of

Cambridge (UCAM), National and Kapodistrian University of Athens (NKUA), Institut

Eurécom (EUR), Universita Degli Studi Di Firenze. [Principal Investigator for UoA].

Title: “Retune: Resilience of Opportunistic Networks to Node Misbehaviors”, Program: EU Marie Curie Fellowship Program, Period: 6/2010 – 05/2012. [Principal Investigator for UoA]

Title: “SOCIALNETS: Social Networking for Pervasive Adaptation”, Program: Information Societies Technology – Future Emerging Technologies (IST-FET). Funding Agency: European

Union (EU). Period: 1/2/2008 – 31/1/2011. Participating Organizations: Cardiff University (CU),

Italian Research Council (CNR), University of Cambridge (UCAM), National and Kapodistrian

University of Athens (NKUA), University of Oxford (OXF), University of Aveiro (UAVR)

Institut Eurécom (EUR). [Principal Investigator for UoA].

Title: “CONTENT: Content Networks and Services for Home Users” (Network of Excellence), Program: Information Societies Technology – IST. Funding Agency: European Union (EU).

Period: 07/2006 – 06/2009. Participating Organizations: 11 Universities from Europe. [Principal

Investigator for UoA].

Title: “BIONETS: BIOlogically-inspired autonomic NETworks and Services”. Program: Information Societies Technology – Future Emerging Technologies (IST-FET). Funding

Agency: European Union (EU). Period: 1/1/2006 – 31/12/2009. Participating Organizations:

CREATE-NET + IIT-CNR + University of Trento (CN, CN-CNR, CN-UNITN), Universität

Basel (UBASEL, Technische Universität Berlin (TUB), Hamburger Informatik Technologie-

Center e.V. (UNIHH), RWTH Aachen University (RWTH), Imperial College London (IC),

Budapest University of Technology and Economics (BUTE), Nokia corporation (NOKIA),

Valtion Teknillinen Tutkimuskeskus (VTT), Institut National de Recherche en Informatique et

Automatique (INRIA), National and Kapodistrian University of Athens(NKUA), Telecom Italia

Learning Services SpA (TILS), London School of Economics and Political Science (LSE), Sun

Microsystems Iberica SA (SUN). [Principal Investigator for UoA].

Title: “ANA: Autonomic Network Architectures”. Program: Information Societies Technology – Future Emerging Technologies (IST-FET). Funding Agency: European Union (EU). Period:

1/1/2006 – 31/12/2009. Participating Organizations: Eidgenoessische Technische Hochschule

Zurich, University of Basel, NEC EUROPE LTD, University of Lancaster, Fraunhofer

Gesellschaft zur Foerderung der angewandten Forschung, Université de Liege, Université Paris

VI Pierre et Marie Curie, National and Kapodistrian University of Athens, Universitetet I Oslo,

Telekom Austria, University of Waterloo. [Principal Investigator for UoA].

Title: “CASCADAS: Component-ware for Autonomic, Situation-aware Communications And Dynamically Adaptable Services”. Program: Information Societies Technology – Future

Emerging Technologies (IST-FET). Funding Agency: European Union (EU). Period: 1/1/2006 –

31/12/2008. Participating Organizations: Telecom Italia S.p.A., British Telecommunications,

Budapest University of Technology and Economics BUTE, Fraunhofer Institute for Open

Communication Systems FOKUS, Imperial College London ICL, INSTITUT EURECOM EUR,

Politecnico di Milano - Dipartimento di Elettronica e Informazione, National and Kapodistrian

University of Athens NKUA, Universität Kassel UNIK, Université Libre de Bruxelles ULB,

Università di Modena e Reggio Emilia UNIMORE, Università degli Studi di Trento UNITN,

University of Ulster UU, Consorzio per l'innovazione nella gestione delle imprese e della PA.

[Principal Investigator for UoA].

Title: “CoMig: The Content Migration (CoMig) paradigm for Internet content dissemination”, Program: EU Marie Curie Outgoing Fellowship Program, Period: 3/2005 – 9/2006. [Principal


Title: “ACCA: Autonomic Communication Coordination Action”. Program: Information Societies Technology – IST, Future Emerging Technologies. Funding Agency: European Union

(EU). Period: 10/2004 – 03/2006. Participating Organizations: 11 Universities from Europe.

[Principal Investigator for UoA].

Title: “E-NEXT: Network of Excellence in Emerging Networking Experiments and Technologies”, Program: Information Societies Technology – IST. Funding Agency: European

Union (EU). Period: 01/2004 – 06/2006. Participating Organizations: 41 Universities from

Europe. [Principal Investigator for UoA].

Title: “E-NET: Emerging Networking (Network of Excellence)”. Program: Information Societies Technology – IST. Funding Agency: European Union (EU). Period: 07/2002 –

12/2003. Participating Organizations: 14 Universities from Europe. [Principal Investigator for

UoA].

Title: “BROADWAY (Broadway, the way to broadband access at 60GHz)”, Program: Information Societies Technology – IST. Funding Agency: European Union (EU). Period: 01/02

– 12/04. Participating Organizations: Motorola SA (France), IMST GmbH (Germany), Technical

University of Dresden (Germany), Netherlands Organization for Applied research (Netherlands),

Intracom SA (Greece), University of Athens (Greece). [Principal Investigator for UoA].

Title: “A Video Gateway between the Next Generation Broadband Internet and the Current Narrow Band Internet for Live and On-Demand Access (VideoGateway)”. Program: Information

Societies Technology – IST. Funding Agency: European Union (EU). Period: 01/00 – 12/02.

Participating Organizations: Optibase (Israel), Matra Systemes & Information (France), T-Nova

(Germany), CSELT (Italy), Teracom (Sweden), University of Athens (Greece). [Principal


Greek Funded Research Projects (2000- present)

Title: “Opportunistic Adjustable Routing Mechanisms for Wireless Networks”. Program: International Cooperation. Funding Agency: General Secretariat for Research and Technology

(G.S.R.T) of Greece. Period: 03/06 – 03/08. Participating Organizations: University of Pisa

(UoP), Pisa, Italy, University of Athens (Greece). ” [Principal Investigator for UoA]

Title: “Ad-hoc Wireless and Sensor Networking: Algorithms, protocols and architectural studies”. Program: PENED2005. Funding Agency: General Secretariat for Research and

Technology (G.S.R.T) of Greece. Period: 2/2005 – 12/2008. Contributing/participating

Organizations : INTRACOM. [Principal Investigator for UoA]

Title: “Short-Range, Multi-hop extensions WLANs”. Funding Agency: Greek Ministry of Education, program Pythagoras II. Period: 15/2005-12/2006. [Principal Investigator for UoA]

Title: “Data Distribution in Wired/wireless Networks”. Funding Agency: Greek Ministry of Education, program Hrakleitos”,. Period: 1/2004-11/2005. [Principal Investigator for UoA]

Title: “Traffic Management of Video Streams over the Internet”. Program: International Cooperation. Funding Agency: General Secretariat for Research and Technology (G.S.R.T) of

Greece. Period: 07/02 – 06/04. Participating Organizations: CNR – Istituto CNUCE, Pisa, Italy,

University of Athens (Greece). ” [Principal Investigator for UoA].

Title: “Mechanisms for Networked Multimedia Support”, University of Athens, Research Committee. Period: 2001. [Principal Investigator].

Title: “Resource Management and Traffic Control for Wide Area Networks under QoS Constraints”. Program: EPET II. Funding Agency: General Secretariat for Research and

Technology (G.S.R.T) of Greece. Period: 01/00 – 09/01. Participating Organizations: Greek

National Centre for Scientific research (NCSR) Demokritos, National Technical University of

Athens (NTUA), University of Athens (Greece). ” [Principal Investigator for UoA].

Title: “Mechanisms for Networked Multimedia Support”, University of Athens, Research Committee. Period: 2000. [Principal Investigator].

U.S.A. Funded Research Projects (1990-1999)

U.S.A. National Science Foundation, Research Initiation Award. Period: 1990-1992.Title: “Performance Analysis of Communication Networks under m|τ|MM|r|B Packet Arrival

Processes”. [Principal Investigator].

U.S.A. Department of Defense, Advanced Research Project Agency (ARPA). Period: 1992-1995. Title: “Development of User-Matched/Network-Friendly Traffic Profiles for Congestion

Control in High Speed Fiber Optics Networks”. [Principal Investigator].

GTE Government Systems Corporation. Period: 8/1/91 – 7/31/96. Title: “Research and Curriculum Development in Communication Networks”. [Principal Investigator after 9/94].

Northeastern University, College of Engineering. Title: “Student Support for Research on Resource Management for Diverse Quality of Service (QoS) Delivery in Communication

Networks”. [Principal Investigator].

U.S.A. National Science Foundation. Period: 9/1/96 – 8/31/1999. Title: “Time-Constant-Based Traffic Control and Multiplexing for High-Speed Networks”. [Principal Investigator].

Motorola, Inc. Period: 3/15/98-9/15/98. Title: “Research on Protocols for Broadband Access” [Principal Investigator].

BBN Technologies (GTE Internetworking. Period: 11/98-9/99. Title: “Density Adaptive Routing for the DAWN Project” [Principal Investigator].

U.S.A. Department of Defense, Advanced Research Project Agency (ARPA). Period: 1993-1996. Title: “Multi-scale Digital Communications”, [One of 6 Co-Principal Investigators].

Italian National Research Council (CNR). Period: 1995-1996. Title: “Real-Time Traffic Management in High-speed Integrated Services Networks”. Institution: CNR – Istituto CNUCE,

Pisa, Italy. [USA co-Investigator].

GTE Corporation. Period: 1997-1998. Title: “Research and Curriculum Development in Wireless Communication Systems”. [One of 6 Co-Principal Investigators].

3. National and international reputation and professional activity for the scientific

community

Editorship of Journals with international reputation (in the role of Editor in Chief – EIC),

editorship of book series, encyclopedias and essays of recognized prestige.

Participation in the Editorial Board of Journals with international reputation (in the role

of Associate Editor or equivalent), participation in the Editorial Board of book series,

encyclopedias and essays of recognized prestige.

Direction of highly qualified international institutions or research centers.

Official research and/or teaching and/or fellowship roles, positions as Scholar/ Visiting

Professor in international highly qualified universities and research centers.

Offices in the Governing bodies of national and international scientific societies.

Participation in Academies with international reputation in the research field of the

candidate.

Prizes and awards awarded to the candidate for his/her scientific activity and project

activity in the Academic Fields, where this is appropriate.

Participation in international conferences, as a distinguished invited speaker;

participation in the scientific committees of International Conferences.

Management and organisation of exhibitions, compositions, drawings, design, hand-

crated items, prototypes, artwork and their projects, databases and software, thematic

maps, for the Academic Fields, where this is appropriate.

Participation in the Editorial Board of Journals with international reputation (in the

role of Associate Editor or equivalent)

Proceedings of the IEEE Journal (2015 - )

Elsevier Computer Communications Journal (2008 - ).

IEEE/ACM Transactions on Networking (2001 - 2008)

ACM/Springer Wireless Networks (WINET) Journal (1998 - 2009).

Computer Networks (The International Journal for Computer and Telecommunications Networking), North-Holland (1999 - 2006).

Official research and/or teaching and/or fellowship roles, positions as Scholar/ Visiting

Professor in international highly qualified universities and research centers

Visiting professor of the University Carlos III de Madrid (UC3M/Santander Chair of Excellence, 3/2018 – 9/2018).

Visiting professor of the University Carlos III de Madrid (UC3M) and IMDEA Networks Institute (Chair of Excellence Comunidad de Madrid, 3/2017-2/2018),

Mercator Fellow of the German Research Foundation-DFG (2017-2020), foreseeing extended visits to TU Darmstadt that hosts the DGF MAKI center.

Visiting Professor, University of Trento (2/2004).

National Technological University (NTU) Instructor, 1994 – 97.

Visiting Scientist, CNUCE Institute of the Italian National Research Council (CNR), Pisa, Italy (May – July 1994).

Visiting Scientist, Queen’s University, Kingston, Canada (Aug. 1990).

Research Assistant, University of Virginia, 1984 – 1988.

Offices in the Governing bodies of national and international scientific societies.

National representative of IFIP Greek Computer and Telecommunications Society to IFIP-TC6, (2009 - 2011)

Chair of IFIP TC6.3 (2003-2008): International Federation for Information Processing (IFIP), Working Group WG6.3 on Performance of Communication

Systems

Conference Coordinator, IEEE Technical Committee on Computer Communications (TCCC) [Elected officer, 7/97-7/99.]

Vice Chair of Autonomic Communication Forum (2004 - 2006).

Prizes and awards awarded to the candidate for his/her scientific activity and project

activity in the Academic Fields, where this is appropriate.

Fellow of IEEE (Institute of Electrical and Electronics Engineers) since 2007.

UC3M/Santander Chair of Excellence Award, 2018.

Comunidad de Madrid Chair of Excellence Award, 2017.

Mercator Fellow Award (German Research Foundation – DFG), 2017 – 2020.

USA National Science Foundation Research Initiation Award, 1990.

Best Paper Award at the Fifth International Workshop on Mobile Multimedia Communication, Oct. 12-14, 1998, Berlin, Germany.

Best Paper Award at the Second International Workshop on Quality of Future Internet Services (QofIS’2001), Sept. 24-26, 2001, Coimbra, Portugal.

Best Track Paper Award at the 38th Hawaii International Conference on System Sciences, HICSS-38, January 3-6, 2005, Big Island, Hawaii.

Best student paper award - Special Award mention at the Internet Science Conference, April 10-11, 2013, Brussels

Participation in international conferences, as a distinguished invited speaker

I. Stavrakakis, “Adaptive Message Routing and Information Acquisition in Dynamic Mobile Networking Environments”, Seventh Nordic Workshop on System &

Network Optimization for Wireless (SNOW), Jan 17-19, 2016, Cortina D’Ampezzo,

Italy. (invited talk).

I. Stavrakakis, “The Social Layer in Resource Competition”, First International Conference on Engineering and Natural Science, May 15-19, 2015, Skopje, FYROM

(invited talk).

I. Stavrakakis, “Resolving Resource Competition in Smart Environments: From Anarchy and Games to Mobile Application-enabled Coordination”, Sixth Nordic

Workshop on System & Network Optimization for Wireless (SNOW), 18-20 March

2015, Geilo, Norway. (invited talk).

I. Stavrakakis, “Managing competition for (public) resources in human-centric networked environments”, invited talk at the International Conference on

Computing, Networking and Communications (ICNC 2015), Feb. 16-19, 2015,

Anaheim, California, USA. http://www.conf-icnc.org/2015/ (invited talk).

I. Stavrakakis, “Managing competition for (public) resources: Decision-making and some congestion cost cutting approaches”, Fifth International Conference on

Information, Intelligence, Systems and Applications (IISA'14), July 8, 2014, Chania,

Crete, Greece. (keynote talk)

I. Stavrakakis, “The Human Layer in Decision-Making in Networked Environments”, at the IEEE International Conference on Computer, Information,

and Telecommunication Systems (CITS 2013), May 7-8, 2013, Piraeus, Greece.

http://atc.udg.edu/CITS2013/#keynotes (keynote talk)

I. Stavrakakis, “Exploiting Social Metrics in Content Distribution”, IEEE Symposium on Computers and Communications (ISCC 2011), June 28-July 1,

Corfu. http://www.ieee-iscc.org/2011/speakers.htm (keynote talk)

I. Stavrakakis, “How much can social metrics actually help in content distribution?” Internet Science Workshop, June 18, 2011, IMDEA Networks, Madrid.

http://events.networks.imdea.org/content/workshop-2011/program (invited talk)

I. Stavrakakis, “Exploiting the Social Layer in Content Placement and Distribution”, 4th IEEE Workshop on Enabling the Future Service-Oriented Internet: Towards

Socially-Aware Networks, in conjunction with IEEE GLOBECOM 2010, Miami,

USA, December 6, 2010 http://www.nprg.ncsu.edu/events/EFSOI/workshop10/

(Invited Featured Talk).

I. Stavrakakis, “Autonomicity and Behavioural Drivers (or optimizing the socio-tech layers) in Content Distribution�

CURRICULUM VITAE SURNAME AND NAME Stavrakakis ......CURRICULUM VITAE SURNAME AND NAME Stavrakakis, Ioannis Home Address Phone number Fax number E-mail address [email protected] Nationality

Text of CURRICULUM VITAE SURNAME AND NAME Stavrakakis ......CURRICULUM VITAE SURNAME AND NAME Stavrakakis,...

3.1. ioannis papanikolaou

Ioannis Polemis - Xeimonan8oi

Stavrakakis Critics&Art

Rezumat Klitorakis Ioannis

Yannis Stavrakakis On Laclau's Alleged Monism

Tetoros Ioannis MSc 2015

Prof. Ioannis Paspaliaris

GLYNOS, Jason; STAVRAKAKIS, Yannis - On Lacans Style and Use of Mathematical Science

Dr Ioannis Kotsiopoulos The University of Manchester [email protected]

In Evangelium Ioannis

Agios Ioannis Chrysostomos

Scalability of Ad Hoc Routing Protocolscgi.di.uoa.gr/~istavrak/courses/05_PDT_Part4_Scal.pdf · Ioannis Stavrakakis 2005 1 Scalability of Ad Hoc Routing Protocols References: C. Santivanez,

Dr. George M. Stavrakakis

Ioannis Protops Panag Canons

Stavrakakis - La Izquierda Lacaniana

ioannis kapodistrias

Stavrakakis Final

M. Karaveziroglou-Weber, E. Stavrakakis · 2014. 5. 20. · Restoration problems of historical stone buildings in Central Greece M. Karaveziroglou-Weber, E. Stavrakakis Department

Ioannis Stavridis, Contextual Customer Engagement · Title: Ioannis Stavridis, Contextual Customer Engagement Author: Ioannis Stavridis Created Date: 5/22/2016 3:48:01 PM

CURRICULUM VITAE SURNAME AND NAME Stavrakakis, Ioannis · CURRICULUM VITAE SURNAME AND NAME Stavrakakis, Ioannis Home Address Phone number Fax number E-mail address [email protected]

Zizioulas Ioannis - Fiinta Eclesiala

Ioannis project portfolio selected

Ioannis passas ta orfika

Workshops ioannis tomkos

Ioannis Iakovidis

Dr. Ioannis Kostas

BEDROOMS - mykonosdreamliving.com · BEDROOMS AGIOS IOANNIS IOANNIS RETREAT. This exclusive property, located over Agios Ioannis bay, on the western side of Mykonos, enjoys extensive

Valldolid Magnisalis Ioannis

Research on Wireless Networks at NKUA Prof. Ioannis Stavrakakis Communication Networks Laboratory Dep. of Informatics and Telecommunications National &

Apostolou Ioannis

Documents

CURRICULUM VITAE SURNAME AND NAME Stavrakakis ......CURRICULUM VITAE SURNAME AND NAME Stavrakakis, Ioannis Home Address Phone number Fax number E-mail address [email protected] Nationality

Text of CURRICULUM VITAE SURNAME AND NAME Stavrakakis ......CURRICULUM VITAE SURNAME AND NAME Stavrakakis,...