• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8S
• /
• pp.2713-2721
• /
• 2000

이 논문에서는 Web 사이트를 설계할 때 응답시간과 관련해서 고려되어야 할 요수 중[10,15,16], 인터넷 연결 회선의 대역폭 결정에 참조될 수 있는 자료를 제시한다. 이를 위해 다양한 환경에서 Web 세션 도착율에 따른 응답시간과 회선 이용율의 변화를 관찰하고, 이를 통해 특정 대역폭의 회선에 대해 Web 서비스가 한계 응답시간 내에 보장될 수 있는 Web 세션 도착율의 임계치를 구한다. [15,16]. 이 논문에서는 데이터 수집을 위해 실험 네트워크를 구성하고, 자체적으로 구현한 패킷 생성기를 이용하여 세션 도착율의 변화에 따른 Web 트래픽을 시뮬레이션한다. 응답시간은 패킷 생성기가 생성한 각각의 HTTP(Hyper-Text Transfer Protocol)요청 패킷이 전송되는 시점부터 HTTP응답 메시지가 도착하는 시점까지의 경과된 시간으로 구하고, 회선 이용율은 SNMP(Simple Network Management Protocol)를 이용해 자체 구현한 데이터 수집기로 구한다[3]. 이 실험의 결과는, Web 사이트를 설계할 때 네트워크 전문가가 아니더라도 인터넷 연결 회선의 대역폭 결정 문제를 해결하는데 쉽고 유용하게 참조될 수 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10A
• /
• pp.956-963
• /
• 2008

In a multi-hop wireless ad hoc network broadcasting is an elementary operation to support route discovery, address resolution and other application tasks. Broadcasting by flooding may cause serious redundancy, contention, and collision in the network which is referred to as the broadcast storm problem. Many broadcasting schemes have been proposed to give better performance than simple flooding in wireless ad hoc network. How to decide whether re-broadcast or not also poses a dilemma between reachability and efficiency under different host densities. In this paper, we propose enhanced broadcasting schemes, which can reduce re-broadcast packets without loss of reachability. Simulation results show that proposed schemes can offer better reachability as well as efficiency as compared to other previous schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9A
• /
• pp.684-693
• /
• 2003

This paper analyzes transmissiondelays of a message and a packet in a time-varying and packet-based radio link. The paper assumes that thearrivals of messages have a Bernoulli process and the lengths of the messages a exponential distribution. To reflect the feature of the time-varying radio link, we use a two-state Markov model. From the model the mean transmission delay of and the mean queue length of the packet are analyzed in terms of the packet distribution function, the packet transmission service time, and the PER of the radio link. And the mean message transmission delay time and the mean queue length are derived using the performance indices of the packet. Numerical results show that the message arrival rate and the message length have some bounds to keep the transmission of the message steady and to improve the performance indices of the message. It can be known that the PER of the state influences on the performance indices more than the sojourn time of the state.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.10
• /
• pp.1508-1517
• /
• 1993

In this paper, we propose the modeling of a wireless communication system using CSMA protocol, present analytical evalution and simulation as a function of arrival rate and mean END-to-END delay in the distributed packet radio network. Asynchronous 1-persistent CSMA protocol is used in wireless communication system with half duplex. We assume that all terminals are to be in the close range of each other, suitably located in the local area. The traffic presented to a common channel is assumed to be poisson distribution. Analytical model is based on a M/D/1 with breakdown. In conclusion for wireless network model proposed in this paper is suitable for packet arrival rate of 2 packet/sec with mean packet delay time less than 2 times the packet transmission time.

• The Journal of the Korea Contents Association
• /
• v.10 no.9
• /
• pp.45-56
• /
• 2010

This paper reports a new mechanism for congestion controls. The proposed congestion detection algorithm can be provided with delay and unnecessary energy consumption. Conventional congestion control methods decide congestion by queue occupancy or mean packet arrival rate of MAC layer only, however, our method can perform precise detection by considering queue occupancy and mean packet arrival rate. In addition, the congestion avoiding method according to congestion degree and scheduling method using priority for real time packets are proposed. Finally, simulation results show that proposed congestion detection and control methods outperforms conventional scheduling schemes for wireless sensor network.

• Journal of Korea Multimedia Society
• /
• v.16 no.9
• /
• pp.1077-1088
• /
• 2013

As broadcasting is the process that a node sends a packet to all nodes in the network. it is basic process used for discovering of a routes to a node and disseminating of control information message in Mobile Ad hoc NETwork (MANET). In this paper, we propose dynamically adjusted probabilistic mechanism based on distance ratio and node density for broadcasting in MANETs. The distance ratio can be calculated as the ratio of the radio strength length to the distance from sender of a node, and node density can be get from 1-hop nodes of neighbours. A mobile node receiving broadcast packets determines the probability of rebroadcasting considering distance ratio and node density of itself. Rebroadcast probability will be set as low value to a node which is located in nearby area of sender and has high 1-hop node density, So it reduces packets transmission caused by the early die-out of rebroadcast packets. Compared with the simple flooding and fixed probabilistic flooding by simulation, our approach shows better performances results. Proposed algorithm can reduce the rebroadcast packet delivery more than 30% without scanting reachability, where as it shows up to 96% reachability compared with flooding.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.436-438
• /
• 2005

멀티캐스트 환경에서 핸드오프 지연시간은 유니캐스트 환경보다 크다. 이는 멀티캐스트 트리의 재구성에 따른 지연시간으로 이동환경에서는 핸드오프를 수행할 때 마다 발생한다. 따라서 이동단말이 수신하는 패킷의 손실을 감소시키고 적정한 서비스를 제공하기 위해서 멀티캐스트 재구성 시간을 감소시켜야 한다. 본 논문에서는 이동단말을 중심으로 소규모 멀티캐스트를 구성하여 핸드오프 시에 발생하는 지연시간을 감소시키는 기법을 제안한다. 제안한 기법은 단말이 이동할 경우 도착한 서브넷을 중심으로 소규모 멀티캐스트 트리를 구성하도록 하여 단말이 이동할 때 발생하는 멀티캐스트 재구성시간을 감소시켜 패킷손실 없이 멀티캐스트 패킷을 수신할 수 있도록 하였다. 또한 모의실험을 통해 패킷손실율이 낮아지는 것을 확인하였다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.1
• /
• pp.19-26
• /
• 2003

Recently, the number of internet service companies is increasing and so is the number of malicious attackers. Damage such as distrust about credit and instability of the service by these attacks may influence us fatally as it makes companies image failing down. One of the frequent and fatal attacks is DoS(Denial-of-Service). Because the attacker performs IP spoofing for hiding his location in DoS attack it is hard to get an exact location of the attacker from source IP address only. and even if the system recovers from the attack successfully, if attack origin has not been identified, we have to consider the possibility that there may be another attack again in near future by the same attacker. This study suggests to find the attack origin through MAC address marking of the attack origin. It is based on an IP trace algorithm, called Marking Algorithm. It modifies the Martins Algorithm so that we can convey the MAC address of the intervening routers, and as a result it can trace the exact IP address of the original attacker. To improve the detection time, our algorithm also contains a technique to improve the packet arrival rate. By adjusting marking probability according to the distance from the packet origin we were able to decrease the number of needed packets to traceback the IP address.

• The KIPS Transactions:PartC
• /
• v.16C no.3
• /
• pp.383-392
• /
• 2009

Next generation network (NGN) is a packet-based converged network to support session and non-session services in QoS-enabled broadband transport network. QoS based resource control must be defined to support differentiated services for various network users in NGN. This paper defined parallel control schemes for NGN resource control interfaces to minimize session and resource control delays. We simulated the existing and proposed NGN control schemes to measure and analyze control delays and completion ratios. By arrival rate of 120 in two-phase resource control, we checked out that completion ratios of sequential and parallel schemes achieved 100%, and the control delay of parallel scheme was improved by about 21.5% compared to that of sequential scheme.

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

In the heterogeneous system of various wired or wireless network with IP-based backbone, the continuities of agreedon QoS for multimedia services should be guaranteed regardless of network types and terminal mobility through seamless vertical handover. This paper proposes a QoS provisioning mechanism called D-ISHO which guarantees the continuities of agreed-on QoS and seamless for multimedia services by considering both such characteristics as delay, loss rate and jitter per each service and such status as available band-width, call arrival rate and data transmission rate during the vertical handover. Simulation is done for performance analysis with the measure of handover failure rate and packet loss rate.