1 / 32

LYU 0004 Mobile Agent’s Community

LYU 0004 Mobile Agent’s Community. Group Member: Cheng Tsz Hei Ho Man Lam. Outline of the Presentation. Project’s system architecture Introduction multi-sellers & multi-buyers scenario The shortcoming of traditional approach The advantage of our system over the old one.

teness
Download Presentation

LYU 0004 Mobile Agent’s Community

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. LYU 0004Mobile Agent’s Community Group Member: Cheng Tsz Hei Ho Man Lam

  2. Outline of the Presentation • Project’s system architecture • Introduction multi-sellers & multi-buyers scenario • The shortcoming of traditional approach • The advantage of our system over the old one

  3. Outline of the Presentation • Algorithm used to handle the communication • Difficulties • Future plans

  4. Mobile’s Agent • The mobile agents can act on behalf of the user in the computer network. • Mobile agents are programs that can be dispatched from one computer and transported to a remote computer for execution.

  5. Mobile Agent’s Community • Group of agents with different purposes • Several network computers support agent’s platform • Easy to be accessed by web client • Form a virtual community

  6. Model of System ArchitectureFront-end

  7. Model of System Architecture (II)Front-end

  8. Model of System Architecture (III)Developer’s View Internet

  9. Model of System Architecture (IV)Developer’s View Internet

  10. Model of System Architecture (V)Developer’s View Internet

  11. Model of System Architecture (VI)Front-end & Developer’s View

  12. Model of System Architecture (VII)Inside Workplace

  13. Multi-sellers & Multi-buyers Scenarios • In this scenario, the buyers or the sellers can assign their trade strategies by using graphical user interfaces in the web site. • One of workplaces connecting to the web then delegates mobile agents to autonomously perform the bargain behavior for the client.

  14. Existing Approach • Electronic market • Fix web server • Applet or CGI technology • Fully controlled by users

  15. Shortcoming of Traditional Approach • Central access point • Deficiency of interaction • Transaction localization

  16. Central Access Point • One web server • Low response time • Traffic jam for local region of network

  17. Deficiency of Interaction • Seller waits for buyer & vice versa • Time consuming • Easy to miss time slot

  18. Transaction Localization • Location boundary • Limit the potential clients • Hard to promote globally

  19. Advantage of Our System • Location transparency • Failure transparency • Scaling transparency • Fast response

  20. Location Transparency • Hide the real location of marketplace • Agents will locate the paths of possible marketplaces

  21. Failure Transparency • Redundancy • Agents move from one marketplace to another one • No transactions are suspended and discarded

  22. Scaling Transparency • Build up list of address of workplaces • Allow to join or leave at any time • Expands infinity

  23. Fast Response • Biding representative to their clients in the bargaining sites • Immediate response according to client’s preference • Maximize profit for both buyers and sellers

  24. Concept of Algorithm • Zero-Intelligence-Plus (ZIP) Traders • Dave Ciff, Hewlett Packard Laboratories, Bristol, England, 1997 • Act as double auction market • Behave as human market • Obeys the theory of supply and demand

  25. Concept of Algorithm (II) • Limit price is private • Shout-prices observed in the market • Each agent adjust its margins up or down • Accept or ignore

  26. Algorithm for Trading Seller Behaviors. if (the last shout was accepted at price q). then any seller sifor which pi<= q should raise its profitmargin. if(the last shout was a bid). then. any active sellers sifor which pi>= q should lower its margin. else. if the(last shout was an offer). then any active seller si for which pi>= q should lower its margin. . where q is the shout price of the last shout. pi is shout price of trader i.

  27. Algorithm for Trading (II) Buyer Behaviors if (the last shout was accepted at price q) then any buyer bi for which pi>= q should raise its profitmargin if(the last shout was a offer) then any active buyers bi for which pi<= q should lower its margin else if the(last shout was an offer) then any active buyer bifor which pi<= q should lower its margin where q is the shout price of the last shout. pi is shout price of trader i

  28. Algorithm for Trading (III) • How to shout price Pi(t)? At time t, Pi(t) =λi,j (1+μ i(t)) where λi,j is limit price, μ i(t) profit-margin For seller, profit margin constraint between 0 <= μ i(t) < ∞ For buyer, profit margin constraint between -1<= μ i(t) < 0

  29. Algorithm for Trading (III) • How to calculate the profit-marginμ i(t+1)? Using Widrow-Hoff “delta rule”: μ i(t+1) = (Pi(t) + Ti(t)) /λi,j – 1 where Ti(t) momentum-based update Ti(0) = 0 for all i

  30. Difficulties • Problem domain • Configuration • Implementation of grasshopper • Weakness of java Serlvet

  31. Future Plan • Real-time interaction • Learning technique for agents • Higher-order adaptation mechanisms • Game-theory analysis • Support more scenarios in mobile agent’s paradigm • Security issue • Professional design of web site

  32. The End

More Related