• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권10호
• /
• pp.2587-2600
• /
• 2012

It has been demonstrated that choosing an appropriate relay node can improve the transmission rate for the system. However, such system improvement brought by the relay selection may be degraded with the presence of the malicious relay nodes, which are selected but refuse to cooperate for transmissions deliberately. In this paper, we formulate the relay selection issue as a restless bandit problem with the objective to maximize the average rate, while considering the credibility of each relay node, which may be different at each time instant. Then the optimization problem is solved by using the priority-index heuristic method effectively. Furthermore, a low complexity algorithm is offered in order to facilitate the practical implementations. Simulation results are conducted to demonstrate the effectiveness of the proposed trust-based relay selection scheme.

• 한국경영과학회지
• /
• 제26권4호
• /
• pp.125-132
• /
• 2001

Traffic unbalance between uplink and downlink is one of the most notable characteristics in the next generation cellular mobile systems which provide multimedia services such as voice and video telephony, high-speed internet access, and mobile computing, etc. The CDMA/TDD system with unbalanced slot allocation between two links is a good solution for the traffic unbalance in this paper, we formulate the time slot and channel allocation problem for the CDMA/TDD systems in general multicell environments, which is to maximize the system capacity under the given traffic unbalance, and solve that problem by simulated annealing technique. Computational experiments show that the proposed scheme yields a good performance.

• 한국경영과학회지
• /
• 제22권3호
• /
• pp.23-36
• /
• 1997

In the design of telecommunication network, the network configuration using hubbing topology is useful for designing and managing the network efficiently : i. e. all of central offices (COs) are grouped into clusters. Each cluster has one hub consisting of large-scale transmission facilities like digital cross-connect systems and ATMs. In clustering process, the community of interest and geographical factor should be considered. However, there exists a tradeoff between two factors. One is to minimize total link costs for geographical factor and the other is to maximize the total intra-cluster traffics for community of interest. Hence, this can be solved by multiobjective linear programming techniques. In this paper, the problem under considerations is formulated as two p-median subproblems taking into considerations total costs and total intra-traffics, respectively. Then we propose the algorithm to solve the problem based on the concept of cost-traffic tradeoff. The algorithm enables to identify efficient cost-traffic tradeoff pairs. An illustration is also presented.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -3
• /
• pp.1851-1854
• /
• 2002

The Internet with conventional routing scheme cannot meet user demands driven from drastic growth in the Internet user and various service and traffic type. MPLS(Multi Protocol Label Switching) was introduced to the Internet fur solution to resolve this problem. MPLS is a paradigm to integrate higher layer’s software routing functions including layer-3 routing with layer-2 switching. But, the exponential growth of Internet traffic brings out of label space. One scalable solution to cope with this problem is to introduce flow merge technique, i. e. a group of flows is forwarded using the same label. Specially, IETF(Internet Engineering Task Force) recommends that ATM based MPLS system may include VC merge function, so it is scalable to increase of internet traffic. We implemented the MPLS LER system that includes the look-up and forwarding function in incoming path and VC merging function and limited traffic management function in outgoing path. This paper describes the implementation of the LER’s outgoing parts.

• International Journal of Computer Science & Network Security
• /
• 제23권8호
• /
• pp.85-90
• /
• 2023

The Ant Colony System (ACS) is a variant of Ant colony optimization algorithm which is well-known in Traveling Salesman Problem. This paper proposed a hybrid method based on genetic algorithm (GA) and ant colony system (ACS), called GACS, to solve traffic routing problem. In the GACS, we use genetic algorithm to optimize the ACS parameters that aims to attain the shortest trips and time through new functions to help the ants to update global and local pheromones. Our experiments are performed by the GACS framework which is developed from VANETsim with the ability of real map loading from open street map project, and updating traffic light in real-time. The obtained results show that our framework acquired higher performance than A-Star and classical ACS algorithms in terms of length of the best global tour and the time for trip.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권10호
• /
• pp.3789-3809
• /
• 2015

In this paper, we deal with the problem of M2M gateways' network selection for different types of M2M traffic in heterogeneous wireless networks. Based on the difference in traffic's quality of service (QoS) requirements, the M2M traffic produced by various applications is mainly classified as two categories: flexible traffic and rigid traffic. Then, game theory is adopted to solve the problem of network-channel selection with the coexistence of flexible and rigid traffic, named as flexible network access (FNA). We prove the formulated discrete game is a potential game. The existence and feasibility of the Nash equilibrium (NE) of the proposed game are also analyzed. Then, an iterative algorithm based on optimal reaction criterion and a distributed algorithm with limited feedback based on learning automata are presented to obtain the NE of the proposed game. In simulations, the proposed iterative algorithm can achieve a near optimal sum utility of whole network with low complexity compared to the exhaustive search. In addition, the simulation results show that our proposed algorithms outperform existing methods in terms of sum utility and load balance.

• 대한산업공학회지
• /
• 제30권3호
• /
• pp.213-223
• /
• 2004

We consider the traffic grooming problem for the design of SONET/WDM(Synchronous Optical NETwork/Wavelength Division Multiplexing) ring networks. Given a physical network with ring topology and a set of traffic demands between pairs of nodes, we are to obtain a stack of rings with the objective of minimizing the number of ADMs installed at the nodes. This problem arises when a single ring capacity is not large enough to accommodate all the demands. As a solution method, an efficient algorithm based on the branch-and-price approach has been reported in the literature for the problem in which only unidirecional path switched ring (UPSR) was considered. In this study, we suggest integer programming models and the algorithms based on the same approach as the above one, considering two-fiber bidirectional line switched ring(BLSR/2), and BLSR/4 additionally. Using the results, we compare the number of required ADMs for all types of the ring architecture.

• 한국멀티미디어학회논문지
• /
• 제8권5호
• /
• pp.707-741
• /
• 2005

멀티미디어 스트리밍에서 유니캐스트 방식은 사용자 수가 증가함에 따라 트래픽이 증가하게 되어 추가적인 비용 부담이 있게 된다. 멀티캐스트 방식은 이러한 문제점을 해결할 수 있으나 클라이언트의 접속과 제어정보를 가질 수 없으며, 현재 대부분 라우터들이 유니캐스트 방식만을 지원하고 있는 실정이다. 또한, 다른 ISP 사업자간에는 서비스를 받을 수 없는 문제점을 가지고 있다. 본 논문에서는 이러한 문제점을 극복하기 위해 원격 화상교육을 위한 유니캐스트 방식과 P2P를 응용한 트래픽 에이전트 시스템을 제안하였다. 제안된 시스템은 컨트를 에이전트에 의해 스트림 서버의 트래픽이 감소되고,네트워크의 비용을 줄일 수 있다. 이 시스템은 JMF와 응용 소프트웨어를 이용하여 원격 화상교육을 시연함으로써 본 시스템의 타당성을 검증하고 분석하였다.

• 한국지능시스템학회논문지
• /
• 제6권4호
• /
• pp.92-101
• /
• 1996

차량의 증가와 도로 신장율의 저조로 교통체증은 날로 심해지고 있다. 이문제를 풀기 위한 한 방법은 교통류에 관한 실시간 정보를 얻어 교통신호를 동적으로 제어하는 것이다. 현재까지 교통류 정보를 얻기 위해 가장 많이 쓰인 것은 루프코일 인데 이것은 통과 차량의 평균속도를 측정하기 위해 필요한 차량 추적을 할 수 없는 단점이 있다. 따라서 이 문제를 해결하기 위해 영상 검지기가 출현하게 되었고 농담영상 혹은 칼라 영상열을 가정하고 있다. 본 논문에서는 칼라영상의 형태로 주어진 영상열에서 퍼지 클러스터리에 기반을 둔 이동 차량 추적 방법을 제안한다.

• 한국통신학회논문지
• /
• 제39B권6호
• /
• pp.350-359
• /
• 2014

최근 급격한 인터넷의 발전으로 효율적인 네트워크관리를 위해 응용 트래픽 데이터 분석의 중요성이 강조되고 있다. 네트워크 관리를 위해 관리자는 트래픽 데이터를 각각 어떠한 응용에서 발생 하였는지 탐지할 수 있어야 한다. 응용을 탐지하기 위한 방법들 중 하나인 통계정보 트래픽 분류방법을 사용하여 트래픽을 분류할 수 있지만, 이러한 통계정보를 그대로 사용하여 분류하기에는 트래픽 수집지점에서 발생하는 패킷 역전, 재전송에 의한 패킷 중복과 같은 문제점들이 있다. 본 논문에서는 응용에서 발생된 트래픽의 탐지 및 분석률 향상을 위해 패킷 역전 문제와 재전송에 의한 패킷 중복 문제를 탐지하고 개선하는 방법론을 제안하였다. 이렇게 제안한 개선 방법론을 실제 트래픽 분석 시스템에 적용시킴으로써 응용별 바이트 기준 최대 4%의 탐지 및 분석률 향상을 보였다. 이는 제안한 방법론이 실제 트래픽 망에 부담을 줄 수 있는 heavy 플로우의 분석에 기여함을 확인하였다.