• The KIPS Transactions:PartC
• /
• v.16C no.2
• /
• pp.217-222
• /
• 2009

This paper proposes the number of Optical Network Unit (ONU) based priority scheduling mechanism over Ethernet Passive Optical Network (EPON) to support multicast Quality of Service (QoS) for Internet Protocol Television (IPTV) service. Multicast QoS is effected by the receivers' number of a packet because multicast efficiency is determined by how many receivers are received multiple copied packets. Therefore, the proposed mechanism assigns a priority with the number of ONUs to allocate high priority to IPTV services used by many people and firstly transmits a packet with high priority. By doing so, we show that the proposed mechanism support favorite IPTV services with better and stable QoS in spite of congestion.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.113-116
• /
• 2001

In this paper, a new multicasting scheduling is proposed for WDM single-hop broadcast network. The main idea of traditional multicast scheduling algorithms is partitioning the multicast group into several subgroups to reduce the delay time after receiving previous message. Those partitioning algorithms are grouping method of receivers already tuned to transmitters wavelength. However, multicast scheduling shows better performance by considering the previous status of receivers. Thus, in this paper, a new subgrouping method is proposed to minimize delay through collecting the current status of receivers. This method is operated by using the tunable transceiver in WDM single hop broadcasting network and uses fixed control channel for collecting the status of receivers. In addition, we analyzed the performance of proposed method through the computer simulation and then compared with existing multicast scheduling algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.86-89
• /
• 2002

Recently, video conferencing, Web-casting service, and network sane service which use multicast-based service are popular in Internet. In order to support the broadband Internet services efficiently, more communication bandwidth are needed. The WDM single-hop broadcast network topology is coming into the spotlight in next-generation access networks area. In this paper, the new multicast scheduling algorithm, PGM, is proposed and is evaluated through the computer simulation. The PGM method shows the better performance comparing with existing multicast scheduling algorithm.

• Journal of Korea Multimedia Society
• /
• v.6 no.2
• /
• pp.301-308
• /
• 2003

In this paper, we propose a multicast ATM switch that reduces traffic load by using the method of storing unicast cells and multicast cells separately according to the type of the cells. The switch is based on a shared memory type to reduce HOL blocking and deadlock. In the proposed switch, we use a control scheme that schedules stored cells to output ports to reduce the loss of traffic cells and to output effectively. We analyzed the Performance of the proposed switch through the computer simulation and the results have shown the effectiveness of the switch.

• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.657-664
• /
• 2001

In our predecessor paper(Part I)[13], we introduced a graph that represents the crosstalk relationship among multicast connections in the photonic Banyan-type switching network, and found the upper bound on the degree of it. In this paper(Part II), we consider the number of routing rounds(i.e., scheduling length) required for SE(switching element)-disjoint multicasting in photonic Banyan-type switching networks. Unfortunately, the problem to find an optimal scheduling length is NP-complete thus, we propose an approximation algorithm that gives its scheduling length is always within double of the upper bound on the optimal length. We also study the scheduling length on the Iink-disjoint(i.e., nonblocking) multicasting. Various nonblocking Banyan-type multicasting networks are found under the scheduling lengths.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.6
• /
• pp.233-241
• /
• 2008

The overlay multicast that has been recently presented as an alternative for the IP multicast needs scheduling method that can apply the system resource and the network bandwidth for the many users. We propose a efficient overlay multicasting network policy for multimedia services with composite stream service topology. And in order to evaluate the ability of the proposed scheme's performance, We test the performance of multi_casting nodes with RTT values, the bandwidth attrition rate for building the network topology and MOR effects with Overcast[5] The result of simulation shows improves about $8{\sim}20%$ of performance.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.7
• /
• pp.1614-1620
• /
• 2009

The overlay multicast that has been recently presented as an alternative for the IP multicast has been getting much persuasion by the system resource and the network bandwidth and the advancement of the network cost. we propose a overlay multi_casting network policy for efficient multimedia services with P2P join scheduling. In order to evaluate the performance of proposed scheme, We test the performance of multi_casting nodes with average join count, the maximum guaranteed waiting time and buffer starvation ratio with similar techniques. The result of simulation shows improved about 15${\sim}$20% of performance.

• Journal of KIISE
• /
• v.43 no.2
• /
• pp.246-255
• /
• 2016

The orthogonal frequency-division multiple access (OFDMA) systems are well suited to multi-rate multicast transmission, as they allow flexible resource allocation across both frequency and time, and provide adaptive modulation and coding schemes. Unlike layered video coding, the multiple description coding (MDC) enables flexible decomposition of the raw video stream into two or more substreams. The quality of the video stream is expected to be roughly proportional to data rate sustained by the receiver. This paper describes a mathematical model of resource allocation and throughput in the multi-rate video multicast for the OFDMA wireless and mobile networks. The impact on mean opinion score (MOS), as a measurement of user-perceived quality (by employing a variety of scheduling disciplines) is discussed in terms of utility maximization and proportional fairness. We propose a pruning algorithm to ensure a minimum video quality even for a subset of users at the resource limitation, and show the optimal number of substreams and their rates can sustain.

• Journal of Ubiquitous Convergence Technology
• /
• v.1 no.1
• /
• pp.28-34
• /
• 2007

Tree-based reliable multicast protocols provide scalability by distributing error-recovery tasks among several repair nodes. These repair nodes perform local error recovery for their receiver nodes using the data stored in their buffers. We propose a packet loss patterns adaptive feedback scheduling scheme to manage these buffers in an efficient manner. Under our scheme, receiver nodes send NAKs to repair nodes to request packet retransmissions only when the packet losses are independent events from other nodes. At dynamic and infrequent intervals, they also send ACKs to indicate which packets can be safely discarded from the repair node's buffer. Our scheme reduces delay in error recovery because the requested packets are almost always available in the repair node's buffers. It also reduces the repair node's workload because (a) each receiver node sends infrequent ACKs with non-fixed intervals and (b) their sending times are fairly distributed among all the receiver nodes.

• The Journal of Information Technology
• /
• v.4 no.4
• /
• pp.65-72
• /
• 2001

This paper investigates the Performance of MSA l (group partition based reservation scheduling algorithm) and MSA ll (group based reservation scheduling algorithm) for multicast service in single-hop WDM networks. Simulation results show that MSA l produces lower mean packet delay than MSA ll when the channel resource is sufficient. However, when the channel resource is limited, MSA ll produces lower mean packet delay than MSA I when traffic load is heavy.