ebXML   masters by research in Computer Science  by Sacha Schlegel
   http://www.schlegel.li/ebXML/index.html    is the homepage of this project.

 M E E T I N G
 
m e e t i n g . h e a d e r  
  
date:    March 17th, 2003
week:    12
report:    x out of y
location:    School of Computing at Curtin University
Building 314, Level 4 Meeting room Don Reid
person:    Don Reid, supervisor
Sacha Schlegel, student (2967)
 
m e e t i n g . a c t i v i t i e s  
  
  • Algorithm status
    • Finished PartyInfo (excluding nested CanSend/CanReceive)
    • Finished Packaging part (including SimpleParts).
    • List of implementation details (features included, not included)
    • Writing CPA to file.
    • Writing conflicts to file.
    • Open: Certificates/Security
    • Open: DeliveryChanel some facts:
      • The problem with DeliveryChanel is: The DeliveryChanel element is referenced from different places. Each DeliveryChanel itself references a Transport element and a DocExchange element.
        Each Transport element has several options, so each DocExchange element.
      • If there are no mismatches there is no problem.
      • If there is a mismatch there arises a problem.
      • Mismatch example (well not that great): Person A and B work for Company X. Person C and D work for Company Y. Person A deals with Person C and Person B deals with Person D. Dealing means here sending and receiving mail.
        There is one camel for sending mail. The camel can either walk day and night or just one of those. Because good A is sending are going bad (bananas) A choose to have the camle be walking only during the day.
        B is sending some newspaper and chooses the camel to walk day and night.
        If the camel is a class and riding (day or/and night) is an attribute then we have a problem.
        There are two solutions:
        1. Get a new camel
        2. Set the camel attribute to either: - day, - night, or -day & night
        Variant 1 has more overhead but seems to be OK. For variant 1 there can be an optimizer which analyses the new solutions and brings together solutions which can be merged.
        Variant 2 is easier but sometimes it is JUST not wise to overrite some settings (It is very important that the banans are transported ONLY nights, so we cannot just overwrite that)
  • Level 2: Next step: setup basic negotiation infrastructure. This means implement state machine for negotiation for two parties. Implement basic message passing infrastructre (e.g. basic soap messages).
    Sample code to run a basic negotation
  • Finish Algorithm this week. Then start with level 2!
 
m e e t i n g . n o t e s  
  
  
  
  
  
  
 
m e e t i n g . t o . d o . l i s t  
  
  
  
  
  
  


© Sacha Schlegel@2003!