Alija Pašić

Alija Pašić

Auto-generated profile, based on publicly available information

Alija Pašić

Department of Telecommunications and Media Informatics, Faculty of Electrical Engineering and Informatics, Budapest University of Technology and Economics, Budapest, Hungary

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
23 June 2022 in Sensors
Verified
Journal Article
Open access
PDF file
FMFerenc Mogyorósi
Ferenc Mogyorósi
PRPéter Revisnyei
Péter Revisnyei
APAzra Pašić
Azra Pašić
ZPZsófia Papp
Zsófia Papp
ITIstván Törös
István Törös
APAlija Pašić
Alija Pašić
Determining the position of ourselves or our assets has always been important to humans. Technology has helped us, from sextants to outdoor global positioning systems, but real-time indoor positioning has been a challenge. Among the various solutions, network-based positioning became an option with the arrival of 5G mobile networks. The new radio technologies, minimized end-to-end latency, specialized control protocols, and booming computation capacities at the network edge offered the opportunity to leverage the overall capabilities of the 5G network for positioning—indoors and outdoors. This paper provides an overview of network-based positioning, from the basics to advanced, state-of-the-art machine-learning-supported solutions. One of the main contributions is the detailed comparison of machine learning techniques used for network-based positioning. Since new requirements are already in place for 6G networks, our paper makes a leap towards positioning with 6G networks. In order to also highlight the practical side of the topic, application examples from different domains are presented with a special focus on industrial and vehicular scenarios.

11 January 2021 in IEEE Access
Verified
Journal Article
Open access
APAlija Pasic
Alija Pasic
RSRita Girão Silva
Rita Girão Silva
FMFerenc Mogyorosi
Ferenc Mogyorosi
BVBalazs Vass
Balazs Vass
TGTeresa Gomes
Teresa Gomes
JRJacek Rak
Jacek Rak
This paper focuses on how to increase the availability of a backbone network with minimal cost. In particular, the new framework focuses on resilience against natural disasters and is an evolution of the FRADIR/FRADIR-II framework. It targets three different directions, namely: network planning, failure modeling, and survivable routing. The steady state network planning is tackled by upgrading a sub-network (a set of links termed the spine) to achieve the targeted availability threshold. A new two-stage approach is proposed: a heuristic algorithm combined with a mixed-integer linear problem to optimize the availability upgrade cost. To tackle the disaster-resilient network planning problem, a new integer linear program is presented for the optimal link intensity tolerance upgrades together with an efficient heuristic scheme to reduce the running time. Failure modeling is improved by considering more realistic disasters. In particular, we focus on earthquakes using the historical data of the epicenters and the moment magnitudes. The joint failure probabilities of the multi-link failures are estimated, and the set of shared risk link groups is defined. The survivable routing aims to improve the network’s connectivity during these shared risk link group failures. Here, a generalized dedicated protection algorithm is used to protect against all the listed failures. Finally, the experimental results demonstrate the benefits of the refined eFRADIR framework in the event of disasters by guaranteeing low disconnection probabilities even during large-scale natural disasters.

1 May 2015 in Computer Networks
Verified
Journal Article
Closed access
PBPéter Babarczi
Péter Babarczi
APAlija Pašić
Alija Pašić
JTJános Tapolcai
János Tapolcai
FNFelicián Németh
Felicián Németh
BLBence Ladóczki
Bence Ladóczki

22 July 2022 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Open access
FMFerenc Mogyorosi
Ferenc Mogyorosi
PBPeter Babarczi
Peter Babarczi
JZJohannes Zerwas
Johannes Zerwas
ABAndreas Blenk
Andreas Blenk
APAlija Pasic
Alija Pasic
With the advent of 6G and its mission-critical and tactile Internet applications running in a virtualized environment on the same physical infrastructure, even the shortest service disruptions have severe consequences for thousands of users. Therefore, the network hypervisors, which enable such virtualization, should tolerate failures or be able to adapt to sudden traffic fluctuations instantaneously, i.e., should be well-prepared for such unpredictable environmental changes. In this paper, we propose a latency-aware dual hypervisor placement and control path design method, which protects against single-link and hypervisor failures and is ready for unknown future changes. We prove that finding the minimum number of hypervisors is not only NP-hard, but also hard to approximate. We propose optimal and heuristic algorithms to solve the problem. We conduct thorough simulations to demonstrate the efficiency of our method on real-world optical topologies, and show that with an appropriately selected representative set of possible future requests, we are not only able to approach the maximum possible acceptance ratio but also able to mitigate the need of frequent hypervisor migrations for most realistic latency constraints.

23 January 2020 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Open access
APAlija Pasic
Alija Pasic
PBPeter Babarczi
Peter Babarczi
JTJanos Tapolcai
Janos Tapolcai
EBErika R. Bérczi-Kovács
Erika R. Bérczi-Kovács
ZKZoltán Király
Zoltán Király
LRLajos Ronyai
Lajos Ronyai

11 January 2021 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Open access
FMFerenc Mogyorosi
Ferenc Mogyorosi
APAlija Pasic
Alija Pasic
RCRichard Cziva
Richard Cziva
PRPeter Revisnyei
Peter Revisnyei
ZKZsolt Kenesi
Zsolt Kenesi
JTJanos Tapolcai
Janos Tapolcai
In this paper, we propose a new protection scheme for backbone networks to guarantee high service availability. The presented scheme does not require any reconfiguration immediately after the failure (i.e., it is proactive). At the same time, it does not require any reserved backup network resources either. To achieve these seemingly contradictory goals, we utilize the recent advancements in Machine Learning (ML) to implement a network intelligence that periodically re-allocates the unused capacity as protection bandwidth to meet the service availability requirements of each connection. Our goal is achieved by two components (1) predicting the traffic for the next period on each link, and (2) intelligently selecting the best fit dedicated protection scheme for the next period depending on the estimated unused (spare) bandwidth and the previous service availability violations. Note that re-allocating protection bandwidth affects neither the operational connections nor the current best practice of operators to over-provision network bandwidth to support elephant flows. Finally, we provide a case study on the real traffic from Energy Sciences Network (ESnet), a high-speed, international scientific backbone network. The key benefit of our framework is that adaptively utilizing the over-provisioned bandwidth for spare capacity is sufficient to improve the availability from three-nines to five-nines (in ESnet for the 30 examined connections). The drawback is negligible bandwidth limitations; the user perceives a minor and very temporal bandwidth limitation in less than 0.1% of the time.