• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.6 s.336
• /
• pp.41-52
• /
• 2005

In wireless networks there are various errors, caused by multi-path fading and interference between devices which lower the network Performance. Especially, performance of IEEE 802.IS.3 High-Rate WPAN (Wireless Personal Area Network) which is operated in ISM unlicensed frequency band is easily affected by channel errors. In this paper, we propose a scheduling algorithm which takes channel errors into consideration in scheduling asynchronous data traffic. The proposed scheduling algorithm can allocate CTA(Channel Time Allocation) proportionally in accordance with the requested channel time of each device. It also prevents waste of channel time by allocating CTA of the channel-error devices to other channel-error free devices. After recovering from the channel error, the devices are compensated as much as they conceded during channel error status. Simulation results show that the proposed scheduling algorithm is superior to the existing SRPT(Shortest Remain Processing Time) and RR(Round Robin) in throughput and fairness aspects.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10B
• /
• pp.866-879
• /
• 2004

This paper presents a pricing model for maximizing a service provider's profit, taking into account consumers' quality-of-service dependent willingness to pay, in integrated voice/data mobile services. For the voice and the data services, time-sensitive pricing and volume-sensitive pricing mechanism will be applied, respectively, as in the case of Korea's mobile service market. Assuming that consumers are very sensitive to call interruption during handoff moments, the model presented here considers reserving guard channels exclusively for handoff traffic, in the process of frequency channels allocation, as well as guaranteeing consumers quality of service regarding call interruption rate. Ultimately, this model proposes a means to guarantee the quality of service in the short term, through pricing strategies as well as channel allocation policies, and the simulation results show that without expanding system resources, there exists a trade-off between profit and quality-of-service guarantee.

• Journal of the Institute of Convergence Signal Processing
• /
• v.8 no.1
• /
• pp.51-57
• /
• 2007

In this paper we introduce the concept of MPLS-based VPN and propose a scheme for providing VPN services in MPLS networks. Furthermore, we design the control components and the operational procedures and evaluated the performance of traditional VPN implementation methods and MPLS-based VPN. In this scheme it is possible to solve several problems that IP-based VPN pertains via the allocation of VPN ID and virtual space without tunneling, thereby providing effective VPN services. In other words, the MPLS-based VPN scheme uses MPLS networking technology together with the PSTN which can achieve a perfect segregation of user traffic on per-customer basis in a physical link and can guarantee high reliability and security levels. Specially, in the perspective of customers, it can save networking facilities installation and maintenance costs considerably. On the contrary, it possesses some shortcomings in that its deployment tends to be restricted within an ISP's network boundary and it is vulnerable to external security break-ins when going through public networks such as the Internet due to its lack of data encryption capability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.9B
• /
• pp.777-784
• /
• 2006

In this paper, we propose the PON-based access network based on conventional TDM-PON architecture, which utilizes WDM wavelength channel and bandwidth dynamically. It is also described a dynamic MAC protocol in order to increase the number of subscribers and efficiency of resource utilization. Of particular importance in the proposed approach for MAC protocol is that the wavelength channel and time slot for up/downlink is dynamically allocated according to the required QoS level and the amount of data in data transmission, through the dedicated control channel between OLT and ONU. We evaluate the performance of average packet end-to-end delay in a statistical analysis and numerical analysis. In addition, through simulations with various traffic models, we verified the superior performance of the proposed approach by comparing with the results of other E-PONs.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.4
• /
• pp.19-25
• /
• 2010

In this paper, the performance of the DoS information security algorithm is evaluated to provide the multimedia traffic between the nodes using the multicasting services. The essence technology for information security to distribute the multimedia contents is presented. Under the multicasting services, a node participating new group needs a new address and the node compares the collision with the existing nodes, then DoS attack can be occurred between the nodes by a malicious node. Using the NS2 simulator, the number of DoS attacks, the average number of trials to generate new address, and the average time to create address are analyzed. From simulation results, the efficient algorithm with relevant random number design according to the DRM network is needed to provide secure multimedia contents distribution.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.12
• /
• pp.2839-2846
• /
• 2014

New VHF band for use in VDE is determined by WRC-12 due to the overload of AIS VDL, and the system characteristics of the VDE is recommended as ITU-R M. 1842-1. CS-TDMA, a multiple access method of AIS class B, is recommended as that of the VDE. It is inefficient for CS-TDMA just applying the report interval used in AIS class B to transmit high speed data with higher payload in the aspect of efficiency. In this paper, a simulation is executed in order to determine adequate report interval according to the number of active ships that affects directly network traffic. To this end, the performance of CS-TDMA, which includes the number of received packets, reception success rate, channel utilization, and collision rate, is investigated via a simulation.

• Journal of Digital Contents Society
• /
• v.14 no.2
• /
• pp.191-197
• /
• 2013

To complete the "anywhere" mobile service there should not be shaded areas. However, it is never economical to deploy BS's (Base Stations) in a low population density area due to the low resource utilization. We propose a design technique to install RS's(Relay Stations) which are cheaper than BS's and find the condition in which the proposed technique is acceptible. The proposed design technique aims to allocate the frequency and time resources to RS's to minimize the transmission rate degradation due to interferences between RS's as well as to maximize the parallelism in transmission. We showed by simulation that the proposed technique achieves cost benefits when the expected traffic is less than 20.32 percent of the total BS capacity. The proposed technique is compatible with the IEEE 802.16j, thus can be extended to multi-hop configuration.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6C
• /
• pp.581-593
• /
• 2002

In this paper, we proposed an Adaptive RIO scheme to solve the problem of RIO scheme that occurs when admission control is performed for QoS guarantee of Assured Service in Differentiated Services. To prevent an early random drop of the admitted In-profile packet, proposed Adaptive RIO scheme updates parameters of RIO scheme every time interval according to the estimated numbers of maximum packet arrivals of In-profile traffic and total traffic during the next time interval. The numbers of maximum packet arrivals during the next time interval are estimated based on the buffer size determined by the network topology and the ratio of bandwidth allocated to each subclass. We found from simulation results that, compared with RIO scheme, proposed Adaptive RIO scheme can improve performance of the throughput for In-profile traffic when admission control is performed or congestion occurs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.6
• /
• pp.672-677
• /
• 2016

Development of Internet has been successfully inspired with extensive deployment of the network technology and application. However, increases in Internet usage had caused a lot of traffic overload in these days. Thus, we need a continuous research and development on the network virtualization for effective resource allocation. In this paper, we propose a minimal cost virtual network mapping algorithm using Piecewise Linear Cost Function. We exploited an algorithm with Linear Programming and D-VINE for node mapping, and Shortest Path Algorithm based on linear programming solution is used for link mapping. In this way, we compared and analyzed the average cost for arrival rate of VN request with linear and tree structure. Simulation results show that the average cost of our algorithm shows better efficiency than ViNEyard.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.5
• /
• pp.1193-1200
• /
• 2010

This paper presents a new adaptive macroblock quantization algorithm which generates the output bits corresponding to the target bit budget. The H.264 standard uses various coding modes and optimization methods to improve the compression performance, which makes it difficult to control the amount of the generated traffic accurately. In the proposed scheme, linear regression analysis is used to analyze the relationship between the bit rate of each macroblock and the quantization parameter and to predict the MAD values. Using the predicted values, the quantization parameter of each macroblock is determined by the Lagrange multiplier method and then modified according to the difference between the bit budget and the generated bits. It is shown by experimental results that the new algorithm can generate output bits accurately corresponding to the target bit rates.