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 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.
Adaptive resource allocation and internet traffic engineering on data networkcsandit
This research paper describes the issues of bandwidth allocation, optimum capacity allocation,network operational cost reduction, and improve Internet user experience. Traffic engineering (TE) is used to manipulate network traffic to achieve certain requirements and meets certain
needs. TE becomes one of the most important building blocks in the design of the Internet backbone infrastructure. Research objective: efficient allocation of bandwidth across multiple paths. Optimum path selection. Minimize network traffic delays and maximize bandwidth utilization over multiple network paths. The bandwidth allocation is performed proportionally over multiple paths based on the path capacity.
On minimizing data forwarding schedule in multi transmit receive wireless mes...redpel dot com
On minimizing data forwarding schedule in multi transmit receive wireless mesh network
for more ieee paper / full abstract / implementation , just visit www.redpel.com
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.
A New Efficient Cache Replacement Strategy for Named Data NetworkingIJCNCJournal
The Information-Centric Network (ICN) is a future internet architecture with efficient content retrieval and distribution. Named Data Networking (NDN) is one of the proposed architectures for ICN. NDN’s innetwork caching improves data availability, reduce retrieval delays, network load, alleviate producer load, and limit data traffic. Despite the existence of several caching decision algorithms, the fetching and distribution of contents with minimum resource utilization remains a great challenge. In this paper, we introduce a new cache replacement strategy called Enhanced Time and Frequency Cache Replacement strategy (ETFCR) where both cache hit frequency and cache retrieval time are used to select evicted data chunks. ETFCR adds time cycles between the last two requests to adjust data chunk’s popularity and cache hits. We conducted extensive simulations using the ccnSim simulator to evaluate the performance of ETFCR and compare it to that of some well-known cache replacement strategies. Simulations results show that ETFCR outperforms the other cache replacement strategies in terms of cache hit ratio, and lower content retrieval delay.
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.
Adaptive resource allocation and internet traffic engineering on data networkcsandit
This research paper describes the issues of bandwidth allocation, optimum capacity allocation,network operational cost reduction, and improve Internet user experience. Traffic engineering (TE) is used to manipulate network traffic to achieve certain requirements and meets certain
needs. TE becomes one of the most important building blocks in the design of the Internet backbone infrastructure. Research objective: efficient allocation of bandwidth across multiple paths. Optimum path selection. Minimize network traffic delays and maximize bandwidth utilization over multiple network paths. The bandwidth allocation is performed proportionally over multiple paths based on the path capacity.
On minimizing data forwarding schedule in multi transmit receive wireless mes...redpel dot com
On minimizing data forwarding schedule in multi transmit receive wireless mesh network
for more ieee paper / full abstract / implementation , just visit www.redpel.com
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.
A New Efficient Cache Replacement Strategy for Named Data NetworkingIJCNCJournal
The Information-Centric Network (ICN) is a future internet architecture with efficient content retrieval and distribution. Named Data Networking (NDN) is one of the proposed architectures for ICN. NDN’s innetwork caching improves data availability, reduce retrieval delays, network load, alleviate producer load, and limit data traffic. Despite the existence of several caching decision algorithms, the fetching and distribution of contents with minimum resource utilization remains a great challenge. In this paper, we introduce a new cache replacement strategy called Enhanced Time and Frequency Cache Replacement strategy (ETFCR) where both cache hit frequency and cache retrieval time are used to select evicted data chunks. ETFCR adds time cycles between the last two requests to adjust data chunk’s popularity and cache hits. We conducted extensive simulations using the ccnSim simulator to evaluate the performance of ETFCR and compare it to that of some well-known cache replacement strategies. Simulations results show that ETFCR outperforms the other cache replacement strategies in terms of cache hit ratio, and lower content retrieval delay.
A New Architecture for Group Replication in Data GridEditor IJCATR
Nowadays, grid systems are vital technology for programs running with high performance and problems solving with largescale
in scientific, engineering and business. In grid systems, heterogeneous computational resources and data should be shared
between independent organizations that are scatter geographically. A data grid is a kind of grid types that make relations computational
and storage resources. Data replication is an efficient way in data grid to obtain high performance and high availability by saving
numerous replicas in different locations e.g. grid sites. In this research, we propose a new architecture for dynamic Group data
replication. In our architecture, we added two components to OptorSim architecture: Group Replication Management component
(GRM) and Management of Popular Files Group component (MPFG). OptorSim developed by European Data Grid projects for
evaluate replication algorithm. By using this architecture, popular files group will be replicated in grid sites at the end of each
predefined time interval.
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.
Multi-path TCP (MP-TCP) has the prospective to
significantly advance applications performance by using multiple
paths evidently. Multipath TCP was intended and employed as a
backward compatible replacement for TCP. For this reason, it
exposes the standard socket API to the applications that cannot
control the utilization of the different paths. This is a key feature
for applications that are unaware of the multipath nature of the
network. On the contrary, this is a limitation for applications
that could benefit from specific knowledge to use multiple paths
in a way that fits their needs. Therefore, hosts are often
connected by multiple paths, but TCP restricts communications
to a single path per transport connection. Resource usage within
the network would be more efficient where these multiple paths
able to be used concurrently. This should enhance user
experience through improved resilience to network failure and
higher throughput. In this paper, we have focused on MPTCP
and discussed the performance issues and its solution. We believe
our concept will be useful for future works of MPTCP
performance evaluation.
Spatial ReusabilityAware Routing in Multi-Hop Wireless Networks Using Single ...dbpublications
In Multi-hop wireless routing to successfully achieve high end to end throughput .To search a “best” node path from source node to the destination node .A large number of routing protocols use for minimum total transmission count/time for delivering a single packet, such transmission time minimizing protocols cannot be assured to successfully achieve maximum end to end throughput. Considering spatial reusability of the wireless media, increase the end-to-end throughput in multi-hop wireless network. To support a function in spatial reusability-aware Single path routing (SAAP) protocols, It compare with existing protocols, Results provide desired end to end throughputgain is up to 62.7%. and desired end to end delay.
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
A Comprehensive Study on Vehicular Ad-Hoc Delay Tolerant Networking for Infra...inventionjournals
Generally, traditional networks presume the presence of some path between endpoints. Today, however, new applications, environments and types of devices are challenging these assumptions. In Delay Tolerant Networks (DTNs), an end-to-end path from source to destination may not exist. Nodes may connect and exchange their information in an opportunistic way. This book represents a broad overview of DTNs, particularly focusing on Vehicular Ad-hoc DTNs, their main characteristics, challenges and our research on this field. In the near future, cars are expected to be equipped with devices that will allow them to communicate wirelessly i.e. Wi-Fi. However, there will be strict restrictions to the duration of their connections with other vehicles, whereas the conditions of their links will greatly vary; DTNs as well as Ad-hoc DTNs present an attractive solution. Therefore, Vehicular Ad-hoc DTNs constitute an attractive research field. For practical implementation, we have used two Android devices for a little range of Wi-Fi. So, by this we are trying to give us better accuracy to go further. Thorough out this document, we have mentioned those techniques we came across and also those techniques and algorithms that we used in our proposed method.
Centrality-Based Network Coder Placement For Peer-To-Peer Content DistributionIJCNCJournal
Network coding has been shown to achieve optimal multicast throughput, yet at an expensive computation
cost: every node in the network has to code. Interested in minimizing resource consumption of network
coding while maintaining its performance, in this paper, we propose a practical network coder placement
algorithm which achieves comparable content distribution time as network coding, and at the same time,
substantially reduces the number of network coders compared to a full network coding solution in which all
peers have to encode, i.e. become encoders. Our algorithm is derived from two key elements. First, it is
based on the insight that coding at upstream peers eliminates information duplication to downstream peers,
which results in efficient content distribution. Second, our placement strategy exploits centrality
characteristics of the network topology to quickly determine key positions to place encoders. Performance
evaluation using various topology and algorithm parameters confirms the effectiveness of our proposed
method.
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/)
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSIJCNCJournal
In the mobile ad hoc network (MANET) update of link connectivity is necessary to refresh the neighbor tables in data transfer. A existing hello process periodically exchanges the link connectivity information, which is not adequate for dynamic topology. Here, slow update of neighbour table entries causes link failures which affect performance parameter as packet drop, maximum delay, energy consumption, and reduced throughput. In the dynamic hello technique, new neighbour nodes and lost neighbour nodes are used to compute link change rate (LCR) and hello-interval/refresh rate (r). Exchange of link connectivity information at a fast rate consumes unnecessary bandwidth and energy. In MANET resource wastage can be controlled by avoiding the re-route discovery, frequent error notification, and local repair in the entire network. We are enhancing the existing hello process, which shows significant improvement in performance.
Optimized Traffic Flow over Multipath in Optical Networkspaperpublications3
Abstract: In optical networks, the delivery of a traffic flow with a certain bandwidth demand over a single network path is either not possible or not cost-effective. In these cases, it is very often possible to improve the network's bandwidth utilization by splitting the traffic flow over multiple efficient paths. While using multiple paths for the same traffic flow increases the efficiency of the network, it consumes expensive forwarding resources from the network nodes such as wavelengths/light paths of optical networks. The problem of reducing forwarding cost can be defined in two cases such as Routing with Minimum Overhead and Decomposition with Minimum Overhead. For Routing with Minimum Overhead only the traffic demand must be given and for Decomposition with Minimum Overhead both the traffic demand and network flow will be given. For both the problems forwarding cost can be minimized by measuring the number of paths and the number of nodes traversed by these paths.
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.
Throughput Maximization using Spatial Reusability in Multi Hop Wireless Networkijtsrd
Energy is a valuable resource in wireless networks. For many multi hop networking scenarios, nodes require power for performing their operation, so requiring capable power management to make certain connectivity across the network. Though when wireless networks are attached outside power source due to obstruction between lively links the network may demand excessive energy per unit time Power due to this the overall performance is reduced. Since network life time or network capacity is depend on the power efficiency, many efforts to study energy efficient networks in the wireless network community. In multi hop wireless networks well organized routing algorithms are significant for network performance. We dispute that by carefully considering spatial reusability of the wireless communication media, we can reduce the overhead in multi hop wireless networks. To support our argument, propose Broadcast Tree Construction BTC and compare them with existing routing and multi path routing protocols, respectively. Our estimate outcome shows that proposed protocols significantly improve the end to end throughput compared with existing protocols. We also introduce the sleep scheduling approach for energy consumption and hybrid cryptography for security of data that can be prevent the data leakage and jammer attacks. Twinkal P. Dudhagawali | Prof. L. K. Gautam | Prof. V. P. Vaidya ""Throughput Maximization using Spatial Reusability in Multi Hop Wireless Network"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-3 , April 2019, URL: https://www.ijtsrd.com/papers/ijtsrd23489.pdf
Paper URL: https://www.ijtsrd.com/engineering/information-technology/23489/throughput-maximization-using-spatial-reusability-in-multi-hop-wireless-network/twinkal-p-dudhagawali
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
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.
Comparative Analysis of Green Algorithm within Active Queue Management for Mo...ijtsrd
The Queue Management Techniques play an important role in improving the Quality of Service in Mobile Ad hoc Networks. The need of congestion control and Queue management is inevitable in Mobile Ad hoc Network. Understanding and analyzing the latest AQM Techniques give an insight to improving throughput, packet loss rate, average end to end delay and other parameters that severely affect the performance. The performance of mobile ad hoc networks is evaluated by varying the Channel Error Rate, Bandwidth and Delay at different fragment sizes of different traffic flows. The proposed method performs the network analysis of new Routing protocols. The work proposes to evaluate various Active Queue Management Techniques in a multi traffic environment i.e., sources generating both TCP and UDP traffic classes. The UDP is propagated via CBR and TCP is propagated via FTP. The implementation of the proposed queue management technique has been done in NS 2. In the proposed work we have make NS 2 compatible with GREEN by integrating source code into the ns 2 installation files and using various AQMs in comparison with GREEN to calculate the throughput at various Bandwidths across network. Using various AQMs in comparison with GREEN we have calculated the throughput at various Delays across the network and we have also calculated the throughput at various channels Error Rate across the network. The proposed method has been compared with other primitive AQM techniques so that a repository of best available results can be obtained for design and research purposes. The proposed method has outperformed the existing queue management techniques in number of scenarios. Zulai Khan | Rashmi Raj ""Comparative Analysis of Green Algorithm within Active Queue Management for Mobile Ad Hoc Network"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-4 , June 2019, URL: https://www.ijtsrd.com/papers/ijtsrd23950.pdf
Paper URL: https://www.ijtsrd.com/engineering/electronics-and-communication-engineering/23950/comparative-analysis-of-green-algorithm-within-active-queue-management-for-mobile-ad-hoc-network/zulai-khan
A New Architecture for Group Replication in Data GridEditor IJCATR
Nowadays, grid systems are vital technology for programs running with high performance and problems solving with largescale
in scientific, engineering and business. In grid systems, heterogeneous computational resources and data should be shared
between independent organizations that are scatter geographically. A data grid is a kind of grid types that make relations computational
and storage resources. Data replication is an efficient way in data grid to obtain high performance and high availability by saving
numerous replicas in different locations e.g. grid sites. In this research, we propose a new architecture for dynamic Group data
replication. In our architecture, we added two components to OptorSim architecture: Group Replication Management component
(GRM) and Management of Popular Files Group component (MPFG). OptorSim developed by European Data Grid projects for
evaluate replication algorithm. By using this architecture, popular files group will be replicated in grid sites at the end of each
predefined time interval.
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.
Multi-path TCP (MP-TCP) has the prospective to
significantly advance applications performance by using multiple
paths evidently. Multipath TCP was intended and employed as a
backward compatible replacement for TCP. For this reason, it
exposes the standard socket API to the applications that cannot
control the utilization of the different paths. This is a key feature
for applications that are unaware of the multipath nature of the
network. On the contrary, this is a limitation for applications
that could benefit from specific knowledge to use multiple paths
in a way that fits their needs. Therefore, hosts are often
connected by multiple paths, but TCP restricts communications
to a single path per transport connection. Resource usage within
the network would be more efficient where these multiple paths
able to be used concurrently. This should enhance user
experience through improved resilience to network failure and
higher throughput. In this paper, we have focused on MPTCP
and discussed the performance issues and its solution. We believe
our concept will be useful for future works of MPTCP
performance evaluation.
Spatial ReusabilityAware Routing in Multi-Hop Wireless Networks Using Single ...dbpublications
In Multi-hop wireless routing to successfully achieve high end to end throughput .To search a “best” node path from source node to the destination node .A large number of routing protocols use for minimum total transmission count/time for delivering a single packet, such transmission time minimizing protocols cannot be assured to successfully achieve maximum end to end throughput. Considering spatial reusability of the wireless media, increase the end-to-end throughput in multi-hop wireless network. To support a function in spatial reusability-aware Single path routing (SAAP) protocols, It compare with existing protocols, Results provide desired end to end throughputgain is up to 62.7%. and desired end to end delay.
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
A Comprehensive Study on Vehicular Ad-Hoc Delay Tolerant Networking for Infra...inventionjournals
Generally, traditional networks presume the presence of some path between endpoints. Today, however, new applications, environments and types of devices are challenging these assumptions. In Delay Tolerant Networks (DTNs), an end-to-end path from source to destination may not exist. Nodes may connect and exchange their information in an opportunistic way. This book represents a broad overview of DTNs, particularly focusing on Vehicular Ad-hoc DTNs, their main characteristics, challenges and our research on this field. In the near future, cars are expected to be equipped with devices that will allow them to communicate wirelessly i.e. Wi-Fi. However, there will be strict restrictions to the duration of their connections with other vehicles, whereas the conditions of their links will greatly vary; DTNs as well as Ad-hoc DTNs present an attractive solution. Therefore, Vehicular Ad-hoc DTNs constitute an attractive research field. For practical implementation, we have used two Android devices for a little range of Wi-Fi. So, by this we are trying to give us better accuracy to go further. Thorough out this document, we have mentioned those techniques we came across and also those techniques and algorithms that we used in our proposed method.
Centrality-Based Network Coder Placement For Peer-To-Peer Content DistributionIJCNCJournal
Network coding has been shown to achieve optimal multicast throughput, yet at an expensive computation
cost: every node in the network has to code. Interested in minimizing resource consumption of network
coding while maintaining its performance, in this paper, we propose a practical network coder placement
algorithm which achieves comparable content distribution time as network coding, and at the same time,
substantially reduces the number of network coders compared to a full network coding solution in which all
peers have to encode, i.e. become encoders. Our algorithm is derived from two key elements. First, it is
based on the insight that coding at upstream peers eliminates information duplication to downstream peers,
which results in efficient content distribution. Second, our placement strategy exploits centrality
characteristics of the network topology to quickly determine key positions to place encoders. Performance
evaluation using various topology and algorithm parameters confirms the effectiveness of our proposed
method.
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/)
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSIJCNCJournal
In the mobile ad hoc network (MANET) update of link connectivity is necessary to refresh the neighbor tables in data transfer. A existing hello process periodically exchanges the link connectivity information, which is not adequate for dynamic topology. Here, slow update of neighbour table entries causes link failures which affect performance parameter as packet drop, maximum delay, energy consumption, and reduced throughput. In the dynamic hello technique, new neighbour nodes and lost neighbour nodes are used to compute link change rate (LCR) and hello-interval/refresh rate (r). Exchange of link connectivity information at a fast rate consumes unnecessary bandwidth and energy. In MANET resource wastage can be controlled by avoiding the re-route discovery, frequent error notification, and local repair in the entire network. We are enhancing the existing hello process, which shows significant improvement in performance.
Optimized Traffic Flow over Multipath in Optical Networkspaperpublications3
Abstract: In optical networks, the delivery of a traffic flow with a certain bandwidth demand over a single network path is either not possible or not cost-effective. In these cases, it is very often possible to improve the network's bandwidth utilization by splitting the traffic flow over multiple efficient paths. While using multiple paths for the same traffic flow increases the efficiency of the network, it consumes expensive forwarding resources from the network nodes such as wavelengths/light paths of optical networks. The problem of reducing forwarding cost can be defined in two cases such as Routing with Minimum Overhead and Decomposition with Minimum Overhead. For Routing with Minimum Overhead only the traffic demand must be given and for Decomposition with Minimum Overhead both the traffic demand and network flow will be given. For both the problems forwarding cost can be minimized by measuring the number of paths and the number of nodes traversed by these paths.
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.
Throughput Maximization using Spatial Reusability in Multi Hop Wireless Networkijtsrd
Energy is a valuable resource in wireless networks. For many multi hop networking scenarios, nodes require power for performing their operation, so requiring capable power management to make certain connectivity across the network. Though when wireless networks are attached outside power source due to obstruction between lively links the network may demand excessive energy per unit time Power due to this the overall performance is reduced. Since network life time or network capacity is depend on the power efficiency, many efforts to study energy efficient networks in the wireless network community. In multi hop wireless networks well organized routing algorithms are significant for network performance. We dispute that by carefully considering spatial reusability of the wireless communication media, we can reduce the overhead in multi hop wireless networks. To support our argument, propose Broadcast Tree Construction BTC and compare them with existing routing and multi path routing protocols, respectively. Our estimate outcome shows that proposed protocols significantly improve the end to end throughput compared with existing protocols. We also introduce the sleep scheduling approach for energy consumption and hybrid cryptography for security of data that can be prevent the data leakage and jammer attacks. Twinkal P. Dudhagawali | Prof. L. K. Gautam | Prof. V. P. Vaidya ""Throughput Maximization using Spatial Reusability in Multi Hop Wireless Network"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-3 , April 2019, URL: https://www.ijtsrd.com/papers/ijtsrd23489.pdf
Paper URL: https://www.ijtsrd.com/engineering/information-technology/23489/throughput-maximization-using-spatial-reusability-in-multi-hop-wireless-network/twinkal-p-dudhagawali
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
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.
Comparative Analysis of Green Algorithm within Active Queue Management for Mo...ijtsrd
The Queue Management Techniques play an important role in improving the Quality of Service in Mobile Ad hoc Networks. The need of congestion control and Queue management is inevitable in Mobile Ad hoc Network. Understanding and analyzing the latest AQM Techniques give an insight to improving throughput, packet loss rate, average end to end delay and other parameters that severely affect the performance. The performance of mobile ad hoc networks is evaluated by varying the Channel Error Rate, Bandwidth and Delay at different fragment sizes of different traffic flows. The proposed method performs the network analysis of new Routing protocols. The work proposes to evaluate various Active Queue Management Techniques in a multi traffic environment i.e., sources generating both TCP and UDP traffic classes. The UDP is propagated via CBR and TCP is propagated via FTP. The implementation of the proposed queue management technique has been done in NS 2. In the proposed work we have make NS 2 compatible with GREEN by integrating source code into the ns 2 installation files and using various AQMs in comparison with GREEN to calculate the throughput at various Bandwidths across network. Using various AQMs in comparison with GREEN we have calculated the throughput at various Delays across the network and we have also calculated the throughput at various channels Error Rate across the network. The proposed method has been compared with other primitive AQM techniques so that a repository of best available results can be obtained for design and research purposes. The proposed method has outperformed the existing queue management techniques in number of scenarios. Zulai Khan | Rashmi Raj ""Comparative Analysis of Green Algorithm within Active Queue Management for Mobile Ad Hoc Network"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-4 , June 2019, URL: https://www.ijtsrd.com/papers/ijtsrd23950.pdf
Paper URL: https://www.ijtsrd.com/engineering/electronics-and-communication-engineering/23950/comparative-analysis-of-green-algorithm-within-active-queue-management-for-mobile-ad-hoc-network/zulai-khan
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.
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.
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
Performance Analysis of Mesh-based NoC’s on Routing Algorithms IJECEIAES
The advent of System-on-Chip (SoCs), has brought about a need to increase the scale of multi-core chip networks. Bus Based communications have proved to be limited in terms of performance and ease of scalability, the solution to both bus – based and Point-to-Point (P2P) communication systems is to use a communication infrastructure called Network-on-Chip (NoC). Performance of NoC depends on various factors such as network topology, routing strategy and switching technique and traffic patterns. In this paper, we have taken the initiative to compile together a comparative analysis of different Network on Chip infrastructures based on the classification of routing algorithm, switching technique, and traffic patterns. The goal is to show how varied combinations of the three factors perform differently based on the size of the mesh network, using NOXIM, an open source SystemC Simulator of mesh-based NoC. The analysis has shown tenable evidence highlighting the novelty of XY routing algorithm.
Ontology-Based Routing for Large-Scale Unstructured P2P Publish/Subscribe Systemtheijes
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.
ANALYSE THE PERFORMANCE OF MOBILE PEER TO PEER NETWORK USING ANT COLONY OPTIM...ijcsity
A mobile peer-to-peer computer network is the one in which each computer in the network can act as a
client or server for the other computers in the network. The communication process among the nodes in the
mobile peer to peer network requires more no of messages. Due to this large number of messages passing,
propose an interconnection structure called distributed Spanning Tree (DST) and it improves the efficiency
of the mobile peer to peer network. The proposed method improves the data availability and consistency
across the entire network and also reduces the data latency and the required number of message passes for
any specific application in the network. Further to enhance the effectiveness of the proposed system, the
DST network is optimized with the Ant Colony Optimization method. It gives the optimal solution of the
DST method and increased availability, enhanced consistency and scalability of the network. The
simulation results shows that reduces the number of message sent for any specific application and average
delay and increases the packet delivery ratio in the network.
International Refereed Journal of Engineering and Science (IRJES) is a peer reviewed online journal for professionals and researchers in the field of computer science. The main aim is to resolve emerging and outstanding problems revealed by recent social and technological change. IJRES provides the platform for the researchers to present and evaluate their work from both theoretical and technical aspects and to share their views.
International Refereed Journal of Engineering and Science (IRJES)irjes
International Refereed Journal of Engineering and Science (IRJES) is a leading international journal for publication of new ideas, the state of the art research results and fundamental advances in all aspects of Engineering and Science. IRJES is a open access, peer reviewed international journal with a primary objective to provide the academic community and industry for the submission of half of original research and applications
Routing performance of structured overlay in Distributed Hash Tables (DHT) fo...journalBEEI
This paper presents a routing performance analysis of structured P2P overlay network. Due to the rapid development and hectic life, sharing data wirelessly is essential. P2P allows participating peers move freely by joining and leaving the network at any convenience time. Therefore, it exists constraint when one measuring the network performance. Moreover, the design of structured overlay networks is fragmented and with various design. P2P networks need to have a reliable routing protocol. In order to analyse the routing performance, this work simulates three structured overlay protocols-Chord, Pastry and Kademlia using OMNeT++ with INET and OverSim module. The result shows that Pastry is the best among others with 100% routing efficiency. However, Kademlia leads with 12.76% and 18.78% better than Chord and Pastry in lookup hop count and lookup success latency respectively. Hence, Pastry and Kamelia architectures will have a better choice for implementing structured overlay P2P network.
Mitigating Link Failures & Implementing Security Mechanism in Multipath Flows...Eswar Publications
The transmission of a traffic flows with a certain bandwidth demand over a single network path is either not possible or not cost-effective. In these cases, it is veritably periodic usable to improve focus the network's bandwidth appliance by breaking the traffic flow upon multiple qualified paths. Using multiple paths for the equivalent traffic flow increases the certainty of the network, it absorbs deluxe forwarding resources from the
network nodes and also it overcomes link failure provide security. In this paper, we illustrate several problems related to splitting a traffic flow over multiple paths while minimizing the absorption of forwarding resources mitigates failures and implementing security.
Transfer reliability and congestion control strategies in opportunistic netwo...IEEEFINALYEARPROJECTS
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.co¬m-Visit Our Website: www.finalyearprojects.org
JAVA 2013 IEEE NETWORKING PROJECT Transfer reliability and congestion control...IEEEGLOBALSOFTTECHNOLOGIES
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
Content Distribution for Peer-To-Peer Overlays on Mobile Adhoc Networks to Fu...Editor IJCATR
Peer-to-peer (P2P) networks existing on a MANET are a natural evolution since both are decentralized and have dynamic
topologies. As MANETs grow in use due to the increasing popularity of wireless mesh and 4G networks, it is expected that P2P
applications will remain as a popular means of obtaining files. Network coding has been shown as an efficient means of sharing large
Files in a P2P network. With network coding, all file blocks have the same relative importance. This paper presents an efficient
content distribution scheme that uses network coding to share large files in a P2P overlay running on a MANET. Peers request file
blocks from multiple server nodes and servers multicast blocks to multiple receivers, providing efficient multipoint-to-multipoint
communication.
Simulation results show that compared to other common download techniques, the proposed scheme performs very well, having lower
download time and energy consumption. Also, more peers participate in uploading the file, resulting in greater fairness.
CONCEPTUAL FRAMEWORK OF REDUNDANT LINK AGGREGATIONcseij
This is era of information blast. A huge quantity of information is pouring in from various sources. The
revolutionary advancement of Information and Communication technologies bring the world close
together.A pile of information in different formats is just a click away. Which motivate the organizations to
get more internet bandwidth to consume and publish theinformationoverexploding cloudof Internet. The
standard router redundancyprotocolis used to handle backup link showever it cannot aggregate
them.Whereas thelink standard aggregation protocol can aggregate the link but it support only Ethernet
technology.In this researchpaper a concept of Redundant Link Aggregation (RLA)is proposed. RLA can
aggregate and handle backup links with main links regardless of carriertechnology. Furthermore a
dataforwardingmechanism Odd Load Balancing (OLB) is also proposed for RLA scheme. For the sake of
performance evaluation, Redundant Link Aggregation (RLA) is compared with Virtual Router Redundancy
Protocol (VRRP). The simulation result reveals that Redundant Link Aggregation (RLA) can cover the
bandwidth demand of the network in peak hours by consuming backup links as well which with Virtual
Router Redundancy Protocol (VRRP)cannot.It is further noted thatOdd Load Balancing (OLB) feature can
be used to save the cost in terms of money per annum.
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
Hierarchical Digital Twin of a Naval Power SystemKerry Sado
A hierarchical digital twin of a Naval DC power system has been developed and experimentally verified. Similar to other state-of-the-art digital twins, this technology creates a digital replica of the physical system executed in real-time or faster, which can modify hardware controls. However, its advantage stems from distributing computational efforts by utilizing a hierarchical structure composed of lower-level digital twin blocks and a higher-level system digital twin. Each digital twin block is associated with a physical subsystem of the hardware and communicates with a singular system digital twin, which creates a system-level response. By extracting information from each level of the hierarchy, power system controls of the hardware were reconfigured autonomously. This hierarchical digital twin development offers several advantages over other digital twins, particularly in the field of naval power systems. The hierarchical structure allows for greater computational efficiency and scalability while the ability to autonomously reconfigure hardware controls offers increased flexibility and responsiveness. The hierarchical decomposition and models utilized were well aligned with the physical twin, as indicated by the maximum deviations between the developed digital twin hierarchy and the hardware.
KuberTENes Birthday Bash Guadalajara - K8sGPT first impressionsVictor Morales
K8sGPT is a tool that analyzes and diagnoses Kubernetes clusters. This presentation was used to share the requirements and dependencies to deploy K8sGPT in a local environment.
NUMERICAL SIMULATIONS OF HEAT AND MASS TRANSFER IN CONDENSING HEAT EXCHANGERS...ssuser7dcef0
Power plants release a large amount of water vapor into the
atmosphere through the stack. The flue gas can be a potential
source for obtaining much needed cooling water for a power
plant. If a power plant could recover and reuse a portion of this
moisture, it could reduce its total cooling water intake
requirement. One of the most practical way to recover water
from flue gas is to use a condensing heat exchanger. The power
plant could also recover latent heat due to condensation as well
as sensible heat due to lowering the flue gas exit temperature.
Additionally, harmful acids released from the stack can be
reduced in a condensing heat exchanger by acid condensation. reduced in a condensing heat exchanger by acid condensation.
Condensation of vapors in flue gas is a complicated
phenomenon since heat and mass transfer of water vapor and
various acids simultaneously occur in the presence of noncondensable
gases such as nitrogen and oxygen. Design of a
condenser depends on the knowledge and understanding of the
heat and mass transfer processes. A computer program for
numerical simulations of water (H2O) and sulfuric acid (H2SO4)
condensation in a flue gas condensing heat exchanger was
developed using MATLAB. Governing equations based on
mass and energy balances for the system were derived to
predict variables such as flue gas exit temperature, cooling
water outlet temperature, mole fraction and condensation rates
of water and sulfuric acid vapors. The equations were solved
using an iterative solution technique with calculations of heat
and mass transfer coefficients and physical properties.
Understanding Inductive Bias in Machine LearningSUTEJAS
This presentation explores the concept of inductive bias in machine learning. It explains how algorithms come with built-in assumptions and preferences that guide the learning process. You'll learn about the different types of inductive bias and how they can impact the performance and generalizability of machine learning models.
The presentation also covers the positive and negative aspects of inductive bias, along with strategies for mitigating potential drawbacks. We'll explore examples of how bias manifests in algorithms like neural networks and decision trees.
By understanding inductive bias, you can gain valuable insights into how machine learning models work and make informed decisions when building and deploying them.
Final project report on grocery store management system..pdfKamal Acharya
In today’s fast-changing business environment, it’s extremely important to be able to respond to client needs in the most effective and timely manner. If your customers wish to see your business online and have instant access to your products or services.
Online Grocery Store is an e-commerce website, which retails various grocery products. This project allows viewing various products available enables registered users to purchase desired products instantly using Paytm, UPI payment processor (Instant Pay) and also can place order by using Cash on Delivery (Pay Later) option. This project provides an easy access to Administrators and Managers to view orders placed using Pay Later and Instant Pay options.
In order to develop an e-commerce website, a number of Technologies must be studied and understood. These include multi-tiered architecture, server and client-side scripting techniques, implementation technologies, programming language (such as PHP, HTML, CSS, JavaScript) and MySQL relational databases. This is a project with the objective to develop a basic website where a consumer is provided with a shopping cart website and also to know about the technologies used to develop such a website.
This document will discuss each of the underlying technologies to create and implement an e- commerce website.
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...Amil Baba Dawood bangali
Contact with Dawood Bhai Just call on +92322-6382012 and we'll help you. We'll solve all your problems within 12 to 24 hours and with 101% guarantee and with astrology systematic. If you want to take any personal or professional advice then also you can call us on +92322-6382012 , ONLINE LOVE PROBLEM & Other all types of Daily Life Problem's.Then CALL or WHATSAPP us on +92322-6382012 and Get all these problems solutions here by Amil Baba DAWOOD BANGALI
#vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore#blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #blackmagicforlove #blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #Amilbabainuk #amilbabainspain #amilbabaindubai #Amilbabainnorway #amilbabainkrachi #amilbabainlahore #amilbabaingujranwalan #amilbabainislamabad
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
2. 308 Computer Science & Information Technology (CS & IT)
the underlying network. In this paper we present two algorithms. The first is the joining algorithm
that each node runs when it enters the system. The essential idea of the algorithm is to construct a
multicast tree structure by finding a suitable neighbour in the overlay multicast tree and
considering resources of peers. The second algorithm handles a host leaving that occurs
gracefully or accidentally. For both algorithms we provide full mathematical proofs of minimality
features. In addition, we present some experimental results and evaluations. And finally we
conclude our paper with remarks on possible future work.
2. RELATED WORKS
In recent years a number of P2P-based applications for stream delivery have been developed –
e.g. Zattoo (http://zattoo.com), PPTP (http://www.pptv.com) and Octoshape (https: // octoshape.
com).
To improve the scalability and to optimise the usage of resources in the P2P network, several
approaches have been proposed. In [1] various problems that arise due to the fact of P2P systems
being highly dynamic and heterogenous are examined. It focuses especially on resilience
mechanisms. In [2] and [6] an overview of application and network layer mechanisms are
presented and the Mesh and Multiple-Tree P2P overlays are compared.
Several applications have been developed for various categories of mesh based P2P streaming.
The authors of [8] and [7] present a hybrid approach for overlay construction and data delivery in
an application-layer multicast. The HyPO approach in [7] optimizes the overlay by organizing
peers with similar bandwidth ranges in a geographical area into a mesh overlay. The ToMo
approach in [7] combines the strong points of a tree-based structure and a mesh-based data
delivery to a two-layer hybrid overlay. The mTreebone of [9] is a collaborative tree-mesh design
that leverages both mesh and tree structures. The key idea is to identify a set of stable nodes to
construct a tree-based backbone with most of the data being pushed over this backbone. AnySee
[5] is a mesh based P2P system in which resources are assigned based on their locality and delay.
In the present work we propose algorithms to construct a tree based multicast overlay based on
topological distances. Similar approaches are described in [12], [3] and [14]. Already in [20] an
architecture has been proposed for designing a global internet host distance estimation service.
However, only relatively recently geographical information has become practically available
from freely available geolocation databases [16], and therefore ideas which have been of
theoretical value only have now become practical, see also [19]. The approach used in [12] and
[3] organizes the peers into a hierarchy of clusters such that the neighboring peers are grouped
into the same cluster. The overlay network is build from the cluster leaders to the other members
recursively. In [14] a locality-aware P2P overlay construction method, called Nearcast, is
proposed which builds an efficient overlay multicast tree by letting each peer node choose
physically closer nodes as its logical children. Whereas there is rather comprehensive coverage of
theoretical P2P algorithms and mathematical theorems on some of them like e.g. the T-Man
protocol, see [4], up to our best knowledge, no minimality results have been proven for the
overlay networks like the one described above but rather simulation results have been computed.
In our work we propose algorithms which minimise the routing costs, usage of peer resources and
end-to-end delay based on the topological location of peers. We provide a proof for the
minimality of routing costs and provide evidence for keeping end-to-end delay low.
3. Computer Science & Information Technology (CS & IT) 309
3. PROPOSED APPROACH
The concept of P2P multicasting [11], [12] is often applied to reduce the costs needed to deploy
and to maintain services related to streaming of various content to many users, e.g. VoD, IPTV,
radio, news channels, etc. In this paper, we propose an approach to the construction of a P2P
overlay multicast tree with the goal to solve the following important problems:
– Optimal routing between peers: Transmission at an overlay P2P-network might be
inefficient, especially when the P2P-network is randomly constructed. This stems from the fact
that the distance between peers physically or topologically is not considered by constructing the
P2P-network.
– Optimal usage of peer resources: Peer resources include available bandwidth, processing
power and storage space.
– End-to-End delay: The end-to-end delay is the latency, accumulated peer by peer, for the
delivery of a data packet along the overlay path from the source host to an end host. To reduce
this delay the height of the multicast tree should be kept small.
– Handling of peer connections: In practice the P2P-network need to deal with peers joining the
network and peers that leave voluntarily or due to failure.
Figure 1. Topological search tree and p2p multicast tree structure.
To overcome these problems, we propose algorithms for the construction and the management of
an overlay P2P-network. Our algorithms use the topological distances between peers to guarantee
the optimal routing costs. We define two data structures, a topological search tree and a P2P
multicast tree (fig. 1). The search tree is used to find the nearest peer to be attached to the
multicast overlay. This a special case of the Nearest Neighbour Search (NNS) or closest point
search problem. Donald Knuth named this problem the post office problem [10]. The problem
relates to an application of the assignment to the next post office. In our case the problem is
reduced to the search in the tree and adapted for the search of an optimal usage of peer resources.
The P2P multicast tree is used for the actual data transfer.
4. 310 Computer Science & Information Technology (CS & IT)
4. P2P OVERLAY MULTICAST TREE CONSTRUCTION AND MAIN-
TENANCE
4.1. Definitions and Preliminaries
To identify the topological position of hosts in a network, a unique H-dimensional coordinate C
is assigned to each host. The idea to use the network coordinates is based on considerations from
[13], [14] and [15]. In contrast to the algorithms presented therein, we use in our approach two
data structures: the search tree Ts for searching the nearest neighbour according the topological
position in the network and the multicast tree T to connect hosts to a P2P overlay multicast
network.
The multicast overlay tree is defined as T = (V, E), where V is a set of vertices, which represent
the end hosts, and E is a set of directed edges, which represent data delivery streams between the
end hosts.
5. Computer Science & Information Technology (CS & IT) 311
4.2. Joining algorithm
To construct a multicast overlay tree the joining algorithm connects the hosts to an overlay
network by analysing the geolocation information provided by the end hosts. The algorithm can
be implemented in a centralized or a distributed manner. The pseudocode of the joining algorithm
is shown in fig. 2.
Figure 2. The pseudocode of the JOIN algorithm
Figure 3 illustrates an example of the joining nodes to an existing overlay network. Initially the
overlay multicast tree contains only a source host S and the search tree Ts includes the
coordinates C(S) (fig. 3a). To attach the new node v1 the joining algorithm extends the search tree
Ts by the adding the coordinates C(v1) and determines the nearest host by traversing the search
tree Ts. The nearest neighbour can be easily found by a simple tree traversing in O(log n) time.
The new host v1 is attached to the host S (fig. 3b). The fig. 3c illustrates the attaching of the host
v2 to the multicast overlay tree.
6. 312 Computer Science & Information Technology (CS & IT)
Figure 3. An example of the algorithm JOIN execution.
Figure 4. Proof by induction
12. 318 Computer Science & Information Technology (CS & IT)
Figure 9. The pseudocode of the JOINRE algorithm
4.5 Reconstruction algorithm
5. EXPERIMENTAL EVALUATIONS
13. Computer Science & Information Technology (CS & IT) 319
Figure 10. The pseudocode of the reconstruction algorithm
14. 320 Computer Science & Information Technology (CS & IT)
Figure 11. Comparison of results: JOIN - proposed algorithm, BBT - Balanced Binary Tree
6. CONCLUSION
In this paper we presented a novel multicast tree construction and maintenance approach based on
the topological network coordinates of the end hosts. The algorithms presented in this paper were
developed to achieve the following desirable properties:
– Minimal routing overhead in the underlying network
– Optimal resource management of the hosts
– Short end-to-end delay
We evaluated our approach theoretically and by using simulations. Compared to the randomly
generated trees our approach improves significantly the performance metrics of a multicast
overlay tree. Our future work will concentrate on implementing this approach in a real
environment, collecting and analysing the performance data.
REFERENCES
[1] Abboud, O., Pussep, K., Kovacevic, A., Mohr, K., Kaune, S., Steinmetz, R., Enabling Resilient P2P
Video Streaming, Multimedia Systems, Vol. 17, No. 3, p. 177-197, June 2011
[2] Jurca, D., Chakareski, J.,Wagner, J., Frossard, P., Enabling Adaptive Video Streaming in P2P
Systems, IEEE Communications Magazine, p. 108-114, June 2007
[3] Tran, D. A., Hua, K., Do, T., ZIGZAG: An Effcient Peer-to-Peer Scheme for Media Streaming, Proc.
of IEEE INFOCOM, Vol.2, pp.1283-1292, 2003
[4] Márk Jelasity and Ozalp Babaoglu, T-Man: Gossip-based overlay topology management, 3rd Int.
Workshop on Engineering Self-Organising Applications (ESOA’05), Springer-Verlag, pp. 1-15, 2005
[5] X. Liao, H. Jin, Y. Liu, L. M. Ni, D. Deng., AnySee: Peer-to-peer live streaming. In Proceedings of
IEEE International Conference on Computer Communications, Barcelona, Spain, 2006.
[6] Magharei, N., Rejaie, R., Yang G., Mesh or Multiple-Tree: A Comparative Study of Live P2P
Streaming Approaches, 26th IEEE International Conference on Computer Communications-
INFOCOM, pp. 1424-1432, 2007.
15. Computer Science & Information Technology (CS & IT) 321
[7] H. Byun and M. Lee, HyPO: A Peer-to-Peer based Hybrid Overlay Structure, IEEE ICACT 2009,
Feb. 2009.
[8] Awiphan, S., Zhou Su, Katto, J., Two-layer Mesh/Tree Overlay Structure for Live Video Streaming
in P2P Networks, proc. 7th IEEE Consumer Communications and Networking Conference (CCNC),
pp. 1-5, 2010
[9] F.,Wang, Y., Xiong, and J., Liu, mTreebone: A Collaborative Tree-Mesh Overlay Network for
Multicast Video Streaming, IEEE Transactions on Parallel and Distributed Systems, Vol. 21, No. 3,
pp. 379-392, March 2010.
[10] Donald Knuth, The Art of Computer Programming, Addison-Wesley, Vol. 3,1973
[11] Zhang, X.Y., Zhang, Q., Zhang, Z., Song, G., Zhu, W., A Construction of Locality-aware Overlay
Network: mOverlay and its Performance, IEEE Journal on Selected Areas in Communications, pp.
18-28, 2004
[12] Banerjee, S., Bhattacharjee, B. Kommareddy, C., Scalable application layer multicast, Proc. ACM
SIGCOMM Conf., ACM Press, New York, 2002.
[13] Abboud, O., Kovacevic, A., Graffi, K., Pussep, K., Steinmetz, R., Underlay Awareness in P2P
Systems: Techniques and Challenges, IEEE International Parallel and Distributed Processing
Symposium, 2009
[14] Xuping Tu, Hai Jin, Xiaofei Liao, and Jiannong Cao, Nearcast: A locality-aware P2P live streaming
approach for distance education. ACM Transactions on Internet Technology, Vol. 8 - Issue 2, 2008
[15] T. S. Eugene Ng, Hui Zhang, Predicting internet network distance with coordinates-based
approaches. Proc. of IEEE INFOCOM, New York, Vol. 1, pp. 170–179, 2001
[16] James A. Muir and Paul C. Van Oorschot, Internet geolocation: Evasion and counterevasion, Journal
ACM Computing Surveys, Vol. 42 - Issue 1, No. 4, December 2009
[17] Editor: Andrei Popescu, Geolocation API Specification, W3C, 22 December 2008
[18] Editor: Philip Olson, PHP Manual - Geo IP Location, The PHP Documentation Group, 2014,
http://php.net/manual/en/book.geoip.php
[19] Chao Dai, Yong Jiang, Shu-Tao Xia, Hai-Tao Zheng, and Laizhong Cui. A traffic localization
strategy for peer-to-peer live streaming. In 2013 IEEE Symposium on Computers and
Communications, ISCC 2013, Split, Croatia, 7-10 July, 2013, pages 495–501, 2013.
[20] Paul Francis, Sugih Jamin, Vern Paxson, Lixia Zhang, Daniel F. Gryniewicz, and Yixin Jin. An
architecture for a global internet host distance estimation service, Proceedings of IEEE INFOCOM,
1999.
[21] Ethan Katz-bassett, John P. John, Arvind Krishnamurthy, David Wetherall, Thomas Anderson, and
Yatin Chawathe. Towards IP Geolocation Using Delay and Topology Measurements, IMC, 2006