Endre søk
Begrens søket
1234 1 - 50 of 194
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Treff pr side
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
Merk
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 1.
    Abdollahi, Kamran
    et al.
    Computer and Science Department Iran University of Science and Technology Tehran, Iran.
    Shams Shafigh, Alireza
    Computer and Science Department Iran University of Science and Technology Tehran, Iran.
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    Improving Performance of On Demand Multicast Routing by deleting lost join query packet2010Inngår i: Proceedings of The Sixth Advanced International Conference on Telecommunications - AICT 2010, IEEE conference proceedings, 2010, s. 316-322Konferansepaper (Fagfellevurdert)
    Abstract [en]

    A Mobile ad hoc network is a collection of wireless nodes that dynamically organize themselves to form a network without the need for any fixed infrastructure or centralized administration. The network topology dynamically changes frequently in an unpredictable manner since nodes are free to move. Support for multicasting is essential in such environment as it is considered to be an efficient way to deliver information from source nodes to many client nodes. A problem with multicast routing algorithms is their efficiency as their forwarding structure determines the overall network resource consumption makes them significantly less efficient than unicast routing algorithms. In this research, we improve the performance of the popular ODMRP multicast routing protocol by restricting the domain of join query packets, which have been lost. This is achieved by augmenting the join query packets with minimum extra information (one field), which denotes the number of the visited node from previous forwarding group. Simulation results show, that our mechanisms significantly reduce the control traffic and thus the overall latency and power consumption in the network.

  • 2.
    Aboueata, N.
    et al.
    Qatar University, Doha, Qatar.
    Alrasbi, S.
    Qatar University, Doha, Qatar.
    Erbad, A.
    Qatar University, Doha, Qatar.
    Kassler, Andreas
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Bhamare, Deval
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Supervised machine learning techniques for efficient network intrusion detection2019Inngår i: Proceedings - International Conference on Computer Communications and Networks, ICCCN, Institute of Electrical and Electronics Engineers Inc. , 2019Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Cloud computing is gaining significant traction and virtualized data centers are becoming popular as a cost-effective infrastructure in telecommunication industry. Infrastructure as a Service (IaaS), Platform as a Service (PaaS) and Software as a Service (SaaS) are being widely deployed and utilized by end users, including many private as well as public organizations. Despite its wide-spread acceptance, security is still the biggest threat in cloud computing environments. Users of cloud services are under constant fear of data loss, security breaches, information theft and availability issues. Recently, learning-based methods for security applications are gaining popularity in the literature with the advents in machine learning (ML) techniques. In this work, we explore applicability of two well-known machine learning approaches, which are, Artificial Neural Networks (ANN) and Support Vector Machines (SVM), to detect intrusions or anomalous behavior in the cloud environment. We have developed ML models using ANN and SVM techniques and have compared their performances. We have used UNSW-NB-15 dataset to train and test the models. In addition, we have performed feature engineering and parameter tuning to find out optimal set of features with maximum accuracy to reduce the training time and complexity of the ML models. We observe that with proper features set, SVM and ANN techniques have been able to achieve anomaly detection accuracy of 91% and 92% respectively, which is higher compared against that of the one achieved in the literature, with reduced number of features needed to train the models.

  • 3.
    Agapi, Mesodiakaki
    et al.
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Zola, Enrica
    UPC BarcelonaTECH, Barcelona Spain.
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT. Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Joint User Association and Backhaul Routing for Green 5G Mesh Millimeter Wave Backhaul Networks2017Inngår i: Proceedings Of The 20Th Acm International Conference On Modelling, Analysis And Simulation Of Wireless And Mobile Systems, Association for Computing Machinery (ACM), 2017, s. 179-186Konferansepaper (Fagfellevurdert)
    Abstract [en]

    With the advance of fifth generation (5G) networks, network density needs to grow significantly in order to meet the required capacity demands. A massive deployment of small cells may lead to a high cost for providing. ber connectivity to each node. Consequently, many small cells are expected to be connected through wireless links to the umbrella eNodeB, leading to a mesh backhaul topology. This backhaul solution will most probably be composed of high capacity point-to-point links, typically operating in the millimeter wave (mmWave) frequency band due to its massive bandwidth availability. In this paper, we propose a mathematical model that jointly solves the user association and backhaul routing problem in the aforementioned context, aiming at the energy efficiency maximization of the network. Our study considers the energy consumption of both the access and backhaul links, while taking into account the capacity constraints of all the nodes as well as the fulfillment of the service-level agreements (SLAs). Due to the high complexity of the optimal solution, we also propose an energy efficient heuristic algorithm (Joint), which solves the discussed joint problem, while inducing low complexity in the system. We numerically evaluate the algorithm performance by comparing it not only with the optimal solution but also with reference approaches under different traffic load scenarios and backhaul parameters. Our results demonstrate that Joint outperforms the state-of-the-art, while being able to find good solutions, close to optimal, in short time.

  • 4. Ali Yahiya, Tara
    et al.
    Chaouchi, Hakima
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    Pujolle, Guy
    Seamless Interworking of WLAN and WMAN Wireless Networks2006Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Future network environments will be heterogeneous and mobile terminals will have the opportunity to dynamically select among many different access technologies. Therefore, it is important to provide service continuity in case of vertical handovers when terminals change the access technology. Two important wireless access technologies are WLAN (Wireless Local Access Networks) and WMAN (Wireless Metropolitan Access Networks) networks. In this paper, we address several challenges related to a seamless integration of those technologies. We highlight important aspects for designing a WLAN/WMAN interworking architecture and we address important Quality of Service (QoS) issues for such interworked systems like degree of QoS support provided by the technologies, QoS mapping and signalling for vertical handover. By formulating several interworking scenarios, where WLAN users with ongoing voice, video and data sessions hand over to WMAN, we study QoS and performance issues and analyse feasibility of seamless session continuity through simulations

  • 5.
    Alizadeh Noghani, Kyoomars
    et al.
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Ghazzai, Hakim
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Kassler, Andreas
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    A Generic Framework for Task Offloading in mmWave MEC Backhaul Networks2018Inngår i: 2018 IEEE Global Communications Conference (GLOBECOM), IEEE, 2018, s. 1-7Konferansepaper (Fagfellevurdert)
    Abstract [en]

    With the emergence of millimeter-Wave (mmWave) communication technology, the capacity of mobile backhaul networks can be significantly increased. On the other hand, Mobile Edge Computing (MEC) provides an appropriate infrastructure to offload latency-sensitive tasks. However, the amount of resources in MEC servers is typically limited. Therefore, it is important to intelligently manage the MEC task offloading by optimizing the backhaul bandwidth and edge server resource allocation in order to decrease the overall latency of the offloaded tasks. This paper investigates the task allocation problem in MEC environment, where the mmWave technology is used in the backhaul network. We formulate a Mixed Integer NonLinear Programming (MINLP) problem with the goal to minimize the total task serving time. Its objective is to determine an optimized network topology, identify which server is used to process a given offloaded task, find the path of each user task, and determine the allocated bandwidth to each task on mmWave backhaul links. Because the problem is difficult to solve, we develop a two-step approach. First, a Mixed Integer Linear Program (MILP) determining the network topology and the routing paths is optimally solved. Then, the fractions of bandwidth allocated to each user task are optimized by solving a quasi-convex problem. Numerical results illustrate the obtained topology and routing paths for selected scenarios and show that optimizing the bandwidth allocation significantly improves the total serving time, particularly for bandwidth-intensive tasks.

  • 6.
    Alizadeh Noghani, Kyoomars
    et al.
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Hernandez Benet, Cristian
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Kassler, Andreas
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Marotta, Antonio
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Jestin, Patrick
    Ericsson AB, Sweden.
    Srivastava, Vivek V.
    Ericsson AB, Sweden.
    Automating Ethernet VPN deployment in SDN-based Data Centers2017Inngår i: 2017 Fourth International Conference on Software Defined Systems (SDS)., IEEE, 2017, s. 61-66Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Layer 2 Virtual Private Network (L2VPN) is widely deployed in both service provider networks and enterprises. However, legacy L2VPN solutions have scalability limitations in the context of Data Center (DC) interconnection and networking which require new approaches that address the requirements of service providers for virtual private cloud services. Recently, Ethernet VPN (EVPN) has been proposed to address many of those concerns and vendors started to deploy EVPN based solutions in DC edge routers. However, manual configuration leads to a time-consuming, error-prone configuration and high operational costs. Automating the EVPN deployment from cloud platforms such as OpenStack enhances both the deployment and flexibility of EVPN Instances (EVIs). This paper proposes a Software Defined Network (SDN) based framework that automates the EVPN deployment and management inside SDN-based DCs using OpenStack and OpenDaylight (ODL). We implemented and extended several modules inside ODL controller to manage and interact with EVIs and an interface to OpenStack that allows the deployment and configuration of EVIs. We conclude with scalability analysis of our solution.

  • 7.
    Alizadeh Noghani, Kyoomars
    et al.
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Kassler, Andreas
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    SDN Enhanced Ethernet VPN for Data Center Interconnect2017Inngår i: 2017 IEEE 6th International Conference on Cloud Networking (CloudNet) / [ed] Maga, D, IEEE, 2017, s. 77-82Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Ethernet Virtual Private Network (EVPN) is an emerging technology that addresses the networking challenges presented by geo-distributed Data Centers (DCs). One of the major advantages of EVPN over legacy layer 2 VPN solutions is providing All-Active (A-A) mode of operation so that the traffic can truly be multi-homed on Provider Edge (PE) routers. However, A-A mode of operation introduces new challenges. In the case where the Customer Edge (CE) router is multi-homed to one or more PE routers, it is necessary that only one of the PE routers should forward Broadcast, Unknown unicast, and Multicast (BUM) traffic into the DC. The PE router that assumes the primary role for forwarding BUM traffic to the CE device is called the Designated Forwarder (DF). The proposed solution to select the DF in the EVPN standard is based on a distributed algorithm which has a number of drawbacks such as unfairness and intermittent behavior. In this paper, we introduce a Software-Defined Networking (SDN) based architecture for EVPN support, where the SDN controller interacts with EVPN control plane. We demonstrate how our solution mitigates existing problems for DF selection which leads to improved EVPN performance.

  • 8.
    Alizadeh Noghani, Kyoomars
    et al.
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Kassler, Andreas
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Sankar Gopannan, Prem
    Ericsson, USA.
    EVPN/SDN Assisted Live VM Migration between Geo-Distributed Data Centers2018Inngår i: 4th IEEE Conference on Network Softwarization (NetSoft), IEEE, 2018, s. 105-113Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Live Virtual Machine (VM) migration has significantly improved the flexibility of modern Data Centers (DC). However, seamless live migration of a VM between geo-distributed DCs faces several challenges due to difficulties in preserving the network configuration after the migration paired with a large network convergence time. Although SDN-based approaches can speed up network convergence time, these techniques have two limitations. First, they typically react to the new topology by installing new flow rules once the migration is finished. Second, because the WAN is typically not under SDN control, they result in sub-optimal routing thus severely degrading the network performance once the VM is attached at the new location.

    In this paper, we identify networking challenges for VM migration across geo-distributed DCs. Based on those observations, we design a novel long-haul VM migration scheme that overcomes those limitations. First, instead of reactively restoring connectivity after the migration, our SDN-based approach proactively restores flows across the WAN towards the new location with the help of EVPN and VXLAN overlay technologies. Second, the SDN controller accelerates the network convergence by announcing the migration to other controllers using MP-BGP control plane messages. Finally, the SDN controller resolves the sub-optimal routing problem that arises as a result of migration implementing a distributed anycast gateway. We implement our approach as extensions to the OpenDaylight controller. Our evaluation shows that our approach outperforms existing approaches in reducing the downtime by 400 ms and increasing the application performance up to 12 times.

  • 9.
    Alizadeh Noghani, Kyoomars
    et al.
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Kassler, Andreas
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Taheri, Javid
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    On the Cost-Optimality Trade-off for Service Function Chain Reconfiguration2019Konferansepaper (Fagfellevurdert)
    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.

  • 10.
    Alizadeh Noghani, Kyoomars
    et al.
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Kassler, Andreas
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Taheri, Javid
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Öhlen, Peter
    Ericsson AB.
    Curescu, Calin
    Ericsson AB.
    On the Cost-Optimality Trade-off for Fast Service Function Chain ReconfigurationManuskript (preprint) (Annet vitenskapelig)
    Abstract [en]

    Optimal placement of Virtual Network Functions (VNFs) in data centers enhances the overall performance of Service Function Chains (SFCs) and decreases the operational costs for mobile network operators. In order to cope with changes in demands, VNF instances may be added or removed dynamically, resource allocations may be adjusted, and servers may be consolidated. To maintain an optimal placement of SFC under changing conditions, dynamic reconfiguration is required including the migration of VNFs and the re-routing of service flows. However, such reconfiguration may lead to notable service disruptions and can be exacerbated when reconfiguration entails state or VNF migration, both imposing additional overhead on the VNF infrastructure. On the other hand, not changing the placement may lead to a suboptimal operation, servers and links may become congested or underutilized, leading 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 routing. We model 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 new placement and the reconfiguration cost necessary to achieve it. We also develop a fast multi-objective genetic algorithm that finds near-optimal solutions for online decisions. Our numerical evaluations show that a small number of reconfiguration operations can significantly reduce the operational cost of the VNF infrastructure. In contrast, too much reconfiguration may not pay off due to high costs. We believe that our work is an important tool that helps network provider to plan a good reconfiguration strategy for their service chains.

  • 11.
    Avallone, Stefano
    et al.
    Univ Naples Federico II, Dept Comp Engn, I-80125 Naples, Italy.
    Di Stasi, Giovanni
    Univ Naples Federico II, Dept Comp Engn, I-80125 Naples, Italy.
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    A Traffic-Aware Channel and Rate Re-Assignment Algorithm for Wireless Mesh Networks.2013Inngår i: IEEE Transactions on Mobile Computing, ISSN 1536-1233, E-ISSN 1558-0660, Vol. 12, nr 7, s. 1335-1348Artikkel i tidsskrift (Fagfellevurdert)
  • 12. Bauschert, Thomas
    et al.
    D’Andreagiovanni, Fabio
    Kassler, Andreas
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Wang, Chenghao
    A matheuristic for green and robust 5G virtual network function placement2019Inngår i: Applications of Evolutionary Computation / [ed] Paul Kaufmann, Pedro A. Castillo, Cham: Springer, 2019, s. 430-438Konferansepaper (Fagfellevurdert)
    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.

  • 13.
    Bayer, Nico
    et al.
    Deutsche Telekom/T-Systems, Darmstadt, Germany.
    Cavalcanti de Castro, Marcel
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Dely, Peter
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Koucheryavy, Yevgeni
    Tampere University of Technolo, Finland.
    Mitoraj, Piotr
    Tampere University of Technology, Finland.
    Staehle, Dirk
    University of Würzburg, Germany.
    VoIP service performance optimization in pre-IEEE 802.11s Wireless Mesh Networks2008Inngår i: Proceedings of the IEEE International Conference on Circuits andSystems for Communications (ICCSC) 2008, IEEE conference proceedings, 2008, s. 75-79Konferansepaper (Fagfellevurdert)
    Abstract [en]

    802.11-based wireless mesh networks are seen as a means for providing last mile connections to next generation networks. Due to the low deployment cost and the mature technology used, they are scalable, easy to implement and robust. With an increasing coverage of wireless networks, VoIP becomes a cheaper alternative for traditional and cellular telephony. In this paper, we carry out a feasibility study of VoIP in a dual radio mesh environment. Heading towards 802.11s, we present the design of a mesh testbed and methodology for performing the measurements. Additionally, we address the problem that small voice packets introduce a high overhead leading to a low voice capacity of 802.11 based mesh networks. In order to alleviate this problem and increase the voice capacity, a novel packet aggregation mechanism is presented and evaluated using the ns-2 simulator.

  • 14.
    Bellalta, Boris
    et al.
    Department of Information and Communication Technologies, Universitat Pompeu Fabra, Barcelona 08018, Spain.
    Bononi, Luciano
    Department of Computer Science and Engineering, University of Bologna, 40127 Bologna, Italy.
    Bruno, Raffaele
    Institute for Informatics and Telematics (IIT), Italian National Research Council (CNR), Pisa 56124, Italy.
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    Next generation IEEE 802.11 Wireless Local Area Networks: Current status, future directions and open challenges2016Inngår i: Computer Communications, ISSN 0140-3664, E-ISSN 1873-703X, Vol. 75, s. 1-25Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    A new generation of Wireless Local Area Networks (WLANs) will make its appearance in the market in the forthcoming years based on the amendments to the IEEE 802.11 standards that have recently been approved or are under development. Examples of the most expected ones are IEEE 802.11aa (Robust Audio Video Transport Streaming), IEEE 802.11ac (Very-high throughput at < 6 GHz), IEEE 802.11af (TV White Spaces) and IEEE 802.11ah (Machine-to-Machine communications) specifications. The aim of this survey is to provide a comprehensive overview of these novel technical features and the related open technical challenges that will drive the future WLAN evolution. In contrast to other IEEE 802.11 surveys, this is a use case oriented study. Specifically, we first describe the three key scenarios in which next-generation WLANs will have to operate. We then review the most relevant amendments for each of these use cases focusing on the additional functionalities and the new technologies they include, such as multi-user MIMO techniques, groupcast communications, dynamic channel bonding, spectrum databases and channel sensing, enhanced power saving mechanisms and efficient small data transmissions. We also discuss the related work to highlight the key issues that must still be addressed. Finally, we review emerging trends that can influence the design of future WLANs, with special focus on software-defined MACs and the internet-working with cellular systems.

  • 15.
    Bhamare, Deval
    et al.
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Kassler, Andreas
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Vestin, Jonathan
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Khoshkholghi, Mohammad Ali
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Taheri, Javid
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    IntOpt: In-Band Network Telemetry Optimization for NFV Service Chain Monitoring2019Inngår i: 2019 IEEE International Conference on Communications (ICC) Próceedings, 2019Konferansepaper (Fagfellevurdert)
    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.

  • 16.
    Bozakov, Zdravko
    et al.
    Dell EMC, Ireland.
    Mangiante, Simone
    Dell EMC, Ireland.
    Hernandez Benet, Cristian
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Brunström, Anna
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013). Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    Santos, Ricardo
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Kassler, Andreas
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Buckley, Donagh
    Dell EMC, Ireland.
    A NEAT framework for enhanced end-host integration in SDN environments2017Inngår i: 2017 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN), IEEE, 2017Konferansepaper (Fagfellevurdert)
    Abstract [en]

    SDN aims to facilitate the management of increasingly complex, dynamic network environments and optimize the use of the resources available therein with minimal operator intervention. To this end, SDN controllers maintain a global view of the network topology and its state. However, the extraction of information about network flows and other network metrics remains a non-trivial challenge. Network applications exhibit a wide range of properties, posing diverse, often conflicting, demands towards the network. As these requirements are typically not known, controllers must rely on error-prone heuristics to extract them. In this work, we develop a framework which allows applications deployed in an SDN environment to explicitly express their requirements to the network. Conversely, it allows network controllers to deploy policies on end-hosts and to supply applications with information about network paths, salient servers and other relevant metrics. The proposed approach opens the door for fine grained, application-aware resource optimization strategies in SDNs

  • 17.
    Brajdic, Agata
    et al.
    Fac. of EE & Comput., Univ. of Zagreb, Zagreb, Croatia .
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    Matijasevic, Maja
    Quality of Experience based optimization of heterogeneous multimedia sessions in IMS2011Inngår i: Proceedings of Baltic Congress on Future Internet Communications, IEEE conference proceedings, 2011, s. 25-32Konferansepaper (Fagfellevurdert)
    Abstract [en]

    For delivering multimedia services over (wireless) networks it is important that the mechanisms which negotiate and optimize content delivery under resource constraints take into account user perceived quality in order to improve user satisfaction. Within the scope of the IP Multimedia Subsystem (IMS) architecture a novel application server may be added which handles multi-user multi-flow Quality of Experience (QoE) negotiation and adaptation for heterogeneous user sessions. Based on a mathematical model, which takes into account the characteristics of audio, video and data sessions for QoE optimization, we develop several optimization algorithms to be used by the application server to maximize overall user defined QoE parameters for all ongoing multimedia sessions, subject to network resource constraints. Our results show that a greedy based approach provides a reasonable compromise in terms of run-time and sub-optimality for the overall QoE based resource allocations.

  • 18. Brolin, Jonas
    et al.
    Dely, Peter
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Hedegren, Mikael
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    Implementing Packet Aggregation in the Linux Kernel2008Konferansepaper (Fagfellevurdert)
    Abstract [en]

    In multi-hop wireless mesh networks (WMN) Voice over IP (VoIP) suffers from large overhead created by the IP/UDP/RTP/MAC header and time due to collisions. As a result the VoIP capacity of WMNs is small. As shown in [1] a 3 hop WMN at a data rate of 2Mbit/s can only support 3 concurrent VoIP flows. [1], [2] and [3] propose the use of packet aggregation in order to reduce the overhead and thus increase the capacity. The idea behind packet aggregation is to combine multiple small packets into a single larger one, reducing overhead and collision probability in multi-hop environment. This paper presents insights into an implementation of an aggregation scheme in the Linux Kernel and its experimental evaluation

  • 19.
    Brunström, Anna
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    Cavalcanti de Castro, Marcel
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Karlsson, Jonas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    Palazzo, S
    DR11.2: Intermediate report on resource management issues and routing/forwarding schemes for opportunistic networks2009Rapport (Fagfellevurdert)
  • 20.
    Brunström, Anna
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    Cavalcanti de Castro, Marcel
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    Lavén, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Dely, Peter
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Galluccio, L
    NEWCOM++ DR11.3: Final report on the activities and results of WPR112010Rapport (Annet vitenskapelig)
    Abstract [en]

    This document is the last deliverable of WPR.11 and presents an overview of the final activities carried out within the NEWCOM++ Workpackage WPR.11 during the last 18 months. We provide a description of the most consolidated Joint Research Activities (JRAs) and the main results so far obtained. We also address some considerations on the future activities which are expected to continue at the end of NEWCOM++

  • 21.
    Cardellini, Valeria
    et al.
    University of Rome Tor Vergata, Rome, Italy.
    Galinac Grbac, Tihana
    Facylty of Engineering, University or Rijeka, Rijeka, Croatia .
    Kassler, Andreas
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Kathiravelu, Pradeeban
    INESC-ID Lisboa, Instituto Superior Técnico, Universidade de Lisboa, Portugal.
    Lo Presti, Francesco
    University or Rome tor Vergata, Rome, Italy.
    Marotta, Antonio
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Nardelli, Matteo
    University of Rome Tor Vergata, Rome, Italy.
    Luís, Veiga
    INESC-ID Lisboa/Instituto Superior Técnico, Universidade de Lisboa, Lisbon, Portugal.
    Integrating SDN and NFV with QoS-Aware Service Composition Cardellini2018Inngår i: Autonomous Control for a Reliable Internet of Services: Methods, Models, Approaches, Techniques, Algorithms, and Tools / [ed] Ivan Ganchev, Robert D. van der Mei and J.L. van den Berg, Cham, Switzerland: Springer, 2018, 1, s. 212-240Kapittel i bok, del av antologi (Fagfellevurdert)
    Abstract [en]

    Traditional networks are transformed to enable full integrationof heterogeneous hardware and software functions, that are configuredat runtime, with minimal time to market, and are provided to theirend users on “as a service” principle. Therefore, a countless number ofpossibilities for further innovation and exploitation opens up. NetworkFunction Virtualization (NFV) and Software-Defined Networking (SDN)are two key enablers for such a new flexible, scalable, and service-orientednetwork architecture. This chapter provides an overview of QoS-awarestrategies that can be used over the levels of the network abstractionaiming to fully exploit the new network opportunities. Specifically, wepresent three use cases of integrating SDN and NFV with QoS-awareservice composition, ranging from the energy efficient placement of virtualnetwork functions inside modern data centers, to the deployment ofdata stream processing applications using SDN to control the networkpaths, to exploiting SDN for context-aware service compositions.

  • 22.
    Castro C, Marcel
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Prasad, Durga M
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    Avallone, Stefano
    Peer-to-Peer Selection and Channel Assignment for Wireless Mesh Networks2011Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Wireless mesh networks are an emerging paradigm for future broadband wireless access networks, with manyapplication areas ranging from content distribution over community networking and providing backhaul networking for sensor devices. In wireless mesh networks, clients connect to wireless routers which are equipped with one or more wireless cards and relay the packets over the wireless links towards internetgateways or the destination. Peer-to-Peer applications are an important class of applications which contributes nowadays to the majority of internet traffic. Therefore, it is important to provide high capacity in the mesh network to support them. However, the capacity of wireless mesh networks depends on many factors such as network topology and size, traffic volume and pattern, interfaces per node and channel assignment scheme used, modulation schemes, routing approaches, etc. In this paper, we develop an analytical framework which allows to estimate theachievable capacity of a wireless mesh network when peer-to-peer applications download many flows simultaneously. The model is based on the collision domain concept and incorporates various channel assignment, replication and peer selection strategies. We investigate the achievable capacity for various scenarios and study the impact of different parameters such as the number of channels or radios used

  • 23.
    Castro, Marcel C.
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Dely, Peter
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Vaidya, Nitin H.
    QoS-Aware Channel Scheduling for Multi-Radio/Multi-Channel Wireless Mesh Networks2009Inngår i: Proceedings of the Fourth ACM International Workshop on Wireless Network Testbeds, Experimental evaluation and Characterization (WiNTECH 09), New York: ACM , 2009Konferansepaper (Fagfellevurdert)
    Abstract [en]

    In non-static multi-radio/multi-channel wireless mesh networks architectures such as Net-X, mesh nodes need to switch channels in order to communicate with different neighbors. Present channel schedulers do not consider the requirements of real time traffic such as voice over IP. Thus the resulting quality is low. We propose a novel channel scheduler for the Net-X platform that takes into account packet priorities. We evaluate the algorithm on the KAUMesh testbed. Our algorithm outperforms the standard round-robin scheduler both in terms of average delay and jitter.

  • 24.
    Castro, Marcel
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Villanueva, Eva
    Ruiz, Iraide
    Sargento, Susana
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Performance Evaluation of Structured P2P over Wireless Multi-hop Networks2008Inngår i: SENSORCOMM '08 Proceedings of the 2008 Second International Conference on Sensor Technologies and Applications, IEEE conference proceedings, 2008, s. 796-801Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Internet connected wireless multi-hop networks are an interesting alternative for providing broadband wireless access. In order for the network to be transparent, the same services need to be available as in standard infrastructure wireless deployments. However, there is a significant challenge in providing services such as authentication, name resolution, VoIP over multi-hop mesh networks as dedicated servers implementing those services might be not available. Therefore, deploying overlay networks in the mesh to decentralize those services and move towards a Peer-to-Peer paradigm is an interesting approach. However, the multi-hop nature of wireless mesh networks and the restrictions in resource availability might cause problems when deploying overlay networks on top of such environments. In this paper, we investigate the overhead and trade-offs when deploying a structured overlay solution such as the Bamboo DHT over wireless multi-hop mesh networks. We provide various simulation results characterizing the overhead of management and control traffic and give recommendations for performance improvement.

  • 25.
    Cavalcanti de Castro, Marcel
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Dely, Peter
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Karlsson, Jonas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    Capacity Increase for Voice over IP Traffic through Packet Aggregation in Wireless Multihop Mesh Networks2007Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Recently, Voice over IP (VoIP) has become an important service for the future internet. However, for ubiquitous wireless VoIP services, greater coverage will be necessary as promised by the advent of e.g. 802.11 WLAN based wireless meshed networks. Unfortunately, the transmission of small (voice) packets imposes high overhead which leads to low capacity for VoIP over 802.11 based multihop meshed networks. In this work, we present a novel packet aggregation mechanism that significantly enhances capacity of VoIP in wireless meshed networks while still maintaining satisfactory voice quality. Extensive experiments using network simulation ns-2 confirm that our packet aggregation algorithm can lead to a significantly increase in the number of supported concurrent VoIP flows over a variety of different hop numbers while reducing the MAC layer contention

  • 26.
    Cavalcanti de Castro, Marcel
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Galluccio, L
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    Palazzo, S
    Rametta, C
    On the comparison between performance of DHT-based protocols for opportunistic networks2010Inngår i: Proceedings of Future Network and MobileSummit 2010, IIMC , 2010Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Opportunistic networks represent a new frontier for networking research as due to node mobility the network might become disconnected. Such intermittent connectivity imposes challenges to protocol design, especially when information access might require the availability of updated information about resources shared by mobile nodes. An opportunistic network can be seen as a peer-to-peer network where resources should be located in a distributed way. Numerous solutions for P2P resource management have been proposed in the last years. Among the different approaches being considered, Distributed Hash Table (DHT) based schemes offer the advantages of a distributed approach which can be tuned to network scalability. In this paper we consider two well known P2P DHT-based solutions for wireless networks denoted as Bamboo and Georoy, and compare their performance in a multihop wireless scenario. We evaluate scalability and key lookup behavior for different network sizes. The results allow us to gain insights into protocol behavior which allows to select for a given network configuration the appropriate scheme.

  • 27.
    Cavalcanti de Castro, Marcel
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Gallucio, Laura
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    Rametta, Corrado
    Opportunistic P2P Communications in Delay Tolerant Rural Scenarios2011Inngår i: EURASIP Journal on Wireless Communications and Networking, ISSN 1687-1472, E-ISSN 1687-1499, Vol. Januari, artikkel-id 892038Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Opportunistic networking represents a promising paradigm for support of communications, specifically in infrastructure-less scenarios such as remote areas communications. In principle in opportunistic environments, we would like to make available all the applications thought for traditional wired and wireless networks like file sharing and content distribution. In this paper we present a delay tolerant scenario for file sharing applications in rural areas where an opportunistic approach is exploited. In order to support communications, we compare two peer-to-peer (P2P) schemes initially conceived for wireless networks and prove their applicability and usefulness to a DTN scenario where replication of resources can be used to improve the lookup performance and the network can be occasionally connected by mean of a data mule. Simulation results show the suitability of the schemes and allow to derive interesting design guidelines on the convenience and applicability of such approaches

  • 28.
    Cavalcanti de Castro, Marcel
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    Challenges of SIP in Internet Connected MANETs2007Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Mobile Ad Hoc networking has been considered as one of the most important technologies to support future Ubiquitous and Pervasive Computing Scenarios and internet connected MANETs will be an integral part of future wireless networks. For providing multimedia services and Voice over IP in such environment, support for Session Initiation Protocol (SIP) is essential. A MANET is a decentralized collection of autonomous nodes but a SIP infrastructure requires centralized proxies and registrar servers. In this paper, we study the implications of using standard SIP architecture in internet connected MANETs. We analyze performance limitations of SIP service scalability when centralized proxies/registrars located in the access network are used by MANET nodes. We also present and compare an alternative approach to provide SIP services in internet connected MANETs in order to minimize the impact of such performance limitations

  • 29.
    Cavalcanti de Castro, Marcel
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    On the Interaction Between Peer Selection, Routing and Channel Assignment2011Konferansepaper (Annet (populærvitenskap, debatt, mm))
  • 30.
    Cavalcanti de Castro, Marcel
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    Optimizing SIP service provisioning in internet connected MANETs (Invited Paper)2006Konferansepaper (Annet (populærvitenskap, debatt, mm))
    Abstract [en]

    Recently, Mobile Ad-hoc Networks (MANETs) have gained a lot of attraction because they are flexible, self-configurable and fast to deploy. Systems beyond 4G are likely to consist of a combination of heterogeneous wireless technologies and naturally might comprise MANETs as one component. In order to provide multimedia services such as Voice over IP in such environment, support for Session Initiation Protocol (SIP) is essential. A MANET is a decentralized collection of autonomous nodes but a SIP infrastructure requires centralized proxies and registrar servers. In this paper, we first study the implications of using standard SIP architecture in internet connected MANETs. We analyze limitations of SIP service scalability when centralized proxies/registrars located in the Access Network are used by MANET nodes. Finally, we present alternative approaches to provide SIP services in such environment to avoid such limitations

  • 31.
    Cavalcanti de Castro, Marcel
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    SIP based Service Provisioning for hybrid MANETs2007Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Traditional Voice over IP (VoIP) systems is based on client/server architecture, which is not applicable to Mobile Ad Hoc Networks (MANETs), which are a decentralized collection of autonomous nodes. However, internet connectivity for MANETs becomes important as internet connected MANETs can serve as hot spot extension in 4G scenarios. Here, MANET nodes can reach any wired node thus potentially registering with SIP proxies in the fixed network becomes a viable solution. In order to study the implications of using VoIP systems in internet connected MANETs we present in this paper simulation result of SIP service scalability when centralized proxies/registrars located in the Access Network are used by MANET nodes. Alternative approaches to provide SIP services in such environment are also discussed to improve performance

  • 32.
    Cavalcanti de Castro, Marcel
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    SIP in hybrid MANETs - A gateway based approach2006Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Mobile Ad Hoc networking has been considered as one of the most important technologies to support future Ubiquitous and Pervasive Computing Scenarios and internet connected MANETs will be an integral part of future wireless networks. For providing multimedia services and Voice over IP in such environment, support for Session Initiation Protocol (SIP) is essential. A MANET is a decentralized collection of autonomous nodes but a SIP infrastructure requires centralized proxies and registrar servers. In this paper, we study the implications of using standard SIP architecture in internet connected MANETs. We analyze performance limitations of SIP service scalability when centralized proxies/registrars located in the Access Network are used by MANET nodes. We also present and compare an alternative approach to provide SIP services in internet connected MANETs in order to minimize the impact of such performance limitations

  • 33.
    Cavalcanti de Castro, Marcel
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    Avallone, Stefano
    Uni Napoli.
    BestPeer: A Load-aware Multi-path Peer Selection for Wireless Mesh Networks2012Inngår i: 2012 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM), IEEE Press, 2012Konferansepaper (Fagfellevurdert)
    Abstract [en]

    In this paper we study the interactions between peer selection, routing and channel assignment while deploying Peer-to-Peer (P2P) systems over multi-channel multi-radio Wireless Mesh Networks (WMNs). In particular we propose Bestpeer, a novel peer selection algorithm for WMNs which incorporates a cross-layer path load metric and integrates multi-path load balancing capability throughout the P2P download process in order to achieve faster resource disseminations. By comparing Bestpeer with BitTorrent through extensive simulations, we show that we can reduce the time to disseminate a resource by up to 40 %. The key mechanism used by Bestpeer to increase performance in WMNs is the effective exploitation of cross-layer information made available from the routing and channel assignment during the peer selection process in order to balance the load along high capacity paths

  • 34.
    Cavalcanti de Castro, Marcel
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    Avallone, Stefano
    Measuring the Impact of ACI in Cognitive Multi-Radio Mesh Networks2010Konferansepaper (Fagfellevurdert)
    Abstract

    In this paper we address the impact of ACI on dynamic spectrum allocation in multi-radio systems. In particular, we present the benefits of dynamic spectrum allocation by adapting channel bandwidth and distance in order to mitigate ACI in multi-radio mesh networks. Based on our measurement campaign in an indoor mesh testbed, which we extended in order to use adaptive channel width, we evaluate the performance in terms of network throughput. We show that by using channel bandwidth adaptation and antenna separation, the impact of ACI can be significantly reduced. The performed experiments give important insights into ACI in multi-radio cognitive systems which help to develop e.g. better channel assignment algorithms or capacity estimation methods

  • 35.
    Cavalcanti de Castro, Marcel
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    Castro, Marcel C
    Chiasserini, Carla-Fabiana
    Casetti, Claudio
    Korpeoglu, Ibrahim
    Peer-to-Peer Overlay in Mobile Ad-hoc Networks2009Inngår i: Handbook of Peer-to-Peer Networking / [ed] X. Shen, H. Yu and J. Buford and M. Akon, New York: Springer , 2009Kapittel i bok, del av antologi (Annet vitenskapelig)
    Abstract

    Wireless multi-hop networks such as mobile ad-hoc (MANET) or wireless

    mesh networks (WMN) have attracted big research efforts during the last years

    as they have huge potential in several areas such as military communications, fast

    infrastructure replacement during emergency operations, extension of hotspots or

    as an alternative communication system. Due to various reasons, such as characteristics

    of wireless links, multi-hop forwarding operation, and mobility of nodes,

    performance of traditional peer-to-peer applications is rather low in such networks.

    In this book chapter, we provide a comprehensive and in-depth survey on recent research

    on various approaches to provide peer-to-peer services in wireless multi-hop

    networks. The causes and problems for low performance of traditional approaches

    are discussed. Various representative alternative approaches to couple interactions

    between the peer-to-peer overlay and the network layer are examined and compared.

    Some open questions are discussed to stimulate further research in this area

  • 36.
    Cavalcanti de Castro, Marcel
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    Kliot, Gabriel
    Friedman, Roy
    Kummer, Raphäel
    Kropf, Peter
    Felber, Pascal
    Minimizing DHT Routing Stretch in MANETs2009Konferansepaper (Fagfellevurdert)
  • 37.
    Chow, Lawrence
    et al.
    Stanford Univ, Stanford, CA 94305 USA.
    Collins, Bradley
    Stanford Univ, Stanford, CA 94305 USA.
    Bambos, Nicholas
    Stanford Univ, Stanford, CA 94305 USA.
    Dely, Peter
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    Kassler, Andreas
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap.
    Peylo, Christoph
    Deutsch Telekom Labs, Berlin, Germany.
    Einsiedler, Hans
    Deutsch Telekom Labs, Berlin, Germany.
    Bayer, Nico
    Deutsch Telekom Labs, Berlin, Germany.
    Channel Aware Rebuffering for Wireless Media Streaming with Handoff Control2013Inngår i: 2013 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), IEEE Press, 2013, s. 4434-4439Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Packet/frame 'rebuffering' in wireless video streaming typically considers only connectivity from the mobile terminal to its network access point (AP). However, in the presence of multiple APs with the possibility of handoffs, the overall wireless environment should be considered. We develop a model capturing joint rebuffering & handoff dynamics in wireless video streaming, and design a new channel-aware joint rebuffering & handoff control scheme, aiming to minimize the long-run average cost of video jitters and freezes. We first characterize the optimal control in the general case of multiple wireless APs/channels and multiple states per channel. Subsequently, we evaluate the system performance in key important cases, using experimental traces of wireless channel data. We explore the relationship between optimal rebuffering thresholds and overall channel dynamics, and evaluate the associated joint handoff control. The performance results demonstrate the importance of jointly managing rebuffering and handoff controls to achieve high-performance wireless video streaming.

  • 38.
    Chow, Lawrence
    et al.
    Stanford University.
    Collins, Bradley
    Stanford University.
    Bambos, Nick
    Stanford University.
    Peylo, Christoph
    Telekom Innovation Laboratories.
    Einsiedler, Hans
    Telekom Innovation Laboratories.
    Bayer, Nico
    Telekom Innovation Laboratories.
    Dely, Peter
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    Playout-Buffer Aware Hand-Off Control for Wireless Video Streaming2012Inngår i: 2012 IEEE Global Communications Conference (GLOBECOM 2012): Proceedings of a meeting held 3-7 December 2012, Anaheim, California, USA, IEEE conference proceedings, 2012, s. 5237-5242Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Wireless hand-off control typically considers only connectivity strength from the mobile terminal to alternative access points. In wireless video streaming, however, where video freezing must be avoided at the mobile terminal, the playout buffer level should also be considered by hand-off control. In this paper, we first develop a model capturing hand-off dynamics under video streaming, and design a new playout buffer aware hand-off control. It aims to avert a video freeze for as long as possible, maximizing the expected time until freezing. We compute the optimal control in the general case of multiple access points and multiple connectivity strength states per channel. The optimal hand-off control is then computationally probed in specific relevant cases. It is demonstrated that there is a certain playout buffer threshold level - a buffer tipping point - above which a hand-off should be attempted. Of course, this tipping point depends on the access point to mobile channel statistics

  • 39.
    Coutinho, Nuno
    et al.
    Universidade de Aveiro, Portugal.
    Matos, Ricardo
    Universidade de Aveiro, Portugal.
    Marques, Carlos
    Universidade de Aveiro, Portugal.
    Reis, Andre
    Universidade de Aveiro, Portugal.
    Sargento, Susana
    Universidade de Aveiro, Portugal.
    Chakareski, Jacob
    University of Alabama, United States.
    Kassler, Andreas
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Dynamic Dual-Reinforcement-Learning Routing Strategies for Quality of Experience-aware Wireless Mesh Networking2015Inngår i: Computer Networks, ISSN 1389-1286, E-ISSN 1872-7069, Vol. 88, nr 269, artikkel-id 285Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [sv]

    The impact of transmission impairments such as loss and latency on user perceived quality(QoE) depends on the service type. In a real network, multiple service types such as audio,video, and data coexist. This makes resource management inherently complex and difficultto orchestrate. In this paper, we propose an autonomous Quality of Experience managementapproach for multiservice wireless mesh networks, where individual mesh nodes apply rein-forcement learning methods to dynamically adjust their routing strategies in order to maxi-mize the user perceived QoE for each flow. Within the forwarding nodes, we develop a novelpacket dropping strategy that takes into account the impact on QoE. Finally, a novel sourcerate adaptation mechanism is designed that takes into account the expected QoE in order tomatch the sending rate with the available network capacity. An evaluation of our mechanismsusing simulations demonstrates that our approach is superior to the standard approaches,AODV and OLSR, and effectively balances the user perceived QoE between the service flows.

  • 40.
    Curado, Marilia
    et al.
    Univ Coimbra, Dept Informat Engn, P-3000 Coimbra, Portugal.;Univ Coimbra, Ctr Informat & Syst, Lab Commun & Telemat, P-3000 Coimbra, Portugal..
    Ganchev, Ivan
    TRC, Limerick, Ireland.;Plovdiv Univ Paisii Hilendarski, Plovdiv, Bulgaria..
    Kassler, Andreas
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Koucheryavy, Yevgeni
    TUT, Dept Elect & Commun Engn, Pretoria, South Africa..
    Guest editorial: Special issue on mobile wireless networks2016Inngår i: Computer Networks, ISSN 1389-1286, E-ISSN 1872-7069, Vol. 107, s. 145-147Artikkel i tidsskrift (Fagfellevurdert)
  • 41.
    Dahlberg, Rasmus
    et al.
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Pulls, Tobias
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Vestin, Jonathan
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Høiland-Jørgensen, Toke
    Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT. Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), Institutionen för matematik och datavetenskap (from 2013).
    Aggregation-Based Gossip for Certificate TransparencyAnnet (Annet vitenskapelig)
    Abstract [en]

    Certificate Transparency (CT) is a project that mandates public logging of TLS certificates issued by certificate authorities. While a CT log is designed to be trustless, it relies on the assumption that every client sees and cryptographically verifies the same log. The solution to this problem is a gossip mechanism that ensures that clients share the same view of the logs. Despite CT being added to Google Chrome, no gossip mechanism is pending wide deployment. We suggest an aggregation-based gossip mechanism that passively observes cryptographic material that CT logs emit in plaintext, aggregating at packet processors and periodically verifying log consistency off-path. Based on 20 days of RIPE Atlas measurements that represents clients from 3500 autonomous systems and 40% of the IPv4 space, our proposal can be deployed incrementally for a realistic threat model with significant protection against undetected log misbehavior. We also discuss how to instantiate aggregation-based gossip on a variety of packet processors, and show that our P4 and XDP proof-of-concepts implementations run at line-speed.

  • 42.
    Dely, Peter
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Cavalcanti de Castro, Marcel
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    Moldsvor, Arild
    Karlstads universitet, Fakulteten för teknik- och naturvetenskap, Avdelningen för fysik och elektroteknik.
    Soukhakian, Sina
    Practical Considerations for Channel Assignment in Wireless Mesh Networks2010Inngår i: GLOBECOM Workshops (GC Wkshps), 2010 IEEE, IEEE , 2010, s. 763-767Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Abstract--- In multi-radio wireless mesh networks (WMNs) several radios can operate within one node simultaneously on different channels. Due to frequency selective fading and varying output powers of WLAN cards the received signal strength on channels in the U-NII band can differ by several dB. Furthermore, power leakage from neighboring channels in the frequency spectrum can cause adjacent channel interference (ACI). Using a IEEE 802.11a testbed, we experimentally evaluate the achievable throughput of a multi-radio mesh network in a string topology under the impact of ACI and channel heterogeneity. Our results show that for low PHY rates the channel separation is a good indicator for throughput. However, for high PHY rates the propagation properties of a specific channel also need to be considered. Based on the results we provide recommendations for designing channel assignment algorithms for IEEE 802.11-based WMNs

  • 43.
    Dely, Peter
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    D’Andreagiovanni, Fabio
    Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB), Germany.
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    Fair Optimization of Mesh-Connected WLAN Hotspots2015Inngår i: Wireless Communications & Mobile Computing, ISSN 1530-8669, E-ISSN 1530-8677, Vol. 15, nr 5, s. 924-946Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    In Wireless mesh networks mesh access points (MAPs) forward traffic wirelessly towards users or Internet gateways. A user device usually connects to the MAP with the strongest signal, as such MAP should guarantee the best quality of service. However, this connection policy may lead to: (i) unfairness towards users that are distant from gateways; (ii) uneven distribution of users to MAPs; and (iii) inefficient use of network paths. We present a new model and solution approach to the problem of assigning users to MAPs and routing the data within the mesh network with the objective of providing max–min fair throughput. The problem is formulated as a mixed-integer linear programming problem (MILP). Because of the inherent complexity of the problem, real size instances cannot be solved to optimality within the time limits for online optimization. Therefore, we propose an original heuristic solution algorithm for the resulting MILP. Both numerical comparisons and network simulations demonstrate the effectiveness of the proposed heuristic. For random networks, the heuristic achieves 98% of the optimal solution. Network simulations show that in medium-sized networks, the number of users with at least 1Mbit/s minimum end-to-end rate increases by 550% when compared with the classical signal-strength based association.

  • 44.
    Dely, Peter
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    Adaptive Aggregierung von VoIP Paketen in Wireless Mesh Networks2008Konferansepaper (Fagfellevurdert)
  • 45.
    Dely, Peter
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    Architecture and Algorithms for User Association and Routing in Wireless Mesh Networks2011Konferansepaper (Annet (populærvitenskap, debatt, mm))
  • 46.
    Dely, Peter
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    KAUMesh Demo: A MultiRadio MultiChannel Mesh Testbed2009Annet (Annet (populærvitenskap, debatt, mm))
    Abstract [en]

    In this demo, we will present KAUMesh, an experimental Wireless Broadband Mesh Network based on 802.11a/b/g WLAN devices that has been deployed at the Karlstad University Campus. KAUMesh comprises currently 20 mesh nodes, which are permanently installed to cover large areas inside the new House 21. Standard 802.11b/g based clients can be used to connect to the mesh as they would to any given normal WLAN access point. KAUMesh features multiple gateways that connect the mesh network towards the internet. By deploying multiple radio cards in mesh nodes, KAUMesh is able to fully exploit available spectrum in the mesh backbone. One radio card interface is used for transparent client access, using typically 802.11b/g mode. The mesh backhaul connectivity is established using multiple radio interfaces per mesh node. The interfaces involved in the backhaul use a hybrid channel assignment mechanism, which rebalances channel usage according to user demand. As the hybrid channel assignment involves channel switching, a novel scheduling approach for making the channel switching QoS aware has been developed. KAUMesh also supports 802.11e standard on the mesh interface to provide service differentiation on the mesh backhaul

  • 47.
    Dely, Peter
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    On Packet Aggregation for VoIP in Wireless Meshed Networks2007Konferansepaper (Fagfellevurdert)
  • 48.
    Dely, Peter
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    Bayer, Nico
    Telekom Innovation Laboratories.
    Einsiedler, Hans
    Telekom Innovation Laboratories.
    Method and System for Centralized Control of User Associations in Wireless Mesh Networks2012Patent (Annet (populærvitenskap, debatt, mm))
  • 49.
    Dely, Peter
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    Bayer, Nico
    Telekom Innovation Laboratories.
    Einsiedler, Hans
    Telekom Innovation Laboratories.
    Peylo, Christoph
    Telekom Innovation Laboratories.
    Optimization of WLAN associations considering handover costs2012Inngår i: EURASIP Journal on Wireless Communications and Networking, ISSN 1687-1472, E-ISSN 1687-1499, Vol. 255Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    In Wireless Local Area Network (WLAN) hotspots the coverage areas of Access Points (APs) often overlap considerably. Current state of the art optimization models find the optimal AP for each user station by balancing the load across the network. Recent studies have shown that in typical commercial WLAN hotspots the median connection duration is short. In such dynamic network settings the mentioned optimization models might cause many handovers between APs to accommodate for user arrivals or mobility. We introduce a new mixed integer linear optimization problem that allows to optimize handovers but takes into account the costs of handovers such as signaling and communication interruption. Using our model and extensive numeric simulations we show that disregarding the handover costs leads to low performance. Based on this insight we design a new optimization scheme that uses estimates of future station arrivals and mobility patterns. We show that our scheme outperforms current optimization mechanisms and is robust against estimation errors

  • 50.
    Dely, Peter
    et al.
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap.
    Kassler, Andreas
    Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Centrum för HumanIT.
    Bayer, Nico
    Telekom Innovation Laboratories.
    Einsiedler, Hans
    Telekom Innovation Laboratories.
    Peylo, Christoph
    Telekom Innovation Laboratories.
    Chow, Lawrence
    Stanford University.
    Collins, Bradley
    Stanford University.
    Bambos, Nicholas
    Stanford University.
    Daniel, Mellado
    Miguel, Sanchez
    A Software Defined Networking Approach for Handover Management with Real-Time Video in WLANs2012Konferansepaper (Fagfellevurdert)
1234 1 - 50 of 194
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf