• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권6호
• /
• pp.2964-2985
• /
• 2019

Global data center IP traffic is expected to reach 20.6 zettabytes (ZB) by the end of 2021. Intra-data center networks (Intra-DCN) will account for 71.5% of the data center traffic flow and will be the largest portion of the traffic. The understanding of traffic distribution in IntraDCN is still sketchy. It causes significant amount of bandwidth to go unutilized, and creates avoidable choke points. Conventional transport protocols such as Optical Packet Switching (OPS) and Optical Burst Switching (OBS) allow a one-sided view of the traffic flow in the network. This therefore causes disjointed and uncoordinated decision-making at each node. For effective resource planning, there is the need to consider joining the distributed with centralized management which anticipates the system's needs and regulates the entire network. Methods derived from Kalman filters have proved effective in planning road networks. Considering the network available bandwidth as data transport highways, we propose an intelligent enhanced SDN concept applied to OBS architecture. A management plane (MP) is added to conventional control (CP) and data planes (DP). The MP assembles the traffic spatio-temporal parameters from ingress nodes, uses Kalman filtering prediction-based algorithm to estimate traffic demand. Prior to packets arrival at edges nodes, it regularly forwards updates of resources allocation to CPs. Simulations were done on a hybrid scheme (1+1) and on the centralized OBS. The results demonstrated that the proposition decreases the packet loss ratio. It also improves network latency and throughput-up to 84 and 51%, respectively, versus the traditional scheme.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2016년도 추계학술대회
• /
• pp.889-890
• /
• 2016

기존의 기기간 협업 시스템은 공유기에 OpenWrt와 웹 서버를 구축한 중앙 집중형 구조의 시스템이다. 하지만 공유기의 부족한 자원으로 인해 협업 시 클라이언트로부터 요청이 많아지거나 서버와 연결되는 클라이언트의 개체가 증가할수록 트래픽 발생확률이 높아지는 문제가 발생했다. 이를 해결하기 위해 본 논문에서는 협업 알고리즘을 활용한 분산형 Machine Socialization 시스템을 제안한다. 기기에 부착하는 MCU(Micro Controller Unit)를 통해 서버와 클라이언트간 데이터를 분산하여 처리함으로써 트래픽 발생 확률 및 데이터의 손실을 최소화 하였다. 또한 데이터의 손실로 인한 작업의 중단 및 서버와 클라이언트간의 응답속도의 저하를 개선하였다. 제안하는 시스템은 IoT 분야에 활용될 경우 기존 시스템들에 비해 효율성이 높을 것으로 사료된다.

• 한국인터넷방송통신학회논문지
• /
• 제22권1호
• /
• pp.83-88
• /
• 2022

최근 정보통신기술의 발전에 따라 사물인터넷(이하 IoT) 관련 기술이 지속적으로 발전하고 있다. IoT 시스템은 다양한 센서들을 바탕으로 센서마다 고유한 데이터를 네트워크를 통해 주고 받는다. IoT 시스템에서 발생하는 데이터는 실시간으로 발생한다는 특징과, 그 양이 설치된 센서의 양과 비례한다는 점에서 연속적으로 수집되는 데이터들은 빅 데이터로 정의할 수 있다. 현재까지의 IoT 시스템은 중앙 집중 처리 방식을 통한 데이터 저장, 처리 및 연산을 적용하였다. 하지만, 구축 규모가 커지고 다량의 센서를 사용하는 경우 기존의 중앙 집중 처리 방식의 서버는 병목 현상으로 인한 부하가 발생할 수 있다. 따라서, 본 논문에서는 IoT 환경에서 발생하는 실시간 센서 데이터를 효율적으로 처리하기 위하여 시스템의 고가용성을 목적으로 하는 데이터의 중요도 기반 알고리즘을 적용하기 위한 분산 처리 시스템에 대해 제안하였다.

• Journal of Communications and Networks
• /
• 제11권2호
• /
• pp.157-165
• /
• 2009

In this paper, we investigate a dynamic spectrum sharing problem for the centralized uplink cognitive radio networks using orthogonal frequency division multiple access. We formulate a large-scale joint rate and power allocation as an optimization problem under quality of service constraint for secondary users and interference constraint for primary users. We also suggest admission control to nd a feasible solution to the optimization problem. To implement the resource allocation on a large-scale, we introduce a notion of using the conservative factors $\alpha$ and $\beta$ depending on the outage and violation probabilities. Since estimating instantaneous channel gains is costly and requires high complexity, the proposed algorithm pursues a practical and implementation-friendly resource allocation. Simulation results demonstrate that the large-scale joint rate and power allocation incurs a slight loss in system throughput over the instantaneous one, but it achieves lower complexity with less sensitivity to variations in shadowing statistics.

• 한국인터넷방송통신학회논문지
• /
• 제18권3호
• /
• pp.209-214
• /
• 2018

본 논문은 부패상품의 수송시간 제약조건 $L^*$이내로 총 수송비용을 최소화시키는 물류센터 위치를 결정하는 문제의 단순한 알고리즘을 제안하였다. 이 문제에 대해 Lee[4]는 후보 물류센터 위치를 선정하고, 각 물류센터의 총 수송비용을 구한 후, 상위 2개 물류센터에 대해 최적의 위치로 이동시키는 복잡한 방법을 제안하였다. 반면에 본 논문에서는 서브트리 개념을 도입하여 $L^*$ 이내가 되는 후보 물류센터의 위치를 간단히 결정하고, 근방 개념을 도입하여 요구량이 집중화된 지역 상위 2개 지역에 대해 총 수송비용이 최소화되는 지점을 단순히 최적의 위치로 결정하였다.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.213-215
• /
• 2003

Multimedia has to carry data of heterogeous types. Multicast communication techniques can supply the most appropriate infrastructures to such multimedia. Of many multicast protocols, the core based tree (CBT) protocol is the most concentrative studies are conducted on. The CBT places a core router at center of the shared tree and transfers data through the tore router. However, the CBT has two problems due to centralizing all network traffics into a core router. First it can raise bottleneck effect at a core router. Second, it is possible to make an additive processing overhead when core router is distant from receivers. To cope with the problems, this paper proposes an intelligent anycast routing protocol. The anycast routing attempts to distribute the centralized traffic into plural core routers by using a knowledge-based algorithm. The anycast routing estimates the traffic characteristics of multimedia data far each multicast source, and achieves effectively the distributing that places an appropriate core router to process the incoming traffic based on the traffic information in the event that request of receivers are raised. This method prevent the additional overhead to distribute traffic because an individual core router uses the information estimated to multicast sources connected to oneself and the traffic processing statistics shared with other core neuters.

• 소음진동
• /
• 제11권1호
• /
• pp.147-155
• /
• 2001

This paper is concerned with the real-time automatic tuning of the multi-input multi-output positive position feedback controllers for smart structures by the genetic algorithms. The genetic algorithms have proven its effectiveness in searching optimal design parameters without falling into local minimums thus rendering globally optimal solutions. The previous real-time algorithm that tunes a single control parameter is extended to tune more parameters of the MIMO PPF controller. We employ the MIMO PPF controller since it can enhance the damping value of a target mode without affecting other modes if tuned properly. Hence, the traditional positive position feedback controller can be used in adaptive fashion in real time. The final form of the MIMO PPF controller results in the centralized control, thus it involves many parameters. The bounds of the control Parameters are estimated from the theoretical model to guarantee the stability. As in the previous research, the digital MIMO PPF control law is downloaded to the DSP chip and a main program, which runs genetic algorithms in real time, updates the parameters of the controller in real time. The experimental frequency response results show that the MIMO PPF controller tuned by GA gives better performance than the theoretically designed PPF. The time response also shows that the GA tuned MIMO PPF controller can suppress vibrations very well.

• 한국HCI학회:학술대회논문집
• /
• 한국HCI학회 2009년도 학술대회
• /
• pp.232-239
• /
• 2009

Emerging social networking services provide a new paradigm for human-to-human communication. However, these services are centralized and managed by single service provider. In this paper, we propose MicroPost, a decentralized event notification service architecture for social applications based on publish/subscribe model. In our design space, event brokers are structured as an overlay network which provides the substrate of distributed peer-to-peer lookup service for storing and retrieving subscriptions with hashed keys. Event clients interact with event brokers to publish or subscribe social messages over the wide-area network. Using XML standards, we present an efficient algorithm to forward events for rendezvous-based matching in this paper. In our design space, the cost of routing is O(${\omega}log_kN$), where N is the number of event brokers, ${\omega}$ is the number of meta-data obtained from event messages, and k is a constant, which is selected by our design, to divide the identifier space and to conquer the lookup of given key. Consequently, what we achieved is an asynchronous social messaging service architecture which is decentralized, efficient, scalable, and flexible.

• 한국지능시스템학회논문지
• /
• 제14권4호
• /
• pp.499-505
• /
• 2004

본 논문에서는 가상 AGV를 이용한 AGVS의 시스템 모델링과 교통제어 대해 연구하였다. 실제 AGV에 기초한 가상의 AGV의 모델을 제안하고 각각의 가상 AGV가 독립적으로 명령을 수행하도록 하였다. 또한 공장 환경을 모델링하기 위해 연속된 직선경로정보와 AGV가 작업할 작업장소를 Vector Drawing방식으로 모델링이 가능하도록 하였다. 그리고, 서로 다른 AGV가 경로 합류점에서의 충돌을 방지하면서 정지하지 않고 AGV를 통과시킬 수 있도록 합류구역의 교통제어방식과 경로가 정체될 때 이를 우회할 수 있도록 하는 알고리즘을 제안하였다. 그리고 제안된 모델과 교통제어방식에 대하여 시뮬레이션을 수행하여 유효성을 검증하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권8호
• /
• pp.3201-3223
• /
• 2020

Wireless communication has become the promising technology in the recent times because of its applications in Internet of Things( IoT) devices. The IEEE 802.15.4e has become the key technology for IoT devices which utilizes the Time-Slotted Channel Hopping (TSCH) networks for the communication between the devices. In this paper, we develop a Two Level Scheduling Algorithm (TLSA) for scheduling multiple packets with different arrival rate at the source nodes in a TSCH networks based on the link activated by a centralized scheduler. TLSA is developed by considering three types of links in a network such as link i with packets arrival type 1, link j with packets arrival type 2, link k with packets arrival type 3. For the data packets arrival, two stages in a network is considered.At the first stage, the packets are considered to be of higher priority.At the second stage, the packets are considered to be of lower priority.We introduce level 1 schedule for the packets at stage 1 and level 2 schedule for the packets at stage 2 respectively. Finally, the TLSA is validated with the two different energy functions i.e., y = e^ax - 1 and y = 0.5x² using MATLAB 2017a software for the computation of average and worst ratios of the two levels.