Lightweight PIM—a new multicast routing protocol

Bartczak, Tomasz; Zwierzykowski, Piotr

doi:10.1002/dac.2407

Cited by 8 publications

(3 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Routing protocols use algorithms and optimization techniques forming the optimal path through the network [10,11] or minimum distribution tree [12][13][14]. Routing protocols for wireless mesh networks can be divided into The results presented in Fig.…”

Section: Routing Protocolsmentioning

confidence: 99%

The Impact of Selected Parameters on the Performance of Routing Protocols in Wireless Sensor Networks

Piechowiak

Zwierzykowski

Kotlarz

et al. 2017

Image Processing &Amp; Communications

Self Cite

View full text Add to dashboard Cite

The aim of the article was to compare the effectiveness of the selected routing protocols for wireless sensor networks taking into account a number of specific parameters as network troughput, packet error rate and message buffer capacity for different network topologies. The simulation research was conducted in open source OMNeT++ environment. In order to achieve the assumed requirements, four different-sized network topologies were established and AODV and DYMO routing protocols were adapted.

show abstract

Section: Routing Protocolsmentioning

confidence: 99%

The Impact of Selected Parameters on the Performance of Routing Protocols in Wireless Sensor Networks

Piechowiak

Zwierzykowski

Kotlarz

et al. 2017

Image Processing &Amp; Communications

Self Cite

View full text Add to dashboard Cite

show abstract

“…Another option would be to use Internet Protocol (IP) multicast . However, IP multicast is not a feasible solution for a scalable video streaming service because of the sparse deployment on the Internet.…”

Section: Related Workmentioning

confidence: 99%

Using topology information for quality‐aware Peer‐to‐Peer multilayer video streaming

Sluijs

Wauters

Develder

et al. 2015

Int J Communication

View full text Add to dashboard Cite

SUMMARYDue to increasing bandwidth capacities, the Internet has become a viable transport medium for a (live) video. Often, delivery of video streams relies on the client-server paradigm and therefore exhibits limited scalability. The Peer-to-Peer (P2P) network model is an attractive and scalable candidate to stream video content to end users. However, these P2P frameworks typically operate in a network agnostic mode. Introducing network topology information into these P2P frameworks offers opportunities to enhance the performance. In this paper, we introduce a model to include network information when streaming a (multilayered) video in P2P frameworks. An important metric for video stream providers is the content quality perceived by end users. The optimization studied here aims at maximizing the number of users receiving a high quality video. The paper addresses the optimization problem seen from the stream provider's viewpoint, having access to network topology information. An exact optimization approach is presented for benchmarking purposes and a heuristic approach to cope with realistic network sizes. In addition, we present an approach to decide the deployment location of peering functionality. The results show that our strategy significantly decreases the fraction of destinations receiving only the base layer, and by introducing extra peering functionality, network capacities are used more efficiently.

show abstract

“…The methods for optimal execution of this task have been studied by network researchers and engineers for many years now. Routing-related problems have been viewed from the point of view of protocols [1]- [6], as well as algorithms [7]- [12]. To achieve optimal routing, algorithms such as the Dijkstra algorithm are used, for example in the OSPF protocol [13].…”

Section: Introductionmentioning

confidence: 99%

Comparison of Multicast Algorithm Evaluation Results in Low and High Multicast Saturation Environments

Stachowiak¹,

Zwierzykowski²

2019

JTIT

Self Cite

View full text Add to dashboard Cite

The multicast quality of service-enabled routing is a computationally challenging task. Despite ongoing research eﬀorts, the associated mathematical problems are still considered to be NP-hard. In certain applications, computational complexity of ﬁnding the optimal connection between a set of network devices may be a particularly diﬃcult challenge. For example, connecting a small group of participants of a teleconference is not much more complex than setting up a set of mutual point-to-point connections. On the other hand, satisfying the demand for such services as IPTV, with their receivers constituting the majority of the network, requires applying appropriate optimization methods in order to ensure real system execution. In this paper, algorithms solving this class of problems are considered. The notion of multicast saturation is introduced to measure the amount of multicast participants relative to the entire network, and the eﬃciency of the analyzed algorithms is evaluated for diﬀerent saturation degrees.

show abstract

Lightweight PIM—a new multicast routing protocol

Cited by 8 publications

References 25 publications

The Impact of Selected Parameters on the Performance of Routing Protocols in Wireless Sensor Networks

The Impact of Selected Parameters on the Performance of Routing Protocols in Wireless Sensor Networks

Using topology information for quality‐aware Peer‐to‐Peer multilayer video streaming

Comparison of Multicast Algorithm Evaluation Results in Low and High Multicast Saturation Environments

Contact Info

Product

Resources

About