The field of computer communication networks has grown very rapidly in the past few years. One way to communicate is viamultiple access broadcast channels. A new class of random access schemes referred to as the Mp-persistent CSMA scheme is proposed. It incorporates the nonpersistent CSMA scheme and l-persistent CSMA scheme, both slotted and unslotted versions, as its special cases with p=O and...

We investigate the simple class of greedy scheduling algorithms, that is, algorithms that always forward a packet if they can. Assuming that only one packet can be delivered over a link in a single step, and that the routes traversed by a set of packets are distance optimal (“shortest paths”), we prove that the time required to complete transmission of a packet in the set is bounded by its rout...

This paper invested a bilateral waveform similarity overlap-and-add algorithm for voice packet lost. Since Packet lost will cause the semantic misunderstanding, it has become one of the most essential problems in speech communication. This investment is based on waveform similarity measure using overlap-and-Add algorithm and provides the bilateral information to enhance the speech signal recons...

This paper introduces a collisionless wavelength division multiple access protocol for a passive star-coupled photonic network that possesses significant performance and flexibility advantages over alternative approaches. This protocol is compared in terms of relative performance and network architecture to the dynamic time-wavelength division multiaccess (DT-WDMA) protocol proposed in [1] thro...

In this paper, we study efficient power control schemes for delay sensitive communication over fading channels. Our objective is to find a power control law that optimizes the link layer performance, specifically, minimizes the packet drop probability, subject to a long-term average power constraint. We assume the buffer at the transmitter is finite; hence packet drop happens when the buffer is...

Recently, several router-based congestion control mechanisms have been proposed to support an end-to-end congestion control mechanism of TCP (Transmission Control Protocol). In this paper, we focus on a RED (Random Early Detection) router, which is one of promising router-based congestion control mechanisms. The RED router randomly drops the arriving packet by alignment probability to an averag...

In the single photon double slits experiment, what mechanism makes interference? Whether it is owing to external factor or has a special structure can interfere itself make interference pattern? Because quantum of EM radiation as Einstein proposed, so we start study from an wave beam (an radiation). Under demand symmetry and quantization, found certainly circular polarized covered by side membr...

Introduction of the packet switching technique into digitized voice communication may affCJrd great advantages in efficient use of the channel, compared to both circuit-switched and DSI systems. Detailed characteristics, however, have not been obtained because of difficulty in the exact analysis. Hence, simulation models are developed in this paper for the pack!'t ized voice transmission system...

In communication networks where communication nodes are connected with finite capacity transmission links, the packet inter-arrival times are strongly correlated with the packet length and the link capacity (or the packet service time). Such correlation affects the system performance significantly, but little attention has been paid to this issue. In this paper, we propose a mathematical framew...

To provide reliable communications in wireless environments, two fundamental error control mechanisms, automatic repeat request (ARQ) and forward error correction (FEC) are proposed. However, the ARQ mechanism may suffer frequent retransmissions and the FEC mechanism incurs bandwidth overhead. To reduce the number of retransmissions and support efficient correction, previous studies have propos...