１．日時　　9月28日(火)　3：30-5：00　p.m.
２．場所　　広島市立大学　小講堂　
３．講師　　オハイオ州立大学　教授　Ming T. Liu
４．題目　　CNP: A Dynamic Web Caching Protocol

講師略歴：
　　Ming T. (Mike) Liu received his PhD degree from the University of Pennsylvania in 1964. He joined The Ohio State University in 1969, where he is currently a professor in the Dept. of Computer and Information Science. His areas of interest include computer architecture, parallel and distributed processing, and computer networking. He was general and program chair of several international conferences (ICDE, ICDCS, ICNP, ICPP), and served as EIC and Editor of several international journals. He is a Fellow of the IEEE.
Currently he is on the Board of Governors of the IEEE Computer Society and serves as General Co-chair of ICPP-99 (University of Aizu), ICDCS-2000 (Taipei, Taiwan) and SAINT-2001 (San Diego, California), among others.

講演内容：
　　 The Internet is a rising tide of information, providing us with communications and content that are critical for conducting our daily work and business. However, the average Internet request for information makes 19 hops before reaching its final destination. To reduce the response time of a request, one practical solution is the so-called Web Caching: bring the requested information closer to us, where we can access it more quickly. During the past years, there are a range of caching protocols that have been proposed and implemented in the Internet, including CERN, Harvest, Squid-ICP, and Squid-Cashe Digest.
　　 In this talk, we will propose a dynamic Web caching protocol, Caching Neighborhood Protocol (CNP), that utilizes the accessing characteristics of the proxy traces. We will compare major differences between the aforementioned statc approaches and our dynamic approach, and we will show how CNP can handle the problems common to the static Web caching hierachy schemes, such as slow response time and rendering of incoherent information (documents, pages). By modeling the request handling steps for Web caching, we will show that CNP can outperform all other static approaches in terms of providing the shortest response time for the target document whose size (2K Bytes) is about the median of the sizes for the requested Web documents.

　　　　詳細につきましては角田 (4450) までお問い合わせ下さい．