commit b43e786aae9c1d62f7dcfa62a6ed77ba5e9f7783
parent ed74fd73a3cfb06322f2e883ac327f28e0e3543e
Author: Nils Gillmann <ng0@n0.is>
Date: Sun, 7 Oct 2018 18:08:26 +0000
add 'unknown' author to records without authors.
Signed-off-by: Nils Gillmann <ng0@n0.is>
Diffstat:
1 file changed, 7 insertions(+), 0 deletions(-)
diff --git a/gnunetbib.bib b/gnunetbib.bib
@@ -2927,6 +2927,7 @@ In this paper we establish the optimal trade-off between the round complexity an
year = {2009},
abstract = {Distributed services are a special case of P2P networks where nodes have several distinctive tasks. Based on previous work, we show how UNISONO provides a way to optimize these services to increase performance, efficiency and user experience. UNISONO is a generic framework for host-based distributed network measurements. In this talk, we present UNISONO as an Enabler for self-organizing Service Delivery Plattforms. We give a short overview of the UNISONO concept and show how distributed services benefit from its usage},
keywords = {distributed systems, P2P},
+ author = {unknown},
www_section = {http://www.net.in.tum.de/de/mitarbeiter/holz/},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/unisono_kuvs-ngn.pdf}
}
@@ -3195,6 +3196,7 @@ mous communication},
year = {2009},
abstract = {Many standards and even more proprietary technologies deal with IP-based television (IPTV). But none of them can transparently map popular public broadcast services such as DVB or ATSC to IPTV with acceptable effort. In this paper we explain why we believe that such a mapping using a light weight framework is an important step towards all-IP multimedia. We then present the NetCeiver architecture: it is based on well-known standards such as IPv6, and it allows zero configuration. The use of multicast streaming makes NetCeiver highly scalable. We also describe a low cost FPGA implementation of the proposed NetCeiver architecture, which can concurrently stream services from up to six full transponders},
keywords = {DVB, IPTV, multicast},
+ author = {unknown},
doi = {10.1155/2009/617203},
www_section = {http://www.hindawi.com/journals/ijdmb/2009/617203.html},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/617203.pdf},
@@ -3677,6 +3679,7 @@ To evaluate our novel attack, we used a real-world anonymizing system, TOR. We s
address = {Karlsruhe, Germany},
abstract = {Working in distributed systems is part of the information society. More and more people and organizations work with growing data volumes.
Often, part of the problem is to access large files in a share way. Until now, there are two often used approaches to allow this kind off access. Either the files are tranfered via FTP, e-mail or similar medium before the access happens, or a centralized server provides file services. The first alternative has the disadvantage that the entire file has to be transfered before the first access can be successful. If only small parts in the file have been changed compared to a previous version, the entire file has to be transfered anyway. The centralized approach has disadvantages regarding scalability and reliability. In both approaches authorization and authentication can be difficult in case users are seperated by untrusted network segements},
+ author = {unknown},
www_section = {http://digbib.ubka.uni-karlsruhe.de/volltexte/1000009668},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/Kutzner\%20-\%20The\%20descentralized\%20file\%20system\%20Igor-FS\%20as\%20an\%20application_0.pdf}
}
@@ -7373,6 +7376,7 @@ two shallow circuits: one for generating many arbitrarily but identically biased
month = sep,
abstract = {Routing in wireless networks is inherently difficult since their network topologies are typically unstructured and unstable. Therefore, many routing protocols for ad-hoc networks and sensor networks revert to flooding to acquire routes to previously unknown destinations. However, such an approach does not scale to large networks, especially when nodes need to communicate with many different destinations. This paper advocates a novel approach, the scalable source routing (SSR) protocol. It combines overlay-like routing in a virtual network structure with source routing in the physical network structure. As a consequence, SSR can efficiently provide the routing semantics of a structured routing overlay, making it an efficient basis for the scalable implementation of fully decentralized applications. In T. Fuhrmann (2005) it has been demonstrated that SSR can almost entirely avoid flooding, thus leading to a both memory and message efficient routing mechanism for large unstructured networks. This paper extends SSR to unstable networks, i. e. networks with churn where nodes frequently join and leave, the latter potentially ungracefully},
keywords = {ad-hoc networks, scalable source routing},
+ author = {unknown},
isbn = {1-4244-0626-9 },
doi = {10.1109/SAHCN.2006.288406 },
www_section = {http://ieeexplore.ieee.org/Xplore/login.jsp?url=http\%3A\%2F\%2Fieeexplore.ieee.org\%2Fiel5\%2F4068086\%2F4068087\%2F04068105.pdf\%3Farnumber\%3D4068105\&authDecision=-203}
@@ -8684,6 +8688,7 @@ We introduce and implement Obfuscated Ciphertext Mixing, the obfuscation of a mi
keywords = {distributed hash table, openDHT, peer-to-peer, resource allocation},
isbn = {1-59593-009-4},
doi = {10.1145/1080091.1080102},
+ author = {unknown},
www_section = {http://doi.acm.org/10.1145/1080091.1080102},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/openDHT.pdf}
}
@@ -10289,6 +10294,7 @@ Parallel re-encryption mixnets offer security guarantees comparable to those of
title = {A Peer-to-Peer File Sharing System for Wireless Ad-Hoc Networks},
year = {2004},
abstract = {File sharing in wireless ad-hoc networks in a peer to peer manner imposes many challenges that make conventional peer-to-peer systems operating on wire-line networks inapplicable for this case. Information and workload distribution as well as routing are major problems for members of a wireless ad-hoc network, which are only aware of their neighborhood. In this paper we propose a system that solves peer-to-peer filesharing problem for wireless ad-hoc networks. Our system works according to peer-to-peer principles, without requiring a central server, and distributes information regarding the location of shared files among members of the network. By means of a {\textquotedblleft}hashline{\textquotedblright} and forming a tree-structure based on the topology of the network, the system is able to answer location queries, and also discover and maintain routing information that is used to transfer files from a source-peer to another peer},
+ author = {unknown},
keywords = {ad-hoc networks, file systems, P2P},
www_pdf_url = {https://gnunet.org/git/bibliography.git/tree/docs/10.1.1.124.9928.pdf},
editor = {Hasan S{\"o}zer and Metin Kekkalmaz and Ibrahim K{\"o}rpeoglu}
@@ -14098,6 +14104,7 @@ In this paper, we propose a new cryptographic le system, which we call TCFS , as
@article {2001_1,
title = {DVD COPY CONTROL ASSOCIATION vs. ANDREW BUNNER},
journal = {unknown},
+ author = {unknown},
year = {2001}
}
@article {Luby01efficienterasure,
