New dynamic SPT algorithm based on a ball-and-string model

Narváez, Paolo; Siu, Kai‐Yeung; Tzeng, Hong-Yi

doi:10.1109/infcom.1999.751488

Cited by 24 publications

(39 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To decrease the complexity of the dynamic update procedure, [2,4] reduced computation times compared to static methods by separating the weightincrease and weight-decrease operations for all possible link weight updates. Redundant computations in their algorithms were reduced in later work [5]. Reference [5] presented an algorithm based on a ball and string model where an edge weight change corresponds to a change in the length of the string.…”

Section: Introductionmentioning

confidence: 99%

“…Reference [5] presented an algorithm based on a ball and string model where an edge weight change corresponds to a change in the length of the string. Algorithms in [4,5], once a node v is adjusted, will subsequently refine a branch node in a subtree of the old SPT with the root on v. A mechanism of this kind introduces node update redundancy since a redundant factor (γ ) remains in [4] and no specific algorithm complexity is illustrated in [5] for the multiple waves of update propagation. In other words, a node may be altered several times before it attains its final state.…”

Section: Introductionmentioning

confidence: 99%

“…Dynamic algorithms for updating an outdated SPT as proposed in [2,4,5] have largely been applied to single link state change, yet there is no doubt that greater attention should be paid to multiple link state changes. In real networks, it is not worthwhile to update an old SPT whenever a small vibration of a link state occurs because given the instability of network traffic, the modified weight will in any case quickly return to its previous value.…”

Section: Introductionmentioning

confidence: 99%

“…Usually, to minimize the computation time, the updating process handles the edge weight-decreased group first [4,5]. It is simpler to update weight-increased links than to update weight-decreased links.…”

Section: Introductionmentioning

confidence: 99%

“…2. Given multiple edge weight decrements in a graph, it is hard to calculate a maximum bound of steps needed to refresh a single node to its final state in the new SPT [5]. In other words, during a dynamic update process, a node could be updated many times.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Dynamic SPT update for multiple link state decrements in network routing

Xiao

Cao

2008

J Supercomput

View full text Add to dashboard Cite

Previous approaches to the dynamic updating of Shortest Path Trees (SPTs) have in the main focused on just one link state change. Not much work has been done on the problem of deriving a new SPT from an existing SPT for multiple link state decrements in a network that applies link-state routing protocols such as OSPF and IS-IS. This problem is complex because in the process of updating an SPT there are, firstly, no simple forms of node set to presumable contain all nodes to be updated and, secondly, multiple decrements can be accumulated to make the updating much harder. If we adopt the updating mechanisms engaged in one link state change for the case of multiple link state decrements, the result is node update redundancy, as a node changes several times before it reaches its final state in the new SPT. This paper proposes two dynamic algorithms (MaxR, MinD) for obviating unnecessary node updates by having part nodes updated in a branch on the SPT only after selecting a particular node from a built node list. The algorithm complexity analysis and simulation results show that MaxR and MinD require fewer node updates during dynamic update procedures than do other algorithms for updating SPT of multiple link state decrements.

show abstract

Section: Introductionmentioning

confidence: 99%