scholarly journals A Splay Tree-Based Approach for Efficient Resource Location in P2P Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-11
Author(s):  
Wei Zhou ◽  
Zilong Tan ◽  
Shaowen Yao ◽  
Shipu Wang
Keyword(s):  
Routing Algorithm ◽  
Adaptive Routing ◽  
Upper And Lower Bounds ◽  
Resource Location ◽  
Hop Count ◽  
Worst Case ◽  
Average Case ◽  
Splay Tree ◽  
Efficient Resource ◽  
P2p System

Resource location in structured P2P system has a critical influence on the system performance. Existing analytical studies of Chord protocol have shown some potential improvements in performance. In this paper a splay tree-based new Chord structure called SChord is proposed to improve the efficiency of locating resources. We consider a novel implementation of the Chord finger table (routing table) based on the splay tree. This approach extends the Chord finger table with additional routing entries. Adaptive routing algorithm is proposed for implementation, and it can be shown that hop count is significantly minimized without introducing any other protocol overheads. We analyze the hop count of the adaptive routing algorithm, as compared to Chord variants, and demonstrate sharp upper and lower bounds for both worst-case and average case settings. In addition, we theoretically analyze the hop reducing in SChord and derive the fact that SChord can significantly reduce the routing hops as compared to Chord. Several simulations are presented to evaluate the performance of the algorithm and support our analytical findings. The simulation results show the efficiency of SChord.

scholarly journals The stretch-length tradeoff in geometric networks: average case and worst case study

2015 ◽  
Vol 159 (1) ◽  
pp. 125-151
Author(s):  
DAVID ALDOUS ◽  
TAMAR LANDO
Keyword(s):  
Lower Bounds ◽  
Poisson Point Process ◽  
Euclidean Distance ◽  
Unit Area ◽  
Average Density ◽  
Upper And Lower Bounds ◽  
Worst Case ◽  
Average Case ◽  
Route Length

AbstractConsider a network linking the points of a rate-1 Poisson point process on the plane. Write Ψave(s) for the minimum possible mean length per unit area of such a network, subject to the constraint that the route-length between every pair of points is at moststimes the Euclidean distance. We give upper and lower bounds on the function Ψave(s), and on the analogous “worst-case” function Ψworst(s) where the point configuration is arbitrary subject to average density one per unit area. Our bounds are numerically crude, but raise the question of whether there is an exponent α such that each function has Ψ(s) ≍ (s− 1)−αass↓ 1.

scholarly journals Cuckoo Hashing

2001 ◽  
Vol 8 (32) ◽  
Author(s):  
Rasmus Pagh ◽  
Flemming Friche Rodler
Keyword(s):  
Lower Bounds ◽  
Binary Search ◽  
Upper And Lower Bounds ◽  
Binary Search Trees ◽  
Search Trees ◽  
Worst Case ◽  
Average Case ◽  
Cuckoo Hashing ◽  
Perfect Hashing ◽  
Theoretical Performance

We present a simple and efficient dictionary with worst case constant lookup time, equaling the theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger et al. (<em>Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput., 23(4):738-761, 1994</em>). The space usage is similar to that of binary search trees, i.e., three words per key on average. The practicality of the scheme is backed by extensive experiments and comparisons with known methods, showing it to be quite competitive also in the average case.

scholarly journals An Adaptive Routing Algorithm Based on Relation Tree in DTN

Sensors ◽  
2021 ◽  
Vol 21 (23) ◽  
pp. 7847
Author(s):  
Diyue Chen ◽  
Hongyan Cui ◽  
Roy E. Welsch
Keyword(s):  
Negative Feedback ◽  
Routing Algorithm ◽  
Adaptive Routing ◽  
Routing Algorithms ◽  
Source Node ◽  
Message Delivery ◽  
Average Delay ◽  
Hop Count ◽  
Simulation Results ◽  
Delay Tolerant

It is found that nodes in Delay Tolerant Networks (DTN) exhibit stable social attributes similar to those of people. In this paper, an adaptive routing algorithm based on Relation Tree (AR-RT) for DTN is proposed. Each node constructs its own Relation Tree based on the historical encounter frequency, and will adopt different forwarding strategies based on the Relation Tree in the forwarding phase, so as to achieve more targeted forwarding. To further improve the scalability of the algorithm, the source node dynamically controls the initial maximum number of message copies according to its own cache occupancy, which enables the node to make negative feedback to network environment changes. Simulation results show that the AR-RT algorithm proposed in this paper has significant advantages over existing routing algorithms in terms of average delay, average hop count, and message delivery rate.

An adaptive routing algorithm for integrated information networks

2019 ◽  
Vol 16 (7) ◽  
pp. 195-206 ◽  
Author(s):  
Feng Wang ◽  
Dingde Jiang ◽  
Sheng Qi
Keyword(s):  
Routing Algorithm ◽  
Adaptive Routing ◽  
Information Networks ◽  
Integrated Information

Rule Based Classifiers for Suspect Detection from CCTV Footages

2020 ◽  
Vol 13 ◽  
Author(s):  
Sunil Pathak
Keyword(s):  
Answer Sheet ◽  
Normal Activity ◽  
Contact Detection ◽  
Accuracy Rate ◽  
Hand Detection ◽  
Worst Case ◽  
Average Case ◽  
The Face ◽  
Case Simulation ◽  
Material Exchange

Background: The significant work has been present to identify suspects, gathering information and examining any videos from CCTV Footage. This exploration work expects to recognize suspicious exercises, i.e. object trade, passage of another individual, peeping into other's answer sheet and individual trade from the video caught by a reconnaissance camera amid examinations. This requires the procedure of face acknowledgment, hand acknowledgment and distinguishing the contact between the face and hands of a similar individual and that among various people. Methods: Segmented frames has given as input to obtain foreground image with the help of Gaussian filtering and background modeling method. Suh foreground images has given to Activity Recognition model to detect normal activity or suspicious activity. Results: Accuracy rate, Precision and Recall are calculate for activities detection, contact detection for Best Case, Average Case and Worst Case. Simulation results are compare with performance parameter such as Material Exchange, Position Exchange, and Introduction of a new person, Face and Hand Detection and Multi Person Scenario. Conclusion: In this paper, a framework is prepared for suspect detection. This framework will absolutely realize an unrest in the field of security observation in the training area.

ON THE AVERAGE CASE CIRCUIT DELAY OF DISJUNCTION

1995 ◽  
Vol 05 (02) ◽  
pp. 275-280 ◽  
Author(s):  
BEATE BOLLIG ◽  
MARTIN HÜHNE ◽  
STEFAN PÖLT ◽  
PETR SAVICKÝ
Keyword(s):  
Lower Bounds ◽  
Wide Class ◽  
Time Complexity ◽  
Upper And Lower Bounds ◽  
Average Case ◽  
Asymptotically Optimal ◽  
Circuit Delay ◽  
Suitable Measure

For circuits the expected delay is a suitable measure for the average case time complexity. In this paper, new upper and lower bounds on the expected delay of circuits for disjunction and conjunction are derived. The circuits presented yield asymptotically optimal expected delay for a wide class of distributions on the inputs even when the parameters of the distribution are not known in advance.

A Novel Adaptive Routing Algorithm for Network-On-Chip

2011 ◽  
Vol 474-476 ◽  
pp. 413-416
Author(s):  
Jia Jia ◽  
Duan Zhou ◽  
Jian Xian Zhang
Keyword(s):  
Routing Algorithm ◽  
Adaptive Routing ◽  
Network On Chip ◽  
Experimental Results ◽  
Average Latency ◽  
On Chip

In this paper, we propose a novel adaptive routing algorithm to solve the communication congestion problem for Network-on-Chip (NoC). The strategy competing for output ports in both X and Y directions is employed to utilize the output ports of the router sufficiently, and to reduce the transmission latency and improve the throughput. Experimental results show that the proposed algorithm is very effective in relieving the communication congestion, and a reduction in average latency by 45.7% and an improvement in throughput by 44.4% are achieved compared with the deterministic XY routing algorithm and the simple XY adaptive routing algorithm.

Sign in / Sign up

Export Citation Format

Share Document