• Journal of KIISE
• /
• v.44 no.11
• /
• pp.1219-1230
• /
• 2017

Real-time streaming services over the Internet have increased with the explosive growth of the various mobile platforms, with a focus on smart phones, and the demand for them is growing. In addition, the bandwidth occupied by the streaming services over the Internet had already surpassed 50% in 2010. Because of the shortage of network bandwidth for multimedia services traffic, restrictions on quality and capacity will become more and more serious. CCN is a future Internet architecture that improves how existing host-based Internet architecture handles content-oriented structure, but it is designed for the transmission of general contents and is not suitable for transmitting real-time streaming contents. In this paper, we focus on the inefficient aspects of CCN and propose a hierarchical grade-based scheme for real-time service for a more efficient environment in real-time streaming services. Experiments have shown better performance in terms of bandwidth, network load, and reliability.

• Spatial Information Research
• /
• v.22 no.5
• /
• pp.65-75
• /
• 2014

Bus headway plays an important role not only in determining the passenger waiting time and bus service quality, but also in influencing the bus operation cost and passenger demand. Previous research on headway control has considered only an hourly difference in the distribution of ridership between peak and non-peak hours. However, this approach is too simple to help manage ridership demand fluctuations in a short time scale; thus passengers' waiting cost will be generated when ridership demand exceeds the supply of bus services. Moreover, bus ridership demand varies by station location and traffic situation. To address this concern, we propose a headway control algorithm for minimizing the waiting time cost by using Smart Card data. We also provide proof of the convergence of the algorithm to the desired headway allocation using a set of preconditions of political waiting time guarantees and available fleet constraints. For model verification, the data from the No. 143 bus line in Seoul were used. The results show that the total savings in cost totaled approximately 600,000 won per day when we apply the time-value cost of waiting time. Thus, we can expect that cost savings will be more pronounced when the algorithm is applied to larger systems.

• KIISE Transactions on Computing Practices
• /
• v.20 no.12
• /
• pp.688-693
• /
• 2014

With the advent of ubiquitous environments, the smart phone has come into wide use and the demand for various content increases. Thus, in order to efficiently utilize limited resources cognitive radio technology is regarded as a possible solution. Besides spectrum sensing or access schemes, the provision of VoIP traffic service for secondary users with limited spectrum resources is a very important issue. In this paper, a resource allocation and control system for VoIP QoS provision in cognitive radio networks is proposed. Firstly, as the system model, the time structure of the network is addressed and, according to the structure, a bandwidth broker is proposed. In addition, based on available bandwidth estimated by the bandwidth broker, a connection admission control for secondary users is developed. It is demonstrated that the provision of VoIP QoS is greatly affected by channel utilization, the number of channels, and the length of timeslot.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.2
• /
• pp.1-7
• /
• 2019

Recently, multimedia streaming service has been activated, and the demand for high-quality multimedia convergence contents services is predicted to increase significantly in the future. The issues of the increasing network load due to the rise of multimedia streaming traffic must be addressed in order to provide QoS guaranteed services. To do this, an efficient network resource management and mobility support technologies are needed through seamless mobility support for heterogeneous networks. Therefore, in this paper, an MIH technology was used to recognize the network situation information in advance and reduce packet loss due to handover delays, and an ACLMIH-FHPMIPv6 is designed that can provide an intelligent interface through introducing a hierarchical mobility management technique in FPMIPv6 integrated network.

• Smart Media Journal
• /
• v.11 no.11
• /
• pp.49-62
• /
• 2022

Recently, with the development of Smart City Solutions such as Big data, AI, IoT, Autonomous driving, and Digital twins around the world, the proliferation of various smart devices and social media, and the record of the deeds that people have left everywhere, the construction of Smart Cities using the "Big Data" environment in which so much information and data is produced that it is impossible to gauge the scale is actively underway. The Purpose of this study is to construct an objective and systematic analysis Model based on Big Data to improve the transportation convenience of citizens and formulate efficient policies in Urban Information and Public Transportation accessibility in sustainable Smart Cities following the 4th Industrial Revolution. It is also to derive the methodology of developing a Big Data-Based public transport accessibility and policy management Platform using a sustainable Urban Public DB and a Private DB. To this end, Detailed Living Areas made a division and the accessibility of basic living amenities of Gwangju Metropolitan City, and the Public Transportation system based on Big Data were analyzed. As a result, it was Proposed to construct a Big Data-based Urban Information and Public Transportation accessibility Platform, such as 1) Using Big Data for public transportation network evaluation, 2) Supporting Transportation means/service decision-making based on Big Data, 3) Providing urban traffic network monitoring services, and 4) Analyzing parking demand sources and providing improvement measures.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.16 no.2
• /
• pp.114-128
• /
• 2013

Rapid industrialization and economic growth have led to serious problems including reduced open space, environmental degradation, traffic congestion, and urban sprawl. These problems have been exacerbated by the absence of effective conservation and governance, and have resulted in various social conflicts. In response to these challenges, many scholar and government hope to achieve sustainable development through the establishment and management of environment-friendly planning. For this purpose, we would like to analyze functional change for ecosystem by future land-use/cover changes in South Korea. Toward this goal, we predicted land-use/cover changes from 2010 to 2060 using the future population of Statistics Korea and urban growth probability map created by logistic regression analysis and analyzed ecosystem service value using costanza's coefficient. In the case of scenario 1, ecosystem service value represented 6,783~7,092 million USD. In the case of scenario 2, ecosystem represented 6,775~7,089 million USD, 2.9~7.6 million USD decreased compared by scenario 1. This was the result of area reduction for farmland and wetland which have high environmental value relatively according to urban growth by development point of view. The results of this analysis indicate that environmentally sustainable systems and urban development must be applied to achieve sustainable development and environmental protection. Quantitative analysis of environmental values in accordance with environmental policy can help inform the decisions of policy makers and urban developers. Furthermore, forecasting urban growth based on future demand will provide more precise predictive analysis.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.12
• /
• pp.5723-5743
• /
• 2018

The evolving internet-based services demand high-speed data transmission in conjunction with scalability. The next generation optical network has to exploit artificial intelligence and cognitive techniques to cope with the emerging requirements. This work proposes a novel way to solve the dynamic provisioning problem in optical network. The provisioning in optical network involves the computation of routes and the reservation of wavelenghs (Routing and Wavelength assignment-RWA). This is an extensively studied multi-objective optimization problem and its complexity is known to be NP-Complete. As the exact algorithms incurs more running time, the heuristic based approaches have been widely preferred to solve this problem. Recently the software-defined networking has impacted the way the optical pipes are configured and monitored. This work proposes the dynamic selection of path computation algorithms in response to the changing service requirements and network scenarios. A software-defined controller mechanism with a novel packet matching feature was proposed to dynamically match the traffic demands with the appropriate algorithm. A software-defined controller with Path Computation Element-PCE was created in the ONOS tool. A simulation study was performed with the case study of dynamic path establishment in ONOS-Open Network Operating System based software defined controller environment. A java based NOX controller was configured with a parent path computation element. The child path computation elements were configured with different path computation algorithms under the control of the parent path computation element. The use case of dynamic bulk path creation was considered. The algorithm selection method is compared with the existing single algorithm based method and the results are analyzed.

• Journal of Communications and Networks
• /
• v.16 no.4
• /
• pp.397-406
• /
• 2014

Radio frequency (RF) jamming is a denial of service attack targeted at wireless networks. In resource-hungry scenarios with constant traffic demand, jamming can create connectivity problems and seriously affect communication. Therefore, the vulnerabilities of wireless networks must be studied. In this study, we investigate a particular type of RF jamming that exploits the semantics of physical (PHY) and medium access control (MAC) layer protocols. This can be extended to any wireless communication network whose protocol characteristics and operating frequencies are known to the attacker. We propose two efficient jamming techniques: A low-data-rate random jamming and a shot-noise based protocol-aware RF jamming. Both techniques use shot-noise pulses to disrupt ongoing transmission ensuring they are energy efficient, and they significantly reduce the detection probability of the jammer. Further, we derived the tight upper bound on the duration and the number of shot-noise pulses for Wi-Fi, GSM, and WiMax networks. The proposed model takes consider the channel access mechanism employed at the MAC layer, data transmission rate, PHY/MAC layer modulation and channel coding schemes. Moreover, we analyze the effect of different packet sizes on the proposed jamming methodologies. The proposed jamming attack models have been experimentally evaluated for 802.11b networks on an actual testbed environment by transmitting data packets of varying sizes. The achieved results clearly demonstrate a considerable increase in the overall jamming efficiency of the proposed protocol-aware jammer in terms of packet delivery ratio, energy expenditure and detection probabilities over contemporary jamming methods provided in the literature.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.5
• /
• pp.265-273
• /
• 2002

With the explosive growth of WWW traffic, there is an increasing demand for the high performance Web servers to provide a stable Web service to users. The cluster-based Web server is a solution to core with the heavy access from users, easily scaling the server according to the loads. In the cluster-based Web sewer, a back-end node may not be able to serve some HTTP requests directly because it does not have the requested contents in its main memory. In this case, the back-end node has to retrieve the requested contents from its local disk or other back-end nodes in the cluster. To reduce service latency, we introduce a new prefetch scheme. The back-end nodes predict the next HTTP requests and prefetch the contents of predicted requests before the next requests arrive. We develop three prefetch algorithms bated on some useful information gathered from many clients'HTTP requests. Through trace-driven simulation, the service latency of the prefetch scheme is reduced by 10 ~ 25% as compared with no prefetch scheme. Among the proposed prefetch algorithms, Time and Access Probability-based Prefetch (TAP2) algorithm, which uses the access probability and the inter-reference time of Web object, shows the best performance.

• Journal of Digital Contents Society
• /
• v.15 no.2
• /
• pp.251-261
• /
• 2014

In the typical P2P VOD system, it is very important to develop the fast and efficient peer searching scheme since the peers frequently join and leave to/from P2P system. This paper proposes a new peer searching scheme for P2P VOD system based on DHT network environment. The proposed scheme constructs DHT network by managing the peers having close playback starting times and close network locations into a peer all together. The peer information is mapped onto DHT nodes by hashing the key values each of which consists of the starting time and network location of the peer. From the simulation results, the number of messages required to search the partner peers are decreased, and the number of buffer maps exchanging among the peers are also decreased. The proposed scheme can reduce the average network distances among the partner peers. As a result, the proposed scheme makes routing more efficient and it saves the network resources by decreasing communication traffic overhead.