Change search
Refine search result
1234567 151 - 200 of 1873
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)
  • 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)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the 'Create feeds' function.
  • 151. Berger, Andre
    et al.
    Gross, James
    RWTH Aachen University, Germany.
    Harks, Tobias
    The k–Constrained Bipartite Matching Problem: Approximation Algorithms and Applications to Wireless Networks2010In: Proceedings IEEE INFOCOM, 2010, IEEE conference proceedings, 2010, 1-9 p.Conference paper (Refereed)
    Abstract [en]

    In communication networks, resource assignment problems appear in several different settings. These problems are often modeled by a maximum weight matching problem in bipartite graphs and efficient matching algorithms are well known. In several applications, the corresponding matching problem has to be solved many times in a row as the underlying system operates in a time-slotted fashion and the edge weights change over time. However, changing the assignments can come with a certain cost for reconfiguration that depends on the number of changed edges between subsequent assignments. In order to control the cost of reconfiguration, we propose the k-constrained bipartite matching problem for bipartite graphs, which seeks an optimal matching that realizes at most k changes from a previous matching. We provide fast approximation algorithms with provable guarantees for this problem. Furthermore, to cope with the sequential nature of assignment problems, we introduce an online variant of the k-constrained matching problem and derive online algorithms that are based on our approximation algorithms for the k-constrained bipartite matching problem. Finally, we establish the applicability of our model and our algorithms in the context of OFDMA wireless networks finding a significant performance improvement for the proposed algorithms.

  • 152.
    Berggren, Anders
    et al.
    KTH, School of Information and Communication Technology (ICT), Microelectronics and Information Technology, IMIT.
    Borg, Martin
    KTH, School of Information and Communication Technology (ICT), Microelectronics and Information Technology, IMIT.
    A Comparative Study ofTwo Multicast Routing Algorithms2002Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    This Master Thesis examines several aspects of two different multicast forwarding algorithms. The scaling properties of the currently used algorithms were examined under different criteria, such as delay, traffic concentration, and size of the routing tables.

    Many new Internet applications, such as videoconferencing, resource discovery, Internet radio and online games, depend on a network support for efficient point-to-multipoint communication. Sending identical data to a group of receivers using a series of unicast transmissions obviously has massive scaling problems. Multicasting provides an efficient and elegant solution that significantly reduces the total bandwidth demand as well as the load on both senders and intermediate routers.

    In this report we study two multicast routing algorithms, source based trees (SBT) and core based trees (CBT). SBT builds one delivery tree per source and group by flooding the initial packet through the entire network, and then removing the links that do not lead to group members (“pruning”). To be able to discover new members, flooding must occur periodically. CBT on the other hand, builds one delivery tree per group, shared by all sources. There is one core router per group and members must explicitly join the delivery tree by notifying the core. Off-tree sources must tunnel their traffic to the core for distribution along the tree.

    SBT has two main drawbacks. Firstly, the maintenance of the delivery tree requires periodic flooding of the network. Furthermore, SBT routers must keep state that grows as the product of the number of sources and the number of groups. CBT solves both of these scaling problems, but the shared tree will often lead to sub-optimal paths and increased delay. The traffic may also be concentrated on fewer links than in SBT.

    We compared the characteristics of the SBT and CBT algorithms in different network topologies using a simulation program. Since existing network simulation tools were found to be poor when it came to multicasting, we decided to develop a new network generator and simulator tool with multicasting aspects in focus. We also developed a tool to visualize the networks generated by the simulator and monitor the traffic. The report presents many simulation results that illustrate the significance of different trade-offs between SBT and CBT. Performance characteristics such as delay, join latency, tree size, total traffic and traffic concentration are analysed and examined.

    The conclusion is that each protocol can be preferable in certain scenarios, depending on how important the different parameters are. CBT always performs better than SBT for single source applications if the core can be placed at the sender’s local router. However, this core placement is not necessarily optimal for CBT. The situation is more complex in groups with several sources. There is a trade-off between the scaling problems of SBT and the increased delay and traffic concentration of CBT.

  • 153.
    Berggren, Fredrik
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Communication Systems, CoS (closed 2012-01-01).
    Capacity analysis for noncooperative interference environments2005In: VTC 2005-Spring: 2005 IEEE 61st Vehicular Technology Conference, Proceedings, IEEE , 2005, no 3, 1479-1483 p.Conference paper (Refereed)
    Abstract [en]

    To enhance the wireless bandwidth utilization, new forms of innovative spectrum policies, dynamically sharing channels over time and space, have been discussed. Dynamic spectrum access lets systems share the spectrum, to achieve better band-width utilization and trunking gains. In this work, we consider a case where such access is performed in an uncoordinated fashion. The paradigm shift to open frequency bands implies a need to investigate and verify resulting capacity gains. Herein, we give a general method for evaluating system capacity subject to outage probability constraints over fading channels, in an unlicensed band environment with uncoordinated systems. The channel fading effects include both attenuation, shadowing and multipath propagation and we end up with expressions, which are solved by numerical integration. The spectrum sharing is here performed by means of autonomous dynamic channel allocation (DCA), and we compare two DCA methods, maximum SIR DCA and random DCA.

  • 154.
    Bergman, Svante
    et al.
    KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Ottersten, Björn
    KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Lattice based linear precoding for MIMO block codes2007In: 2007 IEEE International Conference on Acoustics, Speech, and Signal Processing, IEEE , 2007, 329-332 p.Conference paper (Refereed)
    Abstract [en]

    Herein, the design of linear dispersion codes for block based multiple-input multiple-output communication systems is investigated. The receiver as well as the transmitter are assumed to have perfect knowledge of the channel, and the receiver is assumed to employ maximum likelihood detection. We propose to use linear precoding and lattice invariant operations to transform the channel matrix into a lattice with large coding gain. With appropriate approximations, it is shown that this corresponds to selecting lattices with good sphere packing properties. Lattice invariant transformations are then used to minimize the power consumption. An algorithm for this power minimization is presented along with a lower bound on the optimization. Numerical results indicate that there is a potential gain of several dB by using the method compared to channel inversion with adaptive bit loading.

  • 155.
    Bergman, Svante
    et al.
    KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Ottersten, Björn
    KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Lattice-based linear precoding for MIMO channels with transmitter CSI2008In: IEEE Transactions on Signal Processing, ISSN 1053-587X, E-ISSN 1941-0476, Vol. 56, no 7, 2902-2914 p.Article in journal (Refereed)
    Abstract [en]

    Herein, the design of linear dispersion codes for multiple-input multiple-output communication systems is investigated. The receiver as well as the transmitter are assumed to have perfect knowledge of the channel, and the receiver is assumed to employ maximum likelihood detection. We propose to use linear precoding and lattice invariant operations to transform the channel matrix into a lattice generator matrix with large minimum distance separation. With appropriate approximations, it is shown that this corresponds to selecting lattices with good sphere-packing properties. Lattice invariant transformations are then used to minimize the power consumption. An algorithm for this power minimization is presented along with a lower bound on the optimization. Numerical results indicate significant gains by using the proposed method compared to channel diagonalization with adaptive bit loading.

  • 156.
    Bergman, Svante
    et al.
    KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Palomar, Daniel P.
    Department of Electronic and Computer Engineering, Hong Kong University of Science and Technology.
    Ottersten, Björn
    KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Joint Bit Allocation and Precoding for MIMO Systems With Decision Feedback Detection2009In: IEEE Transactions on Signal Processing, ISSN 1053-587X, E-ISSN 1941-0476, Vol. 57, no 11, 4509-4521 p.Article in journal (Refereed)
    Abstract [en]

    This paper considers the joint design of bit loading, precoding and receive filters for a multiple-input multiple-output (MIMO) digital communication system employing decision feedback (DF) detection at the receiver. Both the transmitter as well as the receiver are assumed to know the channel matrix perfectly. It is well known that, for linear MIMO transceivers, a diagonal transmission (i.e., orthogonalization of the channel matrix) is optimal for some criteria. Surprisingly, it was shown five years ago that for the family of Schur-convex functions an additional rotation of the symbols is necessary. However, if the bit loading is optimized jointly with the linear transceiver, then this rotation is unnecessary. Similarly, for DF MIMO optimized transceivers a rotation of the symbols is sometimes needed. The main result of this paper shows that for a DF MIMO transceiver where the bit loading is jointly optimized with the transceiver filters, the rotation of the symbols becomes unnecessary, and because of this, also the DF part of the receiver is not required. The proof is based on a relaxation of the available bit rates on the individual substreams to the set of positive real numbers. In practice, the signal constellations are discrete and the optimal relaxed bit loading has to be rounded. It is shown that the loss due to rounding is small, and an upper bound on the maximum loss is derived. Numerical results are presented that confirm the theoretical results and demonstrate that orthogonal transmission and the truly optimal DF design perform almost equally well.

  • 157.
    Bergqvist, Joakim
    KTH, Superseded Departments, Teleinformatics.
    Dynamic modeling of real-time data sources1996Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    This thesis reports on the development and implementation of a method for dynamically generating a state model from the prerecorded trace of a cell-arrival process and the user of this state machine to drive a simulator to evaluate the effects of multiplexing multiple copies of traffic similar to the original trace.

  • 158.
    Bhatia, Nupur
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS.
    Policy Management in Context-Aware Networks2007Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    The Ambient Network (AN) Project is part of the European Commission’s 6th Framework Programme and aims to enable cooperation between heterogeneous networks, using current and future wireless technologies, minimising the effort of mobile users to gain access to the services that they are interested in - irrespective of their location or the network they are currently using. Because of the highly mobile nature of users and a demand for instant and dynamic access to services, these networks have to be composed ‘on the fly’ without any pre-configurations.

    The use of context information in AN can remove the need for pre-configuration of networks, hence making them autonomic. However, a concern exists that the free and uncontrolled dissemination of context information could breech the privacy of the participants. It is extremely important to address these privacy issues in order to control who has access to what context information. This control can be achieved through the use of well defined policies. This creates a requirement for a framework in the ContextWare architecture for protecting context information.

    This masters thesis project is part of an effort to create a policy based infrastructure for authorisation of access to network context information within the AN. The thesis investigates, models, and designs an architecture for a policy management system based on OASIS XACML, that creates an extension to the architecture for management of context information in the AN. In addition to a policy management architecture within an AN, a policy management architecture for composing ANs is also created. To facilitate the transfer of requests and policies, the thesis creates a Policy Management Protocol. The designed architecture was then implemented to create a proof of concept.

    The designed architecture and protocol were evaluated by running tests on the prototype. The measurements from the tests are analysed and presented in this thesis. The analysis of the experimental data indicates that a policy management system is both feasible and practical. The results show that the delay overhead caused by introducing policy management in a distributed context provisioning system, ranges from 1.7% in a system without load to 6% in a worst case scenario. The throughput of the policy management system is 15 requests per second under load.

  • 159.
    Bilien, Johan
    KTH, School of Information and Communication Technology (ICT), Microelectronics and Information Technology, IMIT.
    Key Agreement for Secure Voice over IP2003Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    This thesis reviews the usual properties and requirements for key agreement protocols. It then focuses on MIKEY, a work-in-progress protocol designed to conduct key agreements for secure multimedia exchanges. The protocol was implemented and incorporated in a SIP user agent - minisip. This implementation was used to measure the additional delay required for key exchange during call establishment. Finally, some schemes are proposed regarding the use of MIKEY in advanced VoIP scenarios, such as conferences and terminal mobility.

  • 160.
    Bin, Yang
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Using Six Sigma Methodology to improve the performance of the Shipment Test2015Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    Competition and lead-time pressure motivates us to find new and better ways of continuously improving the output of our work. The emphasis on improvement in both efficiency and quality has become more and more significant in daily activities. The performance of Ericsson’s AXE/APZ products during shipment test phase is one such activity and is the focus of this thesis project. One of the essential principles of shipment testing is to ensure that the test campaigns finish on time. Over the last several decades companies have spent large amounts of time and money on improving test quality and efficiency. Unfortunately, the results have not always been as good as expected. It seems that it is very difficult to improve shipment testing performance using traditional test management methods.

    Motorola introduced Six Sigma in 1986 and achieved 5.4 Sigma level which help them saved 2.2 Billion dollars during the first six years. From Statistic aspect, it means only 3.4 defects per million opportunities. The Six Sigma methodology has been applied as a management philosophy focused on improving efficiency and performance during the shipment test period.

    This thesis gives an introduction to the Six Sigma approach, including the concepts of Six Sigma, its history, development, and methodology. More specifically the author uses the Define, Measure, Analyze, Improve, and Control (DMAIC) approach to evaluate the performance of Ericsson’s AXE/APZ Shipment Testing. This project goal was defined: Compare with the performance of 08AXE shipment test which 87% of test campaigns (2.68 sigma level) were finished on time, 3 sigma level in 09AXE shipment test which means 93%of the test campaigns will be finished on time has to be achieved.  The thesis measured the 08AXE shipment test performance and analyzed the lead time of test campaigns, found the root causes such as poor documents quality from the legacy project, lack of test resources, no system impact analysis. The thesis also provided a set of proposals for improvements and control of the improved process in order to ensure sustainable improved performance results. Finally 93% test campaigns were finished on time in 09AXE and project goal was fulfilled.

  • 161.
    Björklund, Ulf
    KTH, Superseded Departments, Teleinformatics.
    Understanding the Performance of the Linux IPv6 Implementation1998Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    The new version of the Internet protocol, IP version 6, will eventually replace the current version IP version 4. Before that change can take place the different implementations of IPv6 must be able to perform at least as well as their predecessors, The implementation that is considered here is that of the Linux operating system. All measurements considers native IPv6, e.g. no tunneling in IPv4 packets.

    A small network of two computers was set up on which the performance tests were performed. Throughput and response times were measured on both Ethernet and Fast Ethernet. The conclusions are that IPv6 performs almost as well as IPv4 in both cases. IPv4's slight advantage is due to the fact that it has less overhead on the network since the header is smaller.

    Later a connection to the 6bone is setup. It is run on an ATM network. The performance across that network is also tested.

  • 162.
    Björkman, Anders
    KTH, Superseded Departments, Teleinformatics.
    Configuration of IPv4 Hosts in Zero-Configuration Networks2000Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    Zero-configuration networks are networks that require no/zero manual configuration or administration to operate. The essence of a zero-configuration network is that it can be used without having to think about the network at all. The most basic zero-configuration network just provides network communication but more advanced services can be provided as long as no configuration is needed. An important area of use is networks for homes and small businesses. Many of the devices that we have in our homes are or will in a near future be ‘networked’ i.e. capable of network communication. Examples are computers and computer equipment such as printers and scanners, the next generation home-appliances such as the refrigerator and the washing machine, the TV, the stereo, climate sensors etc. etc. The main driving forces for this development are the need for resource sharing e.g. of printers or Internet access, home automation and devices, applications or services that use network communication. Networks for the home must be ‘automatic’ because the average person today has problems programming his VCR and cannot be expected to configure or administrate his/her home-network. Today’s solutions are insufficient because they require manual configuration and some technical knowledge. The market potential is enormous. Almost all homes and most small businesses lack a network infrastructure and many will in a near future acquire it.

    In this thesis I discuss the need and areas of use for zero-configuration networks and I look at how to configure IP hosts in general. Solutions on configuration of hosts in zero-configuration networks are discussed and I propose a solution for IPv4 hosts that enables link-local communication, the most basic type of network communication using IP.

    This master’s thesis was carried out at Ericsson Research in Kista during the fall of 1999 and spring of 2000.

  • 163.
    Björnson, Emil
    et al.
    KTH, School of Electrical Engineering (EES), Signal Processing. Dept. of Electrical Engineering, Linkoping University, Sweden.
    Bengtsson, Mats
    KTH, School of Electrical Engineering (EES), Signal Processing.
    Ottersten, Björn
    KTH, School of Electrical Engineering (EES), Signal Processing.
    Optimal Multiuser Transmit Beamforming: A Difficult Problem with a Simple Solution Structure2014In: IEEE signal processing magazine (Print), ISSN 1053-5888, E-ISSN 1558-0792, Vol. 31, no 4, 142-148 p.Article in journal (Refereed)
    Abstract [en]

    Transmit beamforming is a versatile technique for signal transmission from an array of antennas to one or multiple users [1]. In wireless communications, the goal is to increase the signal power at the intended user and reduce interference to nonintended users. A high signal power is achieved by transmitting the same data signal from all antennas but with different amplitudes and phases, such that the signal components add coherently at the user. Low interference is accomplished by making the signal components add destructively at nonintended users. This corresponds mathematically to designing beamforming vectors (that describe the amplitudes and phases) to have large inner products with the vectors describing the intended channels and small inner products with nonintended user channels.

  • 164.
    Björnson, Emil
    et al.
    KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Jorswieck, Eduard
    Dresden University of Technology, Communications Theory, Communications Laboratory, Dresden, Germany.
    Optimal Resource Allocation in Coordinated Multi-Cell Systems2013Book (Refereed)
    Abstract [en]

    The use of multiple antennas at base stations is a key component in the design of cellular communication systems that can meet high-capacity demands in the downlink. Under ideal conditions, the gain of employing multiple antennas is well-recognized: the data throughput increases linearly with the number of transmit antennas if the spatial dimension is utilized to serve many users in parallel. The practical performance of multi-cell systems is, however, limited by a variety of nonidealities, such as insufficient channel knowledge, high computational complexity, heterogeneous user conditions, limited backhaul capacity, transceiver impairments, and the constrained level of coordination between base stations.

    This tutorial presents a general framework for modeling different multi-cell scenarios, including clustered joint transmission, coordinated beamforming, interference channels, cognitive radio, and spectrum sharing between operators. The framework enables joint analysis and insights that are both scenario independent and dependent.

    The performance of multi-cell systems depends on the resource allocation; that is, how the time, power, frequency, and spatial resources are divided among users. A comprehensive characterization of resource allocation problem categories is provided, along with the signal processing algorithms that solve them. The inherent difficulties are revealed: (a) the overwhelming spatial degrees-of-freedom created by the multitude of transmit antennas; and (b) the fundamental tradeoff between maximizing aggregate system throughput and maintaining user fairness. The tutorial provides a pragmatic foundation for resource allocation where the system utility metric can be selected to achieve practical feasibility. The structure of optimal resource allocation is also derived, in terms of beamforming parameterizations and optimal operating points.

    This tutorial provides a solid ground and understanding for optimization of practical multi-cell systems, including the impact of the nonidealities mentioned above. The Matlab code is available online for some of the examples and algorithms in this tutorial.

    Note: The supplementary Matlab Code is available at http://dx.doi.org/10.1561/0100000069_supp

  • 165.
    Björnson, Emil
    et al.
    KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. Alcatel-Lucent Chair on Flexible Radio, Supélec, France.
    Jorswieck, Eduard
    Dresden University of Technology, Communications Theory, Communications Laboratory, Dresden, Germany.
    Optimal Resource Allocation in Coordinated Multi-Cell Systems: Matlab Code2013Report (Other academic)
    Abstract [en]

    This is the documentation of the Matlab code supplement to the monograph "Optimal Resource Allocation in Coordinated Multi-Cell Systems" by Emil Björnson and Eduard Jorswieck; see [1] for the full publication details.

    This documentation is distributed along with the code package mentioned above. The package contains Matlab implementations of many of the algorithms described in [1]. The use of these algorithms is exemplified by Matlab scripts (m-files) that generate some of the figures shown in the monograph. The algorithms are briefly described in Section 5 and the selected example figures are described and shown in Section 6. Please note that the all channel vectors are generated randomly as Rayleigh fading in these examples, thus this code package is not able to reproduce exactly the same curves as was shown in the monograph.

  • 166.
    Blank, Bruno
    et al.
    KTH, Superseded Departments, Teleinformatics.
    Häggström, Mattias
    KTH, Superseded Departments, Teleinformatics.
    Mobile Communication In a Multiple Device Environment1998Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    It is nowadays common that users have more than one computer. At the office, a stationary computer or possibly a laptop is used. When travelling, a Personal Digital Assistant is better suited for e-mail, address book, and scheduling. Probably the user also has an advanced mobile phone. A problem for many users is it has traditionally been quite complex to handle having multiple computers, since the support for mobile use has been insufficient.

    We have looked into common scenarios for mobile users and given and overview of related products and technologies. Some of the traditional protocols for e-mail have been reviewed. We have listed problems with those and suggested improvements. Sendit has a proprietary protocol, which we have compared to traditional protocols.

    This report gives an overview from the user’s point of view. From what we have seen, there are lots of upcoming technologies and solutions to assist mobile users. However, many problems still remain and need to be solved to facilitate the mobile user’s situation.

  • 167.
    Blomberg, Patrik
    KTH, Superseded Departments, Teleinformatics.
    Construction and Implementation of a Walkstation Mobile-distributed File System Testbed1995Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    In this Master's Thesis an investigation, design and implementation of an object-oriented prototype of a new kind of client-agent-server based distributed file system, suited for wireless mobile computing, are presented. An overview is given of the characteristics and the inherent problems of mobile-wireless computing. Some solutions and techniques to reduce the effects of these problems are described. A presentation of a project (the Walkstation project) that tries to solve these problems is also given. Software to support a mobile-distributed file system is designed and implemented. Various software development techniques and mobile file system design solutions are proposed, and used in the implementation. An integrated caching and prefetching scheme with dynamically loadable cache and prefetch manager objects is designed and implemented. It is proposed that different cache and prefetch algorithms should be used for different kinds of network links. A cache/prefetch-manager object architecture with automatically location-dependant dynamical swapping of network specific manager objects at run-time is therefore proposed and implemented. A mechanism is designed with which an application optionally can be mobility-aware by subscribing for network-change events. Finally, an expedient example of a methodology to achieve easy-understandable and well-designed code, and good extensibility possibilities is explained and used in the development. This is done by utilizing an object-oriented software development methodology in the entire software development cycle.

  • 168. Boccardi, Federico
    et al.
    Andrews, Jeffrey
    Elshaer, Hisham
    Dohler, Mischa
    Parkvall, Stefan
    KTH, School of Electrical Engineering (EES), Communication Theory. Univ Calif San Diego, San Diego.
    Popovski, Petar
    Singh, Sarabjot
    Why to Decouple the Uplink and Downlink in Cellular Networks and How To Do It2016In: IEEE Communications Magazine, ISSN 0163-6804, E-ISSN 1558-1896, Vol. 54, no 3, 110-117 p.Article in journal (Refereed)
    Abstract [en]

    Ever since the inception of mobile telephony, the downlink and uplink of cellular networks have been coupled, that is, mobile terminals have been constrained to associate with the same base station in both the downlink and uplink directions. New trends in network densification and mobile data usage increase the drawbacks of this constraint, and suggest that it should be revisited. In this article we identify and explain five key arguments in favor of downlink/uplink decoupling based on a blend of theoretical, experimental, and architectural insights. We then overview the changes needed in current LTE-A mobile systems to enable this decoupling, and then look ahead to fifth generation cellular standards. We demonstrate that decoupling can lead to significant gains in network throughput, outage, and power consumption at a much lower cost compared to other solutions that provide comparable or lower gains.

  • 169.
    Bodinger, Ronnie
    KTH, Superseded Departments, Teleinformatics.
    An MPLS Connection Manager for an Edge Router1998Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    The Internet has been growing rapidly over the last couple of years. The increasing demand for network bandwidth is becoming a huge problem. To solve this problem, new methods must be developed. Ericsson’s solution is the use of MultiProtocol Label Switching (MPLS). MPLS has the potential to have a major impact on IP networking. It has the simplicity and dynamic nature of an IP network, but retains the performance of an ATM network. Furthermore, from an administrator’s point of view, MPLS will drastically simplify network management.

    The key principle behind MPLS is to be able to forward by switching packets through a network instead of routing packets. In order to do this, paths are established at the data link layer throughout the MPLS network. A fixed length identifier known as “label” identifies each path. Then the packets are simply forwarded on the path using layer two switching, instead of performing layer three routing.

    By using MPLS, performance is increased and it provides a good basis for traffic engineering, Quality of Service (QoS) guarantees, and Virtual Private Networks (VPN).

    I have implemented an MPLS ATM driver for an Ericsson AXI 510 Edge Router. The driver is responsible for converting generic MPLS labels into standard ATM labels (VPI/VCI). The driver also modifies the forwarding process in the router so that ATM paths are used to forward the packets, instead of the conventional forwarding methods. This implementation has been partly tested and it complies with MPLS current Internet drafts so far.

  • 170.
    Bogdanov, Kirill
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Network Systems Laboratory (NS Lab).
    Latency Dataset for the paper "The Nearest Replica Can Be Farther Than You Think"2015Data set
  • 171.
    Bogdanov, Kirill
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Network Systems Laboratory (NS Lab).
    Reducing Long Tail Latencies in Geo-Distributed Systems2016Licentiate thesis, monograph (Other academic)
    Abstract [en]

    Computing services are highly integrated into modern society. Millions of people rely on these services daily for communication, coordination, trading, and accessing to information. To meet 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 deployment provides variable performance characteristics. To deliver high quality of service, such systems strive to adapt to ever-changing conditions by monitoring changes in state and making run-time decisions, such as choosing server peering, replica placement, and quorum selection.

    In this thesis, 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 into the network and system states which allows these services to perform better-informed decisions.

    We performed a long-term cross datacenter latency measurement of the Amazon EC2 cloud provider. We used this data to quantify the variability of network conditions and demonstrated its impact on the performance of the systems deployed on top of this cloud provider.

    Next, we validate an application’s decision logic used in popular storage systems by examining replica selection algorithms. We introduce GeoPerf, a tool that uses symbolic execution and lightweight modeling to perform systematic testing of replica selection algorithms. We applied GeoPerf to test two popular storage systems and we found one bug in each.

    Then, using traceroute and one-way delay measurements across EC2, we demonstrated persistent correlation between network paths and network latency. We introduce EdgeVar, a tool that decouples routing and congestion based changes in network latency. By providing this additional information, we improved the quality of latency estimation, as well as increased the stability of network path selection.

    Finally, 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 provides a complete view of the delays associated with each processing stage of a request and response. Using Tectonic, we analyzed the impact of sharing CPUs in a virtualized environment and can infer the hypervisor’s scheduling policies. We argue for the importance of knowing these policies and propose to use them in applications’ decision making process.

  • 172.
    Bogdanov, Kirill
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Network Systems Laboratory (NS Lab).
    Peón-Quirós, Miguel
    Complutense University of Madrid.
    Maguire Jr., Gerald Q.
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Kostic, Dejan
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Network Systems Laboratory (NS Lab).
    The Nearest Replica Can Be Farther Than You Think2015In: Proceedings of the ACM Symposium on Cloud Computing 2015, Association for Computing Machinery (ACM), 2015, 16-29 p.Conference paper (Refereed)
    Abstract [en]

    Modern distributed systems are geo-distributed for reasons of increased performance, reliability, and survivability. At the heart of many such systems, e.g., the widely used Cassandra and MongoDB data stores, is an algorithm for choosing a closest set of replicas to service a client request. Suboptimal replica choices due to dynamically changing network conditions result in reduced performance as a result of increased response latency. We present GeoPerf, a tool that tries to automate the process of systematically testing the performance of replica selection algorithms for geodistributed storage systems. Our key idea is to combine symbolic execution and lightweight modeling to generate a set of inputs that can expose weaknesses in replica selection. As part of our evaluation, we analyzed network round trip times between geographically distributed Amazon EC2 regions, and showed a significant number of daily changes in nearestK replica orders. We tested Cassandra and MongoDB using our tool, and found bugs in each of these systems. Finally, we use our collected Amazon EC2 latency traces to quantify the time lost due to these bugs. For example due to the bug in Cassandra, the median wasted time for 10% of all requests is above 50 ms.

  • 173.
    Bogdanov, Kirill
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Network Systems Laboratory (NS Lab).
    Peón-Quirós, Miguel
    Complutense University of Madrid.
    Maguire Jr., Gerald Q.
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Radio Systems Laboratory (RS Lab).
    Kostić, Dejan
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Network Systems Laboratory (NS Lab).
    Toward Automated Testing of Geo-Distributed Replica Selection Algorithms2015In: Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication, Association for Computing Machinery (ACM), 2015, 89-90 p.Conference paper (Refereed)
    Abstract [en]

    Many geo-distributed systems rely on a replica selection algorithms to communicate with the closest set of replicas.  Unfortunately, the bursty nature of the Internet traffic and ever changing network conditions present a problem in identifying the best choices of replicas. Suboptimal replica choices result in increased response latency and reduced system performance. In this work we present GeoPerf, a tool that tries to automate testing of geo-distributed replica selection algorithms. We used GeoPerf to test Cassandra and MongoDB, two popular data stores, and found bugs in each of these systems.

  • 174. Bohge, Mathias
    et al.
    Gross, James
    Wolisz, Mathias
    Optimal Power Masking in Soft Frequency Reuse based OFDMA Networks2009Conference paper (Refereed)
    Abstract [en]

    Soft frequency reuse is a strong tool for co-channel interference mitigation in cellular OFDMAILTE networks. The performance of such networks significantly depends on the configuration of the power masks that implement the soft frequency reuse patterns. In this paper, we investigate the performance of different power mask configurations against the optimal case, in which a central entity optimally distributes power and resource blocks among the users of the network. It is shown that large differences exist between the performance of different mask types and the optimal case in both, the overall cell throughput, as well as the cell-edge user performance.

  • 175.
    Bohge, Mathias
    et al.
    TU Berlin.
    Naghibi, Farshad
    TU Berlin.
    Wolisz, Adam
    TU Berlin.
    The use of guard bands to mitigate multiple access interference in the OFDMA uplink2008In: Proceedings of the 13th International OFDM-Workshop (InOWo),, 2008, 75-79 p.Conference paper (Refereed)
    Abstract [en]

    The usual approach to mitigate multiple access interference (MAI) in the uplink of cellular OFDMA based systems is to use relatively large cyclic prefixes as time domain guard periods. In this paper, we suggest to use a combination of short time domain guard periods and frequency domain guard bands to protect against MAI instead. Guard bands can be added and removed as necessary and, thus, increase the MAI protection flexibility. We show that, if optimally applied, the use of guard bands can significantly increase the system’s uplink capacity or minimum capacity per user.

  • 176.
    Borges Vieira, Alex
    et al.
    Universidade Federal de Juiz de Fora, DCC-UFJF.
    Couto da Silva, Ana Paula
    Universidade Federal de Juiz de Fora, DCC-UFJF.
    Henrique, Francisco
    Universidade Federal de Juiz de Fora, DCC-UFJF.
    Goncalves, Glauber
    Universidade Federal de Minas Gerais, DCC-UFMG.
    de Carvalho Gomes, Pedro
    KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
    SopCast P2P live streaming: live session traces and analysis2013In: Proceedings of the 4th ACM Multimedia Systems Conference: MMSys 2013, Association for Computing Machinery (ACM), 2013, 125-130 p.Conference paper (Refereed)
    Abstract [en]

    P2P-TV applications have attracted a lot of attention fromthe research community in the last years. Such systemsgenerate a large amount of data which impacts the networkperformance. As a natural consequence, characterizingthese systems has become a very important task to developbetter multimedia systems. However, crawling data fromP2P live streaming systems is particularly challenging bythe fact that most of these applications have privateprotocols. In this work, we present a set of logs from a verypopular P2P live streaming application, the SopCast. Wedescribe our crawling methodology, and present a briefSopCast characterization. We believe that our logs and thecharacterization can be used as a starting point to thedevelopment of new live streaming systems.

  • 177.
    Borgström, Kristofer
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS.
    Multimedia Messaging Service Components for Web 2.02008Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    The purpose of this master’s thesis is to simplify the exchange (in both directions) of multimedia content between mobile phones and network attached web servers. The solution proposed in this report specifically concerns displaying Multimedia Messaging Service (MMS) messages via a web browser connected to a network-attached web server and graphically authoring MMS messages via a web interface.

    This thesis project is important because it brings multimedia content, in the form of MMS messages, from isolation in the telecommunication world closer to wide availability via the Internet. This transition is very important as the Internet is where media is shared with the world today. This approach brings added value to end users who want to share content generated using their phone on a web site. It also provides added value to operators who want to increase the amount of MMS traffic in their networks.

    The solution is non-trivial because there are a number of complexities at both ends. This is because the MMS messages that are authored at mobile phones differ between both handset models and manufacturers. Moreover, the format used for MMS (MMS SMIL) is not widely used on the Internet, thus a transformation to an Internet browser supported format must be performed. The thesis examines to what extent this transformation can be completely automatic and how MMS messages can be authored through a web interface.

    The results show that MMS messages can be successfully transformed to HTML and embedded directly in web pages, thus providing a seamless experience for viewing MMS messages. Depending on the content of the MMS message in question, the current browser and which media player plug-ins are available, the generated HTML will be displayed differently. The results also show that MMS messages can be composed in real time* through a web interface with good results.

  • 178.
    Borison, Torbjorn
    KTH, School of Information and Communication Technology (ICT), Microelectronics and Information Technology, IMIT.
    Object Synchronization and Security for Mobile Communications Devices2001Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    The main objective of this master’s thesis project was to investigate and find solutions to the problem of how to combine the SyncML synchronisation specification with object security and thus protection of personal information, such as contacts and calendar entries in mobile devices.

    SyncML is a new synchronisation specification agreed upon by major device developers (Ericsson, Palm, Motorola, etc.) and the major synchronisation server developers (Starfish, Puma, fusionOne, etc.). It is independent of transport (HTTP, WSP, or OBEX) platform, operating system, and application and simplifies synchronisation of personal information between dissimilar SyncML supportive devices.

    SyncML compliant devices are fully capable of synchronising information with a third party operated Internet based server and a desktop computer. This allows us to access, up-date and maintain information independent of Intranets or geographical position. However, synchronising and storing confidential personal information on an third party operated Internet based server entails weaknesses in our personal information security. Even if transport and storage security are used, how secure is the server where this information is stored since this server has the highest probability of being attacked. Can we really trust that an employee or other person with valid appropriated administrators access to the storage facility with the appropriate knowledge, working together with the third party server operator, won’t try to access our stored information? To prevent this, the personal information’s confidentiality must be guaranteed before the information leaves the device.

    When synchronising and exchanging personal information, the information is often marked according to a specific format. The three de-facto standard PIM formats are: (1) vCard (contact information), (2) vCalendar, and (3) iCalendar (calendar and scheduling information). These formats divide the personal information into properties. Each property is assigned to contain a small piece of the personal information entry (e.g. a telephone number, an e-mail address, the time when the calendar event begins, etc.).

    Furthermore to preserve the interoperability between different devices given by SyncML, authorised recipients must automatically be able to reverse the encryption process and decrypt the encrypted property value. Therefore general cryptographic formats are used (e.g. CMS, PGP and the newly developed XML Encryption). They add information needed by the recipients (e.g. algorithm used, padding method used on the plain text, etc.), encrypt the plaintext into cipher text, and decrypt the cipher text into plain text given the correct key.

  • 179.
    Boström, Tomas
    et al.
    KTH, Superseded Departments, Teleinformatics.
    Lindroos, Olle
    KTH, Superseded Departments, Teleinformatics.
    Hellström, Lennart
    KTH, Superseded Departments, Teleinformatics.
    Simple Mobile IP1999Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    This thesis describes an implementation and evaluation of an IP mobility management protocol, Simple Mobile IP. The protocol enables dynamic address allocation and configuration of mobile terminals through utilisation of DHCP.

    Simple Mobile IP provides IP mobility within one administrative domain, in contrast to the global mobility in conventional Mobile IP. Both protocols use IP tunnelling but in Simple Mobile IP the tunnel runs along the optimised route, thus avoiding triangular routing.

    The protocol was implemented on the Linux platform and evaluated in a wireless LAN environment. The solution detects subnet transitions at the link layer, resulting in loss of IP connectivity for approximately 100 ms when mobile terminals move between subnets. The overhead, introduced by IP tunnelling, reduces the throughput by 3.8% in a wireless LAN environment.

  • 180.
    Bratu, Vlad-Ioan
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Radio Systems Laboratory (RS Lab). KTH, School of Information and Communication Technology (ICT), Centres, Center for Wireless Systems, Wireless@kth.
    Beckman, Claes
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Radio Systems Laboratory (RS Lab). KTH, School of Information and Communication Technology (ICT), Centres, Center for Wireless Systems, Wireless@kth.
    Antenna Tilt Load Balancing in Self-Organizing Networks2013In: International Journal of Research in Wireless Systems, ISSN 2320-3617, Vol. 2, no 1, 21-26 p.Article in journal (Other academic)
    Abstract [en]

    Base station antenna tilt is a powerful tuning parameter in traditional cellular network optimization. With theintroduction of Self-Organizing Networks (SON), this parameter may now be used also in the context of self-optimization.One envisioned scenario is load balancing (LB), where the coverage shaping properties of the antenna radiation pattern canbe used to control the cell borders. In this paper, a generalized framework for antenna tilt LB is presented and discussed. Inorder to assess the performance of antenna tilt as a tool for load balancing, simulations are performed to determine theeffect of tilt angle, vertical beamwidth and handover offset. The results show that there is a direct relation between theseparameters and the number of users that can be shifted towards neighboring cells. In conclusion, it is found that usingantennas with narrow vertical beamwidths together with small hand over offsets is an efficient way of performing loadbalancing but results also in high SIR variations.

  • 181.
    Bratu, Vlad-Ioan
    et al.
    KTH, School of Information and Communication Technology (ICT), Centres, Center for Wireless Systems, Wireless@kth.
    Beckman, Claes
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Radio Systems Laboratory (RS Lab). KTH, School of Information and Communication Technology (ICT), Centres, Center for Wireless Systems, Wireless@kth.
    Base station antenna tilt for load balancing2013In: 2013 7th European Conference on Antennas and Propagation (EUCAP), New York: IEEE , 2013, 2039-2043 p.Conference paper (Refereed)
    Abstract [en]

    The coverage shaping and interference reduction ability of base station antenna tilt are important tools in cellular network optimization. Through tilt changes, the coverage area of a serving cell may also be either reduced or expanded. Therefore, antenna tilt has the potential to be used for load balancing purposes. This paper gives an overview of base station antennas performance and antenna tilt. Simulations are performed in order to determine the impact of tilt changes when used for load balancing. The results show that while antenna tilt load balancing can improve the Grade of Service (GoS) in a congested cell, it will also influence the user bit rates and total cell throughput for both the congested cell and the neighbors.

  • 182.
    Bratu, Vlad-Ioan
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS. KTH, School of Information and Communication Technology (ICT), Centres, Center for Wireless Systems, Wireless@kth.
    Beckman, Claes
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Radio Systems Laboratory (RS Lab). KTH, School of Information and Communication Technology (ICT), Centres, Center for Wireless Systems, Wireless@kth.
    Base Station Antenna Tilt for Load Balancing and Potential use in Self-Optimizating Networks2013Conference paper (Other academic)
    Abstract [en]

    The coverage shaping and interference reduction ability of base station antenna tilt are important tools in cellular network optimization. Through tilt changes, the coverage area of a serving cell may also be either reduced or expanded. Therefore, antenna tilt has the potential to be used for load balancing purposes. With the introduction of Self-Organizing Networks (SON) in the mobile communications, this parameter may now be used also in the context of self-optimization, to address the common situation where traffic has an uneven spatial distribution between serving cells. This work gives an overview of base station antennas and antenna tilt. Simulations are performed in order to determine the impact of tilt changes when used for load balancing. The effect of tilt angle, vertical beam width and handover offset are analyzed also. The results show that there is a direct relation between these parameters and the number of users that can be shifted towards neighboring cells. In conclusion, it is found that using antennas with narrow vertical beam widths together with small hand over offsets is an efficient way of performing load balancing but results also in high SIR. Although antenna tilt load balancing can improve the Grade of Service (GoS) in a congested cell, it will also influence the user bit rates and total cell throughput for both the congested cell and the neighbors.

  • 183.
    Brejcha, Mikael
    KTH, Superseded Departments, Teleinformatics. KTH, School of Information and Communication Technology (ICT).
    Talaria: A Distributed Architecture for Supporting Monitoring and Collaborative Information Retrieval1999Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

     As the amount of information available via the Internet continues to explode, new means of finding and keeping oneself updated on sources of information must be found. This report presents a system that monitors sources of information on behalf of a user and also introduces new sources of information that potentially could be of interest to the user. As monitored information updates it can be directed to a variety of different displaying devices, ranging from simple pagers to advanced desktop computers. Ideas behind the design of the architecture are explained. The report explains why the system will scale as the number of users increases. The report describes measures taken to ensure user privacy.

  • 184.
    Bremstedt Pedersen, Ivan
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS.
    Andersson, Alfred
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS.
    More than downloading: Visualization of data produced by sensors in a home environment2012Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    A home automation system usually contains a set of tools that users use to control devices in their homes, often remotely. These devices often include but are not limited to light switches, thermostats, thermometers, window blinds, and climate controls. The potential for these kinds of systems is huge because of the sheer number of devices that could be controlled and managed with minimal and inexpensive extra hardware. Many of the appliances in a normal home could benefit from being connected to a system that allows the owner to manage and control the devices in their home. Thus the number of potential devices is orders of magnitude larger than the number of homes connected to the system. There are several systems on the market that provide systems to monitor and control a home environment, however these systems only support specific in system devices. This uncovers a problem where a homeowner only has the opportunity to use specific products that fit into these systems. By introducing an open platform for the public that are not bound to any system we can allow more devices to be integrated in the home and contribute to further development of smarter homes.

    The goal with this project was to provide a scalable open platform with the possibility of asynchronous updating. This has been done by implementing multiple logical parts to both provide a web interface for the user and to allow us to handle communication and storage of data. All these parts are linked together to form a system of servers that handles all background operations. This thesis discusses and presents implementations of all of these servers, how they are implemented, communicate with each other, provide secure connections and how they can scale with increasing usage. In this process we also discuss and present techniques that were used, how to use them and their benefits, to help us reach our goal.

  • 185.
    Brenning, Magnus
    et al.
    KTH, School of Technology and Health (STH).
    Olander, Björn
    KTH, School of Technology and Health (STH).
    Orhan, Ibrahim
    KTH, School of Technology and Health (STH), Medical Engineering.
    Vennberg, Johan
    KTH, School of Technology and Health (STH).
    Lindh, Thomas
    KTH, School of Technology and Health (STH), Medical Engineering, Computer and Electronic Engineering. 2Laboratory for communication networks, School of Electrical Engineering, KTH.
    NeTraWeb - A Web-Based Traffic Flow Performance Meter2006In: 4th Swedish National Computer Networking Workshop SNCNW 2006, 2006Conference paper (Refereed)
    Abstract [en]

    This paper presents a web-based traffic flow performance meter. The NeTraWeb tool configures and automates the measurement activities, including storage and presentation of the main performance parameters.

  • 186.
    Brewka, Lukasz
    et al.
    DTU.
    Sköldström, Pontus
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Telecommunication Systems Laboratory, TSLab (closed 2012-01-01).
    Gavler, Anders
    Acreo AB.
    Nordell, Viktor
    Acreo AB.
    Wessing, Henrik
    DTU.
    Dittmann, Lars
    DTU.
    ALPHA Proposal of mapping QoS parameters between UPnP home network and GMPLS access2011In: ACCESS NETWORKS, 2011, 226-239 p.Conference paper (Refereed)
    Abstract [en]

     This paper is treating the interdomain QoS signaling between the home and access domains with a focus on applying it for providing QoS between a UPnP-QoS based home network and GMPLS based access network. The work presented here is defining a possible approach for an interface between UPnP-QoS and GMPLS in order to move towards end-to-end QoS establishment as well as investigating the complexity of such a solution. We present the QoS parameters and mechanisms in both UPnP-QoS and GMPLS and how they can be matched to create a coherent QoS architecture.

  • 187.
    Brewka, Lukasz
    et al.
    DTU.
    Sköldström, Pontus
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Telecommunication Systems Laboratory, TSLab (closed 2012-01-01).
    Gavler, Anders
    Acreo AB.
    Nordell, Viktor
    Acreo AB.
    Wessing, Henrik
    DTU.
    Dittmann, Lars
    DTU.
    QoS enabled resource allocation over an UPnP-QoS/€”GMPLS controlled edge2011In: 2011 IEEE Consumer Communications and Networking Conference, CCNC'2011, 2011, 218-222 p.Conference paper (Refereed)
    Abstract [en]

    This paper focuses on the problem of coherent resource allocation within home and access networks. The interdomain QoS signaling discussed here enables the initiation of the QoS provisioning in the home and access from the end device in users home. The home network considered in this paper is UPnP-QoS enabled while the access network is GMPLS based. We propose and implement an interface between aforementioned network segments allowing for end-to-end QoS establishment. We present the QoS parameters and mechanisms in both UPnP-QoS and GMPLS and how they can be matched to create a coherent QoS architecture. Additionally we investigate the complexity of such a solution and present implementation results.

  • 188.
    Briat, Corentin
    et al.
    KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Hjalmarsson, Håkan
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Johansson, Karl H.
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Jönsson, Ulf
    KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Karlsson, Gunnar
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Sandberg, Henrik
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Nonlinear state-dependent delay modeling and stability analysis of internet congestion control2010In: 49TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2010, 1484-1491 p.Conference paper (Refereed)
    Abstract [en]

    It is shown that the queuing delay involved in the congestion control algorithm is state-dependent and does not depend on the current time. Then, using an accurate formulation for buffers, networks with arbitrary topologies can be built. At equilibrium, our model reduces to the widely used setup by Paganini et al. Using this model, the delay-derivative is analyzed and it is proved that the delay time-derivative does not exceed one for the considered topologies. It is then shown that the considered congestion control algorithm globally stabilizes a delay-free single buffer network. Finally, using a specific linearization result for systems with state-dependent delays from Cooke and Huang, we show the local stability of the single bottleneck network.

  • 189.
    Briat, Corentin
    et al.
    KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Hjalmarsson, Håkan
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Johansson, Karl H.
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Jönsson, Ulf T.
    KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Karlsson, Gunnar
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Sandberg, Henrik
    KTH, School of Electrical Engineering (EES), Automatic Control.
    Yavuz, Emre Altug
    KTH, School of Electrical Engineering (EES), Communication Networks.
    An axiomatic fluid-flow model for congestion control analysis2011In: 2011 50th IEEE Conference on Decision and Control andEuropean Control Conference (CDC-ECC), 2011, 3122-3129 p.Conference paper (Refereed)
    Abstract [en]

    An axiomatic model for congestion control isderived. The proposed four axioms serve as a basis for theconstruction of models for the network elements. It is shownthat, under some assumptions, some models of the literature canbe recovered. A single-buffer/multiple-users topology is finallyderived and studied for illustration.

  • 190.
    Briat, Corentin
    et al.
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Yavuz, Emre A.
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Karlsson, Gunnar
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    A conservation-law-based modular fluid-flow model for network congestion modeling2012In: 2012 Proceedings - IEEE INFOCOM, IEEE Computer Society, 2012, 2050-2058 p.Conference paper (Refereed)
    Abstract [en]

    A modular fluid-flow model for network congestion analysis and control is proposed. The model is derived from an information conservation law stating that the information is either in transit, lost or received. Mathematical models of network elements such as queues, users, and transmission channels, and network description variables, including sending/ acknowledgement rates and delays, are inferred from this law and obtained by applying this principle locally. The modularity of the devised model makes it sufficiently generic to describe any network topology, and appealing for building simulators. Previous models in the literature are often not capable of capturing the transient behavior of the network precisely, making the resulting analysis inaccurate in practice. Those models can be recovered from exact reduction or approximation of this new model. An important aspect of this particular modeling approach is the introduction of new tight building blocks that implement mechanisms ignored by the existing ones, notably at the queue and user levels. Comparisons with packet-level simulations corroborate the proposed model.

  • 191.
    Broman, Fredrik
    et al.
    KTH, Superseded Departments, Teleinformatics.
    Tarberg, Fredrik
    KTH, Superseded Departments, Teleinformatics.
    Implementation andAnalyses of theMobile-IP Protocol1996Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    This report is the result of a masters degree project conducted at the Department of Teleinformatics at the Royal Institute of Technology during the autumn 1995. The area investigated is the Mobile Internet Protocol, especially its implementation and efficiency.

    The thesis work is divided into three areas. The first area includes the development and implementation of a Management Information Base for the Mobile-IP protocol. The second area deals with the porting of a Mobile-IP implementation for SunOS to MachOS and Solaris. The last area covers the tests done to measure the throughput and latency of the protocol.

  • 192.
    Broms, Daniel
    KTH, School of Information and Communication Technology (ICT), Microelectronics and Information Technology, IMIT.
    Access restrictions in surrogates using Portable Channel Representation2002Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    This Master thesis investigates how content with access restrictions can be handled in a Content Distribution Network (CDN). The thesis focuses on CDNs where the distribution is made using Portable Channel Representation (PCR), a description of content that enables installation on any platform. There has been a demand from customers for access restriction support when distributing web sites. Ranging from personal homepages wanting to restrict access using some simple password authentication protocol to corporate websites wanting HTTPS support.

    This thesis starts with a survey of available authentication mechanisms as well as available publication protocols with support for protection. This provided the basis for the design of the new protection element for PCR spanning most protection requirements. The PCR model is realized using XML in the Lokomo Software Suite. The new design has been implemented in the context of the Lokomo Software Suite. The protection has been shown to correctly install basic authentication on both Apache’s HTTP Server and Microsoft’s Internet Information Server.

  • 193.
    Brundin, Peter
    KTH, School of Information and Communication Technology (ICT), Microelectronics and Information Technology, IMIT.
    LESpy - PCM Link Analyzer2002Independent thesis Advanced level (degree of Master (Two Years)), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    This report will discuss the design of a test tool, a PCM link analyzer, LESpy. The development of LESpy is based upon reuse of C++ source code from previous test equipment from INEO, LESim. The purpose of LESpy is a tool for analyzing two telephony interfaces in Ericsson’s ”Radio in the Local Loop” system RAS 1000. Monitoring the Channel Associated Signaling (CAS) interface was the primary goal. As second goal was to find a solution to analyze the ISDN interface.

    The report presents some background information about telephony, computer telephony, the RAS 1000 system, and the development and target environment (IBM’s operating system OS/2). It also describes building blocks and functionality, i.e. the nodes, components, classes, and use cases of LESpy through UML diagrams.

    The result of the project is a test tool where most of the requirements were fulfilled through inheritance of new classes and new functionality by polymorphism. As required supervision and address signaling could be monitored and saved to a file.

  • 194.
    Buchegger, Sonja
    EPFL.
    A Robust Reputation System for Peer-to-Peer and Mobile Ad-hoc Networks2004In: Proceedings of Third Workshop on Economics of Peer-to-Peer Systems (P2PEcon), 2004, 2004Conference paper (Refereed)
  • 195.
    Buchegger, Sonja
    EPFL.
    Coping with Misbehavior in Mobile Ad-hoc Networks2004Doctoral thesis, monograph (Other academic)
    Abstract [en]

    n this work, we address the question of how to enable a system to operate despite the presence of misbehavior. Specifically, in a mobile ad-hoc network, how can we keep the network functional for normal nodes when other nodes do not route and forward correctly? Node misbehavior due to selfish or malicious reasons or faulty nodes can significantly degrade the performance of mobile ad-hoc networks. Existing approaches such as economic incentives or secure routing by cryptographic means alleviate some of the problems, but not all. For instance, nodes can still forward packets on bogus routes. We propose a protocol called CONFIDANT (Cooperation Of Nodes --- Fairness In Dynamic Ad-hoc NeTworks) to cope with misbehavior. It enables nodes to detect misbehavior by first-hand observation and use of second-hand information provided by other nodes. The view a node has about the behavior of another node is captured in a reputation system, which is used to classify nodes as misbehaving or normal. Once a misbehaving node is detected, it is isolated from the network. Reputation systems can, however, be tricked by the spread of false reputation ratings, be it false accusations or false praise. Simple solutions such as exclusively relying on one`s own direct observations have drawbacks, as they do not make use of all the information available. To solve this problem, we propose a fully distributed reputation system that can cope with false information and effectively use second-hand information in a safe way. Our approach is based on a modified Bayesian estimation and classification procedure. In our approach, each node maintains a reputation rating and a trust rating about all other nodes it cares about. Reputation ratings capture the quality of the behavior of a node as an actor in the network performing routing and forwarding tasks. From time to time first-hand reputation information is exchanged with others; using a modified Bayesian approach we designed, second-hand reputation information is only accepted if it is compatible with the current reputation rating. Reputation ratings are only slightly modified by accepted information. Trust ratings capture the quality of a node as an actor in the reputation system and reflect whether the reported first hand information summaries published by node are likely to be true. Trust ratings are updated based on the compatibility of second-hand reputation information with prior reputation ratings. We enable node redemption and prevent the sudden exploitation of good reputation built over time by introducing reputation fading. Data is entirely distributed, the reputation and trust value of a node is the collection of ratings maintained by others. We use simulation to evaluate and demonstrate the performance. We found that CONFIDANT can keep the network performance high even when up to half of the network population misbehaves. We show that our approach of using second-hand information significantly speeds up the detection of misbehaving nodes while keeping the number of false positives and negatives negligibly low.

  • 196.
    Buchegger, Sonja
    Deutsche Telekom Laboratories, TU Berlin.
    Economics of Self-Organized Networks2009Other (Refereed)
  • 197.
    Buchegger, Sonja
    et al.
    Deutsche Telekom Laboratories, TU Berlin.
    Chuang, John
    UC Berkeley.
    Economics-Informed Network Design2007Conference paper (Refereed)
  • 198.
    Buchegger, Sonja
    et al.
    Deutsche Telekom Laboratories, TU Berlin.
    Chuang, John
    UC Berkeley.
    Encouraging Cooperation Among Network Entities2007In: Cognitive Wireless Networks: Concepts, Methodologies and Visions / [ed] Frank Fitzek, Marcos Katz, Springer, 2007, 87-107 p.Chapter in book (Refereed)
  • 199.
    Buchegger, Sonja
    et al.
    Deutsche Telekom Laboratories, TU Berlin.
    Krishnamurthy, Sudha
    Deutsche Telekom Laboratories, TU Berlin.
    Sensor Network Economics2007In: Handbook on Sensor Networks / [ed] Yang Xiao, Hui Chen, Frank H. Li, World Scientific, 2007, 835-852 p.Chapter in book (Refereed)
  • 200.
    Buchegger, Sonja
    et al.
    EPFL.
    Le Boudec, Jean-Yves
    EPFL.
    Self-Policing Mobile Ad-hoc Networks2004In: Handbook on Mobile Computing, CRC Press, 2004, 395-413 p.Chapter in book (Refereed)
1234567 151 - 200 of 1873
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