150 research outputs found
Semantic search and composition in unstructured peer-to-peer networks
This dissertation focuses on several research questions in the area of semantic search and composition in unstructured peer-to-peer (P2P) networks. Going beyond the state of the art, the proposed semantic-based search strategy S2P2P offers a novel path-suggestion based query routing mechanism, providing a reasonable tradeoff between search performance and network traffic overhead. In addition, the first semantic-based data replication scheme DSDR is proposed. It enables peers to use semantic information to select replica numbers and target peers to address predicted future demands. With DSDR, k-random search can achieve better precision and recall than it can with a near-optimal non-semantic replication strategy. Further, this thesis introduces a functional automatic semantic service composition method, SPSC. Distinctively, it enables peers to jointly compose complex workflows with high cumulative recall but low network traffic overhead, using heuristic-based bidirectional haining and service memorization mechanisms. Its query branching method helps to handle dead-ends in a pruned search space. SPSC is proved to be sound and a lower bound of is completeness is given. Finally, this thesis presents iRep3D for semantic-index based 3D scene selection in P2P search. Its efficient retrieval scales to answer hybrid queries involving conceptual, functional and geometric aspects. iRep3D outperforms previous representative efforts in terms of search precision and efficiency.Diese Dissertation bearbeitet Forschungsfragen zur semantischen Suche und Komposition in unstrukturierten Peer-to-Peer Netzen(P2P). Die semantische Suchstrategie S2P2P verwendet eine neuartige Methode zur Anfrageweiterleitung basierend auf PfadvorschlĂ€gen, welche den Stand der Wissenschaft ĂŒbertrifft. Sie bietet angemessene Balance zwischen Suchleistung und Kommunikationsbelastung im Netzwerk. AuĂerdem wird das erste semantische System zur Datenreplikation genannt DSDR vorgestellt, welche semantische Informationen berĂŒcksichtigt vorhergesagten zukĂŒnftigen Bedarf optimal im P2P zu decken. Hierdurch erzielt k-random-Suche bessere PrĂ€zision und Ausbeute als mit nahezu optimaler nicht-semantischer Replikation. SPSC, ein automatisches Verfahren zur funktional korrekten Komposition semantischer Dienste, ermöglicht es Peers, gemeinsam komplexe AblaufplĂ€ne zu komponieren. Mechanismen zur heuristischen bidirektionalen Verkettung und RĂŒckstellung von Diensten ermöglichen hohe Ausbeute bei geringer Belastung des Netzes. Eine Methode zur Anfrageverzweigung vermeidet das Feststecken in Sackgassen im beschnittenen Suchraum. Beweise zur Korrektheit und unteren Schranke der VollstĂ€ndigkeit von SPSC sind gegeben. iRep3D ist ein neuer semantischer Selektionsmechanismus fĂŒr 3D-Modelle in P2P. iRep3D beantwortet effizient hybride Anfragen unter BerĂŒcksichtigung konzeptioneller, funktionaler und geometrischer Aspekte. Der Ansatz ĂŒbertrifft vorherige Arbeiten bezĂŒglich PrĂ€zision und Effizienz
Semantic search and composition in unstructured peer-to-peer networks
This dissertation focuses on several research questions in the area of semantic search and composition in unstructured peer-to-peer (P2P) networks. Going beyond the state of the art, the proposed semantic-based search strategy S2P2P offers a novel path-suggestion based query routing mechanism, providing a reasonable tradeoff between search performance and network traffic overhead. In addition, the first semantic-based data replication scheme DSDR is proposed. It enables peers to use semantic information to select replica numbers and target peers to address predicted future demands. With DSDR, k-random search can achieve better precision and recall than it can with a near-optimal non-semantic replication strategy. Further, this thesis introduces a functional automatic semantic service composition method, SPSC. Distinctively, it enables peers to jointly compose complex workflows with high cumulative recall but low network traffic overhead, using heuristic-based bidirectional haining and service memorization mechanisms. Its query branching method helps to handle dead-ends in a pruned search space. SPSC is proved to be sound and a lower bound of is completeness is given. Finally, this thesis presents iRep3D for semantic-index based 3D scene selection in P2P search. Its efficient retrieval scales to answer hybrid queries involving conceptual, functional and geometric aspects. iRep3D outperforms previous representative efforts in terms of search precision and efficiency.Diese Dissertation bearbeitet Forschungsfragen zur semantischen Suche und Komposition in unstrukturierten Peer-to-Peer Netzen(P2P). Die semantische Suchstrategie S2P2P verwendet eine neuartige Methode zur Anfrageweiterleitung basierend auf PfadvorschlĂ€gen, welche den Stand der Wissenschaft ĂŒbertrifft. Sie bietet angemessene Balance zwischen Suchleistung und Kommunikationsbelastung im Netzwerk. AuĂerdem wird das erste semantische System zur Datenreplikation genannt DSDR vorgestellt, welche semantische Informationen berĂŒcksichtigt vorhergesagten zukĂŒnftigen Bedarf optimal im P2P zu decken. Hierdurch erzielt k-random-Suche bessere PrĂ€zision und Ausbeute als mit nahezu optimaler nicht-semantischer Replikation. SPSC, ein automatisches Verfahren zur funktional korrekten Komposition semantischer Dienste, ermöglicht es Peers, gemeinsam komplexe AblaufplĂ€ne zu komponieren. Mechanismen zur heuristischen bidirektionalen Verkettung und RĂŒckstellung von Diensten ermöglichen hohe Ausbeute bei geringer Belastung des Netzes. Eine Methode zur Anfrageverzweigung vermeidet das Feststecken in Sackgassen im beschnittenen Suchraum. Beweise zur Korrektheit und unteren Schranke der VollstĂ€ndigkeit von SPSC sind gegeben. iRep3D ist ein neuer semantischer Selektionsmechanismus fĂŒr 3D-Modelle in P2P. iRep3D beantwortet effizient hybride Anfragen unter BerĂŒcksichtigung konzeptioneller, funktionaler und geometrischer Aspekte. Der Ansatz ĂŒbertrifft vorherige Arbeiten bezĂŒglich PrĂ€zision und Effizienz
Router-aided Approach for P2P Traffic Localization
èæ”Šć·„æ„性ćŠ201
Proactive Mechanisms for Video-on-Demand Content Delivery
Video delivery over the Internet is the dominant source of network load all over the world.
Especially VoD streaming services such as YouTube, Netflix, and Amazon Video have propelled the proliferation of VoD in many peoples' everyday life.
VoD allows watching video from a large quantity of content at any time and on a multitude of devices, including smart TVs, laptops, and smartphones.
Studies show that many people under the age of 32 grew up with VoD services and have never subscribed to a traditional cable TV service.
This shift in video consumption behavior is continuing with an ever-growing number of users.
satisfy this large demand, VoD service providers usually rely on CDN, which make VoD streaming scalable by operating a geographically distributed network of several hundreds of thousands of servers.
Thereby, they deliver content from locations close to the users, which keeps traffic local and enables a fast playback start.
CDN experience heavy utilization during the day and are usually reactive to the user demand, which is not optimal as it leads to expensive over-provisioning, to cope with traffic peaks, and overreacting content eviction that decreases the CDN's performance.
However, to sustain future VoD streaming projections with hundreds of millions of users, new approaches are required to increase the content delivery efficiency.
To this end, this thesis identifies three key research areas that have the potential to address the future demand for VoD content.
Our first contribution is the design of vFetch, a privacy-preserving prefetching mechanism for mobile devices.
It focuses explicitly on OTT VoD providers such as YouTube.
vFetch learns the user interest towards different content channels and uses these insights to prefetch content on a user terminal.
To do so, it continually monitors the user behavior and the device's mobile connectivity pattern, to allow for resource-efficient download scheduling.
Thereby, vFetch illustrates how personalized prefetching can reduce the mobile data volume and alleviate mobile networks by offloading peak-hour traffic.
Our second contribution focuses on proactive in-network caching.
To this end, we present the design of the ProCache mechanism that divides the available cache storage concerning separate content categories.
Thus, the available storage is allocated to these divisions based on their contribution to the overall cache efficiency.
We propose a general work-flow that emphasizes multiple categories of a mixed content workload in addition to a work-flow tailored for music video content, the dominant traffic source on YouTube.
Thereby, ProCache shows how content-awareness can contribute to efficient in-network caching.
Our third contribution targets the application of multicast for VoD scenarios.
Many users request popular VoD content with only small differences in their playback start time which offers a potential for multicast.
Therefore, we present the design of the VoDCast mechanism that leverages this potential to multicast parts of popular VoD content.
Thereby, VoDCast illustrates how ISP can collaborate with CDN to coordinate on content that should be delivered by ISP-internal multicast
Static Web content distribution and request routing in a P2P overlay
The significance of collaboration over the Internet has become a corner-stone of modern computing, as the essence of information processing and content management has shifted to networked and Webbased systems. As a result, the effective and reliable access to networked resources has become a critical commodity in any modern infrastructure.
In order to cope with the limitations introduced by the traditional client-server networking model, most of the popular Web-based services have employed separate Content Delivery Networks (CDN) to distribute the server-side resource consumption. Since the Web applications are often latency-critical, the CDNs are additionally being adopted for optimizing the content delivery latencies perceived by the Web clients. Because of the prevalent connection model, the Web content delivery has grown to a notable industry. The rapid growth in the amount of mobile devices further contributes to the amount of resources required from the originating server, as the content is also accessible on the go.
While the Web has become one of the most utilized sources of information and digital content, the openness of the Internet is simultaneously being reduced by organizations and governments preventing access to any undesired resources. The access to information may be regulated or altered to suit any political interests or organizational benefits, thus conflicting with the initial design principle of an unrestricted and independent information network.
This thesis contributes to the development of more efficient and open Internet by combining a feasibility study and a preliminary design of a peer-to-peer based Web content distribution and request routing mechanism. The suggested design addresses both the challenges related to effectiveness of current client-server networking model and the openness of information distributed over the Internet. Based on the properties of existing peer-to-peer implementations, the suggested overlay design is intended to provide low-latency access to any Web content without sacrificing the end-user privacy. The overlay is additionally designed to increase the cost of censorship by forcing a successful blockade to isolate the censored network from the rest of the Internet
IDEAS-1997-2021-Final-Programs
This document records the final program for each of the 26 meetings of the International Database and Engineering Application Symposium from 1997 through 2021. These meetings were organized in various locations on three continents. Most of the papers published during these years are in the digital libraries of IEEE(1997-2007) or ACM(2008-2021)
INSTANT MESSAGING SPAM DETECTION IN LONG TERM EVOLUTION NETWORKS
The lack of efficient spam detection modules for packet data communication is resulting to increased threat exposure for the telecommunication network users and the service providers. In this thesis, we propose a novel approach to classify spam at the server side by intercepting packet-data communication among instant messaging applications. Spam detection is performed using machine learning techniques on packet headers and contents (if unencrypted) in two different phases: offline training and online classification. The contribution of this study is threefold. First, it identifies the scope of deploying a spam detection module in a state-of-the-art telecommunication architecture. Secondly, it compares the usefulness of various existing machine learning algorithms in order to intercept and classify data packets in near real-time communication of the instant messengers. Finally, it evaluates the accuracy and classification time of spam detection using our approach in a simulated environment of continuous packet data communication. Our research results are mainly generated by executing instances of a peer-to-peer instant messaging application prototype within a simulated Long Term Evolution (LTE) telecommunication network environment. This prototype is modeled and executed using OPNET network modeling and simulation tools. The research produces considerable knowledge on addressing unsolicited packet monitoring in instant messaging and similar applications
Empirical studies of Quality of Experience (QoE) : A Systematic Literature Survey
Quality of Experience (QoE) is a relatively new phenomenon. The main focus of this thesis has been to conduct a systematic literature survey of research done in the field of QoE over a ten year period. The method, developed by A. Fink, has been used to survey empirical studies. A framework of QoE has been developed, which created the possibility of grouping together and analysing all the studies in a common framework.
In total, 44 studies were analysed. 66 per cent of them were studies with human participants and 34 per cent of them were studies without human participants. The majority of the selected empirical studies have analysed the sub-aspect âsatisfactionâ. Among other vital sub-aspects, which were of interest to researches, were âusefulnessâ, âease of useâ, âcommunicationâ, âloss/packet lossâ, âdelayâ, âbandwidthâ, and âjitterâ. The results of this survey show that different sub-aspects depend on different services. It is not enough that one sub-aspect functions very well, because most of sub-aspects are closely related to each other. Therefore, it is very important that sub-aspects, which are dependent on each other, are functioning as one group to achieve higher QoE on user experience.
This thesis may contribute to deeper understanding of the phenomenon QoE. Knowledge of QoE can bring in new ideas and new possibilities for developing a new system or products for achieving satisfaction of user experience
Metodologias para caracterização de tråfego em redes de comunicaçÔes
Tese de doutoramento em Metodologias para caracterização de tråfego em redes de comunicaçÔesInternet Tra c, Internet Applications, Internet Attacks, Tra c Pro ling,
Multi-Scale Analysis
abstract Nowadays, the Internet can be seen as an ever-changing platform where new
and di erent types of services and applications are constantly emerging. In
fact, many of the existing dominant applications, such as social networks,
have appeared recently, being rapidly adopted by the user community. All
these new applications required the implementation of novel communication
protocols that present di erent network requirements, according to the service
they deploy. All this diversity and novelty has lead to an increasing need
of accurately pro ling Internet users, by mapping their tra c to the originating
application, in order to improve many network management tasks such
as resources optimization, network performance, service personalization and
security. However, accurately mapping tra c to its originating application
is a di cult task due to the inherent complexity of existing network protocols
and to several restrictions that prevent the analysis of the contents of
the generated tra c. In fact, many technologies, such as tra c encryption,
are widely deployed to assure and protect the con dentiality and integrity
of communications over the Internet. On the other hand, many legal constraints
also forbid the analysis of the clients' tra c in order to protect
their con dentiality and privacy. Consequently, novel tra c discrimination
methodologies are necessary for an accurate tra c classi cation and user
pro ling. This thesis proposes several identi cation methodologies for an
accurate Internet tra c pro ling while coping with the di erent mentioned
restrictions and with the existing encryption techniques. By analyzing the
several frequency components present in the captured tra c and inferring
the presence of the di erent network and user related events, the proposed
approaches are able to create a pro le for each one of the analyzed Internet
applications. The use of several probabilistic models will allow the accurate
association of the analyzed tra c to the corresponding application. Several
enhancements will also be proposed in order to allow the identi cation of
hidden illicit patterns and the real-time classi cation of captured tra c.
In addition, a new network management paradigm for wired and wireless
networks will be proposed. The analysis of the layer 2 tra c metrics and
the di erent frequency components that are present in the captured tra c
allows an e cient user pro ling in terms of the used web-application. Finally,
some usage scenarios for these methodologies will be presented and
discussed
- âŠ