Change search
Link to record
Permanent link

Direct link
BETA
Publications (10 of 103) Show all publications
Nguyen, V.-G., Grinnemo, K.-J., Taheri, J. & Brunström, A. (2020). A Deployable Containerized 5G Core Solution forTime Critical Communication in Smart Grid. In: : . Paper presented at 23rd Conference on Innovation in Clouds, Internet and Networks (ICIN 2020)February 24-27 Paris, France.
Open this publication in new window or tab >>A Deployable Containerized 5G Core Solution forTime Critical Communication in Smart Grid
2020 (English)Conference paper (Refereed)
National Category
Telecommunications
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-77111 (URN)
Conference
23rd Conference on Innovation in Clouds, Internet and Networks (ICIN 2020)February 24-27 Paris, France
Projects
HITS, 4707
Funder
Knowledge Foundation
Note

Communication within substatation automation systems in a smart grid environment is often time-critical. The time required for exchanging information between intelligent devices should be within a few milliseconds. The International Electrotechnical Commission (IEC) 61850 standard has proposed the Generic Object Oriented Substation Event (GOOSE) protocol to achieve this goal. However, the transmission of GOOSE messages is often limited to a small Local Area Network (LAN). In this demo, we demonstrate the feasibility of using 5G for GOOSEbased time critical communication in a large-scale smart-grid environment, and present a deployable 5G core solution using container-based virtualization technology. The radio part of the demo is emulated. The demo also shows that the delay introduced by the core network is in the order of sub milliseconds, while the one-way delay without a real radio access network is less than 1 ms, which is well below the total delay budget for GOOSE.

Available from: 2020-02-28 Created: 2020-02-28 Last updated: 2020-02-28
Hoseinyfarahabady, M. R., Jannesari, A., Tari, Z., Taheri, J. & Zomaya, A. Y. (2019). Dynamic Control of CPU Cap Allocations in Stream Processing and Data-Flow Platforms. In: 2019 IEEE 18th International Symposium on Network Computing and Applications, NCA 2019: . Paper presented at 18th IEEE International Symposium on Network Computing and Applications, NCA 2019, 26 September 2019 through 28 September 2019. IEEE
Open this publication in new window or tab >>Dynamic Control of CPU Cap Allocations in Stream Processing and Data-Flow Platforms
Show others...
2019 (English)In: 2019 IEEE 18th International Symposium on Network Computing and Applications, NCA 2019, IEEE, 2019Conference paper, Published paper (Refereed)
Abstract [en]

This paper focuses on Timely dataflow programming model for processing streams of data. We propose a technique to define CPU resource allocation (i.e., CPU capping) with the goal to improve response time latency in such type of applications with different quality of service (QoS) level, as they are concurrently running in a shared multi-core computing system with unknown and volatile demand. The proposed solution predicts the expected performance of the underlying platform using an online approach based on queuing theory and adjusts the corrections required in CPU allocation to achieve the most optimized performance. The experimental results confirms that measured performance of the proposed model is highly accurate while it takes into account the percentiles on the QoS metrics. The theoretical model used for elastic allocation of CPU share in the target platform takes advantage of design principals in model predictive control theory and dynamic programming to solve an optimization problem. While the prediction module in the proposed algorithm tries to predict the temporal changes in the arrival rate of each data flow, the optimization module uses a system model to estimate the interference among collocated applications by continuously monitoring the available CPU utilization in individual nodes along with the number of outstanding messages in every intermediate buffer of all TDF applications. The optimization module eventually performs a cost-benefit analysis to mitigate the total amount of QoS violation incidents by assigning the limited CPU shares among collocated applications. The proposed algorithm is robust (i.e., its worst-case output is guaranteed for arbitrarily volatile incoming demand coming from different data streams), and if the demand volatility is not large, the output is optimal, too. Its implementation is done using the TDF framework in Rust for distributed and shared memory architectures. The experimental results show that the proposed algorithm reduces the average and p99 latency of delay-sensitive applications by 21% and 31.8%, respectively, while can reduce the amount of QoS violation incidents by 98% on average.

Place, publisher, year, edition, pages
IEEE, 2019
Keywords
Dynamic CPU Resource Allocation, Scalable Data-Stream Processing, Timely Data-Flow Architecture, Computation theory, Control theory, Cost benefit analysis, Data flow analysis, Data handling, Data transfer, Memory architecture, Model predictive control, Network architecture, Quality of service, Queueing theory, Resource allocation, CPU resources, Data stream processing, Data-flow architectures, Delay-sensitive applications, Intermediate buffers, Optimization problems, Optimized performance, Shared memory architecture, Dynamic programming
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-77277 (URN)10.1109/NCA.2019.8935024 (DOI)2-s2.0-85077954593 (Scopus ID)9781728125220 (ISBN)
Conference
18th IEEE International Symposium on Network Computing and Applications, NCA 2019, 26 September 2019 through 28 September 2019
Available from: 2020-03-12 Created: 2020-03-12 Last updated: 2020-04-02Bibliographically approved
Xiang, Z., Deng, S., Taheri, J. & Zomaya, A. (2019). Dynamical Service Deployment and Replacement in Resource-Constrained Edges. Mobile Networks and Applications
Open this publication in new window or tab >>Dynamical Service Deployment and Replacement in Resource-Constrained Edges
2019 (English)In: Mobile Networks and Applications , ISSN 1383-469X, E-ISSN 1572-8153Article in journal (Refereed) Epub ahead of print
Abstract [en]

With the rapid development of mobile computing technology, more and more complex tasks are now able to be fulfilled on users’ mobile devices with an increasing number of novel services. However, the development of mobile computing is limited by the latency brought by unstable wireless network and the computation failure caused by the constrained resources of mobile devices. Therefore, people turn to establish a service provisioning system based on mobile edge computing (MEC) model to solve this problem. With the help of services deployed on edge servers, the latency can be reduced and the computation can be offloaded. Though the edge servers have more available resources than mobile devices, they are still resource-constrained, so they must carefully choose the services for deployment. In this paper, we focus on improving performance of the service provisioning system by deploying and replacing services on edge servers. Firstly, we design and implement a prototype of service provisioning system that simulates the behaviors between users and servers. Secondly, we propose an approach to deploy services on edge servers before the launching of these servers, and propose an approach to replace services on edge servers dynamically. Finally, we conduct a series of experiments to evaluate the performance of our approaches. The result shows that our approach can improve the performance of service provisioning systems.

Place, publisher, year, edition, pages
New York, USA: Springer, 2019
Keywords
Mobile computing, Service computing, Service deployment, Service replacement
Identifiers
urn:nbn:se:kau:diva-75980 (URN)10.1007/s11036-019-01449-7 (DOI)000499972400002 ()2-s2.0-85075915912 (Scopus ID)
Available from: 2019-12-13 Created: 2019-12-13 Last updated: 2020-01-21
Bhamare, D., Kassler, A., Vestin, J., Khoshkholghi, M. A. & Taheri, J. (2019). IntOpt: In-Band Network Telemetry Optimization for NFV Service Chain Monitoring. In: 2019 IEEE International Conference on Communications (ICC) Próceedings: . Paper presented at IEEE ICC 2019: IEEE International Conference on Communications 2019 Shanghai, China 20-24 May. IEEE
Open this publication in new window or tab >>IntOpt: In-Band Network Telemetry Optimization for NFV Service Chain Monitoring
Show others...
2019 (English)In: 2019 IEEE International Conference on Communications (ICC) Próceedings, IEEE, 2019Conference paper, Published paper (Refereed)
Abstract [en]

Managing and scaling virtual network function(VNF) service chains require the collection and analysis ofnetwork statistics and states in real time. Existing networkfunction virtualization (NFV) monitoring frameworks either donot have the capabilities to express the range of telemetryitems needed to perform management or do not scale tolarge traffic volumes and rates. We present IntOpt, a scalableand expressive telemetry system designed for flexible VNFservice chain network monitoring using active probing. IntOptallows to specify monitoring requirements for individual servicechain, which are mapped to telemetry item collection jobsthat fetch the required telemetry items from P4 (programmingprotocol-independent packet processors) programmable dataplaneelements. In our approach, the SDN controller creates theminimal number of monitoring flows to monitor the deployedservice chains as per their telemetry demands in the network.We propose a simulated annealing based random greedy metaheuristic(SARG) to minimize the overhead due to activeprobing and collection of telemetry items. Using P4-FPGA, webenchmark the overhead for telemetry collection and compareour simulated annealing based approach with a na¨ıve approachwhile optimally deploying telemetry collection probes. Ournumerical evaluation shows that the proposed approach canreduce the monitoring overhead by 39% and the total delays by57%. Such optimization may as well enable existing expressivemonitoring frameworks to scale for larger real-time networks.

Place, publisher, year, edition, pages
IEEE, 2019
Series
IEEE International Conference on Communications, ISSN 1550-3607, E-ISSN 1938-1883
Keywords
In-band Network Telemetry, Monitoring, P4, Service Function Chain, Software Defined Networks
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-74631 (URN)10.1109/ICC.2019.8761722 (DOI)000492038804033 ()978-1-5386-8089-6 (ISBN)978-1-5386-8088-9 (ISBN)
Conference
IEEE ICC 2019: IEEE International Conference on Communications 2019 Shanghai, China 20-24 May
Projects
HITS, 4707
Funder
Knowledge Foundation
Available from: 2019-09-04 Created: 2019-09-04 Last updated: 2019-12-18Bibliographically approved
Alizadeh Noghani, K., Kassler, A. & Taheri, J. (2019). On the Cost-Optimality Trade-off for Service Function Chain Reconfiguration. In: : . Paper presented at IEEE CloudNet 2019 - 8th IEEE International Conference on Cloud Networking, Coimbra, Portugal, 4-6 Nov. 2019. IEEE
Open this publication in new window or tab >>On the Cost-Optimality Trade-off for Service Function Chain Reconfiguration
2019 (English)Conference paper, Published paper (Refereed)
Abstract [en]

Optimal placement of Virtual Network Functions (VNFs) in virtualized data centers enhances the overall performance of Service Function Chains (SFCs) and decreases the operational costs for mobile network operators. Maintaining an optimal placement of VNFs under changing load requires a dynamic reconfiguration that includes adding or removing VNF instances, changing the resource allocation of VNFs, and re-routing corresponding service flows. However, such reconfiguration may lead to notable service disruptions and impose additional overhead on the VNF infrastructure, especially when reconfiguration entails state or VNF migration. On the other hand, not changing the existing placement may lead to high operational costs. In this paper, we investigate the trade-off between the reconfiguration of SFCs and the optimality of the resulting placement and service flow (re)routing. We model different reconfiguration costs related to the migration of stateful VNFs and solve a joint optimization problem that aims to minimize both the total cost of the VNF placement and the reconfiguration cost necessary for repairing a suboptimal placement. Numerical results show that a small number of reconfiguration operations can significantly reduce the operational cost of the VNF infrastructure; however, too much reconfiguration may not pay off should heavy costs be involved.

Place, publisher, year, edition, pages
IEEE, 2019
Keywords
Joint optimization problem, reconfiguration, virtual network function, VNF migration
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-75574 (URN)
Conference
IEEE CloudNet 2019 - 8th IEEE International Conference on Cloud Networking, Coimbra, Portugal, 4-6 Nov. 2019
Projects
HITS
Funder
Knowledge Foundation
Available from: 2019-11-11 Created: 2019-11-11 Last updated: 2019-12-12Bibliographically approved
Nguyen, V.-G., Carlsson, A., Grinnemo, K.-J., Cheng, J., Taheri, J. & Brunström, A. (2019). On the Use of 5G for Inter-substation GOOSE Transmission in Smart Grid. In: Proceedings of the Fifteenth Swedish National Computer Workshop (SNCNW), Luleå, Sweden. June 2019: . Paper presented at 15th Swedish National Computer Networking Workshop SNCNW 2019. 4-5 juni, 2019. Luleå, Sweden..
Open this publication in new window or tab >>On the Use of 5G for Inter-substation GOOSE Transmission in Smart Grid
Show others...
2019 (English)In: Proceedings of the Fifteenth Swedish National Computer Workshop (SNCNW), Luleå, Sweden. June 2019, 2019Conference paper, Oral presentation only (Refereed)
Abstract [en]

Protection and automation in a smart grid environmentoften have stringent real-time communication requirementsbetween devices within a substation as well as between distantlylocated substations. The Generic Object Oriented SubstationEvent (GOOSE) messaging service has been proposed to achievethis goal as it allows to transfer time-critical information within afew milliseconds. However, the transmission of GOOSE messagesare often limited to a small Local Area Network (LAN).In this paper, we propose the use of the fifth generation ofmobile networks (5G) as a means to transport GOOSE messagesin a large scale smart grid environment. The end-to-end delay ismeasured between GOOSE devices over an 5G network with thefocus on the core network using the Open5GCore platform in alab environment. Although there is a lack of a real radio accessnetwork, the experimental results confirm that the delay withinthe rest of the 5G network is small enough for it to be feasiblefor inter-substation GOOSE transmissions.

National Category
Telecommunications
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-72435 (URN)
Conference
15th Swedish National Computer Networking Workshop SNCNW 2019. 4-5 juni, 2019. Luleå, Sweden.
Projects
HITS, 4707
Funder
Knowledge Foundation
Available from: 2019-06-12 Created: 2019-06-12 Last updated: 2019-07-17Bibliographically approved
Khoshkholghi, M. A., Taheri, J., Bhamare, D. & Kassler, A. (2019). Optimized Service Chain Placement Using Genetic Algorithm. In: Christian Jacquenet, Filip De Turck, Prosper Chemouil, Flavio Esposito, Olivier Festor, Walter Cerroni, Stefano Secci (Ed.), Proceedings of the 2019 IEEE Conference on Network Softwarization NetSoft 2019, Unleashing the Power of Network Softwarization: . Paper presented at Network Softwarization (NetSoft), IEEE Conference on 24-28 June Paris, France. IEEE
Open this publication in new window or tab >>Optimized Service Chain Placement Using Genetic Algorithm
2019 (English)In: Proceedings of the 2019 IEEE Conference on Network Softwarization NetSoft 2019, Unleashing the Power of Network Softwarization / [ed] Christian Jacquenet, Filip De Turck, Prosper Chemouil, Flavio Esposito, Olivier Festor, Walter Cerroni, Stefano Secci, IEEE, 2019Conference paper, Published paper (Refereed)
Abstract [en]

Network Function Virtualization (NFV) is anemerging technology to consolidate network functions onto highvolume storages, servers and switches located anywhere in thenetwork. Virtual Network Functions (VNFs) are chainedtogether to provide a specific network service. Therefore, aneffective service chain placement strategy is required tooptimize the resource allocation and consequently to reduce theoperating cost of the substrate network. To this end, we proposefour genetic-based algorithms using roulette wheel andtournament selection techniques in order to place service chainsconsidering two different placement strategies. Since mappingof service chains sequentially (One-at-a-time strategy) may leadto suboptimal placement, we also propose Simultaneous strategythat places all service chains at the same time to improveperformance. Our goal in this work is to reduce deployment costof VNFs while satisfying constraints. We consider Geantnetwork as the substrate network along with its characteristicsextracted from SndLib. The proposed algorithms are able toplace service chains with any type of service graph. Theperformance benefits of the proposed algorithms arehighlighted through extensive simulations.

Place, publisher, year, edition, pages
IEEE, 2019
Keywords
Network Function Virtualization, Optimization, Genetic Algorithm, Service Chain Placement
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-74619 (URN)10.1109/NETSOFT.2019.8806644 (DOI)978-1-5386-9376-6 (ISBN)978-1-5386-9377-3 (ISBN)
Conference
Network Softwarization (NetSoft), IEEE Conference on 24-28 June Paris, France
Projects
HITS, 4707
Funder
Knowledge Foundation, 20140037
Available from: 2019-09-04 Created: 2019-09-04 Last updated: 2019-12-12Bibliographically approved
Oljira, D. B., Grinnemo, K.-J., Brunström, A. & Taheri, J. (2019). Validating the Sharing Behavior and Latency Characteristics of the L4S Architecture. In: : . Paper presented at ACM Internet Measurement Conference 2019, 21-23 october, Amsterdam, The Netherlands.
Open this publication in new window or tab >>Validating the Sharing Behavior and Latency Characteristics of the L4S Architecture
2019 (English)Conference paper, Poster (with or without abstract) (Refereed)
Abstract [en]

Internet services such as virtual reality, interactive cloud applications, and online gaming, have a strict quality of service requirements (e.g., low-latency). However, the current Internet is not able to satisfy the low-latency requirements of these applications. This as the standard TCP induces high queuing delays when used by capacity-seeking traffic, which in turn results in unpredictable latency. The Low Latency Low Loss Scalable throughput (L4S) architecture aims to address this problem by combining scalable congestion controls (e.g., DCTCP) with early congestion signaling from the network. For incremental deployment, the L4S architecture defines a Dual Queue Coupled AQM that enables the safe coexistence of scalable and classic (e.g., Reno, Cubic, etc.) flows on the global Internet. The DualPI2 AQM is a Linux kernel implementation of a Dual Queue Coupled AQM. In this paper, we benchmark the DualPI2 AQM to validate experimental result(s) reported in previous works that demonstrate the coexistence of scalable and classic congestion controls, and its low-latency service. Our results validate the coexistence of scalable and classic flows using DualPI2 single queue AQM while the result with dual queue shows neither rate nor window fairness between the flows.

National Category
Telecommunications
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-75444 (URN)
Conference
ACM Internet Measurement Conference 2019, 21-23 october, Amsterdam, The Netherlands
Projects
HITS, 4707
Funder
Knowledge Foundation
Available from: 2019-10-25 Created: 2019-10-25 Last updated: 2019-11-21Bibliographically approved
Fazio, M., Ranjan, R., Girolami, M., Taheri, J., Dustdar, S. & Villari, M. (2018). A Note on the Convergence of IoT, Edge, and Cloud Computing in Smart Cities. IEEE Cloud Computing, 5(5), 22-24
Open this publication in new window or tab >>A Note on the Convergence of IoT, Edge, and Cloud Computing in Smart Cities
Show others...
2018 (English)In: IEEE Cloud Computing, ISSN 2325-6095, Vol. 5, no 5, p. 22-24Article in journal (Refereed) Published
Abstract [en]

The purpose of the special issue is to cover all aspects of design and implementation, as well as deployment and evaluation of solutions aimed at the osmotic convergence of IoT, edge, and cloud computing, with specific reference to the smart cities application scenario.

Place, publisher, year, edition, pages
IEEE, 2018
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-70068 (URN)10.1109/MCC.2018.053711663 (DOI)000447944400004 ()
Available from: 2018-11-08 Created: 2018-11-08 Last updated: 2019-11-10Bibliographically approved
Gokan Khan, M., Taheri, J., Kassler, A. & Darula, M. (2018). Automated Analysis and Profiling of VirtualNetwork Functions: the NFV-Inspector Approach. In: 2018 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN): . Paper presented at IEEE Conference on Network Function Virtulization and Software defined Networks, Verona, Italy, 27-29 November 2018. IEEE
Open this publication in new window or tab >>Automated Analysis and Profiling of VirtualNetwork Functions: the NFV-Inspector Approach
2018 (English)In: 2018 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN), IEEE, 2018Conference paper, Published paper (Refereed)
Abstract [en]

Discovering insights about Virtual Network Function (VNFs) resource demand characteristics will enable cloud vendors to optimize their underlying Network Function Virtualization (NFV) system orchestration and dramatically mitigate CapEx and OpEx spendings. However, analyzing large-scale NFV systems, especially in mobile network environments, is a challenging task and requires tailor-made approaches for each particular application. In this demo, we showcase NFV-Inspector, an open source and extensible VNF analysis platform that is capable of systematically benchmark and profile NFV deployments. Based on its pluggable framework, NFV-Inspector classifies VNFs resource demand characteristics and correlate their Key Performance Indicators (KPIs) with system-level Quality of Service (QoS) measurements. 

Place, publisher, year, edition, pages
IEEE, 2018
Keywords
Classification, Network Function Virtualization, Platform, Profiling, Quality of Service
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-71388 (URN)10.1109/NFV-SDN.2018.8725697 (DOI)000475896900023 ()978-1-5386-8281-4 (ISBN)978-1-5386-8282-1 (ISBN)
Conference
IEEE Conference on Network Function Virtulization and Software defined Networks, Verona, Italy, 27-29 November 2018
Projects
NFV Optimizer, 5276
Funder
Knowledge Foundation, 20160182
Note

Available from: 2019-02-28 Created: 2019-02-28 Last updated: 2019-08-06Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0001-9194-010X

Search in DiVA

Show all publications