Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Evangelia Tzifa

dblp:44/5319 · DBLP profile ↗
← Back
14ranked-venue papers
2as first author
0since 2021 · last 2003
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 12 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Cellular and mobile networks · 33% Wireless networking · 33% Network optimization and economics · 33%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Wireless networking
channel assignment
0.011999
Optimal adaptive spectrum utilization in cellular communications systems · IEEE Trans. Commun. 1999
Cellular and mobile networks
radio resource management
0.011999
Optimal adaptive spectrum utilization in cellular communications systems · IEEE Trans. Commun. 1999
Network optimization and economics
resource allocation
0.011999
Optimal adaptive spectrum utilization in cellular communications systems · IEEE Trans. Commun. 1999
Mathematical optimization › integer programming › binary optimization
0-1 integer programming
0.011999
Optimal adaptive spectrum utilization in cellular communications systems · IEEE Trans. Commun. 1999
Mathematical optimization
integer programming
0.011999
Optimal adaptive spectrum utilization in cellular communications systems · IEEE Trans. Commun. 1999

Methods — techniques the papers use, named apart from their topics

0-1 quadratic programming · 0.00-1 linear programming · 0.0
YearPublicationVenuePosition
2003 Design and control of the interconnecting network of the access segment of mobile communications systems
C. Sarantinopoulos, D. Karagiannis, Kostas Peppas 0001, Panagiotis Demestichas, Evangelia Tzifa, Vasiliki Demesticha, Michael E. Theologou
Comput. Commun.5
2002 Retailer selection in future open competitive communications environments
Malamati D. Louta, Panagiotis Demestichas, Evangelia Tzifa, Evangelos Loutas, Miltiades E. Anagnostou
Comput. Commun.3
2002 Introduction of accounting capabilities in future service architectures
Evangelia Tzifa, Panagiotis Demestichas, Nikos I. Liossis, Natalia D. Polydorou, Miltiades E. Anagnostou
J. Syst. Softw.1
2000 Computationally efficient algorithms for location area planning in future cellular systems
Panagiotis Demestichas, N. V. Georgantas, Evangelia Tzifa, Vasiliki Demesticha, Maria Striki, M. Kilanioti, Michael E. Theologou
Comput. Commun.3
1999 Issues in service creation for future open distributed processing environments
abstract
The success of service providers in the competitive communications market of the future will be determined by the efficiency with which the services will be developed, and the quality levels at which the services will be provided. A service creation environment (SCE) should provide the service developer with solutions to these problems. In this paper we present an SCE focusing on the service creation practice, the software technologies applied for the development of the service logic, the support of standardised service architectures, through libraries of service components, and the provision of QoS handling related facilities.
Panagiotis Demestichas, N. P. Polydorou, A. K. Kaltabani, Nikos I. Liossis, Serafim Kotrotsos, Evangelia Tzifa, Miltiades E. Anagnostou
ICC6
1999 Issues in the design of future mobile communication systems
abstract
The success of third-generation mobile communication systems, e.g., UMTS, will depend on the quality of service (QoS) that the mobile users will perceive, and whether the QoS levels will be provided in a cost efficient manner. In this perspective, the importance of tools for "proper" planning of a mobile system becomes straightforward. In the context of this paper, we present such planning tools related to the design of future mobile communication systems. In addition, we present a platform that enables the assessment of the derived solutions by means of simulation.
Panagiotis Demestichas, Evangelia Tzifa, Vasiliki Demesticha, Malamati D. Louta, D. Karagiannis, Michael E. Theologou
ICC2
1999 Use of agent technology in service and retailer selection in a personal mobility context
Didoe Prevedourou, Kostas Zygourakis, Sofoklis Efremidis, George D. Stamoulis, Dimitrios Kalopsikakis, Anna Kirikoglou, Vasilios A. Siris, Miltiades E. Anagnostou, Evangelia Tzifa, Tenia Louta, Panagiotis Demestichas, Nikos I. Liossis, Andreas Kind, Kirsi Valtari, Henryka Jormakka, Toni Jussila
Comput. Networks9
1999 Adaptive radio spectrum allocation through mid-term reconfigurations for cellular communications systems
Evangelia Tzifa, Panagiotis Demestichas, Malamati D. Louta, E. S. Tsouka, Michael E. Theologou, Miltiades E. Anagnostou
Comput. Commun.1
1999 Optimal adaptive spectrum utilization in cellular communications systems
abstract
Efficient spectrum utilization in third-generation cellular systems has motivated the study of the traffic adaptive channel allocation problem: given the set of channels, the cell structure and the load to be accommodated in each cell find the optimal allocation of channels to cells, subject to the reuse distance constraints. In this paper, we extend this scheme in order to include time fluctuating traffic loads. The extended problem is formulated and solved by reduction to 0-1 (linear and quadratic) programming.
Michael G. Kazantzakis, Panagiotis Demestichas, Evangelia Tzifa, Miltiades E. Anagnostou
IEEE Trans. Commun.3
1998 Design and performance assessment methods for third generation cellular systems
abstract
It is envisaged that future cellular systems, e.g., UMTS, will consist of three network segments, namely, core, access, and intelligent. In the context of this paper, we define and solve some of the design problems related to the design of the access and intelligent network segments. In addition, we present a platform that enables the assessment of the derived solutions by means of simulation. Our aim is to analyse, formally state, and theoretically formulate these problems, and to provide a platform for assessing the efficiency of the solutions to these problems.
Vasiliki Demesticha, D. Karagiannis, Evangelia Tzifa, Panagiotis Demestichas, Michael E. Theologou
ISCC3
1998 Adaptive channel allocation for cellular communication systems
abstract
Frequency reuse is a key property of cellular mobile communication systems. The frequency spectrum can be more effectively exploited if the allocation of the available channels to cells takes into account the traffic distribution. Dynamic channel allocation (DCA) algorithms adapt continuously to the traffic changes. In this paper both static and dynamic algorithms are proposed and studied. The optimization criterion used is the maximization of the total traffic volume, which is accommodated by the mobile system.
Panagiotis Demestichas, Evangelia Tzifa, Miltiades E. Anagnostou
ISCC2
1998 Advanced service creation in distributed heterogeneous environments
abstract
Important factors that will determine the success of service providers in the competitive communications market of the future are the efficiency with which the services will be developed, the "quality" of the service deployment, and the quality levels at which the services will be provided. A service creation environment (SCE) should provide the service developer with solutions to these problems. In this paper we present an SCE focusing on some essential characteristics, namely, the service creation practice underlying the operation of the SCE, and realisation in terms of existing software technologies and tools, the support of standardised service architectures.
Nikos I. Liossis, Natalia D. Polydorou, Evangelia Tzifa, Panagiotis Demestichas, Miltiades E. Anagnostou
ISCC3
1997 Efficient spectrum utilisation in third generation cellular communications systems
abstract
One of the most central issues in third generation telecommunication systems is efficient spectrum utilisation. This objective has motivated extensive research in the area of channel allocation techniques. The basic version of the channel allocation problem is the following: given a set of channels, the cell structure and the load to be accommodated in each cell, find the optimum allocation of channels to cells, subject to the restrictions concerning the distance of cells, where the same channel can be used. This problem handles a traffic load that is fixed with time. We extend this formulation so as to include time variant traffic loads and, hence, to obtain efficient spectrum utilisation. We consider two approaches to this extension, which are differentiated by the fact that the first involves a total reconfiguration of the channel allocation, while the second only a partial reconfiguration. Both approaches are theoretically formulated and solved. Finally, we present results and draw subsequent conclusions.
Panagiotis Demestichas, Vasiliki Demesticha, Evangelia Tzifa, Miltiades E. Anagnostou, Michael E. Theologou
ISCC3
1997 Traffic adaptive spectrum allocation for mobile communications systems
abstract
A fundamental notion in third generation mobile systems is efficient spectrum utilisation. A first approach of the traffic adaptive spectrum allocation problem is the following: given the set of channels, the cell structure and the load to be accommodated in each cell, find the optimal allocation of channels to cells, subject to the restrictions arising from the minimum permissible distance of cells where the same channel can be used at the same time. This problem presupposes a traffic load that is fixed with time. In this paper we extend this scheme in order to include fluctuating traffic loads. This extended scheme is theoretically formulated, and found to be a difficult problem. Finally, a set of results is presented.
Panagiotis Demestichas, Vasiliki Demesticha, Evangelia Tzifa, Miltiades E. Anagnostou, Michael E. Theologou
PIMRC3