• Journal of the Korea Society for Simulation
• /
• v.15 no.1
• /
• pp.27-33
• /
• 2006

To guarantee QoS (Quality of Service), routers should determine routing paths satisfying service requirements, based on link state information as well as network topology. Link status database (LSD) in routers should be efficiently managed to effectively reflect the current state of all links. However, there is a trade off between the exact reflection of the current link status and its update cost. For exactly reflecting the current link status, each router immediately notifies its neighbors that link state information is changed. This may degrade performance of the router due to the processing of link state update messages. On the other side, if the current link state information is not updated appropriately, a route setup request can be rejected because of the discrepancy between the current link state information and previously updated link state information in LSD. In this paper, we propose a traffic variation based link state update algorithm for adaptively controlling the generation of link state update messages and compare its performance with those of four existing algorithms by intensive simulations.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.38 no.8
• /
• pp.19-29
• /
• 2001

The recent explosion in the Internet applications, Internet. host number and the traffic in the IP backbone network is posing new challenges for transport network. This requires a high-speed IP backbone network that has a substantially higher bandwidth than the one offered by current networks, which prompts the development of all-optical network. To obtain optical network utilization gains, we need a software which establishs logical topology to make possible the efficient use or physical topology, and control the optical network in combination with the IP layer routing protocols. Finally, the logical topology is required higher efficient than physical topology. For this an efficient algorithm for the routing and wavelength assignment(RWA) in the WDM all-optical network is necessary. In this paper, two kinds of heuristic algorithms to establish logical topology for WDM networks and arc applied to the design of logical topology of domestic backbone network. These algorithms are found to work quite well and they arc compared with each other in terms of blocking rate, etc.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.7
• /
• pp.62-66
• /
• 2008

In this paper we have proposed a power aware location based routing protocol for wireless ad hoc network. The existing greedy perimeter stateless routing (GPSR) has some problems which are certain node overloaded and void situation. The proposed power aware greedy perimeter stateless routing (PAGPSR) protocol gives a solution for these problems in GPSR. PAGPSR uses power aware and geographically informed neighbor selection to route a packet towards the destination. It also gives a solution for the fundamental problem in geographical routing called communication void. It considers residual energy of battery and distance to the destination for the next hope node selection. When it encounters a void it starts limited-flooding to select next hop node. To evaluate the performance of our protocol we simulated PAGPSR in ns-2. Our simulation results show that our protocol achieves longer network lifetime compared with greedy perimeter stateless routing (GPSR).

• Journal of Digital Contents Society
• /
• v.10 no.2
• /
• pp.233-238
• /
• 2009

The advances in the digital communication and network technology, Internet technology and the proliferation of smart appliances in home, have dramatically increased the need for a high speed/high quality home network. As consumer electronic devices and computing devices are increasing in the home network, it is obvious that the data traffic of home network increases as well. Various home network devices want to access Internet servers to get multimedia contents. Therefore, we introduce TLC(Telephone Line Carrier) system for networked digital consumer electronic appliances within a house using Ethernet or wire/wireless technology. In the future home network environment, the primary purposes of the smart home network based TLC are to create low-cost, easily deployable, high performance, and wide coverage throughout the home. In this paper, the channel capacity of telephone line communication system is evaluated and compared as a function of transmission power, number of OFDM carrier, channel loss, and noise loss for smart home network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4B
• /
• pp.153-161
• /
• 2005

In a multi-channel network based of wavelength division multiplexing (WDM) technology, an efficient protocol is needed in order for the transmitter and receiver to be tuned to the same wavelength during message transmission time. This paper proposes a priority-based reservation protocol that can efficiently support variable-length messages that require different QoS requirements. In this proposed protocol, high-priority nodes can reserve the data channel before low-priority nodes. However, once a node reserves a data channel successfully, it can persistently use the reserved channel till message transmission is finished regardless of the priority of the node. Moreover, the protocol can operate independently of the number of nodes, and any new node can join the network anytime without requiring network re-initialization. The protocol is analyzed with a finite population model and the throughput-delay characteristics are investigated as performance measures.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.8B
• /
• pp.736-744
• /
• 2006

For the handhold devices, minimizing repetitive CPU operations such as multiplications is a major factor for their performances. In this paper, we propose efficient algorithms for finding similar sequences from streaming time-series data such as stock prices, network traffic data, and sensor network data. First, we formally define the problem of similar subsequence matching from streaming time-series data, which is called the stream sequence matching in this paper. Second, based on the window construction mechanism adopted by the previous subsequence matching algorithms, we present an efficient window-based approach that minimizes CPU operations required for stream sequence matching. Third, we propose a notion of window MBR and present two stream sequence matching algorithms based on the notion. Fourth, we formally prove correctness of the proposed algorithms. Finally, through a series of analyses and experiments, we show that our algorithms significantly outperform the naive algorithm. We believe that our window-based algorithms are excellent choices for embedded stream sequence matching in handhold devices.

• 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 the Korea institute of electronic communication sciences
• /
• v.8 no.9
• /
• pp.1325-1332
• /
• 2013

The first frame of a GOP, an I frame, is encoded in intra mode which generates a larger number of bits. In addition, the I frame is used for the inter mode encoding of the following frames. Thus the intial QP for the I frame affects the first frame as well as the following frames. In our previous work, we analyzed the number of bits for an I frame and showed that the ratio of the number of bits which maximizes the PSNR of a GOP maintains similar value regardless of GOP's. In this paper, we propose a R-Q model which can be used for the calculation of the initial QP given the amount of bits for an I frame. The proposed model is simple and adaptively modifies model parameters, so it can be applicable to the real-time application. It is shown by experimental results that the proposed model captures initial QP characteristics effectively and the proposed method for model parameters accurately estimates the real values.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.2
• /
• pp.184-191
• /
• 2017

This paper presents cluster based hybrid spectrum sensing system for M2M services. For each cluster, secondary nodes within the transmission radius of the primary node use hard decision method through local spectrum sensing to determine whether the primary node exists. And the other secondary nodes and the secondary nodes having poor radio channel conditions judge the existence of the primary node through the soft decision method of the values obtained by performing the cooperative spectrum sensing. In the proposed hybrid spectrum sensing system, the performance according to the number of secondary nodes is analyzed with the conventional system over Rayleigh fading channel. As the number of cooperative sensing users increased to 2, 3 and 4, the cluster error probability decreased to 0.5608, 0.5252 and 0.4001 at SNR of -10[dB] respectively. Since the proposed system uses less overhead traffic, it is found that it is more effective in terms of frequency usage than the conventional system using soft decision-soft decision and soft decision-hard decision methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.9
• /
• pp.2064-2072
• /
• 2015

To improve performance, most of Web Services produce and manage User Access Logs. Through the Access Logs, the record provides information about time when the most traffic happens and logs and which resource is mostly used. Then, the log can be used to analyze. However, in case of increasing high traffics of Web Services at the specific time, the performance of Web Service leads to deterioration because the number of processing User Access Logs is increasing rapidly. To solve this problem, we should improve the system performance, or tuning is needed, but it makes a problem cost a lot of money. Also, after it happens, it is not necessary to build such system by spending extra money. Therefore, this paper described the effective Web Service's performance as using improved User Access Log performance. Also, to process the newest data in bulk, this paper includes a method applying some parts of NoSQL using Redis.