Responsive image
博碩士論文 etd-0704100-144037 詳細資訊
Title page for etd-0704100-144037
論文名稱
Title
以XML方式實現網頁群組與預傳
XML Enabled Page-Grouping
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
62
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2000-06-23
繳交日期
Date of Submission
2000-07-04
關鍵字
Keywords
None
Pre-Fetching, Page-Grouping, XML
統計
Statistics
本論文已被瀏覽 5628 次,被下載 38
The thesis/dissertation has been browsed 5628 times, has been downloaded 38 times.
中文摘要
None
Abstract
As more and more services are provided via WWW, how to reduce the perceived delay in WWW interaction becomes very import to the service providers to keep their users. Pre-fetching is an important technique for reducing latency in distributes systems like the WWW. Page pre-fetching takes advantage of local machine idle period of user viewing current page to deliver pages that user like to access in the near future. Being motivated by pre-fetching ideas and its practical bothers, we propose a server-initiated page pre-fetching method: XML enabled page-grouping to reduce Web latency.
In our page-grouping scheme, we anticipate the page that user will like to access in the near future based on hyperlink and referral access probabilities of each page. The predictive pages are grouped and converted into a XML file embedding in the page that user currently requests. If the user clicks the predictive linked page, the corresponding HTML is regenerated directly from the embedded XML document. The proposed scheme allows alternative of batch grouping or on-line grouping. For the reason of avoiding server extra load, we suggest that the task of grouping static pages is performed periodically at server off-peak loading time. Beside static pages, we also hope to group dynamic page generated by CGI and illustrate the feasibility with an example of Web-based database query.
When compared to previous page pre-fetching techniques, our page-grouping method has simplicity and practicability. By using XML document, add-on application modules are no more needed because that the XML processor is supported in new generator browsers like Microsoft IE 5.0. Furthermore, the way of converting grouping pages into embedded XML document makes predictive pages transparent to the proxy servers and the server side speculative service can work no matter whether there are proxy servers between the server and clients.
Using trace simulations based on the logs of HTTP server http://www.kcg.gov.tw, we show that 67.84% URL request is referral request. It means that the probability is about 2/3 that users retrieve next Web page by clicking hyperlinks on currently viewing page. The logs are categorized according to the kind of official service. And the statistical results of every class of logs indicate that page always has a persistent referral access probabilities for a few days. It encourages us to get high hit rate of a predictive page by selecting it according to its high referral access probability.
Considering bandwidth tradeoff, we discuss hit rate, traffic increase due to grouping and traffic intensity based on M/M/1 model.
For online grouping of dynamic page, we take an example of database querying page on our simulating HTTP server. The experiment result leads to the conclusion that page grouping of pages of Web-based database querying can reduce server load of CGI processing, as the hit rate of the next page is about 18.48%.
目次 Table of Contents
Abstract
Contents
List of Figures and Tables
Chapter 1 Introduction and Motivation 1-1
1.1 Perceived latency in WWW 1-1
1.2 Page pre-fetching 1-3
1.3 Motivation 1-4
Chapter 2 Background and Related work 2-1
2.1 HTTP, HTML, and TCP connection 2-1
2.1.1 HTTP 2-1
2.1.2 HTML 2-2
2.1.3 TCP connection overview 2-3
2.1.4 Message and packet exchanges in HTTP 2-3
2.2 Problem of the Web delay 2-4
2.2.1 Web latency sources discussion 2-5
2.2.2 Solutions for Web delay 2-6
2.3 Works related to page pre-fetching 2-7
2.3.1 Domination of pre-fetching 2-7
2.3.2 Criteria for deciding pre-fetching 2-9
2.3.3 Consideration in pre-fetching algorithm 2-10
Chapter 3 Page-grouping using XML 3-1
3.1 XML overview 3-1
3.2 Why XML 3-2
Chapter 4 Scheme Design and Logs Trace Evaluation 4-1
4.1 Scheme model 4-3
4.1.1 Batch grouping model 4-3
4.1.2 Online grouping model 4-4
4.2 Logs file collection 4-5
4.2.1 Web surfing on hyperlink 4-6
4.2.2 Access probability versus hit rate 4-7
4.3 Page-selecting module 4-8
4.4 Page-grouping module 4-9
4.5 Result and discussions 4-11
4.5.1 Improvement in delay time 4-11
4.5.2 Viewing time of x-page and retrieving time of grouping page 4-12
4.5.3 Consideration of network traffic condition 4-13
4.6 Measurement in page-grouping of database query page 4-15
4.7 System Implementation 4-16
4.7.1 System Flow (Figure 4.13) 4-16
4.7.2 Page-selecting algorithm 4-17
4.7.3 Page-grouping algorithm 4-20
Chapter 5 Contributions of XML enabled Page-Grouping 5-1
5.1 No additional application module 5-1
5.2 Only one request for grouped pages 5-2
5.3 Applying to both static pages and Web database queries 5-3
5.4 Improvement when considering proxy server 5-3
5.4.1 Cache policy 5-4
5.4.2 Page consistency 5-4
5.4.3 Transparent to the proxy 5-4
5.4.4 Page-grouping chain 5-6
5.4.5 Proxy load and network load between client and proxy 5-6
Chapter 6 Conclusion and Future work 6-1
6.1 Conclusion 6-1
6.2 Future work 6-1
References
參考文獻 References
[1] Jeffrey Mogul, “The Case for Persistent-Connection HTTP”, in Proceedings of ACM SIGCOMM’95 Oct 1995.
[2] R. Fielding, J. Gettys, J. Mogul, H. Frystyk and T. Berners-Lee, “Hypertext Transfer Protocol – HTTP/1.1”, RFC 2068, January 1997.
[3] E. Krishnamurthy and C. E. Wills, “Improving end-to-end performance of the web using server volumes and proxy filters”, in Proceedings ACM SIGCOMM, September 1998.
[4] H. Lei and D. Duchamp, “An analytical approach to file prefetching.” In Proceedings USENIX Annual Technical Conference, Jan. 1997.
[5] Mark Crovella and Paul Barford, “The Network Effects of Pre-fetching”, INFOCOM’98 Seventeenth Annual Joint Conference of the IEEE Computer and Communication Societies. Proceedings. IEEE Volume: 3, 1998, Page(s): 1232-1239 vol. 3.
[6] World Wide Web Consortium (W3C). HTML 4.01 Specification. http://www.w3c.org/TR/1999/PR-html40-19990824
[7] http://www.w3c.org/Markup/.
[8] Schulzrinne, H. “World Widw Web: whence, whither, what next?” IEEE Network Volume: 102, March-April 1996, Page(s): 10-17.
[9] Venkata N. Padmanabhan, Jeffrey C. Moogul, “Improving HTTP Latency”, University of California – Berkeley, Digital Equipment Corporation Western Research Laboratory, October 1994.
[10] Simon Spero, “Analysis of HTTP Performance problems”, July 1994. http://www.w3c.org/Protocols/Papers.html.
[11] Jon B. Postel, “Transmission Control Protocol – TCP”, RFC 793, Network Information Center, SRI International, September 1981.
[12] Wang, Z., Crowcroft, J., “Prefetching in World Wide Web”, Global Telecommunications: The Key to Global Prosperity, 1996, Page(s):28-32
[13] Azer Bestavros, “Using speculation to reduce server load and service time on the WWW”. In Proceedings of CIKM’95: The Fourth ACM International Conference on Information and Knowledge Management, Baltimore, Maryland, November 1995
[14] Reinhard P. Klemm, Member, IEEE, “WebCompanion: A Friendly Client-Side Web Prefetching Agent”, IEEE Transactions on Knowledge and Data Engineering, Vol 11, No. 4, July/August 1999.
[15] Thomas M. Kroeger, Darrell D. E. Long, and Jeffrey C. Mogul, “Exploring the bounds of web latency reduction from caching and prefetching”, In Proceedings of USENIX Symposium on Internet Technology and System, Dec. 1997.
[16] Wcol Group. “WWW collector – the prefetching prooxy server for WWW”, http://shika.aistnara.ac.jp/products/wcol/wcol.html, 1997.
[17] Li Fan, Pei Cao, Wei Lin, Quinn Jacobson, “Web Prefetching Between Low-Bandwidth Clients and Proxies: Potential and Performance”, SIGMETRICS’99 5/99 Atlanta, Georgia, USA.
[18] Jiang, Z. Kleinrock, L. “An adaptive network prefetch scheme”, Selected Areas in Communications, IEEE Journal on Volume: 163, April 1998, Page(s): 358-368
[19] Yui-Wen Horng, Wen-Jou Lin, Hsing Mei, “Hybrid prefetching for WWW proxy servers”. Parallel and Distributed Systems, 1998. Proceedings. 1998 International Conference on,1998,Page(s):541-548
[20] Cunha, C.R.; Jaccoud, C.F.B. “Determining WWW user’s next acccess and its application to pre-fetching”. Computer and communications, 1997. Proceedings. Second IEEE Symposium on, 1997, Page(s):6-11
[21] Zhimei Jiang, Kleinrock, L. “Prefetching links on the WWW “. Communications, 1997. ICC’97 Montreal, Towards the Knowledge Millennium. 1997 IEEE International Conference On Volume:1, 19977, Page(s):483-489 vol.1.
[22] N. J. Tuah, M. Kumar, S.Venkatesh, “Investigation of a Prefetch Model for Low Bandwidth Networks”. WOWMOM 98 Dallas Texas USA.
[23] Cohen, E. Krishnamurthy, B. Rexford, J. “Efficient algorithms for predicting requests to Web servers”. INFOCOM’99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE Volume: 1, 1999, Page(s):284-293 vol.1
[24] World Wide Web Consortium (W3C). “Extensible Markup Language (XML) 1.0, 1998”. http://www.w3c.org/TR/1998/REC-xml-19980210
[25] Junho Shim, Peter Scheuermann, and Radek Vingralek, Member, IEEE, “Proxy Cache Algorithms: Design, Implementation, and Performance”, IEEE Transactions on Knowledge and Data Engineering, Vol., 11 No. 4, July/August 1999.
[26] H. Ouahid, A. Karmouch, “Converting Web pages into Well-formed XML Documents”, Communications, 1999. ICC '99. 1999 IEEE International Conference on, 1999, Page(s): 676 -680 vol. 1.
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:校內公開,校外永不公開 restricted
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus:永不公開 not available

您的 IP(校外) 位址是 18.191.157.186
論文開放下載的時間是 校外不公開

Your IP address is 18.191.157.186
This thesis will be available to you on Indicate off-campus access is not available.

紙本論文 Printed copies
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。
開放時間 available 已公開 available

QR Code