The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] bandwidth guarantee(3hit)

1-3hit
  • Public WLAN Virtualization for Multiple Services

    Kazuhiko KINOSHITA  Kazuki GINNAN  Keita KAWANO  Hiroki NAKAYAMA  Tsunemasa HAYASHI  Takashi WATANABE  

     
    PAPER-Network

      Pubricized:
    2018/10/10
      Vol:
    E102-B No:4
      Page(s):
    832-844

    The recent widespread use of high-performance terminals has resulted in a rapid increase in mobile data traffic. Therefore, public wireless local area networks (WLANs) are being used often to supplement the cellular networks. Capacity improvement through the dense deployment of access points (APs) is being considered. However, the effective throughput degrades significantly when many users connect to a single AP. In this paper, users are classified into guaranteed bit rate (GBR) users and best effort (BE) users, and we propose a network model to provide those services. In the proposed model, physical APs and the bandwidths are assigned to each service class dynamically using a virtual AP configuration and a virtualized backhaul network, for reducing the call-blocking probability of GBR users and improving the satisfaction degree of BE users. Finally, we evaluate the performance of the proposed model through simulation experiments and discuss its feasibility.

  • Resource Allocation Method of Service Chaining for Guaranteeing Minimum Bandwidth and High Resource Utilization

    Hirofumi YAMAZAKI  Konomi MOCHIZUKI  Shunsuke HOMMA  Koji SUGISONO  Masaaki OMOTANI  

     
    PAPER-Network

      Pubricized:
    2016/07/19
      Vol:
    E100-B No:1
      Page(s):
    98-109

    Service chaining (SC) is a method for realizing a service by transferring flows among several service functions (SFs) that process packets. A route among SFs is called a service path (SP). Service chaining is being developed to reduce costs, increase flexibility, and shorten time-to-market. SC technologies are expected to be applied to carrier networks so that large communication carriers benefit from them. We assume that SPs process the traffic of services that treat all users in the same way such as an Internet access service for home users. An SP processes flows from several users. We do not assume that each SP is assigned to a user. Because a carrier network accommodates many users, each service will be heavily utilized. Therefore, it is assumed that the amount of traffic of a service is larger than the resource of an SF apparatus. Several SPs are required to process the traffic. SPs are supposed to meet two requirements. One is guaranteeing minimum bandwidth. The other is reducing the number of SF apparatuses, i.e., high resource utilization. Resource utilization depends on the combination of the resource quantities of SF apparatuses. Network operators have to determine the bandwidth of each SP within the range from the minimum bandwidth to the resource quantities of SF apparatuses to maximize resource utilization. Methods for determining the bandwidth of each SP have not been proposed for meeting the two requirements. Therefore, we propose a resource allocation method for this purpose. The proposed method determines the bandwidth of each SP on the basis of the combination of the resource quantities of SF apparatuses for guaranteeing the minimum bandwidth and maximizing resource utilization and allocates necessary resources to each SP. We also evaluate the proposed method and confirm that it can guarantee the minimum bandwidth of SPs and achieve high resource utilization regardless of the combination of the resource quantities of SF apparatuses. Although SF apparatuses are generally produced without considering the combinations of resource quantities of SF apparatuses in SPs, the proposed method can provide more options for selecting SF apparatuses.

  • A Scheme of IEEE 802.11e HCCA Polling and Queue Management for Bandwidth Guarantee per Session

    Young-Hwan KIM  Jung-Bong SUK  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E94-B No:6
      Page(s):
    1680-1689

    Video applications such as video conferencing among multiple users and video surveillance systems require multiple video connections and QoS guarantee. These days the video systems equipped with IEEE 802.11 LAN interfaces allows a broadband wireless access to the Internet at a reasonable price. However, according to the current IEEE 802.11e HCCA standard, if more than two video sessions are to be established simultaneously, some of them must share the TXOP because the available number of TSIDs for video transmission is restricted to two. In order to resolve this problem, we devise a scheme which can establish up to 13 video sessions by slightly modifying the frame structure while maintaining the compatibility with the current standard. Our scheme is implemented on the NCTUns 4.0 network simulator, and evaluated numerically in terms of throughput, delay, and PSNR. Also real video clips are used as input to our simulation. The results showed that our scheme guarantees the transmission bandwidth requested by each video session.