ESEfstathios Sykas

Efstathios Sykas

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Efstathios Sykas has a total of 7 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Putting Personal Smart Spaces into Context

    by Ioanna Roussaki, Nikos Kalatzis, Nicolas Liampotis, Pavlos Kosmides, Miltiades Anagnostou, Efstathios Sykas

    The convergence between mobile telecommunications and the Future Internet opened the way for the development of innovative pervasive computing services. The self-improving Personal Smart Spaces (PSSs) are coupling next generation mobile communications facilities with the features provided by the static smart spaces to support a more ubiquitous, mobile, context-aware, and personalised smart space. Addressing the advanced requirements of PSSs regarding the establishment of a robust distributed context management framework is a challenging task. Evaluating such a system is not a straightforward process, especially when it is also based on comparative assessments of its performance, as various existing systems demonstrate different unique characteristics making the quantitative comparisons quite complex and difficult to accomplish. This chapter elaborates on a context modelling and management approach that is suitable for addressing the PSS requirements and provides experimental evaluation evidence regarding its performance.


  • Searching for Information in a P2P System

    by I. Sygkouna, M. Anagnostou, E. Sykas

    In relation to decentralized search on top of P2P communication paradigm, we study a proactive mechanism that is based on the dissemination of advertisements for new sources that join a system. The system design goal of limiting the state maintained by each peer and ensuring search efficiency is the driving reason for exploiting the small-world idea, and in particular the hierarchical network model, which provides theoretical bounds on search time. Starting from the study of this theoretical model, we try to reflect it into protocol design. Simulation results testify to the theoretical bounds on search time and provide a quantification view on the search time in relation to the directory capacity requirements of the peers.