• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12A
• /
• pp.1922-1931
• /
• 1999

A multicast traffic’s feature is the function of providing a point to multipoints cell transmission, which is emerging from the main function of ATM switch. However, when a conventional point-to-point switch executes a multicast function, the excess load is occurred because unicast cell as well as multicast cell passed the copy network. Additionally, due to the excess load, multicast cells collide with other cells in a switch. Thus a deadlock that losses cells raises, extremely diminishes the performance of switch. An input queued switch also has a defect of the HOL (Head of Line) blocking that less lessens the performance of the switch. In the proposed multicast switch, we use shared memory switch to reduce HOL blocking and deadlock. In order to decrease switch’s complexity and cell's processing time, to improve a throughput, we utilize the method that routes a cell on a separated paths by traffic pattern and the scheduling algorithm that processes a maximum 2N cell at once in the control part. Besides, when cells is congested at an output port, a cell loss probability increases. Thus we use the Output Memory (OM) to reduce the cell loss probability. And we make use of the method that stores the assigned memory (UM, MM) with a cell by a traffic pattern and clears the cell of the Output memory after a fixed saving time to improve the memory utilization rate. The performance of the proposed switch is executed and compared with the conventional policy under the burst traffic condition through both the analysis based on Markov chain and simulation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1998.11a
• /
• pp.450-455
• /
• 1998

This paper proposes an enhanced transport protocol for multipeer communications. It is assumed that there exists a transport connection owner that takes the roles of the establishment, management and termination of a transport connection. The proposed protocol classifies the data transfer type into simplex, duplex and N-plex multicasts and provides several transport services to support various requirements in group communications. The general operations and reliability controls of each transfer type are different from one another and carried out by a shared control tree. The QoS negotiation is performed during the creation phase. The notification of negotiated values is followed by an acknowledgment procedure for confirmation. The four-way handshake is introduced. After negotiation, such a resource reservation protocol as RSVP can reserve system and network resources according to the arbitrated values. This paper suggests a conceptual model of the transport layer and its protocol behaviors over the IP multicast and RSVP network.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1998.11a
• /
• pp.500-506
• /
• 1998

This paper proposes an extension scheme of the well-known Berkeley Socket Interface for supporting QoS-provided multipeer multimedia communications. The current BSD Socket Interface has been TCP/IP-centric historically and the protocol suite was developed for the peer-to-peer best effort data communications. In order to support multiparty multimedia applications, such key functions as group management, QoS control, and reliable multicast transport should be exploited in the current simple unicast communication architecture and the well-known interface should be extended to cover the functions. This paper proposes a few new API functions and some changes in the current APIs.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.11a
• /
• pp.115-116
• /
• 2010

• ETRI Journal
• /
• v.35 no.6
• /
• pp.1068-1074
• /
• 2013

This paper proposes an additional forward error correction (FEC) layer to compensate for the defectiveness inherent in the conventional FEC layer in the Long Term Evolution specifications. The proposed additional layer is called a graceful degradation (GD)-FEC layer and maintains desirable service quality even under burst data loss conditions of a few seconds. This paper also proposes a non-delayed decoding (NDD)-GD-FEC layer that is inherent in the decoding process. Computer simulations and device-based tests show a better loss recovery performance with a negligible increase in CPU utilization and occupied memory size.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.383-393
• /
• 2007

We present a new network-layer architecture that provides generalized addressing. The forwarding infrastructure is independent of the addressing architecture, so multiple addressing architectures can be used simultaneously. We compare our solution with the existing Internet protocols for unicast and multicast services, given the address assignment used in the Internet. By means of an extensive simulation study, we determine the range of parameters for which the overhead costs(delay, state, and network load) of our service are comparable to those of the Internet.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.7B
• /
• pp.679-689
• /
• 2006

Delivering multicast stream is one of the cost-saving approach in the large scale VOD environment. Because implementing VCR-like interactions for user's convenience in the multicast streaming system involves complex problems, we need the proper solutions for them. In this paper, we propose a hybrid scheme which uses the general P2P and the patching scheme with the Collaborative Interaction Streaming Scheme(CISS). CISS provides jumping functionability to the appropriate multicast session after VCR-like interaction in the environment in which multiple peers transmit VCR-like interaction streams to the VCR-like functionability request node to reduce the loads generated by frequent join or departure of peers at the multicast tree during providing VCR-like functionability. Therefore, with the proposed scheme we can distribute network traffic and reduce control overhead and latency. And to evaluate the performance of proposed scheme we compare it in the aspect of the performance of streaming delivery topology, control overhead and streaming quality with P2Cast[10] and DSL[11]. The simulation result shows that proposed P2Patching reduces about 30% of process overhead and enhances about $25{\sim}30%$ of streaming quality compared with DSL.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1336-1348
• /
• 2009

In this paper, we propose an energy-aware multi-tree video multicast scheme for wireless ad hoc networks. Some network nodes may have energy enough to receive and forward the whole video content whereas some may not. Even though the video quality may vary depending on the remaining energy, our scheme enables the low-energy nodes to join the video multicast session. The video stream is split into a set of multiple and independent descriptions by MDC (Multiple description coding) scheme. Each description corresponds to a substream and number of substreams determine the video quality. The member nodes determine how many substreams it would receive depending on the remaining energy and expected amount of packets per substream. So does the intermediate tree nodes. That builds a tree per substream and multiple trees per session. The data source disseminates each substream through corresponding tree. The video quality of the member nodes varies according to number of participating trees. We evaluate the performance of our scheme by simulation. Our scheme showed better peak signal to noise ratio and extended the lifetime of the network nodes compared with MAODV, which builds a single tree, and MT-MAODV, which builds multiple trees but does not consider the available energy.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.1
• /
• pp.91-102
• /
• 1996

The multicast routing algorithm is necessary to transmit multimedia traffic efficiently in ATM (asynchronous transfer mode) networks. In this paper, we propose the multicast routing algorithm which is based on VP/VC characteristic. The proposed algorithm is based on VP tree concept and using cost function which is based on VP/VC switching. The cost funication is composed of link cost, delay and weighting factor on delay and the weighting factor is calculated by delay sensitivity of the traffic. The proposed algorithm can choose delay bounded path which satisfies delay constraint, moreover it can choose optimal path among VPs which has the same link cost and satisfying delay constraint. With controlling weighting factor, proposed algorithm can set-up efficient path. When the weighting factor sets to be between 0.8 and 1, experimental results show that the perforance of proposed scheme is approximated to that of cost optimal algorithm and strongly delay optimized algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5B
• /
• pp.771-776
• /
• 2010

In this paper, we present an efficient centralized dynamic bandwidth allocation scheme with multicasting for asymmetric 10G-Ethernet Passive Optical Networks (10G-EPONs). The proposed scheme is based on multicast-burst polling and provides quality of service (QoS) with class of service (CoS) to different lasses of packets. It is shown that a well-known conventional interleaved polling scheme severely decreases downstream channel capacity for user traffic when the upstream network load is low (avalanche gate frequency). To overcome this problem, we have proposed a multicast burst polling scheme which shows impressively lower downstream bandwidth consumption compare to IPACT and moreover it did not show the light load penalty problem. Simulation results using an OPNET tool show that the multicast burst polling effectively eliminates light-load penalty and minimizes downstream bandwidth consumption under avalanche gate frequencies.