The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
Hybrid Periodical Flooding in Unstructured Peer-to-Peer NetworksZhenyun Zhuang
This document proposes a new search mechanism called Hybrid Periodical Flooding (HPF) for unstructured peer-to-peer networks. HPF aims to reduce unnecessary traffic like blind flooding while also addressing the "partial coverage problem" of some statistics-based search mechanisms. It introduces the concept of Periodical Flooding (PF), which controls the number of neighbors a query is forwarded to based on the time-to-live value. This allows the forwarding behavior to change periodically over the query's lifetime. HPF then combines PF with weighted selection of neighbors based on multiple metrics to guide queries towards potentially relevant results while exploring more of the network.
A Distributed Approach to Solving Overlay Mismatching ProblemZhenyun Zhuang
This document proposes an algorithm called Adaptive Connection Establishment (ACE) to address the topology mismatch problem between the logical overlay network and physical underlying network in unstructured peer-to-peer systems. ACE builds a minimum spanning tree among each source node and its neighbors within a certain diameter, optimizes connections not on the tree to reduce redundant traffic, while retaining search scope. It evaluates tradeoffs between topology optimization and information exchange overhead by changing the diameter. Simulation results show ACE can significantly reduce unnecessary P2P traffic by efficiently matching the overlay and physical network topologies.
The International Journal of Engineering and Science (IJES)theijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
Analysis of Link State Resource Reservation Protocol for Congestion Managemen...ijgca
With the wide spread of WiFi hotspots, concentrated traffic workload on Smart Web (SW) can slow down
the network performance. This paper presents a congestion management strategy considering real time
activities in today’s smart web. With the SW context, cooperative packet recovery using resource
reservation procedure for TCP flows was adapted for mitigating packet losses. This is to maintain data
consistency between various access points of smart web hotspot. Using a real world scenario, it was
confirmed that generic TCP cannot handle traffic congestion in a SW hotspot network. With TCP in
scalable workload environments, continuous packet drops at the event of congestion remains obvious. This
is unacceptable for mission critical domains. An enhanced Link State Resource Reservation Protocol (LSRSVP)
which serves as dynamic feedback mechanism in smart web hotspots is presented. The contextual
behaviour was contrasted with the generic TCP model. For the LS-RSVP, a simulation experiment for TCP
connection between servers at the remote core layer and the access layer was carried out while using
selected benchmark metrics. From the results, under realistic workloads, a steady-state throughput
response was achieved by TCP LS-RSVP to about 3650Bits/secs compared with generic TCP plots in a
previous study. Considering network service availability, this was found to be dependent on fault-tolerance
of the hotspot network. From study, a high peak threshold of 0.009 (i.e. 90%) was observed. This shows
fairly acceptable service availability behaviour compared with the existing TCP schemes. For packet drop
effects, an analysis on the network behaviour with respect to the LS-RSVP yielded a drop response of about
0.000106 bits/sec which is much lower compared with the case with generic TCP with over 0.38 bits/sec.
The latency profile of average FTP download response was found to be 0.030secs, but with that of FTP
upload response, this yielded about 0.028 sec. The results from the study demonstrate efficiency and
optimality for realistic loads in Smart web contexts.
Evaluating content-centric communication over power line communication infras...Khaled Ben Driss
"Evaluating content-centric networking over PLC infrastructure for smart grids" (ci-joint), cet article sera présenté à la conférence AWICT du 07 au 09 Octobre 2015 (http://www.awict.net/)
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology
Hybrid Periodical Flooding in Unstructured Peer-to-Peer NetworksZhenyun Zhuang
This document proposes a new search mechanism called Hybrid Periodical Flooding (HPF) for unstructured peer-to-peer networks. HPF aims to reduce unnecessary traffic like blind flooding while also addressing the "partial coverage problem" of some statistics-based search mechanisms. It introduces the concept of Periodical Flooding (PF), which controls the number of neighbors a query is forwarded to based on the time-to-live value. This allows the forwarding behavior to change periodically over the query's lifetime. HPF then combines PF with weighted selection of neighbors based on multiple metrics to guide queries towards potentially relevant results while exploring more of the network.
A Distributed Approach to Solving Overlay Mismatching ProblemZhenyun Zhuang
This document proposes an algorithm called Adaptive Connection Establishment (ACE) to address the topology mismatch problem between the logical overlay network and physical underlying network in unstructured peer-to-peer systems. ACE builds a minimum spanning tree among each source node and its neighbors within a certain diameter, optimizes connections not on the tree to reduce redundant traffic, while retaining search scope. It evaluates tradeoffs between topology optimization and information exchange overhead by changing the diameter. Simulation results show ACE can significantly reduce unnecessary P2P traffic by efficiently matching the overlay and physical network topologies.
The International Journal of Engineering and Science (IJES)theijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
Analysis of Link State Resource Reservation Protocol for Congestion Managemen...ijgca
With the wide spread of WiFi hotspots, concentrated traffic workload on Smart Web (SW) can slow down
the network performance. This paper presents a congestion management strategy considering real time
activities in today’s smart web. With the SW context, cooperative packet recovery using resource
reservation procedure for TCP flows was adapted for mitigating packet losses. This is to maintain data
consistency between various access points of smart web hotspot. Using a real world scenario, it was
confirmed that generic TCP cannot handle traffic congestion in a SW hotspot network. With TCP in
scalable workload environments, continuous packet drops at the event of congestion remains obvious. This
is unacceptable for mission critical domains. An enhanced Link State Resource Reservation Protocol (LSRSVP)
which serves as dynamic feedback mechanism in smart web hotspots is presented. The contextual
behaviour was contrasted with the generic TCP model. For the LS-RSVP, a simulation experiment for TCP
connection between servers at the remote core layer and the access layer was carried out while using
selected benchmark metrics. From the results, under realistic workloads, a steady-state throughput
response was achieved by TCP LS-RSVP to about 3650Bits/secs compared with generic TCP plots in a
previous study. Considering network service availability, this was found to be dependent on fault-tolerance
of the hotspot network. From study, a high peak threshold of 0.009 (i.e. 90%) was observed. This shows
fairly acceptable service availability behaviour compared with the existing TCP schemes. For packet drop
effects, an analysis on the network behaviour with respect to the LS-RSVP yielded a drop response of about
0.000106 bits/sec which is much lower compared with the case with generic TCP with over 0.38 bits/sec.
The latency profile of average FTP download response was found to be 0.030secs, but with that of FTP
upload response, this yielded about 0.028 sec. The results from the study demonstrate efficiency and
optimality for realistic loads in Smart web contexts.
Evaluating content-centric communication over power line communication infras...Khaled Ben Driss
"Evaluating content-centric networking over PLC infrastructure for smart grids" (ci-joint), cet article sera présenté à la conférence AWICT du 07 au 09 Octobre 2015 (http://www.awict.net/)
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology
The document discusses optimizing search performance in unstructured peer-to-peer networks by improving the overlay topology. Existing approaches organize peers based on similarity but do not provide performance guarantees. The proposed approach presents a novel overlay construction algorithm that exploits the power-law file sharing pattern exhibited in P2P networks. It provides rigorous guarantees including searching in O(logN) hops with high probability and progressively exploiting peer similarity. Simulations show it outperforms competing algorithms in reducing query hops, improving success ratio, and minimizing messaging overhead.
A NEW ALGORITHM FOR CONSTRUCTION OF A P2P MULTICAST HYBRID OVERLAY TREE BASED...csandit
In the last decade Peer to Peer technology has been thoroughly explored, because it overcomes many limitations compared to the traditional client server paradigm. Despite its advantages over a traditional approach, the ubiquitous availability of high speed, high bandwidth and low latency networks has supported the traditional client-server paradigm. Recently, however, the surge of streaming services has spawned renewed interest in Peer to Peer technologies. In addition, services like geolocation databases and browser technologies like Web-RTC make a hybrid approach attractive.
This document provides summaries of 15 networking projects from TTA including the project code, title, description, and reference. The projects cover topics like delay analysis of opportunistic spectrum access MAC protocols, load balancing for network traffic measurement, key exchange protocols for parallel network file systems, anomaly detection in intrusion detection systems, and energy efficient group key agreement for wireless networks. The document provides contact information at the end for obtaining full project papers.
This document presents a formal specification and validation of multiparty WebRTC conferencing systems using the Specification and Description Language (SDL). The authors first provide an overview of multiparty conferencing systems and the challenges of using WebRTC for these systems. They then discuss their SDL model, which models the signaling and control planes of a multiparty conferencing system. Finally, they discuss validating their SDL model to check for design errors.
This document provides a comparative analysis of two main hierarchical distributed hash table (DHT) systems - the homogenous design and the superpeer design. It presents an analytical framework and cost model to evaluate these designs. The analysis reveals that contrary to initial expectations, the costs incurred by the hierarchical superpeer design are not necessarily minimized. Key aspects of the two designs like load balancing, fault tolerance, and advantages/disadvantages are discussed. The document aims to help identify the better hierarchical DHT design for a given workload or application.
Peer to Peer Approach based Replica and Locality Awareness to Manage and Diss...IJCNCJournal
Distributed Hash Table (DHT) based structured peer-to-peer (P2P) systems provide an efficient method of disseminating information in a VANET environment owing to its high performance and properties (e.g., self-organization, decentralization, scalability, etc.). The topology of ad hoc vehicle networks (VANET) varies dynamically; its disconnections are frequent due to the high movement of vehicles. In such a topology, information availability is an ultimate problem for vehicles, in general, connect and disconnect frequently from the network. Data replication is an appropriate and adequate solution to this problem. In this contribution, to increase the accessibility of data, which also increases the success rate of the lookup, a method based on replication in the Vanet network is proposed named LAaR-Vanet. Also, this replication strategy is combined with a locality-awareness method to promote the same purpose and to avoid the problems of long paths. The performance of the proposed solution is assessed by a series of in-depth simulations in urban areas. The obtained results indicate the efficiency of the proposed approach, in terms of the following metrics: lookup success rate, the delay, and the number of the logical hop.
Cataloging Of Sessions in Genuine Traffic by Packet Size Distribution and Ses...IOSR Journals
Abstract: Cataloging traffic keen on precise network applications is vital for application-aware network
organization and it turn into more taxing because modern applications incomprehensible their network
behaviors. Whereas port number-based classifiers work merely for a little renowned application and signaturebased
classifiers are not significant to encrypted packet payloads, researchers are inclined to classify network
traffic rooted in behaviors scrutinized in network applications. In this document, a session level Flood
Cataloging (SLFC) approach is proposed to organize network Floods as a session, which encompasses of
Floods in the equal discussion. SLFC initially classifies flood into the analogous applications by packet size
distribution (PSD) and subsequently faction Floods as sessions by port locality. With PSD, each Flood is
distorted into a set of points in a two-Dimension space and the remoteness among all Flood and the
representatives of preselected applications are calculated. The Flood is predicted as the application having a
least distance. Meanwhile, port locality is accustomed to cluster Floods as sessions since an application often
uses successive port statistics surrounded by a session. If flood of a session are categorized into diverse
applications, an arbitration algorithm is invoked to make the improvement.
Keywords: Flood Cataloging; session grouping; session Cataloging; packet size distribution
Developing QoS by Priority Routing for Real Time Data in Internet of Things (...IJCNCJournal
- The document discusses developing quality of service (QoS) in Internet of Things (IoT) networks by using priority routing for real-time data.
- It proposes a novel solution that integrates mobile ad hoc networks (MANETs) to improve delivery of high priority real-time application data over low latency MANET paths.
- Experimental results showed the proposed approach was effective in reducing network overhead and congestion, while also improving routing protocol performance in terms of packet delay and throughput.
Efficient IOT Based Sensor Data Analysis in Wireless Sensor Networks with Cloudiosrjce
This summary provides the key details from the document in 3 sentences:
The document proposes an efficient IoT-based sensor data analysis system in wireless sensor networks using cloud computing. It utilizes the Greedy Perimeter Stateless Routing (GPSR) algorithm to route sensor data to cloud storage. The system is evaluated through simulations analyzing parameters like packet delivery ratio, energy consumption, and delay.
New generations of applications call for new demands
that are totally different from previous uses of the Internet (e.g.,
cross-layer and network function virtualization), and the existing
networks are not optimized for these new demands due to being
overwhelmed by enormous numbers of external network
protocols. Overlay network technologies aim to respond to such
future network demands. Systems on overlay networks mitigate
this protocol overload by exploiting the unlimited
programmability of the overlay nodes comprising the system.
This paper proposes an overlay node that works as a transparent
proxy server and router for encrypted communication over
overlay networks. This overlay node acts as a virtual switch over
multiple layers of the OSI reference model (the datalink, network, transport, and session layers) using general-purpose components (a personal computer, physical network interface card, and
virtual network interface card, developed using the C language).
The ideas behind this proposal derive from the effectiveness of
software-defined networks and network function virtualization.
Finally, we examine the performance of the overlay node
experimentally and suggest possible designs for future overlay
networks.
M phil-computer-science-wireless-communication-projectsVijay Karan
List of Wireless Communication IEEE 2006 Projects. It Contains the IEEE Projects in the Domain Wireless Communication for M.Phil Computer Science students.
ANALYSIS STUDY ON CACHING AND REPLICA PLACEMENT ALGORITHM FOR CONTENT DISTRIB...ijp2p
Recently there has been significant research focus on distributed computing network massively caching
and replica placement problems for content distribution in globally. Peer-to-Peer (P2P) network provides
dynamically decentralized, self organized, scalable objects in distributed computing system. However such
networks suffer from high latency, network traffic and cache update problems. The existing caching and
replica placement techniques for placing objects across peer-to-peer network have no complete solution to
these problems. This paper presents an overview of the current challenges present in P2P overlay
networks, followed by describes briefly the analysis study of the existing algorithms and their merits and
demerits. And also suggest a new popularity based QoS-aware(Quality of Service) smart replica
placement algorithm for content distribution in peer- to-peer overlay networks which overcomes the access
latency, fault tolerance, network traffic and redundancy problems with low cost. The new algorithm
suggested is based on the outcome of the analysis study
This document describes a peer-to-peer messaging system built using the JXTA platform. The system allows instant messages to be sent between peers in a decentralized JXTA network. JXTA defines protocols for peer-to-peer communication, where all peers have equal status and can request or provide services. The system includes a JXTA relay that receives commands from J2ME clients, performs actions on their behalf, and represents the clients on the JXTA network by discovering peers and routing messages. The goal of the project is to enable instant messaging between peers in a peer-to-peer manner without a centralized server.
A Generic Open Source Framework for Auto Generation of Data Manipulation Comm...iosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
The document discusses predicting human behavior and privacy issues in online social networks. It covers topics like understanding human behavior in social communities, user data management and inference, enabling new human experiences through reality mining and context awareness, and privacy concerns in online social networks. Architectural frameworks and methodologies are presented for managing user data, generating new knowledge, and exposing services to predict behavior and enhance experiences while maintaining user privacy.
MOBILE CROWD SENSING RPL-BASED ROUTING PROTOCOL FOR SMART CITY IJCNCJournal
This document describes a new routing protocol called MCS-RPL for mobile crowd sensing applications in smart cities. MCS-RPL is based on the RPL routing protocol and introduces improvements to address RPL's issues with mobility support. It utilizes a clustering mechanism and 2D grid structure to reduce control overhead from frequent topology changes. The performance evaluation shows MCS-RPL delivers a higher packet delivery ratio and lower power consumption compared to RPL, with reductions in control packet overhead of over 75% in tested scenarios. MCS-RPL provides an alternative for mobile devices in smart city applications to opportunistically send collected sensor data to a central server without using cellular networks.
This document contains information about several M.Phil Computer Science Cloud Computing projects written in C# and NS2. It provides the titles, languages, links, and short abstracts for each project. The projects focus on topics related to cloud computing including secure cloud storage, data integrity verification, privacy-preserving auditing, and keyword search over encrypted cloud data.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
International Journal of Peer to Peer Networks (IJP2P) Vol.6, No.2, August 20...ijp2p
In recent years, research efforts tried to exploit peer-to-peer (P2P) systems in order to provide Live
Streaming (LS) and Video-on-Demand (VoD) services. Most of these research efforts focus on the
development of distributed P2P block schedulers for content exchange among the participating peers and
on the characteristics of the overlay graph (P2P overlay) that interconnects the set of these peers.
Currently, researchers try to combine peer-to-peer systems with cloud infrastructures. They developed
monitoring and control architectures that use resources from the cloud in order to enhance QoS and
achieve an attractive trade-off between stability and low cost operation. However, there is a lack of
research effort on the congestion control of these systems and the existing congestion control architectures
are not suitable for P2P live streaming traffic (small sequential non persistent traffic towards multiple
network locations). This paper proposes a P2P live streaming traffic aware congestion control protocol
that: i) is capable to manage sequential traffic heading to multiple network destinations , ii) efficiently
exploits the available bandwidth, iii) accurately measures the idle peer resources, iv) avoids network
congestion, and v) is friendly to traditional TCP generated traffic. The proposed P2P congestion control
has been implemented, tested and evaluated through a series of real experiments powered across the
BonFIRE infrastructure
This document summarizes a research paper that proposes a congestion control protocol for peer-to-peer live streaming systems. The protocol is designed to handle sequential traffic heading to multiple destinations efficiently, measure available bandwidth accurately, avoid network congestion, and be friendly to traditional TCP traffic. It was implemented and evaluated on a testbed. The key aspects of the proposed protocol are that it controls transmission rates based on acknowledgments from receivers to keep bottleneck queue sizes stable, and aims to fully utilize bandwidth while avoiding bufferbloat.
In recent years, research efforts tried to exploit peer-to-peer (P2P) systems in order to provide Live Streaming (LS) and Video-on-Demand (VoD) services. Most of these research efforts focus on the development of distributed P2P block schedulers for content exchange among the participating peers and on the characteristics of the overlay graph (P2P overlay) that interconnects the set of these peers.Currently, researchers try to combine peer-to-peer systems with cloud infrastructures. They developed monitoring and control architectures that use resources from the cloud in order to enhance QoS and achieve an attractive trade-off between stability and low cost operation. However, there is a lack of
research effort on the congestion control of these systems and the existing congestion control architectures are not suitable for P2P live streaming traffic (small sequential non persistent traffic towards multiple network locations). This paper proposes a P2P live streaming traffic aware congestion control protocol that: i) is capable to manage sequential traffic heading to multiple network destinations , ii) efficiently exploits the available bandwidth, iii) accurately measures the idle peer resources, iv) avoids network congestion, and v) is friendly to traditional TCP generated traffic.The proposed P2P congestion control has been implemented, tested and evaluated through a series of real experiments powered across the BonFIRE infrastructure.
In recent years, research efforts tried to exploit peer-to-peer (P2P) systems in order to provide Live
Streaming (LS) and Video-on-Demand (VoD) services. Most of these research efforts focus on the
development of distributed P2P block schedulers for content exchange among the participating peers and
on the characteristics of the overlay graph (P2P overlay) that interconnects the set of these peers.
Currently, researchers try to combine peer-to-peer systems with cloud infrastructures. They developed
monitoring and control architectures that use resources from the cloud in order to enhance QoS and
achieve an attractive trade-off between stability and low cost operation. However, there is a lack of
research effort on the congestion control of these systems and the existing congestion control architectures
are not suitable for P2P live streaming traffic (small sequential non persistent traffic towards multiple
network locations). This paper proposes a P2P live streaming traffic aware congestion control protocol
that: i) is capable to manage sequential traffic heading to multiple network destinations , ii) efficiently
exploits the available bandwidth, iii) accurately measures the idle peer resources, iv) avoids network
congestion, and v) is friendly to traditional TCP generated traffic. The proposed P2P congestion control
has been implemented, tested and evaluated through a series of real experiments powered across the
BonFIRE infrastructure.
The document discusses optimizing search performance in unstructured peer-to-peer networks by improving the overlay topology. Existing approaches organize peers based on similarity but do not provide performance guarantees. The proposed approach presents a novel overlay construction algorithm that exploits the power-law file sharing pattern exhibited in P2P networks. It provides rigorous guarantees including searching in O(logN) hops with high probability and progressively exploiting peer similarity. Simulations show it outperforms competing algorithms in reducing query hops, improving success ratio, and minimizing messaging overhead.
A NEW ALGORITHM FOR CONSTRUCTION OF A P2P MULTICAST HYBRID OVERLAY TREE BASED...csandit
In the last decade Peer to Peer technology has been thoroughly explored, because it overcomes many limitations compared to the traditional client server paradigm. Despite its advantages over a traditional approach, the ubiquitous availability of high speed, high bandwidth and low latency networks has supported the traditional client-server paradigm. Recently, however, the surge of streaming services has spawned renewed interest in Peer to Peer technologies. In addition, services like geolocation databases and browser technologies like Web-RTC make a hybrid approach attractive.
This document provides summaries of 15 networking projects from TTA including the project code, title, description, and reference. The projects cover topics like delay analysis of opportunistic spectrum access MAC protocols, load balancing for network traffic measurement, key exchange protocols for parallel network file systems, anomaly detection in intrusion detection systems, and energy efficient group key agreement for wireless networks. The document provides contact information at the end for obtaining full project papers.
This document presents a formal specification and validation of multiparty WebRTC conferencing systems using the Specification and Description Language (SDL). The authors first provide an overview of multiparty conferencing systems and the challenges of using WebRTC for these systems. They then discuss their SDL model, which models the signaling and control planes of a multiparty conferencing system. Finally, they discuss validating their SDL model to check for design errors.
This document provides a comparative analysis of two main hierarchical distributed hash table (DHT) systems - the homogenous design and the superpeer design. It presents an analytical framework and cost model to evaluate these designs. The analysis reveals that contrary to initial expectations, the costs incurred by the hierarchical superpeer design are not necessarily minimized. Key aspects of the two designs like load balancing, fault tolerance, and advantages/disadvantages are discussed. The document aims to help identify the better hierarchical DHT design for a given workload or application.
Peer to Peer Approach based Replica and Locality Awareness to Manage and Diss...IJCNCJournal
Distributed Hash Table (DHT) based structured peer-to-peer (P2P) systems provide an efficient method of disseminating information in a VANET environment owing to its high performance and properties (e.g., self-organization, decentralization, scalability, etc.). The topology of ad hoc vehicle networks (VANET) varies dynamically; its disconnections are frequent due to the high movement of vehicles. In such a topology, information availability is an ultimate problem for vehicles, in general, connect and disconnect frequently from the network. Data replication is an appropriate and adequate solution to this problem. In this contribution, to increase the accessibility of data, which also increases the success rate of the lookup, a method based on replication in the Vanet network is proposed named LAaR-Vanet. Also, this replication strategy is combined with a locality-awareness method to promote the same purpose and to avoid the problems of long paths. The performance of the proposed solution is assessed by a series of in-depth simulations in urban areas. The obtained results indicate the efficiency of the proposed approach, in terms of the following metrics: lookup success rate, the delay, and the number of the logical hop.
Cataloging Of Sessions in Genuine Traffic by Packet Size Distribution and Ses...IOSR Journals
Abstract: Cataloging traffic keen on precise network applications is vital for application-aware network
organization and it turn into more taxing because modern applications incomprehensible their network
behaviors. Whereas port number-based classifiers work merely for a little renowned application and signaturebased
classifiers are not significant to encrypted packet payloads, researchers are inclined to classify network
traffic rooted in behaviors scrutinized in network applications. In this document, a session level Flood
Cataloging (SLFC) approach is proposed to organize network Floods as a session, which encompasses of
Floods in the equal discussion. SLFC initially classifies flood into the analogous applications by packet size
distribution (PSD) and subsequently faction Floods as sessions by port locality. With PSD, each Flood is
distorted into a set of points in a two-Dimension space and the remoteness among all Flood and the
representatives of preselected applications are calculated. The Flood is predicted as the application having a
least distance. Meanwhile, port locality is accustomed to cluster Floods as sessions since an application often
uses successive port statistics surrounded by a session. If flood of a session are categorized into diverse
applications, an arbitration algorithm is invoked to make the improvement.
Keywords: Flood Cataloging; session grouping; session Cataloging; packet size distribution
Developing QoS by Priority Routing for Real Time Data in Internet of Things (...IJCNCJournal
- The document discusses developing quality of service (QoS) in Internet of Things (IoT) networks by using priority routing for real-time data.
- It proposes a novel solution that integrates mobile ad hoc networks (MANETs) to improve delivery of high priority real-time application data over low latency MANET paths.
- Experimental results showed the proposed approach was effective in reducing network overhead and congestion, while also improving routing protocol performance in terms of packet delay and throughput.
Efficient IOT Based Sensor Data Analysis in Wireless Sensor Networks with Cloudiosrjce
This summary provides the key details from the document in 3 sentences:
The document proposes an efficient IoT-based sensor data analysis system in wireless sensor networks using cloud computing. It utilizes the Greedy Perimeter Stateless Routing (GPSR) algorithm to route sensor data to cloud storage. The system is evaluated through simulations analyzing parameters like packet delivery ratio, energy consumption, and delay.
New generations of applications call for new demands
that are totally different from previous uses of the Internet (e.g.,
cross-layer and network function virtualization), and the existing
networks are not optimized for these new demands due to being
overwhelmed by enormous numbers of external network
protocols. Overlay network technologies aim to respond to such
future network demands. Systems on overlay networks mitigate
this protocol overload by exploiting the unlimited
programmability of the overlay nodes comprising the system.
This paper proposes an overlay node that works as a transparent
proxy server and router for encrypted communication over
overlay networks. This overlay node acts as a virtual switch over
multiple layers of the OSI reference model (the datalink, network, transport, and session layers) using general-purpose components (a personal computer, physical network interface card, and
virtual network interface card, developed using the C language).
The ideas behind this proposal derive from the effectiveness of
software-defined networks and network function virtualization.
Finally, we examine the performance of the overlay node
experimentally and suggest possible designs for future overlay
networks.
M phil-computer-science-wireless-communication-projectsVijay Karan
List of Wireless Communication IEEE 2006 Projects. It Contains the IEEE Projects in the Domain Wireless Communication for M.Phil Computer Science students.
ANALYSIS STUDY ON CACHING AND REPLICA PLACEMENT ALGORITHM FOR CONTENT DISTRIB...ijp2p
Recently there has been significant research focus on distributed computing network massively caching
and replica placement problems for content distribution in globally. Peer-to-Peer (P2P) network provides
dynamically decentralized, self organized, scalable objects in distributed computing system. However such
networks suffer from high latency, network traffic and cache update problems. The existing caching and
replica placement techniques for placing objects across peer-to-peer network have no complete solution to
these problems. This paper presents an overview of the current challenges present in P2P overlay
networks, followed by describes briefly the analysis study of the existing algorithms and their merits and
demerits. And also suggest a new popularity based QoS-aware(Quality of Service) smart replica
placement algorithm for content distribution in peer- to-peer overlay networks which overcomes the access
latency, fault tolerance, network traffic and redundancy problems with low cost. The new algorithm
suggested is based on the outcome of the analysis study
This document describes a peer-to-peer messaging system built using the JXTA platform. The system allows instant messages to be sent between peers in a decentralized JXTA network. JXTA defines protocols for peer-to-peer communication, where all peers have equal status and can request or provide services. The system includes a JXTA relay that receives commands from J2ME clients, performs actions on their behalf, and represents the clients on the JXTA network by discovering peers and routing messages. The goal of the project is to enable instant messaging between peers in a peer-to-peer manner without a centralized server.
A Generic Open Source Framework for Auto Generation of Data Manipulation Comm...iosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
The document discusses predicting human behavior and privacy issues in online social networks. It covers topics like understanding human behavior in social communities, user data management and inference, enabling new human experiences through reality mining and context awareness, and privacy concerns in online social networks. Architectural frameworks and methodologies are presented for managing user data, generating new knowledge, and exposing services to predict behavior and enhance experiences while maintaining user privacy.
MOBILE CROWD SENSING RPL-BASED ROUTING PROTOCOL FOR SMART CITY IJCNCJournal
This document describes a new routing protocol called MCS-RPL for mobile crowd sensing applications in smart cities. MCS-RPL is based on the RPL routing protocol and introduces improvements to address RPL's issues with mobility support. It utilizes a clustering mechanism and 2D grid structure to reduce control overhead from frequent topology changes. The performance evaluation shows MCS-RPL delivers a higher packet delivery ratio and lower power consumption compared to RPL, with reductions in control packet overhead of over 75% in tested scenarios. MCS-RPL provides an alternative for mobile devices in smart city applications to opportunistically send collected sensor data to a central server without using cellular networks.
This document contains information about several M.Phil Computer Science Cloud Computing projects written in C# and NS2. It provides the titles, languages, links, and short abstracts for each project. The projects focus on topics related to cloud computing including secure cloud storage, data integrity verification, privacy-preserving auditing, and keyword search over encrypted cloud data.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
International Journal of Peer to Peer Networks (IJP2P) Vol.6, No.2, August 20...ijp2p
In recent years, research efforts tried to exploit peer-to-peer (P2P) systems in order to provide Live
Streaming (LS) and Video-on-Demand (VoD) services. Most of these research efforts focus on the
development of distributed P2P block schedulers for content exchange among the participating peers and
on the characteristics of the overlay graph (P2P overlay) that interconnects the set of these peers.
Currently, researchers try to combine peer-to-peer systems with cloud infrastructures. They developed
monitoring and control architectures that use resources from the cloud in order to enhance QoS and
achieve an attractive trade-off between stability and low cost operation. However, there is a lack of
research effort on the congestion control of these systems and the existing congestion control architectures
are not suitable for P2P live streaming traffic (small sequential non persistent traffic towards multiple
network locations). This paper proposes a P2P live streaming traffic aware congestion control protocol
that: i) is capable to manage sequential traffic heading to multiple network destinations , ii) efficiently
exploits the available bandwidth, iii) accurately measures the idle peer resources, iv) avoids network
congestion, and v) is friendly to traditional TCP generated traffic. The proposed P2P congestion control
has been implemented, tested and evaluated through a series of real experiments powered across the
BonFIRE infrastructure
This document summarizes a research paper that proposes a congestion control protocol for peer-to-peer live streaming systems. The protocol is designed to handle sequential traffic heading to multiple destinations efficiently, measure available bandwidth accurately, avoid network congestion, and be friendly to traditional TCP traffic. It was implemented and evaluated on a testbed. The key aspects of the proposed protocol are that it controls transmission rates based on acknowledgments from receivers to keep bottleneck queue sizes stable, and aims to fully utilize bandwidth while avoiding bufferbloat.
In recent years, research efforts tried to exploit peer-to-peer (P2P) systems in order to provide Live Streaming (LS) and Video-on-Demand (VoD) services. Most of these research efforts focus on the development of distributed P2P block schedulers for content exchange among the participating peers and on the characteristics of the overlay graph (P2P overlay) that interconnects the set of these peers.Currently, researchers try to combine peer-to-peer systems with cloud infrastructures. They developed monitoring and control architectures that use resources from the cloud in order to enhance QoS and achieve an attractive trade-off between stability and low cost operation. However, there is a lack of
research effort on the congestion control of these systems and the existing congestion control architectures are not suitable for P2P live streaming traffic (small sequential non persistent traffic towards multiple network locations). This paper proposes a P2P live streaming traffic aware congestion control protocol that: i) is capable to manage sequential traffic heading to multiple network destinations , ii) efficiently exploits the available bandwidth, iii) accurately measures the idle peer resources, iv) avoids network congestion, and v) is friendly to traditional TCP generated traffic.The proposed P2P congestion control has been implemented, tested and evaluated through a series of real experiments powered across the BonFIRE infrastructure.
In recent years, research efforts tried to exploit peer-to-peer (P2P) systems in order to provide Live
Streaming (LS) and Video-on-Demand (VoD) services. Most of these research efforts focus on the
development of distributed P2P block schedulers for content exchange among the participating peers and
on the characteristics of the overlay graph (P2P overlay) that interconnects the set of these peers.
Currently, researchers try to combine peer-to-peer systems with cloud infrastructures. They developed
monitoring and control architectures that use resources from the cloud in order to enhance QoS and
achieve an attractive trade-off between stability and low cost operation. However, there is a lack of
research effort on the congestion control of these systems and the existing congestion control architectures
are not suitable for P2P live streaming traffic (small sequential non persistent traffic towards multiple
network locations). This paper proposes a P2P live streaming traffic aware congestion control protocol
that: i) is capable to manage sequential traffic heading to multiple network destinations , ii) efficiently
exploits the available bandwidth, iii) accurately measures the idle peer resources, iv) avoids network
congestion, and v) is friendly to traditional TCP generated traffic. The proposed P2P congestion control
has been implemented, tested and evaluated through a series of real experiments powered across the
BonFIRE infrastructure.
A NEW ALGORITHM FOR CONSTRUCTION OF A P2P MULTICAST HYBRID OVERLAY TREE BASED...cscpconf
In the last decade Peer to Peer technology has been thoroughly explored, because it overcomes many limitations compared to the traditional client server paradigm. Despite its advantages over a traditional approach, the ubiquitous availability of high speed, high bandwidth and low latency networks has supported the traditional client-server paradigm. Recently, however, the surge of streaming services has spawned renewed interest in Peer to Peer technologies. In addition, services like geolocation databases and browser technologies like Web-RTC make a hybrid approach attractive. In this paper we present algorithms for the construction and the maintenance of a hybrid P2P overlay multicast tree based on topological distances. The essential idea of these algorithms is to build a multicast tree by choosing neighbours close to each other. The topological distances can be easily obtained by the browser using the geolocation API. Thus the implementation of algorithms can be done web-based in a distributed manner. We present proofs of our algorithms as well as practical results and evaluations.
In the last decade Peer to Peer technology has been thoroughly explored, becauseit overcomes many limitations compared to the traditional client server paradigm. Despite its advantages over a traditional approach, the ubiquitous availability of high speed, high bandwidth and low latency networks has supported the traditional client-server paradigm. Recently, however, the surge of streaming services has spawned renewed interest in Peer to Peer technologies. In addition, services like geolocation databases and browser technologies like Web-RTC make a hybrid approach attractive.
In this paper we present algorithms for the construction and the maintenance of a hybrid P2P overlay multicast tree based on topological distances. The essential idea of these algorithms is to build a multicast tree by choosing neighbours close to each other. The topological distances can be easily obtained by the browser using the geolocation API. Thus the implementation of algorithms can be done web-based in a distributed manner.
We present proofs of our algorithms as well as experimental results and evaluations.
Flexible bloom for searching textual contentUvaraj Shan
This document describes BloomCast, a system that uses Bloom filters to encode document content and replicate it across peers in an unstructured peer-to-peer (P2P) network. BloomCast aims to achieve high recall for search queries at low communication cost. It hybridizes a lightweight distributed hash table (DHT) with the P2P overlay to enable random node sampling and network size estimation. The DHT helps meet two constraints: query and document replicas are randomly distributed across the network, and peers know the network size. By uniformly replicating content across the network, BloomCast can guarantee search recall. It utilizes Bloom filters to compress document replicas and reduce replication costs.
Flexible bloom for searching textual contentUvaraj Shan
This document presents the BloomCast scheme for efficient full-text retrieval in unstructured peer-to-peer networks. BloomCast replicates document content across the network in the form of Bloom filters to reduce communication costs while still guaranteeing recall. It hybridizes a lightweight distributed hash table with the unstructured overlay to support random node sampling and network size estimation. Queries are evaluated based on Bloom filter membership verification to support full-text searches with the potential for false positives but no false negatives. The system aims to provide efficient and effective full-text retrieval in unstructured P2P networks.
A P2P Job Assignment Protocol For Volunteer Computing SystemsAshley Smith
This document proposes a peer-to-peer job assignment protocol for volunteer computing systems. It introduces a distributed algorithm that aims to efficiently distribute jobs to workers in a decentralized manner. The key aspects are:
1) Jobs are described by job adverts that are distributed to multiple job assigners by a job manager.
2) Workers request jobs by querying job assigners, who match workers to available job adverts.
3) Input data is retrieved in a similar decentralized fashion through data queries and responses from data centers caching input files.
4) A simulation study shows this decentralized approach can improve performance metrics like overall job completion time and network load balancing, compared to a centralized job assignment system.
IDENTIFICATION OF EFFICIENT PEERS IN P2P COMPUTING SYSTEM FOR REAL TIME APPLI...ijp2p
Currently the Peer-to-Peer computing paradigm rises as an economic solution for the large scale
computation problems. However due to the dynamic nature of peers it is very difficult to use this type of
systems for the computations of real time applications. Strict deadline of scientific and real time
applications require predictable performance in such applications. We propose an algorithm to identify the
group of reliable peers, from the available peers on the Internet, for the processing of real time
application’s tasks. The algorithm is based on joint evaluation of peer properties like peer availability,
credibility, computation time and the turnaround time of the peer with respect to the task distributor peer.
Here we also define a method to calculate turnaround time (distance) on task distributor peers at
application level.
IDENTIFICATION OF EFFICIENT PEERS IN P2P COMPUTING SYSTEM FOR REAL TIME APPLI...ijp2p
Currently the Peer-to-Peer computing paradigm rises as an economic solution for the large scale
computation problems. However due to the dynamic nature of peers it is very difficult to use this type of
systems for the computations of real time applications. Strict deadline of scientific and real time
applications require predictable performance in such applications. We propose an algorithm to identify the
group of reliable peers, from the available peers on the Internet, for the processing of real time
application’s tasks. The algorithm is based on joint evaluation of peer properties like peer availability,
credibility, computation time and the turnaround time of the peer with respect to the task distributor peer.
Here we also define a method to calculate turnaround time (distance) on task distributor peers at
application level.
Effective Approach For Content Based Image Retrieval In Peer-Peer To NetworksIRJET Journal
The document describes a proposed approach for content-based image retrieval in peer-to-peer networks. Existing methods represent images as high-dimensional feature vectors and index them using distributed high-dimensional indexes or locality sensitive hashing over distributed hash tables. However, these approaches have high network costs and workload imbalances. The proposed approach uses the bag-of-visual-words model to represent images, building inverted indexes of visual codewords over the distributed hash table. It also develops a dynamic codebook updating method to optimize the mutual information between the codebook and relevance information, balancing the workload among nodes as the peer-to-peer network and data evolve dynamically.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
This document summarizes the CoQUOS approach for maintaining consistency of continuous queries in unstructured peer-to-peer networks. CoQUOS is a lightweight middleware that supports registering long-standing queries and notifying peers when new matching content appears. It uses cluster-resilient random walks and dynamic probability-based query registration. The consistency maintenance mechanism ensures timely updates and avoids unnecessary replication by adaptively polling replicas based on query and update rates. Evaluation shows CoQUOS achieves high consistency efficiency at low cost.
SECURITY CONSIDERATION IN PEER-TO-PEER NETWORKS WITH A CASE STUDY APPLICATIONIJNSA Journal
Peer-to-Peer (P2P) overlay networks wide adoption has also created vast dangers due to the millions of users who are not conversant with the potential security risks. Lack of centralized control creates great risks to the P2P systems. This is mainly due to the inability to implement proper authentication approaches for threat management. The best possible solutions, however, include encryption, utilization of administration, implementing cryptographic protocols, avoiding personal file sharing, and unauthorized downloads. Recently a new non-DHT based structured P2P system is very suitable for designing secured communication protocols. This approach is based on Linear Diophantine Equation (LDE) [1]. The P2P architectures based on this protocol offer simplified methods to integrate symmetric and asymmetric cryptographies’ solutions into the P2P architecture with no need of utilizing Transport Layer Security (TLS), and its predecessor, Secure Sockets Layer (SSL) protocols.
Today over the Internet, communication and computing environments are considerably and significantly becoming more and more chaotic and complex than normal classical distributed systems that have some lacking of any hierarchical control and some centralized organization. There in the emerging of Peer-to-Peer (P2P) networks overlays has become of much interest because P2P networks provide a good quality substrate to create a large scale content distribution, data sharing, and multicast applications at the application-level. P2P networks are commonly used as “file-swapping” in any network to provide support in sharing of distributed contents. For data and file sharing, a number of P2P networks have been deployed and developed. Gnutella, Fast track and Napster are three popular and commonly used P2P networking systems. In this research a broad overview of P2P networks computing is presented. This research is focusing on content sharing technologies, networks and techniques. In this research, it is also tried to emphasize on the study and analysis of popular P2P network topologies used in
networking systems. This research is also focuses, identifies and describes the most common architecture models of P2P networks and compares different properties, characteristics and features of four P2P systems—Fast track, Gnutella, Open FT and Napster. In P2P organization, every peer grosses mutually the parts of the server as well of the client. By way of a client, it can demand and copy its required record files from additional peers, and in place of a server, it can offer data files to additional peers. The survey basically analyzes and outlines the basic structuring of P2P networks together with their analysis, comparison, applications, advantages, and
disadvantages. The survey presents numerous organized and unstructured P2P structures.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Peer-to-Peer Architecture Case Study Gnutella NetworkMate.docxherbertwilson5999
Peer-to-Peer Architecture Case Study: Gnutella Network
Matei Ripeanu
Computer Science Department,
The University of Chicago
[email protected]
Abstract
Despite recent excitement generated by the P2P
paradigm and despite surprisingly fast deployment of
some P2P applications, there are few quantitative
evaluations of P2P systems behavior. Due to its open
architecture and achieved scale, Gnutella is an
interesting P2P architecture case study. Gnutella, like
most other P2P applications, builds at the application
level a virtual network with its own routing mechanisms.
The topology of this overlay network and the routing
mechanisms used have a significant influence on
application properties such as performance, reliability,
and scalability. We built a ‘crawler’ to extract the
topology of Gnutella’s application level network, we
analyze the topology graph and evaluate generated
network traffic. We find that although Gnutella is not a
pure power-law network, its current configuration has the
benefits and drawbacks of a power-law structure. These
findings lead us to propose changes to Gnutella protocol
and implementations that bring significant performance
and scalability improvements.
1. Introduction
Peer-to-peer systems (P2P) have emerged as a
significant social and technical phenomenon over the last
year. P2P systems provide infrastructure for communities
that share CPU cycles (e.g., Entropia, [email protected])
and/or, storage space (e.g., FreeNet, Gnutella), or that
support interpersonal collaborative environments. Two
factors have fostered the recent explosive growth of such
systems: first, the low cost and high availability of huge
computing and storage resources, and second, increased
network connectivity. As these trends continue, the P2P
paradigm can be expected to become more popular.
Peer-to-peer networks allow individual computers to
communicate directly with each other and to share
information and resources without using specialized
‘servers’. A common characteristic of this new breed of
applications is that they build, at the application level, a
virtual network with its own routing mechanisms. The
topology of this virtual network and the routing
mechanisms used have a significant influence on
application properties such as performance, reliability,
and, in some cases, anonymity. The virtual topology also
determines the communication costs incurred when
running the P2P application.
These considerations have motivated us to conduct a
detailed study of the topology and protocol of a popular
P2P system, Gnutella. In this study, we benefited from
Gnutella’s large existing user base and open architecture,
and, in effect, use the public Gnutella network as a large-
scale, if uncontrolled, testbed. We capture the network
topology, the generated traffic, and the resources’
dynamic behavior. We use our findings to evaluate costs
and benefits of the P2P approach and to investigate
possible improvements to the routing protocol that would
a.
AN INITIAL PEER CONFIGURATION ALGORITHM FOR MULTI-STREAMING PEER-TO-PEER NETW...ijp2p
The growth of the Internet technology enables us to use network applications for streaming audio and
video.Especially, real-time streaming services using peer-to-peer (P2P) technology are currently
emerging.An important issue on P2P streaming is how to construct a logical network (overlay network) on
a physical network (IP network). In this paper, we propose an initial peer configuration algorithm for a
multi-streaming peer-to-peer network. The proposed algorithm is based on a mesh-pull approach where
any node has multiple parent and child nodes as neighboring nodes, and content transmitted between these
neighboring nodes depends on their parent-child relationships. Our simulation experiments show that the
proposed algorithm improves the number of joining node and traffic load.
Similar to Ontology-Based Routing for Large-Scale Unstructured P2P Publish/Subscribe System (20)
artificial intelligence and data science contents.pptxGauravCar
What is artificial intelligence? Artificial intelligence is the ability of a computer or computer-controlled robot to perform tasks that are commonly associated with the intellectual processes characteristic of humans, such as the ability to reason.
› ...
Artificial intelligence (AI) | Definitio
Electric vehicle and photovoltaic advanced roles in enhancing the financial p...IJECEIAES
Climate change's impact on the planet forced the United Nations and governments to promote green energies and electric transportation. The deployments of photovoltaic (PV) and electric vehicle (EV) systems gained stronger momentum due to their numerous advantages over fossil fuel types. The advantages go beyond sustainability to reach financial support and stability. The work in this paper introduces the hybrid system between PV and EV to support industrial and commercial plants. This paper covers the theoretical framework of the proposed hybrid system including the required equation to complete the cost analysis when PV and EV are present. In addition, the proposed design diagram which sets the priorities and requirements of the system is presented. The proposed approach allows setup to advance their power stability, especially during power outages. The presented information supports researchers and plant owners to complete the necessary analysis while promoting the deployment of clean energy. The result of a case study that represents a dairy milk farmer supports the theoretical works and highlights its advanced benefits to existing plants. The short return on investment of the proposed approach supports the paper's novelty approach for the sustainable electrical system. In addition, the proposed system allows for an isolated power setup without the need for a transmission line which enhances the safety of the electrical network
Batteries -Introduction – Types of Batteries – discharging and charging of battery - characteristics of battery –battery rating- various tests on battery- – Primary battery: silver button cell- Secondary battery :Ni-Cd battery-modern battery: lithium ion battery-maintenance of batteries-choices of batteries for electric vehicle applications.
Fuel Cells: Introduction- importance and classification of fuel cells - description, principle, components, applications of fuel cells: H2-O2 fuel cell, alkaline fuel cell, molten carbonate fuel cell and direct methanol fuel cells.
Use PyCharm for remote debugging of WSL on a Windo cf5c162d672e4e58b4dde5d797...shadow0702a
This document serves as a comprehensive step-by-step guide on how to effectively use PyCharm for remote debugging of the Windows Subsystem for Linux (WSL) on a local Windows machine. It meticulously outlines several critical steps in the process, starting with the crucial task of enabling permissions, followed by the installation and configuration of WSL.
The guide then proceeds to explain how to set up the SSH service within the WSL environment, an integral part of the process. Alongside this, it also provides detailed instructions on how to modify the inbound rules of the Windows firewall to facilitate the process, ensuring that there are no connectivity issues that could potentially hinder the debugging process.
The document further emphasizes on the importance of checking the connection between the Windows and WSL environments, providing instructions on how to ensure that the connection is optimal and ready for remote debugging.
It also offers an in-depth guide on how to configure the WSL interpreter and files within the PyCharm environment. This is essential for ensuring that the debugging process is set up correctly and that the program can be run effectively within the WSL terminal.
Additionally, the document provides guidance on how to set up breakpoints for debugging, a fundamental aspect of the debugging process which allows the developer to stop the execution of their code at certain points and inspect their program at those stages.
Finally, the document concludes by providing a link to a reference blog. This blog offers additional information and guidance on configuring the remote Python interpreter in PyCharm, providing the reader with a well-rounded understanding of the process.
Ontology-Based Routing for Large-Scale Unstructured P2P Publish/Subscribe System
1. The International Journal Of Engineering And Science (IJES)
|| Volume || 4 || Issue || 11 || Pages || PP -07-13|| 2015 ||
ISSN (e): 2319 – 1813 ISSN (p): 2319 – 1805
www.theijes.com The IJES Page 7
Ontology-Based Routing for Large-Scale Unstructured P2P
Publish/Subscribe System
1
Biao Dong, 2
Jinhui Chen
1
School of Computer & Software, Nanjing Institute of Industry Technology, Nanjing, China
2
School of Computer & Software, Nanjing University of Information Science & Technology, Nanjing, China
--------------------------------------------------------ABSTRACT-----------------------------------------------------------
Recent works in structured P2P systems exploit DHT to support publish/subscribe(Pub/Sub) protocols. Some of
these approaches require the existence of a so-called rendezvous node where subscriptions meet events, thus
easily creating bottlenecks. By contrast, unstructured P2P systems needn't maintain current topologies for the
networks, they are robust. We presents an ontology-based Pub/Sub event routing mechanism, called UP2S2, for
modeling and implementing the architecture of large-scale unstructured P2P Pub/Sub System. According to
subscription deviation, UP2S2 is divided into multiple subnets. There is a subscription probability tree in each
subscription subnet. Events are forwarded along the most likely subscription nodes. We design and implement the
algorithms for UP2S2 to construct and reconstruct subscription routing tables, and derive conclusions from the
simulation experiments. The results show that UP2S2 routes the events more quickly and accurately.
Keywords–LargeScale, P2P, Publish/Subscribe, Routing, Ontology
---------------------------------------------------------------------------------------------------------------------------------------
Date of Submission: 14 November 2015 Date of Accepted: 30 November 2015
---------------------------------------------------------------------------------------------------------------------------------------
I. INTRODUCTION
Pub/Sub is an asynchronous communication paradigm that supports many-to-many interactions between
a set of clients. Pub/Sub communication can be anonymous, where participants are decoupled from space, flow,
and time. A Pub/Sub system contains three kinds of clients: a publisher who publishes events, a subscriber who
subscribes his interests to the system, and an event broker network to match and deliver the events to the
corresponding subscribers. When an event is published, a Pub/Sub system doesn’t specify a specific subscriber.
After each agent node receives an event, it decides which nodes should be propagated in the next step. Therefore,
routing of Pub/Sub system is also called content-based routing(CBR). Routing algorithm resolves how to find an
appropriate path in event broker networks, and how to efficiently and reliably route event to the relevant
subscribers at a low cost. Both accuracy of event routing and network efficiency are the most important design
goals, which determines the size and scalability of the network.
P2P networking is a distributed application architecture that subnets tasks or work-loads between peers. We can
classify networks as unstructured or structured. Structured P2P systems impose a specific linkage structure
between nodes. In contrast, in unstructured P2P systems, peers are not linked according to a predefined
deterministic scheme. Instead, links are created either randomly, or are probabilistically based on some proximity
metric between nodes. Because of its advantages, such as rapid information dissemination, and content-based
routing, unstructured P2P network has been used to construct the Pub/Sub system in order to improve the ability to
improve the efficiency for event routing.
The rest of the paper is organized as follows. In Section 2, we review some related works. Our main methods
including the algorithms for constructing and reconstructing subscription routing tables in UP2S2 are presented in
Section 3. Both validations and evaluations are given in Section 4. Finally, the paper is concluded in Section 5.
II. RELATED WORK
Enabling the Pub/Sub services in P2P systems has thus become an interesting topic in recent years. The
structured P2P system has its advantage in searching efficiency. To provide subject-based Pub/Sub services, data
and queries with a certain topic can be easily mapped and routed to the same node using DHT. Chaabane proposed
an approach based on a community-wide ontology in order to allow publishers and subscribers to use a common
semantic space to characterize production and consumption of resources and services. Based on this ontology,
these ontology-based community topics are used to compute keys for routing events in a DHT[1]. Setty presented
PolderCast, a P2P architecture for topic-based Pub/Sub which aims to achieve relay-free, fast and robust
2. Ontology-Based Routing for Large-Scale Unstructured P2P…
www.theijes.com The IJES Page 8
dissemination over a scalable overlay with a minimal maintenance cost[2]. Pandey presented the architecture of
distributed mobile brokers which are dynamically reconfigurable in the form of structured P2P overlay and act as
rendezvous points for matching publications and subscriptions[3]. Pellegrino introduced two versions of a
content-based Pub/Sub matching algorithm for RDF described events, working on an adapted version of the CAN
structured P2P network designed to both store and disseminate RDF events[4]. Einziger introduced Postman, a
Pub/Sub architecture tailored for self-sustained service independent P2P networks. Postman is designed to
provide its users with a self-organizing, scalable, efficient and churn resilient Pub/Sub service[5]. Detti discussed
the benefits of building mobile Ad-hoc networks Pub/Sub system exploiting content centric networking
technology, rather than TCP/IP, and presented different design approaches, and described a topic-based Pub/Sub
content centric networking system[6]. Tryfonopoulos studied the problem of distributed resource sharing in p2p
networks, focused on the problem of information filtering, used an extension of the DHT Chord to organize the
nodes and store user subscriptions, and utilized efficient publication protocols that keep the network traffic and
latency low at filtering time[7].
Compared with the structured P2P-based Pub/Sub system, the unstructured Pub/Sub services can be provided on
deliberately designed overlay topologies. In unstructured P2P systems, subscribers and publishers rely on
distributing the queries and data messages throughout the network to make a successful subscription. Rahimian
introduced Vitis that exploits two ostensibly opposite mechanisms: unstructured clustering of similar peers and
structured rendezvous routing. A gossiping technique was embedded a navigable small-world network, which
efficiently establishes connectivity among clusters of nodes that exhibit similar subscriptions[8]. Chacko
proposed a CoQUOS approach, which supports continuous queries in unstructured P2P networks. In order to
solve this problem of flexibility and complexity, proposing an approach of CoQUOS with consistency
maintenance[9]. Papadakis proposed ITA, an algorithm which creates a random overlay of randomly connected
neighborhoods providing topology awareness to P2P systems, while at the same time has no negative effect on the
self-* properties or the operation of the other P2P algorithms[10]. Klusch presented the mobile system, MyMedia,
which features a high-performance semantic P2P search and a dynamic adaptive live streaming of annotated
MPEG-DASH videos from mobile to mobile devices over HTTP in wireless networks with an unstructured and
semantic P2P overlay[11]. Baraglia proposed a general architecture of a system whose aim is to exploit the
collaborative exchange of information between peers in order to build a system able to gather similar users and
spread useful suggestions among them, and presented mechanisms for building communities both in a simple way
and in a more complex way[12]. Margariti considered flooding, a fundamental mechanism for network discovery
and query routing, in unstructured P2P networks, and analyzed the behavior of flooding related to duplicate
messages and provide simple bounds and approximate models to assess the associated overheads[13]. Ferretti
analyzed the performance of an unstructured P2P overlay network that exploits a very simple dissemination
strategy to build P2P Pub/Sub systems. A mathematical analysis is provided to estimate the number of nodes
receiving the event[14]. Leng introduced both replica maintenance and update mechanisms for the BubbleStorm
P2P overlay and related rendezvous search systems. A complete solution covering all identified use cases included
a maintainer-based mechanism for data managed by a single node and a collective mechanism for data that shall
be persistent beyond any particular node’s session time[15].
Recent works in structured P2P systems exploit DHT to support CBR. Some of these approaches require the
existence of a so-called rendezvous node where subscriptions meet events, thus easily creating bottlenecks. By
contrast, unstructured P2P systems needn't maintain current topologies for the networks, they are robust. However,
the structured P2P systems are vulnerable to networks storm and data overlapping. In this paper, we propose a new
unstructured P2P system, suitable for large-scale Pub/Sub. The design guidelines are as follows.
1) We propose the concept of subscription ontology. Based on the similarity of the subnet, the unstructured P2P
network is divided into subnets.
2) Based on the subscription deviation, the routing strategies make the choice for event flooding route. The
strategies forward events to the most likely directions.
III. OURMETHODS
3.1 Subscription ontology
In information science, ontology is a formal naming and definition of the types, properties, and
interrelationships of the entities that really or fundamentally exist for a particulardomain of discourse. In an
ontology tree, each node represents an independent concept, each edge represents a directed edge from a parent
node to a child node, and child nodes represent sub-concepts of the correspondingparent nodes. In UP2S2, an
3. Ontology-Based Routing for Large-Scale Unstructured P2P…
www.theijes.com The IJES Page 9
event is expressed as an ontology tree, a subscriptionis actually a tree model based on ontology tree syntax.A tree
pattern defines the shape of a tree as well as the constraints on certain nodes and edges.
Definition 1 subscription probability tree. A subscription probability tree represents a tree form distribution of
nodesubscription probability.It is a mathematical structure which is used to reveal the random output of
subscription ontology with hierarchical structure.
By using subscription probability tree, we can effectively establish the heuristic index information.This class of
index information has a faster synchronization speed.It’s completely decentralizedfor unstructured P2P networks
topology,and can effectively prevent broadcast storms and information overlap.
Definition 2subscription probability.If there is a directed path between node X to node Y, the subscription
probability of node X to node Y, denoted as SP(X,Y), is the product of probabilities of all the directed edges
between the nodes.
SP indicates the subscriber node X’s degree of interest in the events that are published by the publisher node Y.
For a probability tree for node A, we assume SP(A,B)=0.8, SP(A,C)=0.2, SP(B,D)=0.9, SP(B,E)=0.1,
SP(C,F)=SP(C,D)=0.5. If there is a path from the node A to the E, and the path passes through directed edges (A,
B) and (B, E), then SP(A,E)=SP(A,B)*SP(B,E)=0.1×0.8=0.08. If there is no path from nodes G to B, then SP(G,
B)=0.
Definition 3 subscription deviation. Subscription deviation is used to measure the degree of deviation between two
subscription probability trees. Given P and Q to be two subscription ontologies, the subscription deviation
between P and Q is defined as follows.
Where N is a union set ofdirected edges of the two subscription ontology probability trees corresponding to P and
Q, SPT(P,i) and SPT(Q,j) are respectively the probability values of the corresponding edges in the two
subscriptionprobability trees, we assume SPT(P,i)=a, and SPT(Q,j)=b.
3.2 Subscription subnet
We assume that all nodes in UP2S2 use the same type of subscription ontology SO1. According to
subscription ontology, each node establishes a subscription routing table which includes subscription probability
values. When the node S publishes subscription condition, the node S hasn’t the subscription probability
information of the other nodes in the system. UP2S2 uses the broad flooding search algorithm which is based on
the needs of the subscribers. If a node A receives a query message and a match is found against its subscription
routing table by broad flooding search, the node A responds with a query hit message, supplying its subscription
routing table information for the subscription node S to generate a subscription probability tree. The subscription
probability tree for the node S is constructed from the subscription probability values carried by query hit
messages. In UP2S2, the nodes respond to the node S with the query hit messages. At the end of broad flooding
(BF) algorithm, the node S will receive the query hit messages sent by a group of nodes PG(S)={A1, A2, … ,An}
with .The subscription subnet algorithm extracts the subscription probability values from
the query hit messages to construct a subscription probability tree of node S.
The key to subscription routing is to establish the corresponding routing tables in the corresponding subscription
subnets. The algorithm for UP2S2 to construct subscription routing tables is describedas follows.
/* Formal parameters:the set of subscriptionsubnet nodes: spn, current subscription node: cn, subscription
deviation threshold value t */
void procedure sub_routing_table_constructing(SPNs spn, CN cn, SDT t) {
/*data type of subscription routing table SRT, the current subscription routing table pointer psrt */
float u;
struct SRT *psrt;
psrt=malloc(sizeof(structSRT));
{
4. Ontology-Based Routing for Large-Scale Unstructured P2P…
www.theijes.com The IJES Page 10
u=SD(cn,x);
if (u<t &&routing_table(x)psrt->routing_table)
/*Createa new subscription item routing_table(x)in the subscription table of node cn*/
psrt->routing_table=psrt->routing_table+routing_table(x);}
}
When a node exits or is offline due to external reasons, UP2S2 take the following strategies. The subscription
node associated with the offline node recalculates subscription probability, and updates the subscription
probability tree of the publish nodes.When the next constructing subscription table cycle comes,the subscription
table construction algorithmwill add new subscription nodes,which are associated with the node,into a new
subscription table.The algorithm for UP2S2 to reconstruct subscription routing tables is describedas follows.
/* Formal parameters:the set of old subscriptionsubnet nodes: old_spn, the set of new subscriptionsubnet nodes:
new_spn, current subscription node: cn */
void procedure sub_routing_table_reconstructing(SPNs old_spn, SPNs new_spn, CN cn) {
SPNsxor_spn;
xor_spn=old_spnnew_spn;
/* for each node x, x has been offline node already*/
{
/* for each node y, y has the subscription relationship with x*/
{
u=SD(x,y)=∞;
if (routing_table(x) routing_table(cn)) ;
/*Deletethe subscription item routing_table(x)from the subscription table of node cn*/
routing_table(cn)=routing_table(cn)-routing_table(x);
/* Update the subscription probability tree of the subscription subnet*/
update_SPT();}
}
3.3 Routing strategy
Controllingnode set(CNS) is defined as a node set in UP2S2, which makes the other nodes in UP2S2
adjacent to a certain node in the node set. A node in CNSis called controllingnode(CN).Otherwise, the node is
called non-controllingnode(non-CN). CN is an important concept in subscription subnet-based routing.It has been
widely used in the layout problem of Pub/Sub nodes. In CBR, each node tends to publish events andto propagate
subscriptions. In order to reduce traffic congestion caused by the excessive routing and forwardingmessages,
typically, nodes are divided into subnets.
UP2S2 uses the routing strategy based on the metric of subscription deviation.The routing strategy isn’t consistent
across the whole network,but is based on the differential measurement of subscription demands.The core idea of
UP2S2 is as follows.According tosubscription deviation, the sub_routing_table_constructingalgorithm divides the
whole unstructured P2P network into multiple subscriptionsubnets.There is a subscription probability tree in each
subscription subnet. Events are forwarded along the most likely subscription nodes. As for events, UP2S2 strategy
is made of two constituents. First, events are routed through their own subnets. Second, An event disseminated
along CNs.
In this section, we propose aCBR method based on CNS to describe the model of CBR managementlayer
integrated Pub/Submechanism and CNS.The method is described as follows.
First, we assume that UP2S2 is divided into three subnetswhich are responsible for publishing/subscription by
CNs a, b and c respectively. In each subscription subnet, a subscription probability tree is established by using a
node as the root node. It’s shown in Fig.1. In the legend, we use rectangle and circle to represent CN and non-CN
respectively.
a
b
c
SP a SP b SP c
Fig.1:Construction of subscription probability tree
5. Ontology-Based Routing for Large-Scale Unstructured P2P…
www.theijes.com The IJES Page 11
Second, UP2S2 calculates the subscription deviation values between non-CNs and its corresponding CN. And
then, the sub_routing_table_constructingalgorithm creates subscription routing tables for these non-CNs.The
propagations of subscriptions in subnets are shown as in Fig.2. In the Figure, the dashed arrows represent the
direction of propagating subscriptions.
a
SP a
b
SP b
c
SP c
Fig.2:The propagations of subscriptions in subnets
Finally, each subnetestablishesanunstructured P2P network, and CNsare connected to form UP2S2. So, the UP2S2
is divided into two levels.In such networks, A CN adjacent to a non-CNis responsible forpublishing event of the
non-CNs. A CN publishes events to otherCNs. Event and subscription routing strategies are shown as in Fig.3. In
the Figure, the solid arrowsindicate publishing events.
a
b
c
SP a
SP b
SP c
Fig.3: Event and subscription routing strategy
3.4 The cost of obtaining subscriptions
To obtain user’s subscription is a prerequisite for UP2S2 to establishsubscription routing table.Due to
diversity and the differences among subscriptions, the cost of obtaining subscriptionsbecomes an important
problem that can’t be ignored.The user’s subscriptions aren’t static over time. Therefore, this requires a more
rational approach to obtaining subscriptions.Without affecting the time and space complexity, UP2S2uses a
method of mining association rules in relation of quantitative attribute.By classifying user’s subscriptions,
subscribe sets which have different functional attributes are constructed.And then, combined with the extensible
transformation principle, UP2S2 can deduce the new if-then rules.In this process, the costs of UP2S2 are mainly
focused on the collection and processing of subscriptions. It divides the user’s subscription data into several
property sets, and determines the conditional attribute sets and the conclusion attribute sets.To compute support
and confidence is UP2S2’s additional overhead.
IV. VALIDATION AND EVALUTION
According to the needs of P2P network operations, we design simulation experiments and comparative
analysis methods, which are compared with the BF routing strategy.Experimental contents include three aspects:
1)According to the subscription tables, UP2S2 routes the events more quickly and accurately;
2)UP2S2 can save network bandwidth and reduce unnecessary network overhead;
3)UP2S2has the characteristics ofquick-response and high-efficiency constructingthe subscription tables.
We validate UP2S2 by simulation. The simulator uses PeerSim, a discrete event simulator for large-scale
distributed systems.In the following experiments,assume that the P2P network size is 10000 nodes, there are 100
subscription subnets, and each subnet has 100 nodes.To simulate a realistic network environment,the uniform
6. Ontology-Based Routing for Large-Scale Unstructured P2P…
www.theijes.com The IJES Page 12
distribution of the publishingevent nodes was discussed.Assume that the numbers of the event nodes are 800, the
event subscription rate ESR=1%, and the event and subscriptionmessage time to live value equal to 10.
4.1 Accuracy of event routing
The purpose of this experiment is to verify the ability ofUP2S2’squick event routing.This capability
includes the success rate at routingevent, the event routing time in different subscription subnets, and the hit rate of
eventmatching.Figure 4 shows the results ofthe success rate at routingevent vs. periods of time(POT).
Fig.4: The success rate at routingevent vs. POT
As shown in Figure 4, when POT=4, the BF event routing accuracy reaches its peak.Because the network is
flooded with a large number of query information, a large number of nodes dieenergy resourceswhen POT=1. The
accuracy of BFevent routing decreases by nearly 20%.Because UP2S2 is divided into subnets according to user's
subscriptions, when eventsare routed in a subnet, accuracy of event routing is higher, and is up to 75%.With the
decrease of POT, the accuracy monotonically increases.This indicates that compared with the BF algorithm,the
UP2S2 event routing accuracy is higher.
4.2 Cost of redundant events of network
The purpose of this experiment is to verify that UP2S2 can save network bandwidth and reduce
unnecessary network overhead.Figure 5 shows the results ofthe redundant eventsvs. POT.
As shown in Figure 5,UP2S2 has an increaseof100 on redundant events in every eventflooding.The number of
redundant events in UP2S2 is 75% lower than that of BF,and there is an increasing trend with the reduction in POT
value. Finally, the number of redundant events tends to be stable.This indicates thatcompared with the BF
algorithm,UP2S2 has obvious advantages in reducing redundant eventsgenerated by flooding and save the cost of
network resources.
4.3 Subscription table construction time
The purpose of this experiment is to verify that UP2S2can construct subscription tables quickly and
efficiently.Figure 6 shows the results ofsubscription table construction timevs. POT.
7. Ontology-Based Routing for Large-Scale Unstructured P2P…
www.theijes.com The IJES Page 13
As shown in Figure 6,UP2S2 is better than BF in terms of subscription table construction time.Especially in the
number of events is small, subscription table construction time of UP2S2 is nearly 30% less than that of BF.
V. CONCLUSION
In this paper, we propose UP2S2, a large-scale ontology-based Pub/Sub for Unstructured P2P networks,
to provide the architecture of Pub/Subrouting. UP2S2is based on event and subscription subnet model. We design
and implement the algorithms for UP2S2 to construct and reconstruct subscription routing tables, and derive
conclusions from the simulation experiments. The results show that UP2S2 routes the events more quickly and
accurately.
ACKNOWLEDGEMENTS
This work was sponsored by Qing Lanproject(Jiangsu province, china) and open fund project of Jiangsu
provincial research and development center of intelligent sensor network engineering technology,
china(ZK13-02-03, Software technology, platform and application for sensor network)
REFERENCES
[1]A. Chaabane, W. Louati, M. Jmaiel, et al, Towards an ontology and DHT-based publish/subscribe scalable system, Communications (ICC),
2012 IEEE International Conference on. IEEE, Ottawa, Canada, 2012, 6499-6503.
[2]V. Setty, M. Van Steen, R. Vitenberg, et al,PolderCast: fast, robust, and scalable architecture for P2P topic-based pub/sub, Proceedings of
the 13th International Middleware Conference, Montreal, QC, Canada, 2012, 271-291.
[3]T. Pandey, D. Garg, and M.M. Gore, Structured P2P Overlay of Mobile Brokers for Realizing Publish/Subscribe Communication in
VANET,The Scientific World Journal, 2014.
[4]L. Pellegrino, F. Huet, F. Baude, et al, A Distributed Publish/Subscribe System for RDF Data, Data Management in Cloud, Grid and P2P
Systems: 6th International Conference, Globe 2013, Prague, Czech Republic, 2013, 8059:39.
[5]G. Einziger, R. Friedman, Postman: An Elastic Highly Resilient Publish/Subscribe Framework for Self Sustained Service Independent P2P
Networks, Stabilization, Safety, and Security of Distributed Systems: 16th International Symposium, Paderborn, Germany, 2014,
8756:78.
[6]A. Detti, D. Tassetto, N.B. Melazzi, et al, Exploiting content centric networking to develop topic-based, publish–subscribe MANET
systems,Ad Hoc Networks, 24, 2015,115-133.
[7]C. Tryfonopoulos, S. Idreos, M. Koubarakis, et al, Distributed large-scale information filtering, Transactions on Large-Scale Data-and
Knowledge-Centered Systems XIII, 2014, 91-122.
[8]F. Rahimian, S. Girdzijauskas, A.H. Payberah, et al,Vitis: A gossip-based hybrid overlay for internet-scale publish/subscribe enabling
rendezvous routing in unstructured overlay networks, Parallel & Distributed Processing Symposium, 2011 IEEE
International,Anchoraga, Alaska, USA, 2011, 746-757.
[9]A. Chacko, M.S. Sendil, and D.R.S. Karthik, Consistency Maintenance Of Continuous Queries In Unstructured Overlay
Networks,International Journal of Advanced Research in Computer Science and Electronics Engineering, 1(4), 2012, 84-88.
[10] H. Papadakis, P. Fragopoulou, E.P. Markatos, et al,Ita: innocuous topology awareness for unstructured P2P networks,Parallel and
Distributed Systems, IEEE Transactions, 24(8), 2013, 1589-1601.
[11] M. Klusch, P. Kapahnke, X. Cao, et al, MyMedia: mobile semantic peer-to-peer video search and live streaming, Proc. 11th
International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, London, UK, 2014: 277-286.
[12] R. Baraglia, P. Dazzi, M. Mordacchini, et al, A peer-to-peer recommender system for self-emerging user communities based on gossip
overlays,Journal of Computer and System Sciences, 79(2), 2013, 291-308.
[13] S.V. Margariti, V.V. Dimakopoulos, A study on the redundancy of flooding in unstructured p2p networks, International Journal of
Parallel, Emergent and Distributed Systems, 28(3), 2013, 214-229.
[14] S. Ferretti, Publish-subscribe systems via gossip: a study based on complex networks, Proc. of the Fourth Annual Workshop on
Simplifying Complex Networks for Practitioners, Lyon,France, 2012, 7-12.
[15] C. Leng,BubbleStorm: replication, updates, and consistency in rendezvous information systems, doctoral diss., Darmstadt University of
Technology, Darmstadt, Germany, 2012.
AUTHORS
Biao Dong now is an Associate Professor in the School of Computer and Software at Nanjing Institute of Industry
Technology, Nanjing, China. He received his BS degree in Computer Application Technology from Nanjing
University, China (2001). He received his MS degree, and PhD degree in Computer Science and Technology from
the Hohai University, China (2004), Nanjing University of Science and Technology, China(2011), respectively.
His research interests include new services for wireless sensor and actuator networks, service provisioning and
management, advanced software architectures, and component-based distributed applications design.
Jinhui Chen currently is an Associate Professor and supervisor of graduate students in the School of Information
and Control, Nanjing University of Information Science & Technology (previously named Nanjing Institute of
Meteorology). She received her BS degree in Computer Science and Technology, MS degree in System Analysis
and Integration from Nanjing University of Information Science & Technology, China, in 1992 and 2002,
respectively. Her research interests include wireless networks, mobile computing, and approximation algorithm
design and analysis.