• 정보과학회 논문지
• /
• 제44권9호
• /
• pp.976-985
• /
• 2017

낮은 비용으로 무선 네트워킹 인프라를 구축할 수 있는 무선 메쉬 네트워크에서는 제한된 무선 자원을 효율적으로 이용하기 위해 패킷 전송(특히, 불필요하게 중복되는 패킷 전송)을 신중하게 처리해야 한다. 본 논문에서는 컨트롤러를 통한 중앙 집중식의 관리가 가능한 소프트웨어 정의 네트워킹 기반의 무선 메쉬 네트워크에서 불필요하게 중복 전송되는 데이터의 양을 감소시키기 위해 경량화된 중복 제거기법을 제안한다. 제안하는 중복 제거 기법은 감소되는 트래픽 양을 극대화하기 위해 컨트롤러가 1) 기계학습 기반의 정보 요청, 2) ID기반의 소스 라우팅, 3) 인기도 기반의 캐쉬 업데이트를 통해 중복 제거 효과를 극대화시킬 수 있는 최적의 경로를 결정한다. 시뮬레이션 결과는 제안하는 기법을 통해 전체 트래픽 부하를 18.34%-48.89% 만큼 감소시킬 수 있음을 보여준다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권9호
• /
• pp.4287-4306
• /
• 2016

Network resilience provides an effective way to overcome the problem of network failure and is crucial to Internet protocol (IP) network management. As one of the main challenges in network resilience, recovering from link failure is important to maintain the constancy of packets being transmitted. However, existing failure recovery approaches do not handle the traffic engineering problem (e.g., tuning the routing-protocol parameters to optimize the rerouting traffic flow), which may cause serious congestions. Moreover, as the lack of QoS (quality of service) restrictions may lead to invalid rerouting traffic, the QoS requirements (e.g., bandwidth and delay) should also be taken into account when recovering the failed links. In this paper, we first develop a probabilistically correlated failure model that can accurately reflect the correlation between link failures, with which we can choose reliable backup paths (BPs). Then we construct a mathematical model for the failure recovery problem, which takes maximum rerouting traffic as the optimizing objective and the QoS requirements as the constraints. Moreover, we propose a heuristic algorithm for link failure recovery, which adopts the improved k shortest path algorithm to splice the single BP and supplies more protection resources for the links with higher priority. We also prove the correctness of the proposed algorithm. Moreover, the time and space complexity are also analyzed. Simulation results under NS2 show that the proposed algorithm improves the link failure recovery rate and increases the QoS satisfaction rate significantly.

• 한국IT서비스학회지
• /
• 제14권4호
• /
• pp.257-267
• /
• 2015

We propose a vehicle-mounted, location-aware mobile digital signage system that can be used for public transportation through mobile communication. This paper proposes the installations of the LED display panels at the backside of the bus., which display traffic information to cars behind the bus. Information to be displayed would include, but is not limited to, road information, public commercials and private commercials. We propose the system architecture and further implement the prototype of mobile digital signage system for demonstration. The system is based on the Client-Server system. Each bus has a client terminal which detects the current location by a GPS receiver and sends its location information to the server using mobile communication function. The terminal device receives advertisements and traffic information from the server and displays it to the large LCD or LED panel installed at the inside and outside of the bus. We use the Android smartphone as a client system, which inherently equipped with GPS and mobile communication function. GPS detects the location of bus and reports its geo-location data to the traffic information center server via a wireless communication network. On the server side, we developed a specially designed control server, where it communicates with the other traffic information center and updates and manages the databases contents being displayed by each position. The server contains location dependent variable information and returns selected information back to the vehicle in real time. Spatial database is used to process location based data. Server system periodically receives the real time traffic information from the road information center database. And it process the information by bus location and bus line number. In this paper, we propose a mobile digital signage service and explain the system implementation of this service.

• 대한교통학회지
• /
• 제17권1호
• /
• pp.91-102
• /
• 1999

본 연구의 복적은 국내 도시고속도로에 설치가 확대되고 있는 가변전광판을 이용하여 경고우회와 속도관리와 같은 적극적인 교통류관리방안의 도입 타당성을 검토하자는 것이다. 첫째, 도시고속도로 운전자들에게 본선 교통혼잡정보와 우회경로 교통정보를 가변전광판에 제공하였을 경우 우회경로로의 우회율을 조사하여 이에 따른 효과를 평가하였다. 올림픽대로 현장실험 결과 가변전광판에 우회경로에 대한 교통정보를 추가적으로 표출함에 따른 추가 우회율은 1.7%로 추정되었으며, 이에 따른 본선의 총통행시간은 3.7% 개선된 것으로 추정되었다. 둘째, 본선 하류부에 혼잡 발생시 권고속도 문안을 가변전광판에 표출하였을 경우의 속도관리 효과를 평가하였다. 올림픽도로 현장실험 견과 '속도를 줄이시오'라는 메시지에는 속도변화 반응이 발생하지 않았으나 '70km/h 속도 유지'와 같은 직접적인 권장속도 메시지에는 뚜렷한 속도감소반응이 관측되었다. 종합적으로 국내 도시고속도로에서도 가변전광판의 설치지점선정과 운영방식이 보완된다면 교통류관리 분야에 가변전광판의 활용범위가 넓어질 것으로 평가되었다.

• 한국군사과학기술학회지
• /
• 제22권3호
• /
• pp.369-381
• /
• 2019

As tactical networks are gradually shifting toward IP-based flexible operation for diversified battlefield services, QoS(Quality-of-Service) coordination for service differentiation becomes essential to overcome the heterogeneous and scarce networking resources limitations. QoS coordination for tactical network traffic should be able to monitor and react the dynamic changes in underlying network topology and service priorities. In this paper, by adopting the emerging cloud-native service mesh concept into tactical network context, we study the feasibility of intelligent QoS coordination by employing tactical service mesh(TSM) as an additional layer to support enhanced traffic quality monitoring and control. The additional TSM layer can leverage distributed service-mesh proxies at tactical mesh WAN(Wide Area Network) nodes so that service-aware differentiated QoS coordination can be effectively designed and integrated with TSM-assisted traffic monitoring and control. Also, by validating the feasibility of TSM layer for QoS coordination with miniaturized experimental setup, we show the potential of the proposed approach with several approximated battlefield traffics over a simulated TSM-enabled tactical network.

• ETRI Journal
• /
• 제37권1호
• /
• pp.147-156
• /
• 2015

A typical solid-state drive contains several independent channels that can be operated in parallel. To exploit this channel-level parallelism, a variety of works proposed to split consecutive write sequences into small segments and schedule them to different channels. This scheme exploits the parallelism but breaks the spatial locality of write traffic; thus, it is able to significantly degrade the efficiency of garbage collection. This paper proposes a channel-aware write reordering (CAWR) mechanism to schedule write requests to different channels more intelligently. The novel mechanism encapsulates correlated pages into a cluster beforehand. All pages belonging to a cluster are scheduled to the same channels to exploit spatial locality, while different clusters are scheduled to different channels to exploit the parallelism. As CAWR covers both garbage collection and I/O performance, it outperforms existing schemes significantly. Trace-driven simulation results demonstrate that the CAWR mechanism reduces the average response time by 26% on average and decreases the valid page copies by 10% on average, while achieving a similar hit ratio to that of existing mechanisms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권9호
• /
• pp.4063-4086
• /
• 2016

Cloud computing is a robust technology, which facilitate to resolve many parallel distributed computing issues in the modern Big Data environment. Hadoop is an ecosystem, which process large data-sets in distributed computing environment. The HDFS is a filesystem of Hadoop, which process data blocks to the cluster nodes. The data block placement has become a bottleneck to overall performance in a Hadoop cluster. The current placement policy assumes that, all Datanodes have equal computing capacity to process data blocks. This computing capacity includes availability of same storage media and same processing performances of a node. As a result, Hadoop cluster performance gets effected with unbalanced workloads, inefficient storage-tier, network traffic congestion and HDFS integrity issues. This paper proposes a storage-tier-aware Robust Data Placement (RDP) scheme, which systematically resolves unbalanced workloads, reduces network congestion to an optimal state, utilizes storage-tier in a useful manner and minimizes the HDFS integrity issues. The experimental results show that the proposed approach reduced unbalanced workload issue to 72%. Moreover, the presented approach resolve storage-tier compatibility problem to 81% by predicting storage for block jobs and improved overall data block placement by 78% through pre-calculated computing capacity allocations and execution of map files over respective Namenode and Datanodes.

• 대한임베디드공학회논문지
• /
• 제11권2호
• /
• pp.87-95
• /
• 2016

Nonvolatile memory (NVM) is being considered as an alternative of traditional memory devices such as SRAM and DRAM, which suffer from various limitations due to the technology scaling of modern integrated circuits. Although NVMs have advantages including nonvolatility, low leakage current, and high density, their inferior write performance in terms of energy and endurance becomes a major challenge to the successful design of NVM-based memory systems. In order to overcome the aforementioned drawback of the NVM, extensive research is required to develop energy- and endurance-aware optimization techniques for NVM-based memory systems. However, researchers have experienced difficulty in finding a suitable simulation tool to prototype and evaluate new NVM optimization schemes because existing simulation tools do not consider the feature of NVM devices. In this article, we introduce a NVM-based cache simulator to support rapid prototyping and evaluation of NVM-based caches, as well as energy- and endurance-aware NVM cache optimization schemes. We demonstrate that the proposed NVM cache simulator can easily prototype PRAM cache and PRAM+STT-RAM hybrid cache as well as evaluate various write traffic reduction schemes and wear leveling schemes.

• 정보처리학회논문지A
• /
• 제15A권1호
• /
• pp.35-44
• /
• 2008

다양한 모바일 기기들이나 무선 네트워크들에 의한 무분별한 자원 접근은 시스템에 문제를 일으킬 수 있으므로 접근 권한 관리는 매우 중요하다. 본 논문에서는 프로그래머가 각 응용 프로그램에 맞는 접근 권한 규칙을 정책 파일로 작성하고 이를 실행시키는 접근 제어 시스템을 구현하였다. 본 논문에서 구현된 접근 제어 시스템인 CACM(Context-awareness Access Control Manager)은 상황 인식 기반의 유비쿼터스 컴퓨팅을 위한 프레임워크인 JCAF을 바탕으로 구현하였다. CACM은 프로그래머가 작성한 정책 파일을 바탕으로 접근을 제어한다. 또한 본 논문에서는 정책 파일을 정적 분석하여 잘못된 정책 파일 규칙 알려주는 지원 시스템을 제공하며 본 시스템을 사용하여 개발된 유비쿼터스 응용 프로그램의 실행을 시뮬레이션 할 수 있는 시뮬레이터와 시뮬레이션 결과를 제공한다.

• Journal of Information Processing Systems
• /
• 제7권2호
• /
• pp.241-260
• /
• 2011

In earlier days, most of the data carried on communication networks was textual data requiring limited bandwidth. With the rise of multimedia and network technologies, the bandwidth requirements of data have increased considerably. If a network link at any time is not able to meet the minimum bandwidth requirement of data, data transmission at that path becomes difficult, which leads to network congestion. This causes delay in data transmission and might also lead to packet drops in the network. The retransmission of these lost packets would aggravate the situation and jam the network. In this paper, we aim at providing a solution to the problem of network congestion in mobile ad hoc networks [1, 2] by designing a protocol that performs routing intelligently and minimizes the delay in data transmission. Our Objective is to move the traffic away from the shortest path obtained by a suitable shortest path calculation algorithm to a less congested path so as to minimize the number of packet drops during data transmission and to avoid unnecessary delay. For this we have proposed a protocol named as Congestion Aware Selection Of Path With Efficient Routing (CASPER). Here, a router runs the shortest path algorithm after pruning those links that violate a given set of constraints. The proposed protocol has been compared with two link state protocols namely, OSPF [3, 4] and OLSR [5, 6, 7, 8].The results achieved show that our protocol performs better in terms of network throughput and transmission delay in case of bulky data transmission.