interconnection network (IN) of packet routers. Implicitly, the traditional IN architectu'/> Webwave: Large scale load balanced content distribution.
首页> 外文学位 >Webwave: Large scale load balanced content distribution.
【24h】

Webwave: Large scale load balanced content distribution.

机译:Webwave:大规模负载平衡的内容分发。

获取原文
获取原文并翻译 | 示例

摘要

The Internet's primary function has been to universally connect clients to servers, using an interconnection network (IN) of packet routers. Implicitly, the traditional IN architecture ties each logical server to one physical server, placed at one network location. As a result, when large fractions of the client population converge simultaneously on a small subset of servers, they create hot spots of demand for server resources. Another consequence of the IN model is that the physical distance between a server and its client is so large that packet propagation delay is prohibitively slow for most interactive applications, and the probability of network congestion is increased.; This dissertation pursue an alternative model of the Internet, that of a computing network (CN), that solves the IN's problems. A CN consists of a set of intermediate servers that can acquire some of the functionality of origin servers. The CN directs client requests to a nearby intermediate server that acts on behalf of the origin. Hot-spot load is diffused across shared intermediate servers. The network distance between clients and intermediate servers is much shorter than between clients and origin servers, thus reducing packet propagation delay and network congestion.; The main difficulties in designing a CN are: (a) each logical origin server is tied to a rapidly changing set of intermediate servers, complicating resource discovery, and (b) large scale replication of origin server functionality must be controlled. We solve these problems under the additional constraint of smoothly evolving the current IN architecture into a CN.; Our solution starts with a new architecture and formal model of a CN, in which intermediate servers are attached to packet routers to form a forest of trees, each rooted at an origin server. Clients represent leaf nodes. We present a novel distributed algorithm (WebWave) for large-scale replication control that provably satisfies a new algorithmic definition of global load-balance. A simulation study provides evidence for fast convergence, consistent with known properties of similar algorithms, and suggests that WebWave consumes reasonable amounts of storage. We conclude with a practical design for implementing our CN architecture and WebWave within the context of the current Internet.
机译:互联网的主要功能是使用分组路由器的互连网络(IN)将客户端普遍连接到服务器。隐式地,传统的IN体系结构将每个逻辑服务器绑定到位于一个网络位置的一台物理服务器。结果,当大部分客户群同时聚集在一小部分服务器上时,它们会产生对服务器资源需求的 hotspot 。 IN模型的另一个结果是,服务器与客户端之间的物理距离非常大,以至于大多数交互式应用程序的数据包传播延迟都非常缓慢,并且网络拥塞的可能性增加了。本文寻求一种解决Internet问题的Internet替代模型,即计算网络(CN)。 CN由一组中间服务器组成,这些服务器可以获取原始服务器的某些功能。 CN将客户端请求定向到代表源的附近中间服务器。热点负载分散在共享的中间服务器之间。客户端与中间服务器之间的网络距离比客户端与原始服务器之间的网络距离短得多,从而减少了数据包传播延迟和网络拥塞。设计CN的主要困难是:(a)每个逻辑原始服务器都与一组快速变化的中间服务器绑定在一起,这使资源发现变得复杂,并且(b)必须控制原始服务器功能的大规模复制。我们在将当前的IN体系结构顺利发展为CN的额外约束下解决了这些问题。我们的解决方案从CN的新架构和正式模型开始,其中将中间服务器连接到分组路由器以形成一棵树的林,每棵树都源于原始服务器。客户代表叶节点。我们提出了一种用于大规模复制控制的新颖分布式算法(WebWave),该算法可证明满足全局负载均衡的新算法定义。仿真研究提供了与类似算法的已知属性一致的快速收敛的证据,并建议WebWave消耗合理数量的存储。我们以在当前Internet上下文中实现CN架构和WebWave的实用设计作为结束。

著录项

  • 作者

    Mirdad, Sulaiman A.;

  • 作者单位

    Boston University.;

  • 授予单位 Boston University.;
  • 学科 Computer Science.
  • 学位 Ph.D.
  • 年度 2001
  • 页码 85 p.
  • 总页数 85
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 自动化技术、计算机技术;
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号