• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3B
• /
• pp.349-359
• /
• 2004

To provide multicasting service, several multicast protocols for mobile hosts have been proposed. But they include glitches such as a non-optimal delivery route, data loss when hosts move another network, therefore they have some insecure problems about multicast data transmission. In this paper, we consider these problems and propose a new reliable and efficient multicast routing protocol for Mobile If networks. The proposed protocol provides reliable multicast transmission by compensating data loss from the previous agent when a mobile host moves another network. Also it provides additional function that is directly to connect a multicast tree according to the status of agents. It provides more efficient and optimal multicast path. The performance of the proposed protocol is proved by simulation of various conditions.

• The KIPS Transactions:PartC
• /
• v.9C no.2
• /
• pp.213-220
• /
• 2002

Distributed competing system gives a new system architecture to be taken into consideration for solving the problems of interoperability of heterogeneous systems. In the present paper, CORBA based on multi-threaded interoperates with software blocks at physically isolated hardware. We show how archives optimal CORBA system from analysis of required functions, implementations of protocols and benchmarking of system performance in the Open Multi-service Network System Environment. The core features of our CORBA system are restricted Quality of Service based on priority, timeout service and exception status information notify to the related software blocks. And the objectives are design and implementation of high performance multi-threaded middleware and satisfied with extendibility, flexibility and stability of CORBA platform.

• The KIPS Transactions:PartC
• /
• v.18C no.4
• /
• pp.243-250
• /
• 2011

Nowadays, the traffic type and behavior are extremely diverse due to the appearance of various services on Internet, which makes the need of traffic identification important for efficient operation and management of network. In recent years traffic identification methodology using statistical features of flow has been broadly studied. We also proposed a traffic identification methodology using payload size distribution in our previous work, which has a problem of low completeness. In this paper, we improved the completeness by solving the PSD conflict using IP and port. And we improved the accuracy by changing the distance measurement between flow and statistic signature from vector distance to per-packet distance. The feasibility of our methodology was proved via experimental evaluation on our campus network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3B
• /
• pp.274-287
• /
• 2009

In the Internet environment in which best-effort services are provided, we need to guarantee end-to-end performance rather than hop performance to provide services with a variety of QoS(Quality of Service) requirements. The end-to-end performance is affected by many factors along the path of traffic flow. Most existing simulation studies are concentrated on a single node or a few nodes. We need much different approach considering the simulation execution time to simulate a large-scale network. In this paper, we derive requirements and present methodologies for the implementation of the simulator to simulate it. Then, we design and implement our simulator using OPNET. Performance evaluation is carried out using the simulator for large-scale KII (National Information Infrastructure in Korea). We use a self-similar traffic model and present some results on the end-to-end performance metric for the networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.7
• /
• pp.2631-2649
• /
• 2021

Device-to-Device (D2D) communication is one of the enabling technologies for 5G networks that support proximity-based service (ProSe) for wireless network communications. This paper proposes a power control algorithm based on the Nash equilibrium and game theory to eliminate the interference between the cellular user device and D2D links. This leadsto reliable connectivity with minimal power consumption in wireless communication. The power control in D2D is modeled as a non-cooperative game. Each device is allowed to independently select and transmit its power to maximize (or minimize) user utility. The aim is to guide user devices to converge with the Nash equilibrium by establishing connectivity with network resources. The proposed algorithm with pricing factors is used for power consumption and reduces overall interference of D2Ds communication. The proposed algorithm is evaluated in terms of the energy efficiency of the average power consumption, the number of D2D communication, and the number of iterations. Besides, the algorithm has a relatively fast convergence with the Nash Equilibrium rate. It guarantees that the user devices can achieve their required Quality of Service (QoS) by adjusting the residual cost coefficient and residual energy factor. Simulation results show that the power control shows a significant reduction in power consumption that has been achieved by approximately 20% compared with algorithms in [11].

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11A
• /
• pp.859-866
• /
• 2003

In this paper, we designed the bandwidth allocation scheme with priority consideration for upstream channel access of EthernetPON. The objective of our scheme is to control the multi services in more effective way according to their CoS(Class of Service) or QoS(Quality of Service). The designed scheme considers transmission priority in the both side of OLT and ONU. In the OLT's view, the Two-step scheduling algorithm is applied with which we can support multiple bandwidth allocation policies simultaneously, i.e. SBA for the time-sensitive, constant rate transmission services and DBA for the best-effort services. This Two-step scheduling algorithm reduces the scheduling complexity by separating the process of transmission start time decision from the process of grant generation. In the ONU's view, the proposed scheme controls 8 priority queues of the 802.1d recommended 8 service classes. Higher priority queue is serviced in prior during the allowed GATE time from OLT. The OPNET modeling and simulation result compares the performance of each bandwidth allocation policy with SBA or DBA only approach.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10A
• /
• pp.1057-1064
• /
• 2007

Cognitive radio(CR) technique which utilizes empty frequency bands allocated to private business but not being used temporally has been researched. According to the standard, CR users detect the primary user using the same channel, CR users should move to the another channel to guarantee the primary user's decodability. Thus, CR systems cannot use the same channel and support the CR user's QoS(Quality of Service) during the channel moving time. In this paper, we propose a radio resource sharing method that CR basestation controls the transmission power with the primary user's SNR(Signal to Noise Ratio) to increase the spectral efficiency of area and to minimize the outage of CR users. In addition, computer simulation demonstrates show that the proposed method improved spectral efficiency of area and decreased outage probability of CR users.

• Journal of KIISE:Information Networking
• /
• v.35 no.5
• /
• pp.409-414
• /
• 2008

In mobile ad hoc networks, most of on demand routing protocols such as DSR and AODV do not deal with traffic load during the route discovery procedure. To solve the congestion and achieve load balancing, many protocols have been proposed. However, the existing load balancing schemes has only considered avoiding the congested route in the route discovery procedure or finding an alternative route path during a communication session. To mitigate this problem, we have proposed a new scheme which considers the packet bursting mechanism in congested nodes. The proposed packet bursting scheme, which is originally introduced in IEEE 802.11e QoS specification, is to transmit multiple packets right after channel acquisition. Thus, congested nodes can forward buffered packets promptly and minimize bottleneck situation. Each node begins to transmit packets in normal mode whenever its congested status is dissolved. We also propose two threshold values to define exact overloaded status adaptively; one is interface queue length and the other is buffer occupancy time. Through an experimental simulation study, we have compared and contrasted our protocol with normal on demand routing protocols and showed that the proposed scheme is more efficient and effective especially when network traffic is heavily loaded.

• Journal of Broadcast Engineering
• /
• v.12 no.2
• /
• pp.148-158
• /
• 2007

Recently, IEEE 802.15.4a(low-rate UWB) technique has been paid much attention to the LR-UWB communication system for WPAN. However, there are various interferences such as MPI(Multi Path Interference) or IPI(Inter Piconet Interference) in IEEE 802.15.4a wireless channel. In order to cancel various interferences occurred to WPAN environment, in this paper, we propose a UWB wireless communication system with high QoS(Quality of Service) which is a chaotic-OOK(On-Off Keying) system using unipolar ZCD(Zero Correlation Duration) spreading code in physical layer level. Furthermore, we analyze its performance via simulations and verify the availability of proposed system with prototype implementation.

• Journal of KIISE:Information Networking
• /
• v.36 no.4
• /
• pp.286-296
• /
• 2009

A major challenge in next generation optical Internet (NGOI) networks based on dense-wavelength division multiplexing (DWDM) is the provision of guaranteed quality-of-service (QoS) for a wide variety of multimedia applications. One of the critical issues in NGOI is the routing and wavelength assignment problem that is embossed as very important and plays a key role in improving the global efficiency for capacity utilization. But the previous researches had the delay problem, and the path routed by higher priority nodes may be congested and interfere with potential future multicast session requests. To overcome these problems, in this research we suggest a Priority-based Minimum Interference Path Multicast Routing (PMIPMR) algorithm, a new routing algorithm which finds alternative routes based on node priorities and Virtual Source (VS) nodes that has both splitting and wavelength conversion, and then chooses a path that does not interfere with potential future multicast session requests when congestions occur in the network. The PMIPMR algorithm reduces blocking rate significantly and increases the wavelength utilization by avoiding congestion in future multicast session requests.