检索结果-南通市图书馆

Providing Delay-Guaranteed Multicast Transmission Services for an SDN-Based Publish/Subscribe System

China Communications 2019年第12期16卷 176-187页

作者： Yali Wang Shuangxi Hong Junna Zhang College of Computer and Information Engineering Henan Normal UniversityXinxiang 450002China Engineering Laboratory of Intellectual Business and Internet of Things Technologies Henan ProvinceChina

Providing end-to-end delay guarantees in traditional Internet is a complex task due to the distributed nature of TCP/IP protocols. Software Defined Networking(SDN) gives a new dimension to improve QoS(Quality of Service) as it can benefit from its flexibility, programmability and centralized view. In this paper, we provide delay-guaranteed data transmission service instead of "best efforts" service for a topic-based publish/subscribe system by means of exploring these specific features of SDN. We attribute this routing problem in such conditions to Delay-Constraint Lowest Cost steiner tree(DCLCST) problem. To solve it, we compute the shortest delay paths from source node to every subscribe node and the shortest cost paths from every subscribe node to any other node using dijkstra algorithm. Then we construct a delay-constraint least cost steiner tree for per-topic based on these paths as multicast tree. We also present experimental results to demonstrate the effectiveness of the algorithms and methods we proposed.

关键词： minimum steiner tree multicast routing publish/subscribe system overlay network

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

A Two-Stage Method for Routing in Field-Programmable Gate Arrays with Time-Division Multiplexing

引用

Tsinghua Science and Technology 2022年第6期27卷 902-911页

作者： Peihuang Huang Longkun Guo Long Sun Xiaoyan Zhang College of Mathematics and Data Science Minjiang UniversityFuzhou 350116China School of Mathematics Science Nanjing Normal UniversityNanjing 210024China College of Mathematics and Computer Science Fuzhou UniversityFuzhou 350116China School of Mathematics Science and Institute of Mathematics Nanjing Normal UniversityNanjing 210024China

Emerging applications widely use field-programmable gate array(FPGA)prototypes as a tool to verify modern very-large-scale integration(VLSI)circuits,imposing many problems,including routing failure caused by the limited number of connections among blocks of FPGAs *** a shortage of connections can be alleviated through time-division multiplexing(TDM),by which multiple signals sharing an identical routing channel can be *** this context,the routing quality dominantly decides the performance of such systems,proposing the requirement of minimizing the signal delay between FPGA *** paper proposes algorithms for the routing problem in a multi-FPGA system with TDM support,aiming to minimize the maximum TDM *** algorithm consists of two major stages:(1)A method is proposed to set the weight of an edge according to how many times it is shared by the routing requirements and consequently to compute a set of approximate minimum steiner trees.(2)A ratio assignment method based on the edge-demand framework is devised for assigning ratios to the edges respecting the TDM ratio *** were conducted against the public benchmarks to evaluate our proposed approach as compared with all published works,and the results manifest that our method achieves a better TDM ratio in comparison.

关键词： Field-programmable gate array(FPGA)routing time-division multiplexing minimum steiner tree exact algorithm approximation algorithm

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：