• 정보처리학회논문지C
• /
• 제9C권5호
• /
• pp.725-732
• /
• 2002

기존 LAN 환경에서 멀티미디어 실시간 전송과 같은 QoS 보장형 서비스에 대한 요구가 증대되면서, ATM 기술을 LAM에 적용하는 기술들이 등장하였다. LANE(LAN Emulation)은 그러한 기술들 중에서 캠퍼스와 기업의 네트워크 인프라로 가장 많이 보급되고 있는 대안 중의 하나이다. 그러나 활발한 LANE 도입에 비하여 이의 효과적인 운용에 대한 연구는 드문 실정이다. 본 논문에서는 LANE을 구축한 캠퍼스 네트워크에서 멀티미디어 방송형(broadcast) 트래픽의 최적 운영방안에 대하여 논의한다. 방송형 트래픽 관리에서 발생하는 규모성(scalability) 문제로 인하여 전체 LANE 네트워크는 일반적으로 여러 개의 ELAN(Emulated MU)으로 분할되어 관리된다. 본 연구는 특히 규모성 문제해결을 위한 ELAN 구성(configuration)에 수반되는 비용을 정의하고, LANE 성능에 직결되는 규모성 제약과 ELAN 운용과 관계된 기술적 제약하에서 제반비용을 최소화하는 ELAN 구성(LANE 분할) 의사결정모형을 제공한다. 이는 그래프분할문제(graph partition problem)의 확장된 형태로 모형화 되며, 제안된 수리적 모형을 위한 유전자 알고리즘 해법을 개발하여 소개한다. 또한 실제 LANE 네트워크 운영자료를 사용한 실험을 통하여 최적 ELAN 구성을 위한 정책변수들의 효과를 살펴보고, 이러한 결과들이 기존의 LANE 운영과 관련하여 가지는 함축적인 의미를 고찰한다.

• 한국정보처리학회논문지
• /
• 제6권2호
• /
• pp.396-407
• /
• 1999

A Multicast transfer is a critical delivery method to provide a transport service to multipeer applications, the various problems on the multicast transfer environments have been occurred from the results of current research. One of these problems is the multicast transport service issue to guarantee reliability and scalability. First, this paper presents the related research of the reliable multicast transport methods, and then proposes a new transfer architecture using the Agent Sender and Receiver Concept(ASRC) to solve a reliable multicast transfer issue. we also propose a method to apply the proposed architecture(ASRC) to the well-known sender-initiated and receiver-initiated transport protocol. In order 새 validate the proposed ASRC architecture, t도 applied sender and receiver system si compared and analyzed over the processing requirement and maximum throughput.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 학술대회 논문집 정보 및 제어부문
• /
• pp.484-486
• /
• 2005

Passenger safety is a primary concern of railway system but, it has been urgent issue that dozens of people are killed every year when they falloff from train platforms. Recently, advancements in IT have enabled applying vision sensors to railway environments, such as CCTV and stereo camera sensors. In this paper, we propose a stereoscopic video coding scheme for subway accident monitoring system. The proposed scheme is designed for providing flexible video among various displays, such as control center, station employees and train driver. We uses MPEG-2 standard for coding the left-view sequence and IBMDC for predicting the P- and B-types of frames of the right-view sequence. IBMDC predicts matching block by interpolating both motion and disparity predicted macroblocks. To provide efficient stereoscopic video service. we define both temporally and spatially scalable layers for each eye's-view by using the concept of Spatio-Temporal scalability. According to the experimental results. we expect the proposed functionalities will play a key role in establishing highly flexible stereoscopic video codec for ubiquitous display environment where devices and network connections are heterogeneous.

• 한국산업정보학회논문지
• /
• 제11권3호
• /
• pp.69-81
• /
• 2006

In this paper, an adaptive algorithm is proposed in streaming MPEG-4 contents with fluctuating resource amount such as throughput of network conditions. In the area of adaptive streaming issue, a lot of researches have been made on how to represent encoded media(such as video) bitstream in scalable way. By contrast, MPEG-4 supports object-based multimedia content which is composed of various types of media streams such as audio, video, image and other graphical elements. Thus, it can be more effective to provide individual media streams in scalable way for streaming object-based content to heterogeneous environment. The proposed method provides the multiple media streams corresponding to an object with different qualities and bit rate in order to support object based scalability to the MPEG-4 content. In addition, an optimal selection of the multiple streams for each object to meet a given constraint is proposed. The selection process is adopted a multiple choice knapsack problem with multi-step selection for the MPEG-4 objects with different scalability levels. The proposed algorithm enforces the optimal selection process to maintain the perceptual qualities of more important objects at the best effort. The experimental results show that the set of selected media stream for presenting objects meets a current transmission condition with more high perceptual quality.

• Industrial Engineering and Management Systems
• /
• 제15권3호
• /
• pp.259-267
• /
• 2016

In Wireless Sensor Network, various routing protocols were employed by our Research and Development community to improve the energy efficiency of a network as well as to control the traffic by considering the terms, i.e. Packet delivery rate, the average end-to-end delay, network routing load, average throughput, and total energy consumption. While maintaining network connectivity for a long-term duration, it's necessary that routing protocol must perform in an efficient way. As we discussed Optimized Link State Routing protocol between all of them, we find out that this protocol performs well in the large and dense networks, but with the decrease in network size then scalability of the network decreases. Whenever a link breakage is encountered, OLSR is not able to periodically update its routing table which may create a redundancy problem. To resolve this issue in the OLSR problem of redundancy and predict link breakage, an enhanced protocol, i.e. S-OLSR (More Scalable OLSR) protocol has been proposed. At the end, a comparison among different existing protocols, i.e. DSR, AODV, OLSR with the proposed protocol, i.e. S-OLSR is drawn by using the NS-2 simulator.

• 정보처리학회논문지A
• /
• 제12A권2호
• /
• pp.137-144
• /
• 2005

소 중규모 분산 시스템에서 기결정된 메시지 순서화 속성들을 만족시키기 위한 많은 신뢰성 있는 그룹통신 알고리즘들이 제안되었다. 그러나, 엄격한 신뢰성을 보장해야 하는 기존 알고리즘들은 대규모 시스템에 적합하지 않을 수 있다. 이러한 문제를 해결하기 위하여, 기존 알고리즘에 비해 합리적으로 보다 약한 신뢰성을 보장하는 동시에 확장성을 매우 향상시키기 위한 전염형 그룹통신 알고리즘들이 제안되었다. 이러한 알고리즘들은 모두 원자적 메시지 순서 전달 속성을 보장하도록 설계되었다. 그러나, 멀티미디어 시스템 및 협력 작업과 같은 분산 애플리케이션들이 보다 약한 메시지 순서 전달 속성인 인과적 순서 전달만을 요구한 수 있다. 따라서, 본 논문에서는 전염형 기법의 고유한 확장성을 유지하면서, 인과적 순서 전달을 보장하는 효율적인 전염형 그룹 통신 알고리즘을 제안한다.

• 한국컴퓨터정보학회논문지
• /
• 제25권5호
• /
• pp.99-106
• /
• 2020

협력 필터링 기반의 추천 시스템에 내재된 확장성 문제는 지난 수십년간 관련 연구의 이슈가 되어 왔다. 클러스터링은 이 문제를 해결하는 유명한 기술인데 낮은 성능으로 인하여 활발히 연구되어 오진 않았다. 본 논문에서는 협력 필터링 시스템의 고질적인 단점인 확장성 문제를 극복하기 위하여 클러스터링 기법을 채택하였다. 또한 클러스터링을 적용함으로 인해 초래되는 성능저하 문제를 개선하기 위해, 두 가지 전략을 사용하였는데, 첫째는 퍼지 클러스터링이며, 둘째는 영화 장르에 대한 사용자 선호도에 기반한 유사도 측정 방법을 제안하고 이를 적용하였다. 본 연구에서의 제안 방법을 기존의 여러 관련 방법들과 비교 실험을 통해 다양한 주요 성능 척도에 의거하여 평가하였는데, 실험 결과 제안 방법은 예측과 순위 정확도 측면에서 더 우수한 성능을 보였고, 추천 정확도 측면에서는 실험 대상 중 최상의 방법과 대등한 성능을 나타냈다.

• Journal of Information Processing Systems
• /
• 제15권2호
• /
• pp.440-448
• /
• 2019

The Internet of Things (IoT) is one of the main enablers for situation awareness needed in accomplishing smart cities. IoT devices, especially for monitoring purposes, have stringent timing requirements which may not be met by cloud computing. This deficiency of cloud computing can be overcome by fog computing for which fog nodes are placed close to IoT devices. Because of low capabilities of fog nodes compared to cloud data centers, fog nodes may not be deployed with all the services required by IoT devices. Thus, in this article, we focus on the issue of fog service placement and present the recent research trends in this issue. Most of the literature on fog service placement deals with determining an appropriate fog node satisfying the various requirements like delay from the perspective of one or more service requests. In this article, we aim to effectively place fog services in accordance with the pre-obtained service demands, which may have been collected during the prior time interval, instead of on-demand service placement for one or more service requests. The concept of the logical fog network is newly presented for the sake of the scalability of fog service placement in a large-scale smart city. The logical fog network is formed in a tree topology rooted at the cloud data center. Based on the logical fog network, a service placement approach is proposed so that services can be placed on fog nodes in a resource-effective way.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권1호
• /
• pp.299-322
• /
• 2020

Vehicular ad hoc networks (VANETs) enable wireless communication between vehicles and roadside infrastructure to provide a safer and more efficient driving environment. However, due to VANETs wireless nature, vehicles are exposed to several security attacks when they join the network. In order to protect VANETs against misbehaviours, one of the vital security requirements is to revoke the misbehaved vehicles from the network. Some existing revocation protocols have been proposed to enhance security in VANETs. However, most of the protocols do not efficiently address revocation issues associated with group signature-based schemes. In this paper, we address the problem by constructing a revocation protocol particularly for group signatures in VANETs. We show that this protocol can be securely and efficiently solve the issue of revocation in group signature schemes. The theoretical analysis and simulation results demonstrate our work is secure against adversaries and achieves performance efficiency and scalability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권1호
• /
• pp.340-367
• /
• 2018

Storage services integration can be done for achieving high availability, improving data access performance and scalability while preventing vendor lock-in. However, multiple services environment management and interoperability have become a critical issue as a result of service architectures and communication interfaces heterogeneity. Storage federation model provides the integration of multiple heterogeneous and self-sufficient storage systems with a single control point and automated decision making about data distribution. In order to integrate diverse heterogeneous storage services into a single storage pool, we are proposing a storage service federation framework named BoxBroker. Moreover, an automated decision model based on a policy-driven data distribution algorithm and a service evaluation method is proposed enabling BoxBroker to make optimal decisions. Finally, a demonstration of our proposal capabilities is presented and discussed.