Irene Sygkouna
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Irene Sygkouna has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- A. Nikolaidis
National Technical University of Athens
1 shared publication E. Sykas
Sch. of Electr. & Comput. Eng., Nat. Tech. Univ. of Athens
1 shared publication- Efstathios Sykas
National Technical University of Athens, Greece
1 shared publication - George I. Stassinopoulos
National Technical University of Athens
1 shared publication M. Anagnostou
Sch. of Electr. & Comput. Eng., Nat. Tech. Univ. of Athens
1 shared publication- M. E. Anagnostou
Computer Networks Laboratory, School of Electrical and Computer Engineering, National Technical University of Athens, 9, Heroon Polytechneiou Str., 15773, Zografou, Athens, Greece;
1 shared publication
Latest Publications
- 25 May 2011
- Published by Springer Nature in Telecommunication Systems
- Vol. 52 (2)
A QoS-aware admission control scheme for bottleneck mitigation in Next-Generation Networks
- 25 May 2011
- Published by Springer Nature in Telecommunication Systems
- Vol. 52 (2)
A QoS-aware admission control scheme for bottleneck mitigation in Next-Generation Networks
- 20 September 2008
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 47 (1) , 77-96
Route planning for agent-based information retrieval
- 20 September 2008
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 47 (1) , 77-96
Route planning for agent-based information retrieval
- 1 January 2007
- Published by Taylor & Francis in International Journal of Computers and Applications
- Vol. 29 (4) , 394-401
Searching for Information in a P2P System
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.
- 1 January 2007
- Published by Taylor & Francis in International Journal of Computers and Applications
- Vol. 29 (4) , 394-401
Searching for Information in a P2P System
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.
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 1344-1349
A Proactive Mechanism for Efficient Information Discovery
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 that provides theoretical bounds on search time. Starting from the study of this theoretical model, we then tried to reflect it into protocol design. Simulation results testify 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
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 1344-1349
A Proactive Mechanism for Efficient Information Discovery
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 that provides theoretical bounds on search time. Starting from the study of this theoretical model, we then tried to reflect it into protocol design. Simulation results testify 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