zoukankan      html  css  js  c++  java
  • A DTN Congestion Mechanism Based on Distributed Storage

    Author:Daowen Hua, Xuehui Du, Guoyu Xu, Lifeng Cao, Huan Chen

    Year:2010

    Bundle Selection:

    The bundle seleciton considers three factors:left TTL, size of bundle,priority of bundle.

    QQ截图未命名

    Ajacent Nodes Selection:

    Take the Migration Value image as the evaluation metric of the node selection which includes 3 aspects:node storage,link delay and link bandwidth.

    General hypothesis:

    • the length of bundle is L
    • the storage of neighbour N adjacent to custodian C is image  .
    • Storage value is image .
    • Delay from C to N is image .
    • corresponding link bandwidth is image .
    • maximum delivery delay is image
    • Delivery value is image

     image

    image

    image

    image

    When congestion appears at a custodian, it calculates the migration value for its adjacent neighbours and selects the minimum one.

    Bundle Retrieval:

    If the adjacent node (holding the migrated bundles) finds new forwarding path for these migrated bundles, these bundles will be forwarded rather than migrating back to previous custodian, and a notification will be sent to the previous custodian.Or it will wait until the previous custodian resolves congestion.

    The retrieval algorithm is opposite to the previous migration from congestion custodian to neighbours.

    If the previous custodian knows the locaiton of the bundles it previously migrated,it sends a single request to the specified neighbour otherwise it will send a group request.

    There are two points:the contact should be established to take the bundles back;the bundles with high priority and less size should be preferred.

    Simulation:

    Simulation enviroment:OPENET

    Network topology:

    image

  • 相关阅读:
    Linux
    Monkey命令
    ADB命令
    DOS命令
    列表
    函数
    文件读写及实操项目
    Selenium2自动化——初体验
    新开淘宝店怎么提升信誉,是不是真的要刷钻?
    JSFL:导入根文件夹将所有图片添加库链接导出swf
  • 原文地址:https://www.cnblogs.com/jcleung/p/1812793.html
Copyright © 2011-2022 走看看