The Experts below are selected from a list of 327 Experts worldwide ranked by ideXlab platform
Ilyoung Moon - One of the best experts on this subject based on the ideXlab platform.
-
Performance Analysis of WAP Packet Considering Multi-Slot SAR-QT Algorithm in Bluetooth Ad hoc Network
2020Co-Authors: Ilyoung MoonAbstract:In this paper, it is analyzed that WAP Packet Transmission Time to improve performance of WAP using SAR-QT algorithm in Bluetooth channel. The order for SAR-QT algorithm to improve the transfer capability, it is fragmented in WTP total messages that are coming down from upper layer and then the Packets are sent one at Time in baseband. And it is studied that Transmission Time for WAP over Bluetooth according to DMI, DM3 or DM5 Packet type using SAR-QT algorithm in Bluetooth piconet environment. This SAR-QT algorithm decreases WAP Packet Transmission Time of L2CAP baseband Packets by sending Packet that are spanning multiple slots. From the results, in WAP over Bluetooth channels, it is found out that WTP Packet size ought to be increased to decrease Transmission Time of WAP Packet. In addition, considering BER in wireless channel, optimal WTP Packet size is achieved for WAP over Bluetooth in a Rician fading environment.
-
New Directions in Intelligent Interactive MulTimedia - Performance Analysis of ACL Packets Using Turbo Code in Bluetooth Wireless System
Studies in Computational Intelligence, 2020Co-Authors: Ilyoung MoonAbstract:In this paper, it is analyzed a performance analysis 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. And it is studied that Transmission Time for bluetooth wireless link according to DM1, DM3 or DM5 Packet type in bluetooth system. This turbo code scheme decreases Transmission Time of L2CAP baseband Packets by sending Packets. From the results, it was able to obtain Packet Transmission Time, optimal TCP Packet size, ACL (DM Packet) in AWGN and Rician channel.
-
performance analysis of wap Packet Transmission Time and optimal Packet size in wireless network
International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, 2006Co-Authors: Ilyoung MoonAbstract:With the increase of data communication service by mobile devices, WAP is a protocol proposed to efficiently access the internet contents by user request through wireless condition that has a high error rate and mobility. In this paper, it has analyzed Transmission Time for wireless application protocol (WAP) in wireless CDMA network. In order for segmentation and reassembly (SAR) 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 wireless transaction protocol (WTP) to define the resultant Packet size and the level of fragmentation for each proceeding layer. SAR decreases Transmission Time of radio link protocol (RLP) baseband Packets by sending Packets. From the results, it was able to obtain Packet Transmission Time and optimal WTP Packet size in wireless network.
-
KES (1) - Performance analysis of WAP Packet Transmission Time and optimal Packet size in wireless network
Lecture Notes in Computer Science, 2006Co-Authors: Ilyoung MoonAbstract:With the increase of data communication service by mobile devices, WAP is a protocol proposed to efficiently access the internet contents by user request through wireless condition that has a high error rate and mobility. In this paper, it has analyzed Transmission Time for wireless application protocol (WAP) in wireless CDMA network. In order for segmentation and reassembly (SAR) 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 wireless transaction protocol (WTP) to define the resultant Packet size and the level of fragmentation for each proceeding layer. SAR decreases Transmission Time of radio link protocol (RLP) baseband Packets by sending Packets. From the results, it was able to obtain Packet Transmission Time and optimal WTP Packet size in wireless network.
-
Performance analysis of WAP Packet considering RLP Layer in CDMA wireless system
2004 IEEE Region 10 Conference TENCON 2004., 2004Co-Authors: Ilyoung MoonAbstract:In this paper, we have analyzed Transmission Time for wireless application protocol (WAP) over code division multiple access (CDMA). In order for segmentation and reassembly (SAR) 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 wireless transaction protocol (WTP) to define the resultant Packet size and the level of fragmentation for each proceeding layer. SAR decreases Transmission Time of radio link protocol (RLP) baseband Packets by sending Packets. From the results, we were able to obtain Packet Transmission Time and optimal WTP Packet size for WAP over CDMA in a Rician fading channel.
Ahmed E. Kamal - One of the best experts on this subject based on the ideXlab platform.
-
MASCOTS - A discrete-Time model of TCP Reno with background traffic interference
Proceedings. 10th IEEE International Symposium on Modeling Analysis and Simulation of Computer and Telecommunications Systems, 2002Co-Authors: Ahmed E. KamalAbstract:This paper introduces a discrete-Time model which captures the essential protocol features of the congestion control mechanism used by the TCP Reno protocol, subject to interference from other sources. Under this model, a single target session is modeled according to the TCP Reno mechanism, including fast retransmit and fast recovery. At the same Time, other sources are modeled as a background process using a modified discrete batch Markov arrival process. In order to capture all the TCP Reno protocol features, two levels of Markov process modeling are used: a microscopic level, at the Packet Transmission Time boundaries, and a macroscopic one, at the start of the new Transmission windows. Several performance measures are derived, and numerical examples which demonstrate the protocol features are presented.
-
High-speed local area networks and their performance: a survey
ACM Computing Surveys, 1991Co-Authors: Bandula W. Abeysundara, Ahmed E. KamalAbstract:At high data Transmission rates, the Packet Transmission Time of a local area network (LAN) could become comparable to or less than the medium propagation delay. The performance of many LAN schemes degrades rapidly when the Packet Transmission Time becomes small comparative to the medium propagation delay. This paper introduces LANs and discusses the performance degradation of LANs at high speeds. It surveys recently proposed LAN schemes designed to operate at high data rates, including their performance characteristics desirable in LAN medium access protocols are identified and discussed. The paper serves as a tutorial for readers less familiar with local computer communication networks. It also serves as a survey of the state-of-the-art LANs.
-
Protocols and performance models for high speed, dual-bus, fiber-optic local area networks
1991Co-Authors: Bandula W. Abeysundara, Ahmed E. KamalAbstract:At high data Transmission rates, the Packet Transmission Time in a local area network (LAN) could become comparable to, or less than the medium propagation delay. Therefore, in high speed LANs, the ratio of the channel propagation delay to the Packet Transmission Time, or the normalized propagation delay, a, could approach or even exceed 1. The performance of existing LAN schemes, for example, LANs employing the CSMA/CD protocol, degrades rapidly as a approaches 1. In a high speed environment therefore, LAN medium access protocols should be capable of yielding satisfactory performance over a wider range of a values. In this thesis, we propose two new LAN medium access protocols, named Z-Net and X-Net, as suitable candidates for operation at high speeds. The network architecture is based on two, unidirectional fiber-optic channels. A distinct feature of the architecture is the use of active taps to minimize the waste of channel bandwidth due to collisions. When collisions occur, one Transmission continues to completion, while others are aborted. The proposed medium access protocols behave as random-access schemes at light load. As load increases, the behaviour is similar to that of a controlled-access scheme with implicit token-passing. Because of this hybrid nature of the access protocols, they possess the advantages of zero medium access delay at light load and bounded delay at all loads. The protocols are completely distributed, with all stations executing the same access protocol. Thus, the vulnerability of the network to a single station failure is minimized. Further, for the execution of the protocols, stations do not require a knowledge of other station locations in the network. This reduces maintenance effort, when there are frequent changes in station locations. The performance of the Z-Net and X-Net are evaluated using approximate analytic models. These results are then validated against the results obtained from simulation models. The channel utilization values of the analytic and simulation models are in very close agreement. Performance results show that both protocols achieve high channel utilization (with X-Net exhibiting superior performance) even when the Packet Transmission Time is low compared to the channel propagation delay. Therefore, the proposed schemes are suitable for operating at high channel data rates. The bounded delay property makes them suitable for supporting real-Time traffic.
B. Ramamurthy - One of the best experts on this subject based on the ideXlab platform.
-
HiPC - Multiple token distributed loop local area networks: analysis
Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238), 1998Co-Authors: N. Chalamaiah, B. RamamurthyAbstract:With increased data rates, the Packet Transmission Time of a LAN could approach or even become less than the medium propagation delay. The performance of many LAN schemes degrades rapidly under these conditions. Generally, the overhead associated with the medium access protocol increases with the increase in propagation Time relative to Packet Transmission Time. In token ring networks this overhead depends on the round trip propagation delay of the channel. Several schemes, such as multiple rings (with multiple channels) and multiple access points (with multiple tokens) are proposed to decrease this overhead. In these schemes analytical and simulation results have shown improved performance. In the present paper we propose a distributed multiconnected loop topology with multiple tokens. We also present analytical results showing the Packet delay performance. Finally we compare the performance of distributed multiconnected loops with multiple ring topology in terms of media access control, token coalescence and delay.
-
Multiple token distributed loop local area networks: analysis
Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238), 1998Co-Authors: N. Chalamaiah, B. RamamurthyAbstract:With increased data rates, the Packet Transmission Time of a LAN could approach or even become less than the medium propagation delay. The performance of many LAN schemes degrades rapidly under these conditions. Generally, the overhead associated with the medium access protocol increases with the increase in propagation Time relative to Packet Transmission Time. In token ring networks this overhead depends on the round trip propagation delay of the channel. Several schemes, such as multiple rings (with multiple channels) and multiple access points (with multiple tokens) are proposed to decrease this overhead. In these schemes analytical and simulation results have shown improved performance. In the present paper we propose a distributed multiconnected loop topology with multiple tokens. We also present analytical results showing the Packet delay performance. Finally we compare the performance of distributed multiconnected loops with multiple ring topology in terms of media access control, token coalescence and delay.
Pierre A. Humblet - One of the best experts on this subject based on the ideXlab platform.
-
Space-Time characteristics of ALOHA protocols in high-speed bidirectional bus networks
IEEE ACM Transactions on Networking, 1995Co-Authors: Pierre A. HumbletAbstract:Studies the space-Time characteristics of ALOHA multiple-access protocols in bidirectional bus networks where Transmissions are in the form of Packets of constant length. For point-to-point communications, the maximum throughput of unslotted ALOHA is known to be 1/(2e), independent of station configuration. The authors show that, with a uniform probabilistic station configuration, the maximum throughput of slotted ALOHA tends to a nonzero constant that is less than 1/(2e), when a, the end-to-end propagation delay normalized with respect to the Packet Transmission Time, tends to infinity. However, when N stations are evenly spaced on the bus, the maximum throughput of slotted ALOHA vanishes as a tends to infinity. For broadcast communications, the maximum throughput of slotted ALOHA is well known to be 1. >
-
Unslotted ALOHA in high speed bidirectional bus networks
[Conference Record] SUPERCOMM ICC '92 Discovering a New World of Communications, 1992Co-Authors: Pierre A. HumbletAbstract:The authors study the performance of the unslotted ALOHA multiple access protocol in a high speed bidirectional bus network. For point-to-point communications, its maximum throughput is known to be independent of the ratio of end-to-end propagation delay to Packet Transmission Time. For broadcast communications, it is shown that, if the offered load density is uniform along the bus, the maximum throughput achievable by a station depends on its location along the bus. To achieve a uniform throughput density, the offered load density has to vary along the bus. The optimal profile for the offered load density is derived. In any case, the maximum throughput degrades with the ratio of end-to-end propagation delay to Packet Transmission Time. >
-
INFOCOM - Slotted ALOHA in high speed bidirectional bus networks
IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceeding, 1991Co-Authors: Pierre A. HumbletAbstract:The performance of the slotted ALOHA multiple access protocol in a high-speed bidirectional passive bus network, where Transmissions are in the form of Packets of constant length, is studied. Slotted ALOHA is generally considered to have better throughput performance than unslotted ALOHA, whose maximum throughput is known to be 1/(2e), independent of station configuration. It is shown that, with a probabilistic station configuration, the throughput of slotted ALOHA can degrade to 1/(3e) when the end-to-end propagation delay is significantly larger than the Packet Transmission Time. Nevertheless, in some very high speed bidirectional bus networks with a deterministic station configuration, the throughput of slotted ALOHA can be as high as 1/2. >
Biswanath Mukherjee - One of the best experts on this subject based on the ideXlab platform.
-
Multiple-partition token ring network
Computer Communications, 1991Co-Authors: W.w. Ho, Biswanath MukherjeeAbstract:Abstract A token ring local area network capable of operating in multiple parallel segments which are interconnected via a central switch (called a bridge) is the focus of this study. It is shown that while it is beneficial to operate the network as a single token ring at light loads, the single ring mode also has a limited channel capacity, and that it is preferable to operate the ring in multiple positions for heavier loads. Specifically, it is shown that, if the switch processing delay is insignificant compared to the mean Packet Transmission Time, then it is preferable to operate the network either as a single large ring or as a star network. The effect of various parameters on the system performance are explored by considering the two-partition case. An approximate analytical model is employed for this study, and results are verified via simulation.
-
INFOCOM - A multiple-partition token ring network
Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration, 1990Co-Authors: W.w. Ho, Biswanath MukherjeeAbstract:A token-ring local area network capable of operating in multiple parallel segments which are interconnected via a central switch (called a bridge) is the focus of this study. It is shown that while it is beneficial to operate the network as a single token ring at light loads, the single-ring mode also has a limited channel capacity, and that it is preferable to operate the ring in multiple partitions for heavier loads. In particular, it is found that if the switch processing delay is insignificant compared to the mean Packet Transmission Time, it is preferable to operate the network either as a single large ring or as a star network. An approximate analytical model is used. The results are verified via simulation. >
