scispace - formally typeset
Search or ask a question
Topic

Transmission delay

About: Transmission delay is a research topic. Over the lifetime, 16975 publications have been published within this topic receiving 248206 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: The prevalence of unusual network events such as out-of-order delivery and packet replication are characterized and a robust receiver-based algorithm for estimating "bottleneck bandwidth" is discussed that addresses deficiencies discovered in techniques based on "packet pair".
Abstract: We discuss findings from a large-scale study of Internet packet dynamics conducted by tracing 20000 TCP bulk transfers between 35 Internet sites. Because we traced each 100-kbyte transfer at both the sender and the receiver, the measurements allow us to distinguish between the end-to-end behavior due to the different directions of the Internet paths, which often exhibit asymmetries. We: (1) characterize the prevalence of unusual network events such as out-of-order delivery and packet replication; (2) discuss a robust receiver-based algorithm for estimating "bottleneck bandwidth" that addresses deficiencies discovered in techniques based on "packet pair;" (3) investigate patterns of packet loss, finding that loss events are not well modeled as independent and, furthermore, that the distribution of the duration of loss events exhibits infinite variance; and (4) analyze variations in packet transit delays as indicators of congestion periods, finding that congestion periods also span a wide range of time scales.

913 citations

Journal ArticleDOI
TL;DR: Upper and lower bounds for delay that are computationally simple are presented in this paper and can be used to bound the delay, given the signal threshold, and to certify that a circuit is "fast enough," given both the maximum delay and the voltage threshold.
Abstract: In MOS integrated circuits, signals may propagate between stages with fanout. The exact calculation of signal delay through such networks is difficult. However, upper and lower bounds for delay that are computationally simple are presented in this paper. The results can be used 1) to bound the delay, given the signal threshold, or 2) to bound the signal voltage, given a delay time, or 3) certify that a circuit is "fast enough," given both the maximum delay and the voltage threshold.

857 citations

Journal ArticleDOI
TL;DR: From the single-user point of view considered in this paper, there exists an optimal repetition diversity order (or spreading factor) that minimizes the information outage probability for given rate, power, and fading statistics.
Abstract: We study optimal constant-rate coding schemes for a block-fading channel with strict transmission delay constraint, under the assumption that both the transmitter and the receiver have perfect channel-state information. We show that the information outage probability is minimized by concatenating a standard "Gaussian" code with an optimal power controller, which allocates the transmitted power dynamically to the transmitted symbols. We solve the minimum outage probability problem under different constraints on the transmitted power and we derive the corresponding power-allocation strategies. In addition, we propose an algorithm that approaches the optimal power allocation when the fading statistics are not known. Numerical examples for different fading channels are provided, and some applications discussed. In particular, we show that minimum outage probability and delay-limited capacity are closely related quantities, and we find a closed-form expression for the delay-limited capacity of the Rayleigh block-fading channel with transmission over two independent blocks. We also discuss repetition diversity and its relation with direct-sequence or multicarrier spread-spectrum transmission. The optimal power-allocation strategy in this case corresponds to selection diversity at the transmitter. From the single-user point of view considered in this paper, there exists an optimal repetition diversity order (or spreading factor) that minimizes the information outage probability for given rate, power, and fading statistics.

822 citations

Patent
27 Aug 1998
TL;DR: In this article, a flexible, policy-based, mechanism for managing, monitoring, and prioritizing traffic within a network and allocating bandwidth to achieve true quality of service (QoS) is provided.
Abstract: A flexible, policy-based, mechanism for managing, monitoring, and prioritizing traffic within a network and allocating bandwidth to achieve true quality of service (QoS) is provided. According to one aspect of the present invention, a method is provided for managing bandwidth allocation in a network that employs a non-deterministic access protocol, such as an Ethernet network. A packet forwarding device receives information indicative of a set of traffic groups, such as: a MAC address, or IEEE 802.1p priority indicator or 802.1Q frame tag, if the QoS policy is based upon individual station applications; or a physical port if the QoS policy is based purely upon topology. The packet forwarding device additionally receives bandwidth parameters corresponding to the traffic groups. After receiving a packet associated with one of the traffic groups on a first port, the packet forwarding device schedules the packet for transmission from a second port based upon bandwidth parameters corresponding to the traffic group with which the packet is associated. According to another aspect of the present invention, a method is provided for managing bandwidth allocation in a packet forwarding device. The packet forwarding device receives information indicative of a set of traffic groups. The packet forwarding device additionally receives information defining a QoS policy for the traffic groups. After a packet is received by the packet forwarding device, a traffic group with which the packet is associated is identified. Subsequently, rather than relying on an end-to-end signaling protocol for scheduling, the packet is scheduled for transmission based upon the QoS policy for the identified traffic group.

808 citations

Journal ArticleDOI
TL;DR: A protocol that supports the sharing of resources that exist in different packet switching networks is presented and provides for variation in individual network packet sizes, transmission failures, sequencing, flow control, end-to-end error checking, and the creation and destruction of logical process- to-process connections.
Abstract: A protocol that supports the sharing of resources that exist in different packet switching networks is presented. The protocol provides for variation in individual network packet sizes, transmission failures, sequencing, flow control, end-to-end error checking, and the creation and destruction of logical process-to-process connections. Some implementation issues are considered, and problems such as internetwork routing, accounting, and timeouts are exposed.

802 citations


Network Information
Related Topics (5)
Network packet
159.7K papers, 2.2M citations
95% related
Wireless network
122.5K papers, 2.1M citations
95% related
Wireless
133.4K papers, 1.9M citations
94% related
Wireless sensor network
142K papers, 2.4M citations
94% related
Wireless ad hoc network
49K papers, 1.1M citations
93% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202345
202298
2021288
2020408
2019469
2018426