505 Hits in 9.0 sec

Optimal Heavy-Traffic Queue Length Scaling in an Incompletely Saturated Switch [article]

Siva Theja Maguluri and Sai Kiran Burle and R. Srikant
2016 arXiv   pre-print
Recently, it was shown that the MaxWeight algorithm has optimal heavy-traffic queue length scaling when all ports are uniformly saturated.  ...  We use a recently developed drift technique to show that the heavy-traffic queue length under the MaxWeight scheduling algorithm has optimal scaling with respect to the switch size even in these cases.  ...  Michael Harrison for suggesting us the question about heavy traffic queue length behavior in a switch when different ports saturate at different rates.  ... 
arXiv:1611.00745v1 fatcat:5gldukspyvfw7dcqyprlcgtnc4

On Heavy-Traffic Optimal Scaling of c-Weighted MaxWeight Scheduling in Input-Queued Switches [article]

Yingdong Lu, Siva Theja Maguluri, Mark S. Squillante, Tonghoon Suk
2020 arXiv   pre-print
optimal heavy-traffic queue-length scaling.  ...  We consider the optimal control of input-queued switches under a cost-weighted variant of MaxWeight scheduling, for which we establish theoretical properties that include showing the algorithm exhibits  ...  MaxWeight scheduling has also been shown to have optimal scaling in heavy traffic for an objective function of the summation of QLs under all ports saturated [4] , which was then extended to the case  ... 
arXiv:1907.02115v2 fatcat:zgofwgijbra2lf5d4ze2qolb6e

Heavy-Traffic Analysis of Queueing Systems with no Complete Resource Pooling [article]

D. Hurtado-Lange, S. T. Maguluri
2021 arXiv   pre-print
The main contribution of this paper is the steady-state mean of linear combinations of queue lengths in heavy traffic.  ...  matter in heavy traffic.  ...  We now prove a corollary of Theorem 1, in which we obtain the heavy-traffic limit of the scaled sum of queue lengths in a completely saturated switch with correlated arrival processes.  ... 
arXiv:1904.10096v4 fatcat:pozd6ivqzrbplhbdmnyxki74e4

Heavy Traffic Queue Length Behaviour in a Switch under Markovian Arrivals [article]

Shancong Mou, Siva Theja Maguluri
2020 arXiv   pre-print
The heavy-traffic scaled mean queue length was characterized in when the arrivals are i.i.d..  ...  This paper characterizes the heavy-traffic scaled mean sum queue length under Markov modulated arrivals in the heavy-traffic limit, and shows that it is within a factor of less than 2 from a universal  ...  Such an approach gives the complete distribution of the heavy-traffic scaled queue lengths in the heavy traffic limit, and is simpler than both the diffusion limits approach and the drift method.  ... 
arXiv:2006.06150v1 fatcat:dgiuy63p7zdwzpc23gw5oq5lgy

Backpressure Control with Estimated Queue Lengths for Urban Network Traffic [article]

Li Li and Victor Okoth and Saif Eddin Jabari
2020 arXiv   pre-print
Most of these BP variants are based on an assumption of perfect knowledge of traffic conditions throughout the network at all times, specifically the queue lengths (more accurately, the traffic volumes  ...  maximum stopped queue lengths under high demand scenarios.  ...  under both light and heavy traffic conditions.  ... 
arXiv:2006.15549v2 fatcat:pxnqyhqvtrfg5bmhvcerdlulu4

On Optimal Weighted-Delay Scheduling in Input-Queued Switches [article]

Yingdong Lu, Siva Theja Maguluri, Mark S. Squillante, Tonghoon Suk
2017 arXiv   pre-print
Theoretical properties of variants of the well-known MaxWeight scheduling algorithm are established within this context, which includes showing that these algorithms exhibit optimal heavy-traffic queue-length  ...  Motivated by relatively few delay-optimal scheduling results, in comparison to results on throughput optimality, we investigate an input-queued switch scheduling problem in which the objective is to minimize  ...  We will obtain an exact expression for the heavy traffic scaled weighted sum of queue lengths under the c-weighted MaxWeight algorithm in heavy traffic.  ... 
arXiv:1704.02302v2 fatcat:2n3v5ardfjdjpiqhz7lwoxa32m

Heavy-traffic limits for polling models with exhaustive service and non-FCFS service order policies

P. Vis, R. Bekker, R. D. van der Mei
2015 Advances in Applied Probability  
Next, we use these expressions to derive the asymptotic waiting-time distributions under heavy-traffic assumptions, i.e. when the system tends to saturate.  ...  The results show that in all cases the asymptotic waiting-time distribution at queue i is fully characterized and of the form Γ Θ i , with Γ and Θ i independent, and where Γ is gamma distributed with known  ...  Figure 4 : Fluid limits in heavy traffic.  ... 
doi:10.1239/aap/1449859797 fatcat:uvfgm7jogfcandncgifr3m2lk4

A lossless switch for data acquisition networks

Grzegorz Jereczek, Giovanna Lehmann Miotto, David Malone, Miroslaw Walukiewicz
2015 2015 IEEE 40th Conference on Local Computer Networks (LCN)  
attached to the switch, which results in an all-to-all communication scenario with heavy incast congestion.  ...  The performance did not scale ideally when increasing the number of cores, reaching saturation at some point.  ... 
doi:10.1109/lcn.2015.7366370 dblp:conf/lcn/JereczekMMW15 fatcat:ckogbydvvveoleqdyqlhtqv3wi

Heavy-traffic limits for polling models with exhaustive service and non-FCFS service order policies

P. Vis, R. Bekker, R. D. van der Mei
2015 Advances in Applied Probability  
Next, we use these expressions to derive the asymptotic waiting-time distributions under heavy-traffic assumptions, i.e. when the system tends to saturate.  ...  For each of these policies, we first express the waiting-time distributions in terms of intervisit-time distributions.  ...  Figure 4 : Fluid limits in heavy traffic.  ... 
doi:10.1017/s0001867800048989 fatcat:x4xuwbss5nabhc4ayuz7dunn3a

Performance Evaluation of an Optical Burst Switched Core Node With Generalized Arrivals and Partial Wavelength Conversion Capability

Mohamed H. Morsy-Osman, Mohammed Y. S. Sowailem, Ahmed I. Abd El-Rahman, Hossam M. H. Shalaby
2012 Journal of Optical Communications and Networking  
Many of the burst assembly algorithms employed in optical burst switching (OBS) networks preserve the IP traffic self-similarity property in the burst traffic.  ...  In our proposed model, each output port in the node is modeled as a GI/M/w/w queue with partial server accessibility.  ...  On the other hand, when the traffic load is medium to heavy, the traffic becomes smoother. Nevertheless, this does not affect the correlation properties at large time scales.  ... 
doi:10.1364/jocn.4.000997 fatcat:7h7lc7r7t5civmi2s4vkb7k2ci

NOC'S: Buffered and Bufferless Structure and their design methodologies for High throughput and Low latency

Sujata. S.B
2020 International Journal of Advanced Trends in Computer Science and Engineering  
of signal integrity, scalability, throughput and latency in an NoC's.  ...  In turn these delays are affected on throughput and latency. Many of the NoC's has buffered and bufferless routers to optimize the area, power consumption and latency.  ...  We analyzed both 64-thread and 128-thread systems, and our proposed method demonstrates the important developments in system performance.  ... 
doi:10.30534/ijatcse/2020/240932020 fatcat:kj4yllfklffqrjuaipr2c26jyy

Optimal Scheduling Control in Fluid Models of General n× n Input-Queued Switches [article]

Yingdong Lu and Mark S. Squillante and Tonghoon Suk
2020 arXiv   pre-print
with respect to total expected delay asymptotically in the heavy-traffic regime.  ...  However, the question of delay-optimal scheduling in input-queued switches remains open in general, as does the question of delay-optimal scheduling under more general objective functions.  ...  Max-weight scheduling was then shown to be optimal in heavy tra c for an objective function of the summation of the queue lengths under the assumption that all the ports are saturated [15] . is was subsequently  ... 
arXiv:1910.13657v2 fatcat:5am3gattt5cg3fuwrnl5tfrvsa

A Robust Queueing Network Analyzer Based on Indices of Dispersion [article]

Ward Whitt, Wei You
2020 arXiv   pre-print
The algorithm effectiveness is supported by extensive simulation studies and heavy-traffic limits.  ...  This function is a scaled version of the variance-time curve, called the index of dispersion for counts (IDC).  ...  Hence, the immediate feedback elimination procedure as an approximation is asymptotically exact in the heavy-traffic limit.  ... 
arXiv:2003.11174v1 fatcat:oalegvnndfhntpkzludyfndsta

Load-Balancing using HA Proxy on Multipath System with Flow Slice

Pallavali Radha, C Surekha, U Sesadri
To provide switching capacity in terabit or petabit uses core routers in multipath switching systems (MPS).  ...  The performance is not good through heavy tailed flow size distribution in flow based hashing algorithm.  ...  These programs don't scale well on multiprocessor systems, so the most work done expected on optimized CPU cycle.This HA Proxy began in 1996 to setup a modem access with a very simple HTTP proxy.  ... 
doi:10.24297/ijct.v11i1.1189 fatcat:ek6fsm2zp5eorda23m3uxucg4y

A survey of sketches in traffic measurement: Design, Optimization, Application and Implementation [article]

Shangsen Li, Lailong Luo, Deke Guo, Qianzhen Zhang, Pengtao Fu
2021 arXiv   pre-print
To summarize the existing efforts, we carry out an in-depth study of the existing literature, covering more than 90 sketch designs and optimization strategies.  ...  Researchers and engineers in the network measurement community desire an all-in-one survey that covers the entire processing pipeline of sketch-based network measurement.  ...  Because of this linearity, CM sketches can be scaled, added, and subtracted, to produce summaries of the corresponding scaled network traffic.  ... 
arXiv:2012.07214v2 fatcat:lme2ghsshje3tag2m5q3xgvcna
« Previous Showing results 1 — 15 out of 505 results