@phdthesis{Opitz2009, author = {Opitz, Alek}, title = {Prognose freier Rechenkapazit{\"a}ten zur besseren Nutzung von Grid-Ressourcen}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus-9527}, school = {BTU Cottbus - Senftenberg}, year = {2009}, abstract = {Vor allem in der Forschung und in den Entwicklungsabteilungen von Unternehmen gibt es eine Vielzahl von Problemen, welche nur mit Programmen zu l{\"o}sen sind, f{\"u}r deren Ausf{\"u}hrung die zur Verf{\"u}gung stehende Rechenleistung kaum groß genug sein kann. Gleichzeitig ist zu beobachten, dass ein großer Teil der mit der installierten Rechentechnik vorhandenen Rechenkapazit{\"a}t nicht ausgenutzt wird. Dies gilt insbesondere f{\"u}r Einzelrechner, die in B{\"u}ros, Computer-Pools oder Privathaushalten stehen und sogar w{\"a}hrend ihrer eigentlichen Nutzung selten ausgelastet sind. Eines der Ziele des Grid-Computings besteht darin, solche nicht ausgelasteten Ressourcen f{\"u}r rechenintensive Anwendungen zur Verf{\"u}gung zu stellen. Die eigentliche Motivation f{\"u}r die beabsichtigte bessere Auslastung der Ressourcen liegt dabei nicht prim{\"a}r in der h{\"o}hreren Auslastung, sondern in einer m{\"o}glichen Einsparung von Kosten gegen{\"u}ber der Alternative der Neuanschaffung weiterer Hardware. Ein erster Beitrag der vorliegenden Arbeit liegt in der Analyse und Quantifizierung dieses m{\"o}glichen Kostenvorteils. Zu diesem Zweck werden die relevanten Kosten betrachtet und schließlich verschiedene Szenarien miteinander verglichen. Die Analyse wird schließlich konkrete Zahlen zu den Kosten in den verschiedenen Szenarien liefern und somit das m{\"o}gliche Potential zur Kosteneinsparung bei der Nutzung brach liegender Rechenkapazit{\"a}ten aufzeigen. Ein wesentliches Problem beim Grid-Computing besteht jedoch (vor allem bei der Nutzung von Einzelrechnern zur Ausf{\"u}hrung l{\"a}nger laufender Programme) darin, dass die zur Verf{\"u}gung stehenden freien Rechenkapazit{\"a}ten im zeitlichen Verlauf stark schwanken und Berechnungsfortschritte durch pl{\"o}tzliche anderweitige Verwendung bzw. durch Abschalten der Rechner verloren gehen. Um dennoch auch Einzelrechner sinnvoll f{\"u}r die Ausf{\"u}hrung l{\"a}nger laufender Jobs nutzen zu k{\"o}nnen, w{\"a}ren Vorhersagen der in der n{\"a}chsten Zeit zu erwartenden freien Rechenkapazit{\"a}ten w{\"u}nschenswert. Solche Vorhersagen k{\"o}nnten u. a. hilfreich sein f{\"u}r das Scheduling und f{\"u}r die Bestimmung geeigneter Checkpoint-Zeitpunkte. F{\"u}r die genannten Anwendungszwecke sind dabei Punktvorhersagen (wie z. B. Vorhersagen des Erwartungswertes) nur bedingt hilfreich, weshalb sich die vorliegende Arbeit ausschließlich mit Vorhersagen der Wahrscheinlichkeitsverteilungen besch{\"a}ftigt. Wie solche Vorhersagen erstellt werden sollen, ist Gegenstand der restlichen Arbeit. Dabei werden zun{\"a}chst M{\"o}glichkeiten der Bewertung von Prognoseverfahren diskutiert, die Wahrscheinlichkeitsverteilungen vorhersagen. Es werden wesentliche Probleme bisheriger Bewertungsverfahren aufgezeigt und entsprechende L{\"o}sungsvorschl{\"a}ge gemacht. Unter Nutzung dieser werden in der Literatur zu findende und auch neue Vorgehensweisen zur Prognoseerstellung empirisch miteinander verglichen. Es wird sich zeigen, dass eine der neu entwickelten Vorgehensweisen im Vergleich zu bisher in der Literatur dargestellten Vorhersageverfahren klare Vorteile bzgl. der Genauigkeit der Prognosen erzielt.}, subject = {Grid Computing; Ressourcenallokation; K{\"u}nstliche Intelligenz; Prognosebewertung; Grid Computing; Auslastung; Wahrscheinlichkeitsrechnung; Wirtschaftlichkeit; Forecast assessment; Grid computing; Utilization; Probability distribution; Economics}, language = {de} } @phdthesis{Rietz2017, author = {Rietz, Ren{\´e}}, title = {Optimization of network intrusion detection processes}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-44327}, school = {BTU Cottbus - Senftenberg}, year = {2017}, abstract = {Intrusion detection is a concept from the field of IT security. Network intrusion detection systems (NIDS) are used in addition to preventative measures, such as firewalls, to enable an automated detection of attacks. Network security threats often consist of multiple attack phases directed against various components of the network. During each attack phase, varying types of security-related events can be observed at various points in the network. Security monitoring, however, is nowadays essentially limited to the uplink to the internet. Sometimes it is also used to a limited extent at key points within a network, but the analysis methods do not have the same depth as at the uplink. Other areas, such as virtual networks in virtual machines (VMs), are not covered at all, yet. The aim of this thesis has been to improve the detection capability of attacks in local area networks. With a glance at the area of safety engineering, it appears efficient to secure these networks thoroughly and to develop additional monitoring solutions only for the remaining problem cases. This entails several challenges for the analysis of different parts of the TCP/IP stack. The lowermost part of the network stack has to be analyzed for attacks on network components, such as switches and VM bridges. For this, there is still no technology. Although attacks on the layers~2 and 3, such as ARP spoofing and rogue DHCP servers in physical networks, can be controlled to some extent by appropriate switches, equivalent methods are not used in virtual networks. Therefore, a software-defined networking based approach is proposed to counteract the respective attacks, which works for physical and virtual networks. The upper layers are already largely covered by traditional NIDS methods, but the rapidly increasing data rates of local area networks often lead to an uncontrolled discarding of traffic due to overload situations in the monitoring stations. Therefore, the drawbacks of current optimization approaches are outlined based on a detailed performance profiling of typical intrusion detection systems. A new approach for parallelizing the intrusion detection analysis that copes with the increasing network dynamics is introduced and evaluated. Since further special issues for NIDS particularly go back to the massive use of web technologies in today's networks, a firewall architecture is presented which applies novel NIDS methods based on machine learning to identify web applications and to ward off malicious inputs. The architecture addresses the entire process chain starting from the data transfer with HTTP via the analysis of manipulated web documents to the extraction and analysis of active contents.}, subject = {Intrusion Detection Systems (NIDS); Software-Defined Networking (SDN); Parallel NIDS; Web Firewall (Web 2.0); Machine Learning; Einbrucherkennungssysteme (IDS); Software-definierte Netzwerke (SDN); Web Firewall; Web 2.0; Maschinelles Lernen; Eindringerkennung; Maschinelles Lernen; Software-defined networking; World Wide Web 2.0; Firewall}, language = {en} } @phdthesis{Boehm2022, author = {B{\"o}hm, Sebastian}, title = {Split-Protocol-Stack network simulation and emulation of wireless embedded systems with Radio-in-the-Loop : towards accurate wireless network evaluation}, doi = {10.26127/BTUOpen-6144}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-61443}, school = {BTU Cottbus - Senftenberg}, year = {2022}, abstract = {Recent challenges and novel approaches of wireless communication networks are characterized by high performance requirements on the radio channel and by concepts of self-organization, in-network processing, or resource optimization which ultimately lead to distributed network applications, communication architectures, and radio transceivers. Associated evaluation is driven by a multitude of ever-increasing requirements that call for multidisciplinary expertise. Depending on the discipline, simulation is one of the most widely used technologies, whereby often abstract assumptions and models do not allow for sufficiently accurate, comparable results. In contrast, real-world measurements and field-tests can only be performed on actual systems, commonly under non-reproducible conditions. This thesis establishes with the Split-Protocol-Stack a new type of evaluation method that intends to help closing the gap between purely simulative analyzes and real-world tests. With the inclusion of real radio hardware and radio channels in the event-based simulation, this central hybrid approach in connection with the Radio-in-the-Loop methodology creates synergies in interdisciplinary fields. The approach contains analytical discussions, methodological strategies, and practical contributions that are summarized as key elements in the subsequent central considerations and challenges. With Real-Time-Shift, a pseudo-real-time synchronization approach for parallel simulation and radio channel emulation of communication flows is introduced. Based on the underlying time compensation scheme, the discrete event simulation is decoupled from real-time constraints when exchanging event messages with real-world wireless hardware. A physical layer emulation methodology and radio channel interface concept, called Radio-in-the-Loop, is introduced along with two practical realization approaches. Furthermore, strategic details on radio network planning with an approach to automatic hardware resource allocation are presented for radio channel emulation-capable network testbeds. The contributions of this work are evaluated using real-world reference measurements, practical application scenarios, and experiments that provide proof of concepts. By means of an exemplary selected cross-layer optimization scenario, the benefits are practically demonstrated and discussed. Finally, based on IEEE 802.15.4 as the reference protocol standard for low-power wireless networks, this thesis provides feasibility studies and analysis results using the representative prototype SEmulate for the Split-Protocol-Stack approach.}, subject = {Internet of things; Network simulation; Hardware-in-the-Loop; Modeling; IEEE 802.15.4; Internet der Dinge; Netzwerksimulation; Emulation; Modellierung; Emulation; Internet der Dinge; Netzwerksimulation; Hardware-in-the-loop; IEEE 802., 15, 4}, language = {en} } @phdthesis{Reelfs2023, author = {Reelfs, Jens Helge}, title = {Content \& user behavior in anonymous hyperlocal online platforms}, doi = {10.26127/BTUOpen-6375}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-63754}, school = {BTU Cottbus - Senftenberg}, year = {2023}, abstract = {Nowadays day-to-day digital communication and social life has only fortified with the ongoing pandemic. People enjoy communication and information across various (direct) messaging platforms and accepted its ever-increasing impact on public discourse and society. While traditional platforms implement user profiles enabling social credit, the landscape also includes anonymity. Yet, a new type of application combining anonymity with a strong spatial focus, hyperlocality, emerged over recent years. To this point, platform implications of both uniquely combined design properties largely remain unknown. In this thesis, we provide a first data-driven holistic view on Jodel that combines both properties. We leverage unbiased complete ground truth information to dissect a plethora of communities across two different countries: Germany and the Kingdom of Saudi Arabia. This work follows a platform perspective identifying four major essentially important areas revolving around the individual. That is, we begin with a broad analysis of three User Adoption processes along three different applications. After discussing our measurements of the user base adoption of the German COVID-19 digital contact tracing application, we provide evidence of well-established platforms being re-purposed as a side channel to evade censorship in the ongoing Russo-Ukrainian hybrid war. We further showcase that the very same platform ingredients may yield vastly different outcomes on the messaging app Jodel. While any online platform builds upon User Interactions, we structurally characterize Jodel behavior across both countries. We discuss structural disparities and detail platform implications - solely induced by local user behavior. An in-depth look into the Saudi community landscape closes a research gap to platform usage in a different society, identifying differences. Further, we discuss User Content analyzing information diffusion. Taking content to the next level, we developed a multidimensional classification scheme for intents (why) and topics (what) of social media messages and provide details of a crowdsourced campaign for Saudi Arabian contents. With neural word embeddings as a tool for making text tangible and the prevalence of emoji in social media communication, we discuss quantitative and qualitative insights to word-emoji embeddings reflecting semantics. Additionally, we make such embeddings interpretable and provide evidence that our method is well in line with human judgement. In terms of User Management, we detail insights to distributed moderation processes and model the threat of abusive content. In the long term, platforms need to establish a sustainable, preferably growing, environment. That is, we next discuss user lifetime and possibly early churn factors, while modeling user lifetime from metadata. We finish with a blueprint of data-driven long-term quality of experience analyzes in a controlled massively multiplayer online game (MMOG) environment.}, subject = {Dissertation; Anonymity; Hyperlocality; Online social platforms; Human behavior; Anonymit{\"a}t; Hyperlokalit{\"a}t; Soziale Online-Plattformen; Menschliches Verhalten; Deutschland; Saudi-Arabien; Social Media; Kommunikation; Anonymit{\"a}t; Verhalten}, language = {en} } @masterthesis{Bergmann2021, type = {Bachelor Thesis}, author = {Bergmann, Max}, title = {A machine learning approach for churn prediction within the social network Jodel}, doi = {10.26127/BTUOpen-6087}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-60878}, school = {BTU Cottbus - Senftenberg}, year = {2021}, abstract = {Within the last decades, the number of social networks is growing fast. The competition of retaining the customers to grow their platform and increase their profitability is rising. That is why companies need to detect possible churners to retain these. The problem of predicting the users' lifetime, churning users, and the reasons for churning can be tackled by using machine learning. The goal of this bachelor thesis is to build machine learning models to predict user churn and the user lifetime within the social network Jodel, a location-based anonymous messaging application for Android and iOS. To get the best possible prediction results, we have started with extensive literature research, whose approaches we have tested and added to a machine learning pipeline to build predictive models. With these models, we have investigated the performance after different observation time windows and have finally compared the strongest models to detect similarities and understand the insights to learn their behaviour. The results of this thesis are machine learning models for a selected representative set of communities varying in size within the Kingdom of Saudi Arabia and a country model leveraging all data. These models are used for a regression task by predicting the lifetime of a user and a multi-label classification of a user into six different churn classes. Additionally, we have also given models for a binary classification, where the model will predict if the user will churn within a given time or not. These models have shown general strong predictive power, which is shrinking when limiting the observation time window. Especially the binary classification yielded high accuracy of over 99\%. The best models have been used for predicting user churn within other communities to detect communities with possible similar behaviour. These similarities then have been determined by features' importance, where the most important features have got fed back into empirics. This has shown statistically significant differences between user groups with a different active time but as of today no clear trends were visible that had led us to define the communities' behaviours. Since the competition of social networks is still growing, the retaining of users will stay a core marketing strategy, which will need to be tackled by machine learning and artificial intelligence. The created models could be useful for predicting churning users within the platform Jodel to detect these customers that will churn within a given time. Researches did not focus much on anonymous and location-based messaging. That is why the results of this thesis on the anonymous messaging application Jodel opens a variety of possible tasks for the future in this context.}, subject = {Machine learning; Churn prediction; Neural networks; Python; Feature engineering; Maschinelles Lernen; Online-Community; Prognose; Maschinelles Lernen; Abwanderungsvorhersage; Neuronale Netze; Klassifizierungsb{\"a}ume; Regressionsb{\"a}ume}, language = {en} } @phdthesis{Gaebler2019, author = {G{\"a}bler, Jan}, title = {Gruppenkommunikation in mobilen Umgebungen : eine Erweiterung des Gruppenkommunikationsparadigmas um eine Unterst{\"u}tzung f{\"u}r mobile Anwendungsnutzer}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-48750}, school = {BTU Cottbus - Senftenberg}, year = {2019}, abstract = {Mit der zunehmenden mobilen Nutzung des Internets steigt auch die Zahl von Anwendungen in mobilen Umgebungen. Diese sind neben ihren spezifischen Anforderungen oft durch eine enge Kooperation ihrer Nutzer gekennzeichnet. Werden mobile verteilte Entscheidungsprozesse modelliert, welche der Bewertung von Sachverhalten oder der L{\"o}sung von Aufgaben dienen, so nennt man diese Klasse von Anwendungen mobile kollaborative Anwendungen. Sie werden in dieser Arbeit eingef{\"u}hrt. Ihre Eigenschaften und Besonderheiten werden diskutiert. Die Teilnehmer solcher Anwendungen kollaborieren innerhalb einer geschlossenen Gruppe und bauen ein gemeinsames Wissen auf. Auf dessen Basis kann die Anwendung lokale Entscheidungen treffen, {\"u}ber die in der Gruppe Konsens besteht. Die instabile Kommunikation in mobilen Umgebungen stellt jedoch an die Sicherung der Konsistenz des gemeinsamen Wissens besondere Anforderungen. Da klassische Verfahren zur Konsistenzsicherung in gruppenorientierten Systemen nicht genutzt werden k{\"o}nnen, ist die Sicherung der Konsistenz des globalen Wissens in mobilen Umgebungen das Leitthema dieser Arbeit. Es wird ein gruppenorientierter Kommunikationsdienst - Moversight genannt - f{\"u}r mobile kollaborative Anwendungen vorgestellt, welcher ihnen ein konsistentes globales Wissen trotz instabilen Kommunikationsumfeldes bereitstellt. Hinzu kommt, dass neben der Konsistenzsicherung die Diensterbringung in einer ressourcenschonenden Art und Weise bei gleichzeitiger kontinuierlicher Adaption der Gruppe an sich {\"a}ndernde Bedingungen einschließlich der Wartung ihrer Kommunikationsstrukturen gesichert werden m{\"u}ssen. Der Protokollentwurf f{\"u}r Moversight wird in dieser Arbeit vorgestellt. F{\"u}r Moversight wurden neuartige Funktionen zur Behandlung der Nutzermobilit{\"a}t entwickelt, welche mit den notwendigen Mechanismen zur Sicherung der Konsistenz des gemeinsamen Wissens interagieren. Ohne Gegenmaßnahmen w{\"u}rden h{\"a}ufige Verbindungsunterbrechungen das gemeinsame Wissen der Gruppe zerst{\"o}ren, wodurch diese logisch partitioniert und letztlich die Kollaboration der Nutzer verhindert wird. Grundlage der Sicherung des gemeinsamen Wissens ist die mobile optimistische virtuelle Synchronit{\"a}t (MOVS), welche das {\"u}bliche gruppenorientierte Modell der Wissenssicherung um eine Behandlung der Nutzermobilit{\"a}t und variierender Verbindungseigenschaften der Gruppenteilnehmer erweitert. Dadurch k{\"o}nnen Teilnehmer bei Verbindungsproblemen zeitnah in die Gruppe zur{\"u}ckzukehren und ihr Wissen mit dieser abzugleichen. Das vorgestellte Konzept zur Erkennung und Behandlung von Fehlersituationen mit anschließendem Gruppenwiedereintritt ist deutlich leistungsf{\"a}higer als das {\"u}blicherweise verwendete Verfahren. Dies wird erreicht durch eine leichtgewichtige Fehlerdetektion unter Nutzung einer neuartigen verteilten Latenzsch{\"a}tzung sowie einer kontinuierlichen Adaption der verwendeten Kommunikationstopologie an die sich permanent {\"a}ndernden Kommunikationsbedingungen. Die entwickelte Optimierung der clusterbasierten Kommunikationstopologie eignet sich f{\"u}r alle gruppenorientierten clusterbasierten Anwendungsszenarien. Dar{\"u}ber hinaus verf{\"u}gt Moversight {\"u}ber kollaborative Dienste f{\"u}r das Teilen und Vereinigen von Gruppen, wie sie bisher in keinem gruppenorientierten Kommunikationsdienst zu finden sind. Beide Dienste erm{\"o}glichen eine anwendungsgetriebene Neustrukturierung der kollaborativen Gruppe bei gleichzeitiger Sicherung des globalen Wissens.}, subject = {Gruppenkommunikation; uBeeMe; Virtuelle Synchronit{\"a}t; Mobile Nutzer; Group communication; Moversight; Virtual synchrony; Mobile user; Computer Supported Cooperative Work; Synchronisierung; Mobilit{\"a}t; Gruppenkommunikation }, language = {de} } @phdthesis{Liu2006, author = {Liu, Fuwen}, title = {A security architecture for a peer-to-peer video conference system}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus-445}, school = {BTU Cottbus - Senftenberg}, year = {2006}, abstract = {More and more modern group oriented collaborative applications use the peer-to-peer (P2P) paradigm to be independent of expensive infrastructures as they are, for instance, provided for audio and video conferences by H.323 systems. Decentralized P2P systems better support spontaneity and mobility to set up meetings at varying locations or in ad hoc environments. This is especially advantageous for business communication over the Internet but also for other collaborative applications such as audio/video conferences. Decentralized collaborative P2P solutions require appropriate mechanisms to protect group privacy and data integrity. The broadly available security infrastructures, like virtual private networks (VPN) in the link, network, and transport layer, do not well fulfill the requirements regarding security, efficiency, and flexibility raised by a conferencing system. A dedicated security architecture in the application layer is, therefore, highly desired for protecting a P2P video conference. A centralized client/server based video conference system can be well shielded in a standard manner, whilst there exist no off-the-shelf approaches to specifying how to secure a P2P video conference up to now. This Ph.D. thesis addresses this urgent issue by presenting an effective and flexible security architecture and showing how it can be embedded into a P2P video conferencing system using the BRAVIS system as example. The cornerstone of the security architecture is the decentralized group key management. For this purpose, a new distributed key exchange protocol has been proposed. It is especially well suited for applications in real-time P2P settings for its higher efficiency than existing ones concerning the group key renewal delay. Furthermore, a novel video encryption algorithm has been developed to meet the strict real-time constraints required in a video conference. Its outstanding features include a good balance between security and efficiency, no impairment on video compression efficiency, and readily integration into the existing multimedia systems. These make it more practicable to encrypt video data than existing approaches.}, subject = {Peer-to-Peer-Netz; Videokonferenz; Computersicherheit; Sicherheitsarchitektur; Peer-to-Peer; Videokonferenz; Gruppenschl{\"u}sselverwaltung; Videoverschl{\"u}sselung; Security architecture; Peer-to-Peer; Video conference; Group key management; Video encryption}, language = {en} } @phdthesis{Zuehlke2004, author = {Z{\"u}hlke, Mario}, title = {Verteilt organisierte Mehrteilnehmer-Videokonferenzen f{\"u}r geschlossene Gruppen im Internet}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-000000540}, school = {BTU Cottbus - Senftenberg}, year = {2004}, abstract = {Videokonferenzen gelten als eine popul{\"a}re Anwendung in modernen Netzwerken. Trotz langj{\"a}hriger Erfahrungen geh{\"o}ren sie nicht zu den allt{\"a}glich genutzten Diensten. Videokonferenzdienste im Internet unterst{\"u}tzen meist offene Konferenzgruppen. Jedoch haben die Mehrzahl der allt{\"a}glichen Beratungen einen geschlossenen Charakter. Systeme, die geschlossene Gruppen unterst{\"u}tzen, basieren meist auf spezieller Studiotechnik. Desktop-Systeme lassen nur ein begrenztes Leistungsangebot zu. Besonders beim Aufbau von Mehrteilnehmer-Gruppen ist es schwierig, eine gute Dienstg{\"u}te bereitzustellen. Deshalb haben Systeme f{\"u}r geschlossene Gruppen bisher keine breite Anwendung gefunden. Die vorliegende Arbeit untersucht zwei An{\"a}tze zur Gestaltungsprinzipien von geschlossenen Mehrteilnehmer-Videokonferenzsystemen. Der Erste untersucht den Aufbau von globalen Konferenzen {\"u}ber den Verbund lokaler Systeme. Der Zweite, ein Peer-to-Peer-Konzept, untersucht die Unterst{\"u}tzung von geschlossenen Gruppen im Internet.}, subject = {Videokonferenz; IP; Teilnehmerrechensystem; Unicastingverfahren; {\"U}berlastkontrolle; Dienstg{\"u}te; Peer-to-Peer-Netz; Mehrteilnehmer-Videokonferenz; QoS; Peer-to-Peer; Gruppenkommunikation; Geschlossen Gruppe}, language = {de} } @phdthesis{Klauck2016, author = {Klauck, Ronny}, title = {Seamless integration of smart objects into the internet using XMPP and mDNS/DNS-SD}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-38507}, school = {BTU Cottbus - Senftenberg}, year = {2016}, abstract = {With the integration of smart objects into the Internet users should gain new possibilities to directly interact with their physical environment. This vision is called Internet of Things (IoT) and is enabled by the development of micro Internet Protocol (IP) stacks that allow one to directly connect smart objects to the Internet. IP alone cannot ensure a seamless integration because advanced services (e.g., service discovery, identity management) can only be provided at the application layer. The current development of application protocols for the IoT focuses on the Machine-to-Machine (M2M) communication and introduces specialized protocol gateways, smart object-specific code or data representations that hinder a seamless integration. This thesis deals with the seamless integration, discovery, and employment of smart objects into the current Internet infrastructure under Human-to-Machine (H2M) communication aspects by using and adapting already established protocols that have been standardized by the Internet Engineering Task Force (IETF), such as the Extensible Messaging and Presence Protocol (XMPP), Multicast DNS (mDNS), and DNS Service Discovery (DNS-SD). The proposed approach is called Chatty Things. So smart objects may become a natural part of the network making the IoT readily usable for (non-technical) users and network administrators providing them with the same level of usability that is predominant in the current Internet infrastructure. The applicability of XMPP and mDNS/DNS-SD for smart objects has been evaluated with implementations of minimized, modular, and extensible software stacks for the IoT operating system Contiki. This includes a readily usable Application Programming Interface (API), an essential set of XMPP extension protocols, a proposal for lightweight and user-friendly event notification, a standardized bootstrapping, and a seamless fallback mechanism for ad hoc use cases when infrastructure services are failing for XMPP-driven smart objects. Furthermore, this thesis presents optimizations for the used protocols to reduce the network traffic in low data rate smart object networks (e.g., sensor-specific groups, enhanced message compression mechanisms). To sum up, this thesis shows how XMPP and mDNS/DNS-SD can be used economically on smart objects for the seamless integration with low effort into the current Internet infrastructure to enable a transparent (H2M) interaction and service discovery for the IoT.}, subject = {IoT; XMPP; mDNS; DNS-SD; Smart Object; Internet der Dinge; Industrie 4.0; Industrie 4.0; Internet der Dinge; Intelligentes Objekt; DNS ; Kommunikationsprotokoll}, language = {en} }