A reading List in Mobile Multimedia Networking Group BackGround



Yüklə 110,14 Kb.
tarix11.07.2018
ölçüsü110,14 Kb.

A Reading List in Mobile Multimedia Networking Group

  1. BackGround (推荐阅读,建议每类别至少读一部)

  • Algorithms and optimization --- 杜彪

    • Introduction to Algorithms, Second Edition by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein. 2001. (download)

    • Approximation Algorithms, by Vijay V. Vazirani.  2001. (download)

    • Randomized Algorithms, by Rajeev Motwani, Prabhakar Raghavan. 1995. (download)

    • Network Flows: Theory, Algorithms, and Applications by Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin. 1993.
      The bible on network related algorithms. (download)

  • Optimization --- 杜彪

    • Nonlinear and convex analysis

      • Nonlinear programming: Theory and Algorithms by M. Bazaraa, H. Sherali, and C. Shetty. 1993. (download)

      • Convex Optimization, S. Boyd and L. Vandenberghe 2003. (the class slides are useful, including contents on Ellipsoid and sub-gradient method which are not covered in the book) (download)

    • Network Optimization: Continuous and Discrete Models by Bertsekas 1998. (download)

    • Dynamic programming by Bertsekas, 2000 and 2001. (slides can also be found at the web site) (download)

    • Combinatorial Optimization: Algorithms and Complexity by Christos H. Papadimitriou. 1986. (download)

  • Distributed and parallel algorithms --- 赵辉

    • Distributed Algorithms, by Nancy A. Lynch 1997. (download)

    • Distributed Computing: Fundamentals, Simulations and Advanced Topics, Second Edition, John Wiley & Sons, 2004, by Hagit Attiya and Jennifer Welch. (download)

    • Parallel and Distributed Computation: Numerical Methods by Bertsekas and Tsitsiklis 1997. (download)

  • Probability and stochastic processes --- 赵辉

    • Probability

      • A Modern Approach to Probability Theory by  Bert Fristedt, Lawrence Gray. 1996. (download)
        If you want to read just one book on probability and stochastic process, I suggest this one.

    • Stochastic processes, queueing theory, information theory, and control theory

      • A First Course in Stochastic Processes, by Karlin 1975. (download)

      • A Second Course in Stochastic Processes, by Karlin 1981. (download)

    • Queueing theory

      • Fundamentals of Queueing Theory, by Gross and Harris. 1998. (download)

    • Elements of Information Theory, by Thomas M. Cover, Joy A. Thomas. 1991. (download)

      • Shannon's original 1948 paper (html, pdf)

    • Control theory and estimation theory (download)

      • Kalman's original 1960 paper (html, pdf)

  • Economics and game theory --- 杜海鹏

    • Classics in Game Theory, edited by Kuhn 1997. (download)

    • A Course in Game Theory, Martin J. Osborne, Ariel Rubinstein. 1994. (download)

    • Microeconomic Theory, by Andreu Mas-Colell, Michael D. Whinston, Jerry R. Green 1995. (download)

  • Network security and crypto --- 杜海鹏

    • Applied Cryptography by Schneier 1996. (download)

    • Cryptography and Network Security: Principles and Practice by Stalling, Third Edition, Prentice-Hall, 2003. (download)

    • Cryptography: Theory and Practice by Stinson, 2000. (download)

  • Communications --- 杜海鹏

    • Digital communications, by Proakis 2000. (download)

    • Fundamentals of Wireless Communication, by D. Tse and P. Viswanath, Cambridge University Press, May 2005. (download)

    • Wireless Communications: Principles and Practice, by Theodore Rappaport 2001. (download)

  1. Classic Papers (经典论文,建议全部阅读,至少2)

Internet architecture and philosophy [6 basic papers] --- 杜彪


  • [SRC84] J. Saltzer, D. Reed, and D. Clark, "End-to-end Arguments in System Design". ACM Transactions on Computer Systems (TOCS), Vol. 2, No. 4, 1984, pp. 195-206. (html)

End to end arguments is a class of system design principles that organize and guide the placement of function within a system. These arguments and the underlying principles have now been invoked in many contexts, becoming part of the vocabulary of network protocol and operating system designers.

  • [Cla88] D. Clark, "The Design Philosophy of the DARPA Internet Protocols". In Proceedings of ACM SIGCOMM '88, 106-114, Palo Alto, CA, Sept 1988. (html)

Discuss the design goals of the Internet.


  • [Ise97] David Isenberg, "Rise of the Stupid Network". 1997 (html)

An interesting discussion on "stupid" and "intelligent" networks. A strong recommendation to read.

  • [RSC98] David P. Reed, Jerome H. Saltzer, and David D. Clark, "Comment on Active Networking and End-to-End Arguments". IEEE Network 12, 3 (May/June 1998) pages 69-71. (html)

Comments active network research, using the end to end arguments.

  • [RM99] Suchitra Raman and Steven McCanne, "A Model, Analysis, and Protocol Framework for Soft State-based Communication." In Proceedings of ACM SIGCOMM '99. (html)

Soft state is a fundamental design tool in computer networking.
 

  • [CWSB02] David D. Clark, John Wroclawski, Karen Sollins and Robert Braden, "Tussle in Cyberspace: Defining Tomorrow's Internet." In Proceedings of ACM SIGCOMM 2002. (html, video in Windows Media format)

The traditional Internet is designed for non-commercial usage. This paper introduces new perspectives for next generation Internet.

MAC and link layer [4 basic papers] --- 杜彪


  • [KT75] Kleinrock, L. and F. Tobagi, "Packet Switching in Radio Channels: Part I--Carrier Sense Multiple-Access Modes and their Throughput-Delay Characteristics", IEEE Transactions on Communications, Vol. COM-23, No. 12, pp. 1400-1416, December 1975. Also, "Multiple Access Communications, Foundations for Emerging Technologies", Norman Abramson (Ed), IEEE Press, 1992, pp. 272-288. PDF

analysis of CDMA protocol
 

  • [MB76] B. Metcalfe and D. Boggs, "ETHERNET: Distributed Packet Switching for Local Area Networks". Communications of the ACM, Vol. 39, No. 6, pp. 395-404, 1976. (html, pdf)

Specification of the initial Ethernet protocol. Notice that it is different from the current protocol.

  • [MBK88] J. Mogul, D. Boggs, S. Kent, "Measured Capacity of an Ethernet: Myths and Reality". In Proceedings of ACM SIGCOMM '88, August 1988 (ACM CCR 18, 4)  (html)

A summary of the theoretical analyses on Ethernet performance. Measure the performance also.

  • [BDSZ94] V. Bharghavan, A. Demers, S. Shenker, and L. Zhang, ``MACAW: A Media Access Protocol for Wireless LANs.'' ACM Sigcomm '94, London, UK. September 1994. (ps.gz)

Improve the congestion control and message exchange of MACA, which was proposed by Kahn and used RTS/CTS to address the hidden terminal problem.

Routing [7 9 basic papers] --- 杜彪


  • [Gal77] Robert G. Gallager, A Minimum Delay Routing Algorithm Using Distributed Computation, IEEE Transactions on Communications, 1, 73-85 (1977).

multiple-path optimal routing

  • [Ber82] D. Bertsekas, "Dynamic Behavior of Shortest Path Routing Algorithms for Communication Networks," IEEE Transactions on Automatic Control, AC-27, pp. 60-74, February 1982. (pdf)

single path routing; adding bias

  • [Seg77] Adrian Segall, The Modeling of Adaptive Routing in Data-Communication Networks, IEEE Transactions on Communications, 25, 85-95 (1977).
     

  • [GHS83] R. G. Gallager, P. A. Humblet, and P. M. Spira, "A Distributed Algorithm for Minimum-Weight Spanning Trees," ACM Transactions on Programming Languages and Systems, Vol. 5, No. 1, January ]983, Pages 66-77. (pdf)

a nice distributed spanning tree algorithms

  • [KZ89] A. Khanna and J. Zinky, "A Revised ARPANET Routing Metric," ACM SIGCOMM  '89, pp. 45-56, September 1989. (pdf)

    • complexity of Internet routing
       

  • [Pax96] V. Paxson, "End-to-End Routing Behavior in the Internet". In Proceedings of ACM SIGCOMM '96, August 1996, Stanford, CA.  (pdf, ps.Z, viewgraph in ps.Z, the author's tutorial on Internet measurement in ps.Z)

Show the pathologies,  stability, and symmetry of Internet routing. Pay attention to the methodology. You may find some other talks by this author also very interesting.

  • [LMJ97] C. Labovitz, G. R. Malan, and F. Jahanian, "Internet Routing Instability". In Proceedings of ACM SIGCOMM'97, September 1997. (html, ps.gz)

BGP router send too many BGP packets. Why?

  • [GW99] Timothy G. Griffin,  Gordon Wilfong, "An Analysis of BGP Convergence Properties". In Proceedings of ACM SIGCOMM 1999. (html) (here is a link on BGP maintained by Griffin)
     

    • study the problem of persistent route oscillations; propose No Dispute Wheel Theorem
       

  • [GR00] Lixin Gao and Jennifer Rexford, "Stable Internet Routing Without Global Coordination". In Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems. 2000.
     

    • first application of Internet economy to routing stability

Router--high performance [3 basic papers] --- 杜彪


  • [McK96] N. McKeown, M. Izzard, A. Mekkittikul, W. Ellersick and M. Horowitz, The Tiny Tera: A Packet Switch Core , Proc. Hot Interconnects V, Stanford University, August 1996. (pdf)
     

  • [BCDP97] A. Brodnik, S. Carlsson, M. Degermark, and S. Pink, "Small Forwarding Tables for Fast Routing Lookups". In Proceedings of ACM SIGCOMM '97. Pages 3-14. (html)

One of the first papers to discuss how to do fast and scalable forwarding table lookup when we use prefix match.

  • [PCBC+98] C. Partridge, P. P. Carvey, E. Burgess, I. Castineyra, T. Clarke, L. Graham, M. Hathaway, P. Herman, A. King, S. Kohalmi, T. Ma, J. McAllen, T. Mendez, W.C. Milliken, R. Pettyjohn, J. Rokosz, J. Seeger, M. Sollins, S. Storch, B. Tober, G.D. Troxel, D. Waitzman, and S. Winterble, "A 50-Gb/s IP router". IEEE/ACM Transactions on Networking, Vol. 6, No. 3 (June 1998), Pages 237-248. (html)

Present MGR, which has five innovations: 1) each forwarding engine has a complete set of the forwarding table (used to have only cache); 2) Use a switched backplane (used to use a shared bus); 3) split forwarding engines from line cards; 4) line cards translate local link layer headers to and from an abstract link layer header format so that forward engines do not need to consider link layer; 5) include QoS; the forwarding engines classify packets, scheduling on the output line cards, in a specialized processor called the QoS processor.

Router--more functionality--active networks [2 basic paper] ---杜彪


  • [Wet99] David Wetherall, "Active network vision and reality: lessons from a capsule-based system". In Proceedings of ACM SOSP 1999. (ACM DL, ps, pdf, summary in HTML, slides in tar.gz)
     

  • [TSSW97] David L. Tennenhouse, Jonathan M. Smith, W. David Sincoskie, David J. Wetherall, and Gary J. Minden, "A Survey of Active Network Research". IEEE Communications Magazine, Vol. 35, No. 1, pp80-86. January 1997. (html)
     

Internet measurements and models  [6 9 basic papers] --- 杜彪


  • [Bol93] Jean-Chrysotome Bolot, "End-to-end packet delay and loss behavior in the internet". In Proceedings of ACM SIGCOMM '93. (pdf)

A simple and elegant analysis on packet delay, bandwidth, packet size, and loss.

  • [LTWW93] W. E. Leland, M. S. Taqqu, W. Willinger, and D. V. Wilson, "On the Self-Similar Nature of Ethernet Traffic". In Proceedings of SIGCOMM '93. IEEE/ACM Transactions on Networking, Vol. 2, No. 1, pp. 1-15, Feb. 1995. (html)

Present that traffic is self-similar in a local area network environment.

  • [WPT98] W. Willinger, V. Paxson, and M.S. Taqqu, "Self-similarity and Heavy Tails: Structural Modeling of Network Traffic". In A Practical Guide to Heavy Tails: Statistical Techniques and Applications, 1998. Adler, R. Feldman, R. and Taqqu M.S., editors, Birkhauser.  (html)

Explain LAN and WAN traffic through structral models and show the relationship between self-similarity at the macroscopic level of WANs with the heavy-tailed behavior at the microscopic level of individual sources. 

  • [PF95] V. Paxson and S. Floyd, "Wide-area Traffic: The Failure of Poisson Modeling". IEEE/ACM Transactions on Networking, June 1995.  (html)

Present that traffic is self-similar in wide area network environments.

  • [FP01] Sally Floyd and Vern Paxson, "Difficulties in Simulating the Internet".  To appear in IEEE/ACM Transactions on Networking. February, 2001. (pdf)

"Modeling and simulating the Internet is not an easy task. The goal of this paper is to discuss some of the issues and difficulties in modeling Internet traffic, topologies, and protocols."

  • [Pax96] V. Paxson, "End-to-End Routing Behavior in the Internet". In Proceedings of ACM SIGCOMM '96, August 1996, Stanford, CA.  (pdf, ps.Z, viewgraph in ps.Z, the author's tutorial on Internet measurement in ps.Z)

Show the pathologies, stability, and symmetry of Internet routing. Pay attention to the methodology. You may find some other talks by this author also very interesting.

  • [Pax97]  V. Paxson, "End-to-End Internet Packet Dynamics". In Proceedings of SIGCOMM '97, pp. 139-152, Cannes, France, September 1997. (html)
     

  • [FFF99] Michalis Faloutsos, Petros Faloutsos, and Christos Faloutsos, "On Power-Law Relationships of the Internet Topology". In Proceedings of SIGCOMM '99. (html)

This paper starts the whole process of evaluating power-law in Internet. For a follow up, please read:

  • [SMW02] Neil Spring, Ratul Mahajan and David Wetherall, "Measuring ISP Topologies with Rocketfuel." In Proceedings of ACM SIGCOMM 2002. (html, video in Windows Media format)

          Sigcomm 2002 best paper.
 

Traffic management--congestion control, router mechanisms and pricing [14 34 basic papers] --- 杜海鹏


Specifies a rate-based, receiver-driven congestion control protocol.

  • [CJ89] D.-M. Chiu and R. Jain, "Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks". Computer Networks and ISDN Systems, Vol. 17, 1989, pp. 1-14. (html)

Propose the Additive Increase and Multiplicative Decrease algorithm.

  • [RCJ88] K. Ramakrishnan, D. Chiu, and R. Jain, "Congestion Avoidance in Computer Networks with a Connectionless Network Layer". In Proceedings of ACM SIGCOMM '88, Sept. 1988, pp. 303-313. (html) (Note: This is a revised version of the original SIGCOMM'88 paper.)

Specifies both router policies and user policies for congestion avoidance (not congestion control). Routers calculate average queue length at regeneration cycle. Users use AIMD. 

  • [RJ90] K.K. Ramakrishnan and R. Jain, "A Binary Feedback Scheme for Congestion Avoidance in Computer Networks". ACM Transactions on Computer Systems, Vol. 8, No. 2, pp 158-181, May, 1990. (pdf).

The first paper on binary feedback congestion control.

  • [Jac88] V. Jacobson, "Congestion Avoidance and Control". In Proceedings of ACM SIGCOMM '88, Sept. 1988, pp. 314-329. (html)

The classical paper on TCP congestion control.

A revision after the publication of the paper:



  • [Jac90] V. Jacobson, email to end2end-interest mailing list, Apr 30, 1990. (txt)

Revision to [Jac88]. Add fast retransmit and fast recovery.

  • [PFTK98] Padhye, J., Firoiu, V., Towsley, D., and Kurose, J., "Modeling TCP Throughput: a Simple Model and its Empirical Validation". In Proceedings of ACM SIGCOMM 1998. (ps.Z)

A model of TCP throughput.

  • [FF95] K. Fall and S. Floyd, "Comparisons of Tahoe, Reno, and Sack TCP". LBNL Technical report, December 1995.  (ps.Z)

Simulation comparisons of TCP/Tahoe, TCP/Reno, TCP/SACK. Read the new paper in SIGCOMM 2001 to see how they identify TCP versions.

  • [BP95] L. S. Brakmo and L. L. Peterson, "TCP Vegas: End to End Congestion Avoidance on a Global Internet". IEEE Journal on Selected Areas in Communications, Vol. 13, No. 8, October 1995. (html)

An interesting modification to TCP/Reno, as proposed in [Jac88, Jac90].

  • [BSK95] H. Balakrishnan, S. Seshan, R. H. Katz, "Improving Reliable Transport and Handoff Performance in Cellular Wireless Networks", ACM Wireless Networks, V 1, N 4, December, 1995. (html)

Modify network-layer software at the base station and mobile host, and preserve the end-to-end semantics of TCP.

  • [Ste97] W. Stevens, "TCP congestion control". RFC 2001, Jan 1997. (html)

          A summary of TCP congestion control. Refer to the book by the same author.
 

  • [AF99] M. Allman and A. Falk, On the Effective Evaluation of TCP, ACM Computer Communications Review, October 1999. (html)

This paper discusses issues in the evaluation of TCP performance.

  • [AAB00] E. Altman, K. Avrachenkov and C. Barakat,  "A Stochastic Model of TCP/IP with Stationary Random Loss". In Proceedings of SIGCOMM 2000. (ps.gz)

An model of TCP/Reno using stochastic equation.

  • [BH00] F. Baccelli and D. Hong, "TCP is Max-Plus Linear", In Proceedings of SIGCOMM 2000. (ps.gz)
     

  • [SCWA99] S. Savage, N. Cardwell, D. Wetherall, T. Anderson, "TCP Congestion Control with a Misbehaving Receiver". ACM CCR 1999. (pdf)

How to trick TCP?

  • [RF99] K. K. Ramakrishnan and S. Floyd, "A Proposal to add Explicit Congestion Notification (ECN) to IP". RFC 2481, Jan. 1999. (txt)
     

  • [YKL01] Yang Richard Yang, Min S. Kim, Simon S. Lam, "Transient Behaviors of TCP-Friendly Congestion Control". In Proceedings of IEEE INFOCOM 2001. (html)

Study the aggressiveness, responsiveness, smoothness, and fairness of 4 TCP-friendly congestion control protocols by using step functions.

  • [BBFS01] Deepak Bansal, Hari Balakrishnan, Sally Floyd, Scott Shenker, "Dynamic Behavior of Slowly-Responsive Congestion Control Algorithms". In Proceedings of ACM SIGCOMM 2001. (html) 

  • [DKS89] A. Demers, S. Keshav, and S. Shenker, "Analysis and Simulation of a Fair Queueing Algorithm". In Proceedings of ACM SIGCOMM'89, pp 3-12. (html)

First scheduling paper in computer networks.

  • [BZ96] J. C.R. Bennett and H. Zhang, "Hierarchical Packet Fair Queueing Algorithms. IEEE/ACM Transactions on Networking", 5(5):675-689, Oct 1997. Also in Proceedings of SIGCOMM'96, August, 1996. (pdf)
     

  • [SCP95] H. Sariowan, R. L. Cruz, and G. C. Polyzos, "Scheduling for Quality of Service Guarantees via Service Curves," Proceedings of the International Conference on Computer Communications and Networks (ICCCN) 1995, Las Vegas, September 20-23, 1995, pp. 512-520. (ps)

Propose service curves. Decouple bandwidth and delay.

  • [Kes91] S. Keshav "A Control-Theoretic Approach to Flow Control". In Proceedings of ACM SIGCOMM '91. (html)

Congestion control using control theory. The objective is to control the number of outstanding packets at the bottleneck. Use packet pair to estimate the service rate at the bottleneck. Assume round-robin like service at the bottleneck. A different perspective.

  • [CSZ92] D. Clark and S. Shenker and L. Zhang, "Supporting Real-Time Applications in an Integrated Services Packet Network: Architecture and Mechanism". In Proceedings of SIGCOMM '92, Baltimore, Maryland, Aug, 1992, pp 14-26. (html)
     

  • [FJ93] S. Floyd and V. Jacobson, "Random Early Detection gateways for Congestion Avoidance". IEEE/ACM Transactions on Networking, 1(4):397-413 August 1993. (html)

Propose and evaluate RED.

  • [MGW00] V. Misra, W. Gong and D. Towsley. "A Fluid-based Analysis of a Network of AQM Routers Supporting TCP Flows with an Application to RED". In Proceedings of ACM SIGCOMM 2000. (ps.gz)

An model of TCP/Reno using renewal theory.

  • [SS01] Srisankar Kunniyur, R. Srikant, "Analysis and Design of an Adaptive Virtual Queue (AVQ) Algorithm for Active Queue Management". In Proceedings of ACM SIGCOMM 2001. (html)

An active queue management scheme based on virtual queue. Compare with RED [FJ93]

  • [Z+93] L. Zhang, S. Deering, D. Estrin, S. Shenker, and D. Zappala, "RSVP: A New Resource Reservation Protocol". IEEE Communications Magazine, 31(9):8-18, September 1993. (ps.Z)

The signaling protocol for IntServ.

  • [BCS94] R. Braden, D. Clark, and S. Shenker. "Integrated Services in the Internet Architecture: an Overview". RFC 1633, June 1994.  (html)

An overview of the architecture of IntServ. See [DiffServ] for comparison.

  • [KBC94] H. T. Kung, T. Blackwell, and A. Chapman, "Credit-Based Flow Control for ATM Networks: Credit Update Protocol, Adaptive Credit Allocation, and Statistical Multiplexing". In Proceedings of ACM SIGCOMM '94. (html, pdf)

Here is a list  maintained by Richard Gibbens' on Pricing Internet Resources (Last modified in 1998.)

  • [Kel97] Frank Kelly, "Charging and rate control for elastic traffic". European Transactions on Telecommunications, volume 8 (1997) pages 33-37. (html)

    [LA00] Richard J. La, and Venkat Anantharam, "Charge-Sensitive TCP and Rate Control in the Internet". In Proceedings of IEEE INFOCOM 2000. (html)
     

  • [LPW01] Steve Low, Larry Peterson and Liming Wang, Understanding TCP vegas: a duality model. In SIGMETRICS 2001. (html)

  •  

  • [B+98] S. Blake et al., "An Architecture for Differentiated Services". RFC 2475, December 1998. (txt)

An overview of the architecture of DiffServ. See [IntServ] for comparison.

  • [CF98] D.D. Clark and W. Fang, "Explicit Allocation of Best-Effort Packet Delivery Service". IEEE/ACM Transactions on Networking. 6(4):362-373, August 1998. (ps)

  • [XCP] Dina Katabi, Mark Handley, and Chalrie Rohrs. Congestion Control for High Bandwidth-Delay Product Networks. In the proceedings on ACM Sigcomm 2002. (html)

Traffic management--adaptive applications  [3 basic papers] --- 赵辉


  • [PM95] V. Padmanabhan and J. Mogul, "Improving HTTP Latency", Computer Networks and ISDN Systems, v. 28, pp. 25-35, December 1995.  (html)
     

  • [BFT99] J. Bolot, S. Fosse-Parisis, D. Towsley, "Adaptive FEC-Based Error Control for Internet Telephony". In Proceedings of IEEE Infocom '99. (html)
     

  • [RHE99] R. Rejaie, M. Handley, D. Estrin, "Quality Adaptation for Congestion Controlled Video Playback over the Internet". In Proceedings of ACM SIGCOMM '99, September 1999. (html)

Adaptation by predication.

Network security [3 basic papers] --- 赵辉


  • [Bel89] S. Bellovin, "Security Problems in the TCP/IP Protocol Suite" Computer Communication Review, Vol. 19, No. 2, April 1989, pp. 32-254. (html)
     

  • [BAN90] Burrows and Abadi and Needham. "A Logic of Authentication."  Practical Cryptography for Data Internetworks, IEEE Computer Society Press. 1990. (html)
     

  • [APS99] George Apostolopoulos, Vinod Peris, and Debanjan Saha, "Transport Layer Security: How much does it really cost?" In Proceedings IEEE INFOCOM '99, New York, March 1999. (html)

 

  1. State-of-arts (最新的综述性文章, 全部阅读)

Multimedia and Networking 6 papers--- 赵辉

  • [WHZ01] Streaming video over the Internet: approaches and directions

  • [SES14] A Survey on Quality of Experience of HTTP Adaptive Streaming

  • [GHK13] HTTP adaptive streaming in mobile networks: characteristics and caching opportunities

  • [HS14] Energy Efficient Multimedia Streaming to Mobile Devices – A Survey

  • [HHB14] A survey on software defined networking (SDN) and openflow: From concept to implementation

  • [JP13] Network virtualization and software defined networking for cloud computing: a survey

Cloud computing, Media Cloud and Mobile Cloud 10 papers--- 赵辉

  •  [AFG09] Above the Clouds: A Berkeley View of Cloud Computing

  • [WZR14] Cloud Mobile Media: Reflections and Outlook

  • [SAG14] Heterogeneity in Mobile Cloud Computing: Taxonomy and Open Challenges

  • [QG12]Research on Mobile Cloud Computing: Review, Trend and Perspectives

  • [JS14]Resource Management in Clouds: Survey and Research Challenges

  • [KPJ13] Live Virtual Machine Migration Techniques: Survey and Research Challenges

  • [DLN13] A Survey of Mobile Cloud Computing: Architecture, Applications, and Approaches

  • [BBE13] Data center network virtualization: A survey

  • [MPZ10] Improving the scalability of data center networks with traffic-aware virtual machine placement

  • [KT12] A survey on optical interconnects for data centers


Others (选读)

Cloud Computing and Data Center 9 papers--- 赵辉

  • [MG10] [NIST:Definition] NIST definition of cloud computing (v15)
    P. Mell and T. Grance. May 2010. (The web link above has other information too. The document with the definition (v15) is in MS Word -- ironic for a standards body to use a not-quite-standard document format! I'll convert it to PDF and make a local copy at MIT.)

  • [DG08][MapReduce] MapReduce: Simplified Data Processing on Large Clusters
    J. Dean and S. Ghemawat
    OSDI 2004.

  • [WGB10][fos] An Operating System for Multicore and Clouds: Mechanisms and Implementation
    D. Wentzlaff, C. Gruenwald III, N. Beckmann, K. Modzelewski, A. Belay, L. Youseff, J. Miller, and A. Agarwal
    ACM Symp. Cloud Computing (SoCC), June 2010.

  • [KMK10][Marketplace] Director Enabling a Marketplace of Clouds: VMware's vCloud Director
    O. Krieger, P. McGachey, A. Kanevsky 
    ACM SIGOPS OSR, 44(4), December 2010.
    April 22 2011: Datacenter Networking

  • [VPS09] [Incast] Safe and Effective Fine-grained TCP Retransmissions for Datacenter Communication
    V. Vasudevan, A. Phanishayee, H. Shah, E. Krevat, D. Andersen, G. Ganger, G. Gibson, B. Mueller
    SIGCOMM 2009.

  • [GHM08][CloudCost] Cost of a cloud: Research Problems in Data Center Networks
    A Greenberg, J. Hamilton, D. Maltz, P. Patel.
    ACM SIGCOMM CCR, Jan. 2009.

  • [GHJ09][VL2] VL2: A Scalable and Flexible Data Center Network
    A. Greenberg, J. Hamilton, N. Jain, S. Kandula, C. Kim, P. Lahiri, D. Maltz, P. Patel, S. Sengupta
    SIGCOMM 2009.

  • [MPF09][Portland] Portland: A Scalable Fault-Tolerant Layer 2 Data Center Network Fabric
    R. Mysore, A. Pamboris, N. Farrington, N. Huang, P. Miri, S. Radhakrishnan, V. Subramanya, A. Vahdat
    SIGCOMM 2009.

  • [AMW10][EnergyPropDC] Energy Proportional Datacenter Networks
    D. Abts, M. Marty, P. Wells, P. Klauser, H. Liu
    ISCA 2010.



Dostları ilə paylaş:


Verilənlər bazası müəlliflik hüququ ilə müdafiə olunur ©genderi.org 2017
rəhbərliyinə müraciət

    Ana səhifə