A novel approach for avoiding overload in the web crawling

Lavanya Pamulaparty, C. V. Rao, M. S. Rao
{"title":"A novel approach for avoiding overload in the web crawling","authors":"Lavanya Pamulaparty, C. V. Rao, M. S. Rao","doi":"10.1109/ICHPCA.2014.7045332","DOIUrl":null,"url":null,"abstract":"In comparison to human searchers, crawlers are capable of retrieving data in greater depth and more quickly. As a result, it can face crippling impact on the performance of the site. Inessential to say, if a particular crawler is carrying out numerous requests per second and/or, Therefore, in a scenario involving multiple crawlers, it would be difficult for a server to handle requests in case each crawler downloads large files and/or performs numerous requests/second. So to avoid the overloading in the retrieving data in the proposed system a sequence flow protocol(Leakey Bucket) is which retrieves the data in the sequence order and also proposed mobbing unrestricted router (MUR)(CFR) which maintains three phases inbound, peak and outbound. If the inbound flow is less than the peak it allows the crawling, and at the same time if the inbound is greater than or equal to height the MUR protocol stops the crawling and request for the server to extend network resource. Is used for retrieving the data in sequential order.","PeriodicalId":197528,"journal":{"name":"2014 International Conference on High Performance Computing and Applications (ICHPCA)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on High Performance Computing and Applications (ICHPCA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICHPCA.2014.7045332","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In comparison to human searchers, crawlers are capable of retrieving data in greater depth and more quickly. As a result, it can face crippling impact on the performance of the site. Inessential to say, if a particular crawler is carrying out numerous requests per second and/or, Therefore, in a scenario involving multiple crawlers, it would be difficult for a server to handle requests in case each crawler downloads large files and/or performs numerous requests/second. So to avoid the overloading in the retrieving data in the proposed system a sequence flow protocol(Leakey Bucket) is which retrieves the data in the sequence order and also proposed mobbing unrestricted router (MUR)(CFR) which maintains three phases inbound, peak and outbound. If the inbound flow is less than the peak it allows the crawling, and at the same time if the inbound is greater than or equal to height the MUR protocol stops the crawling and request for the server to extend network resource. Is used for retrieving the data in sequential order.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种避免网络爬行过载的新方法
与人类搜索器相比,爬行器能够更深入、更快地检索数据。因此,它可能会对站点的性能造成严重影响。不用说,如果一个特定的爬虫每秒执行大量请求和/或,因此,在涉及多个爬虫的场景中,如果每个爬虫下载大文件和/或每秒执行大量请求,服务器很难处理请求。为了避免系统中检索数据的过载,提出了一种按序列顺序检索数据的序列流协议Leakey Bucket,并提出了保持入、峰、出三个阶段的移动无限制路由器(MUR, CFR)。如果入站流量小于峰值,则允许爬行,同时,如果入站流量大于或等于高度,则MUR协议停止爬行并请求服务器扩展网络资源。用于按顺序检索数据。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
DE-FPA: A hybrid differential evolution-flower pollination algorithm for function minimization Ultra-thin Si directly on insulator (SDOI) MOSFETs at 20 nm gate length Secured packet inspection with hierarchical pattern matching implemented using incremental clustering algorithm Lifting biorthogonal wavelet design for edge detection Test case prioritization techniques “an empirical study”
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1