scispace - formally typeset
Search or ask a question

Showing papers on "Packet loss published in 1985"


Journal ArticleDOI
TL;DR: A new hybrid packet switching protocol for voice-data integration that adapts to the changing traffic conditions of both voice and data, thus eliminating the need for central switching or multiplexing is proposed.
Abstract: A new hybrid packet switching protocol for voice-data integration is proposed and analysed The protocol adapts to the changing traffic conditions of both voice and data Network control is distributed over all nodes, thus eliminating the need for central switching or multiplexing Voice users follow a modified version of FARA, whereas CSMA-CD is adopted by data users for their channel access policy The analysis is based on the solution of a 2-state Markovian chain, after which the voice blocking probability, data packets delay and network throughputs are determined

8 citations




Patent
31 Jan 1985
TL;DR: In this article, the average waiting time was reduced by using a means to decide whether both packets are equal to each other or not and then disusing one of both equal packets if exists with the other left.
Abstract: PURPOSE: To decrease the average waiting time by using a means to decide whether both packets are equal to each other or not and then disuses one of both equal packets if exists with the other left. CONSTITUTION: A packet receiving part 3 receives packets from a network 1 and stores them successively to a packet receiving buffer 4. A received packet comparison processing part 12 receives the information on reception of packets and check whether or not a received packet exists in the buffer 4. If both packets exist, one of these two packets is disused with the other left as it is. A control part 11 extracts successively the packets stored in the buffer 4 in an FIFO system and produces the transmission packets through the protocol conversion, etc. and stores them in a packet transmitting buffer 5. Then the part 11 informs the storage of the transmission packets to the part 13. COPYRIGHT: (C)1986,JPO&Japio

3 citations


Proceedings ArticleDOI
01 Oct 1985
TL;DR: A new algorithm designed to meet the constraints of a small mobile packet radio network in a tactical environment, which adapts quickly to environmental changes with minimal control packets, hence conserving bandwidth for important information packets.
Abstract: Advancements in packet technology have led to the need for more sophisticated network control algorithms suited to the packet environment. This paper describes a new algorithm designed to meet the constraints of a small mobile packet radio network in a tactical environment. Requirements include distributed control, adaptability, and delay minimization while achieving high throughput. Previously proposed algorithms meeting these requirements are not as critically constrained by limited channel capacity. The distributed, minimum-hop algorithm presented here adapts quickly to environmental changes with minimal control packets, hence conserving bandwidth for important information packets. Connectivity information is desseminated throughout the network at a rate proportional to the rate of these changes. In addition, congestion control is incorporated to move packets around congested areas, hence optimizing throughput and delay.

2 citations


Journal ArticleDOI
TL;DR: The main purpose of the packet arrival rate control is to reduce the input of new packets to the node's queue when its length grows, and when the queue length decreases below assumed threshold, is to remove respective restrictions.
Abstract: A flow control method in virtual circuit-oriented packet-switched computer communication network is proposed. In a single packet switch a finite number of packet buffers, shared between several output queues, packet arrival rates and lengths of each individual queues to outgoing routes are dynamically restricted, depending upon the queue length and actual packet arrival rate. The main purpose of the packet arrival rate control is to reduce the input of new packets to the node's queue when its length grows, and when the queue length decreases below assumed threshold, is to remove respective restrictions. A simple queueing model is applied to analyze the proposed flow control scheme. To examine some performance tradeoffs of packet switch, simulation program has been elaborated.

2 citations