Filters








5,616 Hits in 4.4 sec

Combining Fairness with Throughput: Online Routing with Multiple Objectives

Ashish Goel, Adam Meyerson, Serge Plotkin
2001 Journal of computer and system sciences (Print)  
doi:10.1006/jcss.2001.1755 fatcat:iri2casmwndrhaqkpyenw3vqym

Mongoose: Throughput Redistributing Virtual World

Iain Oliver, Alan Miller, Colin Allison
2012 2012 21st International Conference on Computer Communications and Networks (ICCCN)  
Mongoose combines isolating distinct functional components with efficient use of network resources and fairness to other traffic. 1 http://www.historic-scotland.gov.uk 2  ...  Through measurement and analysis current virtual world traffic regulation is evaluated and compared with Transmission Control Protocol fair rate.  ...  In Routing Island routers, sinks, sources and links are all created with the click of a mouse.  ... 
doi:10.1109/icccn.2012.6289297 dblp:conf/icccn/OliverMA12 fatcat:o6fiw6liqvfpdkqm3boo2o37qa

Throughput-Fairness Tradeoffs in Mobility Platforms [article]

Arjun Balasingam, Karthik Gopalakrishnan, Radhika Mittal, Venkat Arun, Ahmed Saeed, Mohammad Alizadeh, Hamsa Balakrishnan, Hari Balakrishnan
2021 arXiv   pre-print
It provides a principled method to navigate inherent tradeoffs between fairness and throughput caused by shared mobility.  ...  A mobility platform should allocate tasks to vehicles and schedule them in order to optimize both throughput and fairness across customers.  ...  Mobius with a proportional fairness objective similarly outperforms max throughput and dedicated vehicles in navigating the throughput-fairness tradeoff.  ... 
arXiv:2105.11999v1 fatcat:exl7vwhnpbbjhmjcjk67qhbdo4

BRPL: Backpressure RPL for High-throughput and Mobile IoTs [article]

Yad Tahir and Shusen Yang and Julie McCann
2017 arXiv   pre-print
To address this issue, we develop BRPL, an extension of RPL, providing a practical approach that allows users to smoothly combine any RPL Object Function (OF) with backpressure routing.  ...  The evaluation results demonstrate that BRPL not only is fully backward compatible with RPL (i.e. devices running RPL and BRPL can work together seamlessly), but also significantly improves network throughput  ...  An interesting future direction is to study resource fairness issues among multiple coexisting DAGs in RPL and BRPL.  ... 
arXiv:1705.07254v1 fatcat:au54gx43vvhb5hkknyedxde7nu

BRPL: Backpressure RPL for High-Throughput and Mobile IoTs

Yad Tahir, Shusen Yang, Julie McCann
2018 IEEE Transactions on Mobile Computing  
To address this issue, we develop BRPL, an extension of RPL, providing a practical approach that allows users to smoothly combine any RPL Object Function (OF) with backpressure routing.  ...  The evaluation results demonstrate that BRPL not only is fully backward compatible with RPL (i.e. devices running RPL and BRPL can work together seamlessly), but also significantly improves network throughput  ...  An interesting future direction is to study resource fairness issues among multiple coexisting DAGs in RPL and BRPL.  ... 
doi:10.1109/tmc.2017.2705680 fatcat:22tskwhoa5cybky3ltqoia74fm

Fair and Throughput-Optimal Routing in Multimodal Underwater Networks

Roee Diamant, Paolo Casari, Filippo Campagnaro, Oleksiy Kebkal, Veronika Kebkal, Michele Zorzi
2018 IEEE Transactions on Wireless Communications  
In this paper, we address a fundamental part of this intelligence by proposing Optimal Multimodal Routing (OMR), a novel routing protocol for underwater networks of multimodal nodes.  ...  (i) j in Our fair resource splitting eliminates bottlenecks at the expense of favoring nodes with fewer routes to the sink by setting their fairness index, F j (i), to a high value.  ...  Among basic schemes, the CA-AODV [29] protocol proposes to combine channel assignment with AODV [32] using one channel to exchange route requests and reply packets.  ... 
doi:10.1109/twc.2017.2785223 fatcat:dqnl55on4zcdfozpdtccztfcia

A Two-Phase Dynamic Throughput Optimization Model for Big Data Transfers [article]

Zulkar Nine, Tevfik Kosar
2018 arXiv   pre-print
In this paper, we propose a novel dynamic throughput optimization model based on mathematical modeling with offline knowledge discovery/analysis and adaptive online decision making.  ...  It also achieved up to 93% accuracy compared with the optimal achievable throughput possible on those networks.  ...  Another question would be whether fairness among different users is preserved or not, since fairness is an important feature when multiple users are using a shared network.As seen in the figure, ASM preserves  ... 
arXiv:1812.11255v1 fatcat:ryt62ycduzejpmqvm6vtj7k2pi

Maximizing Resilient Throughput in Peer-to-Peer Network

Bo Liu, Fan Qiu, Yanchuan Cao, Bin Chang, Yi Cui, Yuan Xue
2011 Communications and Network  
CN 183 left at s, we construct tree t 0 , the last tree in Figure 3 , with rate  ...  Key concepts introduced by this framework include resilience factor, resilience index, and generalized throughput, which collectively model the peer resilience in a probabilistic measure.  ...  In particular, the work of [17, 18] presents the theoretical models for online unicast routing.  ... 
doi:10.4236/cn.2011.33021 fatcat:lngkt6qwpjgknm3jdqoepde4py

Achieving Throughput via Fine-Grained Path Planning in Small World DTNs [article]

Dhrubojyoti Roy and Mukundan Sridharan and Satyajeet Deshpande and Anish Arora
2019 arXiv   pre-print
be readily computed with low overhead.  ...  We describe one such routing framework, REAPER (for Reliable, Efficient and Predictive Routing), that is fully distributed and self-stabilizing.  ...  diverse optimization objectives.  ... 
arXiv:1902.06371v1 fatcat:mxgxkjqegzhc7owccjdex6v3i4

Impact of IEEE 802.11n/ac PHY/MAC High Throughput Enhancements over Transport/Application Layer Protocols - A Survey [article]

Raja Karmakar and Sandip Chakraborty and Samiran Chattopadhyay
2017 arXiv   pre-print
For both standards, PHY is enhanced with multiple-input multiple-output (MIMO) antenna technologies, channel bonding, short guard intervals (SGI), enhanced modulation and coding schemes (MCS).  ...  thus these amendments are called High Throughput WLANs (HT-WLANs).  ...  Combining BACK with MIMO and channel bonding can further help to enhance MAC throughput. Such combination has a positive impact on TCP/UDP throughput [59] .  ... 
arXiv:1702.03257v1 fatcat:tzujjllqszbcpcj336ykjspco4

Multi-Objective Optimization of Energy Saving and Throughput in Heterogeneous Networks Using Deep Reinforcement Learning

Kyungho Ryu, Wooseong Kim
2021 Sensors  
In this paper, we investigate the feasibility of the DRL algorithm for a dual-objective problem, energy efficient routing and throughput maximization, which has not been explored before.  ...  fast inference time as an online solution.  ...  They established a new multi-dimensional RL framework based on the Q-learning that maximizes sum throughput and provides proportional fairness, even co-existing with TDMA-like ALOHA protocols.  ... 
doi:10.3390/s21237925 pmid:34883929 fatcat:w3vipunlxnfyri7k7rnwh6aouu

SmartAssoc: Decentralized Access Point Selection Algorithm to Improve Throughput

Fengyuan Xu, Xiaojun Zhu, Chiu C. Tan, Qun Li, Guanhua Yan, Jie Wu
2013 IEEE Transactions on Parallel and Distributed Systems  
In this paper, we study this AP selection problem in a decentralized manner, with the objective of maximizing the minimum throughput among all clients.  ...  Accordingly, we propose an online AP association strategy that not only achieves a minimum throughput (among all clients) that is provably close to the optimum, but also works effectively in practice with  ...  Under this situation, our goal is to maximize the minimum throughput over all clients, taking both overall throughput and fairness into consideration.  ... 
doi:10.1109/tpds.2013.10 fatcat:tn3grth7mbd2zcp5cpfspws6rm

Greening data center networks with throughput-guaranteed power-aware routing

Mingwei Xu, Yunfei Shang, Dan Li, Xin Wang
2013 Computer Networks  
We call this kind of routing throughput-guaranteed power-aware routing.  ...  The essence of our idea is to use as little network power as possible to provide the routing service, without significantly compromise on the network performance.  ...  Moreover, given a routing for T, we can easily verify whether it can satisfy the two restrictions of PRP-T in polynomial time. Therefore, PRP-T is an NP-complete problem and then PRP is NP-hard.  ... 
doi:10.1016/j.comnet.2012.12.012 fatcat:ee67275mpnhrri3a3adid62pea

State-Dependent Processing in Payment Channel Networks for Throughput Optimization [article]

Nikolaos Papadis, Leandros Tassiulas
2021 arXiv   pre-print
, which in our case is the channel throughput.  ...  Our work opens the way for more formal research on improving PCN performance via joint consideration of routing and scheduling decisions.  ...  We expect that the same is true when the objective is to maximize the total throughput.  ... 
arXiv:2103.17207v1 fatcat:mqc2pqtk6ndzhnerpy5aigp7xy

Channel Time Allocations and Handoff Management for Fair Throughput in Wireless Mesh Networks

Lei Qin, Dongmei Zhao
2015 IEEE Transactions on Vehicular Technology  
In this thesis, we study how to provide fair throughput for MSs in a WMN by joint channel time allocations and handoff management, where the channel time is allocated at two levels, one among the APs,  ...  On the other hand, in a WMN with a large number of APs and MSs, maintaining the service fairness among the MSs located in different geographical areas and having different mobility patterns can be difficult  ...  Acknowledgements To begin with, I would like to express my sincere gratitude towards my supervisor, Dr.  ... 
doi:10.1109/tvt.2014.2320596 fatcat:4whb5sq3qnconm7frkhqivrsiq
« Previous Showing results 1 — 15 out of 5,616 results