Filters








25,677 Hits in 9.3 sec

Distributed consensus‐based routing protocol with multiple mobile sinks support for wireless sensor network

Nor Azimah Khalid, Quan Bai, Adnan Al‐Anbuky
2021 IET Wireless Sensor Systems  
Thus, a decision based on consensus may benefit more parties and eventually lead to better decision. A distributed collaboration mechanism may assist nodes mobility in improving routing efficiency.  ...  Non-uniform node distribution in a randomly deployed network causes inefficient routing when some abnormality or events at certain parts of the network cannot be detected due to a coverage hole problem  ...  In [33] , a unique distributed blockchain-based contractual routing (BCR) protocol is proposed for a network of untrusted Internet-of-Things (IoT) devices.  ... 
doi:10.1049/wss2.12016 fatcat:43baoqyoibflrg24diwwwdzzky

Make Best-Effort Forwarding upon Network Abnormality

Meijia Hou, Mingwei Xu, Dan Wang, Qi Li
2010 2010 INFOCOM IEEE Conference on Computer Communications Workshops  
From the very first networking course, we learned that the routing of the Internet is best effort. Indeed, the key function of any routing system, by its definition, is to route packets.  ...  From the bottom line, the packets we try to save are those deem to be dropped; we just ask the Internet routing system to make more best-effort for packet delivery.  ... 
doi:10.1109/infcomw.2010.5466630 fatcat:cwvk6whqdbdwjf42di52o4eaee

Users get routed

Aaron Johnson, Chris Wacek, Rob Jansen, Micah Sherr, Paul Syverson
2013 Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13  
Specific contributions of the paper include (1) a model of various typical kinds of users, (2) an adversary model that includes Tor network relays, autonomous systems (ASes), Internet exchange points (  ...  IXPs), and groups of IXPs drawn from empirical study, (3) metrics that indicate how secure users are over a period of time, (4) the most accurate topological model to date of ASes and IXPs as they relate  ...  Acknowledgments We thank Leiah Stevermer for assistance with the user models.  ... 
doi:10.1145/2508859.2516651 dblp:conf/ccs/JohnsonWJSS13 fatcat:asp4u7phkvh75kow5lvggtmgiu

Solving Consensus in Opportunistic Networks

Abdulkader Benchi, Pascale Launay, Frédéric Guidec
2015 Proceedings of the 2015 International Conference on Distributed Computing and Networking - ICDCN '15  
Ensuring the coordination of multiple parts of a distributed application in such conditions is a challenge. This paper presents a system that can solve consensus problems in an opportunistic network.  ...  This system combines an implementation of the One-Third Rule (OTR) algorithm with a communication layer that supports network-wide, content-driven message dissemination based on controlled epidemic routing  ...  Achour Mostéfaoui for his precious insight into distributed computing issues and solutions.  ... 
doi:10.1145/2684464.2684479 dblp:conf/icdcn/BenchiLG15 fatcat:zlhd3z4cgzevjgoa7g35uxzlsm

Internet routing instability

Craig Labovitz, G. Robert Malan, Farnam Jahanian
1997 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication - SIGCOMM '97  
The analysis in this paper is based on data collected from BGP routing messages generated by border routers at five of the Internet core's public exchange points during a nine month period.  ...  This paper examines the network interdomain routing information exchanged between backbone service providers at the major U.S. public Internet exchange points.  ...  The Internet "default-free" routing tables currently contain approximately 45 000 prefixes with 1500 unique ASPATH's interconnecting 1300 different autonomous systems. 5, 6 As shown later in this paper  ... 
doi:10.1145/263105.263151 dblp:conf/sigcomm/LabovitzMJ97 fatcat:tugp7fqtwvesbfreyaemagavem

Internet routing instability

C. Labovitz, G.R. Malan, F. Jahanian
1998 IEEE/ACM Transactions on Networking  
The analysis in this paper is based on data collected from BGP routing messages generated by border routers at five of the Internet core's public exchange points during a nine month period.  ...  This paper examines the network interdomain routing information exchanged between backbone service providers at the major U.S. public Internet exchange points.  ...  The Internet "default-free" routing tables currently contain approximately 45 000 prefixes with 1500 unique ASPATH's interconnecting 1300 different autonomous systems. 5, 6 As shown later in this paper  ... 
doi:10.1109/90.731185 fatcat:sa6kq5ceqndmdoijbluf2s4kxi

Internet routing instability

Craig Labovitz, G. Robert Malan, Farnam Jahanian
1997 Computer communication review  
The analysis in this paper is based on data collected from BGP routing messages generated by border routers at five of the Internet core's public exchange points during a nine month period.  ...  This paper examines the network interdomain routing information exchanged between backbone service providers at the major U.S. public Internet exchange points.  ...  The Internet "default-free" routing tables currently contain approximately 45 000 prefixes with 1500 unique ASPATH's interconnecting 1300 different autonomous systems. 5, 6 As shown later in this paper  ... 
doi:10.1145/263109.263151 fatcat:inhxbifiv5gedlnca77ndu36hy

PaxonDHT: achieving consensus in distributed hash tables

B. Temkow, A.-M. Bosneag, Xinjie Li, M. Brockmeyer
2006 International Symposium on Applications and the Internet (SAINT'06)  
way of their becoming widely accepted as a viable basis for the future generation Internet.  ...  This paper presents PaxonDHT, a Paxos-based middleware service, which ensures with high probability that a dynamic set of replicas reach total order agreement.  ...  PaxonDHT will provide a basis for other services such as those implementing sequential consistency and linearizability in DHT-based systems.  ... 
doi:10.1109/saint.2006.48 dblp:conf/saint/TemkowBLB06 fatcat:asnovozhlfahvk4qb3qgzrfcye

Federated Route Leak Detection in Inter-domain Routing with Privacy Guarantee [article]

Man Zeng, Dandan Li, Pei Zhang, Kun Xie, Xiaohong Huang
2021 arXiv   pre-print
The route leaks can disrupt the internet traffic and cause large outages. The accurately detection of route leaks requires the share of AS business relationship information of ASes.  ...  Motivated by this, in this paper we study the route leak problem by considering the privacy of business relationships between ASes, and propose a method for route leak detection with privacy guarantee  ...  The Internet is modeled as a graph G(V, E) where V is a set of all ASes in the Internet and E represents the direct links between ASes.  ... 
arXiv:2110.07964v1 fatcat:zehsxhecknfbjgpimuio5qdttq

Scaling all-pairs overlay routing

David Sontag, Yang Zhang, Amar Phanishayee, David G. Andersen, David Karger
2009 Proceedings of the 5th international conference on Emerging networking experiments and technologies - CoNEXT '09  
We apply this algorithm to a Resilient Overlay Network (RON) system, and evaluate the results using a large-scale, globally distributed set of Internet hosts.  ...  This paper presents and experimentally evaluates a new algorithm for efficient one-hop link-state routing in full-mesh networks.  ...  David Andersen and Amar Phanishayee were funded in part by the National Science Foundation under award CNS-0716273. David Karger was supported by a grant from the National Science Foundation.  ... 
doi:10.1145/1658939.1658956 dblp:conf/conext/SontagZPAK09 fatcat:awcow2sg6rddpm5lhspyy5t2zm

Securing Internet Applications from Routing Attacks [article]

Yixin Sun, Maria Apostolaki, Henry Birge-Lee, Laurent Vanbever, Jennifer Rexford, Mung Chiang, Prateek Mittal
2020 arXiv   pre-print
Yet, a strategic adversary can use routing attacks to compromise the security of critical Internet applications like Tor, certificate authorities, and the bitcoin network.  ...  Attacks on Internet routing are typically viewed through the lens of availability and confidentiality, assuming an adversary that either discards traffic or performs eavesdropping.  ...  How Bitcoin Works Bitcoin is a peer-to-peer network in which nodes use consensus mechanisms to jointly agree on a (distributed) log of all the transactions that ever happened.  ... 
arXiv:2004.09063v3 fatcat:6ibiwra7fzclfato3hpz2wfdg4

Emergent Consensus in Decentralised Systems Using Collaborative Reinforcement Learning [chapter]

Jim Dowling, Raymond Cunningham, Anthony Harrington, Eoin Curran, Vinny Cahill
2005 Lecture Notes in Computer Science  
In this paper, we describe the application of CRL to two different distributed system problems, a routing protocol for ad-hoc networks called SAMPLE and a next generation urban traffic control system called  ...  This paper describes the application of a decentralised coordination algorithm, called Collaborative Reinforcement Learning (CRL), to two different distributed system problems.  ...  We believe this decentralisation is best attained by modelling individual junctions as agents and allowing consensus to emerge between cooperating agents on a suitable system control strategy.  ... 
doi:10.1007/11428589_5 fatcat:ohc3zuxqb5e6vegujb6u2bt5sm

Origins of Internet routing instability

C. Labovitz, G.R. Malan, F. Jahanian
1999 IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320)  
This paper examines the network routing messages exchanged between core Internet backbone routers.  ...  We show that as a result of specific router vendor software changes suggested by our earlier analysis, the volume of Internet routing updates has decreased by an order of magnitude.  ...  We also thank the INFOCOM '99 anonymous referees for their feedback and constructive criticism.  ... 
doi:10.1109/infcom.1999.749286 dblp:conf/infocom/LabovitzMJ99 fatcat:unkoojyt2bdt5kyx7ulvrbdcbm

Best practices in automation security

Murray McKay
2012 2012 IEEE-IAS/PCA 54th Cement Industry Technical Conference  
Requirements for MIS and MES integration with the control system, as well as program backup and maintenance activities eliminate the possibility of security through lack of connectivity.  ...  While the number of actual attacks on automation systems has been small, the tools needed to conduct these attacks are now loose in the "wild", and the potential losses from an attack are large.  ...  This can be as simple as a mechanical timer switch attached to the power of the remote access routing device.  ... 
doi:10.1109/citcon.2012.6215678 fatcat:6tbvflcaxnbfhbukvlo5dxlzte

Routing-aware partitioning of the internet address space for server ranking in CDNs

Gonca Gürsun
2017 Computer Communications  
We show that there is a strong correlation between the similarity in how two destination clients are routed to in the Internet and the similarity in their server selections.  ...  In this paper, we address this problem and propose a framework to scale the task of path monitoring.  ...  We also thank the anonymous referees for their reviews.  ... 
doi:10.1016/j.comcom.2017.02.012 fatcat:5dqo4yorgfhnfdavrhebcneaue
« Previous Showing results 1 — 15 out of 25,677 results