The Experts below are selected from a list of 15108 Experts worldwide ranked by ideXlab platform

Philippe Nain - One of the best experts on this subject based on the ideXlab platform.

  • On the dynamic estimation of Multicast Group sizes
    2004
    Co-Authors: Sara Alouf, Eitan Altman, Chadi Barakat, Philippe Nain
    Abstract:

    This paper concerns Multicast applications that are interested in the evolution of their membership over time. It covers optimal on-line estimation algorithms for determining the membership of a Multicast Group. The paper briefly reviews the related work and our own contributions to the field. Using a probabilistic acknowledgement scheme and signal processing's filtering techniques, we have derived MSE-optimal estimators under the assumptions of Poisson subscribers arrival and either exponentially or hyperexponentially distributed lifetime of receivers. Our estimators have been tested through trace-driven simulations using data from real Multicast video sessions over which they exhibit very good performance.

  • optimal on line estimation of the size of a dynamic Multicast Group
    International Conference on Computer Communications, 2002
    Co-Authors: Sara Alouf, Eitan Altman, Philippe Nain
    Abstract:

    We propose an efficient on-line estimation algorithm for determining the size of a dynamic Multicast Group. By using diffusion approximation and a Kalman filter, we derive an estimator that minimizes the mean square of the estimation error. As opposed to previous studies, where the size of the Multicast Group is supposed to be fixed throughout the estimation procedure, we consider a dynamic estimation scheme that updates the estimation at every observation step. The robustness of our estimator to violation of the assumptions under which it has been derived is addressed via simulations. Further validations of our approach are carried out on real audio traces.

  • Optimal on-line estimation of the size of a dynamic Multicast Group
    2002
    Co-Authors: Sara Alouf, Eitan Altman, Philippe Nain
    Abstract:

    In this paper we propose an efficient on-line estimation algorithm for determining the size of a dynamic Multicast Group. By using diffusion approximation and Kalman filter, we derive an estimator that minimizes the mean square of the estimation error. As opposed to previous studies, where the size of the Multicast Group is supposed to be fixed throughout the estimation procedure, we consider a dynamic estimation scheme that updates the estimation at every observation step. The robustness of our estimator to violation of the assumptions under which it has been derived is addressed via simulations. Further validations of our approach are carried out on real audio traces.

  • Optimal On-Line Estimation of the Size of a Dynamic Multicast Group
    2001
    Co-Authors: Sara Alouf, Eitan Altman, Philippe Nain
    Abstract:

    In this paper we propose an optimal on-line estimation algorithm for determini- ng the size of a dynamic Multicast Group. By using diffusion approximation and Kalman filter, we derive an estimator that minimizes the mean square of the estimation error. As opposed to previous studies, where the size of the Multicast Group is supposed to be fixed throughout the estimation procedure, we consider a dynamic estimation scheme that updates the estimation at every observation step. The robustness of our estimator to violation of the assumptions under which it has been derived is addressed via simulation- s. Further validations of our approach are carried out on real audio traces.

  • INFOCOM - Optimal on-line estimation of the size of a dynamic Multicast Group
    Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, 1
    Co-Authors: Sara Alouf, Eitan Altman, Philippe Nain
    Abstract:

    We propose an efficient on-line estimation algorithm for determining the size of a dynamic Multicast Group. By using diffusion approximation and a Kalman filter, we derive an estimator that minimizes the mean square of the estimation error. As opposed to previous studies, where the size of the Multicast Group is supposed to be fixed throughout the estimation procedure, we consider a dynamic estimation scheme that updates the estimation at every observation step. The robustness of our estimator to violation of the assumptions under which it has been derived is addressed via simulations. Further validations of our approach are carried out on real audio traces.

Sushil Jajodia - One of the best experts on this subject based on the ideXlab platform.

  • secure and efficient Multicast in wireless sensor networks allowing ad hoc Group formation
    IEEE Transactions on Vehicular Technology, 2009
    Co-Authors: Kui Ren, Wenjing Lou, Bo Zhu, Sushil Jajodia
    Abstract:

    Multicast security is one of the most important security services in wireless sensor networks (WSNs) since it enables a sink to Multicast messages to sensors in a secure manner. While Multicast authentication has widely been addressed in the literature, the problem of Multicast encryption still remains open in WSNs. In this paper, we propose a Multicast encryption scheme called global-partition, local-diffusion (GPLD) that focuses on scheme efficiency and supports various Multicast Group semantics. GPLD partitions sensors into a series of elementary Groups using their location and class information and accordingly builds a location-class-aware symmetric key management framework. Furthermore, the scheme leverages the fact that sensors are both end receivers and routers, which effectively minimizes global (sink-to-sensor) Group key distribution and rekeying traffic while supporting various Multicast Group semantics. The efficiency and security properties of GPLD are justified through both analysis and simulations.

Kui Ren - One of the best experts on this subject based on the ideXlab platform.

  • Attribute-based on-demand Multicast Group setup with membership anonymity
    Computer Networks, 2010
    Co-Authors: Kui Ren, Wenjing Lou
    Abstract:

    In many applications, it is desired to dynamically establish temporary Multicast Groups for secure message delivery. It is also often the case that the Group membership information itself is sensitive and needs to be well protected. However, existing solutions either fail to address the issue of membership anonymity or do not scale well for dynamically established Groups. In this paper, we propose a highly scalable solution for dynamical Multicast Group setup with Group membership anonymity. In the proposed solution, scalability and membership anonymity are achieved via a novel design that integrates techniques such as ciphertext-policy attribute-based encryption (CP-ABE). In our design, Multicast Groups are specified through Group member attributes. As these attributes are potentially able to be shared by unlimited number of Group members, our proposed scheme scales well. Also, high level of membership anonymity is guaranteed such that every Group member knows nothing but his own Group membership only. The complexity of our proposed scheme in terms of computational overhead and ciphertext size is O(n), where n is the number of attributes and independent to the Group size.

  • secure and efficient Multicast in wireless sensor networks allowing ad hoc Group formation
    IEEE Transactions on Vehicular Technology, 2009
    Co-Authors: Kui Ren, Wenjing Lou, Bo Zhu, Sushil Jajodia
    Abstract:

    Multicast security is one of the most important security services in wireless sensor networks (WSNs) since it enables a sink to Multicast messages to sensors in a secure manner. While Multicast authentication has widely been addressed in the literature, the problem of Multicast encryption still remains open in WSNs. In this paper, we propose a Multicast encryption scheme called global-partition, local-diffusion (GPLD) that focuses on scheme efficiency and supports various Multicast Group semantics. GPLD partitions sensors into a series of elementary Groups using their location and class information and accordingly builds a location-class-aware symmetric key management framework. Furthermore, the scheme leverages the fact that sensors are both end receivers and routers, which effectively minimizes global (sink-to-sensor) Group key distribution and rekeying traffic while supporting various Multicast Group semantics. The efficiency and security properties of GPLD are justified through both analysis and simulations.

  • attribute based on demand Multicast Group setup with membership anonymity
    International Workshop on Security, 2008
    Co-Authors: Kui Ren, Wenjing Lou
    Abstract:

    In many applications, it is desired to dynamically establish temporary Multicast Groups for secure message delivery. It is also often the case that the Group membership information itself is sensitive and needs to be well protected. However, existing solutions either fail to address the issue of membership anonymity or do not scale well for dynamically established Groups. In this paper, we propose a highly scalable solution for dynamical Multicast Group setup and yet protecting Group membership anonymity simultaneously. In the proposed solution, scalability and membership anonymity are achieved via a novel design that integrates both ciphertextpolicy attribute-based encryption (CP-ABE) and centralized flat table (CFT) techniques. In our design, Multicast Groups are specified through Group member attributes represented through binary member ID only and thus achieves scalability. Also, high level of membership anonymity is guaranteed such that every Group member knows nothing but his own Group membership only. The proposed solution is also efficient in communication, that is, the ciphertext size is only O(n), where n is the length of a Group member ID and independent to the Group size.

  • SecureComm - Attribute-based on-demand Multicast Group setup with membership anonymity
    Proceedings of the 4th international conference on Security and privacy in communication netowrks - SecureComm '08, 2008
    Co-Authors: Kui Ren, Wenjing Lou
    Abstract:

    In many applications, it is desired to dynamically establish temporary Multicast Groups for secure message delivery. It is also often the case that the Group membership information itself is sensitive and needs to be well protected. However, existing solutions either fail to address the issue of membership anonymity or do not scale well for dynamically established Groups. In this paper, we propose a highly scalable solution for dynamical Multicast Group setup and yet protecting Group membership anonymity simultaneously. In the proposed solution, scalability and membership anonymity are achieved via a novel design that integrates both ciphertextpolicy attribute-based encryption (CP-ABE) and centralized flat table (CFT) techniques. In our design, Multicast Groups are specified through Group member attributes represented through binary member ID only and thus achieves scalability. Also, high level of membership anonymity is guaranteed such that every Group member knows nothing but his own Group membership only. The proposed solution is also efficient in communication, that is, the ciphertext size is only O(n), where n is the length of a Group member ID and independent to the Group size.

Kazutoshi Fujikawa - One of the best experts on this subject based on the ideXlab platform.

  • CCNC - TrafficCam: Sharing traffic information based on dynamic IPv6 Multicast Group assignment using smartphone sensors
    2013 IEEE 10th Consumer Communications and Networking Conference (CCNC), 2013
    Co-Authors: Y. Kanemaru, Satoru Noguchi, Atsuo Inomata, Kazutoshi Fujikawa
    Abstract:

    Exchanging traffic information among nearby vehicles is one of the communication scenarios in the field of intelligent transport systems (ITS). An important question in this scenario is “How can traffic information be delivered to only one subset of nearby vehicles in the same road traffic situation?”, for example, to only congested traffic in a certain lane. In this demonstration, we propose a dynamic IPv6 Multicast Group assignment mechanism using GPS, an accelerometer and a magnetometer embedded in smartphones. Our mechanism enables each vehicle to find the relevant vehicles, and to compose a temporary IPv6 Multicast address. Our mechanism can deliver traffic information to a Group of vehicles in a particular situation. This demonstration, carried out on virtual traffic congestion, shows an information-sharing scenario using a prototype of the proposed mechanism, implemented as an Android application called TrafficCam. Our application demonstrates the usefulness of the proposed mechanism.

Tyler K Beam - One of the best experts on this subject based on the ideXlab platform.

  • hypercast a protocol for maintaining Multicast Group members in a logical hypercube topology
    Lecture Notes in Computer Science, 1999
    Co-Authors: Jorg Liebeherr, Tyler K Beam
    Abstract:

    To efficiently support large-scale Multicast applications with many thousand simultaneous members, it is essential that protocol mechanisms be available which support efficient exchange of control information between the members of a Multicast Group. Recently, we proposed the use of a control topology, which organizes Multicast Group members in a logical n-dimensional hypercube, and transmits all control information along the edges of the hypercube. In this paper, we present the design, verification, and implementation of a protocol, called HyperCast, which maintains members of a Multicast Group in a logical hypercube. We use measurement experiments of an implementation of the protocol on a networked computer cluster to quantitatively assess the performance of the protocol for Multicast Group sizes up to 1024 members.

  • Networked Group Communication - HyperCast: A Protocol for Maintaining Multicast Group Members in a Logical Hypercube Topology
    Lecture Notes in Computer Science, 1999
    Co-Authors: Jorg Liebeherr, Tyler K Beam
    Abstract:

    To efficiently support large-scale Multicast applications with many thousand simultaneous members, it is essential that protocol mechanisms be available which support efficient exchange of control information between the members of a Multicast Group. Recently, we proposed the use of a control topology, which organizes Multicast Group members in a logical n-dimensional hypercube, and transmits all control information along the edges of the hypercube. In this paper, we present the design, verification, and implementation of a protocol, called HyperCast, which maintains members of a Multicast Group in a logical hypercube. We use measurement experiments of an implementation of the protocol on a networked computer cluster to quantitatively assess the performance of the protocol for Multicast Group sizes up to 1024 members.