Resilient multicast is a challenging issue for overlay trees particularly because of high churn. In this work,
we propose a mechanism that allows scalable video multicast. While the regular operation involves treepush
of the video, any node that looses its parent on the tree solicits video from a predetermined backup set
of nodes in a mesh-pull fashion. The main idea is to allocate less bandwidth for backup to improve
bandwidth utilization while maintaining the best possible video quality. The choice of essential design
parameters are studied together with seamlessness of the streaming under variety of fault scenarios.
Simulation results indicate the optimality of the proposed approach as far as resiliency, bandwidth
utilization, delay and video quality are concerned.
Clustering Based Lifetime Maximizing Aggregation Tree for Wireless Sensor Net...IJASCSE
Energy efficiency is the most important issue in all facets of wireless sensor networks (WSNs) operations because of the limited and non-replenish able energy supply. The data aggregation mechanism is one of the possible solutions to prolong the lifetime of sensor nodes and on the other hand it also helps in eliminating the data redundancy and improving the accuracy of information gathering, is essential for WSNs. In this paper we propose a Clustering based lifetime maximizing aggregation tree (CLMAT) in which we create aggregation tree which aim to reduce energy consumption.
Memory and I/O optimized rectilinear Steiner minimum tree routing for VLSI IJECEIAES
As the size of devices are scaling down at rapid pace, the interconnect delay play a major part in performance of IC chips. Therefore minimizing delay and wire length is the most desired objective. FLUTE (Fast Look-Up table) presented a fast and accurate RSMT (Rectilinear Steiner Minimum Tree) construction for both smaller and higher degree net. FLUTE presented an optimization technique that reduces time complexity for RSMT construction for both smaller and larger degree nets. However for larger degree net this technique induces memory overhead, as it does not consider the memory requirement in constructing RSMT. Since availability of memory is very less and is expensive, it is desired to utilize memory more efficiently which in turn results in reducing I/O time (i.e. reduce the number of I/O disk access). The proposed work presents a Memory Optimized RSMT (MORSMT) construction in order to address the memory overhead for larger degree net. The depth-first search and divide and conquer approach is adopted to build a Memory optimized tree. Experiments are conducted to evaluate the performance of proposed approach over existing model for varied benchmarks in terms of computation time, memory overhead and wire length. The experimental results show that the proposed model is scalable and efficient.
A Low Control Overhead Cluster Maintenance Scheme for Mobile Ad hoc NETworks ...IDES Editor
Clustering is an important research area for
mobile ad hoc networks (MANETs) as it increases the
capacity of network, reduces the routing overhead and
makes the network more scalable in the presence of both
high mobility and a large number of mobile nodes. In
clustering the clusterhead manage and store recent routing
information. However the frequent change of clusterhead
leads to loss of routing information stored, changes the route
between two nodes, affects the performance of the routing
protocol and makes the cluster structure unstable.
Communication overhead in terms of exchanging messages
is needed to elect a new clusterhead. The goal then would be
to keep the clusterhead change as least as possible to make
cluster structure more stable, to prevent loss of routing
information which in turn improve the performance of
routing protocol based on clustering. This can be achieved
by an efficient cluster maintenance scheme. In this work, a
novel clustering algorithm, namely Incremental
Maintenance Clustering Scheme (IMS) is proposed for
Mobile Ad Hoc Networks. The goals are yielding low
number of clusterhead and clustermember changes,
maintaining stable clusters, minimizing the number of
clustering overhead. Through simulations the performance
of IMS is compared with that of least cluster change (LCC)
and maintenance scheme of Cluster Based Routing Protocol
(CBRP) in terms of the number of clusterhead changes,
number of cluster-member changes and clustering overhead
by varying mobility and speed. The simulation results
demonstrate the superiority of IMS over LCC and
maintenance scheme of CBRP.
A DELAY – CONSTRAINED IN MULTICAST ROUTING USING JIA ALGORITHMIJCI JOURNAL
The Distributed multicast routing protocol under delay constraints, is one of the software, which requires simultaneous transmission of message from a source to a group of destinations within specified time delay. For example. Video Conferencing system. Multicast routing is to find a routing tree which is routed from the source and contains all the destinations. The principle goal of multicast routing is to minimize the network cost. A tree with minimal overall cost is called a Steiner tree. Finding such tree is the principle of the NP complete.
Many inexpensive heuristic algorithms have been proposed for the Steiner tree problem. However, most of the proposed algorithms are centralized in nature. Centralized algorithm requires a central node to be responsible for computing the tree and this central node must have full knowledge about the global network. But, this is not practical in large networks. Therefore, existing algorithms suffer from the drawback such as heavy communication cost, long connection setup time and poor quality of produced routing trees. So far, a little work has been done on finding delay bounded Steiner tree in a distributed manner. An effort is made in this paper to this effect. The Study reveals that the drawbacks mentioned
above has been sufficiently reduced. This paper gives complete guidelines for authors submitting papers for the AIRCC Journals.
Clustering Based Lifetime Maximizing Aggregation Tree for Wireless Sensor Net...IJASCSE
Energy efficiency is the most important issue in all facets of wireless sensor networks (WSNs) operations because of the limited and non-replenish able energy supply. The data aggregation mechanism is one of the possible solutions to prolong the lifetime of sensor nodes and on the other hand it also helps in eliminating the data redundancy and improving the accuracy of information gathering, is essential for WSNs. In this paper we propose a Clustering based lifetime maximizing aggregation tree (CLMAT) in which we create aggregation tree which aim to reduce energy consumption.
Memory and I/O optimized rectilinear Steiner minimum tree routing for VLSI IJECEIAES
As the size of devices are scaling down at rapid pace, the interconnect delay play a major part in performance of IC chips. Therefore minimizing delay and wire length is the most desired objective. FLUTE (Fast Look-Up table) presented a fast and accurate RSMT (Rectilinear Steiner Minimum Tree) construction for both smaller and higher degree net. FLUTE presented an optimization technique that reduces time complexity for RSMT construction for both smaller and larger degree nets. However for larger degree net this technique induces memory overhead, as it does not consider the memory requirement in constructing RSMT. Since availability of memory is very less and is expensive, it is desired to utilize memory more efficiently which in turn results in reducing I/O time (i.e. reduce the number of I/O disk access). The proposed work presents a Memory Optimized RSMT (MORSMT) construction in order to address the memory overhead for larger degree net. The depth-first search and divide and conquer approach is adopted to build a Memory optimized tree. Experiments are conducted to evaluate the performance of proposed approach over existing model for varied benchmarks in terms of computation time, memory overhead and wire length. The experimental results show that the proposed model is scalable and efficient.
A Low Control Overhead Cluster Maintenance Scheme for Mobile Ad hoc NETworks ...IDES Editor
Clustering is an important research area for
mobile ad hoc networks (MANETs) as it increases the
capacity of network, reduces the routing overhead and
makes the network more scalable in the presence of both
high mobility and a large number of mobile nodes. In
clustering the clusterhead manage and store recent routing
information. However the frequent change of clusterhead
leads to loss of routing information stored, changes the route
between two nodes, affects the performance of the routing
protocol and makes the cluster structure unstable.
Communication overhead in terms of exchanging messages
is needed to elect a new clusterhead. The goal then would be
to keep the clusterhead change as least as possible to make
cluster structure more stable, to prevent loss of routing
information which in turn improve the performance of
routing protocol based on clustering. This can be achieved
by an efficient cluster maintenance scheme. In this work, a
novel clustering algorithm, namely Incremental
Maintenance Clustering Scheme (IMS) is proposed for
Mobile Ad Hoc Networks. The goals are yielding low
number of clusterhead and clustermember changes,
maintaining stable clusters, minimizing the number of
clustering overhead. Through simulations the performance
of IMS is compared with that of least cluster change (LCC)
and maintenance scheme of Cluster Based Routing Protocol
(CBRP) in terms of the number of clusterhead changes,
number of cluster-member changes and clustering overhead
by varying mobility and speed. The simulation results
demonstrate the superiority of IMS over LCC and
maintenance scheme of CBRP.
A DELAY – CONSTRAINED IN MULTICAST ROUTING USING JIA ALGORITHMIJCI JOURNAL
The Distributed multicast routing protocol under delay constraints, is one of the software, which requires simultaneous transmission of message from a source to a group of destinations within specified time delay. For example. Video Conferencing system. Multicast routing is to find a routing tree which is routed from the source and contains all the destinations. The principle goal of multicast routing is to minimize the network cost. A tree with minimal overall cost is called a Steiner tree. Finding such tree is the principle of the NP complete.
Many inexpensive heuristic algorithms have been proposed for the Steiner tree problem. However, most of the proposed algorithms are centralized in nature. Centralized algorithm requires a central node to be responsible for computing the tree and this central node must have full knowledge about the global network. But, this is not practical in large networks. Therefore, existing algorithms suffer from the drawback such as heavy communication cost, long connection setup time and poor quality of produced routing trees. So far, a little work has been done on finding delay bounded Steiner tree in a distributed manner. An effort is made in this paper to this effect. The Study reveals that the drawbacks mentioned
above has been sufficiently reduced. This paper gives complete guidelines for authors submitting papers for the AIRCC Journals.
(Paper) P2P VIDEO BROADCAST BASED ON PER-PEER TRANSCODING AND ITS EVALUATION ...Naoki Shibata
Shibata, N., Yasumoto, K., and Mori, M.: P2P Video Broadcast based on Per-Peer Transcoding and its Evaluation on PlanetLab, Proc. of 19th IASTED Int'l. Conf. on Parallel and Distributed Computing and Systems (PDCS2007), pp. 478-483, (November 2007).
http://ito-lab.naist.jp/themes/pdffiles/071121.shibata.pdcs2007.pdf
We have previously proposed a P2P video broadcast method called MTcast for simultaneously delivering video to user peers with different quality requirements. In this paper, we design and implement a prototype system of MTcast and report the results of its performance evaluation in the real Internet environment. MTcast relies on each peer to transcode and forward video to other peers. We conducted experiments on 20 PlanetLab nodes, evaluated startup delay and recovery time from peer leaving/failure, and confirmed that MTcast achieves practical performance in a real environment.
An efficient tree based self-organizing protocol for internet of thingsredpel dot com
An efficient tree based self-organizing protocol for internet of things.
for more ieee paper / full abstract / implementation , just visit www.redpel.com
WEIGHTED DYNAMIC DISTRIBUTED CLUSTERING PROTOCOL FOR HETEROGENEOUS WIRELESS S...ijwmn
In wireless sensor networks (WSN), conserving energy and increasing lifetime of the network are a critical issue that has been addressed by substantial research works. The clustering technique has been proven particularly energy-efficient in WSN. The nodes form groups (clusters) that include one cluster head and member clusters. Cluster heads (CHs) are able to process, filter, gather the data sent by sensors
belonging to their cluster and send it to the base station. Many routing protocols which have been proposed are based on heterogeneity and use the clustering scheme such as SEP and DEEC. In this paper we introduce a new approach called WDDC in which cluster heads are chosen on the basis
of probability of ratio of residual energy and average energy of the network. It also takes into consideration distances between nodes and the base station to favor near nodes with more energy to be cluster heads. Furthermore, WDDC is dynamic; it divides network lifetime in two zones in which it changes its behavior. Simulation results show that our approach performs better than the other distributed clustering protocols such as SEP and DEEC in terms of energy efficiency and lifetime of the network.
Ameliorate Threshold Distributed Energy Efficient Clustering Algorithm for He...chokrio
Ameliorating the lifetime in heterogeneous wireless sensor network is an important task because the sensor nodes are limited in the resource energy. The best way to improve a WSN lifetime is the clustering based algorithms in which each cluster is managed by a leader called Cluster Head. Each other node must communicate with this CH to send the data sensing. The nearest base station nodes must also send their data to their leaders, this causes a loss of energy. In this paper, we propose a new approach to ameliorate a threshold distributed energy efficient clustering protocol for heterogeneous wireless sensor networks by excluding closest nodes to the base station in the clustering process. We show by simulation in MATLAB that the proposed approach increases obviously the number of the received packet messages and prolongs the lifetime of the network compared to TDEEC protocol.
An Improved Deterministic Energy Efficient Clustering Protocol for Wireless S...IJERA Editor
In recent development, achieving the deployment of nodes, lifetime, fault tolerance, latency, energy efficiency in brief robustness and high reliability have become the prime research goals of wireless sensor network. In recent years many clustering protocols have been suggested on clustering structure based on heterogeneity. We propose improved deterministic energy-efficient clustering protocol for four types of nodes which extend the stability and lifetime of the network in team of first node get dead. Hence, it increases the heterogeneity and energy level of the network. I-DEC performs better than E-SEP, SEP and DEC with more stability and effective messages shows in simulation results.
This is an article based on a design that we've created while at UCDavis Medical Center.
The idea was to link two data centers and have Storage replication for DR.
Hybrid Approach for Robust Digital Video WatermarkingIJSRD
With the growing popularity of internet and digital media, digital watermarking techniques have been developed to protect the copyright of multimedia objects such as text, audio, video, etc. So, we have proposed a hybrid video watermarking technique which takes the advantages of different transforms like DWT, DCT, SVD and Arnold Transform, which enhances more security and provides robustness to the watermark. In this paper method, video is divided into several groups of frames, and one of the frames is selected where watermark will be embedded. Before embedding watermark in a selected frame it will be pre-processed with Arnold Transform which will provide security to it. The selected plane of video frame are decomposed using DWT and high frequency band HH, middle frequency bands LH, HL are transformed with DCT. The DCT coefficients are SVD transformed which are embedded with corresponding transformed coefficients of watermarks along with Arnold Transform. The embedded watermark is extracted with inverse process of embedding. The proposed algorithm is tested with various video sequences using MATLAB 2013a. The distortion quality of original image and watermark is controlled by the Peak Signal to Noise Ratio, Signal to Noise Ratio and Mean square error of the watermarked frame with original frame.
SVD Based Robust Digital Watermarking For Still Images Using Wavelet Transform cscpconf
This paper aims at developing a hybrid image watermarking algorithm which satisfies both
imperceptibility and robustness requirements. In order to achieve our objectives we have used
singular values of Wavelet Transformation’s HL and LH sub bands to embed watermark.
Further to increase and control the strength of the watermark, we use a scale factor. An optimal
watermark embedding method is developed to achieve minimum watermarking distortion. A
secret embedding key is designed to securely embed the fragile watermarks so that the new
method is robust to counterfeiting, even when the malicious attackers are fully aware of the
watermark embedding algorithm. Experimental results are provided in terms of Peak signal to
noise ratio (PSNR), Normalized cross correlation (NCC) and gain factor to demonstrate the
effectiveness of the proposed algorithm. Image operations such as JPEG compression from
malicious image attacks and, thus, can be used for semi-fragile watermarking
Optimal Transmit Power and Packet Size in Wireless Sensor Networks in Shadowe...IDES Editor
This paper investigates the effects of
shadowing on the optimal transmit power required to
sustain the network connectivity while maintaining a
predefined maximum tolerable Bit Error Rate (BER) in
a Wireless Sensor Networks (WSN). Optimization of
transmit power is of great importance in WSN since
sensor nodes are battery driven and optimization helps
to increase battery life by reducing inter node
interference significantly. An infinite Automatic Repeat
Request (ARQ) model has been considered to assess the
impact of shadowing and other network conditions on
energy requirement for successful packet transmission in
WSN. We also find the optimal packet length based on
energy efficiency. Effects of shadowing on optimal packet
size and energy efficiency in packetized data
transmission are also investigated. Further energy
consumption is minimized considering a variable packet
length based transmission. Use of optimal packet size
shows a significant reduction in energy spending.
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.
STUDY THE EFFECT OF PARAMETERS TO LOAD BALANCING IN CLOUD COMPUTINGIJCNCJournal
The rapid growth of users on the cloud service and number of services to the user increases the load on the
servers at cloud datacenter. This issue is becoming a challenge for the researchers. And requires used
effectively a load balancing technique not only to balance the resources for servers but also reduce the
negative impact to the end-user service. The current, load balancing techniques have solved the various
problems such as: (i) load balancing after a server was overloaded; (ii) load balancing and load forecast
for the allocation of resources; iii) improving the parameters affecting to load balancing in cloud. The
study of improving these parameters have great significance to improving system performance through
load balancing. From there, we can propose more effective methods of load balancing, in order to increase
system performance. Therefore, in this paper we researched some parameters affecting the performance
load balancing on the cloud computing.
(Paper) P2P VIDEO BROADCAST BASED ON PER-PEER TRANSCODING AND ITS EVALUATION ...Naoki Shibata
Shibata, N., Yasumoto, K., and Mori, M.: P2P Video Broadcast based on Per-Peer Transcoding and its Evaluation on PlanetLab, Proc. of 19th IASTED Int'l. Conf. on Parallel and Distributed Computing and Systems (PDCS2007), pp. 478-483, (November 2007).
http://ito-lab.naist.jp/themes/pdffiles/071121.shibata.pdcs2007.pdf
We have previously proposed a P2P video broadcast method called MTcast for simultaneously delivering video to user peers with different quality requirements. In this paper, we design and implement a prototype system of MTcast and report the results of its performance evaluation in the real Internet environment. MTcast relies on each peer to transcode and forward video to other peers. We conducted experiments on 20 PlanetLab nodes, evaluated startup delay and recovery time from peer leaving/failure, and confirmed that MTcast achieves practical performance in a real environment.
An efficient tree based self-organizing protocol for internet of thingsredpel dot com
An efficient tree based self-organizing protocol for internet of things.
for more ieee paper / full abstract / implementation , just visit www.redpel.com
WEIGHTED DYNAMIC DISTRIBUTED CLUSTERING PROTOCOL FOR HETEROGENEOUS WIRELESS S...ijwmn
In wireless sensor networks (WSN), conserving energy and increasing lifetime of the network are a critical issue that has been addressed by substantial research works. The clustering technique has been proven particularly energy-efficient in WSN. The nodes form groups (clusters) that include one cluster head and member clusters. Cluster heads (CHs) are able to process, filter, gather the data sent by sensors
belonging to their cluster and send it to the base station. Many routing protocols which have been proposed are based on heterogeneity and use the clustering scheme such as SEP and DEEC. In this paper we introduce a new approach called WDDC in which cluster heads are chosen on the basis
of probability of ratio of residual energy and average energy of the network. It also takes into consideration distances between nodes and the base station to favor near nodes with more energy to be cluster heads. Furthermore, WDDC is dynamic; it divides network lifetime in two zones in which it changes its behavior. Simulation results show that our approach performs better than the other distributed clustering protocols such as SEP and DEEC in terms of energy efficiency and lifetime of the network.
Ameliorate Threshold Distributed Energy Efficient Clustering Algorithm for He...chokrio
Ameliorating the lifetime in heterogeneous wireless sensor network is an important task because the sensor nodes are limited in the resource energy. The best way to improve a WSN lifetime is the clustering based algorithms in which each cluster is managed by a leader called Cluster Head. Each other node must communicate with this CH to send the data sensing. The nearest base station nodes must also send their data to their leaders, this causes a loss of energy. In this paper, we propose a new approach to ameliorate a threshold distributed energy efficient clustering protocol for heterogeneous wireless sensor networks by excluding closest nodes to the base station in the clustering process. We show by simulation in MATLAB that the proposed approach increases obviously the number of the received packet messages and prolongs the lifetime of the network compared to TDEEC protocol.
An Improved Deterministic Energy Efficient Clustering Protocol for Wireless S...IJERA Editor
In recent development, achieving the deployment of nodes, lifetime, fault tolerance, latency, energy efficiency in brief robustness and high reliability have become the prime research goals of wireless sensor network. In recent years many clustering protocols have been suggested on clustering structure based on heterogeneity. We propose improved deterministic energy-efficient clustering protocol for four types of nodes which extend the stability and lifetime of the network in team of first node get dead. Hence, it increases the heterogeneity and energy level of the network. I-DEC performs better than E-SEP, SEP and DEC with more stability and effective messages shows in simulation results.
This is an article based on a design that we've created while at UCDavis Medical Center.
The idea was to link two data centers and have Storage replication for DR.
Hybrid Approach for Robust Digital Video WatermarkingIJSRD
With the growing popularity of internet and digital media, digital watermarking techniques have been developed to protect the copyright of multimedia objects such as text, audio, video, etc. So, we have proposed a hybrid video watermarking technique which takes the advantages of different transforms like DWT, DCT, SVD and Arnold Transform, which enhances more security and provides robustness to the watermark. In this paper method, video is divided into several groups of frames, and one of the frames is selected where watermark will be embedded. Before embedding watermark in a selected frame it will be pre-processed with Arnold Transform which will provide security to it. The selected plane of video frame are decomposed using DWT and high frequency band HH, middle frequency bands LH, HL are transformed with DCT. The DCT coefficients are SVD transformed which are embedded with corresponding transformed coefficients of watermarks along with Arnold Transform. The embedded watermark is extracted with inverse process of embedding. The proposed algorithm is tested with various video sequences using MATLAB 2013a. The distortion quality of original image and watermark is controlled by the Peak Signal to Noise Ratio, Signal to Noise Ratio and Mean square error of the watermarked frame with original frame.
SVD Based Robust Digital Watermarking For Still Images Using Wavelet Transform cscpconf
This paper aims at developing a hybrid image watermarking algorithm which satisfies both
imperceptibility and robustness requirements. In order to achieve our objectives we have used
singular values of Wavelet Transformation’s HL and LH sub bands to embed watermark.
Further to increase and control the strength of the watermark, we use a scale factor. An optimal
watermark embedding method is developed to achieve minimum watermarking distortion. A
secret embedding key is designed to securely embed the fragile watermarks so that the new
method is robust to counterfeiting, even when the malicious attackers are fully aware of the
watermark embedding algorithm. Experimental results are provided in terms of Peak signal to
noise ratio (PSNR), Normalized cross correlation (NCC) and gain factor to demonstrate the
effectiveness of the proposed algorithm. Image operations such as JPEG compression from
malicious image attacks and, thus, can be used for semi-fragile watermarking
Optimal Transmit Power and Packet Size in Wireless Sensor Networks in Shadowe...IDES Editor
This paper investigates the effects of
shadowing on the optimal transmit power required to
sustain the network connectivity while maintaining a
predefined maximum tolerable Bit Error Rate (BER) in
a Wireless Sensor Networks (WSN). Optimization of
transmit power is of great importance in WSN since
sensor nodes are battery driven and optimization helps
to increase battery life by reducing inter node
interference significantly. An infinite Automatic Repeat
Request (ARQ) model has been considered to assess the
impact of shadowing and other network conditions on
energy requirement for successful packet transmission in
WSN. We also find the optimal packet length based on
energy efficiency. Effects of shadowing on optimal packet
size and energy efficiency in packetized data
transmission are also investigated. Further energy
consumption is minimized considering a variable packet
length based transmission. Use of optimal packet size
shows a significant reduction in energy spending.
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.
STUDY THE EFFECT OF PARAMETERS TO LOAD BALANCING IN CLOUD COMPUTINGIJCNCJournal
The rapid growth of users on the cloud service and number of services to the user increases the load on the
servers at cloud datacenter. This issue is becoming a challenge for the researchers. And requires used
effectively a load balancing technique not only to balance the resources for servers but also reduce the
negative impact to the end-user service. The current, load balancing techniques have solved the various
problems such as: (i) load balancing after a server was overloaded; (ii) load balancing and load forecast
for the allocation of resources; iii) improving the parameters affecting to load balancing in cloud. The
study of improving these parameters have great significance to improving system performance through
load balancing. From there, we can propose more effective methods of load balancing, in order to increase
system performance. Therefore, in this paper we researched some parameters affecting the performance
load balancing on the cloud computing.
Probability Density Functions of the Packet Length for Computer Networks With...IJCNCJournal
The research on Internet traffic classification and identification, with application on prevention of attacks
and intrusions, increased considerably in the past years. Strategies based on statistical characteristics of
the Internet traffic, that use parameters such as packet length (size) and inter-arrival time and their
probability density functions, are popular. This paper presents a new statistical modeling for packet length,
which shows that it can be modeled using a probability density function that involves a normal or a beta
distribution, according to the traffic generated by the users. The proposed functions has parameters that
depend on the type of traffic and can be used as part of an Internet traffic classification and identification
strategy. The models can be used to compare, simulate and estimate the computer network traffic, as well
as to generate synthetic traffic and estimate the packets processing capacity of Internet routers
Analytical Modelling of Localized P2P Streaming Systems under NAT ConsiderationIJCNCJournal
NAT has been design to work with Internet client-server structure. The emerged of Peer-to-Peer (P2P)
networks and applications revealed the incompatibility between P2P applications and NAT. Many methods
has been developed and implemented to solve connectivity between peers behind NAT devices.
Nevertheless, various NATing types can’t communicate with one another. In this work, we are going to
study the impact of NAT types on the start-up delay time of peers in P2P streaming systems. We will
demonstrate the ability of NATing to expel peers in P2P live streaming systems. A new neighbour selecting
algorithm will be proposed. This algorithm will utilize NAT-types configurations as a parameter. We have
utilized NS2 simulator to show the performance of the new algorithm in increasing the connectivity,
reducing the number of expelled peers and implementing of locality.
A FRAMEWORK FOR SOFTWARE-AS-A-SERVICE SELECTION AND PROVISIONINGIJCNCJournal
As cloud computing is increasingly transforming the information technology landscape, organizations and
businesses are exhibiting strong interest in Software-as-a-Service (SaaS) offerings that can help them
increase business agility and reduce their operational costs. They increasingly demand services that can
meet their functional and non-functional requirements. Given the plethora and the variety of SaaS
offerings, we propose, in this paper, a framework for SaaS provisioning, which relies on brokered Service
Level agreements (SLAs), between service consumers and SaaS providers. The Cloud Service Broker (CSB)
helps service consumers find the right SaaS providers that can fulfil their functional and non-functional
requirements. The proposed selection algorithm ranks potential SaaS providers by matching their offerings
against the requirements of the service consumer using an aggregate utility function. Furthermore, the CSB
is in charge of conducting SLA negotiation with selected SaaS providers, on behalf of service consumers,
and performing SLA compliance monitoring
Performance comparison of aodv and olsr using 802.11 a and dsrc (802.11p) pro...IJCNCJournal
A Vehicular Ad Hoc Network (VANET) is a network formed purely among vehicles without presence of any
communication infrastructure as base stations and/or access point. Frequent topological changes due to
high mobility is one of the main issues in VANETs. In this paper we evaluate Ad-hoc On-Demand Distance
Vector (AODV) and Optimized Link State Routing (OLSR) routing protocols using 802.11a and 802.11p in
a realistic urban scenario. For this comparison, we chose five performance metrics: Path Availability, Endto-
End Delay, Number of Created Paths, Path Length and Path Duration. Simulation results show, that for
most of the metrics evaluated, OLSR outperforms AODV when 802.11p and that 802.11p is more efficient
in urban VANETs.
The Extended Clustering Ad Hoc Routing Protocol (Ecrp)IJCNCJournal
Ad hoc networks are a collection of mobile nodes communicating via wireless channels without any fixed
infrastructure. Because of their ease and low cost of building, ad hoc networks have a lot of attractive
applications in different fields. The topology of ad hoc networks changes dynamically, and each node in the
network can act as a host or router. With the increase in the number of wireless devices and large amount
of traffic to be exchanged, the demand for scalable routing protocols has increased. This paper presents a
scalable routing protocol, based on AODV protocol, called the Extended Clustering Ad Hoc Routing
Protocol (ECRP). This is a hybrid protocol, which combines reactive and proactive approaches in routing.
The protocol uses the Global Positioning System to determine the position of certain nodes in the network.
The evaluation methodology and simulation results obtained show that the protocol is efficient and scales
well in large networks
Qos group based optimal retransmission medium access protocol for wireless se...IJCNCJournal
This paper presents, a Group Based Optimal Retransmission Medium Access (GORMA) Protocol is
designed that combines protocol of Collision Avoidance (CA) and energy management for low-cost, shortrange,
low-data rate and low-energy sensor nodes applications in environment monitoring, agriculture,
industrial plants etc. In this paper, the GORMA protocol focuses on efficient MAC protocol to provide
autonomous Quality of Service (QoS) to the sensor nodes in one-hop QoS retransmission group and two
QoS groups in WSNs where the source nodes do not have receiver circuits. Hence, they can only transmit
data to a sink node, but cannot receive any control signals from the sink node. The proposed protocol
GORMA provides QoS to the nodes which work independently on predefined time by allowing them to
transmit each packet an optimal number of times within a given period. Our simulation results shows that
the performance of GORMA protocol, which maximize the delivery probability of one-hop QoS group and
two QoS groups and minimize the energy consumption.
Analysis of Hierarchical Scheduling for Heterogeneous Traffic over NetworkIJCNCJournal
Scheduling real time and non real time packets at network nodes has an important impact by reducing the
processing overhead, queuing delay and response time. Most of the existing packet scheduling algorithms
used in network based on First-In First-Out (FIFO), non-preemptive priority, and preemptive priority
scheduling. However, these algorithms incur a large processing overhead, queuing delay and response
time and are not dynamic to the data traffic changes. In this paper, we present a new hierarchical
scheduling algorithm to assign priority, Hierarchical Hybrid EDF/FIFO which can not only serve the real
time traffic but also provide best effort service to non real time traffic. To examine our approach for
scheduling, we realized our analytical study to express the worst case queuing delay and the worst case
response time for different traffics. The simulation results showed that the Hierarchical hybrid EDF/FIFO
achieved the minimum packet delay and adequate loss packet for non real time traffic when compared with
Hierarchical FIFO. In general, the performances of our approach draw near to Hierarchical EDF which
confirms the effectiveness of this approach.
A Compact Dual Band Dielectric Resonator Antenna For Wireless ApplicationsIJCNCJournal
This paper presents the design of a dual band rectangular Dielectric Resonator Antenna (DRA)
coupled to narrow slot aperture that is fed by microstrip line. The fundamental TE111 mode and
higher-order TE113 mode are excited with their resonant frequencies respectively. These
frequencies can be controlled by changing the DRA dimensions. A dielectric resonator with high
permittivity is used to miniaturize the global structure. The proposed antenna is designed to have
dual band operation suitable for both DCS (1710 - 1880 MHz) and WLAN (2400 - 2484 MHz)
applications. The return loss, radiation pattern and gain of the proposed antenna are evaluated.
Reasonable agreement between simulation and experimental results is obtained.
Reducing the Peak to Average Power Ratio of Mimo-Ofdm SystemsIJCNCJournal
In this paper, we proposed a particle swarm optimization (PSO) based partial transmit sequence (PTS)
technique in order to achieve the lowest Peak-to-Average Power Ratio(PAPR) in Multiple Input Multiple
Output- Orthogonal Frequency Division Multiplexing (MIMO-OFDM) systems. Our approach consist of
applying the PSO based PTS on each antenna of the system in order to find the optimal phase factors,
which is a straightforward method to get the minimum PAPR in such a system. The simulation results
demonstrate that the PSO based PTS algorithm when applied to MIMO-OFDM systems with a wide range
of phase factors, tends to give a high performance. In addition, there is no need to increase the number of
particles of the PSO algorithm to enhance the performance of the system. As a result of this, the complexity
of finding the minimum PAPR is kept at a reasonable level.
A multi tenant platform for sms integrated servicesIJCNCJournal
This paper presents the design and development of a Linux based infrastructure and platform for a
wholesale service provider to offer SMS integrated services to retail providers for resale. The multi-tenant
platform, capable of providing multiple types of SMS integrated services, was designed and built mainly
with off-the-shelf components and open source software. The platform is highly reliable and flexible,
enabling fast provision of customisable services by integrating SMS, voice, VoIP, and web services in
innovative ways. This paper describes the design of the platform and presents four major application areas.
Enhanced aodv route discovery and route establishment for qos provision for r...IJCNCJournal
MANET is a temporary connection of mobile nodes via wireless links having no centralized base station.
We developed a protocol with an enhanced route discovery mechanism that avoids the pre-transmission
delay. When a source node wants to communicate with another node, it broadcast RREQ. EAODV give
priority to the source node of real time transmission. When RREQ packet send to neighbor node, for real
time transmission it accept route request on priority basis and the drop ratio of packets decreased, then
throughput increases by receiving more packets at destination and delivery ratio also increased through
these QOS improved.
Abstract— Cloud storage is usually distributed infrastructure, where data is not stored in a single device but is spread to several storage nodes which are located in different areas. To ensure data availability some amount of redundancy has to be maintained. But introduction of data redundancy leads to additional costs such as extra storage space and communication bandwidth which required for restoring data blocks. In the existing system, the storage infrastructure is considered as homogeneous where all nodes in the system have same online availability which leads to efficiency losses. The proposed system considers that distributed storage system is heterogeneous where each node exhibit different online availability. Monte Carlo Sampling is used to measure the online availability of storage nodes. The parallel version of Particle Swarm Optimization is used to assign redundant data blocks according to their online availability. The optimal data assignment policy reduces the redundancy and their associated cost.
In this paper, we have proposed a hybrid push-pull protocol for peer-to-peer live video streaming. The
main goal of this research is to minimize the network end-to-end delay in comparison to pure mesh
networks. Hybrid protocols, in most cases, suffer from complex construction and maintenance. Therefore,
our proposed protocol uses a pure mesh topology and a single layer video coding. In summary, our pushpull
protocol has two parts. The pull-based part which is done on the mesh network, and the push-based
part which consists of two phases: parent selection and tree construction. When a push procedure appears,
it is very important to prevent data redundancy. To satisfy this condition, we have introduced a parent
selection method. In this method, by parent selection based on the minimum arrival time, the most stable
node will be selected. This node has the advantage of maximizing the expected service time of the tree.
Using this method, there is no need for maintaining any extra information and topology control data.
Finally, we do performance evaluation using OMNeT++ simulator. The simulation results show that the
proposed architecture has better performance in start-up delay, end-to-end delay, and distortion than pure
mesh-based network.
A HYBRID PUSH-PULL OVERLAY NETWORK FOR PEER-TO-PEER VIDEO STREAMINGijp2p
In this paper, we have proposed a hybrid push-pull protocol for peer-to-peer live video streaming. The
main goal of this research is to minimize the network end-to-end delay in comparison to pure mesh
networks. Hybrid protocols, in most cases, suffer from complex construction and maintenance. Therefore,
our proposed protocol uses a pure mesh topology and a single layer video coding. In summary, our pushpull protocol has two parts. The pull-based part which is done on the mesh network, and the push-based
part which consists of two phases: parent selection and tree construction. When a push procedure appears,
it is very important to prevent data redundancy. To satisfy this condition, we have introduced a parent
selection method. In this method, by parent selection based on the minimum arrival time, the most stable
node will be selected. This node has the advantage of maximizing the expected service time of the tree.
Using this method, there is no need for maintaining any extra information and topology control data.
Finally, we do performance evaluation using OMNeT++ simulator. The simulation results show that the
proposed architecture has better performance in start-up delay, end-to-end delay, and distortion than pure
mesh-based network.
A HYBRID PUSH-PULL OVERLAY NETWORK FOR PEER-TO-PEER VIDEO STREAMINGijp2p
In this paper, we have proposed a hybrid push-pull protocol for peer-to-peer live video streaming. The
main goal of this research is to minimize the network end-to-end delay in comparison to pure mesh
networks. Hybrid protocols, in most cases, suffer from complex construction and maintenance. Therefore,
our proposed protocol uses a pure mesh topology and a single layer video coding. In summary, our pushpull protocol has two parts. The pull-based part which is done on the mesh network, and the push-based
part which consists of two phases: parent selection and tree construction. When a push procedure appears,
it is very important to prevent data redundancy. To satisfy this condition, we have introduced a parent
selection method. In this method, by parent selection based on the minimum arrival time, the most stable
node will be selected. This node has the advantage of maximizing the expected service time of the tree.
Using this method, there is no need for maintaining any extra information and topology control data.
Finally, we do performance evaluation using OMNeT++ simulator. The simulation results show that the
proposed architecture has better performance in start-up delay, end-to-end delay, and distortion than pure
mesh-based network.
Designing a Fault-Tolerant Channel Extension Network for Internal Recoveryicu812
Originally published in the July 2006 issue of Technical Support magazine, this article by Mike Smith provides both an overview and best practices to be considered when designing a data replication network to support mainframe and data center recoverability.
QoS Framework for a Multi-stack based Heterogeneous Wireless Sensor Network IJECEIAES
Wireless sensor nodes consist of a collection of sensor nodes with constrained resources in terms of processing power and battery energy. Wireless sensors networks are used increasingly in many industrial and consumer applications. Sensors detect events and send via multi hop routing to the sink node for processing the event. The routing path is established through proactive or reactive routing protocols. To improve the performance of the Wireless Sensor Networks, multi stack architecture is addressed. But the multi stack architecture has many problems with respect to life time, routing loop and QOS. In this work we propose a solution to address all these three problems of life time, routing loop and QOS in case of multi stack architecture.
Survey on caching and replication algorithm for content distribution in peer ...ijcseit
In this paper, we focuses on caching and replication algorithm for content distribution in peer to peer
networks. Caching and replication is a key strategy for improve the reliability, availability, and
performance in peer to peer networks. This paper gives a brief introduction to caching, replication and
various algorithms have been discussed and a detailed study has been performed. The comparison table
shows it clearly that an algorithm satisfies the caching and replication requirement.
International Journal of Computer Science, Engineering and Information Techno...ijcseit
In this paper, we focuses on caching and replication algorithm for content distribution in peer to peer
networks. Caching and replication is a key strategy for improve the reliability, availability, and
performance in peer to peer networks. This paper gives a brief introduction to caching, replication and
various algorithms have been discussed and a detailed study has been performed. The comparison table
shows it clearly that an algorithm satisfies the caching and replication requirement.
An Efficient Resource Utilization Scheme for Video Transmission over Wireless...ijsrd.com
In this paper we propose an energy efficient video transmission strategy for wireless sensor networks, which combines wavelet-based image decomposition and cooperative communication. The proposed scheme uses the selective decode and forward (SDF) cooperation, so that a relay node collaborates with the source by forwarding only a lower-resolution version of the original video, obtained via discrete wavelet transform (DWT). We show that the proposed SDF-DWT strategy is more energy efficient than non-cooperative single-hop and multi-hop, also outperforming the regular SDF scheme. In addition, we show that our method can achieve the energy efficiency of incremental DF (IDF), without the need of a feedback channel.
Peer-to-Peer streaming technology has become one of the major Internet applications as it offers the opportunity of broadcasting high quality video content to a large number of peers with low costs. It is widely accepted that with the efficient utilization of peers and server's upload capacities, peers can enjoy watching a high bit rate video with minimal end-to-end delay. In this paper, we present a practical scheduling algorithm that works in the challenging condition where no spare capacity is available, i.e., it maximally utilizes the resources and broadcasts the maximum streaming rate. Each peer contacts with only a small number of neighbours in the overlay network and autonomously subscribes to sub-streams according to a budget-model in such a way that the number of peers forwarding exactly one sub-stream will be maximized. The hop-count delay is also taken into account to construct a short depth trees. Finally, we show through simulation that peers dynamically converge to an efficient overlay structure with a short hop-count delay. Moreover, the proposed scheme gives nice features in the homogeneous case and overcomes SplitStream in all simulated scenarios.
QOS - LIQUIDSTREAM: SCALABLE MONITORING AND BANDWIDTH CONTROL IN PEER TO PEER...ijp2p
The vast majority of research in P2P live streaming systems focuses on system architectures that offer to
participating peers: high upload bandwidth utilization, low delays during the video stream diffusion,
robustness and stability under dynamic network conditions and peers behavior. On the other hand in order
to guarantee the complete and on time video distribution to every participating peer, the average upload
bandwidth of the participating peers should be always greater than the playback rate of the video stream.
Most of the approaches do not take into consideration this requirement. Thus, in this paper we propose a
very scalable monitoring mechanism of the total upload bandwidth of the participating peers, which is
dynamic, accurate and with low overhead. Moreover, by exploiting this monitoring mechanism we present
and evaluate an algorithm that allows the accurate and on time estimation of the minimal required
additional bandwidth that an external set of resources (e.g. auxiliary peers) have to contribute. In this way
we guarantee the uninterrupted the stream delivery and provide high Quality of Service (QoS) in live
streaming.
QOS - LIQUIDSTREAM: SCALABLE MONITORING AND BANDWIDTH CONTROL IN PEER TO PEER...ijp2p
The vast majority of research in P2P live streaming systems focuses on system architectures that offer to
participating peers: high upload bandwidth utilization, low delays during the video stream diffusion,
robustness and stability under dynamic network conditions and peers behavior. On the other hand in order
to guarantee the complete and on time video distribution to every participating peer, the average upload
bandwidth of the participating peers should be always greater than the playback rate of the video stream.
Most of the approaches do not take into consideration this requirement. Thus, in this paper we propose a
very scalable monitoring mechanism of the total upload bandwidth of the participating peers, which is
dynamic, accurate and with low overhead. Moreover, by exploiting this monitoring mechanism we present
and evaluate an algorithm that allows the accurate and on time estimation of the minimal required
additional bandwidth that an external set of resources (e.g. auxiliary peers) have to contribute. In this way
we guarantee the uninterrupted the stream delivery and provide high Quality of Service (QoS) in live
streaming.
CONTENT BASED VIDEO CATEGORIZATION USING RELATIONAL CLUSTERING WITH LOCAL SCA...ijcsit
This paper introduces a novel approach for efficient video categorization. It relies on two main
components. The first one is a new relational clustering technique that identifies video key frames by
learning cluster dependent Gaussian kernels. The proposed algorithm, called clustering and Local Scale
Learning algorithm (LSL) learns the underlying cluster dependent dissimilarity measure while finding
compact clusters in the given dataset. The learned measure is a Gaussian dissimilarity function defined
with respect to each cluster. We minimize one objective function to optimize the optimal partition and the
cluster dependent parameter. This optimization is done iteratively by dynamically updating the partition
and the local measure. The kernel learning task exploits the unlabeled data and reciprocally, the
categorization task takes advantages of the local learned kernel. The second component of the proposed
video categorization system consists in discovering the video categories in an unsupervised manner using
the proposed LSL. We illustrate the clustering performance of LSL on synthetic 2D datasets and on high
dimensional real data. Also, we assess the proposed video categorization system using a real video
collection and LSL algorithm.
LIVE media streaming applications have become more and more popular. IP multicast is the most efficient mechanism but Due to the practical issues of routers, IP multicast has not been widely deployed in the wide-area network infrastructure. The application-level solution build a peer-to-peer (P2P) overlay network out of unicast tunnels across cooperative participating users. P2P media streaming has become a promising approach to broadcast non interactive live media from one source to a large number of receivers. Design of a live P2P streaming system faces many challenges. Therefore, no single application-level multicast stream can meet the requirements of everyone. The proposed architecture aims to provide higher streaming quality and to provide robustness. In the Proposed System the Parallel efforts have been exerted in the media streaming field and networking field to avoid the problem of distributing LIVE video. The tree-based approaches are vulnerable for dynamic group variation but the gossip based mesh-like topology for overlay network systems allow peers to form multiple neighbors, so multilayered video contents are distributed among mesh-like network. Due to this multisource transmission scheme, packets can be exchanged among clients efficiently. In Proposed, The system can achieve improved performance on video delivery quality, bandwidth utilization, and service reliability when using the peer-assisted multipath transmission.
Vehicle Ad Hoc Networks (VANETs) have become a viable technology to improve traffic flow and safety on the roads. Due to its effectiveness and scalability, the Wingsuit Search-based Optimised Link State Routing Protocol (WS-OLSR) is frequently used for data distribution in VANETs. However, the selection of MultiPoint Relays (MPRs) plays a pivotal role in WS-OLSR's performance. This paper presents an improved MPR selection algorithm tailored to WS-OLSR, designed to enhance the overall routing efficiency and reduce overhead. The analysis found that the current OLSR protocol has problems such as redundancy of HELLO and TC message packets or failure to update routing information in time, so a WS-OLSR routing protocol based on improved-MPR selection algorithm was proposed. Firstly, factors such as node mobility and link changes are comprehensively considered to reflect network topology changes, and the broadcast cycle of node HELLO messages is controlled through topology changes. Secondly, a new MPR selection algorithm is proposed, considering link stability issues and nodes. Finally, evaluate its effectiveness in terms of packet delivery ratio, end-to-end delay, and control message overhead. Simulation results demonstrate the superior performance of our improved MR selection algorithm when compared to traditional approaches.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
May_2024 Top 10 Read Articles in Computer Networks & Communications.pdfIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
April 2024 - Top 10 Read Articles in Computer Networks & CommunicationsIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF Based Intrusion Detection System for Big Data IOT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF based Intrusion Detection System for Big Data IoT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
** Connect, Collaborate, And Innovate: IJCNC - Where Networking Futures Take ...IJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
Mesh pull backup parent pools for video-on-demand multicast trees
1. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.2, March 2014
DOI : 10.5121/ijcnc.2014.6203 27
MESH-PULL BACKUP PARENT POOLS
FOR VIDEO-ON-DEMAND MULTICAST TREES
Müge Sayıt1
and E. Turhan Tunalı2
1
International Computer Institute, Ege University, Izmir, Turkey
2
Department of Computer Engineering, Izmir University of Economics, Izmir, Turkey
ABSTRACT
Resilient multicast is a challenging issue for overlay trees particularly because of high churn. In this work,
we propose a mechanism that allows scalable video multicast. While the regular operation involves tree-
push of the video, any node that looses its parent on the tree solicits video from a predetermined backup set
of nodes in a mesh-pull fashion. The main idea is to allocate less bandwidth for backup to improve
bandwidth utilization while maintaining the best possible video quality. The choice of essential design
parameters are studied together with seamlessness of the streaming under variety of fault scenarios.
Simulation results indicate the optimality of the proposed approach as far as resiliency, bandwidth
utilization, delay and video quality are concerned.
KEYWORDS
multicast trees, resiliency technique, mesh-pull backup, scalable codec
1. INTRODUCTION
In peer to peer (P2P) communications, it is well known that tree-push type of approaches provide
smaller overhead in utilization of network resources when there is no failure, but fail to provide
resilience unless a considerable bandwidth is reserved idle for back-up [1]. Mesh-pull type of
approaches [2], [3], [4], [5], [6], [7], [8], [9] introduced efficient solutions for resilience while
introducing overhead network traffic due to excessive control messaging and/or redundant data
packets. Since churn is high, node failure rate is considerably high in peer to peer networks.
Hence tree based approach needs to consider this fact.
To provide a solution to the problem, backup parent concept was proposed together with degree
constrained optimal tree [10], [11]. In case of parent failure, a tree node connects to a pre-
determined backup parent that has adequate idle bandwidth. By this way, the tree is repaired and
multicast can resume. Nomination of backup parent in advance prevents waste of time for backup
search. This is classified as a “proactive strategy” in the literature [10], [11]. The problem with
this approach is that the nodes should reserve idle bandwidth that can stream video with a
predetermined rate. This, in turn, reduces bandwidth utilization. In order to increase bandwidth
utilization, backup slots are reserved in accordance with video layers where scalable video is
streamed in [12].
On the other hand, although mesh based systems are resilient to peer churn but they suffer
playback lag among peers. The nodes having large playback lag with other nodes in the system
may not use their upload bandwidth [13] and this reduces bandwidth utilization of the system.
2. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.2, March 2014
28
In this paper, we propose a new hybrid strategy in which regular streaming involves multicast
through the nodes of a pre-constructed tree whereas streaming from backup involves a mesh-pull
type of mechanism that does not require reservation of hefty idle bandwidth for each connection.
Best effort is spent to provide high quality video when failure occurs.
The contributions of our work are as follows: First, we present a novel backup strategy that
involves a hybrid mechanism suitable for scalable video. Second, we propose a new adaptive
hybrid push-pull P2P video-on-demand streaming system. After multicast tree is constructed, this
system having the tree push based structure is converted into the mesh based structure if node
failure rate increases. By this adaptive approach, we may keep advantages of both tree push and
mesh pull systems. Our proposed system is resilient to peer churn while the playback lag between
peers is small. We present a simulation-based comparative evaluation against tree-push only
strategy in which full bandwidth channel reservation is made for possible disconnected nodes.
The rest of the paper is organized as follows. In section two, related work on multicast trees
together with error resilience problem is addressed. In section three, the proposed hybrid method
for resilience together with its algorithms is given. In section four, simulation results that compare
the proposed method with non-hybrid case are given. Finally, in section five, concluding remarks
are made.
2. RELATED WORK
The error resilience problem in multicast trees has been addressed in many of the studies
including [5], [12], [14], [15], [16]. [12] addresses the real-time issues in resilience, [14] and [15]
discuss the optimal tree formation problem, [5], [16] discuss scalability and bandwidth utilization
issues associated to resilience. [17] addresses recovery time and associated buffer requirement
problem.
Resilience technique on multicast tree concentrates on repairing the tree in case failure happens.
In [5] and [18], nodes are clustered according to the delay values between the nodes and cluster
leaders selected from each cluster are responsible to convey video data to their clusters. If these
relay nodes leave the system, a new cluster leader is selected and hence tree is repaired. Since
selecting a new cluster leader after the failure of the cluster leader may cause interrupt of display,
selecting backup nodes before failure is proposed in the literature. For this purpose, some
backup mechanism is utilized by considering the capacity of each node. In [10], [19] and [20],
each node reserves a number of backup slots, each slot being able to stream baseline video and
nodes in the tree select their backup parents according to available backup capacity and RTT
value between candidate backup parent and themselves. Unfortunately, a portion of the backup
capacity reserved stays idle and bandwidth utilization reduces in the overall scheme. In simulation
studies, it has been observed that half of the available bandwidth should be reserved for backup to
provide acceptable resilience [21].
In order to make use of advantages of both tree based and mesh based systems, many hybrid
based systems are proposed in the literature [22], [23], [24]. Most hybrid systems construct more
than one multicast tree [22] and send different parts of the video data over those trees [25]. In
figure 1, an example overlay architecture used in such systems is illustrated. In the figure, source
node splits the video up to two streams called stream 1 and stream 2. The packets belonging to
different streams follow different paths on the tree. A node can be an interior node in one tree and
can be a leaf node in another tree as it can be seen from the figure. This structure provides
robustness since the nodes still receive the video packets from another tree after experiencing
parent failure in one tree.
3. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.2, March 2014
29
Figure 1. An example of a multitree based hybrid overlay network.
These video partitions can be obtained by using Multiple Description Codec (MDC) [26] and
each received description increases the received video quality [27], [28], [29], [30]. However
such systems have longer playback delay when compared to tree based systems. In [23], stable
nodes construct a tree backbone and unstable nodes connect to the system in a mesh structure.
Some hybrid systems utilize cloud or Content Distribution Network (CDN) servers [31], [32],
[33], [34]. The main purpose of implementing a cloud based or CDN based service is to recover
lost packets by retransmission so that higher QoE is obtained. In this work, we propose a hybrid
system that drastically differs from the existing work. The novelty of our system is in its adaptive
communication model implemented. Under normal operation, the system operates under tree-
push model. As the node failure rate goes up, the tree structure adapts into a mesh based system.
The proposed model utilizes the advantages of both tree based and mesh based systems thereby
providing low playback delay and robustness.
Our work here targets a new strategy in which less bandwidth is kept idle while maintaining the
same resilience level. We introduce new heuristics to modify backup parent pool approach
introduced in [12] to maximize resilience of the method of [21]. While [12] repairs the tree with
full capacity channel, the proposed approach of this work constructs a mesh of nodes that is
formed from members of designated backup parent pool of a particular layer of the tree plus the
disconnected node. Therefore, for those sub-trees in which churn has not occurred, the overlay
preserves its tree structure with root being the original source whereas roots of disconnected sub-
trees pull video from respective mesh and those sub-trees are effectively disconnected from the
root. This strategy allows reservation of smaller ratio of bandwidth as backup yet providing
higher resilience.
3. TREE-PUSH BROADCAST WITH MESH-PULL BACKUP
A variation of algorithm of [12] is used to construct the multicast tree. The algorithm considers
variety of factors in attempting to optimize performance. We briefly summarize properties of the
algorithm details of which are beyond the scope of this work. The heuristics of the algorithm of
[12] spend best effort to
i. Maximize average bandwidth from root to individual nodes
ii. Minimize average delay from root to individual nodes
iii. Maximize bandwidth utilization
iv. Maximize resilience
v. Minimize average node depth
The algorithm of [12] constructs backup pools at each layer of the tree in which one or more
nodes are expected reserve some pre-determined portion of its total upload bandwidth for backup.
The packet of stream 1
Dissemination direction of
stream 1 packets
The packet of stream 2
Dissemination direction of
stream 2 packets
4. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.2, March 2014
30
It has been discussed that the higher (lower) the portion of the bandwidth reserved for backup, the
higher the resilience (the higher the bandwidth utilization).
In this work, we aimed at reducing overhead of this reserving backup approach while maintaining
a comparable resilience. For this purpose, rather than allocating a complete video bandwidth to a
disconnected node, we propose to construct a mesh-pull that is formed from the disconnected
node and the backup set of a particular tree layer. By this way, for a particular node, we avoid
allocating an integral amount of video bandwidth for backup. As a tradeoff the streaming quality
to the disconnected sub-tree may decrease due to delays caused by the mesh-pull.
We will assume that we stream scalable video that consists of a base and an enhancement layer
that are going to be indicated by b and e respectively. Each tree layer will be indicated by l with
l=0 being the layer of the root. All nodes of each tree layer l will reserve some portion of their
total upload bandwidth less than b for backup and they all will take part in backup mesh of tree
layer l. When a node is disconnected from its parent, the algorithm of figure 2 is run in all nodes
to request backup from respective tree layers.
given l, the layer of the node on the broadcast tree
if (reply for request backup from layer l-1)
then join the designated backup mesh;
else if (reply for request backup from layer l-2)
then join the designated backup mesh;
else if (reply for request backup from layer l)
then join the designated backup mesh;
else abort streaming application;
Figure 2. Backup request heuristics
We note that the backup request heuristics solicits backup from backup meshes of three layers in
the vicinity of the disconnected node. The following algorithm runs in backup mesh leaders of all
of the tree layers when a backup request message is received.
if (current backup capacity > b + e )
then grant b+e to the requesting node;
else if (current backup capacity > b )
then grant b to the requesting node;
else if (e being served to any node)
then run “victim selection for e” and grant b
to requesting node;
else run “victim selection for b”
if victim selected
then grant b to requesting node;
else reject request;
Figure 3. Backup allocation heuristics
5. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.2, March 2014
31
We observe that when there is sufficient bandwidth, the backup allocation algorithm of a
particular tree layer attempts to allocate best video quality. As bandwidth shrinks, the allocation
algorithm attempts to allocate a base video quality with best effort. The following two algorithms
called “victim selection for e” and “victim selection for b” are given in figure 4 and figure 5
respectively. The algorithms determine the criteria on dropping sending enhancement and base
quality videos respectively.
given l, the layer of mesh on the broadcast tree
if (e being served to any orphan at l-2)
then choose an orphan as victim from layer l-2;
else if (e being served to any orphan at l-1)
then choose an orphan as victim from layer l-1;
else if (e being served to any orphan at l)
then choose an orphan as victim from layer l;
else choose the lowest bandwidth-highest delay child as
a victim from layer l-1;
Figure 4. Enhancement victim selection (victim selection for e) algorithm
We note that enhancement victim selection algorithm attempts to drop enhancement from the
lowest layer first. The layers are then scanned to find an enhancement being served. Since the
algorithm is called when e is being served to some node, there will always be a victim selected.
Victim selection for b algorithm also scans the layers starting from the lowest layer served. If the
request node is in a higher layer of tree as compared to a node being served, then request node is
given higher priority. Ultimately, the request node will always find a backup from its own layer
due to its priority.
given l=the layer of mesh on the broadcast tree,
rl=layer of the requesting node
if (rl=l+2)
then reject request;
else if (rl = l+1)
then
if (there exists an orphan in l+2 with b served)
then select orphan as victim;
else reject request;
else if (there exists an orphan in l+2 with b served)
then select orphan as victim;
else if (there exists an orphan in l+1 with b served)
then select orphan as victim;
else if (there exists a child in l+1 with b served)
then choose the lowest bandwidth-highest delay child as
a victim;
else reject request;
Figure 5. Base victim selection (victim selection for b) algorithm
6. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.2, March 2014
32
(a) Original multicast tree
(b) One of the tree layer 2 nodes fail and its children join the upper layer backup mesh
Figure 6. Outlook of overlay topology
When capacity is allocated in order to supply backup to the requesting node, the node sends the
buffer maps to the set of selected backup parents. Since selected backup parents are always at the
same tree layer according to given heuristics, the playback lag between them is expected to be
small. Thus, for backup requesting node, it is not difficult to schedule chunk requests. Figure 6
demonstrates the outlook of the overlay topology. In figure 6.a, original multicast tree is given
when no failure has occurred yet. We note that every non-leaf node in a particular tree layer acts
as the root of a subtree in regular broadcast operation and acts as a member of the respective
backup mesh simultaneously. Figure 6.b demonstrates the situation when a layer 2 node fails and
two of its children take part in the upper layer mesh and receive packets in a mesh-pull fashion.
4. SIMULATION RESULTS
4.1. Simulation Testbed
In order to measure performance of the proposed algorithm, a network of 500 nodes is
constructed by using GT-ITM module [35]. After creating the network topology, distances, i.e.
round trip time values between nodes are calculated in NS2 environment [36] by using the
shortest physical path between nodes. The tree construction algorithm is then implemented by
considering two different strategies: In the first strategy, tree-push mechanism that involves
repairing tree by re-allocating a full bandwidth channel to each disconnected node is utilized. In
the second strategy, the hybrid backup policy of the proposed method is considered. Both of the
strategies are tested in local simulator which enables running simulations with large amount of
nodes. Comparisons are carried out by examining received bit-rate, network utilization and total
delay from source to destination.
Layer 4
Layer 3
Layer 2
Layer 1
Layer 0
Layer 4
Layer 3
Layer 2
Layer 1
Layer 0
7. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.2, March 2014
33
0.00
0.20
0.40
0.60
0.80
1.00
1.20
CDF(x<X)
x: Time (in sec)
CDF Graph of Total Delay
Tree with Backup Reservation Hybrid Mesh Tree
Video file used in the experiments are encoded using layered codec and has base layer with 500
Kbps and base plus enhancement layer with 1000 Kbps. The range of the upload bandwidth of the
nodes is between 0 and 2200 Kbps with average being 1200 kbps. The single source node that is
in the root of the tree is assumed to be in the system throughout the streaming period. In tree-push
strategy, each node having surplus upload bandwidth reserves backup capacity that is adequate
for at least on child.
4.2. Comparisons
Figure 7 examines the distribution of total delay from the source to individual nodes. We observe
that delay has considerably reduced in the proposed method due to fact that tree-push reserves a
hefty backup capacity that reduces the number of children connected to a high upload bandwidth
node thereby increasing the average depth of the nodes. The delay from source to destination in
the hybrid system is limited to 3 seconds while this value reaches up to 30 seconds in the tree-
push system.
Figure 7. CDF Graph of Total Delay: From Source to Destination
Table 1. Comparative hop count values.
In Table 1, average and maximum hop count values measured in both systems are given. Hop
count of a node equals to number of nodes on the path between the source and that node. For the
same number of nodes and same distribution of upload capacities of the nodes, tree based system
suffers from the reservation slots and maximum hop count value reaches to 249 while that value
equals to 8 for hybrid mesh tree based system. Hop count values directly affect the delay values
from source to destination. These values clarify the reason of obtained delay values given in
figure 7.
Tree with Backup
Reservation Hybrid Mesh Tree
Average number of
hop counts
124.75 6.99
Maximum hop count 249 8
8. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.2, March 2014
34
0
0.1
0.2
0.3
0.4
0.5
0.6
0 1 2
Ratioofnodes
The number of children
Tree with Backup
Reservation
Hybrid Mesh Tree
Figure 8. Classification of the nodes according to the number of children.
We also classify the nodes in the system according to their number of children. The ratio of the
number of nodes having no child, one child and two children to the total number of nodes in the
system is given in figure 8. Nearly half of the nodes have one child in tree based system while
less than 5% of the nodes have one child in hybrid mesh tree based system. The main reason is
that the nodes reserve only small part of their upload capacity in hybrid tree based system; hence
most of the nodes have two children if upload capacity is enough to send video at the highest
bitrate. The graph also shows that ratio of the nodes having no child is 30 % in tree based and 50
% in hybrid mesh based systems. Note that considerable number of nodes having no child is free-
riders, i.e. having zero upload capacity for both systems.
To evaluate the performance of the system under different node failure (churn) scenarios, the
nodes are forced to fail with a probability, f, that ranges between 0.1 and 0.6. The failure rates are
classified as low, medium and high according to respective slots of failure probabilities. Figure 9
examines bandwidth utilization at low failure rate. We observe that the proposed method yields
utilization above 70% while tree-push utilization is below 50%.
0
0,1
0,2
0,3
0,4
0,5
0,6
0,7
0,8
1 6 11 16 21 26 31 36 41 46 51 56
Utilization
Time (in minute)
UtilizationatLow FailureRate
Tree with Backup Reservation, f=0.1 HybridMesh Tree, f=0.1
Tree with Backup Reservation, f=0.2 HybridMesh Tree, f=0.2
Figure 9. CDF Graph of bandwidth utilization for low failure
Utilization at medium and high failure rates are given in figure 10 and figure 11, respectively. We
observe that the proposed method is still superior to tree-push strategy. Utilization decreases
while failure rate increases since the number of nodes having no child also increases. In Table 2,
the received bit-rate for nodes in the proposed system is given according to node failure rate.
9. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.2, March 2014
35
There is no disconnected node even if the node failure rate is high. The received bit-rate for tree-
push system is 1000 Kbps for almost all nodes since nodes experiencing parent failure can receive
video at the highest bit-rate when it is connected to a backup parent.
0
0,1
0,2
0,3
0,4
0,5
0,6
1 6 11 16 21 26 31 36 41 46 51 56
Utilization
Time (in minute)
UtilizationatMediumFailure Rate
Tree with Backup Reservation, f=0.3 Hybrid Mesh Tree, f=0.3
Tree with Backup Reservation, f=0.4 Hybrid Mesh Tree, f=0.4
Figure 10. CDF Graph of bandwidth utilization for medium failure
0
0,1
0,2
0,3
0,4
0,5
0,6
1 6 11 16 21 26 31 36 41 46 51 56
Utilization
Time (in minute)
UtilizationatHighFailure Rate
Tree with Backup Reservation, f=0.5 Hybrid Mesh Tree, f=0.5
Tree with Backup Reservation, f=0.6 Hybrid Mesh Tree, f=0.6
Figure 11. CDF Graph of bandwidth utilization for high failure
Table 2. Percentage of nodes according to the received bitrate.
Failure
Probability
Received Bitrate
<500 Kbps 500 Kbps 1000 Kbps
f=0.1 - 28% 72%
f=0.2 - 30% 70%
f=0.3 - 68% 32%
f=0.4 - 57% 43%
f=0.5 - 39% 61%
f=0.6 - 25% 75%
10. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.2, March 2014
36
4. CONCLUSIONS
In this work, we proposed a hybrid mechanism to exploit the efficiency of both tree-push and
mesh-pull methods. If churn is low, then tree-push dominates the multicast and obtains high
utilization of bandwidth due to a fraction of a channel bandwidth allocated for backup. If churn is
high, then mesh-pull dominates the overall mechanism. Simulations are carried out to compare
bandwidth utilization in tree-push only and proposed hybrid method and it has been observed that
the proposed method yields much better utilization of bandwidth.
This system can be improved and re-designed in order to stream MDC or Multiview coded video.
In the future, we plan to stream Multiview coded video over our hybrid network. Multiview
coded video may also have scalable layers; hence by implementing similar backup pool strategy,
this system can be used to stream 3D data.
REFERENCES
[1] Birrer, S. & Bustamante, F.E., (2007) “A Comparison of Resilient Overlay Multicast
Approaches”, IEEE J. on Sel. Areas in Communications, Vol. 25, pp1695-1705.
[2] Zhang, X., Liu, J., Li, B. and Yum, Y., (2005) “CoolStreaming/DONet: A Data-driven Overlay
Network for Peer-to-peer Live Media Streaming, IEEE INFOCOM.
[3] PPLive. http://www.pplive.com
[4] PPstream http://www.pps.tv/en/
[5] Banerjee, S., Bhattacharjee B. and Kommareddy, C., (2002) “Scalable Application Layer
Multicast”, ACM SIGCOMM, USA.[6] Liao, X., Jin, H., Liu, Y., Ni, L.M. and Deng, D.,
(2006) “AnySee: Peer-to- Peer Live Streaming”, IEEE INFOCOM.
[7] Magharei N. & Rejaie, R. (2007) “PRIME: Peer-to-Peer Receiver-Driven Mesh-Based
Streaming,” IEEE INFOCOM.
[8] Kumar, R., Liu, Y. and Ross, K., (2007) “Stochastic Fluid Theory for P2P Streaming Systems,”
IEEE INFOCOM.
[9] Sianati, A., Abbaspour, M. and Norouzi, M. (2011) “Head-tail Video Streaming Over Peer to Peer
Systems”, International Journal of Computer Networks & Communications (IJCNC), Vol. 3, No.
2, pp.68-81.
[10] Jeon, H., Son, S.C. and Nam, J.S., (2008) “Overlay Multicast Tree Recovery Scheme Using a
Proactive Approach”, Elsevier Computer Commun., Vol. 31, pp3163-3168.
[11] Fei, Z. & Yang, M., (2007) “A Proactive Tree Recovery Mechanism for Resilient Overlay
Multicast”, IEEE/ACM Trans Networking, Vol. 15, 2007.
[12] Sayıt, M.F., Tunalı, E.T. and Tekalp, A.M., (2012) “Resilient Peer-to-peer Streaming of Scalable
Video Over Hierarchical Multicast Trees with Backup Parent Pools”, Elsevier Signal Processing:
Image Communication, Vol. 27, pp113-125.
[13] Hei, X. Liang, J. Liang, J. Liu, Y., Ross, K.W. (2007) “A Measurement Study of a Large-Scale
P2P IPTV System”, IEEE Trans. On Multimedia, Vol. 9, No. 8, pp1672-1687.
[14] Jin, X., Yiu, W.P.K., Chan, S.H.G. and Wang, Y., (2007) “On Maximizing Tree Bandwidth For
Topology-Aware Peer-To-Peer Streaming”, IEEE Trans. on Multimedia, Vol. 9, pp1580-1592.
[15] Kim, E., Jang, J., Park, S., Sussman, A. and Yoo, J.S., (2006) “Improving Resiliency Using
Capacity-Aware Multicast Tree In P2P Streaming Environments”, High Perf. Computing and
Communications, pp. 925-934.
11. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.2, March 2014
37
[16] Birrer S. & Bustamante, F.E., (2005) “Resilient Peer-To-Peer Multicast Without The Cost”,
Multimeda Computing and Netw. Conference.
[17] Kusumoto, T., Kunichika, Y., Katto, J. and Okubo, S., (2005) “Tree-based Application Layer
Multicast Using Proactive Route Maintenance And Its Implementation”, ACM workshop on Adv
in Peer-To-Peer Multimed Str., pp49-58.
[18] Tran, D.A., Hua, K.A., and Do, T.T., (2004) “A Peer-to-Peer Architecture for Media Streaming”,
IEEE Journal on Selected Areas in Communications, Vol. 22, No. 1, pp121-133.
[19] Banerjee, S., Lee, S., Bhattacharjee, B. and Srinivasan, A., (2006) “Resilient Multicast Using
Overlay”, IEEE/ACM Trans. Networking, Vol. 14, pp237-248.
[20] Okada, Y., Oguro, M., Katto, J. and Okubo, S., (2005) “A New Approach For The Construction
Of ALM Trees Using Layered Video Coding”, ACM workshop on Adv. in Peer-To-Peer
Multimed Str., pp59 - 68.
[21] Sayit, M. F.. Tunali, E. T and Tekalp, A. M. (2009) “Bandwidth-aware Multiple Multicast Tree
Formation for P2P Scalable Video Streaming Using Hierarchical Clusters”, Proc. of IEEE ICIP,
Egypt, pp945-948
[22] Li, B., Xie, S., Qu, Y., Keung, G.Y., Lin, C., Liu, J., Zhang, X., (2008) “Inside the New
Coolstreaming: principles, measurements and performance ımplications”, Proceedings of 27th
IEEE Conference on Computer Communications, pp1031 - 1039.
[23] Wang, F., Xiong, Y. and Liu, J., (2010) “mTreebone: A Collaborative Tree-Mesh Overlay
Network for Multicast Video Streaming,” IEEE Trans. Parallel and Distributed Systems, Vol. 21,
No. 3, pp379-392.
[24] Castro, M., Druschel, P., Kermarrec, A., Nandi, A., Rowstron, A. and Singh, A., (2003)
“SplitStream: High-Bandwidth Multicast in Cooperative Environments,” Proc. 19th ACM Symp.
Operating Systems Principles (SOSP), pp298-313.
[25] Noh J. & Girod, B., (2012) “Time-Shifted Streaming in a Tree-Based Peer-to-Peer System,”
Journal of Communications, Vol. 7, No. 3, pp202-212.
[26] Goyal, V.K., (2001) “Multiple Description Coding: Compression Meets the Network”, IEEE
Signal Processing Magazine, Vol. 18, No. 5, pp74-94.
[27] Liu, Z. Shen, Y. Ross, K., Panwar, S., Wang, Y., (2007) “P2P Video Live Streaming with MDC:
Providing Incentives for Redistribution”, IEEE ICME.
[28] Magharei, N. & Rejaie, R., (2006) “Understanding Mesh-Based Peer-to-Peer Streaming”,
International Workshop on Network and Operating System Support for Digital Audio and Video.
[29] Padmanabhan, V.N., Wang, H.J. and Chou, P.A., (2003) “Resilient Peer to Peer Streaming”, Proc.
IEEE International Conference on Network Protocols, pp16-27.
[30] Favalli, L., Folli, M., Lombardo, A., Reforgiato, D., Schembra, G., (2011) “A P2P Platform for
Real-Time Multicast Video Streaming Leveraging on Scalable Multiple Descriptions to Cope with
Bandwidth Fluctuations”, International Journal of Computer Networks & Communications
(IJCNC) Vol.3, No.6, pp71-94.
[31] Yin, H., Liu, X., Zhan, T., Sekar, V., Qiu, F., Lin, C., Zhang, H., Li, B., (2010) “LiveSky:
Enhancing CDN with P2P”, ACM Transactions on Multimedia Computing, Communications, and
Applications (TOMCCAP), Vol. 6, No. 3.
[32] Payberah, A. H., Kavalionak, H., Kumaresan, V., Montresor, A., Haridi, S., (2012) “CLive: cloud-
assisted P2P live streaming”, Proceedings of IEEE 12th International Conference Peer-to-Peer
Computing (P2P), pp79 – 90.
[33] Lu, Z., Wang, Y. and Yang, Y.R., (2012) “An Analysis and Comparison of CDN-P2P hybrid
Content Delivery System and Model, Journal Of Communications, Vol. 7, No. 3.
[34] Rocha, M.V.M. & Rodrigueson, C.K.S., (2013) “Client’s Interactive Behaviour to Design Peer
Selection Policies for Bittorrent-Like Protocols”, International Journal of Computer Networks &
Communications Vol.5, No.5, pp141-159.
12. International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.2, March 2014
38
[35] “GT-ITM”, http://www.cc.gatech.edu/projects/gtitm/
[36] “Network Simulator (NS2)”, http://www.isi.edu/nsnam/ns/
Authors
Muge Sayit
Muge Sayit is an Assistant Professor at International Computer Institute in Ege University
in Turkey. She received a Master of Science degree in 2005 and PhD degree in 2011 in
Information Technologies from the same institute and a degree in Mathematics from Ege
University in 1999. Her research interests include P2P networks, live streaming, video-
on-demand and distributed systems.
Turhan Tunalı
Turhan Tunalı earned a BSc degree in Electrical Engineering from Middle East Technical
University and MSc Degree in Applied Statistics from Ege University, both in Turkey. He
then earned a DSc Degree in Systems Science and Mathematics from Washington
University in St. Louis, USA in 1985. After his doctorate study, he joined Computer
Engineering Department of Ege University as an assistant professor where he became an
associate professor in 1988. During the period of 1992–1994, he worked in Department of
Computer Technology of Nanyang Technological University of Singapore as a Visiting Senior Fellow.
He then joined International Computer Institute of Ege University as a Professor where he was the
director. In the period of 2000–2001 he worked in Department of Computer Science of Loyola University
of Chicago as a Visiting Professor.He is currently working as a Professor at Department of Computer
Engineering of Izmir University of Economics. His current research interests include adaptive video
streaming and Internet performance measurements. Dr. Tunali is a member of the IEEE.