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

Cheon Won Choi - One of the best experts on this subject based on the ideXlab platform.

  • ICN (1) - Uni- source and multi-source m -ary tree algorithms for best effort Service in wireless MAN
    Networking - ICN 2005, 2005
    Co-Authors: Jin Kyung Park, Woo Cheol Shin, Cheon Won Choi
    Abstract:

    IEEE 802.16 WirelessMAN standard specifies the air interface of broadband wireless access systems providing multiple Services. In the wireless MAN, the best effort Service class is ranked on the lowest position in priority and is assisted by a MAC scheme based on reservation ALOHA. In such a MAC scheme, a collision of resource requests is unavoidable so that wireless MAN standard adopted a truncated binary exponential backoff algorithm to arbitrate request attempts. However, it was revealed that a truncated binary exponential backoff algorithm may deteriorate delay and throughput performance due to its capture or starvation effect. Aiming at improving such performance, we propose uni-source and multi-source m-ary tree algorithms as alternatives to resolve request collisions in a wireless MAN. For the uni-source m-ary tree algorithm, we first develop an analytical method to calculate the maximum throughput. Secondly, using the analytical method as well as simulation method, we evaluate maximum throughput, mean and variance of MAC PDU delay. From numerical results, we confirm that proposed algorithms invoke superior delay and throughput performance to a truncated binary exponential backoff algorithm.

  • Demand and grant MAC schemes for best effort Service in wireless MAN
    VTC-2005-Fall. 2005 IEEE 62nd Vehicular Technology Conference 2005., 1
    Co-Authors: Jin Kyung Park, Woo Cheol Shin, Cheon Won Choi
    Abstract:

    In the IEEE 802.16 Wireless MAN standard, the best effort Service class is ranked on the lowest position in priority and is assisted by a MAC scheme based on reservation ALOHA. The details of the MAC scheme, however, are not specified in the standard. In this paper, we present the rules for deciding the amount of resource to demand as well as the rules for deciding the amount of resource to grant. Combining these rules, we then construct candidate MAC schemes for the best effort Service. In designing a MAC scheme for the best effort Service, the throughput and delay performance must be considered since only scarce resource may be available after resource is preferably granted to other Service classes. For the performance evaluation, we thus develop a numerical method to approximately calculate the throughput in the saturated environment. Using the approximation and simulation methods, we then investigate the throughput and delay performance exhibited by each candidate MAC scheme. From the numerical results, we observe that the exhaustive demand rule paired with the full grant rule shows superior performance.

Michael Welzl - One of the best experts on this subject based on the ideXlab platform.

  • WONS - Less-than-Best-Effort Service for Community Wireless Networks: Challenges at three layers
    2014 11th Annual Conference on Wireless On-demand Network Systems and Services (WONS), 2014
    Co-Authors: Michael Welzl, Stein Gjessing, Naeem Khademi
    Abstract:

    Community Wireless Networks can be a way to make “Internet access for everyone” possible, by sharing a broadband Internet connection via WLAN. The underlying idea is to freely provide network access to anybody in the vicinity of the wireless access point via a Lower-than-Best-Effort (LBE) Service, such that non-paying users interfere as little as possible with the “regular” Internet usage. Such a Service faces challenges at various network layers; this paper discusses some of them, focusing on layers 2, 3 and 4.

  • Less-than-Best-Effort Service: A Survey of End-to-End Approaches
    IEEE Communications Surveys & Tutorials, 2013
    Co-Authors: David Ros, Michael Welzl
    Abstract:

    This paper provides a survey of transport protocols and congestion control mechanisms that are designed to have a smaller bandwidth and/or delay impact on standard TCP than standard TCP itself when they share a bottleneck with it. Such protocols and mechanisms provide what is sometimes called a less-than-Best-Effort or lower than Best-Effort Service. To a user, such a Service can, for instance, be an attractive choice for applications which create traffic that is considered less urgent than that of others—e.g., automatic backup, software updates running in the background, or peer-to-peer applications. The focus of this survey is on end-host approaches for achieving a less-than-Best-Effort Service. This includes e.g. upper-layer methods, or techniques that leverage standard transport-layer mechanisms so as to reduce the impact on other competing flows.

  • A survey of lower-than-Best-Effort transport protocols. RFC 6297, IETF.
    2011
    Co-Authors: Michael Welzl, David Ros Sanchez
    Abstract:

    This document provides a survey of transport protocols which are designed to have a smaller bandwidth and/or delay impact on standard TCP than standard TCP itself when they share a bottleneck with it. Such protocols could be used for low-priority "background" traffic, as they provide what is sometimes called a "less than" (or "lower than") Best-Effort Service.

Hui Zhang - One of the best experts on this subject based on the ideXlab platform.

  • Service disciplines for guaranteed performance Service in packet switching networks
    Proceedings of the IEEE, 1995
    Co-Authors: Hui Zhang
    Abstract:

    While today's computer networks support only Best-Effort Service, future packet-switching integrated-Services networks will have to support real-time communication Services that allow clients to transport information with performance guarantees expressed in terms of delay, delay jitter, throughput, and loss rate. An important issue in providing guaranteed performance Service is the choice of the packet Service discipline at switching nodes. In this paper, we survey several Service disciplines that are proposed in the literature to provide per-connection end-to-end performance guarantees in packet-switching networks. We describe their mechanisms, their similarities and differences and the performance guarantees they can provide. Various issues and tradeoffs in designing Service disciplines for guaranteed performance Service are discussed, and a general framework for studying and comparing these disciplines are presented. >

Jin Kyung Park - One of the best experts on this subject based on the ideXlab platform.

  • ICN (1) - Uni- source and multi-source m -ary tree algorithms for best effort Service in wireless MAN
    Networking - ICN 2005, 2005
    Co-Authors: Jin Kyung Park, Woo Cheol Shin, Cheon Won Choi
    Abstract:

    IEEE 802.16 WirelessMAN standard specifies the air interface of broadband wireless access systems providing multiple Services. In the wireless MAN, the best effort Service class is ranked on the lowest position in priority and is assisted by a MAC scheme based on reservation ALOHA. In such a MAC scheme, a collision of resource requests is unavoidable so that wireless MAN standard adopted a truncated binary exponential backoff algorithm to arbitrate request attempts. However, it was revealed that a truncated binary exponential backoff algorithm may deteriorate delay and throughput performance due to its capture or starvation effect. Aiming at improving such performance, we propose uni-source and multi-source m-ary tree algorithms as alternatives to resolve request collisions in a wireless MAN. For the uni-source m-ary tree algorithm, we first develop an analytical method to calculate the maximum throughput. Secondly, using the analytical method as well as simulation method, we evaluate maximum throughput, mean and variance of MAC PDU delay. From numerical results, we confirm that proposed algorithms invoke superior delay and throughput performance to a truncated binary exponential backoff algorithm.

  • Demand and grant MAC schemes for best effort Service in wireless MAN
    VTC-2005-Fall. 2005 IEEE 62nd Vehicular Technology Conference 2005., 1
    Co-Authors: Jin Kyung Park, Woo Cheol Shin, Cheon Won Choi
    Abstract:

    In the IEEE 802.16 Wireless MAN standard, the best effort Service class is ranked on the lowest position in priority and is assisted by a MAC scheme based on reservation ALOHA. The details of the MAC scheme, however, are not specified in the standard. In this paper, we present the rules for deciding the amount of resource to demand as well as the rules for deciding the amount of resource to grant. Combining these rules, we then construct candidate MAC schemes for the best effort Service. In designing a MAC scheme for the best effort Service, the throughput and delay performance must be considered since only scarce resource may be available after resource is preferably granted to other Service classes. For the performance evaluation, we thus develop a numerical method to approximately calculate the throughput in the saturated environment. Using the approximation and simulation methods, we then investigate the throughput and delay performance exhibited by each candidate MAC scheme. From the numerical results, we observe that the exhaustive demand rule paired with the full grant rule shows superior performance.

Woo Cheol Shin - One of the best experts on this subject based on the ideXlab platform.

  • ICN (1) - Uni- source and multi-source m -ary tree algorithms for best effort Service in wireless MAN
    Networking - ICN 2005, 2005
    Co-Authors: Jin Kyung Park, Woo Cheol Shin, Cheon Won Choi
    Abstract:

    IEEE 802.16 WirelessMAN standard specifies the air interface of broadband wireless access systems providing multiple Services. In the wireless MAN, the best effort Service class is ranked on the lowest position in priority and is assisted by a MAC scheme based on reservation ALOHA. In such a MAC scheme, a collision of resource requests is unavoidable so that wireless MAN standard adopted a truncated binary exponential backoff algorithm to arbitrate request attempts. However, it was revealed that a truncated binary exponential backoff algorithm may deteriorate delay and throughput performance due to its capture or starvation effect. Aiming at improving such performance, we propose uni-source and multi-source m-ary tree algorithms as alternatives to resolve request collisions in a wireless MAN. For the uni-source m-ary tree algorithm, we first develop an analytical method to calculate the maximum throughput. Secondly, using the analytical method as well as simulation method, we evaluate maximum throughput, mean and variance of MAC PDU delay. From numerical results, we confirm that proposed algorithms invoke superior delay and throughput performance to a truncated binary exponential backoff algorithm.

  • Demand and grant MAC schemes for best effort Service in wireless MAN
    VTC-2005-Fall. 2005 IEEE 62nd Vehicular Technology Conference 2005., 1
    Co-Authors: Jin Kyung Park, Woo Cheol Shin, Cheon Won Choi
    Abstract:

    In the IEEE 802.16 Wireless MAN standard, the best effort Service class is ranked on the lowest position in priority and is assisted by a MAC scheme based on reservation ALOHA. The details of the MAC scheme, however, are not specified in the standard. In this paper, we present the rules for deciding the amount of resource to demand as well as the rules for deciding the amount of resource to grant. Combining these rules, we then construct candidate MAC schemes for the best effort Service. In designing a MAC scheme for the best effort Service, the throughput and delay performance must be considered since only scarce resource may be available after resource is preferably granted to other Service classes. For the performance evaluation, we thus develop a numerical method to approximately calculate the throughput in the saturated environment. Using the approximation and simulation methods, we then investigate the throughput and delay performance exhibited by each candidate MAC scheme. From the numerical results, we observe that the exhaustive demand rule paired with the full grant rule shows superior performance.