Change search
Refine search result
12345 1 - 50 of 217
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1. Abedifar, V.
    et al.
    Furdek, Marija
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Muhammad, Ajmal
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Eshghi, M.
    Wosinska, Lena
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Routing, modulation format, spectrum and core allocation in SDM networks based on programmable filterless nodes2018In: Optics InfoBase Conference Papers, Optics Info Base, Optical Society of America, 2018Conference paper (Refereed)
    Abstract [en]

    An RMSCA approach based on binary particle swarm optimization is proposed for programmable filterless SDM networks, aimed at minimizing core and spectrum usage. Nearoptimal resource consumption.

  • 2.
    Ammouri, Kevin
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS.
    Cho, Kangyoun
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS.
    Interconnection of Two Different Payment Systems2019Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    Mobile money, a means of transferring payments via mobile devices, has become increasingly popular. The demand for convenient financial products or services is a crucial factor in why innovative developers want to incorporate mobile money into existing financial products/services. The goal is to provide convenient financial services that enable customers to quickly send and receive money between two mobile payment platforms.

    The Swedish blockchain company, Centiglobe, is searching for a system whereby payments can be made conveniently between two mobile payment platforms, specifically Alipay and M PESA. This thesis sought to develop such a system by utilizing the application programming interfaces (APIs) (provided by Alipay and M PESA) coupled with Centiglobe’s blockchain to facilitate payments between an Alipay user and an M PESA user.

    Solving this problem began with an initial literature study of previous work related to this topic and reading the extensive API documentation provided by Alipay and Daraja Safaricom (the developers of M PESA). Next, a flowchart was created and used as a guide throughout the development of the system. Testing the system entailed integration testing. The performance of the system was determined by measuring the execution time to make a cross system payment.

    A one-way transfer system was developed, as Alipay users can make a payment to M PESA users but not the reverse. The results of the integration testing shows that the system is a feasible solution. The execution time of a payment shows that it is relatively quick (~9.1 seconds); thus the performance is adequate.The conclusion is that this system is a viable solution for incorporating Alipay and M PESA as mobile payment services. Moreover, the system partially facilitates person-to-person payments between them – subject to the limitations of the Alipay API. In addition, this system provides a foundation for other inter-platform mobile payment solutions.

    The full text will be freely available from 2019-11-01 00:11
  • 3. Antichi, Gianni
    et al.
    Castro, Ignacio
    Chiesa, Marco
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Network Systems Laboratory (NS Lab). Université catholique de Louvain.
    Fernandes, Eder L.
    Lapeyrade, Remy
    Kopp, Daniel
    Han, Jong Hun
    Bruyere, Marc
    Dietzel, Christoph
    Gusat, Mitchell
    Moore, Andrew W.
    Owezarski, Philippe
    Uhlig, Steve
    Canini, Marco
    ENDEAVOUR: A Scalable SDN Architecture For Real-World IXPs2017In: IEEE Journal on Selected Areas in Communications, ISSN 0733-8716, E-ISSN 1558-0008, Vol. 35, no 11, p. 2553-2562Article in journal (Refereed)
    Abstract [en]

    Innovation in interdomain routing has remained stagnant for over a decade. Recently, Internet eXchange Points (IXPs) have emerged as economically-advantageous interconnection points for reducing path latencies and exchanging ever increasing traffic volumes among, possibly, hundreds of networks. Given their far-reaching implications on interdomain routing, IXPs are the ideal place to foster network innovation and extend the benefits of software defined networking (SDN) to the interdomain level. In this paper, we present, evaluate, and demonstrate ENDEAVOUR, an SDN platform for IXPs. ENDEAVOUR can be deployed on a multi-hop IXP fabric, supports a large number of use cases, and is highly scalable, while avoiding broadcast storms. Our evaluation with real data from one of the largest IXPs, demonstrates the benefits and scalability of our solution: ENDEAVOUR requires around 70% fewer rules than alternative SDN solutions thanks to our rule partitioning mechanism. In addition, by providing an open source solution, we invite everyone from the community to experiment (and improve) our implementation as well as adapt it to new use cases.

  • 4.
    Apanasevic, Tatjana
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS.
    Opportunities and challenges of mobile payment services: The perspective of service providers2018Doctoral thesis, comprehensive summary (Other academic)
    Abstract [en]

     Mobile payments are transforming the payments industry. These services open up the opportunity for non-banking actors to enter the market. In order to embrace this challenge, banks, traditional payments market players, are forced to launch mobile payments. However, in Europe and most developed economies, a big number of launched services get terminated soon after their introduction in the market. Hence, the ability of different actors to act locally calls for additional research.

    The main objective of this thesis is to broaden knowledge and understanding about the ways mobile payment service providers address the opportunities and challenges of mobile payment services. In order to investigate this problem, this research (i) explores factors stimulating and hindering the introduction of mobile payments using perspectives of different types of service providers (i.e., banks, independent providers, direct operator billing providers, retailers, and public transport companies) and (ii) seeks to explain the importance of these factors for each type of provider.

    The primary data collected using interview method. More than 40 industry representatives in six countries were contacted. The Service, Technology, Organisation, and Finance (STOF) model was used as a theoretical research framework. This is a business modelling framework that specifies a set of critical design issues that have to  be considered within each model’s domain.

    Research findings highlight that the organisation domain is the key domain, which  affects all other domains and has an impact on the general viability of the business model. A comparison of the approaches used by different service providers to address each of the critical design issues helped to identify the factors that are most important within each domain. These factors stimulate or hinder development of a viable business model within each category of service providers.

    This research contributes to a better understanding of challenges and success factors associated with the design of business models for new mobile services and uses the lens of the STOF model. The contributions to the academic research on mobile payments are: (i) collection and analysis of a rich empirical data set on mobile payment services implemented in six Northern European countries, (ii) discussion of a bigger picture by connecting research findings to the context of the existing payment system, (iii) extension  of knowledge on business models for mobile ticketing, and (iv) extension of knowledge on the value of mobile ticketing services in the business-to-business (B2B) context.

  • 5.
    Apanasevic, Tatjana
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS.
    Primary data collection: Approaches of service providers towards mobile payments2018Report (Other academic)
    Abstract [en]

    Mobile payments are new services enabled by evolution of information and communication technologies. These services can be provided by different types of actors both banks and non-banks. The understanding of capabilities and limitations of different service providers to act in local markets requires further understanding. Implemented research seeks to extend knowledge in this area. I have implemented research focused on approaches used by different types of service providers including banks, independent providers, operator billing providers, retailers, and public transport companies in six Northern European countries.

    Exploratory part of the research aims to address the following research question: What factors stimulate and hinder the introduction of mobile payments? The main objective of this report is to present primary data collected during the research through interviews with contacted companies.

    The collected primary data is classified and organised using the STOF (Service, Technology, Organisation, and Finance) model. Evidence is presented in tables. This primary data is further used for explanatory study. At the same time, this data can be used by other researchers studying the same area. The collected data is reach in facts and presents the overview of different strategies. 

  • 6.
    Apanasevic, Tatjana
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS.
    Arvidsson, Niklas
    KTH, School of Industrial Engineering and Management (ITM), Industrial Economics and Management (Dept.), Sustainability and Industrial Dynamics.
    Markendahl, Jan
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Mobile payments: a proposal for a context-oriented approach based on socio-technical system theoryIn: Journal of Innovation Management, ISSN 2183-0606Article in journal (Refereed)
    Abstract [en]

    A recent review on mobile payment research by Dahlberg et al. (2015) concludes that there is a need to synthesise this research area by studying contexts in which innovation is done as well as to integrate different aspects of research. This article aims to provide a proposal for how to achieve such integration and context-orientation by building on previous studies as well as an additional review. Our systematic literature review of mobile payments research is focused on papers published during 2006–2016. The main objective is to examine how mobile payments research has been conducted from the methodological and theoretical perspectives. Our findings show that research on mobile payments is a multidisciplinary research. Three main themes, which are in line with previous studies, in research are: customer adoption, technological aspects, and business aspects. Moreover, research is mainly analytical based on deductive approach. To meet the challenge formulated in the previous research, we propose and apply a socio-technical system framework to achieve synthesis and context-specific consideration in future research on mobile payments.

  • 7.
    Apanasevic, Tatjana
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS.
    Markendahl, Jan
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Mobile ticketing services in the Northern Europe: Critical business model issues2018In: Internet of Things Business Models, Users, and Networks, 2017 / [ed] Morten Falch, Copenhagen, Denmark: IEEE, 2018, p. 1-8Conference paper (Refereed)
    Abstract [en]

    Started as SMS ticketing, today, mobile ticketing services become a platform for combined mobility solutions that integrate mobile ticketing, bike renting, car sharing, and parking payment services. Mobile ticketing services provide a number of benefits for public transport companies and passengers, however, in some Northern European countries, the share of mobile ticket sales does not exceed 10 percent. In this paper, we analyse business models of three types of mobile ticketing services (SMS, in-app, and “Be-In Be-Out” (BIBO)) in order to identify factors that negatively affect wider penetration of mobile ticketing. In order to do so, we use STOF (Service, Technology, Organisation, and Finance) model. The research reveals that there are a number of challenges related to service, technology, and finance domains of mobile ticketing. Due to this, with the help of price policy, many public transport companies push choices of their customers towards use of plastic travel card.

  • 8.
    Apanasevic, Tatjana
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS.
    Markendahl, Jan
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Mobile ticketing services in the Northern Europe Critical business model issues2017In: 2017 JOINT 13TH CTTE AND 10TH CMI CONFERENCE ON INTERNET OF THINGS - BUSINESS MODELS, USERS, AND NETWORKS / [ed] Falch, M, IEEE , 2017Conference paper (Refereed)
    Abstract [en]

    Started as SMS ticketing, today, mobile ticketing services become a platform for combined mobility solutions that integrate mobile ticketing, bike renting, car sharing, and parking payment services. Mobile ticketing services provide a number of benefits for public transport companies and passengers, however, in some Northern European countries, the share of mobile ticket sales does not exceed 10 percent. In this paper, we analyse business models of three types of mobile ticketing services (SMS, in-app, and "Be-InBe-Out" (BIBO)) in order to identify factors that negatively affect wider penetration of mobile ticketing. In order to do so, we use STOF (Service, Technology, Organisation, and Finance) model. The research reveals that there are a number of challenges related to service, technology, and finance domains of mobile ticketing. Due to this, with the help of price policy, many public transport companies push choices of their customers towards use of plastic travel card.

  • 9.
    Apanasevic, Tatjana
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS.
    Markendahl, Jan
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    The value of mobile ticketing from a public transport perspective2018In: Journal of Payments Strategy & Systems, Vol. 11, no 4, p. 292-305Article in journal (Refereed)
    Abstract [en]

    Within the field of mobile payments, the market segment for mobile ticketing services is expected to grow, driven by the public transport sector. Although a large number of studies have explored the value of mobile payments to customers (ie service end users), there is a lack of research exploring the value of mobile payment and mobile ticketing for business customers (ie transport companies and retailers). This paper aims to address this gap and to explore the kinds of value that mobile ticketing services create for public transport companies. The research considers mobile ticketing services in six Northern European countries. The research findings suggest that within the business-to-business context, mobile ticketing services create multiple dimensions of value, namely enhanced technical functionality; financial value; better working environment; operational value; and reputational and customer relationship value. For passengers, meanwhile, value takes the form of convenience and service enhancement. These benefits are factors driving adoption of mobile ticketing and mobile payment services by public transport companies.

  • 10.
    Araujo, Igor M.
    et al.
    Fed Univ Para, Technol Inst, Belem, PA, Brazil..
    Natalino, Carlos
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Santana, Adamo L.
    Fuji Elect Co Ltd, Corp R&D Headquarters, 1 Fuji Machi, Hino, Tokyo, Japan..
    Cardoso, Diego L.
    Fed Univ Para, Technol Inst, Belem, PA, Brazil..
    Accelerating VNF-based Deep Packet Inspection with the use of GPUs2018In: 2018 20TH ANNIVERSARY INTERNATIONAL CONFERENCE ON TRANSPARENT OPTICAL NETWORKS (ICTON) / [ed] Jaworski, M Marciniak, M, Institute of Electrical and Electronics Engineers (IEEE), 2018, article id 8473638Conference paper (Refereed)
    Abstract [en]

    Network Function Virtualization (NFV) replaces the hardware that supports packet processing in network operation from specific-by general-purpose ones, reducing costs and bringing more flexibility and agility to the network operation. However, this shift can cause performance losses due to the non-optimal packet processing capabilities of the general-purpose hardware. Moreover, supporting the line rate of optical network channels with Virtualized Network Functions (VNFs) is a challenging task. This work analyzes the benefits of using Graphics Processing Units (GPUs) to support the execution of a Deep Packet Inspection (DPI) VNF towards supporting the line rate of an optical channel. The use of GPUs in VNFs has a great potential to increase throughput, but the delay incurred might be an issue for some functions. Our simulation was performed using an Intrusion Detection Systems (IDS) which performs DPI deployed as a VNF under real-world traffic scaled to high bit rates. Results show that the packet processing speedup achieved by using GPUs can reach up to 19 times, at the expense of a higher packet delay.

  • 11.
    Arslan, Bercis
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS.
    Fröjdh, Blenda
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS.
    E-wallet - designed for usability2019Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    As the use of mobile payment applications (apps) and electronic wallets (e-wallets)increases, so does the demand for a improved user experience when interactingwith these apps. The field of Human-Computer interaction (HCI) focuses onthe design, evaluation, and implementation of interactive computing systems forhuman use. One aspect of HCI is usability, i.e., the quality of the interactions witha product or system.

    This thesis investigates how an e-wallet can be designed to provide a high level ofusability by conforming to best HCI practices and by formative evaluation using aset of usability evaluation methods.The research process consisted of an initial literature study and developmentof a prototype, which was evaluated iteratively through Thinking-aloud-protocol(TAP) and a combination of performance measurements and questionnaire by achosen test group.

    By each iteration, the results of the performance measurements, as well as theverbal data improved. The most complex or difficult task, for the test subjectsto perform, was, according to the results, Pay via manual input. All goals wereachieved for all tasks except for the performance goal of a percentage of errorsbelow 5%.

    To conclude, it was clear that the test subjects had more trouble understandingthe concept of the e-wallet rather than navigating and completing tasks. Thedifficulties lay in understanding how currencies were stored and how transactionshappened. When developing this e-wallet we noticed that the most importantissue was to make new functions and concepts familiar to the user through relatingit to recognizable ideas.

  • 12.
    Azari, Amin
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Bitcoin Price Prediction: An ARIMA ApproachManuscript (preprint) (Other academic)
    Abstract [en]

    Bitcoin is considered as the most valuable currency in the world. Besides being highly valuable, its value has also experienced a steep increase, from around 1 dollar in 2010 to around 18000 in 2017. Then, in recent years, it has attracted considerable attention in a diverse set of fields, including economics and computer science. The former mainly focuses on studying how it affects the market, determining reasons behinds its price fluctuations, and predicting its future prices. The latter mainly focuses on its vulnerabilities, scalability, and other techno-cryptoeconomic issues. Here, we aim at revealing the usefulness of traditional autoregressive integrative moving average (ARIMA)model in predicting the future value of bitcoin by analyzing the price time series in a 3-years-long time period. On the one hand, our empirical studies reveal that this simple scheme is efficient in sub-periods in which the behavior of the time-series is almost unchanged, especially when it is used for short-term prediction,e.g. 1-day. On the other hand, when we try to train the Arima model to a 3-years-long period, during which the bitcoin price has experienced different behaviors, or when we try to use it for a long-term prediction, we observe that it introduces large prediction errors. Especially, the ARIMA model is unable to capture the sharp fluctuations in the price, e.g. the volatility at the end of 2017. Then, it calls for more features to be extracted and used along with the price for a more accurate prediction of the price. We have further investigated the bitcoin price prediction using an ARIMA model trained over the whole dataset, as well as a limited part of the history of the bitcoin price, with length of w, as inputs. Our study sheds lights on the interaction of the prediction accuracy, choice of (p; q; d), and window size w.

  • 13.
    Azari, Amin
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    On the DoF and Secure DoF of K-User MIMO Interference Channel with Instantaneous Relays2019Manuscript (preprint) (Other academic)
    Abstract [en]

    Interference channel, in which multiple user pairs communicate over shared resources, is a building block of communications networks. Here, the K-user interference channel (IC) aided by J instantaneous relays (IRs), i.e. relays without delay, is considered. For KICJR networks, where K>2 and J>1, the DoF performance and achievable schemes have not been investigated in literature. Here, we devise a novel achievable scheme, called restricted interference alignment (RIA), which restricts the received interference from each source at each destination in a limited sub-space, and then, aligns the restricted interferences. Furthermore, we develop an analytical tool for finding a tight upper bound on DoF of KICJR networks by analyzing the properness of the interference alignment equations. Moreover, we develop linear beamforming design for sources and relays based on the mean square error (MSE) minimization, as an achievable scheme. The performance evaluation results show that the achievable sum DoF by using the proposed RIA scheme and the MSE-based beamforming design match well with the derived upper bounds. Furthermore, the results confirm that the achieved sum DoF using the RIA scheme outperforms the existing achievable schemes. Motivated by these promising results, we further investigate impact of IRs in providing physical layer security, i.e. achieving secure DoF in interference networks. Specifically, we derive a lower bound on the achievable secure DoF by devising an achievable scheme, called transmission in the null space (TNS). This scheme makes the cross channels rank deficient and enables sources to select their transmit filters in the constructed null spaces. Performance evaluation shows that by leveraging IRs, the secure DoF performance of interference networks could be increased significantly. The proposed analytical framework in this work for rank deficiency-powered DoF analysis is expected to also attract attention from other research areas, e.g. beamforming design for millimeter wave communications.

  • 14.
    Azari, Amin
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Serving IoT Communications over Cellular Networks: Challenges and Solutions in Radio Resource Management for Massive and Critical IoT Communications2018Doctoral thesis, comprehensive summary (Other academic)
    Abstract [en]

    Internet of Things (IoT) communications refer to the interconnections of smart devices, with reduced human intervention, which enable them to participate more actively in everyday life. It is expected that introduction of a scalable, energy efficient, and reliable IoT connectivity solution can bring enormous benefits to the society, especially in healthcare, wellbeing, and smart homes and industries. In the last two decades, there have been efforts in academia and industry to enable IoT connectivity over the legacy communications infrastructure. In recent years, it is becoming more and more clear that the characteristics and requirements of the IoT traffic are way different from the legacy traffic originating from existing communications services like voice and web surfing, and hence, IoT-specific communications systems and protocols have received profound attention. Until now, several revolutionary solutions, including cellular narrowband-IoT, SigFox, and LoRaWAN, have been proposed/implemented. As each of these solutions focuses on a subset of performance indicators at the cost of sacrificing the others, there is still lack of a dominant player in the market capable of delivering scalable, energy efficient, and reliable IoT connectivity. The present work is devoted to characterizing state-of-the-art technologies for enabling large-scale IoT connectivity, their limitations, and our contributions in performance assessment and enhancement for them. Especially, we focus on grant-free radio access and investigate its applications in supporting massive and critical IoT communications. The main contributions presented in this work include (a) developing an analytical framework for energy/latency/reliability assessment of IoT communications over grant-based and grant-free systems; (b) developing advanced RRM techniques for energy and spectrum efficient serving of massive and critical IoT communications, respectively; and (c) developing advanced data transmission/reception protocols for grant-free IoT networks. The performance evaluation results indicate that supporting IoT devices with stringent energy/delay constraints over limited radio resources calls for aggressive technologies breaking the barrier of the legacy interference-free orthogonal communications.

  • 15.
    Azari, Amin
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Bria, Aurelian
    System and method for providing communication rules based on a status associated with a battery of a device2017Patent (Other (popular science, discussion, etc.))
    Abstract [en]

    The disclosure relates to communication systems and, more particularly, to a system and method for providing communication rules based on a status associated with a battery of a device.

  • 16.
    Azari, Amin
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Cavdar, Cicek
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Performance Evaluation and Optimization of LPWA IoT Networks: A Stochastic Geometry Approach2018In: 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings, IEEE, 2018, article id 8647881Conference paper (Refereed)
    Abstract [en]

    Leveraging grant-free radio access for enabling low-power wide-area (LPWA) Internet of Things (IoT) connectivity has attracted lots of attention in recent years. Regarding lack of research on LPWA IoT networks, this work is devoted to reliability modeling, battery-lifetime analysis, and operation-control of such networks. We derive the interplay amongst density of the access points, communication bandwidth, volume of traffic from heterogeneous sources, and quality of service (QoS) in communications. The presented analytical framework comprises modeling of interference from heterogeneous sources with correlated deployment locations and time-frequency asynchronous radio-resource usage patterns. The derived expressions represent the operation regions and rates in which, energy and cost resources of devices and the access network, respectively, could be traded to achieve a given level of QoS in communications. For example, our expressions indicate the expected increase in QoS by increasing number of transmitted replicas, transmit power, density of the access points, and communication bandwidth. Our results further shed light on scalability of such networks and figure out the bounds up to which, scaling resources can compensate the increase in traffic volume and QoS demand. Finally, we present an energy-optimized operation control policy for IoT devices. The simulation results confirm tightness of the derived analytical expressions, and indicate usefulness of them in planning and operation control of IoT networks.

  • 17.
    Azari, Amin
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Cavdar, Cicek
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Self-organized Low-power IoT Networks: A Distributed Learning Approach2018In: 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings, Institute of Electrical and Electronics Engineers (IEEE), 2018Conference paper (Refereed)
    Abstract [en]

    Enabling large-scale energy-efficient Internet-ofthings (IoT) connectivity is an essential step towards realization of networked society. While legacy wide-area wireless systems are highly dependent on network-side coordination, the level of consumed energy in signaling, as well as the expected increase in the number of IoT devices, makes such centralized approaches infeasible in future. Here, we address this problem by self-coordination for IoT networks through learning from past communications. To this end, we first study low-complexity distributed learning approaches applicable in IoT communications. Then, we present a learning solution to adapt communication parameters of devices to the environment for maximizing energy efficiency and reliability in data transmissions. Furthermore, leveraging tools from stochastic geometry, we evaluate the performance of proposed distributed learning solution against the centralized coordination. Finally, we analyze the interplay amongst energy efficiency, reliability of communications against noise and interference over data channel, and reliability against adversarial interference over data and feedback channels. The simulation results indicate that compared to the state of the art approaches, both energy efficiency and reliability in IoT communications could be significantly improved using the proposed learning approach. These promising results, which are achieved using lightweight learning, make our solution favorable in many low-cost low-power IoT applications.

  • 18.
    Azari, Amin
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Cavdar, Cicek
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Ozger, Mustafa
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Serving Non-Scheduled URLLC Traffic: Challenges and Learning-Powered StrategiesManuscript (preprint) (Other academic)
    Abstract [en]

    Supporting ultra-reliable low-latency communications (URLLC) is a major challenge of 5G wireless networks. Whilst enabling URLLC is essential for realizing many promising 5G applications, the design of communications' solutions for serving such unseen type of traffic with stringent delay and reliability requirements is in its infancy. In prior studies, physical and MAC layer solutions for assuring the end-to-end delay requirement of scheduled URLLC traffic have been investigated. However, there is lack of study on enabling non-scheduled transmission of urgent URLLC traffic, especially in coexistence with the scheduled URLLC traffic. This study at first sheds light into the coexistence design challenges, especially the radio resource management (RRM) problem. It also leverages recent advances in machine learning (ML) to exploit spatial/temporal correlation in user behaviors and use of radio  resources, and proposes a distributed risk-aware ML solution for RRM. The proposed solution benefits from hybrid orthogonal/non-orthogonal radio resource slicing, and proactively regulates the spectrum needed for satisfying delay/reliability requirement of each traffic type. A case study is introduced to investigate the potential of the proposed RRM in serving coexisting URLLC traffic types. The results further provide insights on the interplay between the reliabilities of coexisting traffic, uncertainties in users' demands and channel conditions, and amount of required radio resources.

  • 19.
    Azari, Amin
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Masoudi, Meysam
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Cavdar, Cicek
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Optimized Resource Provisioning and Operation Control for Low-power Wide-area IoT NetworksManuscript (preprint) (Other academic)
    Abstract [en]

    Grant-free radio access is a promising solution for reducing energy consumption and access delay in low power wide-area (LPWA) Internet of Things (IoT) networks. This work is devoted to reliability modeling, battery-lifetime analysis, resource provisioning, and operation control for grantfreeIoT networks. Our modeling captures correlation in devices’locations, benefits from 3D (time/frequency/code) interference analysis, and enables coexistence analysis of multi-type IoT technologies. We derive the interplay amongst density of the access points, communication bandwidth, traffic volume, and quality of service (QoS) of communications. Deriving the interplay enables scalability analysis, i.e. it figures out the required increase in device's energy consumption (or access network’s resources) for compensating the increase in traffic volume or QoS demand. Our major contribution consists in deriving traffic loads and respective exchange rates in which, energy and cost resources of devices and the access network, respectively, could be traded to achieve a given level of QoS. We further indicate operation regions in which scaling a parameter turns from being a friend into a foe. Finally, we present energy- and cost-optimized operation control and resource provisioning strategies, respectively. The simulation results confirm tightness of the analytical expressions, and indicate the usefulness of them in planning and operation control of IoT networks.

  • 20.
    Azari, Amin
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Miao, Guowang
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Stefanovic, Cedomir
    Aalborg University.
    Popovski, Petar
    Aalborg University.
    Latency-Energy Tradeoff based on Channel Scheduling and Repetitions in NB-IoT Systems2018In: 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings, Institute of Electrical and Electronics Engineers (IEEE), 2018, article id 8648024Conference paper (Refereed)
    Abstract [en]

    Narrowband Internet of Things (NB-IoT) is the latest IoT connectivity solution presented by the 3rd generation partnership project (3GPP). NB-IoT introduces coverage classes and offers a significant link budget improvement by allowing repeated transmissions by nodes that experience high path loss. However, those repetitions necessarily increase the energy consumption and the latency in the whole NB-IoT system. The extent to which the whole system is affected depends on the scheduling of the uplink and downlink channels. We address this question, not treated previously, by developing a tractable model of NB-IoT access protocol operation, comprising message exchanges in random-access, control, and data channels, both in the uplink and downlink The model is then used to analyze the impact of channel scheduling as well as the interaction of coexisting coverage classes, through derivation of the expected latency and battery lifetime for each coverage class. These results are subsequently employed in investigation of latency-energy tradeoff in NB-IoT channel scheduling as well as determining the optimized operation points. Simulations results show validity of the analysis and confirm that channel scheduling and coexistence of coverage classes significantly affect latency and battery lifetime performance of NB-IoT devices.

  • 21.
    Azari, Amin
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Popovski, Petar
    Stefanovic, Cedomir
    Cavdar, Cicek
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Grant-Free Radio Access for Cellular IoTManuscript (preprint) (Other academic)
    Abstract [en]

    Radio resource management (RRM) is a major factor affecting the delay, reliability, and energy consumption of Internet of Things (IoT) communications. This article is focused on grant-free access, a class of techniques suited to support massive IoT connectivity. Within the proposed scheme, the IoT devices transmit multiple replicas of the same packet. In addition to that, the receiver makes use of the random timing and frequency offsets in order to carry out Successive Interference Cancellation (SIC). The system performance is investigated by using a model based on stochastic geometry, leading to closed-form expressions for the key performance indicators, such as reliability and battery lifetime. The framework allows optimization of the number of replicas per device. This results in overall improvement of the energy consumption, delay and reliability, at the expense of more complex processing at the Base Station. The evaluation results indicate that the proposed data transmission and reception schemes can significantly prolong battery lifetime of IoT devices by removing the need for connection establishment and reducing the number of retransmissions. The obtained results also indicate existence of traffic-load regions, where grant-free radio access outperforms the grant-based one, which is used in LTE and NB-IoT systems. These results pave the way for enabling intelligent grant-based/free operation mode switching in 5G networks.

  • 22.
    Bai, Chumeng
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Evaluation and Improvement of Decentralized Congestion Control for Multiplatooning Application2018Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    Platooning has the potential to be a breakthrough in increasing road capacity and reducing fuel consumption, as it allows a chain of vehicles to closely follow each other on the road. When the number of vehicles increases, platoons will follow one another in what is referred to as multiplatooning. Many Cooperative Intelligent Transportation Systems (C-ITS) applications rely on periodically exchanged beacons among vehicles to improve traffic safety. However, as the number of connected vehicles increases, the network may become congested due to periodically exchanged beacons. Therefore, without some congestion control method, safety critical messages such as Cooperative Awareness Messages (CAMs) may not be delivered on time in high vehicle density scenarios. Both the European Telecommunications Standards Institute (ETSI) and the Institute of Electrical and Electronics Engineers (IEEE) have been working on different standards to support vehicular communication. ETSI dened the Decentralized Congestion Control (DCC) mechanism which adapts transmission parameters (message rate, transmit data rate, and transmit power, etc.) to keep channel load under control. ETSI DCC utilizes a three-state machine with RELAXED, ACTIVE, and RESTRICTIVE states. In this thesis, we implemented this three-state machine by adapting the message rate based on the channel busy ratio (CBR). We name this message-rate based three-state machine DCC-3. DCC-3 has the ability to control channel load; however, it has unfairness and instability problems due to the dramatic parameter changes between states. Therefore, we divided the ACTIVE state of DCC-3 into ve sub-states, and refer to this as DCC-7. We benchmarked DCC-3 against static beaconing (STB), dynamic beaconing (DynB), LInear MEssage Rate Integrated Control (LIMERIC), and DCC-7 using different evaluation metrics with different numbers of platoons. Our results from the Plexe simulator demonstrate that DCC-7 has the best performance when considering all evaluation metrics, including CBR, Inter-reception time (IRT), collisions, safe time ratio, and fairness. Furthermore, we found using transmit power control could greatly improve the performance of CBR and collision rates.

  • 23.
    Beckman, Claes
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS. KTH, School of Electrical Engineering and Computer Science (EECS), Centres, Center for Wireless Systems, Wireless@kth.
    Svar till PTS konsultation inför planerad tilldelning av frekvensutrymme i 2,3- och 3,5 GHz-banden samt tilldelning av frekvensutrymme för lokala tillstånd2019Other (Other (popular science, discussion, etc.))
    Abstract [sv]

    KTH, Skolan för elektroteknik och datavetenskap (EECS) har beretts möjlighet att ge sin syn på PTS ”Konsultation inför planerad tilldelning av frekvensutrymme i 2,3- och 3,5 GHz-banden samt tilldelning av frekvensutrymme för lokala tillstånd”, PTS DNR 18-8496.

    KTH anser att det är olyckligt att PTS frångår principen om teknikneutrala band. Vi förstår att i detta fall finns inga alternativ men råder PTS att arbeta för att framtida spektrumtilldelning sker på teknikneutral basis då inlåsning av frekvensband till specifika tekniker inte bidrar till innovation.

    TDD medger ett mer effektivt utnyttjande av spektrum i fallet då nedlänkstrafik dominerar. Denna vinst måste dock vägas mot det faktum att co-ordinering och synkronisering av och mellan operatörernas nät hämmar konkurrensen. En möjlig framtida lösning är att 3.5 bandet enbart används för nedlänk och att upplänk sker i annat band (tex 1800 bandet). 

    Slutligen så bör spektrumvillkoren vara oberoende av de nu existerande aktörerna. För att även öppna upp för flera och ev nya operatörer så föreslår vi att hela bandet 3,4 - 3,8GHz bjuds ut vid denna auktion.

  • 24.
    Beckman, Claes
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS.
    Nilsson, Mats
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS.
    Betänkande av Utredningen om radiospektrumanvändning i framtiden – Frekvenser i samhällets tjänst (SOU 2018:92)2019Other (Other (popular science, discussion, etc.))
    Abstract [sv]

    KTH, har ombetts att ge sin syn på Betänkandet enligt ovan, ert diarienummer N2019/00192/D.

    Frågeställningarna faller innanför den utbildning och forskning som bedrivs inom KTH. Skolan har under lång tid varit ett nav inom utbildning, utveckling och forskning inom radiokommunikation och även hela system för trådlösa tjänster. Ett exempel är ”Wireless@kth”, som i samarbete med industri och myndigheter bedrivit forskning inom området trådlösa system sedan 2001. Forskare inom denna konstellation har berett frågan och lämnar nedanstående yttrande.

  • 25.
    Besharat Pour, Shiva
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Li, Qi
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Connecting Silos: Automation system for thesis processing in Canvas and DiVA2018Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    As the era of digitalization dawns, the need to integrate separate silos into a synchronized connected system is becoming of ever greater significance. This thesis focuses on the Canvas Learning Management System (LMS) and the Digitala vetenskapliga arkive (DiVA) as examples of separate silos.

    The thesis presents several methods of automating document handling associated with a degree project. It exploits the fact that students will submit their thesis to their examiner via Canvas. Canvas is the LMS platform used by students to submit all their coursework. When the examiner approves the thesis, it will be archived in DiVA and optionally published on DiVA. DiVA is an institutional repository used for research publications and student theses.

    When manually archiving and publishing student theses on DiVA several fields need to be filled in. These fields provide meta data for the thesis itself. The content of these fields (author, title, keywords, abstract, …) can be used when searching via the DiVA portal. It might not seem like a massive task to enter this meta data for an individual thesis; however, given the number of theses that are submitted every year, this process takes a large amount of time and effort. Moreover, it is important to enter this data correctly, which is difficult when manually doing this task. Therefore, this thesis project seeks to automate this process for future theses.

    The proposed solution parses PDF documents and uses information from the LMS in order to automatically generate a cover for the thesis and fill in the required DiVA meta data. Additionally, information for inserting an announcement of the student's oral thesis presentation into a calendar system will be provided. Moreover, the data in each case will be checked for correctness and consistency.

    Manually filling in DiVA fields in order to publish theses has been a quite demanding and time-consuming process. Thus, there is often a delay before a thesis is published on DiVA. Therefore, this thesis project’s goal is to provide KTH with an automated means to handle thesis archiving and publication on DiVA, while doing so more efficiently, and with fewer errors. The correctness of the extracted meta data will be evaluated by comparing the results to the previously entered meta data for theses that have previously been achieved in DiVA. The automated process has been calculated to take roughly 50 seconds to prepare the information needed to publish a thesis to DiVA with ~71% accuracy, compared with 1 hour and 34% accuracy in the previous manual method.

  • 26.
    Bogdanov, Kirill
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Network Systems Laboratory (NS Lab).
    Enabling Fast and Accurate Run-Time Decisions in Geo-Distributed Systems: Better Achieving Service Level Objectives2018Doctoral thesis, monograph (Other academic)
    Abstract [en]

    Computing services are highly integrated into modern society and used  by millions of people daily. To meet these high demands, many popular  services are implemented and deployed as geo-distributed applications on  top of third-party virtualized cloud providers. However, the nature of  such a deployment leads to variable performance. To deliver high quality  of service, these systems strive to adapt to ever-changing conditions by  monitoring changes in state and making informed run-time decisions, such  as choosing server peering, replica placement, and redirection of requests. In  this dissertation, we seek to improve the quality of run-time decisions made  by geo-distributed systems. We attempt to achieve this through: (1) a better  understanding of the underlying deployment conditions, (2) systematic and  thorough testing of the decision logic implemented in these systems, and (3)  by providing a clear view of the network and system states allowing services  to make better-informed decisions.  First, we validate an application’s decision logic used in popular  storage systems by examining replica selection algorithms. We do this by  introducing GeoPerf, a tool that uses symbolic execution and modeling to  perform systematic testing of replica selection algorithms. GeoPerf was used  to test two popular storage systems and found one bug in each.  Then, using measurements across EC2, we observed persistent correlation  between network paths and network latency. Based on these observations,  we introduce EdgeVar, a tool that decouples routing and congestion based  changes in network latency. This additional information improves estimation  of latency, as well as increases the stability of network path selection.  Next, we introduce Tectonic, a tool that tracks an application’s requests  and responses both at the user and kernel levels. In combination with  EdgeVar, it decouples end-to-end request completion time into three  components of network routing, network congestion, and service time.  Finally, we demonstrate how this decoupling of request completion  time components can be leveraged in practice by developing Kurma, a  fast and accurate load balancer for geo-distributed storage systems. At  runtime, Kurma integrates network latency and service time distributions to  accurately estimate the rate of Service Level Objective (SLO) violations, for  requests redirected between geo-distributed datacenters. Using real-world  data, we demonstrate Kurma’s ability to effectively share load among  datacenters while reducing SLO violations by a factor of up to 3 in high  load settings or reducing the cost of running the service by up to 17%. The  techniques described in this dissertation are important for current and future  geo-distributed services that strive to provide the best quality of service to  customers while minimizing the cost of operating the service.  

  • 27.
    Bogdanov, Kirill
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS.
    Reda, Waleed
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS.
    Maguire Jr., Gerald Q.
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS.
    Kostic, Dejan
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS.
    Canini, M.
    Fast and accurate load balancing for geo-distributed storage systems2018In: SoCC 2018 - Proceedings of the 2018 ACM Symposium on Cloud Computing, Association for Computing Machinery (ACM), 2018, p. 386-400Conference paper (Refereed)
    Abstract [en]

    The increasing density of globally distributed datacenters reduces the network latency between neighboring datacenters and allows replicated services deployed across neighboring locations to share workload when necessary, without violating strict Service Level Objectives (SLOs). We present Kurma, a practical implementation of a fast and accurate load balancer for geo-distributed storage systems. At run-time, Kurma integrates network latency and service time distributions to accurately estimate the rate of SLO violations for requests redirected across geo-distributed datacenters. Using these estimates, Kurma solves a decentralized rate-based performance model enabling fast load balancing (in the order of seconds) while taming global SLO violations. We integrate Kurma with Cassandra, a popular storage system. Using real-world traces along with a geo-distributed deployment across Amazon EC2, we demonstrate Kurma’s ability to effectively share load among datacenters while reducing SLO violations by up to a factor of 3 in high load settings or reducing the cost of running the service by up to 17%.

  • 28.
    Bogoni, Antonella
    et al.
    Scuola Super Sant Anna, I-56127 Pisa, Italy..
    Mecozzi, Antonio
    Univ Aquila, Dept Phys & Chem Sci, I-67100 Laquila, Italy..
    Okonkwo, Chigo M.
    Eindhoven Univ Technol, NL-5612 AZ Eindhoven, Netherlands..
    Plant, David V.
    McGill Univ, Dept Elect & Comp Engn, Montreal, PQ, Canada..
    Saitoh, Kunimasa
    Hokkaido Univ, Elect Engn, Sapporo, Hokkaido 0600814, Japan.;Hokkaido Univ, Grad Sch Engn, Sapporo, Hokkaido 0600814, Japan.;Hokkaido Univ, Grad Sch Informat Sci & Technol, Sapporo, Hokkaido 0600814, Japan..
    Wosinska, Lena
    KTH, School of Engineering Sciences (SCI), Applied Physics, Photonics. KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Liu, Gordon Ning
    Huawei Technol Co Ltd, Shenzhen 518129, Peoples R China..
    Umbach, Andreas
    AUCCEPT Consulting GmbH, D-14055 Berlin, Germany..
    Charlet, Gabriel
    Huawei Paris Res Ctr, F-75002 Paris, France..
    Gaudino, Roberto
    Politecn Torino, Dipartimento Elettron & Telecomunicaz, I-10129 Turin, Italy..
    Foreword to the Special Issue on the 44th European Conference on Optical Communication (ECOC 2018)2019In: Journal of Lightwave Technology, ISSN 0733-8724, E-ISSN 1558-2213, Vol. 37, no 5, p. 1450-1455Article in journal (Other academic)
  • 29.
    Cao, Wei
    et al.
    South China Normal Univ, Ctr Opt & Electromagnet Res, South China Acad Adv Optoelect, Guangzhou, Guangdong, Peoples R China..
    Song, Wenxu
    South China Normal Univ, Ctr Opt & Electromagnet Res, South China Acad Adv Optoelect, Guangzhou, Guangdong, Peoples R China..
    Li, Xinge
    South China Normal Univ, Sch Psychol, Guangzhou, Guangdong, Peoples R China..
    Zheng, Sixiao
    Fudan Univ, Acad Engn & Technol, Shanghai, Peoples R China..
    Zhang, Ge
    Caihongqiao Children Rehabil & Serv Ctr Panyu Dis, Guangzhou, Guangdong, Peoples R China..
    Wu, Yanting
    South China Normal Univ, Sch Psychol, Guangzhou, Guangdong, Peoples R China..
    He, Sailing
    South China Normal Univ, Ctr Opt & Electromagnet Res, South China Acad Adv Optoelect, Guangzhou, Guangdong, Peoples R China..
    Zhu, Huilin
    Sun Yat Sen Univ, Child Dev & Behav Ctr, Affiliated Hosp 3, Guangzhou, Guangdong, Peoples R China..
    Chen, Jiajia
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Interaction With Social Robots: Improving Gaze Toward Face but Not Necessarily Joint Attention in Children With Autism Spectrum Disorder2019In: Frontiers in Psychology, ISSN 1664-1078, E-ISSN 1664-1078, Vol. 10, article id 1503Article in journal (Refereed)
    Abstract [en]

    It is widely recognized that robot-based interventions for autism spectrum disorders (ASD) hold promise, but the question remains as to whether social humanoid robots could facilitate joint attention performance in children with ASD. In this study, responsive joint attention was measured under two conditions in which different agents, a human and a robot, initiated joint attention via video. The participants were 15 children with ASD (mean age: 4.96 +/- 1.10 years) and 15 typically developing (TD) children (mean age: 4.53 +/- 0.90 years). In addition to analyses of fixation time and gaze transitions, a longest common subsequence approach (LCS) was employed to compare participants' eye movements to a predefined logical reference sequence. The fixation of TD toward agent's face was earlier and longer than children with ASD. Moreover, TD showed a greater number of gaze transitions between agent's face and target, and higher LCS scores than children with ASD. Both groups showed more interests in the robot's face, but the robot induced a lower proportion of fixation time on the target. Meanwhile participants showed similar gaze transitions and LCS results in both conditions, suggesting that they could follow the logic of the joint attention task induced by the robot as well as human. We have discussed the implications for the effects and applications of social humanoid robots in joint attention interventions.

  • 30.
    Cao, Yuan
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS).
    Zhao, Yongli
    Beijing Univ Posts & Telecommun, State Key Lab Informat Photon & Opt Commun, Beijing 100876, Peoples R China..
    Lin, Rui
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Yu, Xiaosong
    Beijing Univ Posts & Telecommun, State Key Lab Informat Photon & Opt Commun, Beijing 100876, Peoples R China..
    Zhang, Jie
    Beijing Univ Posts & Telecommun, State Key Lab Informat Photon & Opt Commun, Beijing 100876, Peoples R China..
    Chen, Jiajia
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Multi-tenant secret-key assignment over quantum key distribution networks2019In: Optics Express, ISSN 1094-4087, E-ISSN 1094-4087, Vol. 27, no 3, p. 2544-2561Article in journal (Refereed)
    Abstract [en]

    Quantum key distribution (QKD) networks are promising to progress towards widespread practical deployment over existing fiber infrastructures in the near future. Given the high cost and difficulty of deploying QKD networks, multi-tenancy becomes promising to improve cost efficiency for future QKD networks. In a multi-tenant QKD network, multiple QKD tenants can sham the same QKD network infrastructure to obtain secret keys for securing their data transfer. Since the secret-key resources are finite and precious in QKD networks, how to achieve efficient multi-tenant secret-key assignment (MTKA) to satisfy the secret-key demands of multiple QKD tenants over QKD networks becomes a significant problem. In this regard, this study addresses the MTKA problem over QKD networks. A new multi-tenant QKD network architecture is proposed based on software defined networking (SDN) and quantum key pool (QKP) techniques. A secret-key rate sharing scheme is presented and a heuristic algorithm is designed to implement efficient MTKA over QKD networks. A new performance metric, namely matching degree (MD) that reflects the balance between QKD network secret-key resources and QKD tenant requests, is defined and evaluated. Simulation studies indicate that high QKD tenant requests accommodation and efficient secret-key resource usage can be achieved via maximizing the value of MD. 

  • 31.
    Cavdar, Cicek
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Gera, Damini
    Airbus, Ottobrunn, Germany..
    Ghosh, Ayan
    BT, Bristol, Avon, England..
    Hofmann, Sandra
    Airbus, Ottobrunn, Germany..
    Nordlow, Anders
    Ericsson, Stockholm, Sweden..
    Schupke, Dominic
    Airbus, Ottobrunn, Germany..
    Demonstration of an Integrated 5G Network in an Aircraft Cabin Environment2018In: 2018 IEEE/AIAA 37TH DIGITAL AVIONICS SYSTEMS CONFERENCE (DASC), IEEE , 2018, p. 334-343Conference paper (Refereed)
    Abstract [en]

    The wireless communications finds many applications inside an aircraft cabin, in terms of Passenger and Crew Communications as well as Machine Type Communications (MTC). The aircraft cabin is a challenging environment and the different wireless technologies must be adequately tested and adapted to achieve maximum performance. In this regard, an aircraft environment has been analyzed in this paper for an in-cabin wireless system implementation and the measurement results have been further evaluated. This is an integrated system for the technologies of LTE, LAA and NB-IoT for the potential use-cases of Passenger Connectivity, On-Board Sensing, Cargo Tracking and Passenger Announcement. Results have then been summarized within the scope of this paper.

  • 32.
    Celik, Haris
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Feasibility and Performance of Dynamic TDD in Dense and Ultra-Dense Wireless Access Networks2019Doctoral thesis, comprehensive summary (Other academic)
    Abstract [en]

    Meeting the seemingly never-ending increase in traffic over wireless networks presents a major challenge for future mobile network design. Given that much of the traffic is expected to be more time-varying and unpredictable, time division duplexing (TDD) is gaining increasing favorability in part thanks to its ability to better accommodate network-wide traffic variations. In order to account for traffic variations in individual cells on much shorter time scales, a more flexible variant called dynamic TDD has resurfaced as a promising technique to further improve resource utilization and performance. In dynamic TDD the traffic in each cell can be served immediately in either direction, but generates same-entity interference which is potentially more harmful. To avoid the much stronger downlink from saturating the uplink, this thesis considers dynamic TDD for dense and ultra-dense networks where transmission powers in the two directions are of comparable strength. Still, inter-cell interference remains an issue given the close proximity of some links. Because of the large number of cells comprising dense and ultra-dense networks, it is imperative that the interference management be both effective and scalable, which is the main focus of this thesis.

    In the first part we focus on scalable radio resource management (RRM). We show that non-cooperative dynamic TDD is feasible for indoor ultra-dense deployment and highlight the benefit of employing beamsteering at both the base station (BS) and user equipment (UE) to mitigate interference distributively, especially at high load. Recognizing that beamsteering is better suited for higher frequencies and high data rate applications, we proceed to investigate the efficacy of receive-side interference management in the form of successive interference cancellation (SIC). Being that the interference distribution is different in dynamic TDD, we show that it suffices to cancel only strongest interferer at the UE side and the two strongest interferers at the BS. The combined benefit of SIC and dynamic TDD in reducing delay for low-rate traffic is also displayed. Next, we introduce limited inter-cell information exchange in order to leverage the resource allocation in the medium access control (MAC). To minimize the amount of information exchange and preserve scalability, a scheduling framework is proposed that relates real-time traffic to inter-BS interferences measured offline and mapped to the individual activation probability of each BS. The proposed scheme is shown to perform well with respect to comparable scalable schedulers when interference is high, and optimally when interference is low.

    In ultra-dense networks it is expected that some BSs might not have a UE to serve. In the second part, we therefore introduce cooperation to utilize the otherwise idle BSs to improve network performance. To mitigate both same- and other-entity interference, zero forcing (ZF) precoding is employed where not only downlink UEs but also uplink BSs are included in the beamforming. Results show that both uplink and downlink performance improves at low and medium load, and that it is possible to trade performance in the two directions at high load.

  • 33.
    Celik, Haris
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS).
    Sung, Ki Won
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Efficacy of Successive Interference Cancellation in Dynamic TDD Cellular NetworksManuscript (preprint) (Other academic)
  • 34.
    Celik, Haris
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS).
    Sung, Ki Won
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Success Probability of Successive Interference Cancellation in Random Wireless NetworksManuscript (preprint) (Other academic)
  • 35.
    Chang, Peiliang
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Cross-Layer Energy-Efficient Mobile Network Design2018Doctoral thesis, comprehensive summary (Other academic)
    Abstract [en]

    To assure the sustainable development of mobile networks, it is crucial to improve their energy efficiency. This thesis is devoted to the design of energy-efficient mobile networks. A cross-layer design approach is adopted. The resource management at the MAC layer, the network layer as well as the service layer are optimized to improve the energy efficiency of mobile networks. The problem of optimizing the MAC-layer resource allocation of the downlink transmission in multi-carrier NOMA systems to maximize the system energy efficiency while satisfying users’ QoS requirements is firstly considered. The optimal power allocation across sub-carriers and across users sharing one sub-carrier are proposed. Furthermore, exploiting the structure of the optimal power allocation across users sharing one sub-carrier, a sub-optimal solution for sub-carrier assignment, which greedily minimizes the required power to serve all users with required QoS, is developed. Besides optimizing the channel assignment and power allocation within a single cell, the link scheduling in the multi-cell scenario to deal with inter-cell interference is also studied. A scalable distributed link scheduling solution is proposed to orchestrate the transmission and DTX micro-sleep of multiple base stations such that both the inter-cell interference and the energy consumption are reduced. At the network layer, the operation of base station sleeping is optimized to improve the energy efficiency of mobile networks without deteriorating users’ QoS. The spectral and energy efficiency of mobile networks, where base stations are enabled with DTX, under different traffic load is firstly studied. It shows that as the networks are more loaded, the link spectral efficiency reduces while the network spectral efficiency increases. Regarding the network energy efficiency, it will either firstly increase and then decrease or always increase when the network load gets higher. The optimal network load to maximize the network energy efficiency depends on the power consumption of base stations in DTX sleep mode. Based on the findings of the above study, the joint optimization of cell DTX and deep sleep to maximize the network energy efficiency is investigated. A scaling law of transmit power, which assures that the distribution of the received power remains unchanged as more base stations are switched into deep sleep, is proposed. Then the average resource utilization and overload probability of non-deep-sleep base stations are derived. Based on these results, the feasible range of the percentage of deep-sleep base stations is obtained. Finally, the optimal percentage of deep-sleep base stations to maximize the network energy efficiency while satisfying users’ QoS requirements is derived. Lastly, the service-layer resource provision of edge computing in mobile networks is optimized to improve the energy efficiency. With this work, the trade-offs on service latency and energy consumption between the computation and the communication subsystems are studied. It is shown that the load of the communication subsystem and that of the computation subsystem should be balanced. Increasing the resource of the highly loaded subsystem can significantly reduce the required resource of the other subsystem. An algorithm is proposed to find out the optimal processing speed and the optimal number of active base stations that minimizes the overall energy consumption while assuring the requirements on the mean service latency.

  • 36.
    Chang, Peiliang
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Miao, Guowang
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Energy-Efficient Resource Allocation in Multi-Carrier NOMA SystemsManuscript (preprint) (Other academic)
    Abstract [en]

    5G cellular networks are expected to support heterogeneous services with the same level of energy dissipation as current cellular networks. As a key enabler of 5G [1], the energy efficiency performance of non-orthogonal multiple access (NOMA) is of paramount importance. In NOMA systems, the system performance, e.g., spectral efficiency and energy efficiency are largely affected by resource allocation, i.e., sub-carrier assignment and power allocation. This paper studies the joint sub-carrier assignment and power allocation for the downlink transmission of multi-carrier NOMA systems to maximize the system energy efficiency (SEE). We first formulate an energyefficiency maximization problem while assuring the connectivity requirements of all users. The original optimization problem is a mixed integer programming problem and is NP hard. In order to develop optimal solutions with low complexity, the formulated problem is decomposed into three sub-problems: sub-carrier assignment, power allocation across sub-carriers and power allocation among users sharing the same sub-carrier. Given subcarrier assignment, we first obtain the optimal power allocation among users on one sub-carrier and then the optimal power allocation across sub-carriers. To find the optimal sub-carrier assignment, a greedy search solution based on the intrinsic structure of the transmitted power is proposed to minimize the overall required power to support the connectivity requirements of all users. Numerical simulations are implemented to validate the analytical findings. The results show that our proposed algorithms achieve better system energy efficiency and lower user blocking rate than the state-of-the-art solutions in the literature.

  • 37.
    Chang, Peiliang
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Miao, Guowang
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Interference-aware Distributed Control of Cell Discontinuous Transmission2018In: 2018 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), IEEE , 2018Conference paper (Refereed)
    Abstract [en]

    As a main enabler for the next generation (5G) cellular networks, network densification faces challenges in intercell interference and energy consumption. Cell discontinuous transmission (DTX) can be employed to reduce both energy consumption of base stations (BSs) and inter-cell interference. In this paper we study the control problem of cell DTX in dense small cell networks (DSCNs). We firstly formulate the network energy efficiency optimization problem. Then a centralized heuristic DTX control algorithm is presented. In order to address the issues of complexity and scalability of the centralized solution, an interference-aware distributed DTX control algorithm is proposed. Discussions on algorithm complexity and implementation are provided. The proposed algorithms are evaluated with numerical simulations. Results show that at high load region, the proposed algorithms can not only enhance network capacity by reducing inter-cell interference by up to 60% but also increase network energy efficiency by switching BSs into micro-sleep mode by 67%.

  • 38.
    Chang, Peiliang
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Miao, Guowang
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Optimal Operation of Base Stations With Deep Sleep and Discontinuous TransmissionIn: IEEE Transactions on Vehicular Technology, ISSN 0018-9545, E-ISSN 1939-9359Article in journal (Refereed)
    Abstract [en]

    Traffic-aware base station (BS) sleeping is a promising approach to increase the energy efficiency (EE) of cellular networks. Both deep sleep and discontinuous transmission (DTX)can be applied to improve network EE. This paper studies the optimal BS operation when both deep sleep and DTX are employed. Queuing theory and stochastic geometry theory are jointly applied to model network performance considering both traffic dynamics and stochastic channel quality. We firstly propose a scaling law of transmit power that assures network coverage. Then, we characterize the resource utilization of active BSs when various percent-ages of BSs are switched into deep sleep, and analyze the overload probability of the remaining active BSs. Finally, we investigate the impact of BS deep sleep and DTX micro sleep on network EE. Both analytical and simulation results show that there is a trade-off between deep sleep and DTX micro sleep. Switching BSs into deep sleep would increase the load of the remaining active BSs and reduce their energy saving achieved with DTX. When the power consumption of BS in DTX micro-sleep mode is considerably low, switching BSs into deep sleep might increase the overall energy consumption, and it is not always the best practice to switch as many BSs into deep sleep as possible to maximize network EE.

  • 39.
    Chang, Peiliang
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Miao, Guowang
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Resource Provision for Energy-Efficient Mobile Edge Computing2018In: 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings, IEEE Communications Society, 2018, article id 8648008Conference paper (Refereed)
    Abstract [en]

    Mobile Edge Computing (a.k.a Fog computing) is recently proposed to provide computing service for delay-sensitive mobile applications. Despite various benefits, deploying edge servers in cellular networks would increase their energy consumption. In this paper, we investigate the provision of resources, including both communication and computation resources, of Mobile Edge Computing (MEC) systems to improve their energy efficiency (EE). In a MEC system, both the communication subsystem, which allows mobile users to access Internet and offload their computing tasks, and the computation subsystem, which accomplishes the offloaded computing tasks, affect the service latency and consume energy. Modelling the whole system as tandem queues, we study the trade-offs between these two subsystems on energy consumption and service latency. Based on the analysis results, we propose an algorithm to determine the optimal provision of both communication and computation resources to minimize the overall energy consumption without sacrificing the performance on service latency. Numerical results are provided to validate our analytical findings.

  • 40.
    Chen, Qiman
    et al.
    South China Normal Univ, ZJU SCNU Joint Res Ctr Photon, Guangzhou, Guangdong, Peoples R China..
    Yang, Bing
    South China Normal Univ, ZJU SCNU Joint Res Ctr Photon, Guangzhou, Guangdong, Peoples R China..
    Zhang, Dan
    South China Normal Univ, ZJU SCNU Joint Res Ctr Photon, Guangzhou, Guangdong, Peoples R China..
    Zhang, Qiong
    Fujitsu Labs Amer Inc, Richardson, TX USA..
    Chen, Jiajia
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Flexible Service Chain Mapping in Server-Centric Optical Datacenter Networks2018In: 2018 ASIA COMMUNICATIONS AND PHOTONICS CONFERENCE (ACP), IEEE , 2018Conference paper (Refereed)
    Abstract [en]

    We investigate flexible service chain mapping in server-centric optical terconnects, handling virtual network function (VNF) dependency operly. Blocking probability decreases by a factor of 10 when signing multiple VNFs in the same server is allowed.

  • 41. Chen, X.
    et al.
    Lin, R.
    Cui, J.
    Gan, L.
    Pang, Xiaodan
    KTH, School of Electrical Engineering and Computer Science (EECS).
    Ozolins, O.
    Udalcovs, A.
    Jiang, T.
    Schatz, Richard
    KTH, School of Engineering Sciences (SCI), Applied Physics, Photonics.
    Popov, Sergei
    KTH, School of Engineering Sciences (SCI), Applied Physics, Photonics.
    Chen, Jiajia
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Tang, M.
    Fu, S.
    Liu, D.
    TDHQ Enabling Fine-Granularity Adaptive Loading for SSB-DMT Systems2018In: IEEE Photonics Technology Letters, ISSN 1041-1135, E-ISSN 1941-0174, Vol. 30, no 19, p. 1687-1690, article id 8443443Article in journal (Refereed)
    Abstract [en]

    In this letter, we introduce time domain hybrid quadrature amplitude modulation (TDHQ) for the single sideband discrete multi-tone systems. The experimental results reveal that with a single precoding set and the proposed adaptive loading algorithm, the TDHQ scheme can achieve finer granularity and therefore smoother continuous growth of data rate than that with the conventional quadrature amplitude modulation. Besides, thanks to the frame construction and the tailored mapping rule, the scheme with TDHQ has an obviously better peak to an average power ratio. 

  • 42.
    Cheng, Yuxin
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Optical Interconnects for Next Generation Data Centers: Architecture Design and Resource Allocation2019Doctoral thesis, comprehensive summary (Other academic)
    Abstract [en]

    The current data center architectures based on blade servers and elec- tronic packet switches face several problems, e.g., limited resource utilization, high power consumption and cost, when handling the rapidly growing of data traffic. Optical networks offering ultra-high capacity and requiring low energy consumption are considered as a good option to address these problems. This thesis presents new data center architectures based on optical interconnects and transmissions, and evaluates performance by extensive simulations.

    The first main contribution of the thesis is to introduce a passive optical top-of-rack interconnect (POTORI) architecture. The data plane of POTORI mainly consists of passive components to interconnect the servers within the rack. Using the passive components makes it possible to significantly reduce power consumption while achieving high reliability in a cost-efficient way. In addition, the POTORI’s control plane is based on a centralized controller, which is responsible for coordinating the communications among the servers in the rack. A cycle-based medium access control (MAC) protocol and a dy- namic bandwidth allocation (DBA) algorithm are designed for the POTORI to efficiently manage the exchange of control messages and the data transmis- sion inside the rack. Simulation results show that under realistic DC traffic scenarios, the POTORI with the proposed DBA algorithm is able to achieve an average packet delay below 10 μs with the use of fast tunable optical transceivers.

    The second main contribution of the thesis is to investigate rack-scale disaggregated data center (DDC) architecture for improving resource utiliza- tion. In contrast to the traditional DC with blade servers that integrate various types of resources (e.g., central processing unit (CPU), memory) in a chassis, the rack-scale DDC contains fully decoupled resources held on differ- ent blades, referred to as resource blades. The resource blades are required to be interconnected within the rack by an ultra-high bandwidth optical in- terconnect through the optical interfaces (OIs). A resource allocation (RA) algorithm is proposed to efficiently schedule the resources in the DDC for virtual machine requests. Results show that with sufficient bandwidth on the OIs, the rack-scale DDC with the proposed RA algorithm can achieve 20% higher resource utilization and make 30% more revenue comparing to the traditional DC.

  • 43.
    Cheng, Yuxin
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    De Andrade, Marilet
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Wosinska, Lena
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Chen, Jiajia
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Resource Disaggregation versus Integrated Servers in Data Centers: Impact of Internal Transmission Capacity Limitation2018In: Proceedings 2018 European Conference on Optical Communication (ECOC), Institute of Electrical and Electronics Engineers (IEEE), 2018Conference paper (Refereed)
    Abstract [en]

    This paper shows that internal transmission capacity limitations in disaggregated data centers cannot be ignored. Insufficient capacity may reduce the inherent benefits of resource disaggregation in terms of resource utilization compared to the integrated solutions.

  • 44.
    Cheng, Yuxin
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS. KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Fiorani, Matteo
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS.
    Lin, Rui
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS.
    Wosinska, Lena
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS.
    Chen, Jiajia
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS.
    POTORI: A Passive Optical Top-of-Rack Interconnect Architecture for Data Centers2017In: Journal of Optical Communications and Networking, ISSN 1943-0620, E-ISSN 1943-0639, Vol. 9, no 5, p. 401-411Article in journal (Refereed)
    Abstract [en]

    Several optical interconnect architectures inside data centers (DCs) have been proposed to efficiently handle the rapidly growing traffic demand. However, not many works have tackled the interconnects at top-of-rack (ToR), which have a large impact on the performance of the data center networks (DCNs) and can introduce serious scalability limitations due to their high cost and power consumption. In this paper, we propose a passive optical ToR interconnect architecture (POTORI) to replace the conventional electronic packet switch (EPS) in the access tier of DCNs. In the data plane, POTORI relies on a passive optical coupler to interconnect the servers within the rack and interfaces toward the aggregation/core tiers. The POTORI control plane is based on a centralized rack controller responsible for managing the communications among the servers in the rack. We propose a cycle-based medium access control (MAC) protocol to efficiently manage the exchange of control messages and the data transmission inside the rack. We also introduce and evaluate a dynamic bandwidth allocation algorithm for POTORI, namely largest first (LF). Extensive simulation results show that, with the use of fast tunable optical transceivers, POTORI and the proposed LF strategy are able to achieve an average packet delay below 10 μs under realistic DC traffic scenarios, outperforming conventional EPSs. On the other hand, with slower tunable optical transceivers, a careful configuration of the network parameters (e.g., maximum cycle time of the MAC protocol) is necessary to obtain a good network performance in terms of the average packet delay.

  • 45.
    Cheng, Yuxin
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Lin, Rui
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    De Andrade, Marilet
    Ericsson Research, Sweden.
    Wosinska, Lena
    Department of Electrical Engineering, Chalmers University of Technology, Sweden.
    Chen, Jiajia
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Disaggregated Data Centers: Challenges and Tradeoffs2019In: IEEE Communications Magazine, ISSN 0163-6804, E-ISSN 1558-1896Article in journal (Other academic)
    Abstract [en]

    Resource utilization of modern data centers is significantly limited by the mismatch between the diversity of the resources required by running applications and the fixed amount of hardwired resources (e.g., number of central processing unit CPU cores, size of memory) in the server blades. In this regard, the concept of function disaggregation is introduced, where the integrated server blades containing all types of resources are replaced by the resource blades including only one specific function. Therefore, disaggregated data centers can offer high flexibility for resource allocation and hence their resource utilization can be largely improved. In addition, introducing function disaggregation simplifies the system upgrade, allowing for a quick adoption of new generation components in data centers. However, the communication between different resources faces severe problems in terms of latency and transmission bandwidth required. In particular,the CPU-memory interconnects in fully disaggregated data centers require ultra-low latency and ultra-high transmission bandwidth in order to prevent performance degradation for running applications. Optical fiber communication is a promising technique to offer high capacity and low latency, but it is still very challenging for the state-of-the-art optical transmission technologies to meet the requirements of the fully disaggregated data centers. In this paper, different levels of function disaggregation are investigated. For the fully disaggregated data centers, two architectural options are presented, where optical interconnects are necessary for CPU-memory communications. We review the state-of-the-art optical transmission technologies and carry out performance assessment when employing them to support function disaggregation in data centers. The results reveal that function disaggregation does improve the efficiency of resource usage in the data centers, although the bandwidth provided by the state-of-the-art optical transmission technologies is not always sufficient for the fully disaggregated data centers. It calls for research in optical transmission to fully utilize the advantages of function disaggregation in data centers.

  • 46.
    Chiaraviglio, Luca
    et al.
    Univ Roma Tor Vergata, EE Dept, Rome, Italy.;Consorzio Nazl Interuniv Telecomunicaz, Pisa, Italy..
    Amorosi, Lavinia
    Consorzio Nazl Interuniv Telecomunicaz, Pisa, Italy..
    Blefari-Melazzi, Nicola
    Univ Roma Tor Vergata, EE Dept, Rome, Italy.;Consorzio Nazl Interuniv Telecomunicaz, Pisa, Italy..
    Dell'Olmo, Paolo
    Univ Rome Sapienza, DSS Dept, Rome, Italy..
    Natalino, Carlos
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Monti, Paolo
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Optimal Design of 5G Networks in Rural Zones with UAVs, Optical Rings, Solar Panels and Batteries2018In: 2018 20TH ANNIVERSARY INTERNATIONAL CONFERENCE ON TRANSPARENT OPTICAL NETWORKS (ICTON) / [ed] Jaworski, M Marciniak, M, Institute of Electrical and Electronics Engineers (IEEE), 2018Conference paper (Refereed)
    Abstract [en]

    We focus on the problem of designing a 5G network architecture to provide coverage in rural areas. The proposed architecture is composed of 5G Base Stations carried by Unmanned Aerial Vehicles (UAVs), and supported by ground sites interconnected through optical fiber links. We also consider the dimensioning of each site in terms of the number of Solar Panels (SPs) and batteries. We then formulate the problem of cost minimization of the aforementioned architecture, by considering: i) the cost for installing the sites, ii) the costs for installing the SPs and the batteries in each site, iii) the costs for installing the optical fiber links between the installed sites, and iv) the scheduling of the UAVs to serve the rural areas. Our results, obtained over a representative scenario, reveal that the proposed solution is effective in limiting the total costs, while being able to ensure the coverage over the rural areas.

  • 47.
    Chiesa, Marco
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Network Systems Laboratory (NS Lab). Université Catholique de Louvain, Belgium.
    Demmler, D.
    Canini, M.
    Schapira, M.
    Schneider, T.
    SIXPACK: Securing internet eXchange points against curious onlookers2017In: CoNEXT 2017 - Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies, Association for Computing Machinery (ACM), 2017, p. 120-133Conference paper (Refereed)
    Abstract [en]

    Internet eXchange Points (IXPs) play an ever-growing role in Internet inter-connection. To facilitate the exchange of routes amongst their members, IXPs provide Route Server (RS) services to dispatch the routes according to each member's peering policies. Nowadays, to make use of RSes, these policies must be disclosed to the IXP. This poses fundamental questions regarding the privacy guarantees of route-computation on confidential business information. Indeed, as evidenced by interaction with IXP administrators and a survey of network operators, this state of affairs raises privacy concerns among network administrators and even deters some networks from subscribing to RS services. We design sixpack1, an RS service that leverages Secure Multi-Party Computation (SMPC) to keep peering policies confidential, while extending, the functionalities of today's RSes. As SMPC is notoriously heavy in terms of communication and computation, our design and implementation of sixpack aims at moving computation outside of the SMPC without compromising the privacy guarantees. We assess the effectiveness and scalability of our system by evaluating a prototype implementation using traces of data from one of the largest IXPs in the world. Our evaluation results indicate that sixpack can scale to support privacy-preserving route-computation, even at IXPs with many hundreds of member networks.

  • 48.
    Chiesa, Marco
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Network Systems Laboratory (NS Lab).
    Retvari, Gabor
    MTA BME Informat Syst Res Grp, H-1521 Budapest, Hungary..
    Schapira, Michael
    Hebrew Univ Jerusalem, IL-9190401 Jerusalem, Israel..
    Oblivious Routing in IP Networks2018In: IEEE/ACM Transactions on Networking, ISSN 1063-6692, E-ISSN 1558-2566, Vol. 26, no 3, p. 1292-1305Article in journal (Refereed)
    Abstract [en]

    To optimize the flow of traffic in IP networks, operators do traffic engineering (TE), i.e., tune routing-protocol parameters in response to traffic demands. TE in IP networks typically involves configuring static link weights and splitting traffic between the resulting shortest-paths via the equal-cost-multipath (ECMP) mechanism. Unfortunately, ECMP is a notoriously cumbersome and indirect means for optimizing traffic flow, often leading to poor network performance. Also, obtaining accurate knowledge of traffic demands as the input to TE is a non-trivial task that may require additional monitoring infrastructure, and traffic conditions can be highly variable, further complicating TE. We leverage recently proposed schemes for increasing ECMP's expressiveness via carefully disseminated bogus information (lies) to design COYOTE, a readily deployable TE scheme for robust and efficient network utilization. COYOTE leverages new algorithmic ideas to configure (static) traffic splitting ratios that are optimized with respect to all (even adversarial) traffic scenarios within the operator's "uncertainty bounds". Our experimental analyses show that COYOTE significantly outperforms today's prevalent TE schemes in a manner that is robust to traffic uncertainty and variation. We discuss experiments with a prototype implementation of COYOTE.

  • 49.
    da Silva, Carlos Natalino
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Chiaraviglio, Luca
    Idzikowski, Filip
    Wosinska, Lena
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Monti, Paolo
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS, Optical Network Laboratory (ON Lab).
    Joint Optimization of Failure Management Costs, Electricity Costs, and Operator Revenue in Optical Core Networks2017In: IEEE Transactions on Green Communications and Networking, ISSN 2473-2400, Vol. PP, no 99Article in journal (Refereed)
    Abstract [en]

    We focus on the problem of maximizing profitability in an optical core network by acting on the power states of Optical Line Amplifiers (OLAs) and Line Cards (LCs) operating under varying traffic. Specifically, the profitability metric considered in this work takes into account the electricity costs of OLAs and LCs, the failure management costs derived from the application of power states to the network devices, and the operator revenue. After proving that all terms of the considered profitability function are deeply inter-correlated, we formulate the optimization problem of maximizing the network profitability in an optical core network with multi-period traffic. By solving the proposed formulation on a realistic scenario, we show that it is possible to wisely trade between the considered costs and revenue, and achieve higher network profitability than in the case in which the single terms are considered in isolation, e.g., only electricity consumption or only Failure Management Costs (FMC).

  • 50. Dethise, A.
    et al.
    Chiesa, Marco
    KTH, School of Electrical Engineering and Computer Science (EECS), Communication Systems, CoS.
    Canini, M.
    Prelude: Ensuring inter-domain loop-freedom in SDN-enabled networks2018In: ACM International Conference Proceeding Series, Association for Computing Machinery , 2018, p. 50-56Conference paper (Refereed)
    Abstract [en]

    Software-Defined eXchanges (SDXes) promise to improve the interdomain routing ecosystem through SDN deployment. Yet, the nave deployment of SDN on the Internet raises concerns about the correctness of the interdomain data-plane. By allowing operators to deflect traffic from default BGP routes, SDN policies can create permanent forwarding loops that are not visible to the control-plane. We propose Prelude, a system for detecting SDN-induced forwarding loops between SDXes with high accuracy without leaking private routing information of network operators. To achieve this, we leverage Secure Multi-Party Computation (SMPC) techniques to build a novel and general privacy-preserving primitive that detects whether any subset of SDN rules might affect the same portion of traffic without learning anything about those rules. We then leverage this primitive as the main building block of a distributed system tailored to detect forwarding loops among any set of SDXes. We leverage the particular nature of SDXes to further improve the efficiency of our SMPC solution. The number of valid SDN rules rejected by our solution is 100x lower than previous privacy-preserving solutions, and provides better privacy guarantees. Furthermore, our solution naturally provides network operators with some insights on the cost of the deflected paths.

12345 1 - 50 of 217
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf