Results 1 - 10 of 29,685

Variable Packet Size Equation-Based Congestion Control

by Pedro Reviriego Vasallo - WBL04] J. Widmer, C. Boutremans, and Jean-Yves Le Boudec , 2000
"... This paper, extends previous work [1-3] in equation-based congestion control for unicast traffic. Most best effort traffic on the internet is appropriately served by TCP which is the dominant transport protocol on the internet. However, there is a growing number of multimedia applications for which ..."
Abstract - Cited by 8 (0 self) - Add to MetaCart
constant packet size. In this paper, we propose an extension to the TFRC protocol in order to support variable packet size flows. Variable packet size has been used for the transmission of video over the internet [5] and is also used in voice applications. So it is important for a congestion control

Variable packet size buffered crossbar (CICQ) switches

by Manolis Katevenis, Georgios Passas, Dimitrios Simos, Ioannis Papaefstathiou, Nikos Chrysos Y - IEEE ICC , 2004
"... Abstract — One of the most widely used architectures for packet switches is the crossbar. A special version of a it is the buffered crossbar, where small buffers are associated with the crosspoints. The advantages of this organization, when compared to the unbuffered architecture, is that it needs m ..."
Abstract - Cited by 30 (7 self) - Add to MetaCart
much simpler and slower scheduling circuits, while it can shape the switched traffic according to a given set of Quality of Service (QoS) criteria in a more efficient way. Furthermore, by supporting variable length packets throughout a buffered crossbar: a) there is no need for segmentation

Variable-Packet-Size Buffered Crossbar Switch Chip

by Dimitrios G. Simos, Dimitrios G. Simos , 2004
"... Switches and routers are the basic building blocks of most modern interconnections and of the Internet, aiming at providing datapath connectivity, while solving output contention, the major problem of distributed, multi-party communication. The latter is accomplished through buffering, access contro ..."
Abstract - Add to MetaCart
crossbar organization, operating directly on variable-size packets. Such operation, combined with distributed scheduling, removes the need for internal speedup, thus fully utilizing the incoming throughput. We proved the feasibility of this novel architecture by fully designing such a 32x32 buffered

The Stability of Longest-Queue-First Scheduling With Variable Packet Sizes

by Siva Theja Maguluri, Bruce Hajek, R. Srikant , 2011
"... It is well known that the MaxWeight scheduling algorithm is throughput-optimal in wireless networks. However, its complexity is exponential in the number of links in an ad hoc wireless network. In this work, we consider a greedy variant of the MaxWeight algorithm, called Longest Queue First (LQF) a ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
) algorithm. A synchronous version of LQF algorithm is known to be throughput-optimal under a topological condition called local pooling. Here we study an asynchronous version which is suitable for implementation in networks with variable packet sizes. We show that the asynchronous LQF algorithm is also

Design Issues of Variable-Packet-Size, Multiple-Priority Buffered Crossbars

by Nikos Chrysos , 2003
"... Buffered crossbars provide several advantages over unbuffered ones; one of them is that they can directly switch variable-size packets. The first part of this report considers several issues that arise when designing a variable-packet-size buffered crossbar with considerable Round-Trip Time: (1) we ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
Buffered crossbars provide several advantages over unbuffered ones; one of them is that they can directly switch variable-size packets. The first part of this report considers several issues that arise when designing a variable-packet-size buffered crossbar with considerable Round-Trip Time: (1) we

End-to-end Congestion Control for Flows With Variable Packet Size

by Jörg Widmer, Catherine Boutremans, Jean-Yves Le Boudec - IN BCP 78 AND BCP 79. COPIES OF IPR DISCLOSURES , 2004
"... Current TCP-friendly congestion control mechanisms such as those used in TFRC adjust the packet rate in order to adapt to network conditions and obtain a throughput not exceeding that of a TCP connection operating under the same conditions. In an environment where the bottleneck resource is packet ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
is packet processing, this is the correct behavior. However, if the bottleneck resource is bandwidth, and flows may use packets of different sizes, resource sharing then depends on packet size and is no longer fair. Now for some applications, such as Internet telephony, it is more natural to adjust

Using Maimonides’ Rule to Estimate the Effect of Class Size on Scholastic Achievement

by Joshua D. Angrist, Victor Lavy - QUARTERLY JOURNAL OF ECONOMICS , 1999
"... The twelfth century rabbinic scholar Maimonides proposed a maximum class size of 40. This same maximum induces a nonlinear and nonmonotonic relation-ship between grade enrollment and class size in Israeli public schools today. Maimonides’ rule of 40 is used here to construct instrumental variables e ..."
Abstract - Cited by 582 (40 self) - Add to MetaCart
The twelfth century rabbinic scholar Maimonides proposed a maximum class size of 40. This same maximum induces a nonlinear and nonmonotonic relation-ship between grade enrollment and class size in Israeli public schools today. Maimonides’ rule of 40 is used here to construct instrumental variables

Self-Similarity Through High-Variability: Statistical Analysis of Ethernet LAN Traffic at the Source Level

by Walter Willinger, Murad S. Taqqu, Robert Sherman, Daniel V. Wilson - IEEE/ACM TRANSACTIONS ON NETWORKING , 1997
"... A number of recent empirical studies of traffic measurements from a variety of working packet networks have convincingly demonstrated that actual network traffic is self-similar or long-range dependent in nature (i.e., bursty over a wide range of time scales) -- in sharp contrast to commonly made tr ..."
Abstract - Cited by 743 (24 self) - Add to MetaCart
A number of recent empirical studies of traffic measurements from a variety of working packet networks have convincingly demonstrated that actual network traffic is self-similar or long-range dependent in nature (i.e., bursty over a wide range of time scales) -- in sharp contrast to commonly made

ATOMIC DECOMPOSITION BY BASIS PURSUIT

by Scott Shaobing Chen , David L. Donoho , Michael A. Saunders , 1995
"... The Time-Frequency and Time-Scale communities have recently developed a large number of overcomplete waveform dictionaries -- stationary wavelets, wavelet packets, cosine packets, chirplets, and warplets, to name a few. Decomposition into overcomplete systems is not unique, and several methods for d ..."
Abstract - Cited by 2728 (61 self) - Add to MetaCart
variation de-noising, and multi-scale edge denoising. Basis Pursuit in highly overcomplete dictionaries leads to large-scale optimization problems. With signals of length 8192 and a wavelet packet dictionary, one gets an equivalent linear program of size 8192 by 212,992. Such problems can be attacked

Random Early Detection Gateways for Congestion Avoidance.

by Sally Floyd , Van Jacobson - IEEELACM Transactions on Networking, , 1993
"... Abstract-This paper presents Random Early Detection (RED) gateways for congestion avoidance in packet-switched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving at the gatewa ..."
Abstract - Cited by 2716 (31 self) - Add to MetaCart
Abstract-This paper presents Random Early Detection (RED) gateways for congestion avoidance in packet-switched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving
Results 1 - 10 of 29,685