Change search
Link to record
Permanent link

Direct link
BETA
Publications (10 of 203) Show all publications
Amend, M., Bogenfeld, E., Cvjetkovic, M., Rakocevic, M., Pieskä, M., Kassler, A. & Brunström, A. (2019). A Framework for Multiaccess Support for Unreliable Internet Traffic Using Multipath DCCP. In: Proceedings of the 44th IEEE Conference on Local Computer Networks (LCN), October 14-17, 2019, Osnabrück, Germany: . Paper presented at 44th IEEE Conference on Local Computer Networks (LCN), October 14-17, 2019, Osnabrück, German. IEEE Communications Society
Open this publication in new window or tab >>A Framework for Multiaccess Support for Unreliable Internet Traffic Using Multipath DCCP
Show others...
2019 (English)In: Proceedings of the 44th IEEE Conference on Local Computer Networks (LCN), October 14-17, 2019, Osnabrück, Germany, IEEE Communications Society, 2019Conference paper, Published paper (Refereed)
Abstract [en]

Mobile nodes are typically equipped with multiple radios and can connect to multiple radio access networks (e.g. WiFi, LTE and 5G). Consequently, it is important to design mechanisms that efficiently manage multiple network interfaces for aggregating the capacity, steering of traffic flows or switching flows among multiple interfaces. While such multi-access solutions have the potential to increase the overall traffic throughput and communication reliability, the variable latencies on different access links introduce packet delay variation which has negative effect on the application quality of service and user quality of experience. In this paper, we present a new IP-compatible multipath framework for heterogeneous access networks. The framework uses Multipath Datagram Congestion Control Protocol (MP-DCCP) - a set of extensions to regular DCCP - to enable a transport connection to operate across multiple access networks, simultaneously. We present the design of the new protocol framework and show simulation and experimental testbed results that (1) demonstrate the operation of the new framework, and (2) demonstrate the ability of our solution to manage significant packet delay variation caused by the asymmetry of network paths, by applying pluggable packet scheduling or reordering algorithms.

Place, publisher, year, edition, pages
IEEE Communications Society, 2019
Keywords
Multipath Access, Protocol Design, Scheduling, Delay Variation
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-77386 (URN)10.1109/LCN44214.2019.8990746 (DOI)2-s2.0-85080882892 (Scopus ID)
Conference
44th IEEE Conference on Local Computer Networks (LCN), October 14-17, 2019, Osnabrück, German
Available from: 2020-03-31 Created: 2020-03-31 Last updated: 2020-04-24Bibliographically approved
Bauschert, T., D’Andreagiovanni, F., Kassler, A. & Wang, C. (2019). A matheuristic for green and robust 5G virtual network function placement. In: Paul Kaufmann, Pedro A. Castillo (Ed.), Applications of Evolutionary Computation: . Paper presented at 22nd International Conference, EvoApplications 2019, Held as Part of EvoStar 2019, Leipzig, Germany, April 24–26, 2019 (pp. 430-438). Cham: Springer
Open this publication in new window or tab >>A matheuristic for green and robust 5G virtual network function placement
2019 (English)In: Applications of Evolutionary Computation / [ed] Paul Kaufmann, Pedro A. Castillo, Cham: Springer, 2019, p. 430-438Conference paper, Published paper (Refereed)
Abstract [en]

We investigate the problem of optimally placing virtual network functions in 5G-based virtualized infrastructures according to a green paradigm that pursues energy-efficiency. This optimization problem can be modelled as an articulated 0-1 Linear Program based on a flow model. Since the problem can prove hard to be solved by a state-of-the-art optimization software, even for instances of moderate size, we propose a new fast matheuristic for its solution. Preliminary computational tests on a set of realistic instances return encouraging results, showing that our algorithm can find better solutions in considerably less time than a state-of-the-art solver.

Place, publisher, year, edition, pages
Cham: Springer, 2019
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 11454
Keywords
5G, Matheuristic, Robust Optimization, Traffic uncertainty, Virtual Network Function, 5G mobile communication systems, Energy efficiency, Linear programming, Transfer functions, Computational tests, Optimization problems, Optimization software, State of the art, Traffic uncertainties, Virtual networks, Network function virtualization
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-72518 (URN)10.1007/978-3-030-16692-2_29 (DOI)2-s2.0-85065708641 (Scopus ID)978-3-030-16691-5 (ISBN)978-3-030-16692-2 (ISBN)
Conference
22nd International Conference, EvoApplications 2019, Held as Part of EvoStar 2019, Leipzig, Germany, April 24–26, 2019
Available from: 2019-06-13 Created: 2019-06-13 Last updated: 2019-11-11Bibliographically approved
Dahlberg, R., Pulls, T., Vestin, J., Høiland-Jørgensen, T. & Kassler, A. (2019). Aggregation-Based Gossip for Certificate Transparency. In: Proceedings of the The Thirteenth International Conference on Emerging Security Information, Systems and Technologies - SECURWARE 2019, October 27, 2019 to October 31, 2019 - Nice, France: . Paper presented at The Thirteenth International Conference on Emerging Security Information, Systems and Technologies - SECURWARE 2019, October 27, 2019 to October 31, 2019 - Nice, France. IEEE Computer Society
Open this publication in new window or tab >>Aggregation-Based Gossip for Certificate Transparency
Show others...
2019 (English)In: Proceedings of the The Thirteenth International Conference on Emerging Security Information, Systems and Technologies - SECURWARE 2019, October 27, 2019 to October 31, 2019 - Nice, France, IEEE Computer Society, 2019Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
IEEE Computer Society, 2019
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-77388 (URN)9781713800521 (ISBN)
Conference
The Thirteenth International Conference on Emerging Security Information, Systems and Technologies - SECURWARE 2019, October 27, 2019 to October 31, 2019 - Nice, France
Projects
HITS
Funder
Knowledge Foundation, 4707
Available from: 2020-03-31 Created: 2020-03-31 Last updated: 2020-04-20Bibliographically approved
Santos, R., Skorin-Kapov, N., Ghazzai, H. & Kassler, A. (2019). Fast Steerable Wireless Backhaul Reconfiguration. In: Proceedings of the 2019 IEEE Global Communications Conference: Mobile and Wireless Networks, Dec 9-13, 2019, Big island, Hawaii, USA: . Paper presented at 2019 IEEE Global Communications Conference, GLOBECOM 2019. IEEE, Article ID 9014319.
Open this publication in new window or tab >>Fast Steerable Wireless Backhaul Reconfiguration
2019 (English)In: Proceedings of the 2019 IEEE Global Communications Conference: Mobile and Wireless Networks, Dec 9-13, 2019, Big island, Hawaii, USA, IEEE, 2019, article id 9014319Conference paper, Published paper (Other academic)
Abstract [en]

Future mobile traffic growth will require 5G cellular networks to densify the deployment of small cell base stations (BS). As it is not feasible to form a backhaul (BH) by wiring all BSs to the core network, directional mmWave links can be an attractive solution to form BH links, due to their large available capacity. When small cells are powered on/off or traffic demands change, the BH may require reconfiguration, leading to topology and traffic routing changes. Ideally, such reconfiguration should be seamless and should not impact existing traffic. However, when using highly directional BH antennas which can be dynamically rotated to form new links, this can become time- consuming, requiring the coordination of BH interface movements, link establishment and traffic routing. In this paper, we propose greedy-based heuristic algorithms to solve the BH reconfiguration problem in real-time. We numerically compare the proposed algorithms with the optimal solution obtained by solving a mixed integer linear program (MILP) for smaller instances, and with a sub- optimal reduced MILP for larger instances. The obtained results indicate that the greedy-based algorithms achieve good quality solutions with significantly decreased execution time.

Place, publisher, year, edition, pages
IEEE, 2019
Keywords
5G, Backhaul, Heuristics, MmWave
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-76278 (URN)10.1109/GLOBECOM38437.2019.9014319 (DOI)2-s2.0-85081967755 (Scopus ID)9781728109626 (ISBN)
Conference
2019 IEEE Global Communications Conference, GLOBECOM 2019
Note

Konferensbidraget ingick som manuskript i Santos doktorsavhandling (2020): Towards Resilient and Reconfigurable Software-defined Wireless Backhaul Networks.

Available from: 2020-01-13 Created: 2020-01-13 Last updated: 2020-04-24Bibliographically approved
Hernandez Benet, C. & Kassler, A. (2019). FlowDyn: Towards a Dynamic Flowlet Gap Detection using Programmable Data Planes. In: : . Paper presented at IEEE International Conference on Cloud Networking, 4-6 november 2019, Coimbra, Portugal.
Open this publication in new window or tab >>FlowDyn: Towards a Dynamic Flowlet Gap Detection using Programmable Data Planes
2019 (English)Conference paper (Refereed)
Abstract [en]

Data center networks offer multiple disjoint paths between Top-of-Rack (ToR) switches to connect server racks providing large bisection bandwidth. An effective load-balancing mechanism is required in order to fully utilize the available capacity of the multiple paths. While packet-based loadbalancing can achieve high utilization, it suffers from reordering. Flow-based load-balancing such as equal-cost multipath routing (ECMP) spreads traffic uniformly across multiple paths leading to frequent hash collisions and suboptimal performance. Finally, flowlet based load-balancing such as CONGA or HULA splits flows into smaller units, which are sent on different paths. Most flowlet based load-balancing schemes depend on a proper static setting of the flowlet gap, which decides when new flowlets are detected. While a too small gap may lead to reordering, a too large gap results in missed load-balancing opportunities. In this paper,weproposeFlowDyn,whichdynamicallyadaptstheflowlet gap to increase the efficiency of the load-balancing schemes while avoiding the reordering problem. Using programmable data planes, FlowDyn uses active probes together with telemetry informationtotrackpathlatencybetweendifferentToRswitches. FlowDyn calculates dynamically a suitable flowlet gap that can be used for flowlet based load-balancing mechanism. We evaluate FlowDyn extensively in simulation, showing that it achieves 3.19 times smaller flow completion time at 10% load and 1.16x at 90% load.

National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-76829 (URN)
Conference
IEEE International Conference on Cloud Networking, 4-6 november 2019, Coimbra, Portugal
Projects
HITS, 4707
Funder
Knowledge Foundation
Available from: 2020-02-18 Created: 2020-02-18 Last updated: 2020-02-18
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
Santos, R., Koslowski, K., Daube, J., Ghazzai, H., Kassler, A., Sakaguchi, K. & Haustein, T. (2019). mmWave Backhaul Testbed Configurability Using Software-Defined Networking. Wireless Communications & Mobile Computing, 1-24, Article ID 8342167.
Open this publication in new window or tab >>mmWave Backhaul Testbed Configurability Using Software-Defined Networking
Show others...
2019 (English)In: Wireless Communications & Mobile Computing, ISSN 1530-8669, E-ISSN 1530-8677, p. 1-24, article id 8342167Article in journal (Refereed) Published
Abstract [en]

Future mobile data traffic predictions expect a significant increase in user data traffic, requiring new forms of mobile network infrastructures. Fifth generation (5G) communication standards propose the densification of small cell access base stations (BSs) in order to provide multigigabit and low latency connectivity. This densification requires a high capacity backhaul network. Using optical links to connect all the small cells is economically not feasible for large scale radio access networks where multiple BSs are deployed. A wireless backhaul formed by a mesh of millimeter-wave (mmWave) links is an attractive mobile backhaul solution, as flexible wireless (multihop) paths can be formed to interconnect all the access BSs. Moreover, a wireless backhaul allows the dynamic reconfiguration of the backhaul topology to match varying traffic demands or adaptively power on/off small cells for green backhaul operation. However, conducting and precisely controlling reconfiguration experiments over real mmWave multihop networks is a challenging task. In this paper, we develop a Software-Defined Networking (SDN) based approach to enable such a dynamic backhaul reconfiguration and use real-world mmWave equipment to setup a SDN-enabled mmWave testbed to conduct various reconfiguration experiments. In our approach, the SDN control plane is not only responsible for configuring the forwarding plane but also for the link configuration, antenna alignment, and adaptive mesh node power on/off operations. We implement the SDN-based reconfiguration operations in a testbed with four nodes, each equipped with multiple mmWave interfaces that can be mechanically steered to connect to different neighbors. We evaluate the impact of various reconfiguration operations on existing user traffic using a set of extensive testbed measurements. Moreover, we measure the impact of the channel assignment on existing traffic, showing that a setup with an optimal channel assignment between the mesh links can result in a 44% throughput increase, when compared to a suboptimal configuration.

Place, publisher, year, edition, pages
Hindawi Publishing Corporation, 2019
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-71786 (URN)10.1155/2019/8342167 (DOI)000465345700001 ()
Available from: 2019-04-09 Created: 2019-04-09 Last updated: 2020-01-13Bibliographically approved
Fischer, A., Bhamare, D. & Kassler, A. (2019). On the Construction of Optimal Embedding Problems for Delay-Sensitive Service Function Chains. In: Proceedings of the ICCCN 2019: 28th International Conference on Computer Communications and Networks, Valencia, Spain, July 29-August 1, 2019: . Paper presented at ICCCN 2019: 28th International Conference on Computer Communications and Networks, Valencia, Spain, July 29-August 1, 2019.
Open this publication in new window or tab >>On the Construction of Optimal Embedding Problems for Delay-Sensitive Service Function Chains
2019 (English)In: Proceedings of the ICCCN 2019: 28th International Conference on Computer Communications and Networks, Valencia, Spain, July 29-August 1, 2019, 2019, p. -28Conference paper, Published paper (Refereed)
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-77387 (URN)9781728118574 (ISBN)
Conference
ICCCN 2019: 28th International Conference on Computer Communications and Networks, Valencia, Spain, July 29-August 1, 2019
Funder
Knowledge Foundation, 4707
Available from: 2020-03-31 Created: 2020-03-31 Last updated: 2020-04-20Bibliographically 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
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
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0002-9446-8143

Search in DiVA

Show all publications