期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
A maximum flow algorithm for buffer-limited delay tolerant networks 被引量:1
1
作者 Tao Zhang songfeng deng +2 位作者 Hongyan Li Ronghui Hou Haichao Zhang 《Journal of Communications and Information Networks》 2017年第3期52-60,共9页
Deep space networks,satellite networks,ad hoc networks,and the Internet can be modeled as DTNs(Delay Tolerant Networks).As a fundamental problem,the maximum flow problem is of vital importance for routing and service ... Deep space networks,satellite networks,ad hoc networks,and the Internet can be modeled as DTNs(Delay Tolerant Networks).As a fundamental problem,the maximum flow problem is of vital importance for routing and service scheduling in networks.However,there exists no permanent end-to-end path since the topology and the characteristics of links are time-variant,resulting in a crucial maximum flow problem in DTNs.In this paper,we focus on the single-source-single-sink maximum flow problem of buffer-limited DTNs,followed by a valid algorithm to solve it.First,the BTAG(Buffer-limited Time Aggregated Graph)is constructed for modeling the buffer-limited DTN.Then,on the basis of BTAG,the two-way cache transfer series and the relevant transfer rules are designed,and thus a BTAG-based maximum flow algorithm is proposed to solve the maximum flow problem in buffer-limited DTNs.Finally,a numerical example is given to demonstrate the effectiveness of the proposed algorithm. 展开更多
关键词 spatial information networks delay tolerant networks time-varying graph buffer-limited time aggregated graph maximum flow
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部