• The Journal of the Korea Contents Association
• /
• v.10 no.9
• /
• pp.68-78
• /
• 2010

As the IP multicast function is very slowly deployed in Internet due to its scalability problem and inter-domain interoperability problem, interest in the P2P(Peer-to-Peer) streaming technologies for the realtime multimedia multicast applications such as IPTV is highly growing. This paper proposes a P2P streaming method for the QoS-sensitive multimedia multicast applications such as highly-interactive personal IPTV and video conferences. The proposed P2P streaming method allows an application to construct a reliable streaming tree in which a proper number of backup peers are placed according to its reliability requirement. The reliable streaming tree reduces the reconnection delay, occurred in the case of a normal and/or abnormal peer leave, so as to minimize the loss of streaming data. In the proposed P2P streaming method, the join delay of a peer called startup delay is also substantially reduced because the bandwidth and end-to-end delay information of every peer kept in a distributed way allows the target peer for a joining peer to be able to be quickly determined. Moreover, the proposed method's peer admission control mechanism based on the bandwidth and end-to-end delay enables the delay-bounded streaming services to be provided for its corresponding applications.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.10
• /
• pp.73-81
• /
• 2011

The WBAN(Wireless Body Area Network) technology is a short distance wireless network which provides each device's interactive communication by connecting devices inside and outside of body located within 3 meters. Standardization on the physical layer, data link layer, network layer and application layer is in progress by IEEE 802.15.6 TG BAN. The The WBAN servides consists of both medical and non-medical applications. The medical application service uses the sensor that transfer the periodic traffic and have different data rates. It uses GTS method to guarantee QoS. In this paper, a new method is proposed, which are suitable design for MAC Protocol. Firstly, MAC frame structure and a primitive based on the WBAN are proposed. Secondly, we proposed the GTS algorithm improved the channel utilization based on the WFQ(Weighted Fair Queuing). The proposed scheduling method is improved channel utilization compared with i-Game(Round Robin scheduling method).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.10
• /
• pp.888-893
• /
• 2012

Quality of Service (QoS) provisioning is an important issue in the design of next generation wireless network. In visible light communication (VLC) networks, link switching is a solution to maintain or improve the quality of communication. In this paper, we propose a novel link switching scheme using the location of mobile nodes (MNs). The current serving transmitter uses location history of the MN to find out which neighbor transmitter the MN is approaching. This neighbor transmitter is chosen to inform the MN as the next serving transmitter. The simulation results show that our proposed scheme gains better performance than non-predictive link switching scheme.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.86-88
• /
• 2004

As the rapid incensement of the number of internet users has occurred recently, many multimedia application services have been emerging. To improve quality of service, traffic can be suggested to be classified with priority in EPON(Ethernet Passive Optical Network), which is supporting the multimedia application services. In this paper, multimedia application services treat bandwidth classifying device in serving both delay sensitive traffic for real-time audio, video and voice data such as VoIP(Voice over Internet Protocol), and nonreal-time traffic such as BE(Best Effort). With looking through existing mechanisms, new mechanism to improve the quality will be suggested. The delay performances and packet losses of traffic achieved by supporting bandwidth allocation of upstream traffic in suggested mechanism will be analyzed with simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11B
• /
• pp.1031-1037
• /
• 2003

A new scheduling scheme, which uses channel quality information of each flow in Bluetooth system of ad-hoc network for effective bandwidth assignment, has been proposed in this paper. By an effective bandwidth assignment, QoS (Quality of Service) could have been ensured in case of asymmetric data traffic, mixed data transmission, and congested data transmission in a specific channel. The scheduling algorithm determines channel weights using partial channel information of flows. Case studies conducted by NS-2 (Network Simulator 2) and Bluehoc simulator has been presented to show the effectiveness of the proposed scheduling scheme.

• Convergence Security Journal
• /
• v.13 no.4
• /
• pp.19-25
• /
• 2013

The increasing demand for fast, flexible and guaranteed Quality of Service (QoS) in core networks has caused to deploy MultiProtocol Label Switching (MPLS) and Generalized MPLS (GMPLS) control plane. In GMPLS control plane, path computation and cooperation processes are one of the crucial element to maintain an acceptable level of service. The Internet Engineering Task Force (IETF) has proposed the Path Computation Element (PCE) architecture. The PCE is a dedicated network element devoted to path computation process and communications between Path Computation Clients (PCC) and PCEs is realized through the PCE Protocol (PCEP). This paper examines the PCE-based path computation architecture to include the design and implementation of PCEP. The functional modules including Finite State Machine (FSM) and related key design issues of each state are presented. In particular we also discuss internal/external protocol interfaces that efficiently control the communication channels.

• 한국정보통신설비학회:학술대회논문집
• /
• 2007.08a
• /
• pp.136-141
• /
• 2007

The frequency accuracy and phase alignment is necessary for ensuring the quality of service (QoS) for applications such as voice, real-time video, wireless hand-off, and data over a converged access medium at the telecom network. As telecom networks evolve from circuit to packet switching, proper synchronization algorithm should be meditated for IP networks to achieve performance quality comparable to that of legacy circuit-switched networks. The Time of Packet (ToP) specified in IEEE 1588 is able to synchronize distributed clocks with an accuracy of less than one microsecond in packet networks. But, The ToP can be affected by impairments of a network such as packet delay variation. This paper proposes the efficient method to minimize the expectable delay variation when ToP synchronizes the distributed clocks. The simulation results are presented to demonstrate the improved performance case when the efficient ToP transmit algorithm is applied.

• Journal of Broadcast Engineering
• /
• v.19 no.4
• /
• pp.439-452
• /
• 2014

This paper suggests the method to extend service area by using the transmit offset delay in T-DMB single frequency network (SFN). In general, synchronization of the transmit time of all site can be done by using the reference clock of GPS, which dose not reflect the details geographical characteristics and transmit specifications of each site. Applying the site-specific transmit offset delay, we could extend the service area of SFN T-DMB. Applying the transmit offset delay, it is found that the signal quality in the region of weak receive field strength was improved and upto 4~8 km service area expansion was achieved by satisfying the minimum field strength ($45dB{\mu}V/m$) recommended by the Korea Communications Commission (KCC). Site-specific offset delay was calculated considering the geographic service area characteristics, distribution of electric field strength between neighboring sites and site-specific service target area. Experiments were carried out in order to analyze impact of calculated offset delay on the T-DMB SFN and also to confirm that the offset delay extends T-DMB service coverage. The experiment was done in metropolitan T-DMB service areas.

• Journal of Advanced Navigation Technology
• /
• v.18 no.5
• /
• pp.415-420
• /
• 2014

Another crucial issue is a providing secondary user(SU) with the its guaranteed quality of service(QoS) in cognitive radio systems, from the SU view to be allowed to opportunistically utilize the primary user(PU) spectrum on non-interfering. In this paper, we propose a bandwidth reallocation scheme for reducing SU dropping rate through renegotiation of requested channel numbers when available bandwidth is not enough for accepting the spectrum handoff SUs. We categorize SU calls into two types : the first priority and the second priority SU, and the first SU' service is supported by bandwidth reservation based on ARMA prediction model for PU arrivals, while the second SU's bandwidth demands for spectrum handoff is to be reallocated through their renegotiation. Simulation results show that our scheme can improve SU dropping rate and system resource utilization efficiency by bandwidth reallocation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.6
• /
• pp.1522-1545
• /
• 2012

Call admission control (CAC) plays an important role in mobile cellular network to guarantee the quality of service (QoS). In this paper, a dynamic hybrid CAC scheme with integrated cutoff priority and handoff queue for mobile cellular network is proposed and some performance metrics are derived. The unique characteristic of the proposed CAC scheme is that it can support any number of service types and that the cutoff thresholds for handoff calls are dynamically adjusted according to the number of service types and service priority index. Moreover, timeouts of handoff calls in queues are also considered in our scheme. By modeling the proposed CAC scheme with a one-dimensional Markov chain (1DMC), some performance metrics are derived, which include new call blocking probability ($P_{nb}$), forced termination probability (PF), average queue length, average waiting time in queue, offered traffic utilization, wireless channel utilization and system performance which is defined as the ratio of channel utilization to Grade of Service (GoS) cost function. In order to validate the correctness of the derived analytical performance metrics, simulation is performed. It is shown that simulation results match closely with the derived analytic results in terms of $P_{nb}$ and PF. And then, to show the advantage of 1DMC modeling for the performance analysis of our proposed CAC scheme, the computing complexity of multi-dimensional Markov chain (MDMC) modeling in performance analysis is analyzed in detail. It is indicated that state-space cardinality, which reflects the computing complexity of MDMC, increases exponentially with the number of service types and total channels in a cell. However, the state-space cardinality of our 1DMC model for performance analysis is unrelated to the number of service types and is determined by total number of channels and queue capacity of the highest priority service in a cell. At last, the performance comparison between our CAC scheme and Mahmoud ASH's scheme is carried out. The results show that our CAC scheme performs well to some extend.