Filters








7,403 Hits in 3.9 sec

Competitive Packet Routing with Priority Lists

Tobias Harks, Britta Peis, Daniel Schmand, Bjoern Tauer, Laura Vargas Koch
2018 ACM Transactions on Economics and Computation  
In competitive packet routing games, packets are routed selfishly through a network and scheduling policies at edges determine which packages are forwarded first if there is not enough capacity on an edge  ...  ., for routing on a tree, the computation of an optimal priority list is APX-hard.  ...  For local priority lists, we derive the following upper bound on the price of anarchy. 49:10 Competitive Packet Routing with Priority Lists Theorem 3.5.  ... 
doi:10.1145/3184137 fatcat:ycbw2obd6nb65me5fztzrejlzm

Competitive Packet Routing with Priority Lists

Tobias Harks, Britta Peis, Daniel Schmand, Laura Koch
unpublished
In competitive packet routing games, packets are routed selfishly through a network and scheduling policies at edges determine which packages are forwarded first if there is not enough capacity on an edge  ...  ., for routing on a tree, the computation of an optimal priority list is APX-hard.  ...  For local priority lists, we derive the following upper bound on the price of anarchy. 49:10 Competitive Packet Routing with Priority Lists Theorem 3.5.  ... 
fatcat:3yw46kuszncvvekjpj3p4jup2y

Oligopolistic Competitive Packet Routing

Britta Peis, Bjoern Tauer, Veerle Timmermans, Laura Vargas Koch, Michael Wagner
2018 Algorithmic Approaches for Transportation Modeling, Optimization, and Systems  
Oligopolistic competitive packet routing games model situations in which traffic is routed in discrete units through a network over time.  ...  We study a game-theoretic variant of packet routing, where in contrast to classical packet routing, we are lacking a central authority to decide on an oblivious routing protocol.  ...  We call these games oligopolistic competitive packet routing games to distinguish between our model and the model of competitive packet routing games investigated in [6] .  ... 
doi:10.4230/oasics.atmos.2018.13 dblp:conf/atmos/PeisTTK18 fatcat:ek33e2s6cratxh6p64h4cfryie

Wireless ad-hoc Network Routing Protocol Research

Liu Li
2014 International Journal of Future Generation Communication and Networking  
and update "existing active distance vector Routing protocols DSDV Routing protocol including target list (Destination a sequeneedDistanee Veetorprotoeol), wireless Routing protocol WRP (wireless Routing  ...  Through the simulation analysis of the its superiority compared with other certainty path as the routing protocol, gives the performance characteristics of its transmission in different environments.  ...  Is used for the data packet forwarding nodes according to the priorities set delay timer, the method of high priority to low priority nodes forward linear reduce waiting time, this routing algorithm with  ... 
doi:10.14257/ijfgcn.2014.7.2.15 fatcat:lkw6fxcch5d2degleo6if3dnbm

Theorem proving techniques for the formal verification of NoC communications with non-minimal adaptive routing

Amr Helmy, Laurence Pierre, Axel Jantsch
2010 13th IEEE Symposium on Design and Diagnostics of Electronic Circuits and Systems  
We prove that packets arrive properly and that packets are never lost. Also, we prove the soundness of the Nostrum data link, network and transport layers.  ...  We describe how an enhanced version of the GeNoC proof methodology has been applied to the Nostrum NoC which encompasses various non-trivial features such as a deflective non-minimal routing algorithm.  ...  Then, packets are ordered according to a priority function. Packets pick their favored output port in the order determined by their priority.  ... 
doi:10.1109/ddecs.2010.5491781 dblp:conf/ddecs/HelmyPJ10 fatcat:kdmrhc5c6zfadaockqmdsdvjla

A Competition-based Algorithm for Routing Discovery and Repair in Large-scale VANET

2017 KSII Transactions on Internet and Information Systems  
We propose a novel routing mechanism to address the issue in the paper, which includes a competition-based routing discovery with priority metrics and a local routing repair strategy.  ...  In the routing discovery stage, the algorithm uses adaptive scheme to select a stable route by the priorities of routing metrics, which are the length of each hop, as well as the residual lifetime of each  ...  Among all candidate nodes, the one with the maximal competing parameter can become a forwarding node with the highest priority. Various 𝛼𝛼 means different bias to two competition parameters.  ... 
doi:10.3837/tiis.2017.12.003 fatcat:mvkdshdwavdpxei3n7iysu5vee

A service-differentiated real-time communication scheme for wireless sensor networks

Yuyan Xue, Byrav Ramamurthy, Mehmet C. Vuran
2008 2008 33rd IEEE Conference on Local Computer Networks (LCN)  
We use dynamic forwarding with load-balanced receiver contention to provide a light-weight, yet efficient, routing technique, which can be easily adapted for duty cycle design.  ...  We use hop-based geographic grouping to enable location awareness for sensor nodes with extremely low control overhead.  ...  MMSPEED [2] and SPEED [3] also use neighbor lists for packet routing.  ... 
doi:10.1109/lcn.2008.4664276 dblp:conf/lcn/XueRV08 fatcat:rov62njmb5b7nnexe74xqv5ixq

5G Wireless Networking Connection and Playback Technology Assist the Low-Latency Propagation of New Media

Xueyong Yu, Guolong Shi
2021 Journal of Sensors  
The protocol designs the corresponding super frame structure and realizes the neighbor node discovery strategy and the time slot allocation based on the priority list.  ...  The order of time slots allocated to each node is ultimately consistent with the new data flow. The order of media dissemination is not the same.  ...  When allocating time slots based on the priority list, the node will consider the degree of competition of the competing nodes and add the fixed priority of the priority list to the degree of competition  ... 
doi:10.1155/2021/3082280 fatcat:ulwf4cvcvraknhkz2yihrmxxaq

On the Exploration of Adaptive Mechanisms Providing Reliability in Clustered WSNs for Power Plant Monitoring

Sathiyaseelan Rathinavel, Vijayakumar Pandi, Audithan Sivaraman
2016 The Scientific World Journal  
Adaptive Priority Routing (APR) is first proposed during the initial design to provide efficiency in next hop selection.  ...  APR computes the priority value for selecting the intermediate nodes during the data transmission in order to improve the packet delivery, throughput, and energy efficiency.  ...  the sink from the forwarding list NL AF with the maximum reliability .  ... 
doi:10.1155/2016/4158735 pmid:26885548 pmcid:PMC4739268 fatcat:iyb6jfgspjhbhm5sb4promprs4

Age-aware Adaptive Routing for Network-on-Chip Routing with Odd-Even Turn Model

M. S Saliu, I. J Umoh, B.O. Sadiq, M.O Momoh
2020 IJEEC - INTERNATIONAL JOURNAL OF ELECTRICAL ENGINEERING AND COMPUTING  
The age-aware adaptive routing uses an age-based arbitration technique that gives priority to oldest packet.  ...  However, there is delay of a packet with a longer path between the source and destination nodes.  ...  For an improved network performance, a routing algorithm with an alternate path to transfer packets is required [8] .  ... 
doi:10.7251/ijeec2002135s fatcat:gv4emj2xw5ft5cj5ked2f4zn5m

Fault-Tolerant Backup Clustering Algorithm for Smart Connected Underwater Sensor Networks [article]

Abdulazeez Femi Salami, Emmanuel Adewale Adedokun, Habeeb Bello-Salau, Bashir Olaniyi Sadiq
2022 arXiv   pre-print
Performance indicators adopted for this evaluation are routing overhead (Ω), end to end delay (Δ), CH failures recovered (CFR), CH failures detected (CFD), received packets (θ), and energy consumption  ...  Obtained results show that operating with a CH retention period of 90s achieves better CH duty cycling per round and improves the MPCF process with values of 25.69 and 60 EEHTAC was evaluated relative  ...  Subsequently, POLLING packets are broadcasted by the newly-voted Primary CHs. POLLING packet includes AVBTAG, competition cluster radius, layer number, priority tag, and residual energy information.  ... 
arXiv:2203.02187v1 fatcat:z5xxnwtlevab7kja3z4lg2t7h4

FAULT-TOLERANT BACKUP CLUSTERING ALGORITHM FOR SMART CONNECTED UNDERWATER SENSOR NETWORKS

Abdulazeez Femi Salami, Emmanuel Adewale Adedokun, Habeeb Bello-Salau, Bashir Olaniyi Sadiq
2022 International Journal of Software Engineering and Computer Systems  
Performance indicators adopted for this evaluation are routing overhead (Ω), end to end delay (Δ), CH failures recovered (CFR), CH failures detected (CFD), received packets (θ), and energy consumption  ...  Obtained results show that operating with a CH retention period of 90s achieves better CH duty cycling per round and improves the MPCF process with values of 25.69%, 55.56%, and 60% for TTVR, CLD, and  ...  POLLING packet includes AVB TAG , competition cluster radius, layer number, priority tag, and residual energy information.  ... 
doi:10.15282/ijsecs.8.1.2022.4.0094 fatcat:hbcxnlq6izacxcwcuad6silhee

Deterministic many-to-many hot potato routing

A. Borodin, Y. Rabani, B. Schieber
1997 IEEE Transactions on Parallel and Distributed Systems  
We consider algorithms for many-to-many hot potato routing. In hot potato (deflection) routing a packet cannot be buffered, and is therefore always moving until it reaches its destination.  ...  We give optimal and nearly optimal deterministic algorithms for many-tomany packet routing in commonly occurring networks such as the hypercube, meshes and tori of various dimensions and sizes, trees and  ...  Each packet competes for the first possibility on its list. The priority of each packet is determined by the size of its interval with respect to this possibility, ties broken arbitrarily.  ... 
doi:10.1109/71.595575 fatcat:qd4vkjkstvfq3hcedgjt2khirq

An integrated MAC protocol based on DMAC for emergency priority

Zuofei Tan, Ren Deng, Xiaofu Wei, Chenghao Yu
2018 Review of Computer Engineer Studies  
In this new algorithm, a control information transmission scheduling was added to improve ST-MAC's data transmission mechanism and a method of emergency priority is provided to ST-MAC to decrease the waiting  ...  This phenomenon lead to more serious network congestion and higher packet loss probability. These series of problems are known as "hot area" effect.  ...  In the control packet transmission stage, each node identifies current routing by the primary routing list (PRL), which is shown as the full arrows in Figure 4 (a).  ... 
doi:10.18280/rces.050402 fatcat:kq4bcac7xneaxmzijur6jwouzu

Etdwsn An Method For Energy Efficiency Increase By Combining The Index Parameters In Wireless Sensor Networks

Fatollah Rouhi, Arash Ghorbannia Delavar, Sina Hedayati
2014 Journal of Mathematics and Computer Science  
weight goal we've provided compared with neighboring nodes selection action relative to the source node, we improve the routing space finally The average delay time of the nodes to the Auto GBR،GBR ،  ...  The development of routing algorithms in wireless sensor networks, energy supply increase in the dependent nodes is by viewing the previous algorithms on the data-centric routing algorithm, the method  ...  with a lower value equals is the node with more weight.As a result, it is Priority to select the source node Finally the selected candidate node sending packet to sink a nd sending final ACK to source  ... 
doi:10.22436/jmcs.011.03.01 fatcat:l4zwcymebbd7xbhz2odm5vb4ze
« Previous Showing results 1 — 15 out of 7,403 results