• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1B
• /
• pp.17-24
• /
• 2008

The effect of the variable packet size on the LRD characteristic of the MMPP traffic model is investigated. When we generate packet traffic for the performance evaluation of IP packet network, MMPP model can be used to generate packet interarrival time. And a random length of packet size from a certain distribution can be assigned to each packet. However, there is a possibility that the variable packet size might change the LRD characteristic of the original MMPP model. In this study, we investigate this possibility. For this purpose the 'refined traffic' is defined, where packet arrival time is generated according to the MMPP model and a random packet length from a specific distribution is assigned to each generated packet. Hurst parameter of the refined traffic is estimated and compared with the original Hurst parameter, which is the input parameter of the MMPP model. We also investigate the effect of the packet size distribution on the queueing performance of the MMPP traffic model and the relationship between the Hurst parameter and queueing performance.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.57-60
• /
• 2001

This paper has studied the WAP packet transmission time, using WTP SAR algorithm. One method that is improved transfer ability, SAR fragmented WTP total message down from upper layer and then packet is transmitted to RLP frame time slot. In this paper, we analysis the transmission time of WAP packet with variable HLP layer size on the CDMA wireless channel for next generation systems as well as PCS, DCS. From the results, we can obtain the WAP packet transmission time and optimal WTP packet size.

• ETRI Journal
• /
• v.33 no.3
• /
• pp.299-309
• /
• 2011

Energy consumption is a key issue in body sensor networks (BSNs) since energy-constrained sensors monitor the vital signs of human beings in healthcare applications. In this paper, packet size optimization for BSNs has been analyzed to improve the efficiency of energy consumption. Existing studies on packet size optimization in wireless sensor networks cannot be applied to BSNs because the different operational characteristics of nodes and the channel effects of in-body and on-body propagation cannot be captured. In this paper, automatic repeat request (ARQ), forward error correction (FEC) block codes, and FEC convolutional codes have been analyzed regarding their energy efficiency. The hop-length extension technique has been applied to improve this metric with FEC block codes. The theoretical analysis and the numerical evaluations reveal that exploiting FEC schemes improves the energy efficiency, increases the optimal payload packet size, and extends the hop length for all scenarios for in-body and on-body propagation.

• Journal of Industrial Technology
• /
• v.21 no.A
• /
• pp.59-64
• /
• 2001

This paper analyzes the performance of the several types of ACL(Asynchronous ConnectionLess) packets used in Bluetooth according to a BER(Bit Error Rate) and a packet length and proposes an optimal packet type and an optimal size of the packet being able to be used under the given BER. This paper proposes how to obtain the optimal packet type and the optimal size of the packet maximizing the performance measure under the given BER. In addition, this paper shows that the optimal type and size of the packet maximizing the throughput are different from those maximizing the mean transmission time. This occurs because the Bluetooth uses not only one type of packet but also various types of packets.

• Journal of information and communication convergence engineering
• /
• v.4 no.2
• /
• pp.71-74
• /
• 2006

A basic access method about IEEE 802.11 MAC layer protocol using IEEE 802.11 wireless LANs is the DCF thatis based on the CSMA/CA. But, cause of IEEE 802.11 MAC layer uses original backoff algorithm (exponential backoff method), when collision occurred, the size of contention windows increases the double size Also, a time of packet transmission delay increases and efficienty is decreased by original backoff scheme. In this paper, we have analyzed TCP packet transmission time of IEEE 802.11 MAC DCF protocol for wireless LANs a proposed enhanced backoff algorithm. It is considered the transmission time of transmission control protocol (TCP) packet on the orthogonal frequency division multiplexing (OFDM) in additive white gaussian noise (A WGN) and Rician fading channel. From the results, a proposed enhanced backoff algorithm produces a better performance improvement than an original backoff in wireless LAN environment. Also, in OFDM/quadrature phase shift keying channel (QPSK), we can achieve that the transmission time in wireless channel decreases as the TCP packet size increases and based on the data collected, we can infer the correlation between packet size and the transmission time, allowing for an inference of the optimal packet size in the TCP layer.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.530-533
• /
• 2006

Recently, a basic access method about IEEE 802.11 MAC layer protocol using IEEE 802.11 wireless LANs is the DCF thatis based on the CSMA/CA. But, cause of IEEE 802.11 MAC layer uses original backoff algorithm (exponential backoff method), when collision occurred, the size of contention windows increases the double size. Also, a time of packet transmission delay increases and efficiency is decreased by original backoff scheme. In this paper, we have analyzed TCP packet transmission time of IEEE 802.11 MAC DCF protocol for wireless LANs a proposed enhanced backoff algorithm. It is considered the transmission time of transmission control protocol (TCP) packet on the orthogonal frequency division multiplexing (OFDM) in additive white gaussian noise (AWGN) and Rician fading channel. From the results, a proposed enhanced backoff algorithm produces a better performance improvement than an original backoff in wireless LAN environment. Also, in OFDM/quadrature phase shift keying channel (QPSK), we can achieve that the transmission time in wireless channel decreases as the TCP packet size increases and based on the data collected, we can infer the correlation between packet size and the transmission time, allowing for an inference of the optimal packet size in the TCP layer.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.9
• /
• pp.373-383
• /
• 2003

In this paper we discuss the effect of the delay limit and the packet size related to the quality of service on a VoIP system using the Internet. We also provide a guideline to determining the optimal packet size of the voice data for a given delay limit. Empirical studies are done with two personal computers connected through the packet switched public IP network. The sender encodes the voice signal from the microphone to get PCM and ADPCM data and sends the data to the receiver using UDP packets. The receiver plays the reconstructed voice from the stream with lost and delayed packets. The quality of the reconstructed voice is evaluated offline by the MNB (Measuring Normal Block) method using the data acquired from the both sides. The result shows that under the delay limit of 100ms for 40Kbps, 32Kbps and l6Kbps of ADPCM data, the minimum packet size should be 300bytes, 400bytes and 600bytes respectively and the maximum packet size should be l200bytes commonly for the best quality of voice.

• Management Science and Financial Engineering
• /
• v.4 no.2
• /
• pp.43-58
• /
• 1998

Packet switch is a key component in high speed digital networks. This paper investigates congestion phenomena in the packet switching with input buffers. For large value of switch size N, mathematical models have been developed to analyze asymptotic maximum switch throughput under nonuniform traffic. Simulation study has also been done for small values of finite N. The rapid convergence of the switch performance with finite switch size to asymptotic solutions implies that asymptotic analytical solutions approximate very closely to maximum throughputs for reasonably large but finite N. Numerical examples show that non-uniformity in traffic pattern could result in serious degradation in packet switch performance, while the maximum switch throughput is 0.586 when the traffic load is uniform over the output trunks. Window scheduling policy seems to work only when the traffic is relatively uniformly distributed. As traffic non-uniformity increases, the effect of window size on throughput is getting mediocre.

• Journal of Communications and Networks
• /
• v.4 no.2
• /
• pp.108-117
• /
• 2002

TCP, which was developed on the basis of wired links, supposes that packet losses are caused by network congestion. In a wireless network, however, packet losses due to data corruption occur frequently. Since TCP does not distinguish loss types, it applies its congestion control mechanism to non-congestion losses as well as congestion losses. As a result, the throughput of TCP is degraded. To solve this problem of TCP over wireless links, previous researches, such as split-connection and end-to-end schemes, tried to distinguish the loss types and applied the congestion control to only congestion losses; yet they do nothing for non-congestion losses. We propose a novel transport protocol for wireless networks. The protocol called VS-TCP (Variable Segment size Transmission Control Protocol) has a reaction mechanism for a non-congestion loss. VS-TCP varies a segment size according to a non-congestion loss rate, and therefore enhances the performance. If packet losses due to data corruption occur frequently, VS-TCP decreases a segment size in order to reduce both the retransmission overhead and packet corruption probability. If packets are rarely lost, it increases the size so as to lower the header overhead. Via simulations, we compared VS-TCP and other schemes. Our results show that the segment-size variation mechanism of VS-TCP achieves a substantial performance enhancement.

• Proceedings of the IEEK Conference
• /
• 2004.06a
• /
• pp.317-320
• /
• 2004

In this paper, it is analyzed a performance improvement of ACL Packet using turbo code scheme in bluetooth system. In order for segment to improve the transfer capability, the transmission of messages have been simulated using a fragmentation that begins with the total package and incremental fragmentation for each layer using the TCP to define the resultant packet size and the level of fragmentation for each proceeding layer. This turbo code scheme decreases transmission time of L2CAP baseband packets by sending packets. From the results, we were able to obtain packet transmission time, optimal TCP packet size, ACL(DM packet) in AWGN.