• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Wang Zhanfeng, Chen Ming, Xing Changyou, Bai Huali, and Wei Xianglin. TIV and Access Delay in the Internet Delay Space[J]. Journal of Computer Research and Development, 2013, 50(3): 509-516.
Citation: Wang Zhanfeng, Chen Ming, Xing Changyou, Bai Huali, and Wei Xianglin. TIV and Access Delay in the Internet Delay Space[J]. Journal of Computer Research and Development, 2013, 50(3): 509-516.

TIV and Access Delay in the Internet Delay Space

More Information
  • Published Date: March 14, 2013
  • Many researches demonstrate that triangle inequality violation (TIV) is a universal phenomenon in the Internet delay space, which is the result of routing inefficiency. However, there are still no investigations on the TIVs position and its relationship with the access delay. Firstly, the Internet is divided into two parts: access network and core network, by different definitions. A delay model of the Internet delay space is proposed to analyze the TIVs position. Based on this model, it is found that TIV appears in the core of the Internet rather than the access networks and the access delay can reduce the TIV number and alleviate the TIVs severity. Then, a series of experiments are carried out on the PlanetLab to measure the end-to-end delay matrix and its corresponding topology. Afterwards, a TIV searching algorithm ScoutTIV is designed to count the TIV number in the measurement dataset by different definitions of edges between the access network and core network. In the experiments, the datasets are divided into three small datasets based on the country attributes of hosts and one random dataset. The experimental results on different datasets accord with our conclusion, which can help network coordinate systems to achieve better prediction accuracy.
  • Related Articles

    [1]LiuPeixia, JiangHaitao, ZhuDaming. Complexity and Algorithm for Minimum Breakpoint Median from PQ-trees[J]. Journal of Computer Research and Development, 2016, 53(3): 644-650. DOI: 10.7544/issn1000-1239.2016.20148258
    [2]Xu Yuming, Zhu Ningbo, Ouyang Aijia, and Li Kenli. A Double-Helix Structure Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems[J]. Journal of Computer Research and Development, 2014, 51(6): 1240-1252.
    [3]Li Kenli, Luo Xing, Wu Fan, Zhou Xu, and Huang Xin. An Algorithm in Tile Assembly Model for Maximum Clique Problem[J]. Journal of Computer Research and Development, 2013, 50(3): 666-675.
    [4]Zhou Xu, Li Kenli, Yue Guangxue, Yang Zhibang. A Volume Molecular Solution for the Maximum Matching Problem on DNA-Based Computing[J]. Journal of Computer Research and Development, 2011, 48(11): 2147-2154.
    [5]Wang Bin, Guo Qing, Li Zhongbo, Yang Xiaochun. Index Structures for Supporting Block Edit Distance[J]. Journal of Computer Research and Development, 2010, 47(1): 191-199.
    [6]Li Kenli, Liu Jie, Yang Lei, Liu Wenbin. An O(1.414\+n) Volume Molecular Solutions for the Exact Cover Problem on DNA-Based Supercomputing[J]. Journal of Computer Research and Development, 2008, 45(10): 1782-1788.
    [7]Jiang He, Zhang Xianchao, Che Haoyang, Chen Guoliang. A Multi-Commodity Flow Linear Programming with Polynomial Constraints for Black and White Traveling Salesman Problem[J]. Journal of Computer Research and Development, 2007, 44(10): 1796-1800.
    [8]Li Kenli, Yao Fengjuan, Li Renfa, Xu Jin. Improved Molecular Solutions for the Knapsack Problem on DNA-Based Supercomputing[J]. Journal of Computer Research and Development, 2007, 44(6): 1063-1070.
    [9]Zhao Baohua, Guo Xionghui, QianLan, and Qu Yugui. On the Problem of How to Place the Observers in Passive Testing[J]. Journal of Computer Research and Development, 2005, 42(10): 1815-1819.
    [10]Zhou Huaqi, Lu Mingming, and Zhu Hong. A Preemptive Scheduling Problem with Different Interrupted Time Cost on Identical Parallel Machines[J]. Journal of Computer Research and Development, 2005, 42(3).

Catalog

    Article views (824) PDF downloads (627) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return