A Geographic Location-Based Distributed Routing System
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we propose a geographic location-based distributed routing (GDR) system. The GDR system provides information lookup based on latitude and longitude coordinates. Each node of the GDR system utilizes the coordinates as an identifier (ID), and manages an overlay routing table. An ID is generated to reflect the geographical location without using Space Filling Curve (SFC). The ID is in cartesian format (x,y), which represents the longitude x and latitude y. In a system with N nodes, each node has a routing table of size log N and a search is possible in O(log N). We evaluate the routing performance of GDR and other systems based on Chord, Kademlia and CAN. We show that in both the ID is in cartesian format and the ID is generated by using SFC, GDR, Chord and Kademlia have the same mean and the same variance of the path length, while the mean and the variance of the relay length of GDR are smaller than those of Chord and Kademlia. Furthermore, while GDR and CAN have the same mean and the same variance of the relay length, the mean and the variance of the path length of GDR are smaller than those of CAN.
- The Institute of Electronics, Information and Communication Engineersの論文
著者
-
Morita Hiroyoshi
Graduate School Of Information Systems The University Of Electro-communications
-
KOBAYASHI Kumiko
Research & Development Center, Japan Radio Co., Ltd.
-
NUGRAHA I
School of Electrical Engineering and Informatics, Institute of Technology Bandung
関連論文
- Transcoding-after-Smoothing System for VBR MPEG Video Streaming
- Evaluation of mutual anonymity in P2P networks (情報セキュリティ)
- Evaluation of mutual anonymity in P2P networks (情報処理)
- Evaluation of mutual anonymity in P2P networks (ワイドバンドシステム)
- Multicast Communication for Video Broadcasting Service over IPv4 Network Using IP Option(Internet)
- Derivation on Bit Error Probability of Coded QAM Using Integer Codes(Communication Theory and Signals)
- Integer Codes Correcting Single Errors of Specific Types (±e_1, ±e_2,..., ±e_s)(Communication Theory and Signals)
- Codes over the Ring of Integers Modulo m (Special Section on Information Theory and Its Applications)
- On Analysis of Acceptable Region of a Statistical Multiplexer Based on Fractional Brownian Traffic Models
- On Construction of Reversible Variable-Length Codes Including Resynchronization Markers as Codewords
- On Multiple Smoothed Transmission of MPEG4 Video Stream
- On Multiple Smoothed Transmission of MPEG Video Streams(Image Coding, Information Theory and Its Applications)
- On Trimming Codewords of Arithmetic Codes
- Reversible Distribution Converter with Finite Precision Arithmetic
- Special Section on Information Theory and Its Applications
- On Increasing the Number of Users in (t, n) Threshold Secret Sharing Schemes
- On the Construction of an Antidictionary with Linear Complexity Using the Suffix Tree(Algorithms and Data Structures)
- Perfect (2, n) Threshold Secret Sharing Systems Based on Matrices with Constant Column Weight
- Soft Decoding of Integer Codes and Their Application to Coded Modulation
- On (±1) Error Correctable Integer Codes
- Bootstrap Node-Centered Proximity Identifier Selection for Structured Overlays in Private Networks
- On-Line Electrocardiogram Lossless Compression Using Antidictionary Codes for a Finite Alphabet
- Linear Complexity Construction of Antidictionaries
- An Upper Bound on Size of Antidictionary
- Construction of q-ary (2,n) Threshold Secret Sharing Systems
- On the Irreducibility of Certain Shifts of Finite Type
- Real-Time and Memory-Efficient Arrhythmia Detection in ECG Monitors Using Antidictionary Coding
- A Geographic Location-Based Distributed Routing System