George Iosifidis

George Iosifidis

Auto-generated profile, based on publicly available information

George Iosifidis

Department of Software Technology, Delft University of Technology, Delft, The Netherlands

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 September 2018 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
GPGeorgios S. Paschos
Georgios S. Paschos
GIGeorge Iosifidis
George Iosifidis
MTMeixia Tao
Meixia Tao
DTDon Towsley
Don Towsley
GCGiuseppe Caire
Giuseppe Caire
This paper has the following ambitious goal: to convince the reader that content caching is an exciting research topic for the future communication systems and networks. Caching has been studied for more than 40 years, and has recently received increased attention from industry and academia. Novel caching techniques promise to push the network performance to unprecedented limits, but also pose significant technical challenges. This tutorial provides a brief overview of existing caching solutions, discusses seminal papers that open new directions in caching, and presents the contributions of this special issue. We analyze the challenges that caching needs to address today, also considering an industry perspective, and identify bottleneck issues that must be resolved to unleash the full potential of this promising technique.

26 August 2014 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
KPKonstantinos Poularakis
Konstantinos Poularakis
GIGeorge Iosifidis
George Iosifidis
LTLeandros Tassiulas
Leandros Tassiulas
Small cells constitute a promising solution for managing the mobile data growth that has overwhelmed network operators. Local caching of popular content items at the small cell base stations (SBSs) has been proposed to decrease the costly transmissions from the macrocell base stations without requiring high capacity backhaul links for connecting the SBSs with the core network. However, the caching policy design is a challenging problem especially if one considers realistic parameters such as the bandwidth capacity constraints of the SBSs that can be reached in congested urban areas. We consider such a scenario and formulate the joint routing and caching problem aiming to maximize the fraction of content requests served locally by the deployed SBSs. This is an NP-hard problem and, hence, we cannot obtain an optimal solution. Thus, we present a novel reduction to a variant of the facility location problem, which allows us to exploit the rich literature of it, to establish algorithms with approximation guarantees for our problem. Although the reduction does not ensure tight enough bounds in general, extensive numerical results reveal a near-optimal performance that is even up to 38% better compared to conventional caching schemes using realistic system settings.

4 January 2016 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
KPKonstantinos Poularakis
Konstantinos Poularakis
GIGeorge Iosifidis
George Iosifidis
VSVasilis Sourlas
Vasilis Sourlas
LTLeandros Tassiulas
Leandros Tassiulas
The landscape toward 5G wireless communication is currently unclear, and, despite the efforts of academia and industry in evolving traditional cellular networks, the enabling technology for 5G is still obscure. This paper puts forward a network paradigm toward next-generation cellular networks, targeting to satisfy the explosive demand for mobile data while minimizing energy expenditures. The paradigm builds on two principles; namely caching and multicast. On one hand, caching policies disperse popular content files at the wireless edge, e.g., pico-cells and femto-cells, hence shortening the distance between content and requester. On other hand, due to the broadcast nature of wireless medium, requests for identical files occurring at nearby times are aggregated and served through a common multicast stream. To better exploit the available cache space, caching policies are optimized based on multicast transmissions. We show that the multicast-aware caching problem is NP-hard and develop solutions with performance guarantees using randomized-rounding techniques. Trace-driven numerical results show that in the presence of massive demand for delay tolerant content, combining caching and multicast can indeed reduce energy costs. The gains over existing caching schemes are 19% when users tolerate delay of three minutes, increasing further with the steepness of content access pattern.

9 September 2014 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
GIGeorge Iosifidis
George Iosifidis
LGLin Gao
Lin Gao
JHJianwei Huang
Jianwei Huang
LTLeandros Tassiulas
Leandros Tassiulas
The unprecedented growth of mobile data traffic challenges the performance and economic viability of today's cellular networks and calls for novel network architectures and communication solutions. Mobile data offloading through third-party Wi-Fi or femtocell access points (APs) can significantly alleviate the cellular congestion and enhance user quality of service (QoS), without requiring costly and time-consuming infrastructure investments. This solution has substantial benefits both for the mobile network operators (MNOs) and the mobile users, but comes with unique technical and economic challenges that must be jointly addressed. In this paper, we consider a market where MNOs lease APs that are already deployed by residential users for the offloading purpose. We assume that each MNO can employ multiple APs, and each AP can concurrently serve traffic from multiple MNOs. We design an iterative double-auction mechanism that ensures the efficient operation of the market by maximizing the differences between the MNOs' offloading benefits and APs' offloading costs. The proposed scheme takes into account the particular characteristics of the wireless network, such as the coupling of MNOs' offloading decisions and APs' capacity constraints. Additionally, it does not require full information about the MNOs and APs and creates nonnegative revenue for the market broker.

6 June 2014 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
LGLin Gao
Lin Gao
GIGeorge Iosifidis
George Iosifidis
JHJianwei Huang
Jianwei Huang
LTLeandros Tassiulas
Leandros Tassiulas
DLDuozhe Li
Duozhe Li
The unprecedented growth of mobile data traffic challenges the performance and economic viability of today's cellular networks and calls for novel network architectures and communication solutions. Data offloading through third-party WiFi or femtocell access points (APs) can effectively alleviate the cellular network congestion in low operational and capital expenditure. This solution requires the cooperation and agreement of mobile cellular network operators (MNOs) and AP owners (APOs). In this paper, we model and analyze the interaction among one MNO and multiple APOs (for the amount of MNO's offloading data and the respective APOs' compensations) by using thew Nash bargaining theory. Specifically, we introduce a one-to-many bargaining game among the MNO and APOs and analyze the bargaining solution (game equilibrium) systematically under two different bargaining protocols: 1) sequential bargaining, where the MNO bargains with APOs sequentially, with one APO at a time, in a given order; and 2) concurrent bargaining, where the MNO bargains with all APOs concurrently. We quantify the benefits for APOs when bargaining sequentially and earlier with the MNO, and the losses for APOs when bargaining concurrently with the MNO. We further study the group bargaining scenario where multiple APOs form a group bargaining with the MNO jointly and quantify the benefits for APOs when forming such a group. Interestingly, our analysis indicates that grouping of APOs not only benefits the APOs in the group but may also benefit some APOs not in the group. Our results shed light on the economic aspects and the possible outcomes of the MNO/APOs interactions and can be used as a roadmap for designing policies for this promising data offloading solution.

1 April 2018
Verified
Conference Paper
Closed access
AGAndres Garcia-Saavedra
Andres Garcia-Saavedra
XCXavier Costa-Perez
Xavier Costa-Perez
DLDouglas J. Leith
Douglas J. Leith
GIGeorge Iosifidis
George Iosifidis
Virtualized Radio Access Network (vRAN) architectures constitute a promising solution for the densification needs of 5G networks, as they decouple Base Stations (BUs) functions from Radio Units (RUs) allowing the processing power to be pooled at cost-efficient Central Units (CUs). vRAN facilitates the flexible function relocation (split selection), and therefore enables splits with less stringent network requirements compared to state-of-the-art fully Centralized (C-RAN) systems. In this paper, we study the important and challenging vRAN design problem. We propose a novel modeling approach and a rigorous analytical framework, FluidRAN, that minimizes RAN costs by jointly selecting the splits and the RUs-CUs routing paths. We also consider the increasingly relevant scenario where the RAN needs to support multi-access edge computing (MEC) services, that naturally favor distributed RAN (D-RAN) architectures. Our framework provides a joint vRAN/MEC solution that minimizes operational costs while satisfying the MEC needs. We follow a data-driven evaluation method, using topologies of 3 operational networks. Our results reveal that (i) pure C-RAN is rarely a feasible upgrade solution for existing infrastructure, (ii) FluidRAN achieves significant cost savings compared to D-RAN systems, and (iii) MEC can increase substantially the operator's cost as it pushes vRAN function placement back to RUs.