An efficient network-wide broadcasting based on hop-limited shortest-path trees

Shioda, Shigeo; Ohtsuka, Kenji; Sato, Tomomasa

doi:10.1016/j.comnet.2008.08.015

Cited by 10 publications

(6 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The simulations examine the effectiveness of our strategy in terms of the number of propagated messages and the message coverage ratio in comparison with the HMT approach [14] and Paper [15]. The main advantage of the HMT approach is that it could increase the network coverage and decrease the number of propagated messages in the unstructured P2P networks according the simulation results in paper [14].…”

Section: Simulation Settingsmentioning

confidence: 95%

“…Work in [15] proposed a strategy for reducing the redundant propagations of the message by constructing and using n-hop-limited shortest path trees, in which all the nodes are more likely to receive the message for only one time. However, this approach suffers from two problems.…”

Section: Related Workmentioning

confidence: 99%

“…From 250th simulation cycle, since each node has established a relatively complete message list which contains the messages issued from every space and time, and also those past received messages help the nodes accurately determine the message forwarding nodes, our strategy has a more stable and fewer number of messages than those of the other two approaches. The strategy of Paper [15] always needs to construct and maintain n-hop-limited shortest path trees by flooding "dummy" messages. Therefore, the number of messages produced by using the strategy of Paper [15] is more than that of our strategy after 150 simulation cycles.…”

Section: Number Of Messages and Coverage Ratios With Relatively Fixedmentioning

confidence: 99%

“…The strategy of Paper [15] always needs to construct and maintain n-hop-limited shortest path trees by flooding "dummy" messages. Therefore, the number of messages produced by using the strategy of Paper [15] is more than that of our strategy after 150 simulation cycles. The HMT approach needs fewer messages in comparison with our strategy in the beginning of the simulation since it only forwards the message to a part of its neighbor nodes, but its number of messages is almost unchanged in each simulation cycle.…”

Section: Number Of Messages and Coverage Ratios With Relatively Fixedmentioning

confidence: 99%

See 3 more Smart Citations

A traffic-efficient message forwarding approach in unstructured P2P networks

Meng

Liu

2015

Peer-to-Peer Netw. Appl.

View full text Add to dashboard Cite

With more and more peer-to-peer (P2P) applications being utilized, the P2P traffic accounts for the majority in Internet, and thus leading to the network congestion problem. Reducing the redundant propagations of messages is an effective approach for solving such problem in unstructured P2P networks. In this paper, we first define a novel message structure which contains the information of message propagation path, and then three operations, including the inheritance, supplement and collection, on the message transmission paths are proposed, based on which a node could forward the message to the nodes who have not received the message yet purposefully by using the information of the past received messages and the characteristics of space and time of node activities, and thus eliminating the bandwidth consumption problem caused by the flooding-based message propagation approaches. The simulation results show that our strategy could effectively reduce the number of the redundant messages without lowering the message coverage ratio.

show abstract

Section: Simulation Settingsmentioning

confidence: 95%

Section: Related Workmentioning

confidence: 99%

Section: Number Of Messages and Coverage Ratios With Relatively Fixedmentioning

confidence: 99%

Section: Number Of Messages and Coverage Ratios With Relatively Fixedmentioning

confidence: 99%

See 2 more Smart Citations

A traffic-efficient message forwarding approach in unstructured P2P networks

Meng

Liu

2015

Peer-to-Peer Netw. Appl.

View full text Add to dashboard Cite

show abstract

“…The OTNDP has direct applications to the design of communication networks [20], hydric networks [12], structure of organizations [3], systems design, etc. A number of algorithms and heuristics can be found in the literature for tree design and tree encoding [4,[17][18][19][20][21]. Specifically, intensive research has been carried out in the field of evolutionary computation applied to the resolution of problems of tree design [16,21].…”

Section: Introductionmentioning

confidence: 99%

Evolutionary design of oriented-tree networks using Cayley-type encodings

Salcedo‐Sanz

Naldi

Pérez-Bellido

et al. 2009

Information Sciences

View full text Add to dashboard Cite

a b s t r a c tThis paper introduces the oriented-tree network design problem (OTNDP), a general problem of tree network design with several applications in different fields. We also present several adaptations needed by evolutionary algorithms with Cayley-type encodings to tackle the OTNDP. In particular, we present these adaptations in two Cayley-encodings known as Prüfer and Dandelion codes. We include changes in Cayley-encodings to consider rooted trees. We also show how to use a fixed-length encoding for Cayley codes in evolutionary algorithms, and how to guarantee that the optimal solution is included in the search space. Finally, we present several adaptations of the evolutionary algorithm's operators to deal with Cayley-encodings for the OTNDP. In the experimental part of the paper, we compare the performance of an evolutionary algorithm (implementing the two Cayleyencodings considered) in several OTNDP instances: first, we test the proposed techniques in randomly generated instances, and second, we tackle a real application of the OTNDP: the optimal design of an interactive voice response system (IVR) in a call center.

show abstract

Regional Road Network Shortest Path Algorithm in Vehicle Navigation Systems

Liu¹,

Yang²,

2013

Communications in Computer and Information Science

View full text Add to dashboard Cite

An efficient network-wide broadcasting based on hop-limited shortest-path trees

Cited by 10 publications

References 24 publications

A traffic-efficient message forwarding approach in unstructured P2P networks

A traffic-efficient message forwarding approach in unstructured P2P networks

Evolutionary design of oriented-tree networks using Cayley-type encodings

Regional Road Network Shortest Path Algorithm in Vehicle Navigation Systems

Contact Info

Product

Resources

About