Routing method of sectional interaction to goal node according to scale value based on optimized diameter network

A diameter network and node technology, applied in the Internet field, can solve problems such as low data forwarding efficiency

Inactive Publication Date: 2005-12-21
TSINGHUA UNIV
View PDF0 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0008] The purpose of the present invention is to overcome the generally low data forwarding efficiency problem of existing methods, and provide a new heuristic routing mechanism for fast data transmission on a large-scale P2P network

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Routing method of sectional interaction to goal node according to scale value based on optimized diameter network
  • Routing method of sectional interaction to goal node according to scale value based on optimized diameter network
  • Routing method of sectional interaction to goal node according to scale value based on optimized diameter network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0027] Step 1. Note: the node number of the source node is w 0 , the node number of the destination node is j, the forwarding packet is P, the degree of the node is d, let i in formula (1) be w k , according to formula (1), we can get formula (2):

[0028] w k+1 =d×w k +s+t (mod n)(s=1, t∈[0,n-1]) (2)

[0029] from the source node w 0 At the beginning, iteratively calculate the formula x times ( ), find w x ;

[0030] Step 2. With w x As the first item of the sequence, write the length d x , an arithmetic sequence whose difference between two adjacent items is 1, and modulo n for each item, finally we get the sequence a.

[0031] In fact, this step can also be operated as follows: from the first item w x At the beginning, write each item of the sequence sequentially with the difference between two adjacent numbers being 1, and judge whether the item is equal to n-1. When it is equal to n-1, the next element becomes 0, and then continue to write the next one se...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

Belonging to technical area of Internet, the invention possesses following characters: according to iterative formula for optimizing diameter network, source node is iterated repeatedly for [logdn] times, where d as degree value of node, n as number of network node so as to obtain a sequence in length dx, (x = [logdn]); then, dividing the sequence into d parts, determining position the destination node locates at based on method of node attribution determinant. Thus, node router decides number of node the packet to be forwarded next, and forwards packet to the node. Based on result from divided sequence at previous time, iterative operation is carried out according to same steps described above for the node of receiving the packet. Corresponding packet is forwarded continuously till the packet is forwarded to destination node finally. Based on forwarding packet in low time delay, the invention realizes rapid communication between any nodes on P2P network in large scale.

Description

technical field [0001] The invention belongs to the technical field of Internet. Background technique [0002] The performance of P2P network largely depends on the maximum transmission delay and routing method of the network. A packet refers to a data packet with a certain format; the maximum transmission delay of the network refers to the maximum time difference between sending a packet and receiving a packet between any two points on the network. Based on the following reasons, we believe that the control of the most human transmission delay is very important for the congestion control of the network and the quality of service of the network: First, some applications will not perform well due to the excessive end-to-end delay, or even cannot perform ; Secondly, the uncertain change of the maximum transmission delay makes it difficult for the network to support many interactive real-time applications; finally, the larger the maximum transmission delay value, the more diff...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): H04L12/721H04L29/08
Inventor 徐恪丁强崔勇
Owner TSINGHUA UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap