谷歌浏览器插件
订阅小程序
在清言上使用

Enabling fast path delay measurement using closeness centrality

INTERNET TECHNOLOGY LETTERS(2022)

引用 1|浏览1
暂无评分
摘要
As one of the key performance metrics, path delay is of great significance for network policy making. Existing work has focused too much on the accuracy of delay measurement and neglected its timeliness. In response, in this paper, we propose a fast path delay measurement scheme using closeness centrality for software-defined network. First, the node ranking method using closeness centrality is used to select the initial point for the delay measurement to enable fast forwarding of probe packets. On this basis, we assign link weights according to the delay measurement results, and readjust the measurement points to optimize the performance. A series of simulation experiments on different topologies and network state verifies the advantage of the proposed scheme in this paper in terms of time overhead for delay measurement, compared to existing work.
更多
查看译文
关键词
software-defined networking, closeness centrality, delay measurement
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要