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

Jürgen Schönwälder - One of the best experts on this subject based on the ideXlab platform.

  • Prefix- and Lexicographical-Order-preserving IP Address Anonymization
    2006 IEEE/IFIP Network Operations and Management Symposium NOMS 2006, 2006
    Co-Authors: M. Harvan, Jürgen Schönwälder
    Abstract:

    The anonymization of SNMP traffic traces requires an IP address anonymization scheme which is prefix-preserving and Lexicographical-Order-preserving. We present an anonymization scheme satisfying these two requirements which has been derived from the prefix-preserving cryptography-based scheme Crypto-PAn. We formally prove the correctness of the scheme and we describe an embeddable implementation. Limits of the proposed anonymization scheme and some security aspects are discussed as well

  • NOMS - Prefix- and Lexicographical-Order-preserving IP Address Anonymization
    2006 IEEE IFIP Network Operations and Management Symposium NOMS 2006, 2006
    Co-Authors: M. Harvan, Jürgen Schönwälder
    Abstract:

    The anonymization of SNMP traffic traces requires an IP address anonymization scheme which is prefix-preserving and Lexicographical-Order-preserving. We present an anonymization scheme satisfying these two requirements which has been derived from the prefix-preserving cryptography-based scheme Crypto-PAn. We formally prove the correctness of the scheme and we describe an embeddable implementation. Limits of the proposed anonymization scheme and some security aspects are discussed as well.

M. Harvan - One of the best experts on this subject based on the ideXlab platform.

  • Prefix- and Lexicographical-Order-preserving IP Address Anonymization
    2006 IEEE/IFIP Network Operations and Management Symposium NOMS 2006, 2006
    Co-Authors: M. Harvan, Jürgen Schönwälder
    Abstract:

    The anonymization of SNMP traffic traces requires an IP address anonymization scheme which is prefix-preserving and Lexicographical-Order-preserving. We present an anonymization scheme satisfying these two requirements which has been derived from the prefix-preserving cryptography-based scheme Crypto-PAn. We formally prove the correctness of the scheme and we describe an embeddable implementation. Limits of the proposed anonymization scheme and some security aspects are discussed as well

  • NOMS - Prefix- and Lexicographical-Order-preserving IP Address Anonymization
    2006 IEEE IFIP Network Operations and Management Symposium NOMS 2006, 2006
    Co-Authors: M. Harvan, Jürgen Schönwälder
    Abstract:

    The anonymization of SNMP traffic traces requires an IP address anonymization scheme which is prefix-preserving and Lexicographical-Order-preserving. We present an anonymization scheme satisfying these two requirements which has been derived from the prefix-preserving cryptography-based scheme Crypto-PAn. We formally prove the correctness of the scheme and we describe an embeddable implementation. Limits of the proposed anonymization scheme and some security aspects are discussed as well.

Tetsuo Deguchi - One of the best experts on this subject based on the ideXlab platform.

  • Heisenberg model and Rigged Configurations
    Journal of Statistical Mechanics: Theory and Experiment, 2015
    Co-Authors: Pulak Ranjan Giri, Tetsuo Deguchi
    Abstract:

    We show a correspondence of all the solutions of the spin-1/2 isotropic Heisenberg model for N=12 to the rigged configurations based on the comparison of the set of Takahashi quantum numbers in Lexicographical Order with the set of riggings of the rigged configurations in co-Lexicographical Order.

  • Heisenberg model and rigged configurations
    Journal of Statistical Mechanics: Theory and Experiment, 2015
    Co-Authors: Pulak Ranjan Giri, Tetsuo Deguchi
    Abstract:

    We show a correspondence of all the solutions of the Bethe ansatz equations of the one-dimensional spin-1/2 isotropic Heisenberg model with periodic boundary conditions for N = 12 to the rigged configurations. This mapping is based on the comparison of the set of Takahashi quantum numbers arranged in Lexicographical Order with the set of riggings of the rigged configurations arranged in co-Lexicographical Order.

Pulak Ranjan Giri - One of the best experts on this subject based on the ideXlab platform.

  • Heisenberg model and Rigged Configurations
    Journal of Statistical Mechanics: Theory and Experiment, 2015
    Co-Authors: Pulak Ranjan Giri, Tetsuo Deguchi
    Abstract:

    We show a correspondence of all the solutions of the spin-1/2 isotropic Heisenberg model for N=12 to the rigged configurations based on the comparison of the set of Takahashi quantum numbers in Lexicographical Order with the set of riggings of the rigged configurations in co-Lexicographical Order.

  • Heisenberg model and rigged configurations
    Journal of Statistical Mechanics: Theory and Experiment, 2015
    Co-Authors: Pulak Ranjan Giri, Tetsuo Deguchi
    Abstract:

    We show a correspondence of all the solutions of the Bethe ansatz equations of the one-dimensional spin-1/2 isotropic Heisenberg model with periodic boundary conditions for N = 12 to the rigged configurations. This mapping is based on the comparison of the set of Takahashi quantum numbers arranged in Lexicographical Order with the set of riggings of the rigged configurations arranged in co-Lexicographical Order.

Xin Wang - One of the best experts on this subject based on the ideXlab platform.

  • Lexicographical Order max min fair source quota allocation in mobile delay tolerant networks
    International Workshop on Quality of Service, 2016
    Co-Authors: Dongliang Xie, Xin Wang
    Abstract:

    There is a big potential to enable more efficient data dissemination in mobile Delay-Tolerant Networks (DTNs) with the concurrent use of multi-copy forwarding and social metrics. However, this also leads to the possibility of severely overloading the relay nodes with high social metrics, and consequent performance degradation. We propose a fair source quota allocation algorithm to effectively alleviate the load while ensuring their dissemination fairness, i.e, Lexicographical Order Max-Min Fairness(LMMF). In this paper, A fair source quota allocation algorithm along with an implementation scheme was presented to take advantage of the features of social networks and social forwarding for higher delivery performance. Extensive simulations based on trace data demonstrate that our mechanism greatly reduces the delivery-ratio degradation caused by uneven load while ensuring fairness among the network users.

  • IWQoS - Lexicographical Order Max-Min fair source quota allocation in mobile Delay-Tolerant Networks
    2016 IEEE ACM 24th International Symposium on Quality of Service (IWQoS), 2016
    Co-Authors: Dongliang Xie, Xin Wang
    Abstract:

    There is a big potential to enable more efficient data dissemination in mobile Delay-Tolerant Networks (DTNs) with the concurrent use of multi-copy forwarding and social metrics. However, this also leads to the possibility of severely overloading the relay nodes with high social metrics, and consequent performance degradation. We propose a fair source quota allocation algorithm to effectively alleviate the load while ensuring their dissemination fairness, i.e, Lexicographical Order Max-Min Fairness(LMMF). In this paper, A fair source quota allocation algorithm along with an implementation scheme was presented to take advantage of the features of social networks and social forwarding for higher delivery performance. Extensive simulations based on trace data demonstrate that our mechanism greatly reduces the delivery-ratio degradation caused by uneven load while ensuring fairness among the network users.