Skip to main content
Springer Nature Link
Log in

Network mapping services for dynamic selection of web services: promises and challenges

  • Original Article
  • Published:
Information Systems and e-Business Management Aims and scope Submit manuscript

Abstract

Web services provide the possibility of dynamically integrating distributed service components scattered over the Internet to fulfill sophisticated business demands. The effectiveness of service integration depends critically on the selection of best-fit service components. In this paper, we first review several research streams related to server selection. We then propose a framework of dynamic service discovery, termed Network Mapping Services (NMS), which combines prior efforts on network-aware applications and server selection into a coherent structure. As successful implementation of NMS requires the collaboration among all participating service providers, we also discuss several incentive schemes and compare their effectiveness in supporting collaboration.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  • Ba S, Stallaert J, Whinston AB (2001) Research commentary: introducing a third dimension in information systems design—the case for incentive alignment. Inf Syst Res 12:225–239

    Article  Google Scholar 

  • Bolliger J, Gross T (1998) A framework-based approach to the development of network-aware applications. IEEE Trans Software Eng 24(5):376–390

    Article  Google Scholar 

  • Chen Y, Lim K, Overton C, Katz RH (2002) On the stability of network distance estimation. In: Proceeding of ACM SIGMETRICS practical aspects of performance analysis workshop (PAPA2002)

  • Clarke E (1971) Multipart pricing of public goods. Public Choice 11:17–33

    Article  Google Scholar 

  • Crawford V, Sobel J (1982) Strategic information transmission. Econometrica 50:1431–1451

    Google Scholar 

  • Feigenbaum J, Papadimitriou C, Sami R, Shenker S (2002) A BGP-based mechanism for lowest-cost routing. In: Proceedings of ACM PODC 2002

  • Groves T (1973) Incentives in teams. Econometrica 41:617–663

    Google Scholar 

  • Francis SJ, Jin C, Jin Y, Raz D, Shavitt Y, Zhang L (2001) IDMaps: a global internet host distance estimation service. IEEE/ACM Trans. on Networking, Oct. 2001

  • Glass G (2002) Web services: building blocks for distributed systems. Prentice Hall PTR, New Jersey

    Google Scholar 

  • Greschler D, Mangan T (2002) Networking lessons in delivering ‘Software as a Service’—part I. Int J Netw Manag 12:317–321

    Article  Google Scholar 

  • Huang A, Steenkiste P (2003) Network-sensitive service discovery. In: Proceeding of 4th USENIX symposium on internet technologies and systems (USITS 2003)

  • Miller N, Steenkiste P (2000) Collecting network status information for network-aware applications. In: Proceedings of IEEE INFOCOM 2000, pp 641–650

  • Nisan N, Ronen A (2001) Algorithmic mechanism design. Games Eco Behav 35:166–196

    Article  Google Scholar 

  • Ng TSE, Zhang H (2003) Predicting Internet network distance with coordinates-based approaches. In: Proceedings of IEEE INFOCOM 2002

  • Peltz C (2003) Web services orchestration and choreography. Computer 36(10):46–52

    Article  Google Scholar 

  • Pias M, Crowcroft J, Wilbur S, Harris T, Bhatti S (2003) Lighthouses for scalable distributed location. In: Proceedings of the 2nd international workshop on peer-to-peer systems (IPTPS ’03)

  • Vernon M (2002) Transparency is the key to early appearance on trading floors. Financial Times, 1 May 2002:FT-IT 5

  • Vickrey W (1961) Counterspeculation, auctions, and competitive sealed tenders. J Finance 16:8–37

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Research in Electronic Commerce, Department of Management Science & Information Systems, McCombs School of Business The University of Texas at Austin, Austin, TX, 78712, USA

    Yun Huang & Andrew B. Whinston

  2. Management Science, University of Washington Business School, Seattle, WA, 9819, USA

    Xianjun Geng

Authors
  1. Yun Huang
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Xianjun Geng
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Andrew B. Whinston
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Yun Huang.

Additional information

This research was sponsored in part by the National Science Foundation under contract number IIS-0219825.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huang, Y., Geng, X. & Whinston, A.B. Network mapping services for dynamic selection of web services: promises and challenges. ISeB 3, 281–297 (2005). https://doi.org/10.1007/s10257-005-0017-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10257-005-0017-2

Keywords