• Journal of Communications and Networks
• /
• v.12 no.1
• /
• pp.86-94
• /
• 2010

In this paper, we present a decentralized algorithm to find minimum cost quality of service (QoS) flow subgraphs in network coded multicast schemes. The main objective is to find minimum cost subgraphs that also satisfy user-specified QoS constraints, specifically with respect to rate and delay demands. We consider networks with multiple multicast sessions. Although earlier network coding algorithms in this area have demonstrated performance improvements in terms of QoS parameters, the proposed QoS network coding approach provides a framework that guarantees QoS constraints are actually met over the network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.1
• /
• pp.183-195
• /
• 2014

Multicasting is an efficient way of group communications because one sender can transmit data to multiple receivers with only one transmission. Furthermore, multicasting is considered an appropriate transmission method for multimedia services. Multimedia applications are expected to become more prevalent over mobile ad-hoc networks in the near future. Therefore, achieving reliability in multimedia communications is an important task. In this paper, we propose a leader-based reliable multicast medium access control layer protocol for multimedia applications to enhance video quality. We present a Markov chain model and numerical formulation of our proposed system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12B
• /
• pp.2283-2291
• /
• 1999

Most of collaborative applications use the Server-Client paradigm where all requests of clients will be delivered first to server and that server distributes again the requests to the rest of clients. This server-oriented operation and data transmission mechanism always presents end-to-end communications between the server and clients that can notably decrease the overall performance of applications. In this paper, we propose a new design approach to inhibit the inefficiency of applications using active networking concepts. We propose the ASM service that offers an application-specific in-network multicast functions, the AMTC service and its tree algorithm that builds anon-core based shared tree for multicast. These proposed services locate in active nodes performing its services as part of the overall system to improve the performance of collaborative applications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.6B
• /
• pp.1108-1112
• /
• 1999

In this paper, we propose an efficient ABR multicast algorithm for ATM networks. In ABR multicast algorithim, the feedback consolidation is necessary to avoid excessive backward resource management (BRM) cells and to aggregate the information from BRM cells received from each branch. The proposed scheme is shown to achieve fast transient response to the congestion status on a branch as well as effectively eliminate the consolidation noise through system simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.2
• /
• pp.386-388
• /
• 2017

In this paper, we propose a novel protocol design for multi-subband feedback-based multicast services in LTE systems, which reduces feedback overheads with guaranteeing QoS. Through the experimental results, it is manifested that the proposed protocol is able to reduce more feedback overheads in comparison with the conventional scheme.

• ETRI Journal
• /
• v.28 no.6
• /
• pp.709-720
• /
• 2006

In this paper, we suggest a simple and efficient multiple-forwarder-based file distribution method which can work with a tree-based application layer multicast. Existing multiple-forwarder approaches require high control overhead. The proposed method exploits the assumption that receivers join a session at different times. In tree-based application layer multicast, a set of data packets is delivered from its parent after a receiver has joined but before the next receiver joins without overlapping that of other receivers. The proposed method selects forwarders from among the preceding receivers and the forwarder forwards data packets from the non-overlapping data packet set. Three variations of forwarder selection algorithms are proposed. The impact of the proposed algorithms is evaluated using numerical analysis. A performance evaluation using PlanetLab, a global area overlay testbed, shows that the proposed method enhances throughput while maintaining the data packet duplication ratio and control overhead significantly lower than the existing method, Bullet.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.12
• /
• pp.2626-2634
• /
• 1997

The purpose of multicasting is to reduce the network costs for transmitting the same traffic to multiple destinations. In this paper, an efficient delay-bounded multicasting routing algorithm is proposed, which satistifies the network conditions of cost minimization and can adjust the dynamic events, such as 'leave and/or join ones' from the multicast group. Also, our algorithm is designed for various network requirements such as the efficiet dynamic group support, high-quality data distribution, and adaptability to variable situation. After the delay tolerance and the maximum group size are determined according to network state and requirements for delay and cost, the dynamic delay-bounded multicast tree is constructed using partial multicast routing. We evaluate the performance of the proposed algorithm by running simulations on randomly generated test networks using a Sun Sparc 20 workstation. We were able to obtain good simulation resutls, which means solutions that lies between the minimum cost solution and the minimum delay one.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8B
• /
• pp.1401-1411
• /
• 1999

Due to the increase of multimedia services, multicasting is considered as important design factor for ATM switch. To resolve the traffic expansion problem that is occurred by multicast in multistage interconnection networks, this paper proposes the multicast switch using a high-speed bus and a shared memory switch. Since the proposed switch uses a high-speed time division bus as a connection medium and chooses a shared memory switch as a basic switch module, it provides good port scalability. The traffic arbitration scheme enables internal non-blocking. By simulation we proves a good performance in the data throughput and the cell delay.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7B
• /
• pp.638-646
• /
• 2003

In this paper, we propose a group communication approach which can provide quality of service for soft real-time applications. This proposed scheme combining the explicit multicast, end-point measure-based admission control scheme(EMBAC), and diffserv, removes the need of maintaining state information in the network, so that it would be easily deployable in real networks. We propose the scheme of node configuration to measure the quality of the diffserv network, and that of managing EMBAC over group communication environment. By simulation, we validate the QoS of the proposed multicast service network.

• Journal of Communications and Networks
• /
• v.4 no.3
• /
• pp.246-255
• /
• 2002

Constrained minimum Steiner tree (CMST) problem is a key issue in multicast routing with quality of service (QoS) support. Bounded shortest path algorithm (BSMA) has been recognized as one of the best algorithms for the CMST problem due to its excellent cost performance. This algorithm starts with a minimumdelay tree, and then iteratively uses a
-shortest-path (KSP) algorithm to search for a better path to replace a “superedge” in the existing tree, and consequently reduces the cost of the tree. The major drawback of BSMA is its high time complexity because of the use of the KSP algorithm. For this reason, we investigate in this paper the possibility of more efficient implementations of BSMA by using different methods to locate the target path for replacing a superedge. Our experimental results indicate that our methods can significantly reduce the time complexity of BSMA without deteriorating the cost performance.