By Topic

Local Computer Networks (LCN), 2011 IEEE 36th Conference on

Date 4-7 Oct. 2011

Filter Results

Displaying Results 1 - 25 of 180
  • [Front matter]

    Publication Year: 2011 , Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (83 KB)  
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2011 , Page(s): ii
    Save to Project icon | Request Permissions | PDF file iconPDF (104 KB)  
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2011 , Page(s): iii - xl
    Save to Project icon | Request Permissions | PDF file iconPDF (1270 KB)  
    Freely Available from IEEE
  • Message from the General Chair

    Publication Year: 2011 , Page(s): xli - xlii
    Save to Project icon | Request Permissions | PDF file iconPDF (107 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Message from the Program Chairs

    Publication Year: 2011 , Page(s): xliii - xliv
    Save to Project icon | Request Permissions | PDF file iconPDF (105 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Message from the demonstrations chair

    Publication Year: 2011 , Page(s): xlv - xlvii
    Save to Project icon | Request Permissions | PDF file iconPDF (139 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Best paper awards for prior IEEE local computer networks conferences

    Publication Year: 2011 , Page(s): xlviii - xlix
    Save to Project icon | Request Permissions | PDF file iconPDF (115 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • LCN 2011 Organizing and Program Committee

    Publication Year: 2011 , Page(s): l - lviii
    Save to Project icon | Request Permissions | PDF file iconPDF (356 KB)  
    Freely Available from IEEE
  • On-move 2011: Message from the on-move 2011 workshop chairs

    Publication Year: 2011 , Page(s): lix - lx
    Save to Project icon | Request Permissions | PDF file iconPDF (113 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • WLN 2011: Message from the WLN 2011 workshop chairs

    Publication Year: 2011 , Page(s): lxi - lxii
    Save to Project icon | Request Permissions | PDF file iconPDF (118 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • P2MNET 2011: Message from the P2MNET 2011 workshop chairs

    Publication Year: 2011 , Page(s): lxiii - lxiv
    Save to Project icon | Request Permissions | PDF file iconPDF (118 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • WNM 2011: Message from the WNM 2011 workshop chairs

    Publication Year: 2011 , Page(s): lxv - lxvi
    Save to Project icon | Request Permissions | PDF file iconPDF (114 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • SenseApp 2011: Message from the SenseApp 2011 workshop chairs

    Publication Year: 2011 , Page(s): lxvii - lxviii
    Save to Project icon | Request Permissions | PDF file iconPDF (118 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • WISe 2011: Message from the WISe 2011 workshop chairs

    Publication Year: 2011 , Page(s): lxix - lxx
    Save to Project icon | Request Permissions | PDF file iconPDF (116 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • WASA-NGI-IV 2011: Message from the WASA-NGI-IV 2011 workshop chairs

    Publication Year: 2011 , Page(s): lxxi - lxxii
    Save to Project icon | Request Permissions | PDF file iconPDF (120 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Botnets — Detection, classification and countermeasures

    Publication Year: 2011 , Page(s): lxxiii - lxxiv
    Save to Project icon | Request Permissions | PDF file iconPDF (129 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Resource allocation in cooperative networks: The role of games

    Publication Year: 2011 , Page(s): lxxv
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (104 KB) |  | HTML iconHTML  

    Summary form only given. Cooperative communication is becoming a promising technology to increase the channel capacity of wireless networks. The assignment of relay nodes to users plays a critical role to the resulting channel capacity. A significant challenge is how to make the assignment scheme robust to selfish and cheating behavior of users while guaranteeing the social optimal system capacity. In this keynote, we will present an integrated optimal relay assignment scheme for cooperative networks. To avoid system performance degradation due to selfish relay selections by the users, we propose a payment mechanism for charging the users to induce them to converge to the optimal assignment. To prevent relay nodes from manipulating the relay assignment by reporting transmission powers untruthfully, we propose a payment mechanism to pay them for providing relaying service. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enabling flexible packet filtering through the K-map priority elimination technique

    Publication Year: 2011 , Page(s): 1 - 8
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (240 KB) |  | HTML iconHTML  

    The process of packet filtering becomes time consuming as filtering policies become larger and more complex. New firewall designs are needed to meet the challenges associated with the high-speed networks. For this reason, access control lists in firewalls need to be flexible enough to give us the possibility to implement efficiently new high-performance filtering strategies. The precedence relationships within the access control rules are considered as being one of the most important handicap remaining unsolved in the context of optimization. In this paper, we introduce a Karnaugh map (k-map) based technique able to remove totally the dependencies between rules without changing the filtering behavior (i.e. input and output lists of rules remain semantically equivalent). On one hand, statistical rule ordering models become easy to implement, provide a differentiated quality of service and enable to reach a good processing time. On the other hand, dependency removal is very useful in the context parallelization especially when the access policy has to be equitably distributed among multiple firewalls. We have implemented this new technique and the first computer experiments were very promising. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PFS: Probabilistic filter scheduling against distributed denial-of-service attacks

    Publication Year: 2011 , Page(s): 9 - 17
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (364 KB) |  | HTML iconHTML  

    Distributed denial-of-service (DDoS) attacks continue to pose an important challenge to current networks. DDoS attacks can cause victim resource consumption and link congestion. A filter-based DDoS defense is considered as an effective approach, since it can defend against both attacks: victim resource consumption and link congestion. However, existing filter-based approaches do not address necessary properties for viable DDoS solutions: how to practically identify attack paths, how to propagate filters to the best locations (filter routers), and how to manage many filters to maximize the defense effectiveness. We propose a novel mechanism, termed PFS (Probabilistic Filter Scheduling), to efficiently defeat DDoS attacks and to satisfy the necessary properties. In PFS, filter routers identify attack paths using probabilistic packet marking, and maintain filters using a scheduling policy to maximize the defense effectiveness. Our experiments show that PFS achieves 44% higher effectiveness than other filter-based approaches. Furthermore, we vary PFS parameters in terms of the marking probability and deployment ratio, and find that 30% marking probability and 30% deployment rate maximize the attack blocking rate of PFS. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using roadmap profiling to enhance the warning message dissemination in vehicular environments

    Publication Year: 2011 , Page(s): 18 - 20
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (582 KB) |  | HTML iconHTML  

    In recent years, new applications, architectures and technologies have been proposed for Vehicular ad hoc networks (VANETs). Regarding traffic safety applications for VANETs, warning messages have to be quickly disseminated in order to reduce the required dissemination time and to increase the number of vehicles receiving the traffic warning information. In the past, several approaches have been proposed to improve the alert dissemination process in multi-hop wireless networks, but none of them is adapted to the propagation features of the scenario. In this paper, we present an adaptive algorithm designed to improve the warning message dissemination process. With respect to previous proposals, our proposed scheme uses a mapping technique based on adapting the dissemination strategy according to the characteristics of the street area where the vehicles are moving. Our algorithm reported a noticeable improvement in the performance of alert dissemination processes in simulated scenarios based on real city maps. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • User- and application-centric multihomed flow management

    Publication Year: 2011 , Page(s): 26 - 34
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (258 KB) |  | HTML iconHTML  

    We consider the problem of network selection and flow distribution for a multihomed mobile device. We argue the benefits of a holistic approach which considers user- and application-centric metrics such as quality, energy consumption and monetary cost, rather than the commonly used network-centric metrics. We thus introduce the multihomed flow management problem which combines network selection, flow distribution and application flow awareness. We formulate it as a constrained optimisation problem and compare it to commonly used techniques: single network selection and load balancing. For selected interactive applications, we use empirical network measurements to evaluate the optimal solutions obtained by the three approaches. We show that, by exploiting the flexibility of application parameters, it is possible to achieve the potentially conflicting goals of maintaining high application quality while reducing both the power consumption and cost of network use. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • User-centric quality of service provisioning

    Publication Year: 2011 , Page(s): 35 - 41
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (223 KB) |  | HTML iconHTML  

    Current Internet traffic includes a combination of peer to peer, web, and real time traffic which leads to unfair treatment for users or, when policed, an uneven distribution of resources to applications. This paper presents a novel extension to the Assured Forwarding per-hop-behaviour for a Diffserv-based network, enabling a more user-centric approach when provisioning for Quality of Service over IP networks. The proposed architecture, Congestion Aware Packet Scheduler (CAPS), is based on monitoring application-level performance metrics and adjusting resource allocation in order to optimise the end user resulting application performance while dynamically adapting to variable traffic conditions . The CAPS algorithm is validated through extensive simulations of a large Internet topology coupled with realistic traffic models. The results show that, irrespective of the combination of user traffic, the CAPS algorithm successfully manages the allocation of bandwidth across applications to provide the optimal aggregate-QoS, offering an improvement over alternative network configurations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How to provision and manage off-the-shelf SIP phones in domestic and SOHO environments

    Publication Year: 2011 , Page(s): 42 - 49
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (368 KB) |  | HTML iconHTML  

    Integrated services delivered over broadband connections are becoming the norm in domestic households, as it is the case with triple-play bundles which offer combined Voice, Television and Data services delivered using IP-based technologies and protocols. As a result, the usage of SIP-based (Session Initiation Protocol) VoIP devices has known a significant growth in domestic environments, either in the form of standalone (e.g. SIP telephones) or embedded devices (as it happens with some domestic gateways, which embed analog-to-SIP adaptors). For Internet Service Providers (ISPs), the provisioning and management of those devices is a challenge - especially standalone SIP phones, since most of them were exclusively designed for corporate LAN usage, not supporting adequate mechanisms for remote management over broadband access networks. In this paper we propose a framework which allows the integration of off-the-shelf SIP phones with the CWMP protocol suite, the prevailing standard for remote management of Customer Premises Devices (CPEs) in broadband access networks. This integration framework supports the vast majority of commercially available SIP phones whilst maintaining full compatibility with the original CWMP specification - thus allowing ISPs to reuse their CWMP management infrastructure to configure and provision off-the-shelf SIP telephones. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rate equalization: A new approach to fairness in deterministic quality of service

    Publication Year: 2011 , Page(s): 50 - 57
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (193 KB) |  | HTML iconHTML  

    Scheduling protocols that provide both rate and fairness guarantees, such as Weighted Fair Queuing, distribute the unused capacity among the flows in proportion to the reserved rate of the flows. Thus, flows whose reserved rate is the largest will receive a larger share of the unused capacity. We present a scheduling algorithm that first distributes unused capacity to those flows whose reserved rate is the least. This allocation continues until the flows with least reserved rate and the flows with the next-to-least reserved rate are given the same capacity. If enough unused capacity is available, all flows will receive the same capacity, and the scheduler will simply behave like Fair Queuing. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MapCorrect: Automatic correction and validation of road maps using public sensing

    Publication Year: 2011 , Page(s): 58 - 66
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (288 KB) |  | HTML iconHTML  

    With the increasing proliferation of small and cheap GPS receivers, a new way of generating road maps could be witnessed over the last few years. Participatory mapping approaches like OpenStreetMap introduced a way to generate road maps collaboratively from scratch. Moreover, automatic mapping algorithms were proposed, which automatically infer road maps from a set of given GPS traces. Nevertheless, one of the main problems of these maps is their unknown quality in terms of accuracy, which makes them unreliable and, therefore, not applicable for the use in critical scenarios. To address this issue, we propose MapCorrect: An automatic map correction and validation system. MapCorrect automatically collects GPS traces from people's mobile devices to correct a given road map and validate it by identifying those parts of the map that are accurately mapped with respect to some user provided quality requirements. Since fixing a GPS position is a battery draining operation, the collection of GPS data raises concerns about the energy consumption of the participating mobile devices. We tackle this issue by introducing an optimized sensing mechanism that gives the mobile devices notifications indicating those parts of the map that are considered as sufficiently mapped and, therefore, require no further GPS data for their validation. Furthermore, we show by simulation that using this approach up to 50% of the mobile phones' energy can be saved while not impairing the effectiveness of the map correction and validation process at all. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.