• ETRI Journal
• /
• v.32 no.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.

• Journal of KIISE:Information Networking
• /
• v.33 no.5
• /
• pp.395-406
• /
• 2006

In ad hoc networks, the limited battery capacity of nodes affects a lifetime of network Recently, a large variety of power-aware routing protocols have been proposed to improve an energy efficiency of ad hoc networks. Existing power-aware routing protocols basically consider the residual battery capacity and transmission power of nodes in route discovery process. This paper proposes a new power-aware routing protocol, TDPR(Traffic load & lifetime Deviation based Power-aware Routing protocol), that does not only consider residual battery capacity and transmission power, but also the traffic load of nodes and deviation among the lifetimes of nodes. It helps to extend the entire lifetime of network and to achieve load balancing. Simulations using ns-2[14] show the performance of the proposed routing protocol in terms of the load balancing of the entire network, the consumed energy capacity of nodes, and an path's reliability TDPR has maximum 72% dead nodes less than AODV[4], and maximum 58% dead nodes less than PSR[9]. And TDPR consumes residual energy capacity maximum 29% less than AODV, maximum 15% less than PSR. Error messages are sent maximum 38% less than PSR, and maximum 41% less than AODV.

• Journal of Communications and Networks
• /
• v.17 no.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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.7B
• /
• pp.510-517
• /
• 2008

In wireless sensor networks, a number of nodes deployed in dense manner should be self-configured to establish a topology that provides communication and sensing coverage under stringent energy constraints. To establish an efficient topology, we propose the TRaffic-Aware Topology control (TRAT) algorithm that reduces energy dissipation by considering total amount of data flows in the network. Our algorithm controls the number of active nodes with traffic information and adjusts nodal transmission power by estimating amount of data flows. According to the result, the proposed algorithm shows about 30% better performance than the other methods in terms of energy efficiency.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.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%.

• Knowledge Management Research
• /
• v.11 no.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)
• /
• v.9 no.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
• /
• v.13 no.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)
• /
• v.12 no.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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4B
• /
• pp.349-354
• /
• 2006

In 3G networks interworking with external IP-based networks, provision of end-to-end QoS to packet-based services is a critical issue. In this paper, we propose DiffServ-aware Multiple Protocol Label Switching(MPLS) as a new policy enforcement means. With the adoption of the proposed DiffServ-aware MPLS, it is feasible to provide differentiated QoS provision with the help of DiffServ as well as to improve network utilization by using multiple paths based on MPLS. We verify the effectiveness of our proposed policy enforcement means through a simulation in which realtime traffic and non-realtime traffic are served together.