• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.3
• /
• pp.652-663
• /
• 1996

In this paper, we analyze the blocking probability of a call in a PC communication network. In a PC communication network, a call generated from the PSTN (public switched telephone network) requests the connection to the ICPS(information communication processing system) which interconnects the the PSTN and the PSDN(packet switched data network). Then, as a second step, a packet call is requested to the specific service database attached in the PSDN. The call blocking probabilies are analyzed for these two interface points, the PSTN interface ports of the ICPS and the PSDN interface link of the database. We also present some numerical results to show the effects of the system parameters on the performance of the network. The results show the effects of the capacity of each interface point on the performance point.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4C
• /
• pp.353-364
• /
• 2002

To prevent the performance degradation of TCP due to packet loss in the smooth handoff by the route optimization extension of Mobile If protocol, a buffering of packets at a base station is needed. A buffering of packets at a base station recovers the packets dropped during the handoff by forwarding the buffered packets at the old base station to the mobile user. But, when the mobile user moves to a new foreign network which is connected to a congested router, the buffered packets forwarded by the old base station are dropped and the link utilization performance degraded due to increased congestion by the forwarded packets. In this paper, when the mobile user moves to a new foreign network which is connected to a congested router, Ive propose a packet forwarding control scheme required far the old base station to improve TCP performance in mobile networks. The old base station forwards or discards the buffered packets during handoff by proposed packet forwarding control scheme based on congestion states of RED(Random Early Detection) at the congested router. Simulation results slow that link utilization performance can be improved by applying proposed packet forwarding control scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.7
• /
• pp.1777-1784
• /
• 1998

The packet error rates of an optical packet switching node with an optical address processor using an EDFA in order to detect M-ary correlation pulses at a fiber-optical delay line matched filter output have been evaluated. Effects of A PIN diode NEP, the gain and noise figure of the EDFA, and the bandwidth of an optical filter on the packet error rate of the switching node have been compared. There is negligible error rate change depending upon the variation of the PIN diode NEP and the EDFA gain. If the bandwidth of the optical filter is below 10 times of the data rate, there is no appreciable effect on the error rate. If the noise figure of the EDFA increases, however, the power penalty increases as much as the noise figure increment at all the bit rates and for address code sets considered in this work.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4B
• /
• pp.288-297
• /
• 2003

The fast retransmit and fast recovery algorithm of TCP Reno, when multiple packets in the same window are lost, cannot recover them without RTO (Retransmission Timeout). TCP New-Reno can recover multiple lost packets by extending fast recovery using partial acknowledgement. If the retransmitted packet is lost again during fast recovery, however, RTO cannot be avoided. In this paper, we propose an algorithm called "Duplicate Acknowledgement Counting(DAC)" to alleviate this problem. DAC can detect the retransmitted packet loss by counting duplicate ACKs. Conditions that a lost packet can be recovered by loss recovery of TCP Reno, TCP New-Reno and TCP New-Reno using DAC are derived by modeling loss recovery behavior of each TCP. We calculate the loss recovery probability for random packet loss probability numerically, and show that DAC can improve loss recovery behavior of TCP New-Reno.

• 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 Korean Institute of Communications and Information Sciences
• /
• v.27 no.4B
• /
• pp.281-290
• /
• 2002

In this paper, we propose an efficient packet forwarding method for an IP-based wireless Internet access network. Packets are forwarded along with a flow, that is a kind of connection-oriented connection and established before delivering packets. For this purpose, we also propose a flow resolution method and a modified IPv6 header for delivering packet in the wireless Internet access network. In addition, the method to support the mobility of mobile stations is explained, and the implementation issues are discussed. In order to estimate the performance of the proposed method, we analyzed the delay time to deliver packets in the wireless Internet access network. The numerical results show that the proposed method is very efficient, in the view point of delay.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.1
• /
• pp.71-76
• /
• 2013

In this paper, end-to-end performances for some VoIP traffics are measured and analyzed over MANET(Mobile Ad-hoc Networks) with packet aggregation transmission under blackhole attacks. A VoIP simulator based on NS-2 is used for performance measure. In the simulation, MOS, call connection ratio, network delay and packet loss rate are measured for end-to-end transmission performance. With analysis of measured data, characteristics of each traffics for performance parameters of packet aggregation transmission is showed on MANET under blackhole attack, As a results of this paper, some considerations be required for packet aggregation transmission are suggested to implement VoIP services on MANET under blackhole attacks.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.110-113
• /
• 2012

DDS middleware transmits data packets through unicast or multicast method for discovering endpoints on a distributed network and exchanging information between endpoints. Depending on the communicating situation between endpoints, the transmission method which is used to exchange packets is already defined by the standard protocol. However, the predefined usage of the transmission method has a problem that the middleware does not deal with increasing usage of the system resources properly when the configuration of endpoint is changed dynamically. To solve this problem, we propose the scheme of selecting the packet transmission method in an adaptive manner.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10B
• /
• pp.1824-1831
• /
• 1999

In this paper, the data recovery performance of systematic erasure codes in burst loss environments is analyzed and the estimation method of redundant data according to loss characteristics is suggested. The burstness of packet loss is modeled by Gilbert model, and the performance of proposed packet loss recovery method in the case of using systematic erasure code is analyzed based on previous study on the loss recovery in the case of using erasure code. The required redundancy data fitting method for systematic erasure code in the condition of given loss property is suggested in the consideration of packet loss characteristics such as average packet loss rate and average loss length.

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

Due to the redundant rebroadcast packets, network-wide broadcasting is a costly operation in wireless mobile ad hoc networks. To reduce this redundancy, most of previous approaches implicitly or explicitly require periodic refreshing of neighborhood information which continuously imposes additional broadcast overheads. In this paper, we propose a practical broadcast pruning scheme based on the local prediction of a remained coverage area. As the proposed scheme uses only information available in the on-going broadcast process, it can minimize the overheads prevalent in previous approaches.