2003/2/23conversation pattern figures1 Figures in connection with Conversation Patterns November 19, 2002

2003/2/23conversation pattern figures2 Do until halt nondeterministic choice: read an input; send an output to some other peer; halt; end choice input queue A single peer... To other e-services

2003/2/23conversation pattern figures3 Peer 1 Peer 2 Peer n Watcher A representative e-composition, with watcher ……

2003/2/23conversation pattern figures4 Peer1 Peer2 Peer3 Peer4 Peer5 Watcher A representative e-composition, with watcher

2003/2/23conversation pattern figures5 Do until halt nondeterministic choice: read input letter and record; send output letter to some other peer and record; halt; end choice input queue A single peer Peer1 Peer2 Peer3 Peer4 Peer5 Watcher A representative e-composition, with watcher...

2003/2/23conversation pattern figures6 store ware- house2 bank ware- house1 o rder 1 okok r eceipt 1 o rder 2 r eceipt 2 b ill 2 p ayment 2 b ill 1 p ayment 1 a uthorize

2003/2/23conversation pattern figures7 “ warehouse ” example store ware- house2 bank ware- house1 o rder 1 okok r eceipt 1 o rder 2 r eceipt 2 b ill 2 p ayment 2 b ill 1 p ayment 1 a uthorize The language recognized (where shuff indicates the shuffle operator) a k shuff( ( o 1 (shuff( r 1, p 1 b 1 ) )*, ( o 2 (shuff( r 2, p 2 b 2 ) )* ) a| |k |o 1 |o 2 r2|r2| r1|r1| |o 1 r1|r1| r2|r2| Mealy peer implementation for store |a k| |p 1 |p 2 b2|b2| b1|b1| |p 1 b1|b1| b2|b2| Mealy peer implementation for bank o1|o1| Mealy peer implementation for warehouse1, assuming the inner shuffle operators |r 1 |b 1 p1|p1| p1|p1| |r 1 |b 1 ε|ε o1|o1| |b 1 p1|p1| |r 1 Mealy peer implementation for warehouse1, assuming no inner shuffle operator (i.e., accepted word is... (o 1 b 1 p 1 r 1 )*... Note: for my Mealy machines, an edge label “ w|v ” means that to traverse this edge the machine must read word w from input and produce word v as output (the channel used for v is not shown). If w or v are empty word, then it may be shown or left blank. Note that in the Mealy peer implementations, the channel name and the message name are identical. So we write, e.g., “ |a ” rather than “ |a:a ”

2003/2/23conversation pattern figures8 ?a?a !k!k !o1!o1 !o2!o2 ?r2?r2 ?r1?r1 !o2!o2 !o1!o1 ?r1?r1 ?r2?r2 Store !a!a ?k?k !p1!p1 !p2!p2 ?b2?b2 ?b1?b1 !p2!p2 !p1!p1 ?b1?b1 ?b2?b2 Bank ?o1?o1 Warehouse1 !r1!r1 !b1!b1 ?p1?p1 ?p1?p1 !r1!r1 !r1!r1 !b1!b1  Note that in the Mealy peer implementations, the channel name and the message name are identical. So we write, e.g., “ |a ” rather than “ |a:a ”

2003/2/23conversation pattern figures9 XY Z a b e-composition whose CPL is { w | |  a (w)| = |  b (w)|, and for each prefix v of w, |  a (v)|  |  b (v)| } assuming that the following Mealy peers are used. |a a|b b| for Xfor Yfor Z Note: The resulting CPL is context-free but not regular. This is easily extended to create a machine that accepts a CPL that is context-sensitive but not context free (essentially a n b n c n ), In the paper, let ’ s present the above example and use it to illustrate notion of “ pre-pone ”. The above example is easily generalized to get the a n b n c n case.

2003/2/23conversation pattern figures10 simplified “ warehouse ” example store bank ware- house o rder okok r eceipt b ill p ayment a uthorize The language recognized (where shuff indicates the shuffle operator) a k ( o (shuff( r, p b ) )*) o r b p p r r b ε a fsa accepting the CPL for simplified warehouse example (I think) (Don ’ t need to use pre-pone in this particular case, I think) (can construct Mealy peers from this, but I ran out of time...)

2003/2/23conversation pattern figures11 p1p1 p2p2 c 1  p 1,p 2,  a  ?b?b !a!a p1p1 !b!b p2p2 ?a?a c 2  p 2,p 1,  b 

2003/2/23conversation pattern figures12 |a for X for Y for Z Intuition: X produces a bunch of a ’ s and then one b Y produces one c for each a Z is happy to consume the c ’ s, but it *must* consume the b first. so, to make an accepting execution of the e-composition, Y must “ wait ” until X has produced the b, before it can start to send c ’ s to Z. A Mealy e-composition accepting a n bc n (I think) |c a| |b c| b| X Y Z a c b

2003/2/23conversation pattern figures13 !a!a p1p1 !b!b !c!c ?a?a p2p2 ?c?c ?b?b p3p3 p1p1 p2p2 p3p3 c1c1 c2c2 c3c3 c 1  p 1,p 2,  a  c 2  p 1,p 3,  b  c 3  p 2,p 3,  c 

2003/2/23conversation pattern figures14 S-CSCF Service Call Session Control Function MRFC Media Resource Function Controller AppServer Application Server HSS Home Subscriber Service High-level architecture of proposed 3GPP IP Multimedia Core Network Subsystem (IMS)

2003/2/23conversation pattern figures15 Policy Administration Point Policy Repository Policy Decision Point Policy Enforcement Point Policy-enabled Application or Service Network Resources Policy Execution Point Relevant Data i.e., the Rules Engine Policy Management Infrastructure Policy-enabled Resources Typical reference architecture for policy enablement