A Maximum Flow Routing Method for Delay Tolerant Networks Based on Time Aggregation Graph

A delay-tolerant network and time-aggregated graph technology, applied in the field of communication, to solve the maximum flow problem and improve throughput

Active Publication Date: 2018-07-03
XIDIAN UNIV
View PDF4 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] The purpose of the present invention is to address the above problems, and propose a delay-tolerant network maximum flow routing method based on a time aggregation graph, to solve the difference caused by the lack of connection between different periods of the same link in the existing time aggregation graph model. The routing order leads to solving different maximum flow problems, realizes the accurate calculation of the maximum flow, and improves the throughput of network transmission

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
  • A Maximum Flow Routing Method for Delay Tolerant Networks Based on Time Aggregation Graph
  • A Maximum Flow Routing Method for Delay Tolerant Networks Based on Time Aggregation Graph
  • A Maximum Flow Routing Method for Delay Tolerant Networks Based on Time Aggregation Graph

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0032] The present invention will be further described below in conjunction with the accompanying drawings.

[0033] refer to figure 1 , figure 2 , image 3 , the implementation steps of the present invention are as follows:

[0034] Step 1, label the time-aggregated graph.

[0035] The time aggregation graph is a graph composed of several nodes and multiple directed edges, and each edge marks a capacity time series C(T)=(c 1 ,...,c t ,...,c m ), each node sets a storage transfer sequence N(T)=(n 1 ,...,n t ,...,n m ), where T refers to the given time frame, c t refers to the total capacity of the network link corresponding to the edge in the tth time period, n t It refers to the amount of data stored by the node from the t-1th time period to the tth time period, 1≤t≤m, and m refers to the time period divided by unit time within a given time range T.

[0036] as attached figure 2 As shown, there are 4 nodes (S, A, B, D) and multiple directed edges connecting adjac...

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

The invention discloses a delay-tolerant network maximum flow routing method based on a time-aggregated graph, which mainly solves the problem of different route selection sequences caused by the lack of connection between different periods of the same link in the existing time-aggregated graph model. The maximum flow problem. The implementation steps are: (1) mark the time aggregation graph; (2) find the augmented path L in the time aggregated graph; (3) calculate the maximum flow of the augmented path L, and obtain the remaining paths; (4) accumulate each augmented path L The maximum flow Lfmax(T) of the wide path L is used as the current maximum flow of the network, and the path is found in a loop. When there is no augmented path in the time aggregation graph, the maximum flow of the network is obtained. The invention increases the connection between different periods in the link, solves the maximum flow problem in the time aggregation graph, and can be used to improve the transmission throughput in the Internet, the Internet of Things, mobile communication, satellite communication and deep space communication.

Description

technical field [0001] The invention belongs to the technical field of communication, and in particular relates to a routing method in a delay-tolerant network, which can be used in the Internet, the Internet of Things, mobile communication, satellite communication and deep space communication to improve transmission throughput. Background technique [0002] Delay tolerant network DTN will often experience network disconnection in some specific network environments, resulting in the inability to ensure an end-to-end path for packets during transmission. At present, DTN has a wide range of application requirements and application prospects in the fields of Internet, Internet of Things, mobile communication, satellite communication, deep space communication and military communication, so it has gradually become a research hotspot in the field of wireless communication. [0003] The Internet Research Task Force IRTF developed the DTN architecture through the research on the int...

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
Patent Type & Authority Patents(China)
IPC IPC(8): H04L12/751H04L45/02
CPCH04L45/02
Inventor 李建东张焘李红艳张顺侯蓉晖盛敏马英红刘勤黄鹏宇刘伟
Owner XIDIAN 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