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

Keyword Search Result

[Keyword] expiration time(2hit)

1-2hit
  • Route Selection Metrics in Wireless Mobile Ad Hoc Networks

    Md. Ifte Khairul HASAN  Saburo TAKAHASHI  Jun-ichi HAKODA  Hideyuki UEHARA  Mitsuo YOKOYAMA  

     
    LETTER-Communication Theory

      Vol:
    E88-A No:10
      Page(s):
    2952-2955

    In this study, we present a way to choose route selection metric while discovering a new route in ad hoc mobile networks. We have used link expiration time and busy rate to calculate the route cost. The route cost is compared to a threshold value to decide whether the traffic of the route is high or low. If it is high then the system chooses busy rate as a route selection metric to avoid traffic congestion and if it is low the link expiration time is used to select the longlasting route. We have examined the characteristics of the routing protocol by computer simulation and found that it over performs the conventional protocols.

  • Effective Reference Probability Incorporating the Effect of Expiration Time in Web Cache

    Jeong-Joon LEE  Kyu-Young WHANG  Yang-Sae MOON  Eui-Kyung HONG  

     
    PAPER-Databases

      Vol:
    E84-D No:9
      Page(s):
    1184-1197

    Web caching has become an important problem when addressing the performance issues in Web applications. The expiration time of the Web data item is useful a piece of information for performance enhancement in Web caching. In this paper, we introduce the notion of the effective reference probability that incorporates the effect of expiration time for Web caching. For a formal approach, we propose the continuous independent reference model extending the existing independent reference model. Based on this model, we define formally the effective reference probability and derive it theoretically. By simply replacing the reference probability in the existing cache replacement algorithms with the effective reference probability, we can take the effect of expiration time into account. The results of performance experiments show that the replacement algorithms using the effective reference probability always outperform existing ones. In particular, when the cache fraction is 0.05 and data update is comparatively frequent (i.e., the update frequency is more than 1/10 of the reference frequency), the performance is enhanced by more than 30% in LRU-2 and 13% in Aggarwal's method. The results show that the effective reference probability significantly enhances the performance of Web caching when the expiration time is given.