检索结果-内蒙古大学图书馆

Global Mobile Congress 2005

作者： Shang Feng-jun Tang Hong Chongqing Univ Posts & Telecommun Coll Comp Sci & Technol Chongqing 400065 Peoples R China

In this article, the authors survey the recent advances in the research of route lookup algorithm and introduce some of the typical algorithms. At last, a novel route lookup algorithm is proposed based the non-collision hash and table merger(NHTM) algorithm, which is based on Non-Collision Hash Trie-Tree algorithm and Grid of Tries algorithm. The core of algorithm has four parts: (1) constructing hash function mainly based on RES and NLA so that the hash function can avoid space explosion problem;(2) incorporating two kinds of algorithm,. which are the Lakshman and Stiliadis propose a 2-dimensional classification algorithm and the algorithm of Grid of Tries as well as transforming Grid of Tries for the Trie-tree primed and jumping table in order to reduce space complexity;(3) incorporating jumping table item. After expanding normally, this doesn't increase the time complex degree of algorithm because we introduce the jumping table. Space complexity consumed and space requirement are less than those of algorithm. Test results show that the classification rate of NHTM algorithm is up to 5 million packets per second and the maximum memory consumed is 50MB for 10,000 rules.

关键词： lookup algorithm Trie-tree non-collision hash Grid of Tries

来源：评论

学校读者我要写书评

暂无评论

Evaluation of a large scale lookup algorithm in ASP based grids

Evaluation of a large scale lookup algorithm in ASP based gr...

引用

5th International Symposium on Parallel and Distributed Computing

作者： Philippe, L. Damy, S. Herrmann, B. Djama, I. Dahan, S. Univ Franche Comte Lab Informat Route Gray F-25030 Besancon France

ISBN: (纸本)0769526381

The Internet development and the availability of reliable networks led to the emergence of Grid architectures. The aim of these architectures is to take benefit of widely distributed resources to improve execution possibilities. Depending on their properties, these architectures are usually classified into desktop grids, resources grids and application based grids. Application based grids provide an easy access to applications deployed on the grid on the ASP (Application Service Provider) mode. When these grids grow of orders of magnitude, application lookup will become a costly activity of the grid. In this article, we study how a lookup algorithm scales when the size of the grid grows tip. We exhibit a "lookup throughput" which characterizes the grid interconnections graph and the lookup algorithm.

关键词： lookup algorithm Application Service Provider grids graph traversal

来源：评论

学校读者我要写书评

暂无评论

An Improved lookup algorithm for Chord

An Improved Lookup Algorithm for Chord

引用

Pacific-Asia Conference on Circuits, Communications and Systems

作者： Cheng, Yinbo Wen, Xiangming Zheng, Wei Beijing Univ Posts & Telecommun Sch Informat & Commun Engn Beijing 100876 Peoples R China

ISBN: (纸本)9780769536149

The critical issue that confronts peer-to-peer networks is the efficient location of the node that stores a desired data item. Chord is a successful resource location protocol based on Distributed Hash Table. However, if the desired data item is stored on a node that is count-clockwise close to the query node on the chord ring, the lookup latency might be high because of its clockwise lookup strategy. We optimize the lookup algorithm to reduce routing latency and present a bidirectional parallel lookup strategy for Chord (BP-Chord). Simulation results show that BP-Chord can improve lookup performance.

关键词： P2P Chord lookup algorithm bidirectional parallel lookup

来源：评论

学校读者我要写书评

暂无评论

Non-collision Hash and Table Merger IPv6 Route lookup algorithm

Non-collision Hash and Table Merger IPv6 Route Lookup Algori...

引用

2005全球移动通信大会

作者： Shang feng-jun Tang Hong (College of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing 400065, China) (Key Laboratory of Opto-electronic Technology and System of Ministry of Education,College of Opto-electronic Engineering, Chongqing University, Chongqing 400044, China)

In this article,the authors survey the recent advances in the research of route lookup algorithm and introduce some of the typical algorithms. At last, a novel route lookup algorithm is proposed based the non-collision hash and table merger(NHTM) algorithm, which is based on Non-Collision Hash Trie-Tree algorithm and Grid of Tries algorithm. The core of algorithm has four parts: (1) constructing hash function mainly based on RES and NLA so that the hash function can avoid space explosion problem;(2) incorporating two kinds of algorithm, which are the Lakshman and Stiliadis propose a 2-dimensional classification algorithm and the algorithm of Grid of Tries as well as transforming Grid of Tries for the Trie-tree pruned and jumping table in order to reduce space complexity;(3) incorporating jumping table item. After expanding normally, this doesn't increase the time complex degree of algorithm because we introduce the jumping table. Space complexity consumed and space requirement are less than those of algorithm. Test results show that the classification rate of NHTM algorithm is up to 5 million packets per second and the maximum memory consumed is 50MB for 10,000 rules.

关键词： lookup algorithm Trie-tree Non-collision hash Grid of Tries1, Introduction

来源：评论

学校读者我要写书评

暂无评论

RElookup: Providing Resilient and Efficient lookup Service for P2P-VoD Streaming

RELookup: Providing Resilient and Efficient Lookup Service f...

引用

17th IEEE International Conference on Parallel and Distributed Systems (ICPADS)

作者： Zhang, Xu Li, Zhenhua Zhang, Tieying He, Liangpeng Chen, Guihai Nanjing Univ Nanjing Jiangsu Peoples R China Peking Univ Beijing Peoples R China Chinese Acad Sci ICT Beijing Peoples R China

ISBN: (纸本)9780769545769

For P2P-VoD streaming, an effective lookup algorithm for appropriate data suppliers is required to support the user's operation of random jump on the video. Existing lookup algorithms mainly adopt a centralized, flooding-based, or DHT-based method. Facing the highly dynamic Internet environments, the centralized method incurs a single point of failure, the flooding-based method lacks scalability, and the DHT-based method is not resilient. Motivated by these problems, we propose a novel lookup algorithm, named "RElookup", which places peers on a resilient super node-based overlay and meanwhile utilizes the play point distance to efficiently locate candidate data suppliers. Besides, deliberate measures (i.e., special design of message format and node state) have been taken to reduce the coordination costs between super nodes to very little. Results of trace-driven simulations confirm the effectiveness of our proposed RElookup algorithm.

关键词： P2P (peer-to-peer) VoD (video-on-demand) lookup algorithm super node play point distance

来源：评论

学校读者我要写书评

暂无评论

HyCube: A distributed hash table based on a variable metric

引用

PEER-TO-PEER NETWORKING AND APPLICATIONS 2017年第4期10卷 954-982页

作者： Olszak, Artur Warsaw Univ Technol Inst Comp Sci Warsaw Poland

Distributed Hash Tables (DHT) proved to be scalable decentralized systems providing efficient resource location. This paper concentrates on efficiency and resilience to node failures of DHT systems and presents a novel model of a distributed hash table based on a hierarchical hypercube geometry, called HyCube. The DHT geometry, the choice of the metric defining logical distances between nodes, and the routing algorithm have fundamental influence on routing efficiency and resilience. The use of the one-dimensional model (placing the nodes logically on a ring) allows the nodes to maintain sets of references called sequential neighbors - certain numbers of neighbors that are the closest existing nodes in both directions on the ring. Such a model yields a very high level of resilience to node failures. The new approach, presented in the paper, employs a variable multi-dimensional metric adopting the Steinhaus transform. Routing, lookup and search algorithms are discussed, as well as routing table nodes selection and self-organization techniques. It is shown that the new approach allows reaching a higher level of resilience to node failures, as well as a shorter average routing path length than with the use of the sequential neighbors sets.

关键词： Distributed hash table Routing algorithm lookup algorithm Search algorithm Failure resilience

来源：评论

学校读者我要写书评

暂无评论

Study on An Absolute Non-Collision Hash and Jumping Table IP Classification algorithms

引用

Wuhan University Journal of Natural Sciences 2004年第5期9卷 835-838页

作者： SHANG Feng-jun 1,2 ,PAN Ying-jun 1 1. Key Laboratory of Opto-Electronic Technology and System of Ministry of Education/College of Opto-Electronic Engineering,Chongqing University, Chongqing 400044,China 2. College of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing 400065,China Key Laboratory of Opto-Electronic Technology and System of Ministry of Education/College of Opto-Electronic Engineering Chongqing University Chongqing China College of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing China

In order to classify packet, we propose a novel IP classification based the non-collision hash and jumping table trie-tree (NHJTTT) algorithm, which is based on noncollision hash Trie-tree and Lakshman and Stiliadis proposing a 2-dimensional classification algorithm (LS algorithm). The core of algorithm consists of two parts: structure the non-collision hash function, which is constructed mainly based on destination/source port and protocol type field so that the hash function can avoid space explosion problem; introduce jumping table Trie-tree based LS algorithm in order to reduce time complexity. The test results show that the classification rate of NHJTTT algorithm is up to 1 million packets per second and the maximum memory consumed is 9 MB for 10 000 rules. Key words IP classification - lookup algorithm - trie-tree - non-collision hash - jumping table CLC number TN 393.06 Foundation item: Supported by the Chongqing of Posts and Telecommunications Younger Teacher Fundation (A2003-03). Biography: SHANG Feng-jun (1972-), male, Ph.D. candidate, lecture, research direction: the smart instrument and network.

关键词： IP classification lookup algorithm trie-tree non-collision hash jumping table

来源：评论

学校读者我要写书评

暂无评论

Study on An Absolute Non-Collision Hash and Jumping Table IP Classification algorithms

Study on An Absolute Non-Collision Hash and Jumping Table IP...

引用

The First Conference on Web Information System and Applications(WISA 2004)

作者： SHANG Feng-jun~(1,2), PAN Ying-jun~1 1. Key Laboratory of Opto-Electronic Technology and System of Ministry of Education/College of Opto-Electronic Engineering,Chongqing University, Chongqing 400044, China 2. College of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing 400065, China

In order to classify packet, we propose a novel IP classification based the non-collision hash and jumping table Trie-tree (NHJTTT) algorithm, which is based on noncollision hash Trie-tree and Lakshman and Stiliadis proposing a 2-dimensional classification algorithm (LS algorithm). The core of algorithm consists of two parts: structure the non-collision hash function, which is constructed mainly based on destination/source port and protocol type field so that the bash function can avoid space explosion problem;introduce jumping table Trie-tree based LS algorithm in order to reduce time complexity, The test results show that the classification rate of NHJTTT algorithm is up to 1 million packets per second and the maximum memory consumed is 9 MB for 10 000 rules.

关键词： IP classification lookup algorithm trie-tree non-collision hash jumping table

来源：评论

学校读者我要写书评

暂无评论

Research on a XOR Hash IP Classification algorithms

Research on a XOR Hash IP Classification Algorithms

引用

ICEMI'2005第七届国际电子测量与仪器学术会议

作者： SHANG Feng-jun1,2 Tang hong1 PAN Ying-jun2 (College of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing 400065)

In this paper, the authors survey the recent advances in the research of IP classification and introduce some of the typical algorithms. At last, a novel IP classification is proposed based the hash a

关键词： IP classification lookup algorithm collision rate XOR hash

来源：评论

学校读者我要写书评

暂无评论

High-speed Network Traffic Model

High-speed Network Traffic Model

引用

第三届国际仪器科学技术学术研讨会

作者： SHANG Feng-jun a, b , TANG Hong a aCollege of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing 400065,China bKey Laboratory of Opto-electronic Technology and System of Ministry of Education,College of Opto-electronic Engineering,Chongqing University, Chongqing 400044,China

In order to manage the whole network, a novel traffic model is proposed based the active probe method. The core of model has three parts: First, we inject probe packet into the network by Poisson law.

关键词： Traffic model route matrix lookup algorithm XOR hash stochastic space

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：