TAILIEUCHUNG - Congestion control algorithm for message routing in structured peer to peer networks

This paper proposes a congestion control algorithm for message routing in structured P2P networks by changing the routing table of nodes in the network to route the packet to the destination without going through congested nodes. The performance of the proposed the method has been evaluated and compared with the conventional Chord protocol. | Journal of Computer Science and Cybernetics, , (2018), 145–159 DOI CONGESTION CONTROL ALGORITHM FOR MESSAGE ROUTING IN STRUCTURED PEER-TO-PEER NETWORKS NGUYEN DINH NGHIA1 , NGUYEN HOAI SON2 1 People’s Security Academy of Engineering and Technology 1 nghiahvan@ 2 VNU-University Abstract. In structured peer-to-peer (P2P) networks, every node must perform message routing to deliver query messages to destination nodes. Therefore, they often have to process a large number of query messages quickly and efficiently. When the number of query messages sending to a node exceeds its routing capacity, a local congestion on the node occurs and reduces the information processing of the other nodes in the network. This paper proposes a congestion control algorithm for message routing in structured P2P networks by changing the routing table of nodes in the network to route the packet to the destination without going through congested nodes. The performance of the proposed the method has been evaluated and compared with the conventional Chord protocol. The result shows that our proposed method improves the query success rate significantly while minimizing the number of packets generated during congestion control process. Keywords. Peer-to-peer, distributed hash, DHash, Chord. 1. INTRODUCTION Distributed hash tables (DHTs) are efficient routing algorithms for storing and searching data in structured peer-to-peer networks. DHT algorithms determine data location through an identifier (. a key) in the identifier space. Each node is responsible for managing a subset of identifiers. The basic operation of a DHT is to search for an identifier and return the address (. IP address and port number) of the node responsible for the identifier. Each node maintains a routing table to forward queries that it does not manage. DHTs, such as P-Grid [1], Chord [2] or Pastry [3] create routing tables to move the packet to the destination .

• Kỹ thuật lập trình
• Journal of Computer Science and Cybernetics
• Congestion control algorithm for message routing
• Structured peer to peer networks
• Peer to peer
• Congestion control algorithm
• Nonstandard finite difference schemes
• Solving a modified epidemiological model for computer viruses
• Nonstandard finite difference
• Computer virus propagation model
• Multi objective evolutionary algorithms
• Evolutionary algorithms and foundation
• development and open issues
• EC enables computer scientists
• Evolutionary algorithms designed
• Learning interaction measure
• Relevance feedback in image retrieval
• Multi feature query
• The fuzzy density values
• Quality of transmission aware routing in ad hoc networks
• Cross layer model combined
• The static agent
• Ad hoc networks
• QoT aware routing
• sattic agent
• Algorithm to build fuzzy decision tree for data classification problem
• Fuzziness intervals matching
• Fuzzy decision tree
• The fuzzy data mining problem
• Hedges algebras and fuzzy partition problem for qualitative attributes
• Construct the membership functions
• Fuzzy Association Rules
• Member ship functions
• Characterizations for several classes of alternative codes
• Several classes of alternative codes
• norm alternative code
• Left norm alternative code
• Two sided alternative code
• Left alternative code
• Strict alternative code
• Packet classification algorithm
• Multi way priority trie
• Significant number of researchers
• Both theoretically and experimentally proved
• Solving min max capacitated vehicle routing problem by local search
• Solving min max capacitated vehicle routing problem
• Solving min max capacitated
• Proposed algorithms compared
• Novel control approach for optimal power flow
• Hybrid wind photovoltaic diesel generation systems
• Diesel generation systems
• Analytical control model
• Mobile ad hoc network
• Valid route testing mechanism
• Using Network Simulator
• Random movement network topology
• Rough set theory
• Polynomial time complexity
• Algorithm finding object reducts
• Improved genetic algorithm
• Test data generation for simulink models
• Conventional genetic algorithm
• Generate test data for Simulink models
• Nonholonomic wheeled mobile robot
• Wheeled mobile robot
• Function neural network
• Unknown external disturbances
• Modeling the differential motion of a mobile manipulator
• Designing a new visual servoing
• Tracking a flying target
• Reinforcement learning algorithm
• Efficient navigation framework
• Autonomous mobile robots
• The mobile robots
• Interpolation based on semantic distance weighting
• Hedge algebra and its application
• Semantic distance weighting
• Bi linear interpolation
• Linguistic rule base system
• Transform the current Web
• Conceptual data model
• Ti meER model
• The temporal databases into OWL ontology
• The ER model into ontology
• Sliding mode control
• Sliding mode control for a planar parallel robot driven
• Electric motors in a task space
• The substructure method
• Greedy Randomized Adaptive Search Procedure
• Multiple Traveling Repairmen Problem with Distance Constraints
• Variable Neighborhood Descent
• Traveling Repairman Problem
• On the real world semantics interpretability
• Fuzzy rule based systems under fuzzy set approach
• Hedge algebra approach
• The RWS interpretability
• Alternating current electrical systems
• Integer quadratic programming
• Non linear knapsack problems arising
• Polynomial time approximation schemes
• Statistical implication rules
• Collaborative filtering recommender system
• Statistical implicative analysis
• The accuracy of recommender systems
• Picture fuzzy sets
• Picture fuzzy t norms
• Picture fuzzy t conorm
• De Morgan picture operator triple
• Taxonomic assignment for large scale metagenomic data
• High perfomance systems
• Large scale metagenomic data
• Achieve good performance