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

Keyword Search Result

[Keyword] traffic design(3hit)

1-3hit
  • Characterization of Movie Contents and Its Impact for Traffic Design

    Arata KOIKE  Satoko TAKIGAWA  Kiyoka TAKEDA  Akihisa KOBAYASHI  Masashi MORIMOTO  Konosuke KAWASHIMA  

     
    PAPER-Traffic Control in CDNs

      Vol:
    E86-B No:6
      Page(s):
    1839-1848

    In this paper, we first investigate the characteristics of movie contents over the Internet. As in the previous studies, we found the lognormal-distribution well fits the distribution of file size for the whole set of general movie contents. When we specifically focus on the subset that consists of movie trailers, however, it shows different distribution from the lognormal-distribution. Our analysis shows it is similar to an exponential-distribution. We here assume that movie trailers are one of the relevant contents for Contents Delivery Networks (CDN) or Peer-to-Peer (P2P) file exchange communities. We further studies the relationship between playing duration and file size for the movie trailers and we did not find any linear correlation among them. We next consider bandwidth requirements to retrieve movie trailer contents. Our objective is to make it possible for user to view the contents in real-time. Many previous studies investigate bandwidth requirement based only on the file size distribution. In this paper, we analyze the traffic design criteria for CDN or P2P by taking into account both of the results for the file size distribution and the relationship between playing duration and file size for movie trailers. Simulation studies reveal the impact for the bandwidth requirement.

  • Mobility Management Schemes and Their Characteristics for Advanced Personal Communication Services in Distributed Environments

    Hideaki YOSHINO  Hisao YAMAMOTO  Hideaki MATSUE  

     
    PAPER-Communication Networks and Services

      Vol:
    E81-B No:6
      Page(s):
    1162-1170

    A mobility management scheme that reduces signaling traffic load and connection setup time is a pivotal issue in designing future personal communication service (PCS) networks to satisfy Quality of Services requirements and use network resources efficiently. Particularly, required is scalable mobility management, to meet the explosive growth in number of users for the current second-generation wireless communication systems, and to materialize PCS concepts such as terminal, personal, and service mobility. Many mobility management schemes have been proposed for the reduction of signaling traffic. However, these schemes have not been sufficiently compared using a unified performance measure that is free of assumptions as to mobility model or database architecture. In this paper, we categorize the various mobility management schemes for advanced PCSs in distributed environments into four types and clarify the appropriate domain for each type. To do this, we settled on the number of signals at connection setup and location registration as a unified performance measure, since this value closely relates to connection setup time and network efficiency. We found two kinds of schemes with replicating and caching functions of user information that are extremely effective for reducing signaling load and hence connection setup time. These schemes are appropriate when the probability that a user is in his/her home area is relatively small or the connection setup rate is relatively high compared to the location registration rate. These are the most likely situations in the advanced PCS for global environments.

  • Traffic Design and Administration for Distributed Adaptive Channel Assignment Method in Microcellular Systems

    Arata KOIKE  Hideaki YOSHINO  

     
    PAPER-Radio Communication

      Vol:
    E78-B No:3
      Page(s):
    379-386

    In improving channel utilization in microcellular systems, adaptive channel allocation using distributed control has been reported to be effective. We describe an analytical approximation algorithm for channel dimensioning of distributed adaptive channel allocation. We compare our analytical results with simulation results and show the characteristics of permissible load as a function of the number of base station channels based on our method. Finally we illustrate traffic design and administration based on our algorithm.