Search Results - dynamic shortest path tree(dspt) algorithm~

Search alternatives:

  • Showing 1 - 5 results of 5
Refine Results
  1. 1

    An Efficient Maintenance Algorithm for Shortest Path Tree in Dynamic Network by WEI Yuke,WANG Shouxiang

    ISSN: 1000-3428
    Published: Editorial Office of Computer Engineering 01.01.2017
    Published in Ji suan ji gong cheng (01.01.2017)
    “…The reported Dynamic Shortest Path Tree(DSPT) algorithm can result in frequent update of the Shortest Path Tree(SPT…”
    Get full text
    Journal Article
  2. 2

    An efficient algorithm for dynamic shortest path tree update in network routing by Bin Xiao, Jiannong Cao, Zili Shao, Sha, Edwin H.-M

    ISSN: 1229-2370, 1976-5541
    Published: Séoul Editorial Department of Journal of Communications and Networks 01.12.2007
    Published in Journal of communications and networks (01.12.2007)
    “… modifications can cause routing table instability. This paper presents a new update algorithm, dynamic shortest path tree (DSPT…”
    Get full text
    Journal Article
  3. 3

    An Efficient Algorithm for Dynamic Shortest Path Tree Update in Network Routing by B. Xiao, 지아농챠오, Z. Shao, E. H.-M. Sha

    ISSN: 1229-2370, 1976-5541
    Published: 한국통신학회 01.12.2007
    Published in Journal of communications and networks (01.12.2007)
    “… modifications can cause routing table instability. This paper presents a new update algorithm, dynamic shortest path tree(DSPT…”
    Get full text
    Journal Article
  4. 4

    An Efficient Algorithm for Dynamic Shortest Path Tree Update in Network Routing by Xiao, Bin, Cao, Jiannong, Shao, Zili, Sha, Edwin H.M

    ISSN: 1229-2370, 1976-5541
    Published: 2007
    “… modifications can cause routing table instability. This paper presents a new update algorithm, dynamic shortest path tree(DSPT…”
    Get full text
    Journal Article
  5. 5

    动态网络中一种高效的最短路径树维护算法 by 韦玉科 王守翔

    ISSN: 1000-3428
    Published: 广东工业大学计算机学院,广州,510006 2017
    Published in 计算机工程 (2017)
    “…现有的动态最短路径树算法在某些边的权值频繁变化时,会造成动态网络中的最短路径树频繁更新,而且当网络中的路由器毁坏或增加新的路由器时,该算法难于应用到构造最短路径树…”
    Get full text
    Journal Article