—Applying network coding on broadcasting service is known to reduce times of transmission in the process of recovering the loss packets. In previous design, coding coefficients ...
Recently, Becker and Geiger and Bafna, Berman and Fujito gave 2-approximation algorithms for the feedback vertex set problem in undirected graphs. We show how their algorithms can...
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
— Infrastructure-based overlay networks have been proposed to support the quality of service requirements of a wide range of applications. In this paper, we study using infrastru...
Network traffic logs play an important role in incident analysis. With the increasing throughput of network links, maintaining a complete log of all network activity has become a...