Message Correlation and Business Protocol Discovery in Service Interaction Logs
Identifieur interne : 000921 ( Istex/Curation ); précédent : 000920; suivant : 000922Message Correlation and Business Protocol Discovery in Service Interaction Logs
Auteurs : Belkacem Serrour [France] ; Daniel P. Gasparotto [France] ; Hamamache Kheddouci [France] ; Boualem Benatallah [Australie]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2008.
Descripteurs français
- Wicri :
- topic : Protocole.
English descriptors
- KwdEn :
- Algorithm, Business protocol, Business protocol discovery, Business protocols, Conversation abcde, Conversation candidate, Conversation logs, Data engineering, Data mining, Final states machine, Focal elements, Graph theory techniques, Highest value, Ieee transactions, Infrequent edges, Initial message, Initial message type, Initial node, Initial state, Logging infrastructure, Mathematical theory, Message correlation, Message graph, Message graphs, Message logs, Message type, Nite automaton, Node, Other attrib, Possible conversations, Protocol, Protocol discovery, Protocol discovery algorithm, Protocol execution, Random interruption, Right node, Self loops, Serrour, Service interaction logs, Several advantages, Small message graph, Subset algorithm, Synthetic logs, Technical report, Uncommitted belief, Unknown meaning, Weight degree.
- Teeft :
- Algorithm, Business protocol, Business protocol discovery, Business protocols, Conversation abcde, Conversation candidate, Conversation logs, Data engineering, Data mining, Final states machine, Focal elements, Graph theory techniques, Highest value, Ieee transactions, Infrequent edges, Initial message, Initial message type, Initial node, Initial state, Logging infrastructure, Mathematical theory, Message correlation, Message graph, Message graphs, Message logs, Message type, Nite automaton, Node, Other attrib, Possible conversations, Protocol, Protocol discovery, Protocol discovery algorithm, Protocol execution, Random interruption, Right node, Self loops, Serrour, Service interaction logs, Several advantages, Small message graph, Subset algorithm, Synthetic logs, Technical report, Uncommitted belief, Unknown meaning, Weight degree.
Abstract
Abstract: The problem of discovering protocols and business processes based on the analysis of log files is a real challenge. The behavior of a Web service can be specified using a Business Protocol, hence the importance of this discovery. The construction of the Business Protocol begins by correlating the logged messages into their conversations (i.e. instances of the business protocol). The accomplishment of this task is easy if we assume that the logs contain the right identifiers, which would allow us to associate every message to a conversation. But in real-world situations, this kind of information rarely exists inside the log files. Our work consists in correlating the messages present in Web service logs into the conversations they belong to, and then generating automatically the Business Protocol that reflects the messaging behavior perceived in the log. Contrary to other approaches, we do not assume the existence of a conversation identifier. We first model logged message relations using graphs and then we use graph theory techniques to extract the conversations and finally the Business Protocol. Logs are often incomplete and contain errors. This induces some uncertainty on the results. To address this problem, we apply the Dempster-Shafer theory of evidence. Our approach is implemented and tested using synthetic logs.
Url:
DOI: 10.1007/978-3-540-69534-9_31
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000921
Links to Exploration step
ISTEX:2FC89F938727257950B89C70DEF4C147858F0262Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Message Correlation and Business Protocol Discovery in Service Interaction Logs</title>
<author><name sortKey="Serrour, Belkacem" sort="Serrour, Belkacem" uniqKey="Serrour B" first="Belkacem" last="Serrour">Belkacem Serrour</name>
<affiliation wicri:level="1"><mods:affiliation>Université de Lyon, Laboratoire LIESP, Bât. Nautibus (ex 710), 43, Bd. du 11 novembre 1918, 69622, Villeurbanne Cedex, France</mods:affiliation>
<country xml:lang="fr">France</country>
<wicri:regionArea>Université de Lyon, Laboratoire LIESP, Bât. Nautibus (ex 710), 43, Bd. du 11 novembre 1918, 69622, Villeurbanne Cedex</wicri:regionArea>
</affiliation>
<affiliation wicri:level="1"><mods:affiliation>E-mail: bserrour@bat710.univ-lyon1.fr</mods:affiliation>
<country wicri:rule="url">France</country>
</affiliation>
</author>
<author><name sortKey="Gasparotto, Daniel P" sort="Gasparotto, Daniel P" uniqKey="Gasparotto D" first="Daniel P." last="Gasparotto">Daniel P. Gasparotto</name>
<affiliation wicri:level="1"><mods:affiliation>Université de Lyon, Laboratoire LIESP, Bât. Nautibus (ex 710), 43, Bd. du 11 novembre 1918, 69622, Villeurbanne Cedex, France</mods:affiliation>
<country xml:lang="fr">France</country>
<wicri:regionArea>Université de Lyon, Laboratoire LIESP, Bât. Nautibus (ex 710), 43, Bd. du 11 novembre 1918, 69622, Villeurbanne Cedex</wicri:regionArea>
</affiliation>
<affiliation><mods:affiliation>E-mail: daniel.gasparotto@gmail.com</mods:affiliation>
<wicri:noCountry code="no comma">E-mail: daniel.gasparotto@gmail.com</wicri:noCountry>
</affiliation>
</author>
<author><name sortKey="Kheddouci, Hamamache" sort="Kheddouci, Hamamache" uniqKey="Kheddouci H" first="Hamamache" last="Kheddouci">Hamamache Kheddouci</name>
<affiliation wicri:level="1"><mods:affiliation>Université de Lyon, Laboratoire LIESP, Bât. Nautibus (ex 710), 43, Bd. du 11 novembre 1918, 69622, Villeurbanne Cedex, France</mods:affiliation>
<country xml:lang="fr">France</country>
<wicri:regionArea>Université de Lyon, Laboratoire LIESP, Bât. Nautibus (ex 710), 43, Bd. du 11 novembre 1918, 69622, Villeurbanne Cedex</wicri:regionArea>
</affiliation>
<affiliation wicri:level="1"><mods:affiliation>E-mail: hkheddou@bat710.univ-lyon1.fr</mods:affiliation>
<country wicri:rule="url">France</country>
</affiliation>
</author>
<author><name sortKey="Benatallah, Boualem" sort="Benatallah, Boualem" uniqKey="Benatallah B" first="Boualem" last="Benatallah">Boualem Benatallah</name>
<affiliation wicri:level="1"><mods:affiliation>CSE, UNSW, NSW 2052, Sedney, Australia</mods:affiliation>
<country xml:lang="fr">Australie</country>
<wicri:regionArea>CSE, UNSW, NSW 2052, Sedney</wicri:regionArea>
</affiliation>
<affiliation wicri:level="1"><mods:affiliation>E-mail: boualem@cse.unsw.edu.au</mods:affiliation>
<country wicri:rule="url">Australie</country>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:2FC89F938727257950B89C70DEF4C147858F0262</idno>
<date when="2008" year="2008">2008</date>
<idno type="doi">10.1007/978-3-540-69534-9_31</idno>
<idno type="url">https://api.istex.fr/document/2FC89F938727257950B89C70DEF4C147858F0262/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000921</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000921</idno>
<idno type="wicri:Area/Istex/Curation">000921</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Message Correlation and Business Protocol Discovery in Service Interaction Logs</title>
<author><name sortKey="Serrour, Belkacem" sort="Serrour, Belkacem" uniqKey="Serrour B" first="Belkacem" last="Serrour">Belkacem Serrour</name>
<affiliation wicri:level="1"><mods:affiliation>Université de Lyon, Laboratoire LIESP, Bât. Nautibus (ex 710), 43, Bd. du 11 novembre 1918, 69622, Villeurbanne Cedex, France</mods:affiliation>
<country xml:lang="fr">France</country>
<wicri:regionArea>Université de Lyon, Laboratoire LIESP, Bât. Nautibus (ex 710), 43, Bd. du 11 novembre 1918, 69622, Villeurbanne Cedex</wicri:regionArea>
</affiliation>
<affiliation wicri:level="1"><mods:affiliation>E-mail: bserrour@bat710.univ-lyon1.fr</mods:affiliation>
<country wicri:rule="url">France</country>
</affiliation>
</author>
<author><name sortKey="Gasparotto, Daniel P" sort="Gasparotto, Daniel P" uniqKey="Gasparotto D" first="Daniel P." last="Gasparotto">Daniel P. Gasparotto</name>
<affiliation wicri:level="1"><mods:affiliation>Université de Lyon, Laboratoire LIESP, Bât. Nautibus (ex 710), 43, Bd. du 11 novembre 1918, 69622, Villeurbanne Cedex, France</mods:affiliation>
<country xml:lang="fr">France</country>
<wicri:regionArea>Université de Lyon, Laboratoire LIESP, Bât. Nautibus (ex 710), 43, Bd. du 11 novembre 1918, 69622, Villeurbanne Cedex</wicri:regionArea>
</affiliation>
<affiliation><mods:affiliation>E-mail: daniel.gasparotto@gmail.com</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Kheddouci, Hamamache" sort="Kheddouci, Hamamache" uniqKey="Kheddouci H" first="Hamamache" last="Kheddouci">Hamamache Kheddouci</name>
<affiliation wicri:level="1"><mods:affiliation>Université de Lyon, Laboratoire LIESP, Bât. Nautibus (ex 710), 43, Bd. du 11 novembre 1918, 69622, Villeurbanne Cedex, France</mods:affiliation>
<country xml:lang="fr">France</country>
<wicri:regionArea>Université de Lyon, Laboratoire LIESP, Bât. Nautibus (ex 710), 43, Bd. du 11 novembre 1918, 69622, Villeurbanne Cedex</wicri:regionArea>
</affiliation>
<affiliation wicri:level="1"><mods:affiliation>E-mail: hkheddou@bat710.univ-lyon1.fr</mods:affiliation>
<country wicri:rule="url">France</country>
</affiliation>
</author>
<author><name sortKey="Benatallah, Boualem" sort="Benatallah, Boualem" uniqKey="Benatallah B" first="Boualem" last="Benatallah">Boualem Benatallah</name>
<affiliation wicri:level="1"><mods:affiliation>CSE, UNSW, NSW 2052, Sedney, Australia</mods:affiliation>
<country xml:lang="fr">Australie</country>
<wicri:regionArea>CSE, UNSW, NSW 2052, Sedney</wicri:regionArea>
</affiliation>
<affiliation wicri:level="1"><mods:affiliation>E-mail: boualem@cse.unsw.edu.au</mods:affiliation>
<country wicri:rule="url">Australie</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<imprint><date>2008</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithm</term>
<term>Business protocol</term>
<term>Business protocol discovery</term>
<term>Business protocols</term>
<term>Conversation abcde</term>
<term>Conversation candidate</term>
<term>Conversation logs</term>
<term>Data engineering</term>
<term>Data mining</term>
<term>Final states machine</term>
<term>Focal elements</term>
<term>Graph theory techniques</term>
<term>Highest value</term>
<term>Ieee transactions</term>
<term>Infrequent edges</term>
<term>Initial message</term>
<term>Initial message type</term>
<term>Initial node</term>
<term>Initial state</term>
<term>Logging infrastructure</term>
<term>Mathematical theory</term>
<term>Message correlation</term>
<term>Message graph</term>
<term>Message graphs</term>
<term>Message logs</term>
<term>Message type</term>
<term>Nite automaton</term>
<term>Node</term>
<term>Other attrib</term>
<term>Possible conversations</term>
<term>Protocol</term>
<term>Protocol discovery</term>
<term>Protocol discovery algorithm</term>
<term>Protocol execution</term>
<term>Random interruption</term>
<term>Right node</term>
<term>Self loops</term>
<term>Serrour</term>
<term>Service interaction logs</term>
<term>Several advantages</term>
<term>Small message graph</term>
<term>Subset algorithm</term>
<term>Synthetic logs</term>
<term>Technical report</term>
<term>Uncommitted belief</term>
<term>Unknown meaning</term>
<term>Weight degree</term>
</keywords>
<keywords scheme="Teeft" xml:lang="en"><term>Algorithm</term>
<term>Business protocol</term>
<term>Business protocol discovery</term>
<term>Business protocols</term>
<term>Conversation abcde</term>
<term>Conversation candidate</term>
<term>Conversation logs</term>
<term>Data engineering</term>
<term>Data mining</term>
<term>Final states machine</term>
<term>Focal elements</term>
<term>Graph theory techniques</term>
<term>Highest value</term>
<term>Ieee transactions</term>
<term>Infrequent edges</term>
<term>Initial message</term>
<term>Initial message type</term>
<term>Initial node</term>
<term>Initial state</term>
<term>Logging infrastructure</term>
<term>Mathematical theory</term>
<term>Message correlation</term>
<term>Message graph</term>
<term>Message graphs</term>
<term>Message logs</term>
<term>Message type</term>
<term>Nite automaton</term>
<term>Node</term>
<term>Other attrib</term>
<term>Possible conversations</term>
<term>Protocol</term>
<term>Protocol discovery</term>
<term>Protocol discovery algorithm</term>
<term>Protocol execution</term>
<term>Random interruption</term>
<term>Right node</term>
<term>Self loops</term>
<term>Serrour</term>
<term>Service interaction logs</term>
<term>Several advantages</term>
<term>Small message graph</term>
<term>Subset algorithm</term>
<term>Synthetic logs</term>
<term>Technical report</term>
<term>Uncommitted belief</term>
<term>Unknown meaning</term>
<term>Weight degree</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Protocole</term>
</keywords>
</textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: The problem of discovering protocols and business processes based on the analysis of log files is a real challenge. The behavior of a Web service can be specified using a Business Protocol, hence the importance of this discovery. The construction of the Business Protocol begins by correlating the logged messages into their conversations (i.e. instances of the business protocol). The accomplishment of this task is easy if we assume that the logs contain the right identifiers, which would allow us to associate every message to a conversation. But in real-world situations, this kind of information rarely exists inside the log files. Our work consists in correlating the messages present in Web service logs into the conversations they belong to, and then generating automatically the Business Protocol that reflects the messaging behavior perceived in the log. Contrary to other approaches, we do not assume the existence of a conversation identifier. We first model logged message relations using graphs and then we use graph theory techniques to extract the conversations and finally the Business Protocol. Logs are often incomplete and contain errors. This induces some uncertainty on the results. To address this problem, we apply the Dempster-Shafer theory of evidence. Our approach is implemented and tested using synthetic logs.</div>
</front>
</TEI>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Asie/explor/AustralieFrV1/Data/Istex/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000921 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd -nk 000921 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Asie |area= AustralieFrV1 |flux= Istex |étape= Curation |type= RBID |clé= ISTEX:2FC89F938727257950B89C70DEF4C147858F0262 |texte= Message Correlation and Business Protocol Discovery in Service Interaction Logs }}
This area was generated with Dilib version V0.6.33. |