• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5B
• /
• pp.257-269
• /
• 2007

This paper proposes a novel method to perform a quantitative analysis of message complexity and applies this method in comparing the message complexity among the mobile ad hoc network (MANET) address autoconfiguration protocols (AAPs). To obtain the upper bound of the message complexity of the protocols, the O-notation of a MANET group of N nodes has been applied. The message complexity of the single node joining case in Strong DAD, Weak DAD with proactive routing protocols (WDP), Weak DAD with on-demand routing protocols (WDO), and MANETconf has been derived as n(mO(N)+O(t)), n(O(N)+O(t)), n(O(N)+2O(t)), and nO((t+1)N)+O(N)+O(2) respectively. In order to verify the bounds, analytical simulations that quantify the message complexity of the address autoconfiguration process based on the different coflict probabilities are conducted.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10b
• /
• pp.850-852
• /
• 2003

이 논문에서는 여러 가지 도구를 논리적인 순서로 사용함으로써 이루어지는 작업을 워크플로우로 보고, 이러한 관점에서 바이오인포매틱스 도구를 통합하는 새로운 멀티에이전트 시스템을 제안한다. 제안한 시스템은 기존의 도구를 랩퍼 에이전트로 구현하고, 에이전트간의 통신은 XML 형식의 메시지로 이루어진다. 수신 에이전트는 송신 에이전트가 전송하는 정보를 명시적으로 알리지 않고도 메시지로부터 필요한 정보를 추출할 수 있다. 제안한 시스템의 이러한 특징은 바이오인포매틱스 도구와 데이터베이스의 통합을 용이하게 한다. 또한, 제안한 시스템에서는 워크플로우를 여러 가지 제어 구조를 이용하여 정의할 수 있으며. 워크플로우 진행을 모니터링할 수 있는 기능을 제공한다. 제안한 시스템의 가용성을 보이기 위해 박테리아 Sphingomonas Chungbukensis DJ77 의 유전자 주해(gene annotation) 작업에 제안한 시스템을 적용하여 구현하고 있다.

• Journal of the Korea Society for Simulation
• /
• v.19 no.4
• /
• pp.43-50
• /
• 2010

Recently, the Internet telephony has been used rather than the traditional telephony by many Internet users, with low cost. Session Initiation Protocol(SIP) is the standard of application layer protocol for establishment and disconnection of the session for Internet telephony. SIP mainly runs over the UDP for transport. So in case of the loss of the INVITE request message, the message is retransmitted by an appropriate timer for reliable transmission of the UDP message. Though the retransmission is useful for ensuring the reliability of SIP messages sent by the users, it may cause the overload traffic in the SIP proxy server. The overload in SIP proxy servers results in the loss of many input messages. This paper presents a non-linear overload control algorithm to resolve the overload condition of the server. we simulate our proposed algorithm using the network simulator ns-2. The simulation results show that the throughput of the server with the proposed algorithm have been improved about 12% compared to the existing linear control algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4B
• /
• pp.153-161
• /
• 2005

In a multi-channel network based of wavelength division multiplexing (WDM) technology, an efficient protocol is needed in order for the transmitter and receiver to be tuned to the same wavelength during message transmission time. This paper proposes a priority-based reservation protocol that can efficiently support variable-length messages that require different QoS requirements. In this proposed protocol, high-priority nodes can reserve the data channel before low-priority nodes. However, once a node reserves a data channel successfully, it can persistently use the reserved channel till message transmission is finished regardless of the priority of the node. Moreover, the protocol can operate independently of the number of nodes, and any new node can join the network anytime without requiring network re-initialization. The protocol is analyzed with a finite population model and the throughput-delay characteristics are investigated as performance measures.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.12 no.6
• /
• pp.547-553
• /
• 2019

Presence server should process massive SIP subscription request messages and massive presence event notifications from presence resources in real time. Therefore multiple servers architecture is needed for presence service system. In this paper, an architecture of multiple servers presence service system using SIP based CCMP control messages for lowering presence server load level has been presented. In this system, each presence server exchanges current load status using CCMP control messages, and total system load according to variance of users number and amount of presence resources has been effectively distributed processed. The CCMP control messages has been optimally designed to control presence servers, and exchange procedures of these control messages between presence servers has been also presented and the performance of the proposed multiple servers presence service system has been analysed by experiments. The result shows that average presence subscription processing time reduced from 40.8% to 69.2% and average presence notification processing time reduced from 29.4% to 62.7%.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.05a
• /
• pp.119-124
• /
• 2001

A new WDM-based protocol for scheduling a variable-length message is proposed in this paper. Two control slots, Pre-reservation slot and Reservation Slot, are used to coordinate transmission and diminish the collisions of packet to minimize the access delay. When there is an idle reservation slot, a control packet is transmitted on that slot and message is transferred. And the node continues to transmit its control packet through the corresponding slot every cycle, until the message is completely transmitted. If an idle reservation slot is not available, the node schedules the transmission time of message in earliest available time using Pre-reservation slots. The proposed scheduling protocol has several advantages; any new node can join the network anytime without network re-initialization. Moreover, with the pre-reservation slots, we can avoid the packet collisions and destination conflicts, and we can improve the access delay time for message transmissions.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.7
• /
• pp.2595-2602
• /
• 2010

This paper introduces a mobile spam filtering system that considers the style of short text messages sent to mobile phones for detecting spam. The proposed system not only relies on the occurrence of content words as previously suggested but additionally leverages the style information to reduce critical cases in which legitimate messages containing spam words are mis-classified as spam. Moreover, the accuracy of spam classification is improved by normalizing the messages through the correction of word spacing and spelling errors. Experiment results using real world Korean text messages show that the proposed system is effective for Korean mobile spam filtering.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10d
• /
• pp.180-183
• /
• 2007

본 논문은 데이터 서비스를 제공하는 CDMA2000 1X 시스템에서 보충 채널(Supplemental Channel)을 관리하는 효율적인 방법을 제안한다. 시스템 표준에 따르면 이동 단말(MS)은 기지국(BS)으로부터 보충채널 할당 메시지를 수신하여 그 내용에 따라 보충 채널을 할당/해제하도록 되어있다. 그러나 이동 단말이 기지국이 보낸 보충 채널 할당 메시지를 수신하지 못한 경우 보충 채널 데이터에 대한 비효율적인 재전송이 발생하게 된다. 본 논문에서 제안하는 유지 기간 연장 방법을 사용하면 조건에 맞을 경우 보충채널 할당 메시지를 수신하지 못한 이동 단말도 보충 채널을 통해 데이터를 계속 수신할 수 있다.

• Journal of Internet Computing and Services
• /
• v.7 no.5
• /
• pp.1-12
• /
• 2006

In mobile database environments, the efficient synchronization technique is required to maintain the consistency of replicated data because the same data can be replicated between so many different databases, In this paper, we propose a message digest based synchronization technique to maintain the consistency of replicated data between client databases and a server database in mobile environments. The proposed data synchronization technique has the advantage of generality aspect and extensibility aspect by using the tuple-based message digest output to detect the data conflicts.

• Proceedings of the Korea Association of Information Systems Conference
• /
• 1998.10a
• /
• pp.145-149
• /
• 1998

본 논문에서는 동일한 목적지 노드들의 집합을 가지는 다중 멀티캐스트(multiple multicast)가 동시에 일어날 경우 노드간의 경쟁을 최소화하고 메시지 전송 경로를 단축시 키기 위한 알고리즘을 제시하고, 2차원 네트워크인 토러스 구조에서 제시된 본 논문의 알고 리즘을 기존 알고리즘과 비교한다. 기존 논문에서는 멀티캐스트 메시지 패싱 시스템 (multicast message-passing system)에서 여러 개의 소스노드로부터 목적지 노드가 중첩 되는 다중 멀티캐스트를 구현하기 위한 방법으로 2차원 메쉬 구조의 특징을 이용한 SCHL(Source-Centered Hierarchical Leader) 기법[7,8]이 제안되었다. 본 논문에서는 이 를 토러스 구조에 적합하게 변형하여, 기존의 메쉬 구조에 적용된 SCHL 기법[7]과 성능을 분석함으로써 제안된 알고리즘이 메쉬 구조보다 토로스 구조에서 구현될 때, 더 향상된 성 능을 가진다는 것을 보인다. 본 논문에서의 메시지 전송기법은 결정적 웜홀 라우팅 방식을 이용한다.