• ETRI Journal
• /
• 제32권2호
• /
• pp.241-247
• /
• 2010

We propose and experimentally demonstrate a service-aware optical transport system. The proposed service-aware optical transport system makes a flow based on service type and priority of traffic. The generated flow is mapped to a corresponding sub-${\lambda}$ for transport over an optical network. Using sub-${\lambda}$ provided by the centralized control plane, we could effectively provide quality-of-service guaranteed Ethernet service and best-effort service simultaneously in a single link. The committed information rate (CIR) traffic and best-effort traffic are assigned to different sub-${\lambda}s$. The bandwidth of the CIR traffic is guaranteed without being affected by violation traffic because the bandwidth is managed per each sub-${\lambda}$. The failure detection time and restoration time from a link failure is measured to be about 60 ${\mu}s$ and 22 ms, respectively, in the ring network. The measured restoration time is much smaller than the 50 ms industry requirement for real-time services. The fast restoration time allows the proposed service-aware optical transport system to offer high availability and reliability which is a requirement for transport networks.

• 한국정보과학회논문지:정보통신
• /
• 제33권5호
• /
• pp.395-406
• /
• 2006

Ad hoc 네트워크에서 노드의 한정된 배터리 잔량 에너지는 전체 네트워크의 수명에 큰 영향을 끼친다. 따라서 이러한 에너지 한계를 극복하기 위해 다양한 power-aware 라우팅 프로토콜들이 네트워크 계층에서 제안되어 왔으며, 이들 power-aware 라우팅 프로토콜들은 기본적으로 노드의 배터리 잔량에너지와 전송 전력량을 경로 탐색 과정에서 반영한다. 본 논문에서 제안하는 power-aware 라우팅 프로토콜 TDPR(Traffic load & lifetime Deviation based Power-aware Routing protocol)은 노드의 배터리 잔량 에너지와 전송 전력량뿐만 아니라 각 노드의 트래픽 부하와 노드 간 예상 수명 편차를 경로 탐색 과정에 반영하여 전체 네트워크의 수명을 연장시키고 노드들 간 에너지 소모가 균등하게 이루어질 수 있도록 한다. ns-2[14] 시뮬레이터를 이용한 TDPR과 기존 라우팅 프로토콜들 간의 비교 실험은 전체 네트워크의 부하 균등, 노드들의 에너지 소모량, 그리고 개설 경로의 안정성 측면에서 TDPR의 개선된 성능을 확인한다. 실험 결과, 네트워크 탈퇴한 노드의 개수 비교에서는 TDPR이 AODV(4)보다 최대 72%, PSR[9]보다 최대 58% 적게 나타났다. 평균 잔량 에너지의 비교에서는 TDPR이 AODV보다 최대 29%, PSR보다 최대 15% 적은 양의 에너지를 소모하는 것을 확인하였으며, 에러 메시지의 발송 횟수 비교에서는 TDPR이 AODV보다 최대 41%, PSR보다는 최대 38% 적은 수의 에러 메시지를 발송하는 것을 확인할 수 있었다.

• Journal of Communications and Networks
• /
• 제17권1호
• /
• pp.47-57
• /
• 2015

With the ever growing demand of data applications, the joint macro-relay networks are emerging as a promising heterogeneous deployment to provide coverage extension and throughput enhancement. However, the current cellular networks are usually designed to be performance-oriented without enough considerations on the traffic variation, causing substantial energy waste. In this paper, we consider a joint macro-relay network with densely deployed relay stations (RSs), where the traffic load varies in both time and spatial domains. An energy-efficient scheme is proposed to dynamically adjust the RS working modes (active or sleeping) according to the traffic variations, which is called traffic-aware relay sleep control (TRSC). To evaluate the performance of TRSC,we establish an analytical model using stochastic geometry theory and derive explicit expressions of coverage probability, mean achievable rate and network energy efficiency (NEE). Simulation results demonstrate that the derived analytic results are reasonable and the proposed TRSC can significantly improve the NEE when the network traffic varies dynamically.

• 한국통신학회논문지
• /
• 제33권7B호
• /
• pp.510-517
• /
• 2008

센서 네트워크는 조밀하게 배치된 많은 수의 센서 노드로 구성되며, 극심한 에너지 제약을 가진다. 또한 네트워크의 충분한 통신 영역과 센싱 영역을 확보 할 수 있도록 스스로 토폴로지를 구성해야 한다. 본 논문에서는 이러한 토폴로지를 구성하기 위해 무선 센서 네트워크의 트래픽 정보를 이용하여 에너지 효율을 향상시키는 기법(TRaffic-Aware Topology control: TRAT)을 제시한다. 제안한 기법은 트래픽 정보를 근거로 활동 노드의 수와 각 노드의 전송 세기를 조절한다. 실험 결과, 제안한 기법은 기존의 토폴로지 제어 기법과 비교하여 30% 정도의 성능 향상을 보였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권5호
• /
• pp.2651-2673
• /
• 2019

In order to detect Denial of Service (DoS) attacks, victim-side detection methods are used popularly such as static threshold-based method and machine learning-based method. However, as DoS attacking methods become more sophisticated, these methods reveal some natural disadvantages such as the late detection and the difficulty of tracing back attackers. Recently, in order to mitigate these drawbacks, source-side DoS detection methods have been researched. But, the source-side DoS detection methods have limitations if the volume of attack traffic is relatively very small and it is blended into legitimate traffic. Especially, with the subtle attack traffic, DoS detection methods may suffer from high false positive, considering legitimate traffic as attack traffic. In this paper, we propose an effective source-side DoS detection method with traffic seasonality aware adaptive threshold. The threshold of detecting DoS attack is adjusted adaptively to the fluctuated legitimate traffic in order to detect subtle attack traffic. Moreover, by understanding the seasonality of legitimate traffic, the threshold can be updated more carefully even though subtle attack happens and it helps to achieve low false positive. The extensive evaluation with the real traffic logs presents that the proposed method achieves very high detection rate over 90% with low false positive rate down to 5%.

• 지식경영연구
• /
• 제11권2호
• /
• pp.75-93
• /
• 2010

Even though there have been many efforts on driver's route recommendation, driver still should get involved to choose the driving path in a manual manner. Uncertain traffic information provided to the driver delays his arrival time and hence may cause diminished economic values. One of the solutions of reducing the uncertainty is to provide various kinds of traffic information, rather than send real-time information. Therefore, as the wireless communication technology improves and at the same time volume of utilizable traffic contents increases in geometrical progression, selecting traffic information based on driver's context in a timely and individual manner will be needed. Hence, the purpose of this paper is to propose a methodology that efficiently sends the rich traffic contents to the personal in-vehicle navigation. To do so, driver preference is modeled and then the recommendation algorithm of traffic information contents was developed using the preference model. Secondly, ontology based traffic situation analyzation method is suggested to automatically inference the noticeable information from the traffic context on driver's route. To show the feasibility of the idea proposed in this paper, an open API service is implemented in consideration of ease of use.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권8호
• /
• pp.2875-2893
• /
• 2015

Existing coding aware routing algorithms focused on novel routing metric design that captures the characteristics of network coding. However, in packet coding algorithm, they use opportunistic coding scheme which didn't consider the queue state of the coding node and are equivalent to the conventional store-and-forward method in light traffic load condition because they never delay packets and there are no packets in the output queue of coding node, which results in no coding opportunity. In addition, most of the existing algorithms assume that all flows participating in the network have equal rate. This is unrealistic since multi-rate environments are often appeared. To overcome above problem and expand network coding to light traffic load scenarios, we present an enhanced coding-aware routing algorithm based on queue state and local topology (OQMCAR), which consider the queue state of coding node in packet coding algorithm where the control policy is of threshold-type. OQMCAR is a unified framework to merge single rate case and multiple rate case, including the light traffic load scenarios. Simulations results show that our scheme can achieve higher throughput and lower end-to-end delay than the current mechanisms using COPE-type opportunistic coding policy in different cases.

• Journal of Information Processing Systems
• /
• 제13권6호
• /
• pp.1544-1553
• /
• 2017

The network coding mechanism has attracted much attention because of its advantage of enhanced network throughput which is a desirable characteristic especially in a multi-hop wireless network with limited link capacity such as the device-to-device (D2D) communication network of 5G. COPE proposes to use the XOR-based network coding in the two-hop wireless network topology. For multi-hop wireless networks, the Distributed Coding-Aware Routing (DCAR) mechanism was proposed, in which the coding conditions for two flows intersecting at an intermediate node are defined and the routing metric to improve the coding opportunity by preferring those routes with longer queues is designed. Because the routes with longer queues may increase the delay, DCAR is inefficient in delivering real-time multimedia traffic flows. In this paper, we propose a network coding-aware routing protocol for multi-hop wireless networks that enhances DCAR by considering traffic load distribution and link quality. From this, we can achieve higher network throughput and lower end-to-end delay at the same time for the proper delivery of time-sensitive data flow. The Qualnet-based simulation results show that our proposed scheme outperforms DCAR in terms of throughput and delay.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권9호
• /
• pp.4205-4227
• /
• 2018

Network Coding (NC) is an approach recently investigated for increasing the network throughput and thus enhancing the performance of wireless mesh networks. The benefits of NC can further be improved when routing decisions are made with the awareness of coding capabilities and opportunities. Typically, the goal of such routing is to find and exploit routes with new coding opportunities and thus further increase the network throughput. As shown in this paper, in case of proactive routing the coding awareness along with the information of the measured traffic coding success can also be efficiently used to support the congestion avoidance and enable more encoded packets, thus indirectly further increasing the network throughput. To this end, a new proactive routing procedure called Congestion-Avoidance Network Coding-Aware Routing (CANCAR) is proposed. It detects the currently most highly-loaded node and prevents it from saturation by diverting some of the least coded traffic flows to alternative routes, thus achieving even higher coding gain by the remaining well-coded traffic flows on the node. The simulation results confirm that the proposed proactive routing procedure combined with the well-known COPE NC avoids network congestion and provides higher coding gains, thus achieving significantly higher throughput and enabling higher traffic loads both in a representative regular network topology as well as in two synthetically generated random network topologies.

• 한국통신학회논문지
• /
• 제31권4B호
• /
• pp.349-354
• /
• 2006

외부 IP 네트워크와 연동하여 다양한 패킷기반 서비스를 제공하는 3G 네트워크 환경에서 서비스의 end-to-end QoS 제공은 중요한 문제이다. 3GPP 진영은 정책기반 네트워크 자원관리 아키텍처를 표준으로 제안하고 있으며, 실제적으로 정책을 수행하는 수단으로 IntServ와 DiffServ의 사용이 권장되고 있다. 본 논문에서는 DiffServ-aware MPLS를 정책 수행 수단으로 사용하는 것을 제안한다. 이 방식을 이용하면, DiffServ에 의해 트래픽의 QoS를 차별적으로 보장하는 것은 물론, MPLS를 통해 다중 경로를 활용할 수 있어 네트워크 자원 이용도를 높일 수 있다. 이러한 장점들은 실시간 트래픽과 비실시간 트래픽이 동시에 서비스되는 환경에서 제안방식을 시뮬레이션 하여 검증하였다.