On Service Composition Algorithm for Open Marketplaces of Network Services S. Bhat, R. Udechukwu, R. Dutta, G. N. Rouskas Department of Computer Science North Carolina State University 1
Outline Introduction q ChoiceNet Architecture Planner q Semantics q Economy Plane and Use (Data) Plane q Example Future Work 2
Introduction Motivation : Why ChoiceNet? q Innovation at the core network What is an Open Marketplace and why do we need it? q Allow economics and technology interaction q Foster a free and open society What do we hope to accomplish? q Provide Choice while selecting network services 3
Analogy : Google Flight Planner 4
CHOICENET ARCHITECTURE
ChoiceNet Principles and Features Foundation Principles of the Architecture q Encourage Alternatives q Know What Happened q Vote With Your Wallet Features which reflect the Principles q Level Playing Field q Verification and Accountability q Reward Selectively 6
CHOICENET ARCHITECTURE : Essential Components Economy Plane Control Plane Data Plane Marketplace A D V E R T I S E M EN T R E P U T A T I O N Verifica<on Infrastructure P R O T O C O L S T A C K PLANNER P A T H I N N ET W OR K In-force Contracts Service Purchase Proofs with Timestamp Payment Infrastructure Service Nego<a<on & Payment Provisioning Infrastructure Transac<on Token Interface Service Infrastructure Router / Middlebox / Stub Network / Virtual Service
Related Work 2000-2006 Universal Description, Discovery and Integration (UDDI) (IBM, Microsoft, and SAP) 2002 2002 2004 2005 2007 Open Services Gateway initiative (OSGi) (OSGi Alliance) Universal Plug and Play (UPnP) (UPnP Forum) Tussle in Cyberspace: Defining Tomorrow s Internet (David D. Clark, John Wroclawski, Karen R. Sollins, and Robert Braden) Routing as a Service (Karthik Lakshminarayanan, Ion Stoica, and Scott Shenker) Towards an evolvable internet architecture (Sylvia Ratnasamy, Scott Shenker, and Steven McCanne) The SILO architecture (R. Dutta, G. N. Rouskas, I. Baldin, A. Bragg, and D. Stevenson) US NSF and the Future Internet Design (Darleen Fisher) How to Lease the Internet in Your Spare Time (Nick Feamster, Lixin Gao, and Jennifer Rexford) 2008 2009 MINT: A Market for INternet Transit (Vytautas Valancius, Nick Feamster, Ramesh Johari, and Vijay Vazirani) Pathlet Routing (P. Brighten Godfrey, Igor Ganichev, Scott Shenker, and Ion Stoica) 8
Outline Introduction q ChoiceNet Architecture Planner q Semantics q Economy Plane and Use (Data) Plane q Example Future Work 9
Service Abstraction using XML SERVICE DEFINITION SERVICE ADVERTISEMENT SERVICE NAME String Predefined SRC ADDRESS {set}/<range> Predefined SRC ADDRESS SCHEME {set}/<range> Predefined SRC FORMAT {set} Predefined SRC FORMAT SCHEME {set} Predefined CONSIDERATION TYPE Unique String Predefined DESCRIPTION String Predefined DEST ADDRESS {set}/<range> Predefined DEST ADDRESS SCHEME {set}/<range> Predefined DEST FORMAT {set} Predefined DEST FORMAT SCHEME {set} Predefined CONSIDERATION VALUE <value> Predefined Provider ID Unique String Predefined PROVISIONING DETAIL String Predefined PURCHASE PORTAL Unique String Predefined INDEX ATribute Name Value Seman<cs 10
ChoiceNet Planner - Input SERVICE REQUIREMENT SERVICE DEFINITION K <value> Predefined CONSIDERATION TYPE Unique String Predefined CONSIDERATION VALUE <value> Predefined INDEX ATribute Name Value Seman<cs 11
ChoiceNet Planner - Output CONSIDERATION TYPE Unique String Predefined CONSIDERATION VALUE <total value> Predefined SERVICE DETAIL Adver<sement ID Unique String Predefined K COMPOSED SERVICES COMPOSED SERVICE SRC ADDRESS Set Element Predefined SRC ADDRESS SCHEME Set Element Predefined SRC FORMAT Subset Elem Predefined SRC FORMAT SCHEME Set Element Predefined DEST ADDRESS Set Element Predefined DEST ADDRESS SCHEME Set Element Predefined DEST FORMAT Subset Elem Predefined DEST FORMAT SCHEME Set Element Predefined COMPOSED SERVICE SERVICE DETAIL 12
Design Considerations Planner Instan<a<on q Planner integrated inside the Marketplace ü Planner which resides outside the Marketplace Planner Interac<on with Marketplace ü Pull System q Push System Planner Algorithm q A cheapest cost composed service using modified Dijkstra s shortest path algorithm ü K loop less composed services sorted in non decreasing order of cost using modified Yen s algorithm ü A node is represented by the tuple (Address, Format) 13
High Level Entities Interaction Diagram Economy Plane MARKETPLACE Ac<ve Adver<sement Repository Payment Infrastructure PLANNER 1. Purchase Lis<ng 3. Search for Matching Service(s) or lookup a Planner Service User 7. Purchase Service Provider Payment Infrastructure 8. Purchase Proof 4. Find Plans Control Plane 5. Search 6. Composed Service(s) 2. Adver<se Service 9. Withdraw Service (op<onal) Provisioning Infrastructure 10. Provision Verifica<on Infrastructure In-force Contracts Data Plane Service Infrastructure
Use Plane Protocol Of Planner 15
Marketplace User Request Round Trip Example ADV - 1 (10.10.10.1, *) (10.10.20.0, *) ADV - 2 (10.10.20.1, mp4) (10.10.10.0, mp3), (10.10.30.0, mp3) ADV - 3 (10.10.30.1, *) (10.10.10.0, *) (10.10.10.1, mp4) (10.10.10.1, mp3) 1st Composed Service (10.10.10.1, mp4) (10.10.20.1, mp4) (10.10.10.0, mp3), (10.10.30.0, mp3) (10.10.10.0, mp3) 2nd Composed Service (10.10.10.1, mp4) (10.10.20.1, mp4) (10.10.30.1, mp3) (10.10.10.0, mp3) 16
Summary Marketplace and Graph Model Semantically enriched Network services Planner for constructing multiple Composed Services Request and Response Automation 17
Outline Introduction q ChoiceNet Architecture Planner q Semantics q Economy Plane and Use (Data) Plane q Example Current and Future Work 18
Current and Future Work Planner for users: Pareto paths for multiple objectives Service concatenation routing with NFV applications Planner for providers Service placement/network design Planning based on historical data static Planning based on current user behavior (dynamic) Scale up or scale down 19