[{"series_title":"Lecture Notes in Computer Science","user_id":"15504","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"477","file_date_updated":"2018-03-15T14:06:38Z","ddc":["040"],"type":"conference","publication":"Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers","file":[{"file_size":193169,"file_id":"1325","file_name":"477-geometric-dynamic-networks_01.pdf","access_level":"closed","date_updated":"2018-03-15T14:06:38Z","date_created":"2018-03-15T14:06:38Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","abstract":[{"text":"We consider the k-token dissemination problem, where k initially arbitrarily distributed tokens have to be disseminated to all nodes in a dynamic network (as introduced by Kuhn et al., STOC 2010). In contrast to general dynamic networks, our dynamic networks are unit disk graphs, i.e., nodes are embedded into the Euclidean plane and two nodes are connected if and only if their distance is at most R. Our worst-case adversary is allowed to move the nodes on the plane, but the maximum velocity v_max of each node is limited and the graph must be connected in each round. For this model, we provide almost tight lower and upper bounds for k-token dissemination if nodes are restricted to send only one token per round. It turns out that the maximum velocity v_max is a meaningful parameter to characterize dynamics in our model.","lang":"eng"}],"date_created":"2017-10-17T12:42:25Z","author":[{"first_name":"Sebastian","full_name":"Abshoff, Sebastian","last_name":"Abshoff"},{"last_name":"Benter","full_name":"Benter, Markus","first_name":"Markus"},{"first_name":"Andreas","full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr"},{"full_name":"Malatyali, Manuel","last_name":"Malatyali","first_name":"Manuel"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}],"date_updated":"2022-01-06T07:01:21Z","doi":"10.1007/978-3-642-45346-5_3","title":"Token Dissemination in Geometric Dynamic Networks","has_accepted_license":"1","citation":{"apa":"Abshoff, S., Benter, M., Cord-Landwehr, A., Malatyali, M., &#38; Meyer auf der Heide, F. (2013). Token Dissemination in Geometric Dynamic Networks. In <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers</i> (pp. 22–34). <a href=\"https://doi.org/10.1007/978-3-642-45346-5_3\">https://doi.org/10.1007/978-3-642-45346-5_3</a>","bibtex":"@inproceedings{Abshoff_Benter_Cord-Landwehr_Malatyali_Meyer auf der Heide_2013, series={Lecture Notes in Computer Science}, title={Token Dissemination in Geometric Dynamic Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-45346-5_3\">10.1007/978-3-642-45346-5_3</a>}, booktitle={Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers}, author={Abshoff, Sebastian and Benter, Markus and Cord-Landwehr, Andreas and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2013}, pages={22–34}, collection={Lecture Notes in Computer Science} }","short":"S. Abshoff, M. Benter, A. Cord-Landwehr, M. Malatyali, F. Meyer auf der Heide, in: Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers, 2013, pp. 22–34.","mla":"Abshoff, Sebastian, et al. “Token Dissemination in Geometric Dynamic Networks.” <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers</i>, 2013, pp. 22–34, doi:<a href=\"https://doi.org/10.1007/978-3-642-45346-5_3\">10.1007/978-3-642-45346-5_3</a>.","chicago":"Abshoff, Sebastian, Markus Benter, Andreas Cord-Landwehr, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “Token Dissemination in Geometric Dynamic Networks.” In <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers</i>, 22–34. Lecture Notes in Computer Science, 2013. <a href=\"https://doi.org/10.1007/978-3-642-45346-5_3\">https://doi.org/10.1007/978-3-642-45346-5_3</a>.","ieee":"S. Abshoff, M. Benter, A. Cord-Landwehr, M. Malatyali, and F. Meyer auf der Heide, “Token Dissemination in Geometric Dynamic Networks,” in <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers</i>, 2013, pp. 22–34.","ama":"Abshoff S, Benter M, Cord-Landwehr A, Malatyali M, Meyer auf der Heide F. Token Dissemination in Geometric Dynamic Networks. In: <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers</i>. Lecture Notes in Computer Science. ; 2013:22-34. doi:<a href=\"https://doi.org/10.1007/978-3-642-45346-5_3\">10.1007/978-3-642-45346-5_3</a>"},"page":"22-34","year":"2013"},{"type":"journal_article","status":"public","department":[{"_id":"183"}],"user_id":"477","_id":"480","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Subproject A4","_id":"8"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file_date_updated":"2018-03-15T14:02:36Z","has_accepted_license":"1","intvolume":"        83","page":"101-119","citation":{"bibtex":"@article{Frick_Simmons_2013, title={The Impact of Individual and Collective Reputation on Wine Prices: Empirical Evidence from the Mosel Valley}, volume={83}, DOI={<a href=\"https://doi.org/10.1007/s11573-013-0652-x\">10.1007/s11573-013-0652-x</a>}, number={2}, journal={Journal of Business Economics}, publisher={Springer}, author={Frick, Bernd and Simmons, Robert}, year={2013}, pages={101–119} }","mla":"Frick, Bernd, and Robert Simmons. “The Impact of Individual and Collective Reputation on Wine Prices: Empirical Evidence from the Mosel Valley.” <i>Journal of Business Economics</i>, vol. 83, no. 2, Springer, 2013, pp. 101–19, doi:<a href=\"https://doi.org/10.1007/s11573-013-0652-x\">10.1007/s11573-013-0652-x</a>.","short":"B. Frick, R. Simmons, Journal of Business Economics 83 (2013) 101–119.","apa":"Frick, B., &#38; Simmons, R. (2013). The Impact of Individual and Collective Reputation on Wine Prices: Empirical Evidence from the Mosel Valley. <i>Journal of Business Economics</i>, <i>83</i>(2), 101–119. <a href=\"https://doi.org/10.1007/s11573-013-0652-x\">https://doi.org/10.1007/s11573-013-0652-x</a>","chicago":"Frick, Bernd, and Robert Simmons. “The Impact of Individual and Collective Reputation on Wine Prices: Empirical Evidence from the Mosel Valley.” <i>Journal of Business Economics</i> 83, no. 2 (2013): 101–19. <a href=\"https://doi.org/10.1007/s11573-013-0652-x\">https://doi.org/10.1007/s11573-013-0652-x</a>.","ieee":"B. Frick and R. Simmons, “The Impact of Individual and Collective Reputation on Wine Prices: Empirical Evidence from the Mosel Valley,” <i>Journal of Business Economics</i>, vol. 83, no. 2, pp. 101–119, 2013.","ama":"Frick B, Simmons R. The Impact of Individual and Collective Reputation on Wine Prices: Empirical Evidence from the Mosel Valley. <i>Journal of Business Economics</i>. 2013;83(2):101-119. doi:<a href=\"https://doi.org/10.1007/s11573-013-0652-x\">10.1007/s11573-013-0652-x</a>"},"volume":83,"author":[{"full_name":"Frick, Bernd","last_name":"Frick","first_name":"Bernd"},{"first_name":"Robert","last_name":"Simmons","full_name":"Simmons, Robert"}],"date_updated":"2022-01-06T07:01:24Z","doi":"10.1007/s11573-013-0652-x","publication":"Journal of Business Economics","file":[{"date_created":"2018-03-15T14:02:36Z","creator":"florida","date_updated":"2018-03-15T14:02:36Z","access_level":"closed","file_name":"480-Frick.pdf","file_id":"1322","file_size":371437,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"text":"Although of considerable practical importance, the separate impact of individual and collective reputation on firm performance (e.g. product prices) has not yet been convincingly demonstrated. We use a sample of some 70 different wineries offering more than 1,300 different Riesling wines from the Mosel valley to isolate the returns to individual reputation (measured by expert ratings in a highly respected wine guide) from the returns to collective reputation (measured by membership in two different professional associations where members are assumed to monitor each other very closely). We find that both effects are statistically significant and economically relevant with the latter being more important in quantitative terms than the former.","lang":"eng"}],"language":[{"iso":"eng"}],"ddc":["040"],"issue":"2","year":"2013","date_created":"2017-10-17T12:42:25Z","publisher":"Springer","title":"The Impact of Individual and Collective Reputation on Wine Prices: Empirical Evidence from the Mosel Valley"},{"doi":"10.1109/ICC.2013.6655082","title":"Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case","author":[{"first_name":"Kalman","last_name":"Graffi","full_name":"Graffi, Kalman"},{"first_name":"Lars","last_name":"Bremer","full_name":"Bremer, Lars"}],"date_created":"2017-10-17T12:42:26Z","date_updated":"2022-01-06T07:01:25Z","page":"3444 - 3449 ","citation":{"chicago":"Graffi, Kalman, and Lars Bremer. “Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case.” In <i>Proceedings of the International Conference on Communications (ICC’13)</i>, 3444–49, 2013. <a href=\"https://doi.org/10.1109/ICC.2013.6655082\">https://doi.org/10.1109/ICC.2013.6655082</a>.","ieee":"K. Graffi and L. Bremer, “Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case,” in <i>Proceedings of the International Conference on Communications (ICC’13)</i>, 2013, pp. 3444–3449.","ama":"Graffi K, Bremer L. Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case. In: <i>Proceedings of the International Conference on Communications (ICC’13)</i>. ; 2013:3444-3449. doi:<a href=\"https://doi.org/10.1109/ICC.2013.6655082\">10.1109/ICC.2013.6655082</a>","bibtex":"@inproceedings{Graffi_Bremer_2013, title={Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case}, DOI={<a href=\"https://doi.org/10.1109/ICC.2013.6655082\">10.1109/ICC.2013.6655082</a>}, booktitle={Proceedings of the International Conference on Communications (ICC’13)}, author={Graffi, Kalman and Bremer, Lars}, year={2013}, pages={3444–3449} }","mla":"Graffi, Kalman, and Lars Bremer. “Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case.” <i>Proceedings of the International Conference on Communications (ICC’13)</i>, 2013, pp. 3444–49, doi:<a href=\"https://doi.org/10.1109/ICC.2013.6655082\">10.1109/ICC.2013.6655082</a>.","short":"K. Graffi, L. Bremer, in: Proceedings of the International Conference on Communications (ICC’13), 2013, pp. 3444–3449.","apa":"Graffi, K., &#38; Bremer, L. (2013). Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case. In <i>Proceedings of the International Conference on Communications (ICC’13)</i> (pp. 3444–3449). <a href=\"https://doi.org/10.1109/ICC.2013.6655082\">https://doi.org/10.1109/ICC.2013.6655082</a>"},"year":"2013","has_accepted_license":"1","file_date_updated":"2018-03-15T14:02:01Z","language":[{"iso":"eng"}],"ddc":["040"],"department":[{"_id":"79"}],"user_id":"477","_id":"481","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-15T14:02:01Z","creator":"florida","date_created":"2018-03-15T14:02:01Z","file_size":1405789,"access_level":"closed","file_name":"481-Symbiotic.Coupling.of.P2P.and.Cloud.Systems.The.Wikipedia.Case2.pdf","file_id":"1321"}],"abstract":[{"text":"Cloud computing offers high availability, dynamic scalability, and elasticity requiring only very little administration. However, this service comes with financial costs. Peer-to-peer systems, in contrast, operate at very low costs but cannot match the quality of service of the cloud. This paper focuses on the case study of Wikipedia and presents an approach to reduce the operational costs of hosting similar websites in the cloud by using a practical peer-to-peer approach. The visitors of the site are joining a Chord overlay, which acts as first cache for article lookups. Simulation results show, that up to 72% of the article lookups in Wikipedia could be answered by other visitors instead of using the cloud.","lang":"eng"}],"publication":"Proceedings of the International Conference on Communications (ICC'13)","type":"conference"},{"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"_id":"490","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"75"}],"user_id":"477","year":"2013","citation":{"short":"F. Wallaschek, Routing in heterogenen OpenFlow Netzwerken, Universität Paderborn, 2013.","bibtex":"@book{Wallaschek_2013, title={Routing in heterogenen OpenFlow Netzwerken}, publisher={Universität Paderborn}, author={Wallaschek, Felix}, year={2013} }","mla":"Wallaschek, Felix. <i>Routing in heterogenen OpenFlow Netzwerken</i>. Universität Paderborn, 2013.","apa":"Wallaschek, F. (2013). <i>Routing in heterogenen OpenFlow Netzwerken</i>. Universität Paderborn.","ama":"Wallaschek F. <i>Routing in heterogenen OpenFlow Netzwerken</i>. Universität Paderborn; 2013.","ieee":"F. Wallaschek, <i>Routing in heterogenen OpenFlow Netzwerken</i>. Universität Paderborn, 2013.","chicago":"Wallaschek, Felix. <i>Routing in heterogenen OpenFlow Netzwerken</i>. Universität Paderborn, 2013."},"title":"Routing in heterogenen OpenFlow Netzwerken","date_updated":"2022-01-06T07:01:28Z","publisher":"Universität Paderborn","author":[{"full_name":"Wallaschek, Felix","last_name":"Wallaschek","first_name":"Felix"}],"date_created":"2017-10-17T12:42:27Z"},{"citation":{"apa":"Robbert, C. (2013). <i>Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained Case</i>. Universität Paderborn.","short":"C. Robbert, Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained Case, Universität Paderborn, 2013.","bibtex":"@book{Robbert_2013, title={Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained Case}, publisher={Universität Paderborn}, author={Robbert, Christoph}, year={2013} }","mla":"Robbert, Christoph. <i>Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained Case</i>. Universität Paderborn, 2013.","ama":"Robbert C. <i>Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained Case</i>. Universität Paderborn; 2013.","ieee":"C. Robbert, <i>Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained Case</i>. Universität Paderborn, 2013.","chicago":"Robbert, Christoph. <i>Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained Case</i>. Universität Paderborn, 2013."},"year":"2013","title":"Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained Case","author":[{"last_name":"Robbert","full_name":"Robbert, Christoph","first_name":"Christoph"}],"date_created":"2017-10-17T12:42:28Z","date_updated":"2022-01-06T07:01:29Z","publisher":"Universität Paderborn","status":"public","type":"bachelorsthesis","user_id":"15504","department":[{"_id":"75"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"492"},{"language":[{"iso":"ger"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"493","user_id":"477","status":"public","type":"bachelorsthesis","title":"Reputationssysteme und Gerichtsverfahren als Wekzeuge zur Sicherstellung von Qualitätsstandards in Transaktionen","date_updated":"2022-01-06T07:01:29Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:42:28Z","author":[{"first_name":"Artjom","full_name":"Terentjew, Artjom","last_name":"Terentjew"}],"year":"2013","citation":{"apa":"Terentjew, A. (2013). <i>Reputationssysteme und Gerichtsverfahren als Wekzeuge zur Sicherstellung von Qualitätsstandards in Transaktionen</i>. Universität Paderborn.","mla":"Terentjew, Artjom. <i>Reputationssysteme und Gerichtsverfahren als Wekzeuge zur Sicherstellung von Qualitätsstandards in Transaktionen</i>. Universität Paderborn, 2013.","bibtex":"@book{Terentjew_2013, title={Reputationssysteme und Gerichtsverfahren als Wekzeuge zur Sicherstellung von Qualitätsstandards in Transaktionen}, publisher={Universität Paderborn}, author={Terentjew, Artjom}, year={2013} }","short":"A. Terentjew, Reputationssysteme und Gerichtsverfahren als Wekzeuge zur Sicherstellung von Qualitätsstandards in Transaktionen, Universität Paderborn, 2013.","ieee":"A. Terentjew, <i>Reputationssysteme und Gerichtsverfahren als Wekzeuge zur Sicherstellung von Qualitätsstandards in Transaktionen</i>. Universität Paderborn, 2013.","chicago":"Terentjew, Artjom. <i>Reputationssysteme und Gerichtsverfahren als Wekzeuge zur Sicherstellung von Qualitätsstandards in Transaktionen</i>. Universität Paderborn, 2013.","ama":"Terentjew A. <i>Reputationssysteme und Gerichtsverfahren als Wekzeuge zur Sicherstellung von Qualitätsstandards in Transaktionen</i>. Universität Paderborn; 2013."}},{"abstract":[{"text":"Within reactive topology control, a node determines its adjacent edges of a network subgraph without prior knowledge of its neighborhood. The goal is to construct a local view on a topology which provides certain desired properties such as planarity. During algorithm execution, a node, in general, is not allowed to determine all its neighbors of the network graph. There are well-known reactive algorithms for computing planar subgraphs. However, the subgraphs obtained do not have constant Euclidean spanning ratio. This means that routing along these subgraphs may result in potentially long detours. So far, it has been unknown if planar spanners can be constructed reactively. In this work, we show that at least under the unit disk network model, this is indeed possible, by proposing an algorithm for reactive construction of the partial Delaunay triangulation, which recently turned out to be a spanner. Furthermore, we show that our algorithm is message-optimal as a node will only exchange messages with nodes that are also neighbors in the spanner. The algorithm’s presentation is complemented by a rigorous proof of correctness.","lang":"eng"}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-15T13:41:34Z","creator":"florida","date_created":"2018-03-15T13:41:34Z","file_size":352571,"file_id":"1312","access_level":"closed","file_name":"496-reactivePDT-copyright.pdf"}],"status":"public","type":"conference","publication":"Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)","ddc":["040"],"file_date_updated":"2018-03-15T13:41:34Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"496","user_id":"15504","department":[{"_id":"75"}],"year":"2013","citation":{"apa":"Benter, M., Neumann, F., &#38; Frey, H. (2013). Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks. In <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i> (pp. 2193–2201). <a href=\"https://doi.org/10.1109/INFCOM.2013.6567022\">https://doi.org/10.1109/INFCOM.2013.6567022</a>","bibtex":"@inproceedings{Benter_Neumann_Frey_2013, title={Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks}, DOI={<a href=\"https://doi.org/10.1109/INFCOM.2013.6567022\">10.1109/INFCOM.2013.6567022</a>}, booktitle={Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)}, author={Benter, Markus and Neumann, Florentin and Frey, Hannes}, year={2013}, pages={2193–2201} }","mla":"Benter, Markus, et al. “Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks.” <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>, 2013, pp. 2193–201, doi:<a href=\"https://doi.org/10.1109/INFCOM.2013.6567022\">10.1109/INFCOM.2013.6567022</a>.","short":"M. Benter, F. Neumann, H. Frey, in: Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), 2013, pp. 2193–2201.","ama":"Benter M, Neumann F, Frey H. Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks. In: <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>. ; 2013:2193-2201. doi:<a href=\"https://doi.org/10.1109/INFCOM.2013.6567022\">10.1109/INFCOM.2013.6567022</a>","ieee":"M. Benter, F. Neumann, and H. Frey, “Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks,” in <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>, 2013, pp. 2193–2201.","chicago":"Benter, Markus, Florentin Neumann, and Hannes Frey. “Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks.” In <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>, 2193–2201, 2013. <a href=\"https://doi.org/10.1109/INFCOM.2013.6567022\">https://doi.org/10.1109/INFCOM.2013.6567022</a>."},"page":"2193-2201","has_accepted_license":"1","title":"Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks","doi":"10.1109/INFCOM.2013.6567022","date_updated":"2022-01-06T07:01:31Z","author":[{"first_name":"Markus","last_name":"Benter","full_name":"Benter, Markus"},{"full_name":"Neumann, Florentin","last_name":"Neumann","first_name":"Florentin"},{"full_name":"Frey, Hannes","last_name":"Frey","first_name":"Hannes"}],"date_created":"2017-10-17T12:42:29Z"},{"citation":{"chicago":"Staschewski, Margarita. <i>Price Formation in the Restaurant Industry - An Empirical Analysis</i>. Universität Paderborn, 2013.","ieee":"M. Staschewski, <i>Price Formation in the Restaurant Industry - An Empirical Analysis</i>. Universität Paderborn, 2013.","ama":"Staschewski M. <i>Price Formation in the Restaurant Industry - An Empirical Analysis</i>. Universität Paderborn; 2013.","apa":"Staschewski, M. (2013). <i>Price Formation in the Restaurant Industry - An Empirical Analysis</i>. Universität Paderborn.","short":"M. Staschewski, Price Formation in the Restaurant Industry - An Empirical Analysis, Universität Paderborn, 2013.","mla":"Staschewski, Margarita. <i>Price Formation in the Restaurant Industry - An Empirical Analysis</i>. Universität Paderborn, 2013.","bibtex":"@book{Staschewski_2013, title={Price Formation in the Restaurant Industry - An Empirical Analysis}, publisher={Universität Paderborn}, author={Staschewski, Margarita}, year={2013} }"},"year":"2013","title":"Price Formation in the Restaurant Industry - An Empirical Analysis","date_created":"2017-10-17T12:42:30Z","author":[{"last_name":"Staschewski","full_name":"Staschewski, Margarita","first_name":"Margarita"}],"date_updated":"2022-01-06T07:01:34Z","publisher":"Universität Paderborn","status":"public","type":"bachelorsthesis","user_id":"15504","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"500"},{"title":"Optimale und adaptive binäre Bäume in Netzwerken","author":[{"first_name":"Andreas","full_name":"Blix, Andreas","last_name":"Blix"}],"date_created":"2017-10-17T12:42:30Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:35Z","citation":{"chicago":"Blix, Andreas. <i>Optimale und adaptive binäre Bäume in Netzwerken</i>. Universität Paderborn, 2013.","ieee":"A. Blix, <i>Optimale und adaptive binäre Bäume in Netzwerken</i>. Universität Paderborn, 2013.","ama":"Blix A. <i>Optimale und adaptive binäre Bäume in Netzwerken</i>. Universität Paderborn; 2013.","apa":"Blix, A. (2013). <i>Optimale und adaptive binäre Bäume in Netzwerken</i>. Universität Paderborn.","mla":"Blix, Andreas. <i>Optimale und adaptive binäre Bäume in Netzwerken</i>. Universität Paderborn, 2013.","short":"A. Blix, Optimale und adaptive binäre Bäume in Netzwerken, Universität Paderborn, 2013.","bibtex":"@book{Blix_2013, title={Optimale und adaptive binäre Bäume in Netzwerken}, publisher={Universität Paderborn}, author={Blix, Andreas}, year={2013} }"},"year":"2013","language":[{"iso":"ger"}],"user_id":"477","_id":"503","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"status":"public","type":"bachelorsthesis"},{"has_accepted_license":"1","citation":{"bibtex":"@inproceedings{Abshoff_Benter_Malatyali_Meyer auf der Heide_2013, series={LNCS}, title={On Two-Party Communication Through Dynamic Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-03850-6_2\">10.1007/978-3-319-03850-6_2</a>}, booktitle={Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)}, author={Abshoff, Sebastian and Benter, Markus and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2013}, pages={11–22}, collection={LNCS} }","short":"S. Abshoff, M. Benter, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS), 2013, pp. 11–22.","mla":"Abshoff, Sebastian, et al. “On Two-Party Communication Through Dynamic Networks.” <i>Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)</i>, 2013, pp. 11–22, doi:<a href=\"https://doi.org/10.1007/978-3-319-03850-6_2\">10.1007/978-3-319-03850-6_2</a>.","apa":"Abshoff, S., Benter, M., Malatyali, M., &#38; Meyer auf der Heide, F. (2013). On Two-Party Communication Through Dynamic Networks. In <i>Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)</i> (pp. 11–22). <a href=\"https://doi.org/10.1007/978-3-319-03850-6_2\">https://doi.org/10.1007/978-3-319-03850-6_2</a>","ama":"Abshoff S, Benter M, Malatyali M, Meyer auf der Heide F. On Two-Party Communication Through Dynamic Networks. In: <i>Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)</i>. LNCS. ; 2013:11-22. doi:<a href=\"https://doi.org/10.1007/978-3-319-03850-6_2\">10.1007/978-3-319-03850-6_2</a>","chicago":"Abshoff, Sebastian, Markus Benter, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “On Two-Party Communication Through Dynamic Networks.” In <i>Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)</i>, 11–22. LNCS, 2013. <a href=\"https://doi.org/10.1007/978-3-319-03850-6_2\">https://doi.org/10.1007/978-3-319-03850-6_2</a>.","ieee":"S. Abshoff, M. Benter, M. Malatyali, and F. Meyer auf der Heide, “On Two-Party Communication Through Dynamic Networks,” in <i>Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)</i>, 2013, pp. 11–22."},"page":"11-22","year":"2013","date_created":"2017-10-17T12:42:31Z","author":[{"first_name":"Sebastian","full_name":"Abshoff, Sebastian","last_name":"Abshoff"},{"first_name":"Markus","full_name":"Benter, Markus","last_name":"Benter"},{"first_name":"Manuel","full_name":"Malatyali, Manuel","last_name":"Malatyali"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"date_updated":"2022-01-06T07:01:36Z","doi":"10.1007/978-3-319-03850-6_2","title":"On Two-Party Communication Through Dynamic Networks","type":"conference","publication":"Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-15T10:47:31Z","creator":"florida","date_created":"2018-03-15T10:47:31Z","file_size":181398,"access_level":"closed","file_id":"1305","file_name":"507-on-two-party-communication-through-dynamic-networks_01.pdf"}],"status":"public","abstract":[{"text":"We study two-party communication in the context of directed dynamic networks that are controlled by an adaptive adversary. This adversary is able to change all edges as long as the networks stay strongly-connected in each round. In this work, we establish a relation between counting the total number of nodes in the network and the problem of exchanging tokens between two communication partners which communicate through a dynamic network. We show that the communication problem for a constant fraction of n tokens in a dynamic network with n nodes is at most as hard as counting the number of nodes in a dynamic network with at most 4n+3 nodes. For the proof, we construct a family of directed dynamic networks and apply a lower bound from two-party communication complexity.","lang":"eng"}],"series_title":"LNCS","user_id":"15504","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"507","file_date_updated":"2018-03-15T10:47:31Z","ddc":["040"]},{"_id":"508","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"75"}],"user_id":"15572","ddc":["040"],"file_date_updated":"2018-03-15T10:50:19Z","publication":"Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)","type":"conference","abstract":[{"text":"The process of planning a virtual topology for a Wavelength Devision Multiplexing (WDM) network is called Virtual Topology Design (VTD). The goal of VTD is to find a virtual topology that supports forwarding the expected traffic without congestion. In networks with fluctuating, high traffic demands, it can happen that no single topology fits all changing traffic demands occurring over a longer time. Thus, during operation, the virtual topology has to be reconfigured. Since modern networks tend to be large, VTD algorithms have to scale well with increasing network size, requiring distributed algorithms. Existing distributed VTD algorithms, however, react too slowly on congestion for the real-time reconfiguration of large networks. We propose Selfish Virtual Topology Reconfiguration (SVTR) as a new algorithm for distributed VTD. It combines reconfiguring the virtual topology and routing through a Software Defined Network (SDN). SVTR is used for online, on-the-fly network reconfiguration. Its integrated routing and WDM reconfiguration keeps connection disruption due to network reconfiguration to a minimum and is able to react very quickly to traffic pattern changes. SVTR works by iteratively adapting the virtual topology to the observed traffic patterns without global traffic information and without future traffic estimations. We evaluated SVTR by simulation and found that it significantly lowers congestion in realistic networks and high load scenarios.","lang":"eng"}],"status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":219902,"access_level":"closed","file_id":"1307","file_name":"508-06528271.pdf","date_updated":"2018-03-15T10:50:19Z","date_created":"2018-03-15T10:50:19Z","creator":"florida"}],"date_updated":"2022-01-06T07:01:37Z","author":[{"last_name":"Wette","full_name":"Wette, Philip","first_name":"Philip"},{"last_name":"Karl","id":"126","full_name":"Karl, Holger","first_name":"Holger"}],"date_created":"2017-10-17T12:42:31Z","title":"On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks","doi":"10.1109/LANMAN.2013.6528271","has_accepted_license":"1","year":"2013","page":"1 - 6 ","citation":{"ama":"Wette P, Karl H. On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks. In: <i>Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)</i>. ; 2013:1-6. doi:<a href=\"https://doi.org/10.1109/LANMAN.2013.6528271\">10.1109/LANMAN.2013.6528271</a>","ieee":"P. Wette and H. Karl, “On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks,” in <i>Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)</i>, 2013, pp. 1–6.","chicago":"Wette, Philip, and Holger Karl. “On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks.” In <i>Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)</i>, 1–6, 2013. <a href=\"https://doi.org/10.1109/LANMAN.2013.6528271\">https://doi.org/10.1109/LANMAN.2013.6528271</a>.","apa":"Wette, P., &#38; Karl, H. (2013). On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks. In <i>Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)</i> (pp. 1–6). <a href=\"https://doi.org/10.1109/LANMAN.2013.6528271\">https://doi.org/10.1109/LANMAN.2013.6528271</a>","short":"P. Wette, H. Karl, in: Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN), 2013, pp. 1–6.","bibtex":"@inproceedings{Wette_Karl_2013, title={On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks}, DOI={<a href=\"https://doi.org/10.1109/LANMAN.2013.6528271\">10.1109/LANMAN.2013.6528271</a>}, booktitle={Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)}, author={Wette, Philip and Karl, Holger}, year={2013}, pages={1–6} }","mla":"Wette, Philip, and Holger Karl. “On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks.” <i>Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)</i>, 2013, pp. 1–6, doi:<a href=\"https://doi.org/10.1109/LANMAN.2013.6528271\">10.1109/LANMAN.2013.6528271</a>."}},{"file":[{"access_level":"closed","file_name":"509-06529245.pdf","file_id":"1304","file_size":197048,"date_created":"2018-03-15T10:46:51Z","creator":"florida","date_updated":"2018-03-15T10:46:51Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","abstract":[{"lang":"eng","text":"In this paper we will introduce a new d-dimensional graph for constructing geometric application layer overlay net-works. Our approach will use internet coordinates, embedded using the L∞ -metric. After describing the graph structure, we will show how it limits maintenance overhead by bounding each node’s out-degree and how it supports greedy routing using one-hop neighbourhood information in each routing step. We will further show that greedy routing can always compute a path in our graph and we will also prove that in each forwarding step the next hop is closer to the destination than the current node."}],"type":"conference","publication":"Proceedings of the Conference on Networked Systems (NetSys)","file_date_updated":"2018-03-15T10:46:51Z","ddc":["040"],"user_id":"15504","department":[{"_id":"75"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"509","citation":{"apa":"Autenrieth, M., &#38; Frey, H. (2013). On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings. In <i>Proceedings of the Conference on Networked Systems (NetSys)</i> (pp. 126–131). <a href=\"https://doi.org/10.1109/NetSys.2013.10\">https://doi.org/10.1109/NetSys.2013.10</a>","short":"M. Autenrieth, H. Frey, in: Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 126–131.","bibtex":"@inproceedings{Autenrieth_Frey_2013, title={On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings}, DOI={<a href=\"https://doi.org/10.1109/NetSys.2013.10\">10.1109/NetSys.2013.10</a>}, booktitle={Proceedings of the Conference on Networked Systems (NetSys)}, author={Autenrieth, Marcus and Frey, Hannes}, year={2013}, pages={126–131} }","mla":"Autenrieth, Marcus, and Hannes Frey. “On Greedy Routing in Degree-Bounded Graphs over d-Dimensional Internet Coordinate Embeddings.” <i>Proceedings of the Conference on Networked Systems (NetSys)</i>, 2013, pp. 126–31, doi:<a href=\"https://doi.org/10.1109/NetSys.2013.10\">10.1109/NetSys.2013.10</a>.","ama":"Autenrieth M, Frey H. On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings. In: <i>Proceedings of the Conference on Networked Systems (NetSys)</i>. ; 2013:126-131. doi:<a href=\"https://doi.org/10.1109/NetSys.2013.10\">10.1109/NetSys.2013.10</a>","chicago":"Autenrieth, Marcus, and Hannes Frey. “On Greedy Routing in Degree-Bounded Graphs over d-Dimensional Internet Coordinate Embeddings.” In <i>Proceedings of the Conference on Networked Systems (NetSys)</i>, 126–31, 2013. <a href=\"https://doi.org/10.1109/NetSys.2013.10\">https://doi.org/10.1109/NetSys.2013.10</a>.","ieee":"M. Autenrieth and H. Frey, “On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings,” in <i>Proceedings of the Conference on Networked Systems (NetSys)</i>, 2013, pp. 126–131."},"page":"126-131","year":"2013","has_accepted_license":"1","doi":"10.1109/NetSys.2013.10","title":"On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings","author":[{"first_name":"Marcus","full_name":"Autenrieth, Marcus","last_name":"Autenrieth"},{"first_name":"Hannes","full_name":"Frey, Hannes","last_name":"Frey"}],"date_created":"2017-10-17T12:42:31Z","date_updated":"2022-01-06T07:01:37Z"},{"user_id":"15504","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"510","status":"public","type":"mastersthesis","title":"Meta-data based Search in Structured Peer-to-Peer Networks","date_created":"2017-10-17T12:42:31Z","author":[{"full_name":"Jayesh Parekh, Chintan","last_name":"Jayesh Parekh","first_name":"Chintan"}],"date_updated":"2022-01-06T07:01:37Z","publisher":"Universität Paderborn","citation":{"apa":"Jayesh Parekh, C. (2013). <i>Meta-data based Search in Structured Peer-to-Peer Networks</i>. Universität Paderborn.","bibtex":"@book{Jayesh Parekh_2013, title={Meta-data based Search in Structured Peer-to-Peer Networks}, publisher={Universität Paderborn}, author={Jayesh Parekh, Chintan}, year={2013} }","short":"C. Jayesh Parekh, Meta-Data Based Search in Structured Peer-to-Peer Networks, Universität Paderborn, 2013.","mla":"Jayesh Parekh, Chintan. <i>Meta-Data Based Search in Structured Peer-to-Peer Networks</i>. Universität Paderborn, 2013.","ama":"Jayesh Parekh C. <i>Meta-Data Based Search in Structured Peer-to-Peer Networks</i>. Universität Paderborn; 2013.","ieee":"C. Jayesh Parekh, <i>Meta-data based Search in Structured Peer-to-Peer Networks</i>. Universität Paderborn, 2013.","chicago":"Jayesh Parekh, Chintan. <i>Meta-Data Based Search in Structured Peer-to-Peer Networks</i>. Universität Paderborn, 2013."},"year":"2013"},{"title":"MapReduce in Software Defined Networks","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:38Z","date_created":"2017-10-17T12:42:32Z","author":[{"first_name":"Malte","last_name":"Splietker","full_name":"Splietker, Malte"}],"year":"2013","citation":{"apa":"Splietker, M. (2013). <i>MapReduce in Software Defined Networks</i>. Universität Paderborn.","short":"M. Splietker, MapReduce in Software Defined Networks, Universität Paderborn, 2013.","mla":"Splietker, Malte. <i>MapReduce in Software Defined Networks</i>. Universität Paderborn, 2013.","bibtex":"@book{Splietker_2013, title={MapReduce in Software Defined Networks}, publisher={Universität Paderborn}, author={Splietker, Malte}, year={2013} }","ieee":"M. Splietker, <i>MapReduce in Software Defined Networks</i>. Universität Paderborn, 2013.","chicago":"Splietker, Malte. <i>MapReduce in Software Defined Networks</i>. Universität Paderborn, 2013.","ama":"Splietker M. <i>MapReduce in Software Defined Networks</i>. Universität Paderborn; 2013."},"_id":"511","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"75"}],"user_id":"15504","status":"public","type":"bachelorsthesis"},{"title":"Lösungsverfahren für das many-to-one Matching Problem","date_updated":"2022-01-06T07:01:38Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:42:32Z","author":[{"last_name":"Herzog","full_name":"Herzog, Elvira","first_name":"Elvira"}],"year":"2013","citation":{"ama":"Herzog E. <i>Lösungsverfahren für das many-to-one Matching Problem</i>. Universität Paderborn; 2013.","ieee":"E. Herzog, <i>Lösungsverfahren für das many-to-one Matching Problem</i>. Universität Paderborn, 2013.","chicago":"Herzog, Elvira. <i>Lösungsverfahren für das many-to-one Matching Problem</i>. Universität Paderborn, 2013.","mla":"Herzog, Elvira. <i>Lösungsverfahren für das many-to-one Matching Problem</i>. Universität Paderborn, 2013.","bibtex":"@book{Herzog_2013, title={Lösungsverfahren für das many-to-one Matching Problem}, publisher={Universität Paderborn}, author={Herzog, Elvira}, year={2013} }","short":"E. Herzog, Lösungsverfahren für das many-to-one Matching Problem, Universität Paderborn, 2013.","apa":"Herzog, E. (2013). <i>Lösungsverfahren für das many-to-one Matching Problem</i>. Universität Paderborn."},"language":[{"iso":"ger"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"512","user_id":"477","status":"public","type":"bachelorsthesis"},{"ddc":["040"],"file_date_updated":"2018-03-15T10:45:15Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"513","user_id":"15504","department":[{"_id":"79"}],"abstract":[{"lang":"eng","text":"This paper initiates the study of self-adjusting networks (or distributed data structures) whose topologies dynamically adapt to a communication pattern $\\sigma$. We present a fully decentralized self-adjusting solution called SplayNet. A SplayNet is a distributed generalization of the classic splay tree concept. It ensures short paths (which can be found using local-greedy routing) between communication partners while minimizing topological rearrangements. We derive an upper bound for the amortized communication cost of a SplayNet based on empirical entropies of $\\sigma$, and show that SplayNets have several interesting convergence properties. For instance, SplayNets features a provable online optimality under special requests scenarios. We also investigate the optimal static network and prove different lower bounds for the average communication cost based on graph cuts and on the empirical entropy of the communication pattern $\\sigma$. From these lower bounds it follows, e.g., that SplayNets are optimal in scenarios where the requests follow a product distribution as well. Finally, this paper shows that in contrast to the Minimum Linear Arrangement problem which is generally NP-hard, the optimal static tree network can be computed in polynomial time for any guest graph, despite the exponentially large graph family. We complement our formal analysis with a small simulation study on a Facebook graph."}],"file":[{"access_level":"closed","file_id":"1303","file_name":"513-ipdps13_01.pdf","file_size":518804,"date_created":"2018-03-15T10:45:15Z","creator":"florida","date_updated":"2018-03-15T10:45:15Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","type":"conference","publication":"Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)","title":"Locally Self-Adjusting Tree Networks","doi":"10.1109/IPDPS.2013.40","date_updated":"2022-01-06T07:01:38Z","author":[{"full_name":"Avin, Chen","last_name":"Avin","first_name":"Chen"},{"first_name":"Bernhard","last_name":"Häupler","full_name":"Häupler, Bernhard"},{"first_name":"Zvi","full_name":"Lotker, Zvi","last_name":"Lotker"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"}],"date_created":"2017-10-17T12:42:32Z","year":"2013","citation":{"ama":"Avin C, Häupler B, Lotker Z, Scheideler C, Schmid S. Locally Self-Adjusting Tree Networks. In: <i>Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. ; 2013:395-406. doi:<a href=\"https://doi.org/10.1109/IPDPS.2013.40\">10.1109/IPDPS.2013.40</a>","chicago":"Avin, Chen, Bernhard Häupler, Zvi Lotker, Christian Scheideler, and Stefan Schmid. “Locally Self-Adjusting Tree Networks.” In <i>Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 395–406, 2013. <a href=\"https://doi.org/10.1109/IPDPS.2013.40\">https://doi.org/10.1109/IPDPS.2013.40</a>.","ieee":"C. Avin, B. Häupler, Z. Lotker, C. Scheideler, and S. Schmid, “Locally Self-Adjusting Tree Networks,” in <i>Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2013, pp. 395–406.","apa":"Avin, C., Häupler, B., Lotker, Z., Scheideler, C., &#38; Schmid, S. (2013). Locally Self-Adjusting Tree Networks. In <i>Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i> (pp. 395–406). <a href=\"https://doi.org/10.1109/IPDPS.2013.40\">https://doi.org/10.1109/IPDPS.2013.40</a>","mla":"Avin, Chen, et al. “Locally Self-Adjusting Tree Networks.” <i>Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2013, pp. 395–406, doi:<a href=\"https://doi.org/10.1109/IPDPS.2013.40\">10.1109/IPDPS.2013.40</a>.","bibtex":"@inproceedings{Avin_Häupler_Lotker_Scheideler_Schmid_2013, title={Locally Self-Adjusting Tree Networks}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2013.40\">10.1109/IPDPS.2013.40</a>}, booktitle={Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Avin, Chen and Häupler, Bernhard and Lotker, Zvi and Scheideler, Christian and Schmid, Stefan}, year={2013}, pages={395–406} }","short":"C. Avin, B. Häupler, Z. Lotker, C. Scheideler, S. Schmid, in: Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2013, pp. 395–406."},"page":"395-406","has_accepted_license":"1"},{"title":"Local and Online Algorithms for Facility Location","supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"date_created":"2017-10-17T12:42:32Z","author":[{"full_name":"Pietrzyk, Peter","last_name":"Pietrzyk","first_name":"Peter"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:38Z","citation":{"ama":"Pietrzyk P. <i>Local and Online Algorithms for Facility Location</i>. Universität Paderborn; 2013.","ieee":"P. Pietrzyk, <i>Local and Online Algorithms for Facility Location</i>. Universität Paderborn, 2013.","chicago":"Pietrzyk, Peter. <i>Local and Online Algorithms for Facility Location</i>. Universität Paderborn, 2013.","short":"P. Pietrzyk, Local and Online Algorithms for Facility Location, Universität Paderborn, 2013.","bibtex":"@book{Pietrzyk_2013, title={Local and Online Algorithms for Facility Location}, publisher={Universität Paderborn}, author={Pietrzyk, Peter}, year={2013} }","mla":"Pietrzyk, Peter. <i>Local and Online Algorithms for Facility Location</i>. Universität Paderborn, 2013.","apa":"Pietrzyk, P. (2013). <i>Local and Online Algorithms for Facility Location</i>. Universität Paderborn."},"year":"2013","has_accepted_license":"1","file_date_updated":"2018-03-15T10:44:13Z","ddc":["040"],"department":[{"_id":"63"}],"user_id":"477","_id":"514","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_name":"514-DissertationPietrzyk.pdf","file_id":"1302","access_level":"closed","file_size":790821,"creator":"florida","date_created":"2018-03-15T10:44:13Z","date_updated":"2018-03-15T10:44:13Z"}],"abstract":[{"text":"Diese Arbeit besch{\\\"a}ftigt sich mit dem Facility Location Problem. Dies ist ein Optimierungsproblem, bei dem festgelegt werden muss an welchen Positionen Ressourcen zur Verf{\\\"u}gung gestellt werden, so dass diese von Nutzern gut erreicht werden k{\\\"o}nnen. Es sollen dabei Kosten minimiert werden, die zum einen durch Bereitstellung von Ressourcen und zum anderen durch Verbindungskosten zwischen Nutzern und Ressourcen entstehen. Die Schwierigkeit des Problems liegt darin, dass man einerseits m{\\\"o}glichst wenige Ressourcen zur Verf{\\\"u}gung stellen m{\\\"o}chte, andererseits daf{\\\"u}r sorgen muss, dass sich Nutzer nicht all zu weit weg von Ressourcen befinden. Dies w{\\\"u}rde n{\\\"a}mlich hohe Verbindungskosten nach sich ziehen. Das Facility Location Problem wurde bereits sehr intensiv in vielen unterschiedlichen Varianten untersucht. In dieser Arbeit werden drei Varianten des Problems modelliert und neue Algorithmen f{\\\"u}r sie entwickelt und bez{\\\"u}glich ihres Approximationsfaktors und ihrer Laufzeit analysiert. Jede dieser drei untersuchten Varianten hat einen besonderen Schwerpunkt. Bei der ersten Varianten handelt es sich um ein Online Problem, da hier die Eingabe nicht von Anfang an bekannt ist, sondern Schritt f{\\\"u}r Schritt enth{\\\"u}llt wird. Die Schwierigkeit hierbei besteht darin unwiderrufliche Entscheidungen treffen zu m{\\\"u}ssen ohne dabei die Zukunft zu kennen und trotzdem eine zu jeder Zeit gute L{\\\"o}sung angeben zu k{\\\"o}nnen. Der Schwerpunkt der zweiten Variante liegt auf Lokalit{\\\"a}t, die z.B. in Sensornetzwerken von großer Bedeutung ist. Hier soll eine L{\\\"o}sung verteilt und nur mit Hilfe von lokalen Information berechnet werden. Schließlich besch{\\\"a}ftigt sich die dritte Variante mit einer verteilten Berechnung, bei welcher nur eine stark beschr{\\\"a}nkte Datenmenge verschickt werden darf und dabei trotzdem ein sehr guter Approximationsfaktor erreicht werden muss. Die bei der Analyse der Approximationsfaktoren bzw. der Kompetitivit{\\\"a}t verwendeten Techniken basieren zum großen Teil auf Absch{\\\"a}tzung der primalen L{\\\"o}sung mit Hilfe einer L{\\\"o}sung des zugeh{\\\"o}rigen dualen Problems. F{\\\"u}r die Modellierung von Lokalit{\\\"a}t wird das weitverbreitete LOCAL Modell verwendet. In diesem Modell werden f{\\\"u}r die Algorithmen subpolynomielle obere Laufzeitschranken gezeigt.","lang":"eng"}],"type":"dissertation"},{"department":[{"_id":"205"},{"_id":"475"}],"series_title":"Working Papers CIE","user_id":"477","_id":"5146","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"file_date_updated":"2018-10-31T09:22:19Z","type":"working_paper","status":"public","volume":64,"author":[{"first_name":"Sonja","full_name":"Brangewitz, Sonja","last_name":"Brangewitz"},{"full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake","first_name":"Claus-Jochen"}],"date_updated":"2022-01-06T07:01:39Z","has_accepted_license":"1","intvolume":"        64","citation":{"apa":"Brangewitz, S., &#38; Haake, C.-J. (2013). <i>Cooperative Transfer Price Negotiations under Incomplete Information</i> (Vol. 64). CIE Working Paper Series, Paderborn University.","short":"S. Brangewitz, C.-J. Haake, Cooperative Transfer Price Negotiations under Incomplete Information, CIE Working Paper Series, Paderborn University, 2013.","bibtex":"@book{Brangewitz_Haake_2013, series={Working Papers CIE}, title={Cooperative Transfer Price Negotiations under Incomplete Information}, volume={64}, publisher={CIE Working Paper Series, Paderborn University}, author={Brangewitz, Sonja and Haake, Claus-Jochen}, year={2013}, collection={Working Papers CIE} }","mla":"Brangewitz, Sonja, and Claus-Jochen Haake. <i>Cooperative Transfer Price Negotiations under Incomplete Information</i>. Vol. 64, CIE Working Paper Series, Paderborn University, 2013.","ama":"Brangewitz S, Haake C-J. <i>Cooperative Transfer Price Negotiations under Incomplete Information</i>. Vol 64. CIE Working Paper Series, Paderborn University; 2013.","chicago":"Brangewitz, Sonja, and Claus-Jochen Haake. <i>Cooperative Transfer Price Negotiations under Incomplete Information</i>. Vol. 64. Working Papers CIE. CIE Working Paper Series, Paderborn University, 2013.","ieee":"S. Brangewitz and C.-J. Haake, <i>Cooperative Transfer Price Negotiations under Incomplete Information</i>, vol. 64. CIE Working Paper Series, Paderborn University, 2013."},"language":[{"iso":"eng"}],"keyword":["Transfer Pricing","Negotiation","Generalized Nash Bargaining Solution","Incomplete Information"],"ddc":["040"],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"5148","file_name":"WP - Cooperative Transfer Price Negotiations under Incomplete Information.pdf","file_size":430826,"date_created":"2018-10-31T09:22:19Z","creator":"stela","date_updated":"2018-10-31T09:22:19Z"}],"abstract":[{"lang":"eng","text":"In this paper, we analyze a model in which two divisions negotiate over an intrafirm transfer price for an intermediate product. Formally, we consider bargaining problems under incomplete information, since the upstream division’s (seller's) costs and downstream division's (buyer's) revenues are supposed to be private information. Assuming two possible types for buyer and seller each, we first establish that the bargaining problem is regular, regardless whether incentive and/or efficiency constraints are imposed. This allows us to apply the generalized Nash bargaining solution to determine transfer payments and transfer probabilities. Furthermore, we derive general properties of this solution for the transfer pricing problem and compare the model developed here with the existing literature for negotiated transfer pricing under incomplete information. In particular, we focus on the models presented in Wagenhofer (1994)."}],"date_created":"2018-10-31T09:20:15Z","publisher":"CIE Working Paper Series, Paderborn University","title":"Cooperative Transfer Price Negotiations under Incomplete Information","year":"2013"},{"main_file_link":[{"url":"http://ieeexplore.ieee.org/document/6970733/"}],"doi":"10.1109/INFCOMW.2013.6970733","title":"Incorporating feedback from application layer into routing and wavelength assignment algorithms","author":[{"last_name":"Wette","full_name":"Wette, Philip","first_name":"Philip"},{"full_name":"Karl, Holger","id":"126","last_name":"Karl","first_name":"Holger"}],"date_created":"2017-10-17T12:42:33Z","date_updated":"2022-01-06T07:01:43Z","citation":{"ieee":"P. Wette and H. Karl, “Incorporating feedback from application layer into routing and wavelength assignment algorithms,” in <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>, 2013, pp. 51–52.","chicago":"Wette, Philip, and Holger Karl. “Incorporating Feedback from Application Layer into Routing and Wavelength Assignment Algorithms.” In <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>, 51–52, 2013. <a href=\"https://doi.org/10.1109/INFCOMW.2013.6970733\">https://doi.org/10.1109/INFCOMW.2013.6970733</a>.","ama":"Wette P, Karl H. Incorporating feedback from application layer into routing and wavelength assignment algorithms. In: <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>. ; 2013:51-52. doi:<a href=\"https://doi.org/10.1109/INFCOMW.2013.6970733\">10.1109/INFCOMW.2013.6970733</a>","apa":"Wette, P., &#38; Karl, H. (2013). Incorporating feedback from application layer into routing and wavelength assignment algorithms. In <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i> (pp. 51–52). <a href=\"https://doi.org/10.1109/INFCOMW.2013.6970733\">https://doi.org/10.1109/INFCOMW.2013.6970733</a>","short":"P. Wette, H. Karl, in: Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), 2013, pp. 51–52.","bibtex":"@inproceedings{Wette_Karl_2013, title={Incorporating feedback from application layer into routing and wavelength assignment algorithms}, DOI={<a href=\"https://doi.org/10.1109/INFCOMW.2013.6970733\">10.1109/INFCOMW.2013.6970733</a>}, booktitle={Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)}, author={Wette, Philip and Karl, Holger}, year={2013}, pages={51–52} }","mla":"Wette, Philip, and Holger Karl. “Incorporating Feedback from Application Layer into Routing and Wavelength Assignment Algorithms.” <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>, 2013, pp. 51–52, doi:<a href=\"https://doi.org/10.1109/INFCOMW.2013.6970733\">10.1109/INFCOMW.2013.6970733</a>."},"page":"51-52","year":"2013","has_accepted_license":"1","file_date_updated":"2018-03-15T10:38:04Z","ddc":["040"],"user_id":"15504","department":[{"_id":"75"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"520","file":[{"date_updated":"2018-03-15T10:38:04Z","date_created":"2018-03-15T10:38:04Z","creator":"florida","file_size":131502,"access_level":"closed","file_name":"520-wetteinfocom2013.pdf","file_id":"1298","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","abstract":[{"lang":"eng","text":"Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established lightpaths in case not enough resources are available to set up a new lightpath in a Wavelength Division Multiplexing (WDM) network. The selection of lightpaths to be preempted relies on internal decisions of the RWA algorithm. Thus, if dedicated properties of the network topology are required by the applications running on the network, these requirements have to be known to the RWA algorithm.Otherwise it might happen that by preempting a particular lightpath these requirements are violated. If, however, these requirements include parametersknown only at the nodes running the application, the RWA algorithm cannot evaluate the requirements. For this reason an RWA algorithm is needed which incorporates feedback from the application layer in the preemption decisions.This work proposes a simple interface along with an algorithm for computing and selecting preemption candidates in case a lightpath cannot be established. We reason about the necessity of using information from the application layer in the RWA and present two example applications which benefit from this idea."}],"type":"conference","publication":"Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)"},{"title":"HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths","date_created":"2017-10-17T12:42:34Z","supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"author":[{"orcid":"0000-0003-1348-6516","last_name":"Feldotto","id":"14052","full_name":"Feldotto, Matthias","first_name":"Matthias"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:47Z","citation":{"chicago":"Feldotto, Matthias. <i>HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths</i>. Universität Paderborn, 2013.","ieee":"M. Feldotto, <i>HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths</i>. Universität Paderborn, 2013.","ama":"Feldotto M. <i>HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths</i>. Universität Paderborn; 2013.","mla":"Feldotto, Matthias. <i>HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths</i>. Universität Paderborn, 2013.","short":"M. Feldotto, HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths, Universität Paderborn, 2013.","bibtex":"@book{Feldotto_2013, title={HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths}, publisher={Universität Paderborn}, author={Feldotto, Matthias}, year={2013} }","apa":"Feldotto, M. (2013). <i>HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths</i>. Universität Paderborn."},"year":"2013","department":[{"_id":"79"}],"user_id":"14052","_id":"522","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Teilprojekt A","_id":"2"},{"name":"SFB 901 - Subprojekt A1","_id":"5"}],"status":"public","type":"mastersthesis"}]