[{"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_name":"654-IEEE.P2P.11._Kalman.Graffi_PeerfactSim-A.P2P.System.Simulator_01.pdf","file_id":"1221","access_level":"closed","file_size":327680,"creator":"florida","date_created":"2018-03-14T13:50:18Z","date_updated":"2018-03-14T13:50:18Z"}],"status":"public","abstract":[{"text":"Research on peer-to-peer (p2p) and distributed systems needs evaluation tools to predict and observe the behavior of protocols and mechanisms in large scale networks. PeerfactSim.KOM is a simulator for large scale distributed/p2p systems aiming at the evaluation of interdependencies in multi-layered p2p systems. The simulator is written in Java, is event-based and mainly used in p2p research projects. The main development of PeerfactSim.KOM started in 2005 and is driven since 2006 by the project “QuaP2P”,which aims at the systematic improvement and benchmarking of p2p systems. Further users of the simulator are working in the project “On-the-fly Computing” aiming at researching p2p-based service oriented architectures. Both projects state severe requirements on the evaluation of multi-layered and large-scale distributed systems. We describe the architecture of PeerfactSim.KOM supporting these requirements in Section II, present the workflow, selected experiences and lessons learned in Section III and conclude the overview in Section IV.","lang":"eng"}],"type":"conference","publication":"Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP)","language":[{"iso":"eng"}],"file_date_updated":"2018-03-14T13:50:18Z","ddc":["040"],"user_id":"477","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"654","citation":{"ama":"Graffi K. PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned. In: <i>Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP)</i>. ; 2011:154-155. doi:<a href=\"https://doi.org/10.1109/P2P.2011.6038673\">10.1109/P2P.2011.6038673</a>","chicago":"Graffi, Kalman. “PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned.” In <i>Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP)</i>, 154–55, 2011. <a href=\"https://doi.org/10.1109/P2P.2011.6038673\">https://doi.org/10.1109/P2P.2011.6038673</a>.","ieee":"K. Graffi, “PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned,” in <i>Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP)</i>, 2011, pp. 154–155.","bibtex":"@inproceedings{Graffi_2011, title={PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned}, DOI={<a href=\"https://doi.org/10.1109/P2P.2011.6038673\">10.1109/P2P.2011.6038673</a>}, booktitle={Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP)}, author={Graffi, Kalman}, year={2011}, pages={154–155} }","mla":"Graffi, Kalman. “PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned.” <i>Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP)</i>, 2011, pp. 154–55, doi:<a href=\"https://doi.org/10.1109/P2P.2011.6038673\">10.1109/P2P.2011.6038673</a>.","short":"K. Graffi, in: Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP), 2011, pp. 154–155.","apa":"Graffi, K. (2011). PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned. In <i>Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP)</i> (pp. 154–155). <a href=\"https://doi.org/10.1109/P2P.2011.6038673\">https://doi.org/10.1109/P2P.2011.6038673</a>"},"page":"154-155","year":"2011","has_accepted_license":"1","doi":"10.1109/P2P.2011.6038673","title":"PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned","date_created":"2017-10-17T12:42:59Z","author":[{"last_name":"Graffi","full_name":"Graffi, Kalman","first_name":"Kalman"}],"date_updated":"2022-01-06T07:03:11Z"},{"has_accepted_license":"1","page":"13-27","citation":{"bibtex":"@inproceedings{Abshoff_Cord-Landwehr_Degener_Kempkes_Pietrzyk_2011, series={LNCS}, title={Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-28209-6_3\">10.1007/978-3-642-28209-6_3</a>}, booktitle={Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)}, author={Abshoff, Sebastan and Cord-Landwehr, Andreas and Degener, Bastian and Kempkes, Barbara  and Pietrzyk, Peter}, year={2011}, pages={13–27}, collection={LNCS} }","mla":"Abshoff, Sebastan, et al. “Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks.” <i>Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)</i>, 2011, pp. 13–27, doi:<a href=\"https://doi.org/10.1007/978-3-642-28209-6_3\">10.1007/978-3-642-28209-6_3</a>.","short":"S. Abshoff, A. Cord-Landwehr, B. Degener, B. Kempkes, P. Pietrzyk, in: Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS), 2011, pp. 13–27.","apa":"Abshoff, S., Cord-Landwehr, A., Degener, B., Kempkes, B., &#38; Pietrzyk, P. (2011). Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks. In <i>Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)</i> (pp. 13–27). <a href=\"https://doi.org/10.1007/978-3-642-28209-6_3\">https://doi.org/10.1007/978-3-642-28209-6_3</a>","chicago":"Abshoff, Sebastan, Andreas Cord-Landwehr, Bastian Degener, Barbara  Kempkes, and Peter Pietrzyk. “Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks.” In <i>Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)</i>, 13–27. LNCS, 2011. <a href=\"https://doi.org/10.1007/978-3-642-28209-6_3\">https://doi.org/10.1007/978-3-642-28209-6_3</a>.","ieee":"S. Abshoff, A. Cord-Landwehr, B. Degener, B. Kempkes, and P. Pietrzyk, “Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks,” in <i>Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)</i>, 2011, pp. 13–27.","ama":"Abshoff S, Cord-Landwehr A, Degener B, Kempkes B, Pietrzyk P. Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks. In: <i>Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)</i>. LNCS. ; 2011:13-27. doi:<a href=\"https://doi.org/10.1007/978-3-642-28209-6_3\">10.1007/978-3-642-28209-6_3</a>"},"year":"2011","date_created":"2017-10-17T12:43:00Z","author":[{"full_name":"Abshoff, Sebastan","last_name":"Abshoff","first_name":"Sebastan"},{"first_name":"Andreas","full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr"},{"first_name":"Bastian","last_name":"Degener","full_name":"Degener, Bastian"},{"last_name":"Kempkes","full_name":"Kempkes, Barbara ","first_name":"Barbara "},{"first_name":"Peter","full_name":"Pietrzyk, Peter","last_name":"Pietrzyk"}],"date_updated":"2022-01-06T07:03:12Z","doi":"10.1007/978-3-642-28209-6_3","title":"Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks","publication":"Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)","type":"conference","status":"public","file":[{"file_size":454740,"file_id":"1219","access_level":"closed","file_name":"657-flp_algosensors2011-Cord-Landwehr.pdf","date_updated":"2018-03-14T13:48:21Z","creator":"florida","date_created":"2018-03-14T13:48:21Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"text":"We present two distributed, constant factor approximation algorithms for the metric facility location problem. Both algorithms have been designed with a strong emphasis on applicability in the area of wireless sensor networks: in order to execute them, each sensor node only requires limited local knowledge and simple computations. Also, the algorithms can cope with measurement errors and take into account that communication costs between sensor nodes do not necessarily increase linearly with the distance, but can be represented by a polynomial. Since it cannot always be expected that sensor nodes execute algorithms in a synchronized way, our algorithms are executed in an asynchronous model (but they are still able to break symmetry that might occur when two neighboring nodes act at exactly the same time). Furthermore, they can deal with dynamic scenarios: if a node moves, the solution is updated and the update affects only nodes in the local neighborhood. Finally, the algorithms are robust in the sense that incorrect behavior of some nodes during some round will, in the end, still result in a good approximation. The first algorithm runs in expected O(log_{1+\\epsilon} n) communication rounds and yields a \\my^4(1+4\\my^2(1+\\epsilon)^{1/p})^p approximation, while the second has a running time of expected O(log^2_{1+\\epsilon} n) communication rounds and an approximation factor of \\my^4(1 + 2(1 + \\epsilon)^{1/p})^p. Here, \\epsilon > 0 is an arbitrarily small constant, p the exponent of the polynomial representing the communication costs, and \\my the relative measurement error.","lang":"eng"}],"department":[{"_id":"63"}],"series_title":"LNCS","user_id":"477","_id":"657","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-14T13:48:21Z","ddc":["040"]},{"status":"public","type":"bachelorsthesis","user_id":"15504","department":[{"_id":"75"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"660","citation":{"mla":"Peuster, Manuel. <i>Defining and Deploying Complex Applicances in Multi-Site Cloud Environments</i>. Universität Paderborn, 2011.","bibtex":"@book{Peuster_2011, title={Defining and Deploying Complex Applicances in Multi-Site Cloud Environments}, publisher={Universität Paderborn}, author={Peuster, Manuel}, year={2011} }","short":"M. Peuster, Defining and Deploying Complex Applicances in Multi-Site Cloud Environments, Universität Paderborn, 2011.","apa":"Peuster, M. (2011). <i>Defining and Deploying Complex Applicances in Multi-Site Cloud Environments</i>. Universität Paderborn.","chicago":"Peuster, Manuel. <i>Defining and Deploying Complex Applicances in Multi-Site Cloud Environments</i>. Universität Paderborn, 2011.","ieee":"M. Peuster, <i>Defining and Deploying Complex Applicances in Multi-Site Cloud Environments</i>. Universität Paderborn, 2011.","ama":"Peuster M. <i>Defining and Deploying Complex Applicances in Multi-Site Cloud Environments</i>. Universität Paderborn; 2011."},"year":"2011","title":"Defining and Deploying Complex Applicances in Multi-Site Cloud Environments","author":[{"full_name":"Peuster, Manuel","id":"13271","last_name":"Peuster","first_name":"Manuel"}],"date_created":"2017-10-17T12:43:00Z","date_updated":"2022-01-06T07:03:13Z","publisher":"Universität Paderborn"},{"has_accepted_license":"1","citation":{"ama":"Nesterenko M, Mohd R, Scheideler C. Corona: A Stabilizing Deterministic Message-Passing Skip List. In: <i>Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. LNCS. ; 2011:356--370. doi:<a href=\"https://doi.org/10.1007/978-3-642-24550-3_27\">10.1007/978-3-642-24550-3_27</a>","chicago":"Nesterenko, Mikhail, Rizal Mohd, and Christian Scheideler. “Corona: A Stabilizing Deterministic Message-Passing Skip List.” In <i>Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 356--370. LNCS, 2011. <a href=\"https://doi.org/10.1007/978-3-642-24550-3_27\">https://doi.org/10.1007/978-3-642-24550-3_27</a>.","ieee":"M. Nesterenko, R. Mohd, and C. Scheideler, “Corona: A Stabilizing Deterministic Message-Passing Skip List,” in <i>Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2011, pp. 356--370.","apa":"Nesterenko, M., Mohd, R., &#38; Scheideler, C. (2011). Corona: A Stabilizing Deterministic Message-Passing Skip List. In <i>Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (pp. 356--370). <a href=\"https://doi.org/10.1007/978-3-642-24550-3_27\">https://doi.org/10.1007/978-3-642-24550-3_27</a>","bibtex":"@inproceedings{Nesterenko_Mohd_Scheideler_2011, series={LNCS}, title={Corona: A Stabilizing Deterministic Message-Passing Skip List}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-24550-3_27\">10.1007/978-3-642-24550-3_27</a>}, booktitle={Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, author={Nesterenko, Mikhail and Mohd, Rizal and Scheideler, Christian}, year={2011}, pages={356--370}, collection={LNCS} }","mla":"Nesterenko, Mikhail, et al. “Corona: A Stabilizing Deterministic Message-Passing Skip List.” <i>Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2011, pp. 356--370, doi:<a href=\"https://doi.org/10.1007/978-3-642-24550-3_27\">10.1007/978-3-642-24550-3_27</a>.","short":"M. Nesterenko, R. Mohd, C. Scheideler, in: Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 356--370."},"page":"356--370","year":"2011","author":[{"first_name":"Mikhail","full_name":"Nesterenko, Mikhail","last_name":"Nesterenko"},{"first_name":"Rizal","full_name":"Mohd, Rizal","last_name":"Mohd"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2017-10-17T12:43:01Z","date_updated":"2022-01-06T07:03:13Z","doi":"10.1007/978-3-642-24550-3_27","title":"Corona: A Stabilizing Deterministic Message-Passing Skip List","type":"conference","publication":"Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-14T13:46:48Z","creator":"florida","date_created":"2018-03-14T13:46:48Z","file_size":305543,"file_name":"662-SSS2011-Corona-Scheideler.pdf","access_level":"closed","file_id":"1217"}],"status":"public","abstract":[{"lang":"eng","text":"We present Corona, a deterministic self-stabilizing algorithm for skip list construction in structured overlay networks. Corona operates in the low-atomicity message-passing asynchronous system model. Corona requires constant process memory space for its operation and, therefore, scales well. We prove the general necessary conditions limiting the initial states from which a self-stabilizing structured overlay network in message-passing system can be constructed. The conditions require that initial state information has to form a weakly connected graph and it should only contain identiers that are present in the system. We formally describe Corona and rigorously prove that it stabilizes from an arbitrary initial state subject to the necessary conditions. We extend Corona to construct a skip graph."}],"user_id":"15504","series_title":"LNCS","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"662","file_date_updated":"2018-03-14T13:46:48Z","ddc":["040"]},{"citation":{"short":"K. Swierkot, Complexity Classes for Local Computation, Universität Paderborn, 2011.","bibtex":"@book{Swierkot_2011, title={Complexity Classes for Local Computation}, publisher={Universität Paderborn}, author={Swierkot, Kamil}, year={2011} }","mla":"Swierkot, Kamil. <i>Complexity Classes for Local Computation</i>. Universität Paderborn, 2011.","apa":"Swierkot, K. (2011). <i>Complexity Classes for Local Computation</i>. Universität Paderborn.","ieee":"K. Swierkot, <i>Complexity Classes for Local Computation</i>. Universität Paderborn, 2011.","chicago":"Swierkot, Kamil. <i>Complexity Classes for Local Computation</i>. Universität Paderborn, 2011.","ama":"Swierkot K. <i>Complexity Classes for Local Computation</i>. Universität Paderborn; 2011."},"year":"2011","date_created":"2017-10-17T12:43:01Z","supervisor":[{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"author":[{"first_name":"Kamil","full_name":"Swierkot, Kamil","last_name":"Swierkot"}],"date_updated":"2022-01-06T07:03:13Z","publisher":"Universität Paderborn","title":"Complexity Classes for Local Computation","type":"mastersthesis","status":"public","user_id":"477","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"663","language":[{"iso":"eng"}]},{"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:14Z","date_created":"2017-10-17T12:43:01Z","author":[{"full_name":"Wette, Philip","last_name":"Wette","first_name":"Philip"}],"supervisor":[{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"title":"Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord","year":"2011","citation":{"ama":"Wette P. <i>Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord</i>. Universität Paderborn; 2011.","ieee":"P. Wette, <i>Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord</i>. Universität Paderborn, 2011.","chicago":"Wette, Philip. <i>Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord</i>. Universität Paderborn, 2011.","mla":"Wette, Philip. <i>Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord</i>. Universität Paderborn, 2011.","short":"P. Wette, Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord, Universität Paderborn, 2011.","bibtex":"@book{Wette_2011, title={Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord}, publisher={Universität Paderborn}, author={Wette, Philip}, year={2011} }","apa":"Wette, P. (2011). <i>Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord</i>. Universität Paderborn."},"_id":"665","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"79"}],"user_id":"477","language":[{"iso":"ger"}],"type":"mastersthesis","status":"public"},{"year":"2011","citation":{"ama":"Meyer auf der Heide F, Rajaraman R, eds. <i>23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>.; 2011. doi:<a href=\"https://doi.org/10.1145/1989493\">10.1145/1989493</a>","ieee":"F. Meyer auf der Heide and R. Rajaraman, Eds., <i>23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>. 2011.","chicago":"Meyer auf der Heide, Friedhelm, and Rajmohan  Rajaraman, eds. <i>23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2011. <a href=\"https://doi.org/10.1145/1989493\">https://doi.org/10.1145/1989493</a>.","short":"F. Meyer auf der Heide, R. Rajaraman, eds., 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011.","bibtex":"@book{Meyer auf der Heide_Rajaraman_2011, title={23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures}, DOI={<a href=\"https://doi.org/10.1145/1989493\">10.1145/1989493</a>}, year={2011} }","mla":"Meyer auf der Heide, Friedhelm, and Rajmohan Rajaraman, editors. <i>23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>. 2011, doi:<a href=\"https://doi.org/10.1145/1989493\">10.1145/1989493</a>.","apa":"Meyer auf der Heide, F., &#38; Rajaraman, R. (Eds.). (2011). <i>23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>. <a href=\"https://doi.org/10.1145/1989493\">https://doi.org/10.1145/1989493</a>"},"date_updated":"2022-01-06T07:03:14Z","date_created":"2017-10-17T12:43:02Z","title":"23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures","doi":"10.1145/1989493","type":"conference_editor","editor":[{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Rajaraman, Rajmohan ","last_name":"Rajaraman","first_name":"Rajmohan "}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"667","user_id":"477","department":[{"_id":"63"}],"language":[{"iso":"eng"}]},{"date_created":"2017-10-17T12:43:02Z","author":[{"first_name":"Daniel","last_name":"Kaimann","id":"18949","full_name":"Kaimann, Daniel"}],"date_updated":"2022-01-06T07:03:15Z","publisher":"Universität Paderborn","title":"\"To infinity and beyond!\" - A genre-specific film analysis of movie success mechanisms","has_accepted_license":"1","citation":{"chicago":"Kaimann, Daniel. <i>“To Infinity and beyond!” - A Genre-Specific Film Analysis of Movie Success Mechanisms</i>. Universität Paderborn, 2011.","ieee":"D. Kaimann, <i>“To infinity and beyond!” - A genre-specific film analysis of movie success mechanisms</i>. Universität Paderborn, 2011.","ama":"Kaimann D. <i>“To Infinity and beyond!” - A Genre-Specific Film Analysis of Movie Success Mechanisms</i>. Universität Paderborn; 2011.","apa":"Kaimann, D. (2011). <i>“To infinity and beyond!” - A genre-specific film analysis of movie success mechanisms</i>. Universität Paderborn.","short":"D. Kaimann, “To Infinity and beyond!” - A Genre-Specific Film Analysis of Movie Success Mechanisms, Universität Paderborn, 2011.","bibtex":"@book{Kaimann_2011, title={“To infinity and beyond!” - A genre-specific film analysis of movie success mechanisms}, publisher={Universität Paderborn}, author={Kaimann, Daniel}, year={2011} }","mla":"Kaimann, Daniel. <i>“To Infinity and beyond!” - A Genre-Specific Film Analysis of Movie Success Mechanisms</i>. Universität Paderborn, 2011."},"year":"2011","user_id":"477","department":[{"_id":"183"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"668","file_date_updated":"2018-03-14T13:30:32Z","language":[{"iso":"eng"}],"ddc":["040"],"type":"report","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-14T13:30:32Z","date_created":"2018-03-14T13:30:32Z","creator":"florida","file_size":800960,"file_id":"1213","file_name":"668-SSRN-id2076540.pdf","access_level":"closed"}],"status":"public","abstract":[{"text":"The objective of this study is the analysis of movie success mechanisms in a genre-specific context. Instead of the examination of all time box office champions, we focus on the two film genres of computer animated and comic book based films. By introducing the concept of the motion-picture marketing mix, which represents a set of tactical marketing tools in order to strengthen a company’s strategic customer orientation, we are able to systematically identify key movie success factors. We conduct a cross-sectional empirical analysis across regional distinctions based on dataset that covers a time horizon of more than 30 years. We find empirical evidence that actors with ex ante popularity, award nominations and the production budget represent key movie success mechanisms and significantly influence a movie’s commercial appeal. Additionally, word-of-mouth creates reputation effects that also significantly affects box office gross.","lang":"eng"}]}]