• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.12A
• /
• pp.941-949
• /
• 2011

In a cooperative communication system with a source node and multiple relays equipping single antenna and a destination node equipping multiple antennas, the selective cooperative spatial multiplexing scheme can obtain spatial multiplexing gain and additional selection diversity gain. But it can degrade a bit error rate performance because some received symbols forwarded from particular relays may be lost by attenuation due to path-loss. We propose a relay and transmission mode selection scheme which selects minimum number of multiple relays having the channel capacity larger than a given data rate and transmission mode which switches spatial multiplexing and spatial diversity mode in cooperation phase to enhance the bit error rate performance. The proposed scheme achieves 1.5~2dB gain at the low SNR range compared with the conventional scheme by obtaining additional spatial diversity gain.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1A
• /
• pp.58-64
• /
• 2009

In this paper, we propose an dynamic random channel allocation scheme increasing probability of channel acquisition and reducing delay by limiting the number of minimum RCHs(Random CHannels) as an optimal factor $\beta$. The MAC protocol of HIPERLAN/2 is based on TDMA/TDD and MT(Mobile Terminal) can obtain chance of traffic transmission through channel competition in RCH period. And AP(Access Point) can dynamically schedule the number of RCHs based on the number of the collision in each RCH of the previous frame. Therefore, the proposed scheme increases a probability of channel acquisition and reduces delay by means of guaranteeing the number of minimum RCHs. With a practical Internet traffic, it is concluded that by the proposed scheme the delay reduction of the order of 19% and slightly better throughput are obtained compared to the conventional algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5B
• /
• pp.509-516
• /
• 2009

The Stream Control Transmission Protocol(SCTP) is a reliable transport layer protocol that provides several features. Multihoming is the one of the features and allows an association(SCTP's term for a connection) between two endpoints to use multiple paths. One of the paths, called a primary path, is used for initial data transmission and in the case of retransmission an alternate path is used. SCTP's current retransmission policy attempts to improve the chance of success by sending all retransmissions to an alternate destination address. However, SCTP's current retransmission policy has been shown to actually degrade performance in many circumstances. It is because that, due to Karn's algorithm, successful retransmissions on the alternate path cannot be used to update RTT(Round-Trip Time) estimation for the alternate path. In this paper we propose a scheme to avoid such performance degradation. We utilize 2bits which is not used in the flag field of DATA and SACK chunks to disambiguate original transmissions from retransmissions and to keep RTT and RTO(Retransmission Time-Out) values more accurate.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.1
• /
• pp.17-25
• /
• 2000

ATM PON system is regarded as a solution of the next generation access network because it can cover various types of subscribers in a single platform. In this paper, we describe the merit of the ATM PON and the key protocols for its operation. Above all, the ranging is the most important protocol providing a mean of the time-division multiple access in the system. A problem in the protocol is that the window size, the time interval that ranging cell arrives, is too long. During the interval, user traffics cannot be send to the upstream, which makes the quality of service degraded. In this paper, we suggest a method to minimize the window size when the length of the optic fiber is known with some deviation. The window size can be reduced as 7 % of the conventional method when the deviation of the length is 1 Km.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6B
• /
• pp.553-562
• /
• 2003

Supporting QoS (Quality of Service) for the multimedia applications becomes an important issue as the demand of multimedia applications increases. Thus, it is necessary for the application layer to have an efficient congestion control algorithm, which can support the multimedia applications' QoS requirements. In this paper, we propose a new application layer congestion control algorithm, called RRC-OTT (Receiver-based Rate Control with One-way Trip Time). RRC-OTT algorithm differs from the previously proposed algorithms in that the receiver takes the responsibility of the network congestion control. Thus, RRC-OTT algorithm can not only precisely estimate the network congestion using OTT (one-way Trip Time), but reduce the work load from the sender (e.g., the web server). Our simulation study shows that RRC-OTT algorithm can maintain the comparable link utilization to the previously proposed algorithms and keep the packet jitter low, which thus can help enhance the quality of multimedia applications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1B
• /
• pp.1-7
• /
• 2008

In group location management, when a transportation system(TS) with multiple mobile subscribers(MSs) changes location area(LA), location management is performed by group location registration by TS, instead of individual location registrations by MSs. In previous works, although it is assumed that LA in group location management is the same as that in individual location management, it is not appropriate to assume the same sized LAs since MSs in a TS have different characteristics from MSs which are not in a TS from the aspect of the speed and aggregate call arrival rates. Thus, in this paper, we propose an efficient location management scheme based on individual and group location managements with different sized LAs, and the performance of the proposed scheme is analyzed from the aspect of signaling cost at the wireless interface. Results reveal that the proposed scheme outperforms the conventional scheme by selecting an appropriate sized LA for group location management.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.5B
• /
• pp.344-355
• /
• 2008

In this paper, we are dealing with the problems of performance evaluation of Differentiated Services(DiffServ) networks. For successful performance evaluation, the ability to accurately represent "real" traffic on the network by suitable traffic models is an essential ingredient. Many research results on the nature of real traffic measurements demonstrated LRD(long-range dependence) property for the Internet traffic including Web, TELNET, and P2P traffic. The LRD can be effectively represented by self-similarity. In this paper, we design and implement self-similar traffic generator using the aggregated On/Off source model, based on the analysis of the On-Off source model, FFT-FGN(Fast Fourier Transform-Fractional Gaussian Noise) model, and RMD(Random Midpoint Displacement) model. We confirmed the self-similarity of our generated traffic by checking the packet inter-arrival time of TCPdump data. Further we applied the implemented traffic generator to the performance evaluation of DiffServ networks and observed the effect of performance to the a value of the On/Off model, and performance of EF/BE class traffic by CBQ.

• KIPS Transactions on Computer and Communication Systems
• /
• v.1 no.3
• /
• pp.205-218
• /
• 2012

Mobility management of the mobile nodes and provision of seamless handover is crucial to an efficient support for the global roaming of the mobile nodes in next-generation wireless networks. Mobile IPv6 and mobility management in extended IP layer, which highly depend on traffic characteristics and user mobility models, were proposed by the IETF. Therefore, to evaluate the in-depth performance about these factors is important. Generally, the performance of IPv6-based mobility management protocol is evaluated through simulation. This paper shows the correlation between network parameters and performance metrics through numerical results, which is investigated how influence handoff latency and packet loss. And this paper uses mathematical analysis of the system parameters, such as the subnet residence time, the packet arrival rate and delay in wireless connection through the analytical framework which evaluate the performance of IPv6-based mobility management protocol.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.9
• /
• pp.227-234
• /
• 2018

Guaranteeing the end-to-end delay deadline is an important issue for quality of service (QoS) of delay sensitive systems, such as real-time system, networked control system (NCS), and cyber-physical system (CPS). Most routing algorithms typically use the mean end-to-end delay as a performance metric and select a routing path that minimizes it to improve average performance. However, minimum mean delay is an insufficient routing metric to reflect the characteristics of the unpredictable wireless channel condition because it only represents average value. In this paper, we proposes a deadline-aware routing algorithm that maximizes the probability of packet arrival within a pre-specified deadline for CPS by considering the delay distribution rather than the mean delay. The proposed routing algorithm constructs the end-to-end delay distribution in a given network topology under the assumption of the single hop delay follows an exponential distribution. The simulation results show that the proposed routing algorithm can enhance QoS and improve networked control performance in CPS by providing a routing path which maximizes the probability of meeting the deadline.