Savo Glisic

Savo Glisic

Auto-generated profile, based on publicly available information

Savo Glisic

Worcester Polytechnic Institute

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

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

Representative Publications

View All Publications
8 July 2020 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
IKIvana Kovacevic
Ivana Kovacevic
ASAlireza Shams Shafigh
Alireza Shams Shafigh
SGSavo Glisic
Savo Glisic
BLBeatriz Lorenzo
Beatriz Lorenzo
EHEkram Hossain
Ekram Hossain
With network slicing, physical networks are partitioned into multiple virtual networks tailored to serve different types of service with their specific requirements. In order to optimize the utilization of network resources for delay-critical applications, we propose a new multi-domain network virtualization framework based on a novel multipath multihop delay model. This framework encompasses a novel hierarchical orchestration mechanism for mapping network slices onto physical resources and a mechanism for dynamic slice resizing. The main idea is to locally redefine the delay requirements on each network domain depending on the conditions in the rest of the network. Delays larger than threshold (debt) are allowed in certain domains if there is a possibility to compensate such excessive delays in other segments of the network that can transmit the messages with less latency (credit). This tradeoff or delay threshold redefinition on different segments of the route is referred to as network latency equalization. For performance comparison, minimum cost routing with latency constraints is used as a baseline. We show that our approach enables significantly better utilization of the network resources measured in the number of slices with the same latency requirements that can be accommodated in the network.

14 May 2024 in Intelligent Systems with Applications
Verified
Journal Article
Open access
SGSavo Glisic
Savo Glisic
BLBeatriz Lorenzo
Beatriz Lorenzo

4 October 2022 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
ASAlireza Shams Shafigh
Alireza Shams Shafigh
BLBeatriz Lorenzo
Beatriz Lorenzo
SGSavo Glisic
Savo Glisic
YFYuguang Fang
Yuguang Fang
Vehicle-centric edge computing provides a promising approach to reducing the network operational costs of the future latency-limited applications (e.g. connected-autonomous vehicles, virtual reality) by migrating the required services toward the vehicle-provided resources. However, uncertainties from unknown traffic and availability of these resources as well as diversity of vehicle platforms can result in significant performance degradation of such service migration mechanisms. In this paper, we propose vehicle-centric networking concept to provide low latency services by designing time compression mechanism for computing programs so that the program execution latency can be significantly reduced. In addition, by jointly tailoring data and control planes we implement a highly responsive and cost-efficient edge service. By leveraging network functions virtualization (NFV) and software defined networking (SDN) technologies we provide a suitable environment for at-edge programmability to customize network functionalities for low latency services in multi-platooning systems for vehicular networks. We develop a responsive edge system by implementing control plane over pre-established access points (e.g., road-side units), allocating redundant resources, and utilizing an adaptive service migration mechanism in order to avoid any degradation of the quality of edge services. We design a robust double Knapsack (RDK) framework, where a spare knapsack of redundant resources is allocated to each plane to cope with the uncertainties of vehicle-provided resources. By combining with VNFs, SDN technology has been used to design a centralized management framework to control and monitor the edge computing in multi-platooning systems.

24 December 2002
Verified
Conference Paper
Closed access
SGS.G. Glisic
S.G. Glisic
RPR. Pickholtz
R. Pickholtz
WWWeiwei Wu
Weiwei Wu

4 October 2022 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
ASAlireza Shams Shafigh
Alireza Shams Shafigh
BLBeatriz Lorenzo
Beatriz Lorenzo
SGSavo Glisic
Savo Glisic
YFYuguang Fang
Yuguang Fang
In this paper, we propose an application customized network slicing mechanism to cope with dynamic traffic in future networks and various service requirements for network users, namely, context-aware network slicing (CANS). The resource allocation is carried out in frequency (f), space (s) and time (t) domains (referred to as three domains (3D) resource allocation) while the customization targets at low latency and high reliability, characteristic for IoT applications. We first formulate CANS as a two-step matching game with unknown preferences for access and back-haul networks. To dynamically resize mobile users' network slices (NSs), we propose application customized CANS++ method based on a coalition game to minimize the hand-off risk in the network. We then develop two-step stable matching (TSSM) and $\epsilon$ -Pareto stability techniques to find the solutions to CANS and CANS++, respectively. To improve energy and cost efficiency, an artificial intelligence-based Dynamic Network Architecture (DNA) with ON/OFF scheduling (AI-DOS) is proposed to dynamically maximize NS utilization. Finally, we carry out extensive numerical analysis and demonstrate that context-aware 3D network slicing and resizing schemes can improve at least three times the users' utilities. These utilities are enhanced up to $180\%$ by minimizing their hand-off risk. Furthermore, NS shrinking technique can reduce the number of active nodes (controlled in the s-domain) by factor five while the average utility of macro base stations, controlled in the t-domain, is improved between $70\%$ and $500\%$ .

1 July 2013
Verified
Conference Paper
Closed access
SGSavo Glisic
Savo Glisic
BLBeatriz Lorenzo
Beatriz Lorenzo
IKIvana Kovacevic
Ivana Kovacevic
YFYuguang Fang
Yuguang Fang
In this paper, we present a unified model for the analysis of a number of wireless network characteristics leading to the existence of uncertain links. The probabilistic characterization of the link uncertainty enables the random graph representation of the network topology and use of existing tools of complex networks in the system analysis. In the analysis, the multi-hop concept is adopted to model future networks with dense user population and enable mobile to mobile (m2m) connections. The potential users acting as relays may belong to different operators and as such may or may not want to cooperate. Consequently, the existence of those links will be uncertain. Some subareas of the cell will be covered by other technologies such as femto cell or WLAN enabling the possibility for the cellular system to offload the traffic. The existence of those links depends on the relaying distance and coverage of the WLAN, as well as the cooperation agreement between the operators. Our model includes also the possibility to consider green networks where the link uncertainty results from the effort to prevent the radiations from the terminal towards the user. In addition, security requirements may not accept every available relay. For this reason, the existence of the link, even when physically present, will be also uncertain. In such a complex network, cognitive links are also available with limited certainty due to unpredictable activity of the primary user. The uncertain and time varying existence of the links and nodes results into a Dynamic Network Architecture (DNA). AU these characteristics of the network are incorporated in a unified model enabling a tractable analysis of the overall system performance.