• ETRI Journal
• /
• 제24권3호
• /
• pp.251-254
• /
• 2002

We developed a method for optimal superframe design in the multi-frequency time division multiple access (MF-TDMA) return-link of a satellite multimedia interactive network called a digital video broadcasting return channel over satellite (DVB-RCS) sub-network. To find the optimal superframe pattern with the maximum data throughput, we formulated the design problem as a non-linear combinatorial optimization problem. We also devised the proposed simple method so that it would have field applicability for improving radio resource utilization in the MF-TDMA return link.

• 한국통신학회논문지
• /
• 제32권12B호
• /
• pp.728-734
• /
• 2007

본 논문에서는 최소 구축비용의 물리적 다중 보안 등급 네트워크 설계를 위한 GOSST 휴리스틱 메커니즘을 제안한다. 다중 보안 등급 네트워크상에서 각 노드는 원하는 보안 등급으로 다른 노드와 통신할 수 있다. 이를 위해서는 불법적인 물리적 접근을 통제할 수 있는 방법이 필요하다. 이러한 네트워크를 최소비용으로 구축하기 위해 GOSST 문제를 적용한다. 이 문제는 NP-Hard 영역이므로 현실적인 해를 얻기 위해서는 적절한 복잡도의 휴리스틱이 필요하다. 본 연구에서는 최소 구축비용의 물리적 다중 보안 등급 네트워크의 설계를 위해, 우리의 이전 거리 직접 GOSST 휴리스틱을 변형한 GOSST 휴리스틱 메커니즘을 제안한다. 이것은 실험 비교 대상인 G-MST에 대하여 평균 29.5%의 구축비용 절감을 보였다.

• 한국통신학회논문지
• /
• 제33권11B호
• /
• pp.961-967
• /
• 2008

Congestion control is one of major mechanisms to avoid dropped packets. Many researchers use optimization theories to find an efficient way to reduce congestion in networks, but they do not consider robustness that may lead to unstable network utilities. This paper proposes a new methodology in order to solve a congestion control problem for wired networks by using a robust design principle. In our particular numerical example, the proposed method provides robust solutions that guarantee high and stable network utilities.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제3권4호
• /
• pp.344-365
• /
• 2009

The performance of a tracking system is greatly increased if multiple types of sensors are combined to achieve the objective of the tracking instead of relying on single type of sensor. To conduct the multi-modal tracking, we have previously developed a multi-modal sensor-based tracking model where acoustic sensors mainly track the objects and visual sensors compensate the tracking errors [1]. In this paper, we find a network synchronization problem appearing in the developed tracking system. The problem is caused by the different location and traffic characteristics of multi-modal sensors and non-synchronized arrival of the captured sensor data at a processing server. To effectively deliver the sensor data, we propose a time-based packet aggregation algorithm where the acoustic sensor data are aggregated based on the sampling time and sent to the server. The delivered acoustic sensor data is then compensated by visual images to correct the tracking errors and such a compensation process improves the tracking accuracy in ideal case. However, in real situations, the tracking improvement from visual compensation can be severely degraded due to the aforementioned network synchronization problem, the impact of which is analyzed by simulations in this paper. To resolve the network synchronization problem, we differentiate the service level of sensor traffic based on Weight Round Robin (WRR) scheduling at the routers. The weighting factor allocated to each queue is calculated by a proposed Delay-based Weight Allocation (DWA) algorithm. From the simulations, we show the traffic differentiation model can mitigate the non-synchronization of sensor data. Finally, we analyze expected traffic behaviors of the tracking system in terms of acoustic sampling interval and visual image size.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• pp.452-455
• /
• 1999

Genetic algorithm is well known as the efficient algorithm which can solve a difficult problem. Network design considering reliability is NP-hard problem with cost, distance, and volume. Therefore genetic algorithm is considered as a good method for this problem. This paper suggests the reliable network which can be constructed with minimum cost using genetic algorithm and the rank method based on reliability for improving the performance. This method shows more excellent than existing method and confirms the result through simulation.

• 한국경영과학회지
• /
• 제18권1호
• /
• pp.29-43
• /
• 1993

This paper condisers a problem of determining arc capacities for a communication network with fixed-charged linear arc-cost functions, which is known to be NP-hard. For the problem, an efficient heuristic solution procedure is derived. The procedure is further shown working well for designing arc capacities of a network in a situation where the network needs to be extended by connecting its nodes to some new nodes or where the network needs to be extended by expanding its arc capacities.

• ETRI Journal
• /
• 제43권5호
• /
• pp.799-811
• /
• 2021

This paper considers a challenging problem: to simultaneously optimize the cost and the quality of service in opaque wavelength division multiplexing (WDM) networks. An optimization problem is proposed that takes the information including network topology, traffic between end nodes, and the target level of congestion at each link/ node in WDM networks. The outputs of this problem include routing, link channel capacities, and the optimum number of switch ports locally added/dropped at all switch nodes. The total network cost is reduced to maintain a minimum congestion level on all links, which provides an efficient trade-off solution for the network design problem. The optimal information is utilized for dynamic traffic in WDM networks, which is shown to achieve the desired performance with the guaranteed quality of service in different networks. It was found that for an average link blocking probability equal to 0.015, the proposed model achieves a net channel gain in terms of wavelength channels (𝛾_w) equal to 35.72 %, 39.09 %, and 36.93 % compared to shortest path first routing and 𝛾_w equal to 29.41 %, 37.35 %, and 27.47 % compared to alternate routing in three different networks.

• 정보보호학회논문지
• /
• 제9권2호
• /
• pp.73-82
• /
• 1999

이동하는 모빌노드(mobile node)의 인증 기법 중에, 홈 에이전트(home agent)와 모빌노드, 외부 에이전트(foreign agent)를 거치는 triangle 인증 기법이 있다. 이 기법의 문제점은, 모빌노드의 이동이 빈번하게 발생되면 인증 절차 또한 비례적으로 이루어져야 하므로 무선통신 환경상의 통신 오버헤드가 증가하게 된다. 이러한 문제점을 개선하기 위해서 본 논문에서는, 고차잉여류의 개념에 근거한 다중서명방식을 이용하여 모빌노드가 이동할 때마다 필요했던 홈 에이전트와 외부 에이전트간의 인증을 생략한 자체 인증 방식을 제안하고자 한다. In an open network computing environment a host cannot to identity its users correctly to network services. In order to prevent this thing we present the design of a authentication scheme 솟 using the notion of rth -residuosity problem and discrete logarithm problem which is proposed by S. J. Park et al. The proposed scheme described here is efficient method for mutual authentication without leakage of users identity in mobile communication system that ensure user anonymity and untraceability.

• 전기학회논문지
• /
• 제66권12호
• /
• pp.1772-1781
• /
• 2017

In this study, the design methodology for alleviating the overfitting problem of Polynomial Neural Networks(PNN) is realized with the aid of two kinds techniques such as L2 regularization and Sum of Squared Coefficients (SSC). The PNN is widely used as a kind of mathematical modeling methods such as the identification of linear system by input/output data and the regression analysis modeling method for prediction problem. PNN is an algorithm that obtains preferred network structure by generating consecutive layers as well as nodes by using a multivariate polynomial subexpression. It has much fewer nodes and more flexible adaptability than existing neural network algorithms. However, such algorithms lead to overfitting problems due to noise sensitivity as well as excessive trainning while generation of successive network layers. To alleviate such overfitting problem and also effectively design its ensuing deep network structure, two techniques are introduced. That is we use the two techniques of both SSC(Sum of Squared Coefficients) and $L_2$ regularization for consecutive generation of each layer's nodes as well as each layer in order to construct the deep PNN structure. The technique of $L_2$ regularization is used for the minimum coefficient estimation by adding penalty term to cost function. $L_2$ regularization is a kind of representative methods of reducing the influence of noise by flattening the solution space and also lessening coefficient size. The technique for the SSC is implemented for the minimization of Sum of Squared Coefficients of polynomial instead of using the square of errors. In the sequel, the overfitting problem of the deep PNN structure is stabilized by the proposed method. This study leads to the possibility of deep network structure design as well as big data processing and also the superiority of the network performance through experiments is shown.

• Korean Journal of Hydrosciences
• /
• 제6권
• /
• pp.107-118
• /
• 1995

The water distribution system problem consists of finding a minimum cost system design subject to hydraulic and operation constraints. The design of new branchin network in a paddy irrigation system is presented here. The program based on the linear programming formulation is aimed at finding the optimal economical combination of two main factors : the capital cost of pipe network and the energy cost. Two loading conditions and booster pumps for design of pipe network are considered to obtain the least cost design.