commit 7173ae07264593ecd2ca9e5bec2954a2c7e05d51
parent 60af6afd6b87515064bb9a92c2b2ce2f53184a45
Author: Nils Gillmann <ng0@n0.is>
Date: Thu, 4 Oct 2018 23:18:58 +0000
All date warnings fixed.
Signed-off-by: Nils Gillmann <ng0@n0.is>
Diffstat:
1 file changed, 9 insertions(+), 9 deletions(-)
diff --git a/gnunetbib.bib b/gnunetbib.bib
@@ -2904,7 +2904,7 @@ In this paper we establish the optimal trade-off between the round complexity an
title = {Performance Evaluation of On-Demand Multipath Distance Vector Routing Protocol under Different Traffic Models},
booktitle = {International Conference on Advances in Recent Technologies in Communication and Computing, 2009. ARTCom {\textquoteright}09},
year = {2009},
- month = october,
+ month = oct,
pages = {77-80},
abstract = {Traffic models are the heart of any performance evaluation of telecommunication networks. Understanding the nature of traffic in high speed, high bandwidth communication system is essential for effective operation and performance evaluation of the networks. Many routing protocols reported in the literature for Mobile ad hoc networks(MANETS) have been primarily designed and analyzed under the assumption of CBR traffic models, which is unable to capture the statistical characteristics of the actual traffic. It is necessary to evaluate the performance properties of MANETs in the context of more realistic traffic models. In an effort towards this end, this paper evaluates the performance of adhoc on demand multipath distance vector (AOMDV) routing protocol in the presence of poisson and bursty self similar traffic and compares them with that of CBR traffic. Different metrics are considered in analyzing the performance of routing protocol including packet delivery ratio, throughput and end to end delay. Our simulation results indicate that the packet delivery fraction and throughput in AOMDV is increased in the presence of self similar traffic compared to other traffic. Moreover, it is observed that the end to end delay in the presence of self similar traffic is lesser than that of CBR and higher than that of poisson traffic},
keywords = {ad-hoc networks, AOMDV, distance vector, multi-path, performance},
@@ -11014,7 +11014,7 @@ While technically and conceptually simple, universal re-encryption leads to new
journal = { IEEE Journal on Selected Areas in Communications },
volume = {21},
year = {2003},
- month = {Aug. 2003},
+ month = aug,
pages = {995-1002},
abstract = {Scheme to build dynamic, distributed P2P networks of constant degree and logarithmic diameter},
url = {http://www.cs.brown.edu/people/eli/papers/focs01.pdf},
@@ -12573,7 +12573,7 @@ Placing application-dedicated functionality within the network requires a flexib
journal = {IEEE Trans. Information Theory},
volume = {48},
year = {2002},
- month = {12/2002 },
+ month = dec,
pages = {3017{\textendash}3028},
abstract = {This paper starts a systematic study of capacity-achieving sequences of low-density paritycheck codes for the erasure channel. We introduce a class A of analytic functions and develop a procedure to obtain degree distributions for the codes. We showvarious properties of this class which will help us construct new distributions from old ones. We then study certain types of capacity-achieving sequences and introduce new measures for their optimality. For instance, it turns out that the right-regular sequence is capacity-achieving in a much stronger sense than, e.g., the Tornado sequence. This also explains why numerical optimization techniques tend to favor graphs with only one degree of check nodes. Using our methods, we attack the problem of reducing the fraction of degree 2 variable nodes, which has important practical implications. It turns out that one can produce capacity achieving sequences for which this fraction remains below any constant, albeit at the price of slower convergence to capacity},
keywords = {coding theory, low-density parity-check},
@@ -12777,7 +12777,7 @@ Placing application-dedicated functionality within the network requires a flexib
title = {Distributed Data Location in a Dynamic Network},
number = {UCB/CSD-02-1178},
year = {2002},
- month = april,
+ month = apr,
publisher = {EECS Department, University of California, Berkeley},
abstract = {Modern networking applications replicate data and services widely, leading to a need for location-independent routing {\textendash} the ability to route queries directly to objects using names that are independent of the objects{\textquoteright} physical locations. Two important properties of a routing infrastructure are routing locality and rapid adaptation to arriving and departing nodes. We show how these two properties can be achieved with an efficient solution to the nearest-neighbor problem. We present a new distributed algorithm that can solve the nearest-neighbor problem for a restricted metric space. We describe our solution in the context of Tapestry, an overlay network infrastructure that employs techniques proposed by Plaxton, Rajaraman, and Richa},
url = {http://www.eecs.berkeley.edu/Pubs/TechRpts/2002/5214.html},
@@ -12918,7 +12918,7 @@ in the different DHT routing protocols. We conclude that proximity neighbor sele
journal = {ACM SIGOPS Operating Systems Review},
volume = {36},
year = {2002},
- month = {12/2002 },
+ month = dec,
pages = {1{\textendash}14},
publisher = {ACM},
address = {New York, NY, USA},
@@ -13282,7 +13282,7 @@ Randomized partial checking is particularly well suited for voting systems, as i
title = {A Measurement Study of Peer-to-Peer File Sharing Systems},
booktitle = { Multimedia Computing and Networking (MMCN),},
year = {2002},
- month = {January 2002},
+ month = jan,
address = {San Jose},
url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.61.4223\&rep=rep1\&type=pdf},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/mmcn.pdf},
@@ -13471,7 +13471,7 @@ We further investigate this intriguing proposal. Specifically, we
booktitle = {Proceedings of the 2002 SIGCOMM conference},
volume = {Volume 32 , Issue 4},
year = {2002},
- month = {October 2002},
+ month = oct,
pages = {177{\textendash}190},
publisher = {ACM New York, NY, USA},
organization = {ACM New York, NY, USA},
@@ -14450,7 +14450,7 @@ This compilation represents the collected wisdom of today{\textquoteright}s peer
title = {Responder Anonymity and Anonymous Peer-to-Peer File Sharing},
booktitle = {Network Protocols, 2001. Ninth International Conference on },
year = {2001},
- month = {11-14 Nov. 2001},
+ month = nov,
abstract = {Data transfer over TCP/IP provides no privacy for network users. Previous research in anonymity has focused on the provision of initiator anonymity. We explore methods of adapting existing initiator-anonymous protocols to provide responder anonymity and mutual anonymity. We present Anonymous Peer-to-peer File Sharing (APFS) protocols, which provide mutual anonymity for peer-topeer le sharing. APFS addresses the problem of longlived Internet services that may outlive the degradation present in current anonymous protocols. One variant of APFS makes use of unicast communication, but requires a central coordinator to bootstrap the protocol. A second variant takes advantage of multicast routing to remove the need for any central coordination point. We compare the TCP performance of APFS protocol to existing overt le sharing systems such as Napster. In providing anonymity, APFS can double transfer times and requires that additional trac be carried by peers, but this overhead is constant with the size of the session. 1},
keywords = {anonymity, APFS, multicast},
isbn = {0-7695-1429-4 },
@@ -14793,7 +14793,7 @@ This book focuses on the principal-agent model, the "simple" situation where a p
title = {Freenet: A Distributed Anonymous Information Storage and Retrieval System},
booktitle = {Designing Privacy Enhancing Technologies, International Workshop on Design Issues in Anonymity and Unobservability, ,, Proceedings 2001},
year = {2000},
- month = { July 25-26, 200},
+ month = jul,
pages = {46{\textendash}66},
address = {Berkeley, CA, USA},
abstract = {We describe Freenet, an adaptive peer-to-peer network application that permits the publication, replication, and retrieval of data while protecting the anonymity of both authors and readers. Freenet operates as a network of identical nodes that collectively pool their storage space to store data files and cooperate to route requests to the most likely physical location of data. No broadcast search or centralized location index is employed. Files are referred to in a location-independent manner, and are dynamically replicated in locations near requestors and deleted from locations where there is no interest. It is infeasible to discover the true origin or destination of a file passing through the network, and di$\#$cult for a node operator to determine or be held responsible for the actual physical contents of her own node.}
