• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.849-853
• /
• 2002

인터넷 사용자 수의 급격한 증가로 인터넷 서비스 보급이 대중화됨에 따라 인터넷 텔레포니 기술이 전기통신사업자 및 인터넷 서비스 사업자들의 주요 이슈가 되고 있다. 인터넷 텔레포니 서비스를 위한 호처리 프로토콜을 표준화하기 위해 1999년 9원 IETF산하 SIP WG이 구성된 이래, RFC2543 bis 문서들이 계속 소개되었으며, 2002년 7월초 bis-09문서를 기반으로 RFC3261 SIP 표준이 제정되었다. 본 논문에서는 SIP 메시지 전송을 위해 초창기에 사용하던 Strict 라우팅 방법과 RFC3261에서 사용하는 Loose 라우팅 방법을 비교하고, RFC3261 SIP 표준에서 제공하는 둘 간의 호환성 문제 해결 방안을 분석한다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.28 no.2
• /
• pp.8-17
• /
• 2005

This paper dealt with a kind of heterogeneous vehicle routing problem with known demand and time deadline of customers. The customers are supposed to have one of tight deadline and loose deadline. The demand of customers with tight deadline must be fulfilled in the deadline. However, the late delivery is allowed to customers with loose deadline. That is, the paper suggests a model to minimize total acquisition cost, total travel distance and total violation time for a fleet size and mix vehicle routing problem with time deadline, and proposes a heuristic algorithm for the model. The proposed algorithm consists of two phases, i.e. generation of an initial solution and improvement of the current solution. An initial solution is generated based on a modified insertion heuristic and iterative Improvement procedure is accomplished using neighborhood generation methods such as swap and reallocation. The proposed algorithm is evaluated using a well known numerical example.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.9A
• /
• pp.1395-1404
• /
• 2000

In this paper, we propose a heuristic wavelength routing algorithm for IP datagrams in WDM (Wavelength-Division Multiplexing) networks which operates in a distributed manner, while most previous works have focused centralized algorithms. We first present an efficient construction method for a loose virtual topology with a connectivity property, which reserves a few wavelength to cope with dynamic traffic demands properly. This connectivity property assures that data from any source node could reach any destination node by hopping one or multiple lightpaths. We then develop a high-speed distributed wavelength routing algorithm adaptive to dynamic traffic demands by using such a loose virtual topology and derive the general bounds on average utilization in the distributed wavelength routing algorithms. Finally, we show that the performance of the proposed algorithms is better than that of the FSP(Fixed Shortest-Path) wavelength routing algorithms through simulation using the NSFNET[1] and a dynamic hot-spot traffic model, and that the algorithms is a good candidate in distributed WDM networks in terms of the blocking performance, the control traffic overhead, and the computation complexity.

• The KIPS Transactions:PartA
• /
• v.9A no.1
• /
• pp.19-28
• /
• 2002

A new class of applications based on event interactions are emerging for the wide-area network such as Internet, which is characterized as loose coupling, heterogeneity. and asynchrony. Content-barred publish/subscribe systems are widely being studied to implement the extent notification service for wide-area networks. In this paper, we analyze some problems of the content-based routing algorithm in SIENA, a recently developed as a representative event notification service architecture, and develop an enhanced routing algorithm.