20,887 Hits in 8.2 sec

Access Control for Distributed Ledgers in the Internet of Things: A Networking Approach [article]

Andrew Cullen, Pietro Ferraro, William Sanders, Luigi Vigneri, Robert Shorten
2021 arXiv   pre-print
However, without PoW, implementation of these DLTs requires an access control algorithm to manage the rate at which nodes can add new transactions to the ledger.  ...  In this work, we consider a class of IoT-friendly DLTs based on directed acyclic graphs, rather than a blockchain, and with a reputation system in the place of Proof of Work (PoW).  ...  An access control algorithm satisfies the fairness in dissemination rate requirement if allocation of dissemination rate among nodes is max-min fair, weighted by each node's reputation.  ... 
arXiv:2005.07778v3 fatcat:brkcracdmrczzirnfbqxskjina

Dynamic Fair Scheduling With QoS Constraints in Multimedia Wideband CDMA Cellular Networks

L. Xu, X. Shen, J.W. Mark
2004 IEEE Transactions on Wireless Communications  
A class of dynamic fair scheduling schemes based on the generalized processor sharing (GPS) fair service discipline, under the generic name code-division GPS (CDGPS), is proposed for a wideband direct-sequence  ...  The CDGPS scheduler makes use of both the traffic characteristics in the link layer and the adaptivity of the wideband CDMA physical layer to perform fair scheduling on a time-slot by time-slot basis,  ...  ACKNOWLEDGMENT The authors would like to thank the anonymous reviewers for their helpful comments in improving the presentation of the paper.  ... 
doi:10.1109/twc.2003.819028 fatcat:3lzmqar3yjdvjfxaeua7qdqcne

Contention Based Proportional Fairness (CBPF) Transmission Scheme for Time Slotted Channel Hopping Networks [article]

Lokesh Bommisetty, TG Venkatesh
2021 arXiv   pre-print
In this paper, we propose a contention based proportional fairness (CBPF) transmission scheme for TSCH networks to maximize the system throughput addressing fair allocation of resources to the nodes.  ...  We model TSCH MAC as a multichannel slotted aloha and analyse it for a schedule given by the 6top layer.  ...  Proportional fairness was first introduced by Frank Kelly in [19] based on changing rate control for elastic traffic in computer network services.  ... 
arXiv:2112.07164v1 fatcat:hmvfpatuwbeyzdqra5hkbe3oa4

Effective Management of DRAM Bandwidth in Multicore Processors

Nauman Rafique, Won-Taek Lim, Mithuna Thottethodi
2007 Parallel Architecture and Compilation Techniques (PACT), Proceedings of the International Conference on  
Technology trends are leading to increasing number of cores on chip. All these cores inherently share the DRAM bandwidth.  ...  The on-chip cache resources are limited and in many situations, cannot hold the working set of the threads running on all these cores. This situation makes DRAM bandwidth a critical shared resource.  ...  Acknowledgments The authors would like to thank Asad Khan Awan for discussions on network fair queuing. We would also like to thank anonymous reviewers for their feedback.  ... 
doi:10.1109/pact.2007.4336216 fatcat:7l7exym7x5cdhiouozhlqs7jay

Context-aware resource allocation for cellular wireless networks

Magnus Proebster, Matthias Kaschub, Thomas Werthmann, Stefan Valentin
2012 EURASIP Journal on Wireless Communications and Networking  
Studying this heuristic under various traffic assumptions shows that our context-aware scheduler can support three times the load of proportional fair scheduling, at equal capacity and utility.  ...  After introducing our framework for accessing CI from the handheld's applications and operating system, we use time-utility functions to develop a practical scheduling algorithm.  ...  Mueller (IKR) and Michael Timmers (Bell Labs, Antwerp) for their helpful comments. This work was supported by Bell Labs, Stuttgart and by the DFG program Open Access Publishing.  ... 
doi:10.1186/1687-1499-2012-216 fatcat:xlk4w7dygfbxlbdtnaa3gadcju

Fair scheduling with tunable latency: A round-robin approach

H.M. Chaskar, U. Madhow
2003 IEEE/ACM Transactions on Networking  
Weighted fair queueing (WFQ)-based packet scheduling schemes require processing at line speeds for tag computation and tag sorting.  ...  and 2) multiclass round robin, a version of hierarchical round robin with controls designed for good scheduling properties.  ...  Proof: The proof is based on induction on the the total number of classes in the system and the actions of Control 1 and Control 2.  ... 
doi:10.1109/tnet.2003.815290 fatcat:bd6vazdntrfmnfcyvafzxmuwvq

Measurement-based opportunistic scheduling for heterogenous wireless systems

S. Patil, G. De Veciana
2009 IEEE Transactions on Communications  
In other words the penalty associated with tuning weights for other schemes can be higher than that associated with estimating users' rate distributions for maximum quantile scheduling.  ...  Furthermore we prove that if rates are bounded and number of users is high, maximum quantile scheduling is sum average throughput maximizing subject to temporal fairness.  ...  However in practice the weights for each user needs to be estimated, we investigate the sensitivity of system throughput to errors in these weights by performing two controlled experiments.  ... 
doi:10.1109/tcomm.2009.09.0800902 fatcat:dhdx6qkllnh5rnkgazjdso2sme

Aggregate Flow-Based Performance Fairness in CMPs

Zhonghai Lu, Yuan Yao
2016 ACM Transactions on Architecture and Code Optimization (TACO)  
Full-system evaluations in GEM5 demonstrate that, compared to classic packet-centric and latest application-prioritization approaches, our approach significantly improves weighted speed-up for all multi-application  ...  Our solution comprises three coherent mechanisms from rate profiling, rate inheritance, and rate-proportional channel scheduling to facilitate and realize unbiased workload-adaptive resource allocation  ...  As a pure gain from rate inheritance, f-SLFQ+IHT further leverages the system IPCs of f-SLFQ by 4.8% on average and 7.0% at maximum.  ... 
doi:10.1145/3014429 fatcat:af3dfjevqjclhd3ufmctpycy2e

User based resource scheduling for heterogeneous traffic in the downlink of OFDM systems

G. Indumathi, S. Vijayarani, K. Murugesan
2011 2011 International Conference on Signal Processing, Communication, Computing and Networking Technologies  
In this paper, we focus on resource allocation and scheduling in wireless multiuser OFDM networks based on joint physical and medium access control (MAC) layer optimization.  ...  Keywords-Cross-layer design, quality of service, packet scheduling, orthogonal frequency division multiplexing systems.  ...  Proportional Fairness (PF) The PF scheduling is a channel aware scheduling rule aiming to maximize average data rate of user k [10] .  ... 
doi:10.1109/icsccn.2011.6024616 fatcat:gzt45bkifvautkhl4hi2kxdhke

Controllable fair queuing for meeting performance goals

Magnus Karlsson, Christos Karamanolis, Jeff Chase
2005 Performance evaluation (Print)  
The experimental results demonstrate the importance of controllable-fair scheduling for feedback control of computing utilities.  ...  It shows that the fairness properties commonly defined for proportional share schedulers using Weighted Fair Queuing (WFQ) are not preserved across changes to the relative weights of competing request  ...  CSFQ(D) is a controllable-fair variant of concurrency-controlled start-time fair queuing (SFQ(D)), a WFQ algorithm that can deal with concurrency in the scheduled system [4] .  ... 
doi:10.1016/j.peva.2005.07.019 fatcat:eowm2vdcwrfxbhattdm6kfcjyu

Flow-level performance analysis of some opportunistic scheduling algorithms

T. Bonald
2005 Transactions on Emerging Telecommunications Technologies  
The packet delay tolerance of data applications, such as file transfers and Web browsing for instance, allows the system flexibility in scheduling a user's packets.  ...  So-called opportunistic scheduling, which ensures transmission occurs when radio conditions are most favorable, is the key component of currently developed systems like cdma2000 IS-856 and UMTS HSDPA.  ...  The gain of the scorebased scheduler in terms of maximum traffic intensity compatible with any reasonable blocking rate is of 15% over the maximum SNR scheduler, 5% over the proportional fair scheduler  ... 
doi:10.1002/ett.1032 fatcat:d3vtbpnvcnferalxtnea5ole74

Two-Step Scheduling Scheme to Support Fairness and QoS in DVB-S2 System

2015 KSII Transactions on Internet and Information Systems  
As results of this simulation, the proposed scheduler was shown to support bandwidth fairness to an individual RCST, and provide a level of QoS differentiation for user traffics.  ...  The use of an efficient packet scheduling scheme for a forward link in satellite communication networks is very important to support fairness for each return channel satellite terminal (RCST) and the service  ...  Round-robin and fairness scheduling The round-robin scheduling algorithm is one of the simplest scheduling algorithms for processing packets in network systems.  ... 
doi:10.3837/tiis.2015.11.009 fatcat:sfhtm2fp2feohez7awhcotf6bi

Cooperative Fair Scheduling for the Downlink of CDMA Cellular Networks

M. Dianati, Xuemin Shen, K. Naik
2007 IEEE Transactions on Vehicular Technology  
He is a coauthor of two books and has published more than 200 papers and book chapters on wireless communications and networks, control, and filtering. Dr.  ...  The scheduler maintains fairness and smooth service delivery by balancing the long-term average throughput of users.  ...  Let x = R · α, x min = R min · α, and x max = R max · α be the weighted average rate, the weighted minimum average rate, and the weighted maximum average rate of a user, respectively. α is a weighting  ... 
doi:10.1109/tvt.2007.897209 fatcat:2m6luwol5vegxo3wrpvhxtktay

Opportunistic Beamforming and Scheduling for OFDMA Systems

Patrick Svedman, Sarah Kate Wilson, Leonard J. Cimini, Bjrn Ottersten
2007 IEEE Transactions on Communications  
Thirdly, we deal with the issue of fairness and quality-of-service (QoS) in opportunistic systems by proposing a modified proportional fair (PF) scheduler for OFDMA.  ...  Orthogonal frequency-division multiple access (OFDMA) is an attractive technique for exploiting multiuser diversity in the downlink of a cellular system.  ...  INTRODUCTION O PPORTUNISTIC systems use adaptive modulation instead of power control to achieve the target error rates.  ... 
doi:10.1109/tcomm.2007.896082 fatcat:p6rlrwdjljhz3pzfvr6syt6tle

Rate-Adaptive Concurrent Transmission Scheduling Schemes for WPANs With Directional Antennas

Maggie X. Cheng, Quanmin Ye, Lin Cai
2015 IEEE Transactions on Vehicular Technology  
The simulation results show that the proposed algorithms outperform the previous work for adaptive-rate transmission scheduling in both throughput and fairness.  ...  The challenge is that the achieved data rate of one flow is limited by the interference from other flows in the same slot, which is unknown until the schedule is known.  ...  Lin Cai is supported in part by grants from the Natural Sciences and Engineering Research Council of Canada.  ... 
doi:10.1109/tvt.2014.2365496 fatcat:qinnxfs53vdpxbvl7o4ptjxxva
« Previous Showing results 1 — 15 out of 20,887 results