• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.1
• /
• pp.22-37
• /
• 2013

Content distribution to a large number of concurrent clients stresses both server and network. While the server limitation can be circumvented by deploying server clusters, the network limitation is far less easy to cope with, due to the difficulty in measuring and balancing network load. In this paper, we use two useful network load metrics, the worst link stress (WLS) and the degree of interference (DOI), and formulate the problem as partitioning the clients into disjoint subsets subject to the server capacity constraint so that the WLS and the DOI are reduced for each session and also well balanced across the sessions. We present a network load-aware partition algorithm, which is practicable and effective in achieving the design goals. Through experiments on PlanetLab, we show that the proposed scheme has the remarkable advantages over existing schemes in reducing and balancing the network load. We expect the algorithm and performance metrics can be easily applied to various Internet applications, such as media streaming, multicast group member selection.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3701-3727
• /
• 2016

Recently Service Function Chaining (SFC) is promising to innovate the network service mode in modern networks. However, a feasible implementation of SFC is still difficult due to the need to achieve functional equivalence with traditional modes without sacrificing performance or increasing network complexity. In this paper, we present a configurable network service chaining (CNSC) mechanism to provide services for network traffics in a flexible and optimal way. Firstly, we formulate the problem of network service chaining and design an effective service chain construction framework based on integrating software-defined networking (SDN) with network functions virtualization (NFV). Then, we model the service path computation problem as an integer liner optimization problem and propose an algorithm named SPCM to cooperatively combine service function instances with a network utility maximum policy. In the procedure of SPCM, we achieve the service node mapping by defining a service capacity matrix for substrate nodes, and work out the optimal link mapping policies with segment routing. Finally, the simulation results indicate that the average request acceptance ratio and resources utilization ratio can reach above 85% and 75% by our SPCM algorithm, respectively. Upon the prototype system, it is demonstrated that CNSC outperforms other approaches and can provide flexible and scalable network services.

• Journal of Communications and Networks
• /
• v.10 no.2
• /
• pp.186-193
• /
• 2008

A two-hop multiple-input multiple-output (MIMO) relay network which comprises a multiple antenna source, an amplify-and-forward MIMO relay and many potential users are studied in this paper. Consider the achievable sum rate as the performance metric, a joint design method for the processing units of the BS and relay node is proposed. The optimal structures are given, which decompose the multiuser MIMO relay channel into several parallel single-input single-output relay channels. With these structures, the signal-to-noise ratio at the destination users is derived; and the power allocation is proved to be a convex problem. We also show that high sum rate can be achieved by pairing each link according to its magnitude. The sum rate of three broadcast strategies, time division multiple access (TDMA) to the strongest user, dirty paper coding (DPC), and beamforming (BF) are investigated. The sum rate bounds of these strategies and the sum capacity (achieved by DPC) gain over TDMA and BF are given. With these results, it can be easily obtained that how far away TDMA and BF are from being optimal in terms of the achievable sum rate.

• Journal of Communications and Networks
• /
• v.9 no.2
• /
• pp.198-209
• /
• 2007

This paper provides a thorough study on shared segment protection (SSP) for mesh communication networks in the complete routing information scenario, where the integer linear program (ILP) in [1] is extended such that the following two constraints are well addressed: (a) The restoration time constraint for each connection request, and (b) the switching/merging capacity constraint at each node. A novel approach, called SSP algorithm, is developed to reduce the extremely high computation complexity in solving the ILP formulation. Basically, our approach is to derive a good approximation on the parameters in the ILP by referring to the result of solving the corresponding shared path protection (SPP) problem. Thus, the design space can be significantly reduced by eliminating some edges in the graphs. We will show in the simulation that with our approach, the optimality can be achieved in most of the cases. To verify the proposed formulation and investigate the performance impairment in terms of average cost and success rate by the additional two constraints, extensive simulation work has been conducted on three network topologies, in which SPP and shared link protection (SLP) are implemented for comparison. We will demonstrate that the proposed SSP algorithm can effectively and efficiently solve the survivable routing problem with constraints on restoration time and switching/merging capability of each node. The comparison among the three protection types further verifies that SSP can yield significant advantages over SPP and SLP without taking much computation time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6B
• /
• pp.508-516
• /
• 2006

The explosive growth of wireless network users and the existence of various wireless services have demanded high rate throughput as well as user's QoS guarantees. Towards this, this paper proposes QoS-oriented subcarrier allocation scheme considering the QoS provisioning of multiple users, which is major requirement for wireless network design point of view. This paper introduces joint RR/K&H combined with M-LWDF(Modified Largest Weighted Delay First) scheme throughout observing statistical channel behavior and real time queuing analysis for appropriate resource allocation tightly connected to multiuser scheduling. Accordingly, the system throughput can be enhanced, and the QoS demanded for delay sensitive services can be satisfied. Furthermore, the proposed scheme is applied for OFDMA(Orthogonal Frequency Division Multiple Access) systems to allocate sub-carriers in optimal way. The simulation results verify plausible performances of proposed resource allocation scheme via showing superior effective capacity under time-varying physical-layer channel behaviors.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.7
• /
• pp.51-58
• /
• 2010

Wireless Mesh Network has drawn much attention due to wide area service coverage with low system cost. However, there is a bottleneck problem in wireless mesh network since the traffic is aggregated into a gateway. Placement of multi-radio can easy the bottleneck problem, but without careful design it results in unnecessary system cost increasement. In this paper, we propose a system cost minimization through differential antenna placement where optimum antenna placement is determined by the required wireless link capacity. With CPLEX program, optimum number of antennae is determined as a function of local user traffic and gateway capacity. From numerical analysis, it is confirmed that our proposed model can solve bottleneck problem, and at the same time save the system cost.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.905-916
• /
• 2004

Self-organizing hierarchical ad hoc network (SOHAN) is a new ad-hoc network architecture designed to improve the scalability properties of conventional 'flat' ad hoc networks. This network architecture consists of three tiers of ad-hoc nodes, i.e.. access points, forwarding nodes and mobile nodes. This paper presents a topology discovery and routing protocol for the self-organization of SOHAN. We propose a cross-layer path metric based on link quality and MAC delay which plays a key role in producing an optimal cluster-based hierarchical topology with high throughput capacity. The topology discovery protocol provides the basis for routing which takes place in layer 2.5 using MAC addresses. The routing protocol is based on AODV with appropriate modifications to take advantage of the hierarchical topology and interact with the discovery protocol. Simulation results are presented which show the improved performance as well as scalability properties of SOHAN in terms of through-put capacity, end-to-end delay, packet delivery ratio and control overhead.

• Journal of Korean Society of Transportation
• /
• v.22 no.5
• /
• pp.139-149
• /
• 2004

As the expansion of road capacity has become impractical in many urban areas, congestion pricing has been widely considered as an effective method to reduce urban traffic congestion in recent years. The principal reason is that the congestion pricing may lead the user equilibrium (UE) flow pattern to system optimum (SO) pattern in road network. In the context of network equilibrium, the link tolls according to the marginal cost pricing principle can user an UE flow to a SO pattern. Thus, the pricing method offers an efficient tool for moving toward system optimal traffic conditions on the network. This paper proposes a continuous network design program (CNDP) in network equilibrium condition, in order to find optimal congestion toll for maximizing net economic benefit (NEB). The model could be formulated as a bi-level program with continuous variable(congestion toll) such that the upper level problem is for maximizing the NEB in elastic demand, while the lower level is for describing route choice of road users. The bi-level CNDP is intrinsically nonlinear, non-convex, and hence it might be difficult to solve. So, we suggest a heuristic solution algorithm, which adopt derivative information of link flow with respect to design parameter, or congestion toll. Two example networks are used for test of the model proposed in the paper.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.12
• /
• pp.30-45
• /
• 2014

Recently, multimedia application users who demand for ubiquitous computing environment are rapidly increasing, and wireless mesh network is receiving attention as a cost-effective key technology for next generation wireless networking. When multiple flows are transmitting data at the same time in the network, routing for path selection of each flow and link resource allocation for data transmission of each flow are one of the key factors that influence to the effectiveness of the network directly. In this paper, we consider problems for path discovery and resource allocation of links at the same time and we propose an algorithm based on mathematical modeling using a technique for cross-layer optimization design in STDMA-based wireless mesh networks that can enhance transfer performance for each flow. We show by performance analysis that the proposed algorithm can enhance the throughput performance by maximally utilizing given bandwidth resources when the number of flows increase in multi-hop wireless mesh networks.

• KEPCO Journal on Electric Power and Energy
• /
• v.5 no.3
• /
• pp.141-147
• /
• 2019

Recently, the biggest issue in the electricity industry is the increase in renewable energy, and various technologies are being developed to ensure the capacity of the power system. In addition, super-grids linking power systems are being pushed to utilize eco-friendly energy between countries and regions worldwide. The HVDC transmission technology is required to link the power network between regions with different characteristics of the power system such as frequency and voltage. Until now, Korea has applied HVDC transmission technology that connects mainland and Jeju Island with submarine cables. But, the HVDC transmission technology is still developing for long-distance high-capacity power transmission from power parks on the east coast to load-tight areas near the metropolitan area. Considering the high population density and mountainous domestic environment, it is pushing for commercialization of the design technology of the ${\pm}500kV$ Double Bipole with metallic return wire transmission line to transmit large-scale power of 8 GW using minimal right of ways. In this paper, the insulation characteristics were studied for the design of double-bipole transmission tower with metallic return wire, which is the first time in the world. And the air insulation characteristics resistant to the various overvoltage phenomena occurring on transmission lines were verified through a full-scale impulse voltage test.