• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Parallel and Distributed Processing Techniques and Applications(PDPTA'05) vol.3; 20050627-30; Las Vegas,NV(US) >A Quorum Based Content Delivery Architecture
【24h】

A Quorum Based Content Delivery Architecture

机译：基于仲裁的内容交付体系结构

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this ever-growing world, the amount of information obtained by the human race is increasing at an exponential rate. However, along with this progress comes the need to develop the infrastructure to make this information accessible. Since a vast number of people are interested in accessing this information from a relatively small number of servers, an efficient algorithm must be developed and implemented to resolve this dilemma. It would be ideal that every user would be able to access only one server to get all the information. However, this is impractical due to storage limitations. It would also be inefficient because the data would have to be replicated and stored throughout multiple servers whenever a change was made to any or all of this information. This also leads the problem of mutual exclusion. If a server was updating the information, no information would be available to any other client on any other server. To make this information readily available, a new quorum-based scheme for managing this replicated data is developed and described in this paper. This quorum-based scheme will divide the servers into groups containing redundant data, and ensuring the clients that they can access information quickly without compromising network quality, also limiting the number of servers which must be read as well as written.
机译：在这个不断发展的世界中，人类获得的信息量正呈指数增长。但是，伴随着这一进展，需要开发基础结构以使此信息可访问。由于大量的人对从相对较少的服务器访问此信息感兴趣，因此必须开发和实现一种有效的算法来解决这一难题。理想的情况是每个用户只能访问一台服务器来获取所有信息。但是，由于存储限制，这是不切实际的。这也将是低效的，因为每当对任何或所有这些信息进行更改时，都必须在多个服务器中复制并存储数据。这也导致了相互排斥的问题。如果服务器正在更新信息，则任何其他服务器上的任何其他客户端都无法使用任何信息。为了使此信息易于获得，本文中开发并描述了一种用于管理此复制数据的基于仲裁的新方案。这种基于仲裁的方案会将服务器分为包含冗余数据的组，并确保客户端可以在不损害网络质量的情况下快速访问信息，并且还限制了必须读写的服务器数量。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号