George Pallis
University of Cyprus
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by George Pallis.
Communications of The ACM | 2006
George Pallis; Athena Vakali
Striking a balance between the costs for Web content providers and the quality of service for Web customers.
IEEE Internet Computing | 2003
Athena Vakali; George Pallis
CDNs improve network performance and offer fast and reliable applications and services by distributing content to cache servers located close to users. The Webs growth has transformed communications and business services such that speed, accuracy, and availability of network-delivered content has become absolutely critical - both on their own terms and in terms of measuring Web performance. Proxy servers partially address the need for rapid content delivery by providing multiple clients with a shared cache location. In this context, if a requested object exists in a cache (and the cached version has not expired), clients get a cached copy, which typically reduces delivery time. CDNs act as trusted overlay networks that offer high-performance delivery of common Web objects, static data, and rich multimedia content by distributing content load among servers that are close to the clients. CDN benefits include reduced origin server load, reduced latency for end users, and increased throughput. CDNs can also improve Web scalability and disperse flash-crowd events. Here we offer an overview of the CDN architecture and popular CDN service providers.
IEEE Internet Computing | 2010
George Pallis
Cloud computing is a new field in Internet computing that provides novel perspectives in internetworking technologies and raises issues in the architecture, design, and implementation of existing networks and data centers. The relevant research has just recently gained momentum, and the space of potential ideas and solutions is still far from being widely explored.
New Directions in Web Data Management 1 | 2011
George Pallis; Demetrios Zeinalipour-Yazti; Marios D. Dikaiakos
The rapid proliferation of Online Social Network (OSN) sites has made a profound impact on the WWW, which tends to reshape its structure, design, and utility. Industry experts believe that OSNs create a potentially transformational change in consumer behavior and will bring a far-reaching impact on traditional industries of content, media, and communications. This chapter starts out by presenting the current status of OSNs through a taxonomy which delineates the spectrum of attributes that relate to these systems. It also presents an overall reference system architecture that aims at capturing the building blocks of prominent OSNs. Additionally, it provides a state-of-the-art survey of popular OSN systems, examining their architectural designs and business models. Finally, the chapter explores the future trends of OSN systems, presents significant research challenges and discusses their societal and business impact.
modeling, analysis, and simulation on computer and telecommunication systems | 2009
George Pallis; Dimitrios Katsaros; Marios D. Dikaiakos; Nicholas Loulloudes; Leandros Tassiulas
Vehicular ad hoc networks have emerged recently as a platform to support intelligent inter-vehicle communication and improve traffic safety and performance. The road-constrained and high mobility of the vehicles, their unbounded power source, and the emergence of roadside wireless infrastructures make VANETs a challenging research topic. A key to the development of protocols for intervehicle communication and services lies in the knowledge of the topological characteristics of the VANET communication graph. This article provides answers to the general question: how does a VANET communication graph look like over time and space? This study is the first one that examines a very large-scale VANET graph and conducts a thorough investigation of its topological characteristics using several metrics, not examined in previous studies. Our work characterizes a VANET graph at the connectivity (link) level, quantifies the notion of “qualitative” nodes as required by routing and dissemination protocols, and examines the existence and evolution of communities (dense clusters of vehicles) in the VANET. Several latent facts about the VANET graph are revealed and incentives for their exploitation in protocol design are examined.
ACM Transactions on Modeling and Computer Simulation | 2010
Konstantinos Stamos; George Pallis; Athena Vakali; Dimitrios Katsaros; Antonis Sidiropoulos; Yannis Manolopoulos
Content distribution networks (CDNs) have gained considerable attention in the past few years. Hence there is need for developing frameworks for carrying out CDN simulations. In this article we present a modeling and simulation framework for CDNs, called CDNsim. CDNsim has been designated to provide a realistic simulation for CDNs, simulating the surrogate servers, the TCP/IP protocol, and the main CDN functions. The main advantages of this tool are its high performance, its extensibility, and its user interface, which is used to configure its parameters. CDNsim provides an automated environment for conducting experiments and extracting client, server, and network statistics. The purpose of CDNsim is to be used as a testbed for CDN evaluation and experimentation. This is quite useful to both the research community (to experiment with new CDN data management techniques), and for CDN developers (to evaluate profits on prior certain CDN installations).
international world wide web conferences | 2008
Antonis Sidiropoulos; George Pallis; Dimitrios Katsaros; Konstantinos Stamos; Athena Vakali; Yannis Manolopoulos
Content distribution networks (CDNs) improve scalability and reliability, by replicating content to the “edge” of the Internet. Apart from the pure networking issues of the CDNs relevant to the establishment of the infrastructure, some very crucial data management issues must be resolved to exploit the full potential of CDNs to reduce the “last mile” latencies. A very important issue is the selection of the content to be prefetched to the CDN servers. All the approaches developed so far, assume the existence of adequate content popularity statistics to drive the prefetch decisions. Such information though, is not always available, or it is extremely volatile, turning such methods problematic. To address this issue, we develop self-adaptive techniques to select the outsourced content in a CDN infrastructure, which requires no apriori knowledge of request statistics. We identify clusters of “correlated” Web pages in a site, called Web site communities, and make these communities the basic outsourcing unit. Through a detailed simulation environment, using both real and synthetic data, we show that the proposed techniques are very robust and effective in reducing the user-perceived latency, performing very close to an unfeasible, off-line policy, which has full knowledge of the content popularity.
latin american web congress | 2005
George Pallis; Athena Vakali; Konstantinos Stamos; Antonis Sidiropoulos; Dimitrios Katsaros; Yannis Manolopoulos
Content distribution networks (CDNs) are increasingly being used to disseminate data in todays Internet. The growing interest in CDNs is motivated by a common problem across disciplines: how does one reduce the load on the origin server and the traffic on the Internet, and ultimately improve response time to users? In this direction, crucial data management issues should be addressed. A very important issue is the optimal placement of the outsourced content to CDNs servers. Taking into account that this problem is NP complete, a heuristic method should be developed. All the approaches developed so far assume the existence of adequate popularity statistics. Such information though, is not always available, or it is extremely volatile, turning such methods problematic. This paper develops a network-adaptive, non-parameterized technique to place the outsourced content to CDNs servers, which requires no a-priori knowledge of request statistics. We place the outsourced objects to these servers with respect to the network latency that each object produces. Through a detailed simulation environment, using both real and synthetic data, we show that the proposed technique can yield up to 25% reduction in user-perceived latency, compared with other heuristic schemes which have knowledge of the content popularity.
cluster computing and the grid | 2014
Demetris Trihinas; George Pallis; Marios D. Dikaiakos
Over the past decade, Cloud Computing has rapidly become a widely accepted paradigm with core concepts such as elasticity, scalability and on demand automatic resource provisioning emerging as next generation Cloud service-must have-properties. Automatic resource provisioning for Cloud applications is not a trivial task, requiring for both the applications and platform, to be constantly monitored, capturing information at various levels and time granularity. In this paper we describe the challenges that occur when monitoring elastically adaptive Cloud applications and to address these issues we present JCatascopia, a fully automated, multi-layer, interoperable Cloud Monitoring System. Experiments on different production Cloud platforms show that JCatascopia is a Monitoring System capable of supporting a fully automated Cloud resource provisioning system with proven interoperability, scalability and low runtime footprint. Most importantly, JCatascopia is able to adapt in a fully automatic manner when elasticity actions are enforced to an application deployment.
international conference on service oriented computing | 2014
Georgiana Copil; Demetris Trihinas; Hong Linh Truong; Daniel Moldovan; George Pallis; Schahram Dustdar; Marios D. Dikaiakos
Complex cloud services rely on different elasticity control processes to deal with dynamic requirement changes and workloads. However, enforcing an elasticity control process to a cloud service does not always lead to an optimal gain in terms of quality or cost, due to the complexity of service structures, deployment strategies, and underlying infrastructure dynamics. Therefore, being able, a priori, to estimate and evaluate the relation between cloud service elasticity behavior and elasticity control processes is crucial for runtime choices of appropriate elasticity control processes. In this paper we present ADVISE, a framework for estimating and evaluating cloud service elasticity behavior. ADVISE gathers service structure, deployment, service runtime, control processes, and cloud infrastructure information. Based on this information, ADVISE utilizes clustering techniques to identify cloud elasticity behavior produced by elasticity control. Our experiments show that ADVISE can estimate the expected elasticity behavior, in time, for different cloud services thus being a useful tool to elasticity controllers for improving the quality of runtime elasticity control decisions.
Collaboration
Dive into the George Pallis's collaboration.
Alexander Technological Educational Institute of Thessaloniki
View shared research outputs