Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,066
CODA: Congestion detection and avoidance in sensor networks
, 2003
"... Event-driven sensor networks operate under an idle or light load and then suddenly become active in response to a detected or monitored event. The transport of event impulses is likely to lead to varying degrees of congestion in the network depending on the sensing application. It is during these pe ..."
Abstract
-
Cited by 244 (9 self)
- Add to MetaCart
Event-driven sensor networks operate under an idle or light load and then suddenly become active in response to a detected or monitored event. The transport of event impulses is likely to lead to varying degrees of congestion in the network depending on the sensing application. It is during
Fair Resource Allocation in Wireless Networks using Queue-length-based Scheduling and Congestion Control
"... We consider the problem of allocating resources (time slots, frequency, power, etc.) at a base station to many competing flows, where each flow is intended for a different re-ceiver. The channel conditions may be time-varying and different for different receivers. It is well-known that appropriate ..."
Abstract
-
Cited by 202 (45 self)
- Add to MetaCart
at the base station and congestion control implemented either at the base station or at the end users can lead to fair resource allocation and queue-length stability.
End-to-end congestion control schemes: Utility functions, random losses and ECN marks
- In Proceedings of IEEE Infocom
, 2000
"... We present a framework for designing end-to-end congestion control schemes in a network where each user may have a different utility function and may experience non-congestion-related losses. We first show that there exists an additive increase-multiplicative decrease scheme using only end-to-end me ..."
Abstract
-
Cited by 215 (1 self)
- Add to MetaCart
-to-end measurable losses such that a socially-optimal solution can be reached. We incorporate round-trip delay in this model, and show that one can generalize observations regarding TCP-type congestion avoidance to more general window flow control schemes. We then consider explicit congestion notification (ECN
Scalable TCP Congestion Control
, 1999
"... The packet losses imposed by IP networks can cause long and erratic recovery delays, since senders must often use conservative loss detection and retransmission mechanisms. This paper proposes a model to explain and predict loss rates for TCP traffic. Based on that model, the paper describes a new r ..."
Abstract
-
Cited by 83 (0 self)
- Add to MetaCart
router buffering algorithm, Flow-Proportional Queuing (FPQ), that handles heavy TCP loads without imposing high loss rates. FPQ controls TCP by varying the router's queue length in proportion to the number of active TCP connections. Simulation results show that FPQ produces the same average transfer
Making Greed Work in Networks: A Game-Theoretic Analysis of Switch Service Disciplines
- IEEE/ACM TRANSACTIONS ON NETWORKING
, 1994
"... This paper discusses congestion control from a game-theoretic perspective. There are two basic premises: (1) users are assumed to be independent and selfish, and (2) central administrative control is exercised only at the network switches. The operating points resulting from selfish user behavior ..."
Abstract
-
Cited by 220 (11 self)
- Add to MetaCart
This paper discusses congestion control from a game-theoretic perspective. There are two basic premises: (1) users are assumed to be independent and selfish, and (2) central administrative control is exercised only at the network switches. The operating points resulting from selfish user
The Eifel Algorithm: Making TCP Robust Against Spurious Retransmissions
- ACM Computer Communication Review
, 2000
"... We propose an enhancement to TCP’s error recovery scheme, which we call the Eifel algorithm. It eliminates the retransmission ambiguity, thereby solving the problems caused by spurious timeouts and spurious fast retransmits. It can be incrementally deployed as it is backwards compatible and does not ..."
Abstract
-
Cited by 210 (11 self)
- Add to MetaCart
not change TCP’s congestion control semantics. In environments where spurious retransmissions occur frequently, the algorithm can improve the end-to-end throughput by several tens of percent. An exact quantification is, however, highly dependent on the path characteristics over time. The Eifel algorithm
A Framework for Routing and Congestion Control for . . .
, 1998
"... We propose a new multicast routing and scheduling algorithm called multipurpose multicast routing and scheduling algorithm (MMRS). The routing policy load balances amongst various possible routes between the source and the destinations, relying its decisions on the message queue lengths at the so ..."
Abstract
- Add to MetaCart
at the source node. The scheduling amongst various sessions sharing links is devised such that the flow of a session depends on the congestion of the next hop links. MMRS is throughput optimal and computationally simple. It can be implemented in a distributed, asynchronous manner. It has several parameters
A Self-Configuring RED Gateway
, 1999
"... The congestion control mechanisms used in TCP have been the focus of numerous studies and have undergone a number of enhancements. However, even with these enhancements, TCP connections still experience alarmingly high loss rates, especially during times of congestion. The IETF has addressed this pr ..."
Abstract
-
Cited by 173 (11 self)
- Add to MetaCart
The congestion control mechanisms used in TCP have been the focus of numerous studies and have undergone a number of enhancements. However, even with these enhancements, TCP connections still experience alarmingly high loss rates, especially during times of congestion. The IETF has addressed
A Framework for Routing and Congestion Control in Multicast Networks
- IEEE TRANSACTIONS ON INFORMATION THEORY
, 1999
"... We propose a new multicast routing and scheduling algorithm called multipurpose multicast routing and scheduling algorithm (MMRS). The routing policy load balances amongst various possible routes between the source and the destinations, basing its decisions on the message queue lengths at the source ..."
Abstract
-
Cited by 22 (4 self)
- Add to MetaCart
at the source node. The scheduling amongst various sessions sharing links is devised such that the flow of a session depends on the congestion of the next hop links. MMRS is throughput optimal and computationally simple. It can be implemented in a distributed, asynchronous manner. It has several parameters
Results 1 - 10
of
1,066
