• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.1061-1064
• /
• 1999

UDP has likely been used for real-time applications, such as video and audio. UDP supplies minimized transmission delay by omitting the connection setup process, flow control, and retransmission In general, more than 80 percent of the WAN resources are occupied by Transmission Control Protocol(TCP) traffic as opposed to UDP's simplicity, TCP adopts a unique flow control in this paper, I report new methods to minimize a udp packet loss considering TCP flow control on the real-time application the better performance of real time application can be obtained when they reduce a packet size and FIFO buffer scheduling method competing with TCP bandwidth for the bandwidth and buffering.

• 한국정보통신설비학회:학술대회논문집
• /
• 2006.08a
• /
• pp.43-46
• /
• 2006

IEEE 802.16 WirelessMAN aiming to broadband wireless access (BWA) is evolving to 4G mobile communication system through the standardization of IEEE 802.16e supporting mobility on existing fixed WirelessMAN system. It is necessary for hand-over to provide seamless data service while MS (Mobile Station) moves to another BS (Base Station). Because the performance of handover affects packet loss or delay of any communications, it must consider low latency handover mechanism in packet based network. In this paper, we describes handover scheme of IEEE 802.16e with the cell edge interference problem and shows the way to solve the problem in frequency reuse one deployment. Our scheme reduces the handover latency and packet loss probability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.2
• /
• pp.82-102
• /
• 2008

Packet losses tend to occur during short error bursts separated by long periods of relatively error-free transmission. There is also a significant spatial correlation in loss among the receiver nodes in a multicast session. To recover packet transmission errors at the transport layer, tree-based protocols construct a logical tree for error recovery before data transmission is started. The current tree construction scheme does not scale well because it overloads the sender node. We propose a scalable recovery tree construction scheme considering these properties. Unlike the existing tree construction schemes, our scheme distributes some tasks normally handled by the sender node to specific nodes acting as repair node distributors. It also allows receiver nodes to adaptively re-select their repair node when they experience unacceptable error recovery delay. Simulation results show that our scheme constructs the logical tree with reduced message and time overhead. Our analysis also indicates that it provides fast error recovery, since it can reduce the number of additional retransmissions from its upstream repair nodes or sender node.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.2 no.3
• /
• pp.9-16
• /
• 2003

In this paper, we propose the burst error reduction (BER) algorithm for VoIP service in the wireless LAN network. In end point device, this BER algorithm can be achieved packet loss bounded QoS provisioning using interleaving in buffering and FEC (Forward Error Correction) through transmitting voice packet. BER algorithm can reduced the voice packet loss rate 5.5%-60% in VoIP network using wireless LAN.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.1B
• /
• pp.64-70
• /
• 2003

In order to provide seamless wireless Internet service, the basic mobile IP protocol should be enhanced to solve packet loss problem from large registration latency because frequent handoffs occur in cellular networks. In this paper, we suggest a new micro-mobility management protocol based on MPLS while supporting Qos, and evaluate its performance using simulation. We use MPLS label switching techniuqe in cellular access networks to simplify location management and speed up packet transmission. We adopt context transfer procedure to minimize the delay needed to attain prior level of service after handoff Packet loss can be minimized during handoff by transmitting received packets from old BSLER to new BSLER using a spliced LSP between them. Simulation results show that the proposed MPLS-based micro-mobility management protocol provides a seamless handoff and supports QoS of user traffic.

• Proceedings of the IEEK Conference
• /
• 2002.06a
• /
• pp.275-278
• /
• 2002

This paper proposes an efficient micro mobility scheme to support user mobility inside an access network which employs Ipv6. The proposed scheme, namely SMM(Sparse-mode Multicast for mobility), utilizes a class of multicast protocol, PIM-SM, in the visited access network to reduce signaling to the home agent as well as to the correspondent node and to minimize packet loss during the handoff when mobile user changes its point of attachment frequently. Through the simulation, the performance of the proposed SMM is analyzed and compared with those of Mobile nv6 and for the case which adpots PIM-DM. The result shows that SMM provides significantly better performance in terms of packet loss that is invariant to transmission rate and packet size.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.6
• /
• pp.163-172
• /
• 2003

Proposed in this paper is an authentication mechanism for multimedia streaming data in the Intemet multicast environment. The multicast authentication mechanism is coupled with the packet-level forward error correction code which has been recently applied for a reliable multicast transport transmission. Associated with this, Reed-Solomon erasure code is chosen for tolerating packet loss so that each of the received packets can be authenticated independently of the lost packets.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4A
• /
• pp.259-270
• /
• 2005

This paper proposes a mathematical model to analyze call-and packet-level performance of the TD-CDMA/TDD system which could serve a flexible radio resource management against multi-type heterogeneous and asymmetrical traffic conditions. On call-level analysis, the mathematical model based on queueing theory performs multi-dimensional operations using random vectors or matrices to consider multiple types of traffic and also deal with asymmetrical up- and down-direction transmissions separately. Employing the mathematical model, we obtain rail blocking probability for each type of traffic and also the optimum switching-point with the smallest call flocking probability. And on packet-level analysis, employing a non-prioritized queueing scheme between circuit and packet calls, we solve 2-dimensional random vector problem composed of the queue length for packets and the number of circuit calls being served. Finally, packet-level performance is analyzed in terms of the packet loss probability and the buffer size required under mixed-traffic conditions of multiple types of circuit and packet calls.

• Proceedings of the Optical Society of Korea Conference
• /
• 2007.07a
• /
• pp.305-306
• /
• 2007

• Proceedings of the Optical Society of Korea Conference
• /
• 2007.02a
• /
• pp.227-228
• /
• 2007