This document proposes an approach for modeling and composing web services using Labeled Generalized Stochastic Petri Nets (LGSPNs). LGSPNs are presented as an expressive way to formally model both the structure and behavior of individual web services. An algebra is then defined to compose existing web services modeled as LGSPNs in order to create new composite services. The composition operators allow incrementally building more complex services through the combination of basic services. The LGSPN modeling approach is argued to provide benefits for understanding, analyzing, and prototyping complex web service compositions.
Web Service QoS Prediction Based on Adaptive Dynamic Programming Using Fuzzy ...redpel dot com
The document proposes a novel approach for predicting quality of service (QoS) metrics for cloud services. The approach combines fuzzy neural networks and adaptive dynamic programming (ADP) for improved prediction accuracy. Specifically, it uses an adaptive-network-based fuzzy inference system (ANFIS) to extract fuzzy rules from QoS data and employ ADP for online parameter learning of the fuzzy rules. Experimental results on a large QoS dataset demonstrate the prediction accuracy of this approach. The approach also provides a convergence proof to guarantee stability of the neural network weights during training.
Validation of pervasive cloud task migration with colored petri netredpel dot com
The document describes a study that used Colored Petri Nets (CPN) to model and simulate task migration in pervasive cloud computing environments. The study made the following contributions:
1) It expanded the semantics of CPN to include context information, creating a new CPN model called CCPN.
2) Using CCPN, it constructed two task migration models - one that considered context and one that did not - to simulate task migration in a pervasive cloud based on the OSGi framework.
3) It simulated the two models in CPN Tools and evaluated them based on metrics like task migration accessibility, integrity of the migration process, and system reliability and stability after migration. It also
Enforcing end to-end proportional fairness with bounded buffer overflow proba...ijwmn
This document summarizes a research paper that proposes a distributed flow-based access scheme for slotted-time protocols in ad-hoc wireless networks. The scheme aims to provide proportional fairness between end-to-end flows while constraining buffer overflow probabilities at each node. It formulates the problem as a nonlinear program and presents a distributed dual approach with low computational overhead. Simulation results support that the proposed scheme converges to the unique global optimum and satisfies fairness and quality of service objectives.
An Alternative Genetic Algorithm to Optimize OSPF WeightsEM Legacy
This document presents a genetic algorithm approach to optimize OSPF routing weights. The algorithm aims to minimize maximum and average link utilization directly, unlike previous methods that minimized a convex cost function. It can find weights for both single and multiple shortest path routing. The genetic algorithm uses a chromosome encoding of link weights. It selects parents using rank selection and produces offspring using a reproduction strategy combining crossover and mutation. Additional mutation is applied to offspring not meeting certain conditions. The algorithm is tested on small networks and compared to MIP-based methods, showing results for larger networks with increasing traffic demands.
IMPACT OF PARTIAL DEMAND INCREASE ON THE PERFORMANCE OF IP NETWORKS AND RE-OP...EM Legacy
12th GI/ITG CONFERENCE ON MEASURING, MODELLING AND EVALUATION OF COMPUTER AND COMMUNICATION SYSTEMS 3rd POLISH-GERMAN TELETRAFFIC SYMPOSIUM
PGTS 2004
Eueung Mulyana, Ulrich Killat
Fuzzy Optimized Metric for Adaptive Network RoutingCSCJournals
Network routing algorithms used today calculate least cost (shortest) paths between nodes. The cost of a path is the sum of the cost of all links on that path. The use of a single metric for adaptive routing is insufficient to reflect the actual state of the link. In general, there is a limitation on the accuracy of the link state information obtained by the routing protocol. Hence it becomes useful if two or more metrics can be associated to produce a single metric that can describe the state of the link more accurately. In this paper, a fuzzy inference rule base is implemented to generate the fuzzy cost of each candidate path to be used in routing the incoming calls. This fuzzy cost is based on the crisp values of the different metrics; a fuzzy membership function is defined. The parameters of these membership functions reflect dynamically the requirement of the incoming traffic service as well as the current state of the links in the path. And this paper investigates how three metrics, the mean link bandwidth, queue utilization and the mean link delay, can be related using a simple fuzzy logic algorithm to produce a optimized cost of the link for a certain interval that is more „precise‟ than either of the single metric, to solve routing problem .
Traffic Features Extraction and Clustering Analysis for Abnormal Behavior Det...Areej Qasrawi
This document proposes methods for extracting traffic features and using DBSCAN clustering to detect abnormal network behaviors. It extracts four traffic features related to IP addresses, ports, packet types and sizes to capture characteristics. DBSCAN clustering is applied to the feature vectors, classifying traffic into core clusters and isolated points. The isolated points likely represent abnormal behaviors and are analyzed for detection. Experimental results on test network traffic demonstrate the methods can effectively identify abnormal clusters, like those generated by a DDoS attack. The performance is better than alternative K-means clustering which cannot distinguish abnormal behavior clusters as clearly.
An Offline Hybrid IGP/MPLS Traffic Engineering Approach under LSP ConstraintsEM Legacy
This document proposes a novel hybrid IGP/MPLS traffic engineering method based on genetic algorithms to handle long or medium-term traffic variations. The method treats the maximum number of hops an LSP may take and the number of LSPs applied solely to improve routing as constraints. Results comparing this hybrid approach to pure IGP routing and full mesh MPLS with and without flow splitting on the German scientific network and other networks are presented.
Web Service QoS Prediction Based on Adaptive Dynamic Programming Using Fuzzy ...redpel dot com
The document proposes a novel approach for predicting quality of service (QoS) metrics for cloud services. The approach combines fuzzy neural networks and adaptive dynamic programming (ADP) for improved prediction accuracy. Specifically, it uses an adaptive-network-based fuzzy inference system (ANFIS) to extract fuzzy rules from QoS data and employ ADP for online parameter learning of the fuzzy rules. Experimental results on a large QoS dataset demonstrate the prediction accuracy of this approach. The approach also provides a convergence proof to guarantee stability of the neural network weights during training.
Validation of pervasive cloud task migration with colored petri netredpel dot com
The document describes a study that used Colored Petri Nets (CPN) to model and simulate task migration in pervasive cloud computing environments. The study made the following contributions:
1) It expanded the semantics of CPN to include context information, creating a new CPN model called CCPN.
2) Using CCPN, it constructed two task migration models - one that considered context and one that did not - to simulate task migration in a pervasive cloud based on the OSGi framework.
3) It simulated the two models in CPN Tools and evaluated them based on metrics like task migration accessibility, integrity of the migration process, and system reliability and stability after migration. It also
Enforcing end to-end proportional fairness with bounded buffer overflow proba...ijwmn
This document summarizes a research paper that proposes a distributed flow-based access scheme for slotted-time protocols in ad-hoc wireless networks. The scheme aims to provide proportional fairness between end-to-end flows while constraining buffer overflow probabilities at each node. It formulates the problem as a nonlinear program and presents a distributed dual approach with low computational overhead. Simulation results support that the proposed scheme converges to the unique global optimum and satisfies fairness and quality of service objectives.
An Alternative Genetic Algorithm to Optimize OSPF WeightsEM Legacy
This document presents a genetic algorithm approach to optimize OSPF routing weights. The algorithm aims to minimize maximum and average link utilization directly, unlike previous methods that minimized a convex cost function. It can find weights for both single and multiple shortest path routing. The genetic algorithm uses a chromosome encoding of link weights. It selects parents using rank selection and produces offspring using a reproduction strategy combining crossover and mutation. Additional mutation is applied to offspring not meeting certain conditions. The algorithm is tested on small networks and compared to MIP-based methods, showing results for larger networks with increasing traffic demands.
IMPACT OF PARTIAL DEMAND INCREASE ON THE PERFORMANCE OF IP NETWORKS AND RE-OP...EM Legacy
12th GI/ITG CONFERENCE ON MEASURING, MODELLING AND EVALUATION OF COMPUTER AND COMMUNICATION SYSTEMS 3rd POLISH-GERMAN TELETRAFFIC SYMPOSIUM
PGTS 2004
Eueung Mulyana, Ulrich Killat
Fuzzy Optimized Metric for Adaptive Network RoutingCSCJournals
Network routing algorithms used today calculate least cost (shortest) paths between nodes. The cost of a path is the sum of the cost of all links on that path. The use of a single metric for adaptive routing is insufficient to reflect the actual state of the link. In general, there is a limitation on the accuracy of the link state information obtained by the routing protocol. Hence it becomes useful if two or more metrics can be associated to produce a single metric that can describe the state of the link more accurately. In this paper, a fuzzy inference rule base is implemented to generate the fuzzy cost of each candidate path to be used in routing the incoming calls. This fuzzy cost is based on the crisp values of the different metrics; a fuzzy membership function is defined. The parameters of these membership functions reflect dynamically the requirement of the incoming traffic service as well as the current state of the links in the path. And this paper investigates how three metrics, the mean link bandwidth, queue utilization and the mean link delay, can be related using a simple fuzzy logic algorithm to produce a optimized cost of the link for a certain interval that is more „precise‟ than either of the single metric, to solve routing problem .
Traffic Features Extraction and Clustering Analysis for Abnormal Behavior Det...Areej Qasrawi
This document proposes methods for extracting traffic features and using DBSCAN clustering to detect abnormal network behaviors. It extracts four traffic features related to IP addresses, ports, packet types and sizes to capture characteristics. DBSCAN clustering is applied to the feature vectors, classifying traffic into core clusters and isolated points. The isolated points likely represent abnormal behaviors and are analyzed for detection. Experimental results on test network traffic demonstrate the methods can effectively identify abnormal clusters, like those generated by a DDoS attack. The performance is better than alternative K-means clustering which cannot distinguish abnormal behavior clusters as clearly.
An Offline Hybrid IGP/MPLS Traffic Engineering Approach under LSP ConstraintsEM Legacy
This document proposes a novel hybrid IGP/MPLS traffic engineering method based on genetic algorithms to handle long or medium-term traffic variations. The method treats the maximum number of hops an LSP may take and the number of LSPs applied solely to improve routing as constraints. Results comparing this hybrid approach to pure IGP routing and full mesh MPLS with and without flow splitting on the German scientific network and other networks are presented.
UCLA CS219 Course Project Report (Prof. George Varghese)
StateKeeper: Generalizing Reachability
Today there are many tools that are built using formal methods to
verify networks. The majority of these tools check network specifi-
cations and configurations to identify only a limited class of failures
such as Reachability, Forwarding Loops and Slicing. They don’t take
into account the rate-limiting rules that affect the throughput of the
system and also link delays. Both of these quantities are responsible
for the Quality of Service (QoS). We believe that without a decent
throughput and affordable delay, a network is pretty much in a
dead state even if it passes the tests for reachability, forwarding
detection, and other such failure classes. We developed StateKeeper,
a tool based on ideas from Atomic Predicates Verifier. StateKeeper
keeps track of both network performance and network reachability.
In our experiments, we factor in link delay and throughput as our
performance metrics. StateKeeper will allow network operators
to verify Quality of Service at each port along a route by showing
information about the state of each step.
Congestion Control through Load Balancing Technique for Mobile Networks: A Cl...IDES Editor
The Optimal Routing Path (ORP) for mobile
cellular networks is proposed in this paper with the
introduction of cluster-based approach. Here an improved
dynamic selection procedure is used to elect cluster head.
The cluster head is only responsible for the computation of
least congested path. Hence the delay is reduced with the
significant reduction on the number of backtrackings.
Multistage interconnection networks (MIN) are among the most efficient switching architectures for the number of switching Element (SE). Optical crosstalk in optical multistage interconnection network on the omega network topology Switches are arranged in multiple stages. These switches also referred to as switching element (SEs) have two input and two output ports, interconnected to the neighboring stages in a shuffle exchange connected pattern message routing in such a network is determined by the interstate connection pattern.
Optical Multistage interconnection networks (OMIN) are advanced version of MINs. The main Problem with OMIN is crosstalk. The main purpose of this paper is to Present crosstalk free modified omega network, which is based on time domain approach. This paper presents the source and destination based Algorithm (SDBA) .SDBA does the scheduling for source and their respective destination addresses for the message routing. SDBA is compared with the crosstalk modified omega network (CFMON).CFMON also Minimizes the crosstalk. This paper is the modified form of the omega network.
On modeling controller switch interaction in openflow based sdnsIJCNCJournal
With an increase in number of software defined network (SDN) deployments,and OpenFlow consolidating as the protocol of choice for controller-switch interactions, a need to analytically model the system for performance analysis is increasing. An attempt has previously been made in [1] to model the syste considering both a controller and a switch as an M/M/1 queue. The method, although useful, lacks accuracy for higher probabilities of new flows entering the network. The approach is also deficient of
details on how it can be extended to more than one node in the data plane.These two short-comings are addressed in this paper where thecontroller and switch are modeled
collectively as Jackson’s network, with essential tuning to suit OpenFlow-based SDN. The consequent analysis shows the resilience of the model even for higher number of new flow entries. An example is also used
to illustrate the case of multiple nodes in the data plane.
Efficient routing mechanism using cycle based network and k hop security in a...ijait
In a multi-domain network, Topology Aggregation (TA) may be adopted to provide limited information
regarding intra cluster connectivity without revealing detailed topology information. Nodes are grouped
into the cluster. Every cluster has border nodes, which is used for data transmission between source and
destination. The K-hop security can be used for the purpose of securing the data communication. The
topologies are spanning tree and balanced tree that can be used to reduce bandwidth overhead, delivery
delay and to increase throughput and packet delivery ratio. The shortest path can be found using
Bhandari’s algorithm and Cycle-Based Minimum-Cost Domain-Disjoint Paths (CMCDP) Algorithm for
establish the second path in the network . These topologies are compared to demonstrate the advantage of
finding shortest path using Bhandari’s algorithm.
AOTO: Adaptive overlay topology optimization in unstructured P2P systemsZhenyun Zhuang
IEEE GLOBECOM 2003
Peer-to-Peer (P2P) systems are self-organized and
decentralized. However, the mechanism of a peer randomly
joining and leaving a P2P network causes topology mismatch-
ing between the P2P logical overlay network and the physical
underlying network. The topology mismatching problem brings
great stress on the Internet infrastructure and seriously limits
the performance gain from various search or routing tech-
niques. We propose the Adaptive Overlay Topology Optimiza-
tion (AOTO) technique, an algorithm of building an overlay
multicast tree among each source node and its direct logical
neighbors so as to alleviate the mismatching problem by choos-
ing closer nodes as logical neighbors, while providing a larger
query coverage range. AOTO is scalable and completely dis-
tributed in the sense that it does not require global knowledge
of the whole overlay network when each node is optimizing the
organization of its logical neighbors. The simulation shows that
AOTO can effectively solve the mismatching problem and re-
duce more than 55% of the traffic generated by the P2P system itself.
This document analyzes the impact of network coding configuration on performance in ad hoc networks. It considers throughput loss and decoding loss as overhead of network coding. For static networks using physical-layer network coding, results show network coding does not improve goodput or delay/goodput tradeoff. For mobile ad hoc networks using random linear network coding, two transmission schemes are analyzed under different mobility models. The optimal network coding configuration is derived to optimize delay/goodput tradeoff and goodput for each scenario. Main findings are that network coding improves goodput for mobile networks, but does not significantly improve delay/goodput tradeoff except for one case. This is the first work to investigate scaling laws of network coding performance and configuration while considering
OpenFlow is one of the most commonly used protocols for communication between the
controller and the forwarding element in a software defined network (SDN). A model based on
M/M/1 queues is proposed in [1] to capture the communication between the forwarding element
and the controller. Albeit the model provides useful insight, it is accurate only for the case when
the probability of expecting a new flow is small.
Secondly, it is not straight forward to extend the model in [1] to more than one forwarding
element in the data plane. In this work we propose a model which addresses both these
challenges. The model is based on Jackson assumption but with corrections tailored to the
OpenFlow based SDN network. Performance analysis using the proposed model indicates that
the model is accurate even for the case when the probability of new flow is quite large. Further
we show by a toy example that the model can be extended to more than one node in the data plane.
Throughput and Handover Latency Evaluation for Multicast Proxy Mobile IPV6journalBEEI
The objective of this paper is to present performance analysis of a new enhanced mobile multicast network mobility management scheme. The initial developed network mobility management called Proxy Mobile IPv6 (PMIPv6) is based on unicast network support. This paper enabled multicast support in network mobility management and named it as MPMIPv6. Additionally this enhancement also provides better network performance with the new context transfer operations and fast reroute operations. In brief, this paper also describes other current mobile multicast schemes. The new scheme is evaluated using mathematical analysis and NS3.19 simulator. Theoretically this scheme reduces service recovery time, total signalling cost, handover latency, and packet loss for multicast communication. However for this paper, the analysed parameters are throughput and handover latency. Both mathematical and simulation results exhibit better network performance for multicast environment compared to the standard benchmark scheme.
Routing Optimization in IP/MPLS Networks under Per-Class Over-Provisioning Co...EM Legacy
This document describes research on routing optimization in IP/MPLS networks under per-class over-provisioning constraints. It introduces a heuristic approach that iteratively optimizes IGP link metrics to indirectly solve the multi-objective problem of finding routing configurations that efficiently use network resources while satisfying per-class capacity constraints and minimizing the number of explicit label switched paths (LSPs) required. The heuristic calls a traffic engineering procedure based on simulated annealing to optimize routing for aggregate demands and individual traffic classes.
The Web service composition based on colored Petri netIJRESJOURNAL
ABSTRACT: An automatic approach to get colored Petri net model of web service composition was put forward in this paper. Each web service composition had its Petri net which described in PNML( Petri net Markup Language) +OWL(Ontology Web Language) ,where PNML part describes the Petri net structure and OWL part shows out their domain ontology definitions (semantic markups) of place elements of the Petri net. Based on the input / output interaction related places elements among web service colored Petri nets, through place fusion operation, merging sub-web service Petri nets, we can get the colored Petri net model of web service composition, this work proposes the necessary precondition for practical application of colored Petri net in the context of service computing.
A minimization approach for two level logic synthesis using constrained depth...IAEME Publication
This document summarizes a research paper that proposes a new approach for two-level logic synthesis called constrained depth-first search. It generates all prime implicants of a Boolean function efficiently using cube absorption and a position cube notation representation. It then formulates the problem of finding an optimal sum-of-products cover as a combinatorial optimization problem. The key contribution is a constrained depth-first search of a virtual prime implicant decision tree that finds the minimum cover. Numerical results on benchmark functions show it produces results as good or better than state-of-the-art logic synthesis tools, often finding the greedy solution is already optimal or near-optimal.
Revised presentation slide for PFN Seminar, 2017/3/9.
Learning Communication with Neural Networks.
Presentation video: https://www.youtube.com/watch?v=ZrLiNAMHszo
This document summarizes research on distributed path computation algorithms that aim to prevent routing loops. It introduces the Distributed Path Computation with Intermediate Variables (DIV) algorithm, which can operate with any routing algorithm to guarantee loop-freedom. DIV generalizes previous loop-free algorithms and provably outperforms them by reducing synchronous updates and helping maintain paths during network changes. The document also reviews link-state routing, distance-vector routing, and existing loop-prevention techniques like the Diffusing Update Algorithm and Loop Free Invariance algorithms.
PSO-based Training, Pruning, and Ensembling of Extreme Learning Machine RBF N...ijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
[ppt] A Comparison of SAWSDL Based Semantic Web Service Discovery AlgorithmsShiva Sandeep Garlapati
The document compares three SAWSDL-based semantic web service discovery algorithms: SAWSDL-MX Hybrid Matchmaker, TVERSKY Model Based, and MWSDI Discovery. It evaluates the algorithms on a test collection and measures their effectiveness statistically. The evaluation found that SAWSDL-M0 had better results than the other SAWSDL-MX variants. MWSDI calculates concept similarity in more detail than Tversky but is slower. SAWSDL-MX does not perform functionality matching like the other two. Overall, SAWSDL-M0, MWSDI, and Tversky showed most to least effectiveness on this test case respectively.
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
1) The document proposes a mathematical model and optimization service to predict the optimal number of parallel TCP streams needed to maximize data throughput in a distributed computing environment.
2) It develops a novel model that can predict the optimal number using only three data points, and implements this service in the Stork Data Scheduler.
3) Experimental results show the optimized transfer time using this prediction and optimization service is much less than without optimization in most cases.
AN EFFICIENT ALGORITHM FOR THE BURSTING OF SERVICE-BASED APPLICATIONS IN HYB...Nexgen Technology
bulk ieee projects in pondicherry,ieee projects in pondicherry,final year ieee projects in pondicherry
Nexgen Technology Address:
Nexgen Technology
No :66,4th cross,Venkata nagar,
Near SBI ATM,
Puducherry.
Email Id: praveen@nexgenproject.com.
www.nexgenproject.com
Mobile: 9751442511,9791938249
Telephone: 0413-2211159.
NEXGEN TECHNOLOGY as an efficient Software Training Center located at Pondicherry with IT Training on IEEE Projects in Android,IEEE IT B.Tech Student Projects, Android Projects Training with Placements Pondicherry, IEEE projects in pondicherry, final IEEE Projects in Pondicherry , MCA, BTech, BCA Projects in Pondicherry, Bulk IEEE PROJECTS IN Pondicherry.So far we have reached almost all engineering colleges located in Pondicherry and around 90km
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
This document outlines a group project assignment for a course on the construction industry. The project involves interviewing a professional from the building team of a construction project and creating a magazine summarizing the interview. Students will be assigned a professional role to interview, such as architect, engineer, or quantity surveyor. They must conduct the interview, record it, and use the information to create an 8-12 page magazine in PDF and print formats. The magazine must include the interviewed professional's company profile, personal profile, and description of their roles and responsibilities on one or two projects. A peer assessment form is also included to evaluate each group member's contributions.
This short document promotes the creation of presentations using Haiku Deck on SlideShare. It includes photos from other Haiku Deck presentations and encourages the reader to get started making their own presentation by clicking a button labeled "GET STARTED".
UCLA CS219 Course Project Report (Prof. George Varghese)
StateKeeper: Generalizing Reachability
Today there are many tools that are built using formal methods to
verify networks. The majority of these tools check network specifi-
cations and configurations to identify only a limited class of failures
such as Reachability, Forwarding Loops and Slicing. They don’t take
into account the rate-limiting rules that affect the throughput of the
system and also link delays. Both of these quantities are responsible
for the Quality of Service (QoS). We believe that without a decent
throughput and affordable delay, a network is pretty much in a
dead state even if it passes the tests for reachability, forwarding
detection, and other such failure classes. We developed StateKeeper,
a tool based on ideas from Atomic Predicates Verifier. StateKeeper
keeps track of both network performance and network reachability.
In our experiments, we factor in link delay and throughput as our
performance metrics. StateKeeper will allow network operators
to verify Quality of Service at each port along a route by showing
information about the state of each step.
Congestion Control through Load Balancing Technique for Mobile Networks: A Cl...IDES Editor
The Optimal Routing Path (ORP) for mobile
cellular networks is proposed in this paper with the
introduction of cluster-based approach. Here an improved
dynamic selection procedure is used to elect cluster head.
The cluster head is only responsible for the computation of
least congested path. Hence the delay is reduced with the
significant reduction on the number of backtrackings.
Multistage interconnection networks (MIN) are among the most efficient switching architectures for the number of switching Element (SE). Optical crosstalk in optical multistage interconnection network on the omega network topology Switches are arranged in multiple stages. These switches also referred to as switching element (SEs) have two input and two output ports, interconnected to the neighboring stages in a shuffle exchange connected pattern message routing in such a network is determined by the interstate connection pattern.
Optical Multistage interconnection networks (OMIN) are advanced version of MINs. The main Problem with OMIN is crosstalk. The main purpose of this paper is to Present crosstalk free modified omega network, which is based on time domain approach. This paper presents the source and destination based Algorithm (SDBA) .SDBA does the scheduling for source and their respective destination addresses for the message routing. SDBA is compared with the crosstalk modified omega network (CFMON).CFMON also Minimizes the crosstalk. This paper is the modified form of the omega network.
On modeling controller switch interaction in openflow based sdnsIJCNCJournal
With an increase in number of software defined network (SDN) deployments,and OpenFlow consolidating as the protocol of choice for controller-switch interactions, a need to analytically model the system for performance analysis is increasing. An attempt has previously been made in [1] to model the syste considering both a controller and a switch as an M/M/1 queue. The method, although useful, lacks accuracy for higher probabilities of new flows entering the network. The approach is also deficient of
details on how it can be extended to more than one node in the data plane.These two short-comings are addressed in this paper where thecontroller and switch are modeled
collectively as Jackson’s network, with essential tuning to suit OpenFlow-based SDN. The consequent analysis shows the resilience of the model even for higher number of new flow entries. An example is also used
to illustrate the case of multiple nodes in the data plane.
Efficient routing mechanism using cycle based network and k hop security in a...ijait
In a multi-domain network, Topology Aggregation (TA) may be adopted to provide limited information
regarding intra cluster connectivity without revealing detailed topology information. Nodes are grouped
into the cluster. Every cluster has border nodes, which is used for data transmission between source and
destination. The K-hop security can be used for the purpose of securing the data communication. The
topologies are spanning tree and balanced tree that can be used to reduce bandwidth overhead, delivery
delay and to increase throughput and packet delivery ratio. The shortest path can be found using
Bhandari’s algorithm and Cycle-Based Minimum-Cost Domain-Disjoint Paths (CMCDP) Algorithm for
establish the second path in the network . These topologies are compared to demonstrate the advantage of
finding shortest path using Bhandari’s algorithm.
AOTO: Adaptive overlay topology optimization in unstructured P2P systemsZhenyun Zhuang
IEEE GLOBECOM 2003
Peer-to-Peer (P2P) systems are self-organized and
decentralized. However, the mechanism of a peer randomly
joining and leaving a P2P network causes topology mismatch-
ing between the P2P logical overlay network and the physical
underlying network. The topology mismatching problem brings
great stress on the Internet infrastructure and seriously limits
the performance gain from various search or routing tech-
niques. We propose the Adaptive Overlay Topology Optimiza-
tion (AOTO) technique, an algorithm of building an overlay
multicast tree among each source node and its direct logical
neighbors so as to alleviate the mismatching problem by choos-
ing closer nodes as logical neighbors, while providing a larger
query coverage range. AOTO is scalable and completely dis-
tributed in the sense that it does not require global knowledge
of the whole overlay network when each node is optimizing the
organization of its logical neighbors. The simulation shows that
AOTO can effectively solve the mismatching problem and re-
duce more than 55% of the traffic generated by the P2P system itself.
This document analyzes the impact of network coding configuration on performance in ad hoc networks. It considers throughput loss and decoding loss as overhead of network coding. For static networks using physical-layer network coding, results show network coding does not improve goodput or delay/goodput tradeoff. For mobile ad hoc networks using random linear network coding, two transmission schemes are analyzed under different mobility models. The optimal network coding configuration is derived to optimize delay/goodput tradeoff and goodput for each scenario. Main findings are that network coding improves goodput for mobile networks, but does not significantly improve delay/goodput tradeoff except for one case. This is the first work to investigate scaling laws of network coding performance and configuration while considering
OpenFlow is one of the most commonly used protocols for communication between the
controller and the forwarding element in a software defined network (SDN). A model based on
M/M/1 queues is proposed in [1] to capture the communication between the forwarding element
and the controller. Albeit the model provides useful insight, it is accurate only for the case when
the probability of expecting a new flow is small.
Secondly, it is not straight forward to extend the model in [1] to more than one forwarding
element in the data plane. In this work we propose a model which addresses both these
challenges. The model is based on Jackson assumption but with corrections tailored to the
OpenFlow based SDN network. Performance analysis using the proposed model indicates that
the model is accurate even for the case when the probability of new flow is quite large. Further
we show by a toy example that the model can be extended to more than one node in the data plane.
Throughput and Handover Latency Evaluation for Multicast Proxy Mobile IPV6journalBEEI
The objective of this paper is to present performance analysis of a new enhanced mobile multicast network mobility management scheme. The initial developed network mobility management called Proxy Mobile IPv6 (PMIPv6) is based on unicast network support. This paper enabled multicast support in network mobility management and named it as MPMIPv6. Additionally this enhancement also provides better network performance with the new context transfer operations and fast reroute operations. In brief, this paper also describes other current mobile multicast schemes. The new scheme is evaluated using mathematical analysis and NS3.19 simulator. Theoretically this scheme reduces service recovery time, total signalling cost, handover latency, and packet loss for multicast communication. However for this paper, the analysed parameters are throughput and handover latency. Both mathematical and simulation results exhibit better network performance for multicast environment compared to the standard benchmark scheme.
Routing Optimization in IP/MPLS Networks under Per-Class Over-Provisioning Co...EM Legacy
This document describes research on routing optimization in IP/MPLS networks under per-class over-provisioning constraints. It introduces a heuristic approach that iteratively optimizes IGP link metrics to indirectly solve the multi-objective problem of finding routing configurations that efficiently use network resources while satisfying per-class capacity constraints and minimizing the number of explicit label switched paths (LSPs) required. The heuristic calls a traffic engineering procedure based on simulated annealing to optimize routing for aggregate demands and individual traffic classes.
The Web service composition based on colored Petri netIJRESJOURNAL
ABSTRACT: An automatic approach to get colored Petri net model of web service composition was put forward in this paper. Each web service composition had its Petri net which described in PNML( Petri net Markup Language) +OWL(Ontology Web Language) ,where PNML part describes the Petri net structure and OWL part shows out their domain ontology definitions (semantic markups) of place elements of the Petri net. Based on the input / output interaction related places elements among web service colored Petri nets, through place fusion operation, merging sub-web service Petri nets, we can get the colored Petri net model of web service composition, this work proposes the necessary precondition for practical application of colored Petri net in the context of service computing.
A minimization approach for two level logic synthesis using constrained depth...IAEME Publication
This document summarizes a research paper that proposes a new approach for two-level logic synthesis called constrained depth-first search. It generates all prime implicants of a Boolean function efficiently using cube absorption and a position cube notation representation. It then formulates the problem of finding an optimal sum-of-products cover as a combinatorial optimization problem. The key contribution is a constrained depth-first search of a virtual prime implicant decision tree that finds the minimum cover. Numerical results on benchmark functions show it produces results as good or better than state-of-the-art logic synthesis tools, often finding the greedy solution is already optimal or near-optimal.
Revised presentation slide for PFN Seminar, 2017/3/9.
Learning Communication with Neural Networks.
Presentation video: https://www.youtube.com/watch?v=ZrLiNAMHszo
This document summarizes research on distributed path computation algorithms that aim to prevent routing loops. It introduces the Distributed Path Computation with Intermediate Variables (DIV) algorithm, which can operate with any routing algorithm to guarantee loop-freedom. DIV generalizes previous loop-free algorithms and provably outperforms them by reducing synchronous updates and helping maintain paths during network changes. The document also reviews link-state routing, distance-vector routing, and existing loop-prevention techniques like the Diffusing Update Algorithm and Loop Free Invariance algorithms.
PSO-based Training, Pruning, and Ensembling of Extreme Learning Machine RBF N...ijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
[ppt] A Comparison of SAWSDL Based Semantic Web Service Discovery AlgorithmsShiva Sandeep Garlapati
The document compares three SAWSDL-based semantic web service discovery algorithms: SAWSDL-MX Hybrid Matchmaker, TVERSKY Model Based, and MWSDI Discovery. It evaluates the algorithms on a test collection and measures their effectiveness statistically. The evaluation found that SAWSDL-M0 had better results than the other SAWSDL-MX variants. MWSDI calculates concept similarity in more detail than Tversky but is slower. SAWSDL-MX does not perform functionality matching like the other two. Overall, SAWSDL-M0, MWSDI, and Tversky showed most to least effectiveness on this test case respectively.
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
1) The document proposes a mathematical model and optimization service to predict the optimal number of parallel TCP streams needed to maximize data throughput in a distributed computing environment.
2) It develops a novel model that can predict the optimal number using only three data points, and implements this service in the Stork Data Scheduler.
3) Experimental results show the optimized transfer time using this prediction and optimization service is much less than without optimization in most cases.
AN EFFICIENT ALGORITHM FOR THE BURSTING OF SERVICE-BASED APPLICATIONS IN HYB...Nexgen Technology
bulk ieee projects in pondicherry,ieee projects in pondicherry,final year ieee projects in pondicherry
Nexgen Technology Address:
Nexgen Technology
No :66,4th cross,Venkata nagar,
Near SBI ATM,
Puducherry.
Email Id: praveen@nexgenproject.com.
www.nexgenproject.com
Mobile: 9751442511,9791938249
Telephone: 0413-2211159.
NEXGEN TECHNOLOGY as an efficient Software Training Center located at Pondicherry with IT Training on IEEE Projects in Android,IEEE IT B.Tech Student Projects, Android Projects Training with Placements Pondicherry, IEEE projects in pondicherry, final IEEE Projects in Pondicherry , MCA, BTech, BCA Projects in Pondicherry, Bulk IEEE PROJECTS IN Pondicherry.So far we have reached almost all engineering colleges located in Pondicherry and around 90km
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
This document outlines a group project assignment for a course on the construction industry. The project involves interviewing a professional from the building team of a construction project and creating a magazine summarizing the interview. Students will be assigned a professional role to interview, such as architect, engineer, or quantity surveyor. They must conduct the interview, record it, and use the information to create an 8-12 page magazine in PDF and print formats. The magazine must include the interviewed professional's company profile, personal profile, and description of their roles and responsibilities on one or two projects. A peer assessment form is also included to evaluate each group member's contributions.
This short document promotes the creation of presentations using Haiku Deck on SlideShare. It includes photos from other Haiku Deck presentations and encourages the reader to get started making their own presentation by clicking a button labeled "GET STARTED".
For nearly 60 years, AABR has provided services to individuals with developmental disabilities. It began as a recreation program for six blind and intellectually disabled children and has expanded to serve nearly 1,000 individuals through residential, adult day, family support, recreational, and vocational programs. AABR is confronting increasing needs of the elderly population and developing programs for young adults with autism, while providing a life of dignity and independence.
The document summarizes news from The King's School in Chester. It discusses the school receiving an excellent rating in its inspection, with achievements, teaching, and pastoral care all rated highly. It also covers events at the school including political debates around the UK election, a talk by historian Dan Snow, and a mock election held by lower sixth students. Finally, it discusses a history revision session led by Professor Eric Evans on 19th century UK elections.
This study examined the effect of nozzle pressure on diesel fuel consumption in an indirect injection diesel engine. Laboratory experiments were conducted with a diesel engine under no load and without timing changes. Nozzle pressures were varied between 110-130 kg/cm2. The results showed that at pressures of 125-130 kg/cm2, average fuel consumption was lowest at 33.67 cc/minute. Statistical analysis found the difference in fuel consumption with different nozzle pressures to be statistically significant. Therefore, the study concluded that nozzle pressure influences fuel consumption in indirect injection diesel engines.
This document evaluates the performance of the AODV and DSR routing protocols for Variable Bit Rate (VBR) multimedia traffic in mobile ad hoc networks. It conducts simulations in NS-2 to analyze four performance metrics: packet received, throughput, routing overhead, and network load. The results show that AODV outperforms DSR for packet received, throughput, and routing overhead. DSR has higher network load than AODV. Therefore, the document concludes that AODV is better suited than DSR for VBR multimedia transmission in mobile ad hoc networks.
Pakwheels saw mobile as critical to its growth strategy due to falling smartphone prices and increasing internet users in Pakistan. The company launched Universal App Install campaigns through Google, which automatically optimized advertising and helped Pakwheels increase app installs by 84% while lowering cost per install by 20%. Due to this success, Pakwheels allocated a higher budget to install campaigns.
This document discusses the art movement known as Japonisme, where European artists in the late 19th century were influenced by Japanese art. It began when Japanese art objects became more widely available in Europe after Japan opened to trade in 1854. Major exhibitions fuelled interest, and artists were drawn to qualities of Japanese art like asymmetric compositions, flat colors, and calligraphic brushwork. Japonisme influenced painting, graphics, and decorative arts, seen in works of Manet, Degas, van Gogh, and designers like William Morris. The influence continued into the Art Nouveau period through emphasis on nature motifs and pure colors.
This document provides an abstract for a thesis that investigates the notion of work-life balance. The thesis questions the idea that work-life balance is achieved through separating work and personal life into separate spheres. It argues that the increasing pace and flexibility of work makes strict separation difficult for many employees. It uses theories of acceleration, temporality, and taskscapes to analyze how intensive and compressed work schedules can challenge work-life balance. The thesis advocates redefining work-life balance as a balance within one's overall worklife, rather than between separate spheres, in order to address issues of work-related stress.
The document discusses targeting young adults aged 16-21 as the audience for a new media product. It was determined that this age group enjoys psychological thrillers, especially those about teenagers, as they can relate to the realistic rather than dramatized portrayal of issues dealt with in the films. Keeping the media product relatively simple and realistic about loss was highlighted as important for engaging this intended audience.
Este documento presenta una serie de pictogramas que representan sonidos para ayudar a identificar el primer sonido de una palabra. Muestra las letras del alfabeto vasco de forma secuencial para que los estudiantes puedan señalar el primer sonido que escuchan.
This document proposes a method for verifying web service compositions using Petri nets and transitive matrices. It presents a model for student online registration and examination web services. These services are represented as Petri nets which are then composed together. Deadlocks in the composition are detected using the transitive matrix of the Petri net. The algorithm computes the transitive matrix and uses it to derive reachable states and check for deadlocks. The method allows for verification of web service compositions and identification of potential deadlocks.
This document proposes a method for verifying web service compositions using Petri nets and transitive matrices. It presents a model for student online registration and examination web services. These services are represented as Petri nets which are then composed together. Deadlocks in the composition are detected using the transitive matrix of the Petri net. The algorithm computes the transitive matrix and uses it to derive reachable states and check for deadlocks. The method allows for verification of web service compositions and identification of potential deadlocks.
An Approach To Enable Replacement Of SOAP Services And REST Services In Light...Joaquin Hamad
This document presents an approach to enable the dynamic replacement of SOAP services with REST services and vice versa within lightweight processes at runtime. Semantic annotations using MicroWSMO are added to REST service descriptions to establish compatibility with SAWSDL descriptions of SOAP services. At runtime, if a SOAP service fails, the execution engine can select a semantically equivalent REST service using the annotations and adapt the request/response through a service adapter using mapping scripts. The approach was implemented in a prototype to execute lightweight processes containing alternative SOAP and REST services.
A Review - Synchronization Approaches to Digital systemsIJERA Editor
Synchronization is a prime requirement in the process of Digital systems. Wherein new devices are upcoming
towards providing higher service level, advanced distributed systems are been integrated onto a single platform
for higher service provision. However with the integration of large processing units, the distributed processing
needs a high level synchronization with minimum processing overhead. The issue of synchronization was
processed by various approaches. This paper outlines a brief review on the developments made in the field of
synchronization approach to digital system, under distributed mode operation.
Final Year IEEE Project 2013-2014 - Web Services Project Title and Abstractelysiumtechnologies
This document provides contact and location information for Elysium Technologies Private Limited, an IT company with 13 years of experience and over 250 developers located across multiple branches in India. It lists their services such as automated services, 24/7 help desk support, and ticketing & appointment systems. The company has experience in multiple languages and technologies.
This document describes a multi-path routing algorithm for IP networks based on flow optimization. It presents an intra-domain routing algorithm that uses multi-commodity flow optimization to enable load-sensitive forwarding over multiple paths without being constrained by traditional routing protocols like OSPF. The key idea is to aggregate all traffic destined for the same egress node into one commodity during optimization, reducing the number of commodities significantly. This makes the computation tractable and allows forwarding based on destination addresses.
final Year Projects, Final Year Projects in Chennai, Software Projects, Embedded Projects, Microcontrollers Projects, DSP Projects, VLSI Projects, Matlab Projects, Java Projects, .NET Projects, IEEE Projects, IEEE 2009 Projects, IEEE 2009 Projects, Software, IEEE 2009 Projects, Embedded, Software IEEE 2009 Projects, Embedded IEEE 2009 Projects, Final Year Project Titles, Final Year Project Reports, Final Year Project Review, Robotics Projects, Mechanical Projects, Electrical Projects, Power Electronics Projects, Power System Projects, Model Projects, Java Projects, J2EE Projects, Engineering Projects, Student Projects, Engineering College Projects, MCA Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, Wireless Networks Projects, Network Security Projects, Networking Projects, final year projects, ieee projects, student projects, college projects, ieee projects in chennai, java projects, software ieee projects, embedded ieee projects, "ieee2009projects", "final year projects", "ieee projects", "Engineering Projects", "Final Year Projects in Chennai", "Final year Projects at Chennai", Java Projects, ASP.NET Projects, VB.NET Projects, C# Projects, Visual C++ Projects, Matlab Projects, NS2 Projects, C Projects, Microcontroller Projects, ATMEL Projects, PIC Projects, ARM Projects, DSP Projects, VLSI Projects, FPGA Projects, CPLD Projects, Power Electronics Projects, Electrical Projects, Robotics Projects, Solor Projects, MEMS Projects, J2EE Projects, J2ME Projects, AJAX Projects, Structs Projects, EJB Projects, Real Time Projects, Live Projects, Student Projects, Engineering Projects, MCA Projects, MBA Projects, College Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, M.Sc Projects, Final Year Java Projects, Final Year ASP.NET Projects, Final Year VB.NET Projects, Final Year C# Projects, Final Year Visual C++ Projects, Final Year Matlab Projects, Final Year NS2 Projects, Final Year C Projects, Final Year Microcontroller Projects, Final Year ATMEL Projects, Final Year PIC Projects, Final Year ARM Projects, Final Year DSP Projects, Final Year VLSI Projects, Final Year FPGA Projects, Final Year CPLD Projects, Final Year Power Electronics Projects, Final Year Electrical Projects, Final Year Robotics Projects, Final Year Solor Projects, Final Year MEMS Projects, Final Year J2EE Projects, Final Year J2ME Projects, Final Year AJAX Projects, Final Year Structs Projects, Final Year EJB Projects, Final Year Real Time Projects, Final Year Live Projects, Final Year Student Projects, Final Year Engineering Projects, Final Year MCA Projects, Final Year MBA Projects, Final Year College Projects, Final Year BE Projects, Final Year BTech Projects, Final Year ME Projects, Final Year MTech Projects, Final Year M.Sc Projects, IEEE Java Projects, ASP.NET Projects, VB.NET Projects, C# Projects, Visual C++ Projects, Matlab Projects, NS2 Projects, C Projects, Microcontroller Projects, ATMEL Projects, PIC Projects, ARM Projects, DSP Projects, VLSI Projects, FPGA Projects, CPLD Projects, Power Electronics Projects, Electrical Projects, Robotics Projects, Solor Projects, MEMS Projects, J2EE Projects, J2ME Projects, AJAX Projects, Structs Projects, EJB Projects, Real Time Projects, Live Projects, Student Projects, Engineering Projects, MCA Projects, MBA Projects, College Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, M.Sc Projects, IEEE 2009 Java Projects, IEEE 2009 ASP.NET Projects, IEEE 2009 VB.NET Projects, IEEE 2009 C# Projects, IEEE 2009 Visual C++ Projects, IEEE 2009 Matlab Projects, IEEE 2009 NS2 Projects, IEEE 2009 C Projects, IEEE 2009 Microcontroller Projects, IEEE 2009 ATMEL Projects, IEEE 2009 PIC Projects, IEEE 2009 ARM Projects, IEEE 2009 DSP Projects, IEEE 2009 VLSI Projects, IEEE 2009 FPGA Projects, IEEE 2009 CPLD Projects, IEEE 2009 Power Electronics Projects, IEEE 2009 Electrical Projects, IEEE 2009 Robotics Projects, IEEE 2009 Solor Projects, IEEE 2009 MEMS Projects, IEEE 2009 J2EE P
Comparative Study of Orchestration using gRPC API and REST API in Server Crea...IJCNCJournal
Cloud computing is the quick, simple, and economical distribution of computing services. To offer quality services in cloud infrastructure, the NFV Management and Orchestration (MANO) function is a critical task for managing both infrastructure resources and network functions. Since the demand for cloud services is rapidly increasing, cloud service providers are constantly trying to reduce operational costs. Hence the elements of MANO functions have gained critical importance in cloud infrastructure. To use MANO efficiently, there are hypervisors (OpenStack) that act as a middle layer between hardware and software that are used to provide Infrastructure-as-a-Service solutions through a set of interrelated services. These services are managed by an application programming interface (API). The existing orchestration method uses Representational state transfer (REST) API for communicating with core components of a hypervisor. These API have been integral part of creating and deploying a server. To improve the performance, this paper proposes a novel approach for orchestration based on the open-source remote procedure call framework, known as gRPC. To analyse the proposed solution, both REST and gRPC-based orchestration methods are implemented for creating and launching servers using OpenStack cloud computing platform. The server creation time is obtained for different scenarios and SFC use cases. The results show that by using gRPC, the performance in terms of server creation time of an orchestration is improved by up to 27% compared to the traditional REST-based orchestration.
Comparative Study of Orchestration using gRPC API and REST API in Server Crea...IJCNCJournal
Cloud computing is the quick, simple, and economical distribution of computing services. To offer quality services in cloud infrastructure, the NFV Management and Orchestration (MANO) function is a critical task for managing both infrastructure resources and network functions. Since the demand for cloud services is rapidly increasing, cloud service providers are constantly trying to reduce operational costs. Hence the elements of MANO functions have gained critical importance in cloud infrastructure. To use MANO efficiently, there are hypervisors (OpenStack) that act as a middle layer between hardware and software that are used to provide Infrastructure-as-a-Service solutions through a set of interrelated services. These services are managed by an application programming interface (API). The existing orchestration method uses Representational state transfer (REST) API for communicating with core components of a hypervisor. These API have been integral part of creating and deploying a server. To improve the performance, this paper proposes a novel approach for orchestration based on the open-source remote procedure call framework, known as gRPC. To analyse the proposed solution, both REST and gRPC-based orchestration methods are implemented for creating and launching servers using OpenStack cloud computing platform. The server creation time is obtained for different scenarios and SFC use cases. The results show that by using gRPC, the performance in terms of server creation time of an orchestration is improved by up to 27% compared to the traditional REST-based orchestration.
MMUNE-INSPIRED METHOD FOR SELECTING THE OPTIMAL SOLUTION IN SEMANTIC WEB SE...dannyijwest
The increasing interest in developing efficient and effective optimization techniques has conducted
researchers to turn their attention towards biology. It has been noticed that biology offers many clues for
designing novel optimization techniques, these approaches exhibit self-organizing capabilities and permit
the reachability of promising solutions without the existence of a central coordinator. In this paper we
handle the problem of dynamic web service composition, by using the clonal selection algorithm. In order
to assess the optimality rate of a given composition, we use the QOS attributes of the services involved in
the workflow as well as, the semantic similarity between these components. The experimental evaluation
shows that the proposed approach has a better performance in comparison with other approaches such as
the genetic algorithm
The document describes an extended method for synthesizing distributed protocol specifications from UML-based service specifications that include timing constraints. The method first assigns timing intervals to transitions in the service specification. It then extends an existing UML-based protocol synthesis technique to consider channel delays between communicating protocol entities when deriving transition events and timing constraints. The resulting synthesized protocol specifications are guaranteed to conform to the timing constraints of the original service specification.
Synthesizing specifications for real time applications that involve distributed communication protocol
entities from a service specification, which is modeled in the UML state machine with composite states, is a
time-consuming and labor-intensive task. Existing synthesis techniques for UML-based service
specifications do not account for timing constrains and, therefore, cannot be used in real time applications
for which the timing constraints are crucial and must be considered. In this paper, we address the problem
of time assignment to the events defined in the service specification modeled in UML state machine. In
addition, we show how to extend a technique that automatically synthesizes UML-based protocol
specifications from a service specification to consider the timing constraints given in the service
specification. The resulting synthesized protocol is guaranteed to conform to the timing constraints given in
the service specification.
Evaluation of load balancing approaches for Erlang concurrent application in ...TELKOMNIKA JOURNAL
Cloud system accommodates the computing environment including PaaS (platform as a service), SaaS (software as a service), and IaaS (infrastructure as service) that enables the services of cloud systems. Cloud system allows multiple users to employ computing services through browsers, which reflects an alternative service model that alters the local computing workload to a distant site. Cloud virtualization is another characteristic of the clouds that deliver virtual computing services and imitate the functionality of physical computing resources. It refers to an elastic load balancing management that provides the flexible model of on-demand services. The virtualization allows organizations to improve high levels of reliability, accessibility, and scalability by having a capability to execute applications on multiple resources simultaneously. In this paper we use a queuing model to consider a flexible load balancing and evaluate performance metrics such as mean queue length, throughput, mean waiting time, utilization, and mean traversal time. The model is aware of the arrival of concurrent applications with an Erlang distribution. Simulation results regarding performance metrics are investigated. Results point out that in Cloud systems both the fairness and load balancing are to be significantly considered.
Performance Simulation and Analysis for LTESystem Using Human Behavior Queue ...ijwmn
Understanding the nature of traffic has been a key concern of the researchers particularly over the last
two decades and it has been noticed through extensive high quality studies that traffic found in different
kinds of IP/wireless IP networks is human operators . Despite the recent findings of real time human
behavior in measured traffic from data networks, much of the current understanding of IP traffic
modeling is still based on simplistic probability distributed traffic. Unlike most existing studies that are
primarily based on simplistic probabilistic model and traditional scheduling algorithms, this research
presents an analytical performance model for real time human behavior queue systems with intelligent
task management traffic input scheduled by a novel and promising scheduling mechanism for 4G-LTE
system. Our proposed model is substantiated on human behavior queuing system that considers real time
of traffic exhibiting homogeneous tasks characteristics. We analyze the model on the basis of newly
proposed scheduling scheme for 4G-LTE system. We present closed form expressions of expected
response times for real time traffic classes. We develop a discrete event simulator to understand the
behavior of real time of arriving tasks traffic under this newly proposed scheduling mechanism for 4GLTE system . The results indicate that our proposed scheduling algorithm provides preferential treatment
to real-time applications such as voice and video but not to that extent that data applications are starving
for bandwidth and outperforms all other scheduling schemes that are available in the market.
WEB SERVICE COMPOSITION IN DYNAMIC ENVIRONMENT: A COMPARATIVE STUDYcscpconf
This document provides a comparative study of 16 recent research papers on web service composition in dynamic environments. It evaluates the papers based on their approach to adapting to environmental changes, the composition phase they consider for detecting changes, whether they account for quality of service attributes, their main contributions, and whether they include experiments. The study finds that most approaches handle dynamism during the execution phase, treating earlier phases as static, and that more work is needed to detect and handle changes across all composition phases to build more reliable plans. Accounting for quality of service attributes and including experiments are also areas for improvement.
Talhunt is a leader in assisting and executing IEEE Engineering projects to Engineering students - run by young and dynamic IT entrepreneurs. Our primary motto is to help Engineering graduates in IT and Computer science department to implement their final year project with first-class technical and academic assistance.
Project assistance is provided by 15+ years experienced IT Professionals. Over 100+ IEEE 2015 and 200+ yester year IEEE project titles are available with us. Projects are based on Software Development Life-Cycle (SDLC) model.
This document provides summaries of 15 networking projects from TTA including the project code, title, description, and reference. The projects cover topics like delay analysis of opportunistic spectrum access MAC protocols, load balancing for network traffic measurement, key exchange protocols for parallel network file systems, anomaly detection in intrusion detection systems, and energy efficient group key agreement for wireless networks. The document provides contact information at the end for obtaining full project papers.
This document lists several Java/J2EE/J2ME projects related to utility computing environments, schema matching, fuzzy ontology generation, wireless sensor networks, wireless MAC protocols, distributed cache updating, selfish routing, collaborative key agreement, TCP congestion control, global roaming in mobile networks, GPS-based emergency response systems, network intrusion detection, honey pots, voice over IP, vehicle tracking, SIP-based teleconferencing, online security systems, and location-aided routing in ad hoc networks. The projects cover a wide range of topics related to distributed systems, wireless networks, and Internet applications.
This document lists several Java/J2EE/J2ME projects involving topics like adaptive resource allocation in utility computing, automatic schema matching, fuzzy ontology generation for the semantic web, energy efficient routing in wireless sensor networks, wireless MAC protocols, distributed cache updating, selfish routing in internet-like environments, distributed collaborative key agreement, TCP low priority service, distributed database architecture for global roaming, shortest path finding using GPS navigation, network intrusion detection, honey pots for security, voice over internet protocol, GPS vehicle location tracking, SIP-based teleconferencing, online security systems using motion detection, and location aided routing in ad-hoc networks.
Similar to Labeled generalized stochastic petri net Based approach for web services Composition (20)
Infrastructure Challenges in Scaling RAG with Custom AI modelsZilliz
Building Retrieval-Augmented Generation (RAG) systems with open-source and custom AI models is a complex task. This talk explores the challenges in productionizing RAG systems, including retrieval performance, response synthesis, and evaluation. We’ll discuss how to leverage open-source models like text embeddings, language models, and custom fine-tuned models to enhance RAG performance. Additionally, we’ll cover how BentoML can help orchestrate and scale these AI components efficiently, ensuring seamless deployment and management of RAG systems in the cloud.
Cosa hanno in comune un mattoncino Lego e la backdoor XZ?Speck&Tech
ABSTRACT: A prima vista, un mattoncino Lego e la backdoor XZ potrebbero avere in comune il fatto di essere entrambi blocchi di costruzione, o dipendenze di progetti creativi e software. La realtà è che un mattoncino Lego e il caso della backdoor XZ hanno molto di più di tutto ciò in comune.
Partecipate alla presentazione per immergervi in una storia di interoperabilità, standard e formati aperti, per poi discutere del ruolo importante che i contributori hanno in una comunità open source sostenibile.
BIO: Sostenitrice del software libero e dei formati standard e aperti. È stata un membro attivo dei progetti Fedora e openSUSE e ha co-fondato l'Associazione LibreItalia dove è stata coinvolta in diversi eventi, migrazioni e formazione relativi a LibreOffice. In precedenza ha lavorato a migrazioni e corsi di formazione su LibreOffice per diverse amministrazioni pubbliche e privati. Da gennaio 2020 lavora in SUSE come Software Release Engineer per Uyuni e SUSE Manager e quando non segue la sua passione per i computer e per Geeko coltiva la sua curiosità per l'astronomia (da cui deriva il suo nickname deneb_alpha).
Maruthi Prithivirajan, Head of ASEAN & IN Solution Architecture, Neo4j
Get an inside look at the latest Neo4j innovations that enable relationship-driven intelligence at scale. Learn more about the newest cloud integrations and product enhancements that make Neo4j an essential choice for developers building apps with interconnected data and generative AI.
HCL Notes and Domino License Cost Reduction in the World of DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-and-domino-license-cost-reduction-in-the-world-of-dlau/
The introduction of DLAU and the CCB & CCX licensing model caused quite a stir in the HCL community. As a Notes and Domino customer, you may have faced challenges with unexpected user counts and license costs. You probably have questions on how this new licensing approach works and how to benefit from it. Most importantly, you likely have budget constraints and want to save money where possible. Don’t worry, we can help with all of this!
We’ll show you how to fix common misconfigurations that cause higher-than-expected user counts, and how to identify accounts which you can deactivate to save money. There are also frequent patterns that can cause unnecessary cost, like using a person document instead of a mail-in for shared mailboxes. We’ll provide examples and solutions for those as well. And naturally we’ll explain the new licensing model.
Join HCL Ambassador Marc Thomas in this webinar with a special guest appearance from Franz Walder. It will give you the tools and know-how to stay on top of what is going on with Domino licensing. You will be able lower your cost through an optimized configuration and keep it low going forward.
These topics will be covered
- Reducing license cost by finding and fixing misconfigurations and superfluous accounts
- How do CCB and CCX licenses really work?
- Understanding the DLAU tool and how to best utilize it
- Tips for common problem areas, like team mailboxes, functional/test users, etc
- Practical examples and best practices to implement right away
Building Production Ready Search Pipelines with Spark and MilvusZilliz
Spark is the widely used ETL tool for processing, indexing and ingesting data to serving stack for search. Milvus is the production-ready open-source vector database. In this talk we will show how to use Spark to process unstructured data to extract vector representations, and push the vectors to Milvus vector database for search serving.
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdfPaige Cruz
Monitoring and observability aren’t traditionally found in software curriculums and many of us cobble this knowledge together from whatever vendor or ecosystem we were first introduced to and whatever is a part of your current company’s observability stack.
While the dev and ops silo continues to crumble….many organizations still relegate monitoring & observability as the purview of ops, infra and SRE teams. This is a mistake - achieving a highly observable system requires collaboration up and down the stack.
I, a former op, would like to extend an invitation to all application developers to join the observability party will share these foundational concepts to build on:
AI 101: An Introduction to the Basics and Impact of Artificial IntelligenceIndexBug
Imagine a world where machines not only perform tasks but also learn, adapt, and make decisions. This is the promise of Artificial Intelligence (AI), a technology that's not just enhancing our lives but revolutionizing entire industries.
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...SOFTTECHHUB
The choice of an operating system plays a pivotal role in shaping our computing experience. For decades, Microsoft's Windows has dominated the market, offering a familiar and widely adopted platform for personal and professional use. However, as technological advancements continue to push the boundaries of innovation, alternative operating systems have emerged, challenging the status quo and offering users a fresh perspective on computing.
One such alternative that has garnered significant attention and acclaim is Nitrux Linux 3.5.0, a sleek, powerful, and user-friendly Linux distribution that promises to redefine the way we interact with our devices. With its focus on performance, security, and customization, Nitrux Linux presents a compelling case for those seeking to break free from the constraints of proprietary software and embrace the freedom and flexibility of open-source computing.
For the full video of this presentation, please visit: https://www.edge-ai-vision.com/2024/06/building-and-scaling-ai-applications-with-the-nx-ai-manager-a-presentation-from-network-optix/
Robin van Emden, Senior Director of Data Science at Network Optix, presents the “Building and Scaling AI Applications with the Nx AI Manager,” tutorial at the May 2024 Embedded Vision Summit.
In this presentation, van Emden covers the basics of scaling edge AI solutions using the Nx tool kit. He emphasizes the process of developing AI models and deploying them globally. He also showcases the conversion of AI models and the creation of effective edge AI pipelines, with a focus on pre-processing, model conversion, selecting the appropriate inference engine for the target hardware and post-processing.
van Emden shows how Nx can simplify the developer’s life and facilitate a rapid transition from concept to production-ready applications.He provides valuable insights into developing scalable and efficient edge AI solutions, with a strong focus on practical implementation.
Goodbye Windows 11: Make Way for Nitrux Linux 3.5.0!SOFTTECHHUB
As the digital landscape continually evolves, operating systems play a critical role in shaping user experiences and productivity. The launch of Nitrux Linux 3.5.0 marks a significant milestone, offering a robust alternative to traditional systems such as Windows 11. This article delves into the essence of Nitrux Linux 3.5.0, exploring its unique features, advantages, and how it stands as a compelling choice for both casual users and tech enthusiasts.
UiPath Test Automation using UiPath Test Suite series, part 5DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 5. In this session, we will cover CI/CD with devops.
Topics covered:
CI/CD with in UiPath
End-to-end overview of CI/CD pipeline with Azure devops
Speaker:
Lyndsey Byblow, Test Suite Sales Engineer @ UiPath, Inc.
Sudheer Mechineni, Head of Application Frameworks, Standard Chartered Bank
Discover how Standard Chartered Bank harnessed the power of Neo4j to transform complex data access challenges into a dynamic, scalable graph database solution. This keynote will cover their journey from initial adoption to deploying a fully automated, enterprise-grade causal cluster, highlighting key strategies for modelling organisational changes and ensuring robust disaster recovery. Learn how these innovations have not only enhanced Standard Chartered Bank’s data infrastructure but also positioned them as pioneers in the banking sector’s adoption of graph technology.
Essentials of Automations: The Art of Triggers and Actions in FMESafe Software
In this second installment of our Essentials of Automations webinar series, we’ll explore the landscape of triggers and actions, guiding you through the nuances of authoring and adapting workspaces for seamless automations. Gain an understanding of the full spectrum of triggers and actions available in FME, empowering you to enhance your workspaces for efficient automation.
We’ll kick things off by showcasing the most commonly used event-based triggers, introducing you to various automation workflows like manual triggers, schedules, directory watchers, and more. Plus, see how these elements play out in real scenarios.
Whether you’re tweaking your current setup or building from the ground up, this session will arm you with the tools and insights needed to transform your FME usage into a powerhouse of productivity. Join us to discover effective strategies that simplify complex processes, enhancing your productivity and transforming your data management practices with FME. Let’s turn complexity into clarity and make your workspaces work wonders!
Driving Business Innovation: Latest Generative AI Advancements & Success StorySafe Software
Are you ready to revolutionize how you handle data? Join us for a webinar where we’ll bring you up to speed with the latest advancements in Generative AI technology and discover how leveraging FME with tools from giants like Google Gemini, Amazon, and Microsoft OpenAI can supercharge your workflow efficiency.
During the hour, we’ll take you through:
Guest Speaker Segment with Hannah Barrington: Dive into the world of dynamic real estate marketing with Hannah, the Marketing Manager at Workspace Group. Hear firsthand how their team generates engaging descriptions for thousands of office units by integrating diverse data sources—from PDF floorplans to web pages—using FME transformers, like OpenAIVisionConnector and AnthropicVisionConnector. This use case will show you how GenAI can streamline content creation for marketing across the board.
Ollama Use Case: Learn how Scenario Specialist Dmitri Bagh has utilized Ollama within FME to input data, create custom models, and enhance security protocols. This segment will include demos to illustrate the full capabilities of FME in AI-driven processes.
Custom AI Models: Discover how to leverage FME to build personalized AI models using your data. Whether it’s populating a model with local data for added security or integrating public AI tools, find out how FME facilitates a versatile and secure approach to AI.
We’ll wrap up with a live Q&A session where you can engage with our experts on your specific use cases, and learn more about optimizing your data workflows with AI.
This webinar is ideal for professionals seeking to harness the power of AI within their data management systems while ensuring high levels of customization and security. Whether you're a novice or an expert, gain actionable insights and strategies to elevate your data processes. Join us to see how FME and AI can revolutionize how you work with data!
How to Get CNIC Information System with Paksim Ga.pptxdanishmna97
Pakdata Cf is a groundbreaking system designed to streamline and facilitate access to CNIC information. This innovative platform leverages advanced technology to provide users with efficient and secure access to their CNIC details.
In the rapidly evolving landscape of technologies, XML continues to play a vital role in structuring, storing, and transporting data across diverse systems. The recent advancements in artificial intelligence (AI) present new methodologies for enhancing XML development workflows, introducing efficiency, automation, and intelligent capabilities. This presentation will outline the scope and perspective of utilizing AI in XML development. The potential benefits and the possible pitfalls will be highlighted, providing a balanced view of the subject.
We will explore the capabilities of AI in understanding XML markup languages and autonomously creating structured XML content. Additionally, we will examine the capacity of AI to enrich plain text with appropriate XML markup. Practical examples and methodological guidelines will be provided to elucidate how AI can be effectively prompted to interpret and generate accurate XML markup.
Further emphasis will be placed on the role of AI in developing XSLT, or schemas such as XSD and Schematron. We will address the techniques and strategies adopted to create prompts for generating code, explaining code, or refactoring the code, and the results achieved.
The discussion will extend to how AI can be used to transform XML content. In particular, the focus will be on the use of AI XPath extension functions in XSLT, Schematron, Schematron Quick Fixes, or for XML content refactoring.
The presentation aims to deliver a comprehensive overview of AI usage in XML development, providing attendees with the necessary knowledge to make informed decisions. Whether you’re at the early stages of adopting AI or considering integrating it in advanced XML development, this presentation will cover all levels of expertise.
By highlighting the potential advantages and challenges of integrating AI with XML development tools and languages, the presentation seeks to inspire thoughtful conversation around the future of XML development. We’ll not only delve into the technical aspects of AI-powered XML development but also discuss practical implications and possible future directions.
Programming Foundation Models with DSPy - Meetup SlidesZilliz
Prompting language models is hard, while programming language models is easy. In this talk, I will discuss the state-of-the-art framework DSPy for programming foundation models with its powerful optimizers and runtime constraint system.
Programming Foundation Models with DSPy - Meetup Slides
Labeled generalized stochastic petri net Based approach for web services Composition
1. International Journal of Computer Science & Information Technology (IJCSIT) Vol 5, No 3, June 2013
DOI : 10.5121/ijcsit.2013.5312 151
LABELED GENERALIZED STOCHASTIC PETRI NET
BASED APPROACH FOR WEB SERVICES
COMPOSITION
Sofiane Chemaa1
, Mouna Bouarioua2
and Allaoua chaoui3
MISC Laboratory, Department of Computer Science and its applications, University of
Constantine 2,Constantine, Algeria
1
chemaa@misc-umc.org
2
bouarioua@misc-umc.org
3
a_chaoui2001@yahoo.com
ABSTRACT
A Web Service is a component written in any language, deployed on any platform, which has a standard
wrapping layer based on XML.The component can interact with other applications which themselves
comply with the Web Services standards. Generally, a single service does not satisfy the users needs that
are more and more complex. Therefore, services must be made able to becomposed to build new value
added services. This process is called Web services Composition. This latter is a critical subject that
requires formal techniques for its completion. In this paper, we show how basic and existent services can
be composed to create a composite service which offers a new functionality. In this context, we propose an
expressive Labeled generalized stochastic Petri net based algebra that succeeds in the complex Web
services composition. Basic and advanced constructs which are supported by the proposed algebra are
syntactically and semantically defined.
KEYWORDS
Web Services, Web services composition, LGSPN, Algebra, formal techniques.
1. INTRODUCTION
Nowadays, web services present a new vision of the provision of software components for
information systems. The concept of Web service essentially refers to an application made
available on Internet by a service provider and accessible by clients through standard Internet
protocols such asSimple Object Access Protocol (SOAP) [1], Universal Description, Discovery
and Integration (UDDI) [2], and Web Service Description Language (WSDL) [3].The
composition of Web services is a natural evolution of this technology and has enormous potential
in reorganizing business-to-business or enterprise application integration. Current technologies
based on WSDL, UDDI and SOAP offer solutions for description, publication, discovery and
interoperability of Web services; but do not accomplish their complex composition that remains a
very complex task, and requires formal techniques for its accomplishment.
In this paper we address the Web service composition problem using a Petri net based framework
called Labeled Generalized Stochastic Petri Net (LGSPN) [4]. Compared to other approaches,
this concept offer efficient and powerful mechanisms for complex systems modeling which are
not supported even by high level Petri nets. In this context, we propose a LGSPN based algebra
for composing Web services that successfully solves complex composition. The proposed
2. International Journal of Computer Science & Information Technology (IJCSIT) Vol 5, No 3, June 2013
152
approach provides not only a formalism to describe Web services structure and behavior but also
a representative set of operators presented by means of syntax, semantics and the resulting
composite service. The choice of the LGSPN models is justified by many reasons. For example:
• The use of visual modeling techniques such as LGSPN in the design of complex Web
services helps us to easily understand the modeled services.
• The modeling based on LGSPN allows the specification and prototyping of complex Web
services with taking into account the time constraints.
• LGSPNs provide a formalism that allows the construction of models that can be used for
behavioral analyses based on the classical theory of Petri nets, and also for Performance
analyses based on the time specifications and the probabilistic models.
The remainder of this paper is organized as follows. Web service modeling and specification
using LGSPN are presented in Section 2. An expressive algebra that permits to compose Web
services modeled with LGSPNs is given in Section 3. In Section 4, we give a brief overview of
some related work. Finally, we discuss in Section 5 some prospects and work in progress.
2. Web services as Labeled generalized stochastic Petri nets
A Petri net (PN) [5] isa graphical and mathematical modeling tool. This is a directed bipartite
graph with two types of nodes: places are represented by circles and transitions are represented by
rectangles. The arcs of the graph connect places and transitions in such a way that places can only
be connected to transitions and vice versa. Places in a Petri net may contain a discrete number of
tokens. The distribution of tokens over the places is called a marking.
When Carl Adam Petri has introduced Petri nets in his thesis for the first time, they had served to
describe concurrent systems in terms of cause / effect relations without considering the notion of
time. The introduction of temporal concepts into Petri nets was proposed several years later by
other researchers. The transition firing is the result of either a logical condition becoming true in
the system, or the achievement of an activity. The latter interpretation is the reason for associating
timing with transitions. The resulting paradigm from the introduction of temporal concepts into
classical PN is a sub model called stochastic Petri nets (SPN) [4]. When stochastic timing is
mixed with deterministic null delays, we obtain generalized stochastic Petri net models (GSPN).
In the case where each transition is labeled, the model is called labeled generalized stochastic
Petri nets (LGSPN). For more details about the LGSPN, the reader is referred to [4] and [6].
Web services are assimilated to a distributed system; that consists of a set of loosely coupled
modules, which communicate through messages exchange. The behavior of a web service is
defined by a set of operations. Thus, modeling Web services using LGSPN is straightforward.
Every operation in the service is modeled by a transition; the state of the web service is modeled
by the position of tokens in the LGSPN and the arrows between places and transitions are used to
specify causal relations.
In the following, we give some formal definitions about LGSPN-Service and Web service.
2.1. LGSPN-Service
To simplify and facilitate the web services modeling using LGSPN models, we have made some
modifications to the LGSPN notation defined in [6]. As a result we present the LGSPN-Service
Models.
3. International Journal of Computer Science & Information Technology (IJCSIT) Vol 5, No 3, June 2013
153
A LGSPN-Service is an 11-tuple − = ( , , , , , , , , , , ) where:
• is a finite and non-empty set of places.
• = ∪ is a finite set of transitions where: IT is a set of immediate transitions
denoted by a black rectangle. TT is a set of timed transitions denoted by an empty
rectangle.
• : → ℕis the priority function. It associates a priority level to each transition.
Let ∈ , ( ) = 0 if .type = TT and ( ) > 0 if .type = IT. (i.e. the firing of an
immediate transition has priority over the firing of a timed transition).
• , , : → ( ) | ( ) ⊆ are the input, output, and inhibition functions.
• : → ℝ is a function defined on the set of transition. W allows the definition of the
stochastic process associated with the model.
• is the initial marking of the LGSPN-Service.
• is the input place with ● = { ∈ T| ∈ ( ) } = Ø.
• ois the output place with ●= { ∈ T| ∈ ( )} = Ø.
• ∶ → ∪ { }is a labeling function where is a set of operation names and is a
silent operation (unobservable operation). In this work, we have modeled a silent
transition ( ) by an immediate transition with ( ) = | ∈ ℕ∗
and ( ) = | ∈
ℝ .
In figure 1(a), we propose an example that illustrates the principle of LGSPN-Service models.
The service reproduces the behavior of a translation system. After reading an English text, the
system activates two other local processes in parallel. The first process allows to translate the text
in French. The other process enables the translation of the same text in Spanish. Once the two
translations are completed, a correctness check process is activated.
In this example we have 4 temporal transitions (t1, t3, t4, t5) and an immediate transition (t2).
This latter represents the action of the activation of the two translation processes in parallel. This
action is modeled by an immediate transition because its execution time is negligible.
4. International Journal of Computer Science & Information Technology (IJCSIT) Vol 5, No 3, June 2013
154
Figure 1. LGSPN-Service Example (a); Services S1,S2,S3 (b)
2.2. Web Service
A Web service is a tuple [7] where:
• NameS is the name of the service used as its unique identifier.
• Desc is the description of the provided service. It summarizes what functionalities the
service offers.
• Loc is the server in which the service is located.
• URL is the invocation of the Web service.
• CS is a set of the component services of the Web service, if CS = {NameS} then S is a
basic service, otherwise S is a Composite service.
• is the LGSPN-Service modeling the dynamic behavior of the service.
In the next section, we propose an algebra that permits to incrementally compose existing web
services modeled byLGSPNs. The aim is to create a new composite service that provides new
functionalities.
3. Web services Composition
Web services as presented, are components, conceptually limited, with relatively simple
functionalities, which are modeled by a set of operations [8]. Given two or more Web services,
each with a specific task,they sometimes cooperate in order to achieve a new task.This will result
in a new value added service. For example aservice of hotel booking can collaborate with a Web
mappingservice like Google Maps API to show the location of hotels tothe customers. The
(b)
1
..
...
...
....
…
i1
te
ts
2
.....
..
…
t1
o2
S2
o3
i3
..
...
...
....
…
t
1
tw
S3
5. International Journal of Computer Science & Information Technology (IJCSIT) Vol 5, No 3, June 2013
155
collaboration of these services generates acomposed Web service which performs the original
individualtasks as well as a new one.
In this section we present an algebra that combines existing Web services for building more
complex ones. We will take Sequence, Parallel, Alternative, Iteration and Arbitrary Sequence as
basicconstructs. Moreover, two more developed constructs which are Discriminator and
refinement are defined. After that, each operator formal semantics in terms of LGSPN-Service is
given.
3.1. LGSPN-Service based algebra
The BNF-like notation below describes a grammar defining the set of services that can be
generated using algebra’s operators.
S:: = ε | X | S► S | S◄►S | ↺ S | S ⇔ S | S//S | (S ⊡ S) ≫ S | ( , , ).
Let = ( , , , , , )
with = ( , , , , , , , , , ) for i = 1...3 be three Web Services such that
∩ = Ø and ∩ = Ø for ≠ .
Empty Service ( ): The empty service ε is a service that performs no operation. It is used for
technical and theoretical reasons.
Definition 1 The Empty service is defined as ε = ( , , , , , )
where:
= Empty.
= “Empty Web Service”.
= Null, stating that there is no server for the service.
= Null, stating that there is no invocation for the service.
= {Empty}
= ( , Ø, Ø, Ø, Ø, Ø, Ø, Ø, , , Ø).
In Figure 2(a), we show the graphic representation of the empty service (ε) in terms of LGSPN-
Service.
6. International Journal of Computer Science & Information Technology (IJCSIT) Vol 5, No 3, June 2013
156
Figure 2. Empty Service(a); Sequence Service (b); Alternative Service (c)
Sequence (►):The sequence operator permitsto execute two services successively. This operator
can be used in the case where a service depends on the execution results of another service. For
example, in an online purchase operation, the service "Order" must be executed before the
service "Payment".
Definition 2 The serviceS ►S is defined asS ►S = ( , , , , ,
) where:
= ∪
= ( , , , , , , , , , , ) where:
= ∪ , = ∪ ∪ { }, = ∪ ∪ {( , )| ∈ ℕ∗}, = ∪ ∪ {( , )},
= ∪ ∪ {( , )}, = ∪ , = ∪ ∪ {( , )| ∈ ℝ },
= ∪ , = , = , = ∪ ∪ {( , τ)}.
Given the two services and shown in Figure 1(b), the composite serviceS ►S is
represented by the LGSPN-Service shown in Figure 2(b).
Alternative (◄►): Given two services and , the alternative operator reproduces either the
behavior of or , but not both. This operator is also called “choice operator”.
ɛ
(a)
...
...
...
...
…
o1
i1
te
ts
i2
...
...
...
…
t1
o2
st1
(b)
st2
i
...
...
...
...
…
o1
i1
te
i2
...
...
...
…
t1
o2
st1
st4st3
o
(c)
7. International Journal of Computer Science & Information Technology (IJCSIT) Vol 5, No 3, June 2013
157
Definition 3 The service S ◄►S is defined asS ◄►S = ( , , , ,
, ) where:
= ∪
= ( , , , , , , , , , , ) where:
= ∪ ∪ { , }, = ∪ ∪ { , , , } , = ∪ ∪ {( , ),
( , ), ( , ), ( , )}, = ∪ ∪ {( , ), ( , ), ( , ), ( , )},
= ∪ ∪ {( , ), ( , ), ( , ), ( , ) }, = ∪ , =
∪ ∪ {( , ), ( , ), ( , ), ( , )| , , , ∈ ℝ }, = ∪ ,
= ∪ ∪ {( , τ), ( , τ), ( , τ), ( , τ)}
Given the two services and shown in Figure 1(b), the composite service S ◄►S is
represented by the LGSPN-Service shown in Figure 2(c).
Figure 3. Iteration Service(a); Arbitrary Sequence Service (b); Parallel Service (c)
Iteration (↺): The iteration operator allows the service S to be performed a certain number of
times in a row. For example, this operator can be used in the case where a client performs several
successive orders.
Definition 4 The service ↺ is defined as ↺ = ( , , , , , )
where:
=
= ( , , , , , , , , , , ) where:
= ∪ { , }, = ∪ { , , } , = ∪ {( , ), ( , ), ( , )},
= ∪ {( , ), ( , ), ( , )}, = ∪ {( , ), ( , ), ( , ) },
8. International Journal of Computer Science & Information Technology (IJCSIT) Vol 5, No 3, June 2013
158
= , = ∪ {( , ), ( , ), ( , )| , , ∈ ℝ }, = ,
= ∪ {( , τ), ( , τ), ( , τ)}
If we consider the service shown in Figure 1(b), the composite service ↺ is represented by
the LGSPN-Service shown in Figure 3(a).
Arbitrary Sequence (⟺):Given two services and , the Arbitrary Sequence operator builds
thecomposite service ((S ►S )◄► (S ►S )). The latter is useful when the services execution
order is not important and there are no benefits to execute services in parallel.
Definition 5 The service S ⟺ S is defined as S ⟺ S = ( , , , , ,
) where:
= ∪
= ( , , , , , , , , , , ) where:
= ∪ ∪ { , , , , , , }, = ∪ ∪ { , , , , , } ,
= ∪ ∪ {( , ), ( , ), ( , ), ( , ), ( , ), ( , )}, = ∪ ∪
{( , ), ( , ), ( , ), ( , ), ( , ), ( , ), ( , ), ( , ), ( , ),
( , )}, = ∪ ∪ {( , ), ( , ), ( , ), ( , ), ( , ), ( , ),
( , ), ( , ), ( , ), ( , )}, = ∪ , = ∪ ∪ {( , ), ( , ),
( , ), ( , ), ( , ), ( , )| , , , , , ∈ ℝ}, = ∪ , = ∪
∪ {( , τ), ( , τ), ( , τ), ( , τ) ( , τ) ( , τ)}
Given the two services and shown in Figure 1(b), the composite service S ⟺S is
represented by the LGSPN-Service shown in Figure 3(b).
Parallel (//): Given two services and , the parallel operator builds a composite service
performing the two services ( and ) in parallel. The accomplishment of the resulting service is
achieved when the two services are completed.
Definition 6 The service S //S is defined as S //S = ( , , , , ,
) where:
= ∪
= ( , , , , , , , , , , ) where:
= ∪ ∪ { , }, = ∪ ∪ { , } , = ∪ ∪ {( , ), ( , )},
= ∪ ∪ {( , ), ( , ), ( , )}, = ∪ ∪ {( , ), ( , ), ( , )},
= ∪ , = ∪ ∪ {( , ), ( , )| , ∈ ℝ }, = ∪ ,
= ∪ ∪ {( , τ), ( , τ)}
Given the two services and shown in Figure 1(b), the composite service S //S is
represented by the LGSPN-Service shown in Figure 3(c).
9. International Journal of Computer Science & Information Technology (IJCSIT) Vol 5, No 3, June 2013
159
Figure 4. Discriminator Service (a); An abstract exampleof Refinement (b)
Discriminator ((⊡) ≫):The discriminator operator allows tosolicit different services that
perform the same task. The first service that responds activates another service. The other late
responses will be ignored. The discriminator operator allows to benefit from services that respond
in optimal time.
Definition 7 The service (S ⊡ S ) ≫ S is defined as(S ⊡ S ) ≫ S = ( , , ,
, , ) where:
= ∪ ∪
= ( , , , , , , , , , , ) where:
st1
i
....
...
...
..
…
o1o1
i1S
te
i2i
....
...
....
…
t1
o2
st3st2
np1
st4
o3
i3
....
...
...
..
…
t
1
tw
st5
o
np2
(a)
(B
)iB
oB
tB1 tB2
tB3
a
(S1)
...
...
…
o1
i1
te
ps
...
t1
tm tu
S==Ref (S1, a, B)
i1
ps
tB1 tB2
tB3
t1 ...
...
o1
...
tm tu
...
(b)
10. International Journal of Computer Science & Information Technology (IJCSIT) Vol 5, No 3, June 2013
160
= ∪ ∪ ∪ { , , , }, = ∪ ∪ ∪ { , , , , } ,
= ∪ ∪ ∪ {( , 1), ( , 2), ( , 3), ( , 4), ( , 5), }, = ∪ ∪
∪ {( , ), ( , ), ( , ), ( , ), ( , ), ( , ), ( , )}, = ∪
∪ ∪ {( , ), ( , ), ( , ), ( , ), ( , ), ( , ), ( , )}, = ∪
∪ , = ∪ ∪ ∪ {( , ), ( , ), ( , ), ( , ), ( , )| , ,
, , ∈ ℝ}, = ∪ ∪ , = ∪ ∪ ∪ {( , τ), ( , τ), ( , τ),
( , τ) ( , τ)}
Given the services , and shown in Figure 1(b), the composite service (S ⊡ S ) ≫ S is
represented by the LGSPN-Service shown in Figure 4(a).
Refinement ( ):The refinement operator allows to modify certain service operations and to
replace them by other more detailed operations. This operator allows to change the service
abstraction level from a high level to a lower level more concrete.
Definition 8 The service Re ( , , ) is defined as ( , , ) = ( , , ,
, , ) where:
Figure 4(b) shows an abstract example of a refined service.
, , , , , ∈ ℕ∗
and , , , , , ∈ ℝ.
The proposed algebra verifies the closure property. This latter ensures that the product of any
operation on services is itself a service to which we can apply algebra operators.
4. Related work
During the past years, several approaches for Web service composition have been suggested in
literature. All of these propositions try to provide languages, semantic models, and platforms in
order to propose efficient solutions for this problem.
Composition languages, such as BPEL [9] consist to provide a set of primitives that allows
interaction between services being composed. Regrettably, it comes to textual and executable
languages designed to satisfy the composite web service implementation phase that neglects,
actually, the specification step, which is important, because it facilitates the global
11. International Journal of Computer Science & Information Technology (IJCSIT) Vol 5, No 3, June 2013
161
comprehension of the system, and the development task. Furthermore, since they lack of the
formalism, the formal analysis of the proposed languages is impossible.
Many researches are devoted to the modeling and the composition of web services. Most of these
works provide models expressed in different formalisms.
In [10], Reiko Heckel, and Marc Lohmann have proposed to use the notion of contracts. The last
mentioned refer to graph transformation rules. They are characterized by the assertions
expressing the providers, or the customers’ rights and duties. In addition, this approach uses the
UML notions [11], signatures, and data models to add the behavioral information for the services
web specification. The graph transformation rules have ability, to bring advanced operational
interpretations that cannot be expressed with simple logical expressions,This approach has some
limitations when it comes to a web services complex composition.
Process algebras are a mathematical formalism for describing and studying the concurrent
systems. Several researchers have used different process algebras to specify and compose web
services. For example, Brogi et al. [12] have proposed a formalization technique based on CCS,
for the choreography of web services. In [13], semantics of the orchestration language BPEL is,
this time, specified by using pi-calculus. Nevertheless, this work does not deal with some parts of
BPEL, such as data management; and this is not surprising, because pi-calculus does not allow
data manipulation.
IN [14], the authors have proposed an approach that allows the composite web
servicedevelopment following MDA principles using UML 1.4 as a modeling means. [15] has
used the same idea; this work is based on UML 2.0. However, the authors have pointed out that
the model is not expressive enough. Besides, it is worth to note that UML is a semi-formal
language.
In the field of the formal systems specification, automata are very recognized models. The use of
automata for web services modeling and composition has been suggested by several researchers.
The Columbo model [16], which is based on FSA (Finite State Automata), is one of these
approaches. In [17], Fan et al. have proposed to model the web services using the AFA
(Alternating finite automata). An interaction with the developer to provide, in advance, a detailed
specification of the composite service, is required by these approaches. The use of DFSA
(deterministic finite state automata) is proposed by the authors, in [18], to solve this problem. In
this approach, the developers only define the exactness constraints on the composition. The
behavior of the composite service is automatically synthesized. The use of input output automata
(I/O automata) for modeling the web services composition, has been suggested by Mitra et al., in
[19].
Actually, the disadvantage of using automata is that the competition modeling is not allowed by
their semantics. A solution for this problem has been proposed by Yan and Dague, in [20], the
idea is to model each parallel execution branch by independent automaton, and define events to
realize their interconnection; but, unfortunately, this requires the input and the output state
duplication in each parallel branch.
Concerning Petri-nets, a complete translation of BPEL in Petri-nets has been presented by
Onyang et al., in [21]. Moreover, the ability of the last mentioned in modeling the web services
composition has also been demonstrated by them. Similarly to [7], our approach is a Petri Net
based framework for Web services composition. [7] proposed a Petri Net Algebra. Its model is
enough expressive, but the data types cannot be distinguishable, because an elementary Petri net
model is used. The work of [22] also deals with this problem, by modeling Web services and their
composition using Colored Petri nets [23]. The proposal of [24] is also based on modeling the
process of Web service composition by a kind of Object-Oriented Petri Nets. However, our
12. International Journal of Computer Science & Information Technology (IJCSIT) Vol 5, No 3, June 2013
162
approach is formally defined and is based on a well-founded framework namely LGSPN. In [25]
the authors have proposed an approach for modeling and composition of web services using G-
Nets, which are a kind of high-level Petri nets. The main advantage of our approach compared to
[7], [22],[24] and [25], is the fact that the model used in our work takes into account the time
constraints.LGSPNs are models that can be used for behavioral analyses based on the
classical theory of Petri nets, and also for Performance analyses based on the time
specifications and the probabilistic models.
Ontology-driven approaches for Web services composition like OWL-S [26], SAWSDL [27] and
[28] use terms from preagreed ontologies to declare preconditions and effects of the concerned
services. In the two first works, the inputs and outputs are expressed by concepts, while [28]
describes them in terms of instance-based graph patterns. If these approaches present the
advantage of clearly understanding the meaning of the messages, their main drawback remains
the difficulty to discover the explicit goal of the services. This latter constitutes a key element
when composing by AI planners [29].
5. Conclusion
In this paper, we have presented a simple yet powerful approach, which offers solutions
for both modeling web services and composing them. This approach has the major
advantage of benefiting from the formal aspect of Labeled Generalized Stochastic Petri
Nets (LGSPN). Indeed, modeling based on LGSPN allows the specification and
prototyping of complex Web serviceswith taking into account the time constraints. A
LGSPN-Servicebased algebra for Web service composition is developed. In this vein, we
define the formal semantics of the composition operators by means of LGSPN-Service.
Using this underlying framework provides a rigorous approach to verify the properties
and detect inconsistencies between web services.
In a future work, we plan to extend our approach with advanced operators that can
support more complex Web service combination. Another perspective of our work is to
develop a Java prototype tool implementing the introduced operators. We may also use
reduction techniques to optimize the models before the analysis and the verification of
certain properties by using appropriate tools such as GreatSPN [30].
REFERENCES
[1] D. Box, D. Ehnebuske, G. Kakivaya, A. Layman, N. Mendelsohn, H. F. Nielsen, S. Thatte, and D.
Winer, “Simple object access protocol (soap) 1.1”, May 2000, [Online].
Available:http://www.w3.org/TR/2000/NOTE-SOAP-20000508/
[2] F. Curbera, M. Duftler, R. Khalaf, W. Nagy, N. Mukhi, and S. Weerawarana, “Unraveling the web
services web an introduction to soap, wsdl, and uddi”, IEEE INTERNET COMPUTING, pp. 86-93,
Mar./Apr.2002
[3] E. Christensen, F. Curbera, G. Meredith, and S. Weerawarana, “Web services description
language (wsdl) 1.1”, Mar 2001, [Online]. Available: http://www.w3.org/TR/wsdl.
[4] M. AjmoneMarsan, G. Balbo, G. Conte, S. Donatelli and G. Franceschinis, “AnIntroduction to
generalized stochastic Petri nets”, In International Journal of Microelectronics and reliability: Special
issue on Petri nets and related graph models, Vol. 31(4), pp 699-725, Pergamon Press,1991.
[5] C. A. Petri, “Kommunikationmitautomaten (in german)”, Ph.D. dissertation, University of Bonn,
Germany, 1962.
[6] M. AjmoneMarsan, G. Balbo, G. Conte, S. Donatelli and G. Franceschinis, “Modeling with
generalized stochastic Petri nets”, In J. Wiley, 1995.
[7] R. Hamadi and B. Benatallah, “A Petri net based-model for web service composition”, in proc. the
14th Australasian database conference, adelaide. Darlinghurst: Australian
13. International Journal of Computer Science & Information Technology (IJCSIT) Vol 5, No 3, June 2013
163
[8] T. MELLITI, “Interopérabilité des services Web complexes. Application aux systèmes multi-agents
(in french)”, Ph.D. dissertation, University Paris IX Dauphine 2004.
[9] F. Curbera, Y. Goland, J. Klein, F. Leymann, D. Roller, S. Thatte, and S.Weerawarana, “Business
Process Execution Language for Web Service (BPEL4WS) 1.0”, Published on the World Wide Web
by BEA Corp, IBM Corp and Microsoft Corp, Aug 2002.
[10] R. Heckel and M. Lohmann, “Towards contract based testing of web service”, in Electronic Notes in
Theoretical Computer Science 116, (2005), pp. 145–156.
[11] S. Thӧne, R. Depke, and G. Engels, Process- oriented, flexible composition of web services with
uml, in Proc. the Joint Workshop on Conceptual Modeling Approaches for e-Business (eCOMO),
2002.
[12] A. Brogi, C. Canal, E. Pimentel, and A. Vallecillo, Formalizing web service choreographies, Electron.
Notes Theor. Comput. Sci., 105 (2004), pp. 73–94.
[13] R. Lucchi and M.Mazzara, A pi-calculus based semantics for ws-bpel, Journal of Logic and Algebraic
Programming, 70 (2007), pp. 96–118.
[14] R. Grөnmo and I. Solheim, Towards modeling web service composition in uml, in Proc. 2nd
International Workshop on Web Services Modeling, Architecture and Infrastructure (WSMAI-2004),
2004, pp. 72–86.
[15] V. De Castro, E. Marcos, and M. L. Sanz, Service composition modeling: A case study, in Proc. the
Seventh Mexican International Conference on Computer Science (ENC 06), San Luis Potosi, Mexico,
Sep 2006, pp. 101–1081.
[16] D. Berardi, D. Calvanese, G. De Giacomo, R. Hull, and M. Mecella, Automatic composition of
transition-based semantic web services with messaging, in Proc. the 31st international conference on
Very large data bases (VLDB 05), 2005, pp. 613–624.
[17] W. Fan, F. Geerts, W. Gelade, F. Neven, and A. Poggi, Complexity and composition of synthesized
web services, in Proc. the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on
Principles of database systems (POD08), New York, NY, USA, 2008, pp. 231–240.
[18] J. P. Huai, T. Deng, X. X. Li, Z. X. Du, and H. P. Guo, Autosyn: A new approach to automated
synthesis of composite web services with correctness guarantee, Science in China Series F, 59,
Number 9 (2009), pp. 1534–1549.
[19] S. Mitra, R. Kumar, and S. Basu, Automated choreographer synthesis for web services composition
using i/o automata, in Proc. IEEE International Conference Web Services (ICWS 2007), Jul 2007, pp.
364–371.
[20] Y. Yan and P. Dague, Modeling and diagnosing orchestrated web service processes, in Proc. IEEE
International Conferenceon Web Services (ICWS 2007), Jul 2007, pp. 51–59.
[21] C. Ouyang, E. Verbeek, W. M. P. van der Aalst, S. Breutel, M. Dumas, and A. H. M. terHofstede,
Formal semantics and analysis of control flow in ws-bpel, Science of Computer Programming, 67,
Number 2-3 (2007), pp. 162–198.
[22] Z. Zhang, F. hong, and H. xiao, A colored petri net-based model for web service composition, Journal
of Shanghai University (English Edition), 12, Number 4 (2008), pp. 323–329.
[23] K. Jensen, Coloured petri nets- a high level language for system design and analysis, in Lecture Notes
in Computer Science 483. Advances in Petri Nets 1990 Springer-verlag, 1990.
[24] X. Feng, Q. Liu, and Z.Wang, A web service composition modeling and evaluation method used petri
net, in Proc. APWebWorkshops, 2006,pp. 905–911.
[25] S. Chemaa, f. Bachtarzi, and A. Chaoui, A high-level petri net based approach for modeling and
composition of web services, in Proc. the International Conference on Computational Science (ICCS
2012), Procedia Computer Science, vol. 9, 2012, pp. 469–478, Elsevier.
[26] D. Martin, M. Burstein, J. Hobbs and al, “Owl-s: Semantic markup for web services”, [Online].
Available: http://www.w3.org/Submission/OWL-S/.
[27] R. Akkiraju and B. Sapkota, “Semantic annotations for wsdl and xml schema usage guide”, (2007),
[Online]. Available: http://www.w3.org/TR/sawsdl-guide/.
[28] Z. Liu, A. Ranganathan, and A. Riabov, “Modeling web services using semantic graph
transformations to aid automatic composition”, in IEEE International Conference on Web Services
(ICWS 2007), Salt Lake City, Utah, Jul.13-19, 2007.
[29] B. Srivastava and J. Koehler, “Web service composition current solutions and open problems”, in
ICAPS 2003 workshop on Planning for Web Services, Jul.22, 2003.
[30] G. Chiola. “GreatSPN 1.5 software architecture”. In Proc. 5th Int. Conf. Modeling Techniques and
Tools for Computer Performance Evaluation, Torino, Italy, February 1991.