1,410 research outputs found

    Datacenter Traffic Control: Understanding Techniques and Trade-offs

    Get PDF
    Datacenters provide cost-effective and flexible access to scalable compute and storage resources necessary for today's cloud computing needs. A typical datacenter is made up of thousands of servers connected with a large network and usually managed by one operator. To provide quality access to the variety of applications and services hosted on datacenters and maximize performance, it deems necessary to use datacenter networks effectively and efficiently. Datacenter traffic is often a mix of several classes with different priorities and requirements. This includes user-generated interactive traffic, traffic with deadlines, and long-running traffic. To this end, custom transport protocols and traffic management techniques have been developed to improve datacenter network performance. In this tutorial paper, we review the general architecture of datacenter networks, various topologies proposed for them, their traffic properties, general traffic control challenges in datacenters and general traffic control objectives. The purpose of this paper is to bring out the important characteristics of traffic control in datacenters and not to survey all existing solutions (as it is virtually impossible due to massive body of existing research). We hope to provide readers with a wide range of options and factors while considering a variety of traffic control mechanisms. We discuss various characteristics of datacenter traffic control including management schemes, transmission control, traffic shaping, prioritization, load balancing, multipathing, and traffic scheduling. Next, we point to several open challenges as well as new and interesting networking paradigms. At the end of this paper, we briefly review inter-datacenter networks that connect geographically dispersed datacenters which have been receiving increasing attention recently and pose interesting and novel research problems.Comment: Accepted for Publication in IEEE Communications Surveys and Tutorial

    The Trail, 2010-04-09

    Get PDF
    https://soundideas.pugetsound.edu/thetrail_all/1617/thumbnail.jp

    The Pacifican, Feburary 20, 1986

    Get PDF
    https://scholarlycommons.pacific.edu/pacifican/3675/thumbnail.jp

    Print- Mar. 29, 1974

    Get PDF
    https://neiudc.neiu.edu/print/1291/thumbnail.jp

    Maine Campus July 30 1970

    Get PDF

    Klipsun Magazine, 2006, Volume 36, Issue 06 - May

    Get PDF
    Change is scary. Staying in the comfort of the familiar is always easier than venturing into the unknown. That is why I am always inspired by people willing to innovate. It takes courage to look toward the new to amend the old. Stories such as Wave of the Future and Baker\u27s New Breakfast show how finding new ways to accomplish old goals can be a good thing. From the first bilingual school north of Seattle to an animal shelter that found an alternative to euthanizing, people are thinking outside of the box. I hope readers, when reading this issue of Klipsun, will find a story that helps them remember where they have been but more importantly inspire them to think about where they are going.https://cedar.wwu.edu/klipsun_magazine/1237/thumbnail.jp

    Approximation algorithms for distributed and selfish agents

    Get PDF
    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2005.Includes bibliographical references (p. 157-165).Many real-world systems involve distributed and selfish agents who optimize their own objective function. In these systems, we need to design efficient mechanisms so that system-wide objective is optimized despite agents acting in their own self interest. In this thesis, we develop approximation algorithms and decentralized mechanisms for various combinatorial optimization problems in such systems. First, we investigate the distributed caching and a general set of assignment problems. We develop an almost tight LP-based ... approximation algorithm and a local search ... approximation algorithm for these problems. We also design efficient decentralized mechanisms for these problems and study the convergence of the corresponding games. In the following chapters, we study the speed of convergence to high quality solutions on (random) best-response paths of players. First, we study the average social value on best response paths in basic-utility, market sharing, and cut games. Then, we introduce the sink equilibrium as a new equilibrium concept. We argue that, unlike Nash equilibria, the selfish behavior of players converges to sink equilibria and all strategic games have a sink equilibrium. To illustrate the use of this new concept, we study the social value of sink equilibria in weighted selfish routing (or weighted congestion) games and valid-utility (or submodular-utility) games. In these games, we bound the average social value on random best-response paths for sink equilibria.. Finally, we study cross-monotonic cost sharings and group-strategyproof mechanisms.(cont.) We study the limitations imposed by the cross-monotonicity property on cost-sharing schemes for several combinatorial optimization games including set cover and metric facility location. We develop a novel technique based on the probabilistic method for proving upper bounds on the budget-balance factor of cross-monotonic cost sharing schemes, deriving tight or nearly-tight bounds for these games. At the end, we extend some of these results to group-strategyproof mechanisms.by Vahab S. Mirrokni.Ph.D
    corecore