• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2005년도 춘계공동학술대회 발표논문
• /
• pp.238-242
• /
• 2005

This paper considers a routing problem on a RPR(Resilient Packet Ring). The RPR is one of the ring-type data telecommunication network. Our major problem is to find an optimal routing algorithm for a given data traffic on the network under no splitting the traffic service, where the maximum load of a link is minimized. This paper characterizes the Minmax problem and develops two heuristic algorithms. By using the numerical comparison, we show that our heuristic algorithm is valuable for efficient routing the data traffic on a RPR.

• 인터넷정보학회논문지
• /
• 제9권2호
• /
• pp.139-145
• /
• 2008

CRM(Customer Relationship Management)은 비즈니스 환경에서 기업의 이익과 경쟁적 우위를 차지할 수 있도록 하는 비즈니스 전략이다. 기업의 고객 응대 기법으로는 인터넷, E-mail, SMS(Short Message Service), 텔레포니 서비스, DM(Direct Mail)이 이용되고 있다. 최근 수익성 모델 향상을 위한 노력으로 기존 고객의 이탈 방지 및 유지, 신규 고객의 가입 및 유지를 통한 비즈니스 모델을 다각화하고 있다. 또한 고객의 최초 접점이 될 수 있는 CRM 센터의 업무 프로세스 재설계(Business Process Re-engineering), 업무 프로세스 관리(Business Process Management)가 빈번하게 발생하고 있다. 본 논문에서는 고객응대 CRM 모델 구축시의 고려 사항을 제시하고 콜 객체 라우팅(Call Object Routing)을 위한 에이젼트(Agent)를 제안하고 구현 및 성능평가를 하였다. 제안한 모델은 대 고객 응대 CRM 모델로 효율적으로 이용될 수 있다.

• 한국통신학회논문지
• /
• 제32권9A호
• /
• pp.923-930
• /
• 2007

본 논문에서는 모바일 애드 혹 네트워크(MANET)에서 전력 효율적인 QoS 라우팅 알고리즘을 설명한다. 멀티미디어 데이터는 해당 응용 계층에 따라서 대역폭, 지연시간 등의 QoS를 필요로 한다. 그러나 모바일 애드 혹 네트워크는 토폴로지가 시간이 지남에 따라 자주 변하고, 전력 등의 자원에 제약이 많기 때문에 QoS를 보장하기 어렵다. 그러므로 본 논문에서는 최소의 전체 소비전력으로 보다 지속적으로 종단 간에 요구된 QoS를 보장하는 온-디멘드 방식의 QoS 라우팅 알고리즘(MAPER)를 제안한다. 마지막으로 실험결과에서는 제안한 알고리즘의 성능을 보인다.

• 정보처리학회논문지A
• /
• 제9A권1호
• /
• pp.19-28
• /
• 2002

이벤트에 기반한 약결합의 분산 응용이 인터넷과 같은 광역네트워크 상에서의 주요 응용분야로 대두되고 있다. 이를 지원하기 위해 이벤트 통지서비스가 필요하다. 광역 네트웍크상에서 이벤트 통지 서비스를 구현하는 방법으로 내용기반 이벤트 라우팅이 최근 활발히 연구되고 있다. 본 논문에서는 효과적인 내용기반 이벤트 라우팅 알고리즘을 구현하기 위해 기존에 발표된 대표적인 이벤트 통지서비스 시스템인 SIENA에 바탕을 두고, SIENA에서의 이벤트 라우팅 알고리즘의 문제점을 분석하고 이를 개선한 라우팅 알고리즘을 제안한다.

• 한국시뮬레이션학회논문지
• /
• 제21권3호
• /
• pp.71-78
• /
• 2012

본 연구는 대기행렬 네트워크 시뮬레이션에서 통제변수를 활용하여 목표 반응변수를 보다 더 정확히 추정하는 기법을 탐색한다. 반응변수 추정에서 통제변수기법의 효율성은 반응변수와 높은 상관관계를 가지는 통제변수의 선택과 선택된 통제변수를 이용하여 통제추정량을 어떻게 정의하는가에 따라 달라진다. 대기행렬 네트워크 시뮬레이션 모형에서 확률적 모형의 발전과정은 확률적 서비스시간과 분지 확률에 의하여 재현된다. 대부분의 통제변수기법은 통제추정치 구성에서 서비스 시간 확률변수를 사용한다. 본 연구는 서비스 시간 확률변수와 분지 확률변수를 동시에 사용하는 통제 추정량을 제안하고 이를 컴퓨터 네트워크 시스템의 관심 반응변수 추정에 응용하여 그 효율성을 탐색하고자 한다. 시뮬레이션 결과는 반응변수 추정에 있어서 분지확률 통제변수의 활용 가능성을 제시하고 있으며, 서비스-시간과 분지확률을 동시에 이용하는 결합 통제변수의 활용은 향후 연구가 필요한 분야로 판단된다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.1846-1850
• /
• 2005

This paper presents a constrained-based routing (CBR) algorithm called, Dynamic Possible Path per Link (D-PPL) routing algorithm, for MultiProtocol Label Switching (MPLS) networks. In MPLS on-line routing, future traffics are unknown and network resource is limited. Therefore many routing algorithms such as Minimum Hop Algorithm (MHA), Widest Shortest Path (WSP), Dynamic Link Weight (DLW), Minimum Interference Routing Algorithm (MIRA), Profiled-Based Routing (PBR), Possible Path per Link (PPL) and Residual bandwidth integrated - Possible Path per Link (R-PPL) are proposed in order to improve network throughput and reduce rejection probability. MIRA is the first algorithm that introduces interference level avoidance between source-destination node pairs by integrating topology information or address of source-destination node pairs into the routing calculation. From its results, MIRA improves lower rejection probability performance. Nevertheless, MIRA suffer from its high routing complexity which could be considered as NP-Complete problem. In PBR, complexity of on-line routing is reduced comparing to those of MIRA, because link weights are off-line calculated by statistical profile of history traffics. However, because of dynamic of traffic nature, PBR maybe unsuitable for MPLS on-line routing. Also, both PPL and R-PPL routing algorithm we formerly proposed, are algorithms that achieve reduction of interference level among source-destination node pairs, rejection probability and routing complexity. Again, those previously proposed algorithms do not take into account the dynamic nature of traffic load. In fact, future traffics are unknown, but, amount of previous traffic over link can be measured. Therefore, this is the motivation of our proposed algorithm, the D-PPL. The D-PPL algorithm is improved based on the R-PPL routing algorithm by integrating traffic-per-link parameters. The parameters are periodically updated and are dynamically changed depended on current incoming traffic. The D-PPL tries to reserve residual bandwidth to service future request by avoid routing through those high traffic-per-link parameters. We have developed extensive MATLAB simulator to evaluate performance of the D-PPL. From simulation results, the D-PPL improves performance of MPLS on-line routing in terms of rejection probability and total throughput.

• Journal of Communications and Networks
• /
• 제8권1호
• /
• pp.116-122
• /
• 2006

Most of the multimedia applications require strict quality of service (QoS) guarantee during the communication between a single source and multiple destinations. This gives rise to the need for an efficient QoS multicast routing strategy. Determination of such QoS-based optimal multicast routes basically leads to a multi-objective optimization problem, which is computationally intractable in polynomial time due to the uncertainty of resources in Internet. This paper describes a network model for researching the routing problem and proposes a new multicast tree selection algorithm based on genetic algorithms to simultaneously optimize multiple QoS parameters. The paper mainly presents a QoS multicast routing algorithm based on genetic algorithm (QMRGA). The QMRGA can also optimize the network resources such as bandwidth and delay, and can converge to the optimal or near-optimal solution within few iterations, even for the networks environment with uncertain parameters. The incremental rate of computational cost can close to polynomial and is less than exponential rate. The performance measures of the QMRGA are evaluated using simulations. The simulation results show that this approach has fast convergence speed and high reliability. It can meet the real-time requirement in multimedia communication networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권9호
• /
• pp.2231-2252
• /
• 2012

With the prevalence of diverse services-oriented applications, such as IPTV systems and on-line games, the current underlying communication networks face more and more challenges on the aspects of flexibility and adaptability. Therefore, an effective and efficient multicast routing mechanism, which can fulfill different requirements of different personalized services, is critical and significant. In this paper, we first define the neighbor gradient, which is calculated based on the weighted sum of attributes such as residual link capacity, normalized hop count, etc. Then two distributed multicast routing algorithms which are neighbor Gradient-based Multicast Routing for Static multicast membership (GMR-S) and neighbor Gradient-based Multicast Routing for Dynamic multicast membership (GMR-D), are proposed. GMR-S is suitable for static membership situation, while GMR-D can be used for the dynamic membership network environment. Experimental results demonstrate the effectiveness and efficiency of our proposed methods.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 2003년도 춘계학술대회논문집
• /
• pp.61-66
• /
• 2003

Mobile IP has been designed only to maintain communication as they move form place to place, so it doesn't guarantee Quality of Service(QoS). QoS in mobile IP is important to provide multimedia and real-time applications services in mobile, and it is closely related to handoff delay. Therefore, handoff delay problem is actively studied to guarantee QoS as a main issue in mobile IP research area Next generation Mobile IPv6 resolve this problem somewhat, triangle problem for first packet and handoff delay still remain. In this paper, we suggest SNMP Information-based routing that adds keyword management method to Information-based routing in active network in order to resolve such a problem, and then suggest QoS controlled handoff based on SNMP Information-Based routing. After modeling of suggested method and existing handoff method simulations we carried out with NS-2 for performance evaluation. The results of simulations show the some improvement on handoff delay, and therefore on QoS improvement.

• 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.