• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.4
• /
• pp.500-509
• /
• 1999

In this paper, we consider an optimal routing problem when point-to-point and point-to-multipoint connection traffics are offered in an ATM network. We propose a mathematical model for cost-minimizing configuration of a logical network for a given ATM-based BISDN. Our model is essentially identical to the previous one proposed by Kim(Kim, 1996) which finds a virtual-path configuration where the relevant gains obtainable from the ATM technology such as the statistical multiplexing gain and the switching/control cost-saving gain are optimally traded-off. Unlike the Kim's model, however, ours explicitly considers the VP's QoS(Quality of Service) for more efficient utilization of bandwidth. The problem is a large-scale, nonlinear, and mixed-integer problem. The proposed algorithm is based on the local linearization of equivalent-capacity functions and the relaxation of link capacity constraints. As a result, the problem can be decomposed into moderate-sized shortest path problems, Steiner arborescence problems, and LPs. This fact renders our algorithm a lot faster than the previous nonlinear programming algorithm while the solution quality is maintained, hence application to large-scale network problems.

• Journal of Industrial Technology
• /
• v.27 no.B
• /
• pp.77-82
• /
• 2007

A novel DDoS (Distributed Denial-of-Service) defense technique, Exaustiveness-Based Detection, is proposed in this work. It dispenses with the network congestion and the unfairness between users of the Defense-by-Offense technique by incorporating a kind of simple Detect-and-Block scheme (user identification), still improving the effectiveness of the defense in comparison to the original Defense-by-Offense technique. It uses SYN cookies to identify users in the granularity of ip address and to prevent ip address spoofing by the attacker. There can be, however, some probability of false negative (denying service to good clients), if the attacker wisely adapt to the new technique by saving some portion of its bandwidth resource and later mimicking good clients. Quantitative analysis the requirement for the good clients to be safe from the false negative is provided and a procedure to design the server capacity is explained.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.2A
• /
• pp.107-112
• /
• 2009

Spectral efficiency of current two-phase cooperative communications protocols is low since in the second time the relay forwards the same signal received from the source to the destination, the source keeps silent in this time. In this paper, we propose a novel cooperative communications protocol where the signal needed to transmit to the destination is sent in both phases, the source and the relay also transmit different signal to the destination thus no loss of spectral efficiency. This protocol performs signal selection based on log-likelihood ratio (LLR) at relay and maximum likelihood (ML) detection at destination. While existing protocols pay for a worse performance than direct transmission in the low SNR regime which is of special interest in ad hoc networks, ours is better over the whole range of SNR. In addition, the proposal takes advantages of bandwidth efficiency, long delay and interference among many terminals in ad hoc network. Simulation results show that the proposed protocol can significantly save total energy for wireless ad hoc networks.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.1
• /
• pp.89-100
• /
• 2000

Recently, studies on the mobile computing environments that enable mobile hosts to move while retaining its network connection are in progress. In these mobile computing environments, one of the necessary components is the distributed file system supporting mobile hosts, and there are several issues for the design and implementation of the shared file system. Among these issues, there are problems caused by network traffic on limited bandwidth of wireless media. Also, there are consistency maintenance issues that are caused by update-conflicts on the shared files in the distributed file system. In this paper, we propose TWB(Trickle Write-Back) scheme that utilizes weak connectivity for cache management of mobile clients. This scheme focuses on saving bandwidth, reducing waste of disk space, and reducing risks caused by disconnection. For such goals, this scheme lets mobile clients write back intermediate states periodically or on demand while delaying unnecessary write-backs. Meanwhile, this scheme is based on the existing distributed file system architecture and provides transparency.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.4
• /
• pp.203-210
• /
• 2017

Address resolution protocol (ARP) is used for binding a logical address to a physical address in many network technologies. However, since ARP is an stateless protocol, it always abused for performing ARP-based attacks. Researchers presented many technologies to improve ARP protocol, but most of them require a high implementation cost or scarify the network performance for improving security of ARP protocol. In this paper, we present an address auto-resoultion (AAR) network system to neutralize the ARP-based attacks. The AAR turns off the communication function of ARP messages(e.g. request and reply), but does not disable the ARP table. In our system, the MAC address of destination was designed to be derived from destination IP address so that the ARP table can be managed statically without prior knowledge (e.g., IP and MAC address pairs). In general, the AAR is safe from the ARP-based attacks since it disables the ARP messages and saves network traffics due to so.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.3
• /
• pp.523-541
• /
• 2011

In current IEEE 802.11 wireless LAN, every unicast transmission requires an ACK from the receiver for reliability, though it consumes energy and bandwidth. There have been studies to remove or reduce ACK overhead, especially for energy efficiency. However none of them are practically used now. This paper introduces a noble method of selective unacknowledged transmission, where skipping an ACK is dynamically decided frame by frame. Utilizing the fact that a multicast frame is transmitted without accompanying an ACK in 802.11, the basic unacknowledged transmission is achieved simply by transforming the destination address of a frame to a multicast address. Since removing ACK is inherently more efficient but less strict, its practical profit is dependent on traffic characteristics of a frame as well as network error conditions. To figure out the selective conditions, energy and performance implications of unacknowledged transmission have been explored. Extensive experiments show that energy consumption is almost always reduced, but performance may be dropped especially when TCP exchanges long data with a long distance node through a poor wireless link. An experiment with a well-known traffic model shows that selective unacknowledged transmission gives energy saving with comparable performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.4724-4747
• /
• 2016

To efficiently reduce on-grid energy consumption, the admission control algorithm in the hybrid energy powered cellular network (HybE-Net) with base stations (BSs) powered by on-grid energy and solar energy is studied. In HybE-Net, the fluctuation of solar energy harvesting and energy consumption may result in the imbalance of solar energy utilization among BSs, i.e., some BSs may be surplus in solar energy, while others may maintain operation with on-grid energy supply. Obviously, it makes solar energy not completely useable, and on-grid energy cannot be reduced at capacity. Thus, how to control user admission to improve solar energy utilization and to reduce on-grid energy consumption is a great challenge. Motivated by this, we first model the energy flow behavior by using stochastic queue model, and dynamic energy characteristics are analyzed mathematically. Then, fuzzy logic based admission control algorithm is proposed, which comprehensively considers admission judgment parameters, e.g., transmission rate, bandwidth, energy state of BSs. Moreover, the index of solar energy utilization balancing is proposed to improve the balance of energy utilization among different BSs in the proposed algorithm. Finally, simulation results demonstrate that the proposed algorithm performs excellently in improving solar energy utilization and reducing on-grid energy consumption of the HybE-Net.

• The KIPS Transactions:PartC
• /
• v.16C no.5
• /
• pp.605-614
• /
• 2009

Despite its graceful bandwidth saving nature, IP multicast has not been successful in widely spreading and using. Challenging includes policy and technological issues such as inter-domain routing, multicast availability and reachability. Properly detecting and isolating the faults would be the first step to stabilize IP multicast. In this paper, we introduce a scalable multicast monitoring framework. To efficiently cope with multicast network and networking problems, it enlarges its monitoring scopes from collecting delivery statistics to verifying end-to-end multicast availability, reachability and interactivity. We carry out various networking experiments to verify the scalability and feasibility of the proposed framework.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.8B
• /
• pp.473-481
• /
• 2007

We are interested in the PON which is easy to install and inexpensive to maintain, as it is a solution of the FTTH that is a core technology of the BcN access network. When a new ONU is connected, TDMA PON has a procedure called ranging that OLT measures the distance and allocates the equalized delay to it in order to provide the same logical distance to all ONUs. For the procedure, the OLT has to open a time window several times and already activated ONUs cannot transmit a data to the upstream during the periods. Accordingly, it is important to reduce the window size for saving the bandwidth and providing a user the service smoothly. In this paper, we investigate the ONU activation method of G-PON based on ITU-T G984.3 and suggest an advanced method(algorithm I) that minimizes the window size without information of ONU distance. The size can be reduced by calculating the pre-assigned delay obtained during Serial number state. Also, we compare it with another(algorithm II) with information of distance. As a result, the window size reduces to $50{\sim}90%$ for the algorithm I and 99% for algorithm II during the ONU activation process.