Skip to main content

The Analysis of Efficient Monitoring Grid Traffic with Flow Conservation Equation

  • Conference paper
Grid and Cooperative Computing - GCC 2004 Workshops (GCC 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3252))

Included in the following conference series:

  • 546 Accesses

Abstract

Monitoring grid traffic is a key step for grid resource management, the problem of efficient monitoring for the grid traffic is to reduce the generation overhead communication as more as possible regarding as the problem by identifying the minimum weak vertex cover set for a given graph G (V,E) which represents the topology of a grid. An approximation algorithm to find out the weak vertex set is presented and it is proved that the algorithm has a ratio bound of 2(lnd+1), where d is the maximum degree of the vertices in graph G. Then it is showed that the running time of the algorithm is O(| V| 2).

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Lowekamp, B.B., Miller, N., Karrer, R., Gross, T., Steenkiste, P.: Design, Implementation, and Evaluation of the Remos Network Monitoring System. Journal of Grid Computing 1(1), 75–93 (2003)

    Article  Google Scholar 

  2. He, G., Hou, J.C.: On Exploiting Long Range Dependence of Network Traffic in Measuring Cross Traffic on an End-to-end Basis. IEEE Infocom (1), 1858–1868 (2003)

    Google Scholar 

  3. Downey, A.B.: Using Path Char to Estimate Internet Link Characteristics. In: Proceeding of the ACM SIGCOMM 1999 Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communications, Cambridge, pp. 241–250 (1999)

    Google Scholar 

  4. Lai, K., Baker, M.: Measuring Bandwidth. In: Proc. of IEEE INFOCOM (March 1999)

    Google Scholar 

  5. Jamin, S., Jin, C., Jin, Y., Raz, Y., Shavitt, Y., Zhang, L.: On the Placement of Internet Instrumentation. In: Proceeding of IEEE INFOCOM 2000, Tel-Aviv, Israel, March 2000, vol. 19(1), pp. 295–304 (2000)

    Google Scholar 

  6. CBceres, R., Duffield, N.G., Feldmann, A., Friedmann, J., Greenberg, A., Greer, R., Johnson, T., Kalmanek, C., Krishnamurthy, B., Lavelle, D., Mishra, P.P., Ramakrishnan, K.K., Rexford, J., True, F., van der Merwe, J.E.: Measurement and analysis of IP network usage and behavior. IEEE Communications Magazine 38(5), 144–151 (2000)

    Article  Google Scholar 

  7. Breibart, Y., Chan, C.Y., Carofalakis, M., Rastogi, R., Silberszhatz, A., Breibart, Y., Chan, C.Y., Carofalakis, M., Rastogi, R., Silberszhatz, A.: Efficiently monitoring bandwidth and latency in IP network. In: Proceeding of IEEE INFOCOM 2001, Anchorage, Alaska, USA, April 2001, vol. 20(1), pp. 933–942 (2001)

    Google Scholar 

  8. Liu, X.H., Yin, J.P., Lu, X.C., Zhao, J.M.: A monitoring model for link bandwidth usage of network based on weak vertex cover. Journal of Software 15(4), 545–549 (2004) (Chinese)

    MATH  Google Scholar 

  9. Habib, A., Khan, M., Bhargava, B.: Edge-to-Edge measurement-based distributed network monitoring. Technical Report, CSD-TR-02-019, Purdue University (2002)

    Google Scholar 

  10. Chen, Q., Chang, H., Govindan, R., Jamin, S., Shenker, S., Willinger, W.: The origin of power-laws in Internet topologies revisited. IEEE INFOCOM (June 2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, X., Yin, J., Lu, X., Cai, Z., Zhao, J. (2004). The Analysis of Efficient Monitoring Grid Traffic with Flow Conservation Equation. In: Jin, H., Pan, Y., Xiao, N., Sun, J. (eds) Grid and Cooperative Computing - GCC 2004 Workshops. GCC 2004. Lecture Notes in Computer Science, vol 3252. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30207-0_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30207-0_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23578-1

  • Online ISBN: 978-3-540-30207-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics