Mckeown Thesis Definition Dissertation

Dissertations

This dissertation explores the relationship between the parser and the grammar in error-driven retrieval by examining the mechanism underlying the illusory licensing of subject-verb agreement violations (‘agreement attraction’). Previous work motivates a two-stage model of agreement attraction in which the parser predicts the verb’s number and engages in retrieval of the agreement controller only when it detects a mismatch between the prediction and the bottom-up input (Wagers, Lau & Phillips, 2009; Lago, Shalom, Sigman, Lau & Phillips, 2015). It is the second stage of retrieval and feature-checking that is thought to be error-prone, resulting in agreement attraction. Here we investigate two ...

 

This dissertation focuses on when and how children learn about the meanings of the propositional attitude verbs "know" and "think". "Know" and "think" both express belief. But they differ in their veridicality: "think" is non-veridical and can report a false belief; but "know" can only report true beliefs because it is a veridical verb. Furthermore, the verbs differ in their factivity: uses of "x knows p", but not uses of "x thinks p", typically presuppose the truth of "p", because "know" is factive and "think" is not. How do children figure out these subtle differences between the verbs, given that ...

 

This dissertation is concerned with how elliptical sentences are generated. To be specific, I investigate when and in what module ellipsis occurs, and what is elided as a result of ellipsis. With regard to the first research question, I propose that XP ellipsis occurs as soon as all the featural requirements of the licensor of XP ellipsis are satisfied during the derivation, rather than in the other modules. An important consequence of this proposal is that the point of XP ellipsis can vary depending on the derivational point where all the featural requirements of the licensor are satisfied in narrow ...

 

This dissertation is concerned with experiencer arguments, and what they tell us about the grammar. There are two main types of experiencers I discuss: experiencers of psychological verbs and experiencers of raising constructions. I question the notion of ‘experiencers’ itself; and explore some possible accounts for the ‘psych-effects’. I argue that the ‘experiencer theta role’ is conceptually unnecessary and unsustained by syntactic evidence. ‘Experiencers’ can be reduced to different types of arguments. Taking Brazilian Portuguese as my main case study, I claim that languages may grammaticalize psychological predicates and their arguments in different ways. These verb classes exist in languages ...

 

Humans use their grammatical knowledge in more than one way. On one hand, they use it to understand what others say. On the other hand, they use it to say what they want to convey to others (or to themselves). In either case, they need to assemble the structure of sentences in a systematic fashion, in accordance with the grammar of their language. Despite the fact that the structures that comprehenders and speakers assemble are systematic in an identical fashion (i.e., obey the same grammatical constraints), the two ‘modes’ of assembling sentence structures might or might not be performed ...

 

This dissertation uses children’s acquisition of adjunct control as a case study to investigate grammatical and performance accounts of language acquisition. In previous research, children have consistently exhibited non-adultlike behavior for sentences with adjunct control. To explain children’s behavior, several different grammatical accounts have been proposed, but evidence for these accounts has been inconclusive. In this dissertation, I take two approaches to account for children’s errors.

First, I spell out the predictions of previous grammatical accounts, and test these predictions after accounting for some methodological concerns that might have influenced children’s behavior in previous studies. While ...

 

Attitude verbs (e.g., think, want, hope) report mental states. Learning the meanings of attitude verbs may be difficult for language learners for several reasons; including the abstractness of the concepts that they refer to, and the linguistic properties. In this dissertation, we investigate the learning process for these words, by looking at an asymmetry that has been observed in the acquisition trajectory: want, which refers to desires, has been claimed to be acquired before think, which refers to beliefs. We explore this asymmetry in attitude verb acquisition in two ways: by comparing interpretation of think and want, controlling for ...

 

Any kind of uninstructed learning, faced by the challenge that any finite experience is consistent with infinitely many hypotheses, must proceed under guidance. This dissertation investigates guided vocabulary acquisition with a focus on verb learning. In particular, it examines some proposed early expectations that the young language learner may hold as guidance in learning novel verbs, and investigates the nature of these expectations from different angles. Four lines of studies are reported, each discussing a different question. Study 1 focuses on the expectation that the grammatical category verb picks out the conceptual category event – the verb-event bias, and examines the ...

 

The purpose of this thesis is to construct a theory to derive how pied-piping of formal features of a moved element takes place, by which some syntactic phenomena related to φ-features can be accounted for. Ura (2001) proposes that pied-piping of formal-features of a moved element is constrained by an economy condition like relativized minimality. On the basis of Ura’s (2001) proposal, I propose that how far an element that undergoes movement can carry its formal features, especially focusing on φ-features in this thesis, is determined by two conditions, a locality condition on the generalized pied-piping and an anti-locality ...

 

Every difference between languages is a “choice point” for the syntactician, psycholinguist, and language learner. The syntactician must describe the differences in representations that the grammars of different languages can assign. The psycholinguist must describe how the comprehension mechanisms search the space of the representations permitted by a grammar to quickly and effortlessly understand sentences in real time. The language learner must determine which representations are permitted in her grammar on the basis of her primary linguistic evidence. These investigations are largely pursued independently, and on the basis of qualitatively different data. In this dissertation, I show that these investigations ...

 

Some words are harder to learn than others. For instance, action verbs like run and hit are learned earlier than propositional attitude verbs like think and want. One reason think and want might be learned later is that, whereas we can see and hear running and hitting, we can’t see or hear thinking and wanting. Children nevertheless learn these verbs, so a route other than the senses must exist. There is mounting evidence that this route involves, in large part, inferences based on the distribution of syntactic contexts a propositional attitude verb occurs in—a process known as syntactic ...

 

In order to understand the nature of a given linguistic phenomena in the adult grammar, language acquisition research explores how children’s competence with respect to such a phenomena develops. However, diagnosing competence can be challenging because it is not directly observable. Researchers only have access to performance, which is mediated by additional factors and is not a direct reflection of competence. In this dissertation, I explore a case study of children’s early syntactic knowledge. My in-depth analysis of Principle C at 30 months provides novel insights into diagnostics for underlying competence by utilizing two distinct methods of analysis ...

 

This dissertation explores the role of morphological and syntactic variation in sentence comprehension across languages. While most previous research has focused on how cross-linguistic differences affect the control structure of the language architecture (Lewis & Vasishth, 2005) here we adopt an explicit model of memory, content-addressable memory (Lewis & Vasishth, 2005; McElree, 2006) and examine how cross-linguistic variation affects the nature of the representations and processes that speakers deploy during comprehension. With this goal, we focus on two kinds of grammatical dependencies that involve an interaction between language and memory: subject-verb agreement and referential pronouns. In the first part of this dissertation ...

 

In this dissertation I present a model that captures categorical effects in both first language (L1) and second language (L2) speech perception. In L1 perception, categorical effects range between extremely strong for consonants to nearly continuous perception of vowels. I treat the problem of speech perception as a statistical inference problem and by quantifying categoricity I obtain a unified model of both strong and weak categorical effects. In this optimal inference mechanism, the listener uses their knowledge of categories and the acoustics of the signal to infer the intended productions of the speaker. The model splits up speech variability into ...

 

Determining the semantic content of sentences, and uncovering regularities between linguistic form and meaning, requires attending to both morphological and syntactic properties of a language with an eye to the notional categories that the various pieces of form express. In this dissertation, I investigate the morphosyntactic devices that English speakers (and speakers of other languages) can use to talk about comparisons between things: comparative sentences with, in English, more... than, as... as, too, enough, and others. I argue that a core component of all of these constructions is a unitary element expressing the concept of measurement.

The theory that I ...

 

This dissertation is concerned with the cognitive mechanisms that are used to encode and navigate linguistic structure. Successful language understanding requires mechanisms for efficiently encoding and navigating linguistic structure in memory. The timing and accuracy of linguistic dependency formation provides valuable insights into the cognitive basis of these mechanisms. Recent research on linguistic dependency formation has revealed a profile of selective fallibility: some linguistic dependencies are rapidly and accurately implemented, but others are not, giving rise to “linguistic illusions”. This profile is not expected under current models of grammar or language processing. The broad consensus, however, is that the profile ...

 

This thesis attempts to assimilate head movement as far as possible to phrasal movement. In particular, I argue that if we assume that the computational system of natural languages does not discriminate head movement from phrasal movement in terms of locality and the possible mode of operation, a distributional difference between these two types of movement can be explained by the interaction between a locality constraint and an anti-locality constraint to which syntactic movement operations are subject, and crosslinguistic variations in the possibility of what I will call and can be reduced to parameters that are ...

 

Three types of nominal anaphors are investigated: (i) pronouns, (ii) partitive ellipsis and (iii) the contrastive anaphor 'one'. I argue that in each case, the representational basis for anaphora is the same, a semantic variable ranging over singular or plural entities, rather than syntactic as previous approaches have suggested. In the case of pronouns, I argue against syntactic D-type approaches (Elbourne 2005) and semantic D-type approaches (Cooper 1979). Instead, I present arguments in favor of the set variable representation assumed under Nouwen (2003)’s approach. Following this, I consider a number of cases usually taken to involve the elision of ...

 

This dissertation deals with the theory of the phonetic component of grammar in a formal probabilistic inference framework: (1) it has been recognized since the beginning of generative phonology that some language-specific phonetic implementation is actually context-dependent, and thus it can be said that there are gradient “phonetic processes” in grammar in addition to categorical “phonological processes.” However, no explicit theory has been developed to characterize these processes. Meanwhile, (2) it is understood that language acquisition and perception are both really informed guesswork: the result of both types of inference can be reasonably thought to be a less-than-perfect committment, with ...

 

The goal of language comprehension for humans is not just to decode the semantic content of sentences, but rather to grasp what speakers intend to communicate. To infer speaker meaning, listeners must at minimum assess whether and how the literal meaning of an utterance addresses a question under discussion in the conversation. In cases of implicature, where the speaker intends to communicate more than just the literal meaning, listeners must access additional relevant information in order to understand the intended contribution of the utterance. I argue that the primary challenge for inferring speaker meaning is in identifying and accessing this ...

 

Adult second language (L2) learners often experience di⇤culty producing and perceiving non-native phonological contrasts. Even highly proficient bilinguals, who have been exposed to an L2 for long periods of time, struggle with difficult contrasts, such as /r/-/l/ for Japanese learners of English. To account for the relative ease or diffculty with which L2 learners perceive and acquire non-native contrasts, theories of (L2) speech perception often appeal to notions of similarity. But how is similarity best determined?

In this dissertation I explored the predictions of two theoretical approaches to similarity comparison in the second language, and asked: [1] How ...

 

In this dissertation I explore the nature of interpretive dependencies in human language. In particular I investigate the limits of syntactically mediated interpretive dependencies as well as non-syntactic ones. Broadly speaking I investigate the limits of grammatical dependencies and note that current theory cannot possibly handle certain dependencies. That certain dependencies evade grammatical explanation requires a rethinking of the representations of those dependencies. The results of this investigation concern the primacy and the purview of the syntax component of the grammar. In short, the purview of syntactic relations is limited to c-command and if a c-command relation holds between two ...

 

This thesis explores how predictions about upcoming language inputs are computed during real-time language comprehension. Previous research has demonstrated humans’ ability to use rich contextual information to compute linguistic prediction during real-time language comprehension, and it has been widely assumed that contextual information can impact linguistic prediction as soon as it arises in the input. This thesis questions this key assumption and explores how linguistic predictions develop in real- time. I provide event-related potential (ERP) and reading eye-movement (EM) evidence from studies in Mandarin Chinese and English that even prominent and unambiguous information about preverbal arguments’ structural roles cannot immediately ...

 

This thesis examines reflexive pronouns, such as Icelandic sig (Cf. Thráinsson 2007), which may be bound from outside of an infinitive clause (which I call MD “medium distance” binding) in addition to being bound locally. I propose that such reflexives are linked to their antecedents via sisterhood followed by movement: the reflexive and antecedent are first merged together as sisters, and the antecedent subsequently moves to receive its first theta-role, as schematized below:

  1. He ordered Harold to shave he+sig

This links the properties of bound simplex reflexives to the properties of movement. I argue that reflexives such as sig ...

 

Comparative correlatives, like the longer you stay out in the rain, the colder you’ll get, are prolific in the world’s languages (i.e., there is no evidence of a language that lacks comparative correlatives). Despite this observation, the data do not present a readily apparent syntax. What is the relationship between the two clauses? What is the main verb? What is English’s the which obligatorily appears at the start of each clause?

This thesis reviews prior analyses of comparative correlatives, both syntactic and semantic (Fillmore, 1987; McCawley, 1988; McCawley, 1998; Beck, 1997; Culicover & Jackendoff, 1999; Borsley, 2003 ...

 

This dissertation presents an approach for a productive way forward in the study of language acquisition, sealing the rift between claims of an innate linguistic hypothesis space and powerful domain general statistical inference. This approach breaks language acquisition into its component parts, distinguishing the input in the environment from the intake encoded by the learner, and looking at how a statistical inference mechanism, coupled with a well de ned linguistic hypothesis space could lead a learn to infer the native grammar of their native language. This work draws on experimental work, corpus analyses and computational models of Tsez, Norwegian and ...

 

This dissertation attempts to unify two reductionist hypotheses: that there is no relational difference between specifiers and complements, and that verbs do not have thematic arguments. I argue that these two hypotheses actually bear on each other and that we get a better theory if we pursue both of them.

The thesis is centered around the following hypothesis: Each application of Spell-Out corresponds to a conjunct at logical form. In order to create such a system, it is necessary to provide a syntax that is designed such that each Spell-Out domain is mapped into a conjunct. This is done by ...

 

This thesis is concerned with the nature of memory access during the construction of long-distance dependencies in online sentence comprehension. In recent years, an intense focus on the computational challenges posed by long-distance dependencies has proven to be illuminating with respect to the characteristics of the architecture of the human sentence processor, suggesting a tight link between general memory access procedures and sentence processing routines (Lewis & Vasishth 2005; Lewis, Vasishth, & Van Dyke 2006; Wagers, Lau & Phillips 2009). The present thesis builds upon this line of research, and its primary aim is to motivate and defend the hypothesis that the parser ...

 

The purpose of this dissertation is to explore the nature of intervention effects seen in various constructions like Wh-scope marking, raising and passivization. In particular, this dissertation argues in favor of a movement account for all these cases and supports the idea that (syntactic) movement is inevitable and sufficient enough to provide a unified account of various structural relations (Hornstein, 2009). It further argues that movement always happens in narrow syntax, even when it isn’t visible. For some of these invisible cases, this dissertation suggests head movement as an alternative to LF movement and Agree.

The second aim of ...

 

This thesis investigates the implications of binding phenomena for the development of a reductionist theory of grammatical dependencies. The starting point isthe analysis of binding and control in Hornstein (2001, 2009). A number of revisions are made to this framework in order to develop a simpler and empirically more successful account of binding phenomena.

The major development is the rejection of economy-based accounts of Condition B effects. It is argued that Condition B effects derive directly from an anti-locality constraint on A-movement. Competition between different dependencytypes is crucial to the analysis, but is formulated in terms of a heavily revisedversion ...

 

The purpose of this dissertation is to reconsider reflexives in Japanese through thefollowing three steps: (a) separation of genuine reflexive elements from elements that areconfounded as reflexives, (b) classification of reflexive anaphors into subtypes based ontheir semantic difference, and (c) classification of predicates that occur with anaphors.Many researchers have worked on the reflexive element zibun ‘self,’ but Japanesehas other reflexive elements as well. These elements including zibun have not onlythe reflexive anaphor usage but also other ones. All the instances are, however, oftenlumped together under the category ‘reflexives.’ I distinguish genuine reflexive anaphorsin Japanese from elements that are confounded ...

 

This dissertation explores the hypothesis that language processing proceeds in “windows” that correspond to representational units, where sensory signals are integrated according to time-scales that correspond to the rate of the input. To investigate universal mechanisms, a comparison of signed and spoken languages is necessary. Underlying the seemingly effortless process of language comprehension is the perceiver’s knowledge about the rate at which linguistic form and meaning unfold in time and the ability to adapt to variations in the input.

The vast body of work in this area has focused on speech perception, where the goal is to determine how ...

 

The precise contribution and mechanism of sensory feedback (particularly auditory feedback) in successful speech production is unclear. Some models of speech production, such as DIVA, assert that speech production is based on attempting to produce auditory (and/or somatosensory targets; e.g. Guenther et al. 2006), and thus assign a central role to sensory feedback for successful speech motor control. These models make explicit predictions about the neural basis of speech production and the integration of auditory and somatosensory feedback and predict predict basal ganglia involvement in speech motor control. In order to test the implications of models depending on ...

 

This study investigates properties of adjunct control with a particular focus on Turkish providing an analysis for different types of adjunct control structures such as temporal adjunct clauses and purpose clauses, which have been understudied in Turkish linguistics. In analyzing adjunct control structures, I use Agree-based Theory of Control (ATC) (Landau 2000 and 2004) as a theoretical basis. I introduce a new interarboreal operation that I call Interarboreal Agree which draws upon the intuitions of Nunes (1995) that syntactic relations can be established between two unconnected trees. This analysis refines ATC in that ATC in its current form fails to ...

 

That we perceive our environment as a unified scene rather than individual streams ofauditory, visual, and other sensory information has recently provided motivation tomove past the long-held tradition of studying these systems separately. Although theyare each unique in their transduction organs, neural pathways, and cortical primaryareas, the senses are ultimately merged in a meaningful way which allows us tonavigate the multisensory world. Investigating how the senses are merged has becomean increasingly wide field of research in recent decades, with the introduction andincreased availability of neuroimaging techniques. Areas of study range frommultisensory object perception to cross-modal attention, multisensory interactions,and integration ...

 

Systems that process natural language must cope with and resolve ambiguity. In this dissertation, a model of language processing is advocated in which multiple inputs and multiple analyses of inputs are considered concurrently and a single analysis is only a last resort. Compared to conventional models, this approach can be understood as replacing single-element inputs and outputs with weighted sets of inputs and outputs. Although processing components must deal with sets (rather than individual elements), constraints are imposed on the elements of these sets, and the representations from existing models may be reused. However, to deal efficiently with large (or ...

 

This dissertation revisits subject island effects (Ross 1967, Chomsky 1973) cross-linguistically. Controlled acceptability judgment studies in German, English, Japanese and Serbian suggest that extraction out of specifiers is consistently degraded compared to extraction out of complements, indicating that the Condition on Extraction domains (CED, Huang 1982) is still empirically viable, contrary to recent claims (Stepanov 2007). As a consequence, recent treatments of the CED in terms of Multiple Spell-Out (Uriagereka 1999) are still tenable. First, a series of NP-subextraction experiments in German using 'was für'-split is discussed. The results indicate that subject island effects cannot be reduced to freezing ...

 

This dissertation investigates adults and children's sentence processing mechanisms, with a special focus on how multiple levels of linguistic representation are incrementally computed in real time, and how this process affects the parser's ability to later revise its early commitments. Using cross-methodological and cross-linguistic investigations of long-distance dependency processing, this dissertation demonstrates how paying explicit attention to the procedures by which linguistic representations are computed is vital to understanding both adults' real time linguistic computation and children's reanalysis mechanisms. The first part of the dissertation uses time course evidence from self-paced reading and eye tracking studies (reading ...

 

In this thesis I explore the syntactic and semantic properties of movement and adjunction in natural language, and suggest that these two phenomena are related in a novel way. In a precise sense, the basic pieces of grammatical machinery that give rise to movement, also give rise to adjunction. In the system I propose, there is no atomic movement operation and no atomic adjunction operation; the terms "movement" and "adjunction" serve only as convenient labels for certain combinations of other, primitive operations. As a result the system makes non-trivial predictions about how movement and adjunction should interact, since we do ...

 

The goal of this dissertation is to show that even at the earliest (non-invasive) recordable stages of auditory cortical processing, we find evidence that cortex is calculating abstract representations from the acoustic signal. Looking across two distinct domains (inferential pitch perception and vowel normalization), I present evidence demonstrating that the M100, an automatic evoked neuromagnetic component that localizes to primary auditory cortex is sensitive to abstract computations. The M100 typically responds to physical properties of the stimulus in auditory and speech perception and integrates only over the first 25 to 40 ms of stimulus onset, providing a reliable dependent measure ...

 

This dissertation examines the elliptical structures of (a) sluicing (John called someone, but I don't know who!), (b) fragment answers (A: Who did John call?, B: Mary!), (c) gapping (John is eating ice-cream, and Mary apple pie!), and (d) Right Node Raising (John cooked and Mary ate the apple pie!) in Turkish and gives a PF-deletion-based analysis of all these elliptical structures. As to sluicing and fragment answers, evidence in support of PF-deletion comes from P-(non-)stranding and Case Matching, respectively. Further, these elliptical structures are island-insensitive in Turkish. As to gapping, this study gives a movement + deletion ...

 

This dissertation focuses on effective combination of data-driven natural language processing (NLP) approaches with linguistic knowledge sources that are based on manual text annotation or word grouping according to semantic commonalities. I gainfully apply fine-grained linguistic soft constraints -- of syntactic or semantic nature -- on statistical NLP models, evaluated in end-to-end state-of-the-art statistical machine translation (SMT) systems. The introduction of semantic soft constraints involves intrinsic evaluation on word-pair similarity ranking tasks, extension from words to phrases, application in a novel distributional paraphrase generation technique, and an introduction of a generalized framework of which these soft semantic and syntactic constraints can be ...

 

The notion that children use statistical distributions present in the input to acquire various aspects of linguistic knowledge has received considerable recent attention. But the roles of learner's initial state have been largely ignored in those studies. What remains unclear is the nature of learner's contribution. At least two possibilities exist. One is that all that learners do is to collect and compile accurately predictive statistics from the data, and they do not have antecedently specified set of possible structures (Elman, et al. 1996; Tomasello 2000). On this view, outcome of the learning is solely based on the ...

 

This dissertation explores the hypothesis that predictive processing—the access and construction of internal representations in advance of the external input that supports them—plays a central role in language comprehension. Linguistic input is frequently noisy, variable, and rapid, but it is also subject to numerous constraints. Predictive processing could be a particularly useful approach in language comprehension, as predictions based on the constraints imposed by the prior context could allow computation to be speeded and noisy input to be disambiguated. Decades of previous research have demonstrated that the broader sentence context has an effect on how new input is ...

 

Since Ross (1967), it has been observed that there are configurations from which otherwise unbounded movement operations cannot occur, and they are called islands. Ellipsis and resumption are known to have a peculiar property to 'repair' island violations. Each chapter of this thesis discusses a case of ellipsis/resumption to examine in what cases movement out of an island becomes licit by those strategies. Chapter 2 discusses the elliptical construction called sluicing, and argues for the PF-deletion analysis of sluicing (Merchant 2001, originated from Ross 1969). I will show that ECP violations made by adjunct sluicing cannot be repaired by ...

 

One of the main challenges in the study of cognition is how to connect brain activity to cognitive processes. In the domain of language, this requires coordination between two different lines of research: theoretical models of linguistic knowledge and language processing on the one side and brain sciences on the other. The work reported in this dissertation attempts to link these two lines of research by focusing on one particular aspect of linguistic processing, namely lexical access. The rationale for this focus is that access to the lexicon is a mandatory step in any theory of linguistic computation, and therefore ...

 

This dissertation is concerned with whether the sentence processor can compute plausible relations among a cluster of neighboring open class words without taking into account the relationships between these words as dictated by the structure of the sentence. It has been widely assumed that compositional semantics is built on top of syntactic structures (Heim & Kratzer, 1998; Pollard & Sag, 1994). This view has been challenged by recent electrophysiological findings (Kim and Osterhout, 2005; Kuperberg, 2007; van Herten et al., 2005, 2006) that appear to show that semantic composition can proceed independently of syntactic structure. This dissertation investigates whether the evidence for ...

 

This dissertation discusses how pragmatic factors contribute to children's behavior in interpreting scopally ambiguous forms. In particular, we look at children's interpretation of negated sentences involving disjunction in the object (NegDisjunction). Languages like English and Chinese allow scope interaction between negation and disjunction of this kind of strings and thus two corresponding interpretations: the narrow scope disjunction interpretation (the NSD, meaning "neither"), thus the wide scope disjunction interpretation (the WSD, meaning "not this or not that"); but languages like Japanese only allow the WSD. Previous studies found out that children of different languages accessed the NSD instead of ...

 

This dissertation is concerned with the problem of how structured linguistic representations interact with the architecture of human memory. Much recent work has attempted to unify real-time linguistic memory with a general content-addressable architecture (Lewis & Vasishth, 2005; McElree, 2006). Because grammatical principles and constraints are strongly relational in nature, and linguistic representation hierarchical, this kind of architecture is not well suited to restricting the search of memory to grammatically-licensed constituents alone. This dissertation investigates under what conditions real-time language comprehension is grammatically accurate. Two kinds of grammatical dependencies were examined in reading time and speeded grammaticality experiments: subject-verb agreement licensing ...

 

This dissertation investigates the contributions of the parser and extra-linguistic information in the selection of a final interpretation of scopally ambiguous strings, integrating data from both children and adults into our understanding of language processing. Previous research has found an advantage for surface scope interpretations in adult sentence processing (Tunstall,1998 & Anderson,2003) and in children's interpretive preferences (Musolino and Lidz, 2006). In light of these findings, we investigate two central questions. One, what is the source of the advantage for surface scope interpretations in adults? Two, what factors contribute to children's ultimate adherence to surface scope interpretations ...

 

The focus of this dissertation is syntactic movement and its relationship to surface semantics, morphology, and licensing relations in syntax, with an emphasis on Spanish and English. Chapter 2 argues that Herburger's (2000) Neo-Davidsonian approach to the semantics of focus, as syntactically implemented by Uriagereka (2005), allows for a unified treatment of new information focus and contrastive focus (focus movement to the left periphery and in situ focus) in Spanish. The diverse positions that the focused element can take in the sentence are claimed to be determined by contextual anchoring mechanisms of Raposo and Uriagereka (1995). This entails a ...

 

Nick McKeown - Papers

sort by topic | sort by date | sort by type

Programmable Networks

  1. Packet Transactions: High-Level Programming for Line-Rate Switches
    Anirudh Sivaraman, Alvin Cheung, Mihai Budiu, Changhoon Kim, Mohammad Alizadeh, Hari Balakrishnan, George Varghese, Nick McKeown, Steve Licking
    SIGCOMM '16 Florianopolis, Brazil
    14 pages [ pdf ]
  2. Programmable Packet Scheduling at Line Rate
    Anirudh Sivaraman, Suvinay Subramanian, Mohammad Alizadeh, Sharad Chole, Shang-Tse Chuang, Anurag Agrawal, Hari Balakrishnan, Tom Edsall, Sachin Katti, Nick McKeown
    SIGCOMM '16 Florianopolis, Brazil
    14 pages [ pdf ]
  3. Virtualized Congestion Control
    Bryce Cronkite-Ratcliff, Aran Bergman, Shay Vargaftik, Madhusudhan Ravi, Nick McKeown, Ittai Abraham, Isaac Keslassy
    SIGCOMM '16 Florianopolis, Brazil
    14 pages [ pdf ]
  4. PISCES: A Programmable, Protocol-Independent Software Switch
    Muhammad Shahbaz, Sean Choi, Ben Pfaff, Changhoon Kim, Nick Feamster, Nick McKeown, Jennifer Rexford
    SIGCOMM '16 Florianopolis, Brazil
    14 pages [ pdf ]
  5. Programming the Network Dataplane in P4 (in Chinese)
    Changhoom Kim, Ron Kao, Nick McKeown
    Communications of the CCF (China Computer Federation)
    10 pages [ pdf ]
  6. Towards Programmable Packet Scheduling
    Anirudh Sivamaran, Suvinay Subramanian, Anurag Agrawal, Sharad Chole, Shang-Tse Chuang, Tom Edsall, Mohammad Alizadeh, Sachin Katti, Nick McKeown, Hari Balakrishnan
    HotNets' 15, Philadelphia, PA
    7 pages [ pdf ]
  7. High Speed Networks Need Proactive Congestion Control
    Lavanya Jose, Lisa Yan, Mohammad Alizadeh, George Varghese, Nick McKeown, Sachin Katti
    HotNets' 15, Philadelphia, PA
    7 pages [ pdf ]
  8. Compiling Packet Programs to Reconfigurable Switches
    Lavanya Jose, Lisa Yan, George Varghese, Nick McKeown
    NSDI '15, Oakland, CA
    13 pages [ pdf ]

Network Neutrality

  1. Neutral Net Neutrality
    Yiannis Yiakoumis, Sachin Katti, Nick McKeown
    SIGCOMM '16 Florianopolis, Brazil
    14 pages [ pdf ]
  2. Putting Home Users in Charge of their Network
    Yiannis Yiakoumis, Te-Yuan Huang, Kok-Kiong Yap, Sachin Katti, Ramesh Johari, Nick McKeown
    ACM HomeSys Workshop 2012, Sep., Pittsburgh, PA, USA (Affiliated with ACM Ubicomp 2012)
    6 pages [ pdf ]

Education Tools

  1. Learning Networking by Reproducing Research Results (CCR Best Paper 2016)
    Lisa Yan, Nick McKeown
    ACM CCR Journal
    8 pages [ pdf ]

Software Defined Networks

  1. BeHop: A Testbed for Dense Wifi Networks
    Yiannis Yiakoumis, Manu Bansal, Adam Covington, Johan van Reijendam, Sachin Katti, Nick McKeown
    Wintech 2014, Maui, USA 2014
    8 pages [ pdf ]
  2. OSNT: Open Source Network Tester
    Gianni Antichi, Muhammad Shahbaz, Yilong Geng, Noa Zilberman, Adam Covington, Marc Bruyere, Nick McKeown, Nick Feamster
    Network, IEEE, September 2014
    6 pages [ pdf ]
  3. Flow Caching For High Entropy Packet Fields
    Nick Shelly, Ethan J Jackson, Teemu Koponen, Nick McKeown, Jarno Rajahalme
    Hot Topics in Software Defined Networking 2014, Chicago, IL, August 2014
    2 pages [ pdf ]
  4. P4: Programming Protocol-Independent Packet Processors
    Pat Bosshart, Dan Daly, Glen Gibb, Martin Izzard, Nick McKeown, Jennifer Rexford, Cole Schlesinger, Dan Talayco, Amin Vahdat, George Varghese, David Walker
    ACM Sigcomm Computer Communications Review (CCR). Volume 44, Issue #3 (July 2014)
    8 pages [ pdf ]
  5. Maturing of OpenFlow and Software-defined Networking through deployments
    Masayoshi Kobayashi, Srini Seetharaman, Guru Parulkar, Guido Appenzeller, Joseph Little, Johan Van Reijendam, Paul Weissmann, Nick McKeown
    Computer Networks, Vol 61, Pages 151-175 (March 2014)
    24 pages [ pdf ]
  6. Rethinking IP Core Networks
    Saurav Das, Guru Parulkar, Nick McKeown
    Journal of Optical Communications and Networking, December 2013
    12 pages [ pdf ]
  7. Maturing of OpenFlow and Software-dened Networking through Deployments
    Masayoshi Kobayashi, Srini Seetharaman, Guru Parulkar, Guido Appenzeller, Joseph Little, Johan van Reijendam, Paul Weissmann, Nick McKeown
    Elsevier October 2013
    25 pages [ pdf ]
  8. Design Principles for Packet Parsers
    Glen Gibb, George Varghese, Mark Horowitz, Nick McKeown
    ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS 2013)
    12 pages [ pdf ]
  9. Forwarding metamorphosis: fast programmable match-action processing in hardware for SDN
    Pat Bosshart, Glen Gibb, Hun-Seok Kim, George Varghese, Nick McKeown, Martin Izzard, Fernando Mujica, Mark Horowitz
    ACM SIGCOMM 2013
    12 pages [ pdf ]

Video Streaming

  1. A Buffer-Based Approach to Rate Adaptation: Evidence from a Large Video Streaming Service
    Te-Yuan Huang, Ramesh Johari, Nick McKeown, Matthew Trunnell, Mark Watson
    ACM Sigcomm 2014, Chicago
    14 pages [ pdf ]
  2. Downton Abbey Without the Hiccups: Buffer-Based Rate Adaptation for HTTP Video Streaming
    Te-Yuan Huang, Ramesh Johari, Nick McKeown
    ACM SIGCOMM 2013 Workshop on Future Human-Centric Multimedia Networking (FhMN)
    6 pages [ pdf ]
  3. Confused, Timid, and Unstable: Picking a Video Streaming Rate is Hard
    Te-Yuan Huang, Nikhil Handigol, Brandon Heller, Nick McKeown, Ramesh Johari
    ACM SIGCOMM Internet Measurement Conference (IMC), Boston, Nov, 2012
    14 pages [ pdf ]

Network Verification and Debugging

  1. I Know What Your Packet Did Last Hop: Using Packet Histories to Troubleshoot Networks
    Nikhil Handigol, Brandon Heller, Vimalkumar Jeyakumar, David Mazieres, Nick McKeown
    NSDI 2014, Seattle, WA
    16 pages [ pdf ]
  2. Libra: Divide and Conquer to Verify Forwarding Tables In Huge Networks
    Hongyi Zeng, Shidong Zhang, Fei Ye, Vimalkumar Jeyakumar, Mickey Ju, Junda Liu, Nick McKeown, Amin Vahdat
    NSDI 2014, Seattle, WA
    12 pages [ pdf ]
  3. Leveraging SDN Layering to Systematically Troubleshoot Networks
    Brandon Heller, Colin Scott, Nick McKeown, Scott Shenker, Andreas Wundsam, Hongyi Zeng, Sam Whitlock, Vimalkumar Jeyakumar, Nikhil Handigol, James McCauley, Kyriakos Zaris, Peyman Kazemian
    ACM SIGCOMM 2013 Hot Topics in Software Defined Networking (HotSDN)
    6 pages [ pdf ]
  4. Real Time Network Policy Checking using Header Space Analysis
    Peyman Kazemian, Michael Chang, Hongyi Zeng, George Varghese, Nick McKeown, Scott Whyte
    10th USENIX Symposium on Networked Systems Design and Implementation (NSDI 2013)
    13 pages [ pdf ]
  5. Automatic Test Packet Generation
    Hongyi Zeng, Peyman Kazemian, George Varghese, Nick McKeown
    IEEE/ACM Transactions on Networking
    12 pages [ pdf ]
  6. Automatic Test Packet Generation
    Hongyi Zeng, Peyman Kazemian, George Varghese, Nick McKeown
    The 8th International Conference on emerging Networking EXperiments and Technologies (CoNEXT 2012), Nice, France
    12 pages [ pdf ]
  7. Where is the Debugger for my Software-Defined Network?
    Nikhil Handigol, B. Heller, V. Jeyakumar, D. Mazieres, N. McKeown
    HotSDN 2012, Helsinki, Finland (Best Student Presentation Award)
    6 pages [ pdf ]
  8. Header Space Analysis: Static Checking for Networks
    Peyman Kazemian, George Varghese, Nick McKeown
    9th USENIX Symposium on Networked Systems Design and Implementation. NSDI '12, April 2012, San Jose, CA.
    14 pages [ pdf ]
  9. Formal Network Testing
    Hongyi Zeng, Peyman Kazemian, George Varghese, Nick McKeown
    Techincal Report : Stanford University, Stanford, CA USA, UCSD, San Diego and Yahoo! Labs, Santa Clara, CA, USA
    8 pages [ pdf ]

Data Center Networks

  1. Using Network Knowledge to Improve Workload Performance in Virtualized Data Centers
    David Erickson, Brandon Heller, Nick McKeown, Mendel Rosenblum
    IC2E, Boston, March 2014
    10 pages [ pdf ]
  2. pFabric: minimal near-optimal datacenter transport
    Mohammad Alizadeh, Shuang Yang, Milad Sharif, Sachin Katti, Nick McKeown, Balaji Prabhakar, Scott Shenker
    ACM SIGCOMM 2013
    12 pages [ pdf ]
  3. Deconstructing Datacenter Packet Transport
    Mohammad Alizadeh, Shuang Yang, Sachin Katti, Nick McKeown, Balaji Prabhakar, Scott Shenker
    HotNets 2012: 133-138
    6 pages [ pdf ]
  4. Optimizing a Virtualized Data Center
    David Erickson, Brandon Heller, Shuang Yang, Jonathan Chu, Jonathan D. Ellithorpe, Scott Whyte, Stephen Stuart, Nick McKeown, Guru M. Parulkar, Mendel Rosenblum
    Proceedings of the ACM SIGCOMM 2011 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Toronto, ON, Canada, August 2011.
    2 pages [ pdf ]
  5. Ripcord: A Modular Platform For Data Center Networking
    Martin Casado, David Erickson, Igor Anatolyevich Ganichev, Rean Griffith, Brandon Heller, Nick Mckeown, Daekyeong Moon, Teemu Koponen, Scott Shenker, Kyriakos Zarifis
    EECS Department University of California, Berkeley Technical Report No. UCB/EECS-2010-93
    13 pages [ pdf ]
  6. ElasticTree: Saving Energy in Data Center Networks
    Brandon Heller, Srini Seetharaman, Priya Mahadevan, Yiannis Yiakoumis, Puneet Sharma, Sujata Banerjee, Nick McKeown
    7th USENIX Symposium on Networked Systems Design and Implementation. NSDI '10, April 2010, San Jose, CA.
    14 pages [ pdf ]
  7. Demo: A Demonstration of Virtual Machine Mobility in an OpenFlow network
    David Erickson, Glen Gibb, Brandon Heller, David Underhill, Jad Naous, Guido Appenzeller, Guru Parulkar, Nick McKeown, Mendel Rosenblum, Monica Lam, Sailesh Kumar, Valentina Alaria, Pere Monclus, Flavio Bonomi, Jean Tourrilhes, Praveen Yalagandula, Sujata Banerjee, Charles Clark, Rick McGeer
    ACM SIGCOMM, (Best Demo Award), Seattle, WA, August 2008.
    1 pages [ pdf ]

Wireless Networks

  1. Scheduling Packets Over Multiple Interfaces While Respecting User Preferences
    Kok-Kiong Yap, Te-Yuan Huang, Yiannis Yiakoumis, Sandeep Chinchali, Nick McKeown, Sachin Katti
    CoNext 2013, Santa Barbara, CA
    12 pages [ pdf ]
  2. Late-binding: how to lose fewer packets during handoff
    Kok-Kiong Yap, Te-Yuan Huang, Yiannis Yiakoumis, Nick McKeown, Sachin Katti
    CellNet 2013: 2013 workshop on Cellular networks: operations, challenges, and future design
    6 pages [ pdf ]
  3. Multi-Server Generalized Processor Sharing
    Kok-Kiong Yap, Nick McKeown, Sachin Katti
    September 2012, Krakw, Poland International Teletraffic Congress 2012
    8 pages [ pdf ]
  4. Making Use of All the Networks Around Us: A Case Study in Android
    Kok-Kiong Yap, Te-Yuan Huang, Yiannis Yiakoumis, Masayoshi Kobayashi, Sachin Katti, Guru Parulkar, Nick McKeown
    ACM CellNet Workshop 2012, Aug., Helsinki, Finaland (Affiliated with ACM SIGCOMM 2012). Also in Computer Communication Review 42(4): 455-460 (2012)
    6 pages [ pdf ]
  5. Separating Authentication, Access and Accounting: A Case Study with OpenWiFi
    Kok-Kiong Yap, Yiannis Yiakoumis, Masayoshi Kobayashi, Sachin Katti, Guru Parulkar, and Nick McKeown
    Stanford University NEC OPENFLOW-TR-2011-1
    6 pages [ pdf ]
  6. Blueprint for Introducing Innovation into Wireless Mobile Networks
    Michael Chan, Nikhil Handigol, Nick McKeown, Guru Parulkar
    Proceedings of the second ACM SIGCOMM workshop on Virtualized infrastructure systems and architectures VISA 2010, September 2010, New Delhi, India.
    8 pages [ pdf ]
  7. Delivering Capacity for the Mobile Internet by Stitching Together Networks
    Kok-Kiong Yap, Sachin Katti, Guru Parulkar, Nick McKeown
    Proceedings of the 2010 ACM workshop on Wireless of the students, by the students, for the students S310, September 2010, Chicago, Illinois.
    3 pages [ pdf ]

Network Emulation

  1. Reproducible Network Experiments using Container Based Emulation
    Nikhil Handigol, Brandon Heller, Vimalkumar Jeyakumar, Bob Lantz, Nick McKeown
    CoNEXT 2012, Nice, France
    12 pages [ pdf ]
  2. A Network in a Laptop: Rapid Prototyping for Software-Defined Networks.
    Bob Lantz, Brandon Heller, Nick McKeown
    ACM Sigcomm Hotnets Conference, Nov 2010.
    6 pages [ pdf ]

Software-Defined Networks

  1. The Controller Placement Problem
    Brandon Heller, Rob Sherwood, Nick McKeown
    Computer Communication Review 42(4): 473-478 (2012)
    6 pages [ pdf ]
  2. Outsourcing Network Functionality
    Glen Gibb, Hongyi Zeng, Nick McKeown
    HotSDN '12 Proceedings of the first workshop on Hot topics in software defined networks Pages 73-78 ACM New York, NY, USA 2012
    6 pages [ pdf ]
  3. Maturing of OpenFlow and Software Dened Networking through Deployments
    Masayoshi Kobayashi, Srini Seetharaman, Guru Parulkar, Guido Appenzeller, Joseph Little Johan van Reijendam, Paul Weissmann, Nick McKeown
    Elsevier August 14, 2012
    50 pages [ pdf ]
  4. Why OpenFlow/SDN Can Succeed Where GMPLS Failed
    Saurav Das, Guru Parulkar, Nick McKeown
    ECOC Technical Digest, 2012 OSA
    3 pages [ pdf ]
  5. MPLS-TE and MPLS VPNS with OpenFlow
    Ali Reza Sharafat, Saurav Das, Guru M. Parulkar, Nick McKeown
    Proceedings of the ACM SIGCOMM 2011 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Toronto, ON, Canada, August 2011.
    2 pages [ pdf ]
  6. Slicing Home Networks
    Yiannis Yiakoumis Kok-Kiong Yap Sachin Katti Guru Parulkar Nick McKeown
    Sigcomm Workshop on Home Networks, Aug 2011.
    6 pages [ pdf ]
  7. Initial thoughts on custom network processing via waypoint services
    Glen Gibb, Hongyi Zeng, Nick McKeown
    WISH - 3rd Workshop on Infrastructures for Software/Hardware co-design, CGO 2011, April 2011, Chamonix, France.
    6 pages [ pdf ]
  8. MPLS with a Simple OPEN Control Plane
    Saurav Das, Ali Reza Sharafat, Guru M. Parulkar, Nick McKeown
    Proceedings of OFC/NFOEC'11, Los Angeles, March 2011.
    3 pages [ pdf ]
  9. Application-Aware Aggregation and Traffic Engineering in a Converged Packet-Circuit Network
    Saurav Das, Yiannis Yiakoumis, Guru M. Parulkar, Preeti Singh, Daniel Getachew, Premal Dinesh Desai, Nick McKeown
    Proceedings of OFC/NFOEC'11, Los Angeles, March 2011.
    3 pages [ pdf ]
  10. Architecting for Innovation
    Ali Ghodsi, P. Brighten Godfrey, Nick McKeown, Guru Parulkar, Barath Raghavan,
    ACM Computer Communications Review, 2011.
    13 pages [ pdf ]
  11. OpenPipes: Making Distributed Hardware Systems Easier.
    Glen Gibb, Nick McKeown
    Proceedings of the International Conference on Field-Programmable Technology, FPT 2010, December 2010, Tsinghua University, Beijing, China 2010. FPT 2010:381-384.
    8 pages [ pdf ]
  12. Can the Production Network Be the Testbed?
    Rob Sherwood, Glen Gibb, Kok-Kiong Yap, Guido Appenzeller, Martin Casado, Nick McKeown, Guru M. Parulkar
    9th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2010, October 2010, Vancouver, BC., Canada
    14 pages [ pdf ]
  13. Packet and Circuit Network Convergence with OpenFlow
    Saurav Das, Guru Parulkar, Preeti Singh, Daniel Getachew, Lyndon Ong and Nick McKeown.
    Optical Fiber Communication Conference (OFC'10), San Diego, March, 2010.
    3 pages [ pdf ]
  14. OpenRoads: Empowering Research in Mobile Networks
    Kok-Kiong Yap, Masayoshi Kobayashi, Rob Sherwood, Nikhil Handigol, Te-Yuan Huang, Michael Chan, and Nick McKeown
    In Proceedings of ACM SIGCOMM, Barcelona, Spain, August 2009
    2 pages [ pdf ]
  15. Demo: Carving Research Slices Out of Your Production Networks with OpenFlow
    Rob Sherwood, Michael Chan, Adam Covington, Glen Gibb, Mario Flajslik, Nikhil Handigol, Te-Yuan Huang, Peyman Kazemian, Masayoshi Kobayashi, Jad Naous, Srinivasan Seetharaman, David Underhill, Tatsuya Yabe, Kok-Kiong Yap, Yiannis Yiakoumis, Hongyi Zeng, Guido Appenzeller, Ramesh Johari, Nick McKeown, and Guru Parulkar
    In Proceedings of ACM SIGCOMM, Barcelona, Spain, August 2009
    2 pages [ pdf ]
  16. Experimental Demonstration of OpenFlow Control of Packet and Circuit Switches
    Vinesh Gudla, Saurav Das, Anujit Shastri, Guru Parulkar, Nick McKeown and Leonid Kazovsky
    OSA / OFC/NFOEC 2010
    3 pages [ pdf ]
  17. PhoneNet: a Phone-to-Phone Network for Group Communication within an Administrative Domain
    Te-Yuan Huang, Kok-Kiong Yap, Ben Dodson, Monica S. Lam, Nick McKeown
    MobiHeld 2010, New Delhi, India.
    6 pages [ pdf ]
  18. Towards Software-Friendly Networks
    Kok-Kiong Yap, Te-Yuan Huang, Ben Dodson, Monica S. Lam, Nick McKeown
    APSys 2010, New Delhi, India.
    5 pages [ pdf ]
  19. Unifying Packet and Circuit Switched Networks
    Saurav Das, Guru Parulkar and Nick McKeown.
    In Proceedings of the Workshop on Below IP Networking, held in conjunction with Globecom09, Hawaii, November, 2009.
    6 pages [ pdf ]
  20. The Stanford OpenRoads Deployment
    Kok-Kiong Yap, Masayoshi Kobayashi, David Underhill, Srinivasan Seetharaman, Peyman Kazemian, and Nick McKeown
    WiNTECH, Mobicom, Beijing, China, September 2009
    8 pages [ pdf ]
  21. Demo: Lossless Handover with n-casting between WiFi-WiMAX on OpenRoads
    Kok-Kiong Yap, Te-Yuan Huang, Masayoshi Kobayashi, Michael Chan, Rob Sherwood, Guru Parulkar, and Nick McKeown
    Mobicom, Beijing, China, September 2009
    3 pages [ pdf ]
  22. Delegating Network Security Through More Information.
    Jad Naous, Ryan Stutsman, David Mazieres, Nick McKeown, and Nickolai Zeldovich.
    In Proceedings of the Workshop on Research on Enterprise Networking, August, 2009.
    8 pages [ pdf ]
  23. Rethinking Enterprise Network Control
    Martin Casado, Michael J. Freedman, Justin Pettit, Jianying Luo, Natasha Gude, Nick McKeown, Scott Shenker
    Transactions on Networking (ToN). August 2009, Volume 17, Number 4, pgs 1270-1283
    14 pages [ pdf ]
  24. NOX: Towards an Operating System for Networks
    Natasha Gude, Teemu Koponen, Justin Pettit, Ben Pfaff, Martin Casado, Nick McKeown, and Scott Shenker
    ACM Computer Communications Review, April 2008
    6 pages [ pdf ]
  25. OpenFlow: Enabling Innovation in Campus Networks
    Nick McKeown, Tom Anderson, Hari Balakrishnan, Guru Parulkar, Larry Peterson, Jennifer Rexford, Scott Shenker, and Jonathan Turner
    ACM SIGCOMM Computer Communication Review, Volume 38, Number 2, April 2008.
    6 pages [ pdf ]
  26. Ethane: Taking Control of the Enterprise (Sigcomm "Test of Time" Award Winner, 2017)
    Martin Casado, Michael J. Freedman, Justin Pettit, Jianying Luo, Nick McKeown, Scott Shenker
    ACM SIGCOMM '07, August 2007, Kyoto, Japan
    12 pages [ pdf ]
  27. Prototyping Fast, Simple, Secure Switches for Ethane
    Jianying Luo, Justin Pettit, Martin Casado, John Lockwood and Nick McKeown
    Hot Interconnects, Stanford, August 2007
    7 pages [ pdf ]
  28. SANE: A Protection Architecture for Enterprise Networks
    Martin Casado, Tal Garfinkel, Aditya Akella, Michael Freedman, Dan Boneh, Nick McKeown, Scott Shenker
    15th Usenix Security Symposium, Vancouver, Canada, , August 2006
    15 pages [ pdf ]

Router Buffers and Memory Architectures

  1. Integrated Photonics for Low-Power Packet Networking
    Daniel J. Blumenthal, John Barton, Neda Beheshti, John E. Bowers, Emily Burmeister, Larry A. Coldren, Matt Dummer, Garry Epps, Alexander Fang, Yashar Ganjali, John Garcia, Brian Koch, Vikrant Lal, Erica Lively, John Mack, Milan Masanovic, Nick McKeown, Kim Nguyen, Steven C. Nicholes, Hyundai Park, Biljana Stamenic, Anna Tauke-Pedretti, Henrik Poulsen, and Matt Sysak
    IEEE Journal of Selected Topics in Quantum Electronics, Vol 17, No. 2, March/April 2011
    14 pages [ pdf ]
  2. Optical Packet Buffers for Backbone Internet Routers
    Neda Beheshti, Emily F. Burmeister, Yashar Ganjali, John E. Bowers, Daniel J. Blumenthal, Nick McKeown
    IEEE Transactions on Networking, (TON), vol. 18, no. 5, October 2010.
    11 pages [ pdf ]
  3. Performing Time-Sensitive Network Experiments
    Neda Beheshti, Yashar Ganjali, Monia Ghobadi, Nick McKeown, Jad Naous, and Geoff Salmon
    ANCS'08, November 6-7, 2008, San Jose, CA, USA.
    2 pages [ pdf ]
  4. Experimental Study of Router Buffer Sizing (Best Paper Award)
    Neda Beheshti, Yashar Ganjali, Monia Ghobadi, Nick McKeown, and Geoff Salmon
    IMC'08, October 2008, Vouliagmeni, Greece.
    14 pages [ pdf ]
  5. Demo: Experimenting with Programmable Routers in Real Networks
    N. Beheshti, D. Underhill, B. Heller, S. Bolouki, N. McKeown, and Y. Ganjali,
    ACM SIGCOMM, (2nd-Best Demo Award), Seattle, WA, August 2008
    1 pages [ pdf ]
  6. Designing packet buffers for router linecards
    Sundar Iyer, Ramana Kompella, Nick McKeown
    IEEE Transactions on Networking, Volume 16 , Issue 3 (June 2008).
    16 pages [ pdf ]
  7. Obtaining High Throughput Networks with Tiny Buffers
    Neda Beheshti, Yashar Ganjali, Ashish Goel, Nick McKeown
    In Proceedings of 16th International Workshop on Quality of Service (IWQoS), Enschede, Netherlands, June 2008.
    5 pages [ pdf ]
  8. Experimenting with Buffer Sizing in Routers
    Neda Beheshti, Yashar Ganjali, Jad Naous, and Nick McKeown
    ANCS'07, December 2007, Orlando, Florida, USA.
    2 pages [ pdf ]
  9. Packet Scheduling in Optical FIFO Buffers
    N. Beheshti, Y. Ganjali, and N. McKeown,
    High-Speed Networking Workshop (In Conjunction with IEEE Infocom 2007), Anchorage, AK, May 2007.
    4 pages [ pdf ]
  10. Update on Buffer Sizing in Internet Routers,
    Yashar Ganjali, Nick McKeown
    Computer Communications Review (CCR), Volume 36, Number 5, October 2006.
    4 pages [ pdf ]
  11. Routers with very small buffers,
    Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Nick McKeown, and Tim Roughgarden
    In Proceedings of the IEEE INFOCOM'06, Barcelona, Spain, April 2006.
    11 pages [ pdf ]
  12. Buffer sizing in all-optical packet switches,
    Neda Beheshti, Yashar Ganjali, Ramesh Rajaduray, Daniel Blumenthal, and Nick McKeown
    In Proceedings of OFC/NFOEC, Anaheim, CA, March 2006.
    3 pages [ pdf ]
  13. Part III: Routers with Very Small Buffers,
    Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Tim Roughgarden, and Nick McKeown
    ACM/SIGCOMM Computer Communication Review, Vol. 35, No. 3, July 2005. Extended version: Stanford HPNG Technical Report TR05-HPNG-060606
    7 pages [ pdf ]
  14. Part I: Buffer Sizes for Core Routers,
    Damon Wischik and Nick McKeown
    ACM/SIGCOMM Computer Communication Review, Vol. 35, No. 3, July 2005.
    4 pages [ pdf ]
  15. Building Packet Buffers with Interleaved Memories
    Gireesh Shrimali and Nick McKeown,
    Proceedings of Workshop on High Performance Switching and Routing, Hong Kong, May 2005
    5 pages [ pdf ]
  16. Recent Results on Sizing Router Buffers
    Guido Appenzeller, Nick McKeown, Joel Sommers, Paul Barford
    Proceedings of the Network Systems Design Conference, October 18-20 2004, San Jose, Ca.
    13 pages [ pdf ]
  17. Designing Packet Buffers with Statistical Guarantees
    Gireesh Shrimali, Isaac Keslassy, and Nick McKeown
    Proceedings of Hot Interconnects, Stanford, CA, August 2004
    7 pages [ pdf ]
  18. Sizing Router Buffers
    Guido Appenzeller, Isaac Keslassy and Nick McKeown
    ACM SIGCOMM 2004, Portland, August 2004 Extended version: Stanford HPNG Technical Report TR04-HPNG-060800
    12 pages [ pdf ]
  19. Techniques for Fast Shared Memory Switches
    Sundar Iyer, Nick McKeown
    Stanford HPNG Technical Report TR01-HPNG-081501
    12 pages [ pdf ]
  20. Analysis of a Statistics Counter Architecture
    Devavrat Shah, Sundar Iyer, Balaji Prabhakar, and Nick McKeown
    Hot Interconnects, Stanford, August 2001. This paper also appeared as: "Maintaining Statistics Counters in Router Line Cards in IEEE Micro, Jan-Feb 2002, pp. 76-81
    6 pages [ pdf ]
  21. Analysis of a Memory Architecture for Fast Packet Buffers
    Sundar Iyer, Ramana Rao Kompella, and Nick McKeown
    IEEE - High Performance Switching and Routing, Dallas, Texas, May 2001, pp. 368-373.
    6 pages [ pdf ]
  22. Doubling Memory Bandwidths for Network Buffers
    Youngmi Joo, and Nick McKeown
    IEEE INFOCOM April 1998, Vol 2, pp. 808-815, San Francisco.
    8 pages [ pdf ]

NetFPGA

  1. FPGA Research Design Platform Fuels Network Advances
    Michaela Blott, Jonathan Ellithorpe, Nick McKeown, Kees Vissers, Hongyi Zeng
    Xcell Journal, Fourth Quarter, 2010
    6 pages [ pdf ]
  2. Implementing an OpenFlow Switch on the NetFPGA platform
    Jad Naous, David Erickson, Adam Covington, Guido Appenzeller, and Nick McKeown
    ANCS'08, November 6-7, 2008, San Jose, CA, USA.
    9 pages [ pdf ]

Congestion Control

  1. Buffer Sizing results for RCP Congestion Control under Connection Arrivals and Departures
    Ashvin Lakshmikantha, R. Srikant, Nandita Dukkipati, Nick McKeown, and Carolyn Beck
    ACM SIGCOMM Computer Communication Review, Volume 39, Issue 1, January 2009, Pages 5-15.
    10 pages [ pdf ]
  2. Stability Analysis of Explicit Congestion Control Protocols
    Hamsa Balakrishnan, Nandita Dukkipati, Nick McKeown and Claire Tomlin
    IEEE Communications Letters, Vol.11, No.10, pp. 823-825, October 2007.
    3 pages [ pdf ]
  3. Building a RCP (Rate Control Protocol) Test Network
    Nandita Dukkipati, Glen Gibb, Nick McKeown, Jiang Zhu
    Hot Interconnects, Stanford, August 2007
    7 pages [ pdf ]
  4. Stability Analysis of Explicit Congestion Control Protocols
    Hamsa Balakrishnan, Nandita Dukkipati, Nick McKeown and Claire Tomlin
    Stanford University Department of Aeronautics and Astronautics Report: SUDAAR 776, September 2005.
    25 pages [ pdf ]
  5. Processor Sharing Flows in the Internet
    Nandita Dukkipati, Masayoshi Kobayashi, Rui Zhang-Shen, Nick McKeown
    Thirteenth International Workshop on Quality of Service (IWQoS), Passau, Germany, June 2005.
    15 pages [ pdf ]
  6. Processor Sharing Flows in the Internet
    Nandita Dukkipati, Nick McKeown
    Stanford University High Performance Networking Group Technical Report TR04-HPNG-061604.
    23 pages [ pdf ]
  7. An Approach to Alleviate Link Overload as Observed on an IP Backbone
    Sundar Iyer, Supratik Bhattacharrya, Nina Taft, Christophe Diot, and Nick McKeown,
    Proceeding of IEEE INFOCOM, San Francisco, CA, March 2003.
    11 pages [ pdf ]

Educational Tools

  1. NetFPGA: Reusable Router Architecture for Experimental Research
    Jad Naous, Glen Gibb, Sara Bolouki, and Nick McKeown
    To appear: SIGCOMM PRESTO Workshop, Seattle, WA, August 2008
    7 pages [ pdf ]
  2. NetFPGA - Open Platform for Teaching How to Build Gigabit-rate Network Switches and Routers
    Glen Gibb, John W. Lockwood, Jad Naous, Paul Hartke, and Nick McKeown
    To appear: IEEE Transactions on Education, 2008
    22 pages [ pdf ]
  3. NetFPGA - An Open Platform for Gigabit-rate Network Switching and Routing
    John W. Lockwood, Nick McKeown, Greg Watson, Glen Gibb, Paul Hartke, Jad Naous, Ramanan Raghuraman, and Jianying Luo
    MSE 2007, San Diego, June 2007.
    2 pages [ pdf ]
  4. The Clack Graphical Router: Visualizing Network Software
    Dan Wendlandt, Martin Casado, Paul Tarjan, Nick McKeown
    ACM Symposium on Software Visualization, September 2006
    10 pages [ pdf ]
  5. Reconfigurable Networking Hardware: A Classroom Tool
    Martin Casado, Gregory Watson, Nick McKeown
    Hot Interconnects 13, Stanford, August 2005
    7 pages [ pdf ]
  6. Teaching Networking Hardware
    Martin Casado, Gregory Watson, Nick McKeown
    ITiCSE, Monte de Caparica, Portugal, June 2005
    6 pages [ pdf ]
  7. The Virtual Network System
    Martin Casado, Nick McKeown
    ACM SIGCSE , St. Louis, Missouri, February 2005
    6 pages [ pdf ]
  8. The Stanford Virtual Router: a teaching tool and network simulator
    Martin Casado, Vikram Vijayaraghavan, Guido Appenzeller, Nick McKeown
    ACM SIGCOMM Computer Communication Review, Volume 32 , Issue 3 (July 2002)
    1 pages [ pdf ]

Other miscellaneous papers

  1. The Effectiveness of Whitelisting: a User-Study
    David Erickson, Martin Casado, and Nick McKeown,
    Conference on Email and Anti-Spam, Mountain View, CA, August 2008.
    10 pages [ pdf ]
  2. Can Overlay hosting services make ip ossification irrelevant,
    J Turner, and N McKeown,
    cabernet.cs.princeton.edu, 2007.
    4 pages [ pdf ]
  3. Congestion Control and Periodic Behavior
    Anna Gilbert, Youngmi Joo and Nick McKeown.
    Presented at LANMAN Workshop 2001.
    11 pages [ pdf ]
  4. Monitoring very high speed links
    G. Iannaccone, C. Diot, I. Graham, N. McKeown.
    ACM Sigcomm Internet Measurement Workshop IMW 2001, California 2001.
    8 pages [ pdf ]
  5. Xdistribute: A Process Distribution System
    Karl Petty, and Nick McKeown
    Technical Report
    9 pages [ pdf ]
  6. Billing Users and Pricing for TCP
    Richard Edell, Nick McKeown, and Pravin Varaiya
    IEEE JSAC Special Issue on Advances in the Fundamentals of Networking September 1995.
    14 pages [ pdf ]
  7. Automatic Vehicle Control Developments in the PATH Program
    Steven E. Schladover, Charles A. Desoer, J. Karl Hedrick, Masayoshi Tomizuka, Jean Walrand, Wei-Bin Zhang, Donn H. McMahon, Huei Peng, Shahab Sheikholeslam and Nick McKeown
    IEEE Transactions on Vehicular Technology, Vol. 40, No.1, pp. 114-130, February 1991.
    17 pages [ pdf ]

Load-Balanced Switches and Networks

  1. Designing a Fault-Tolerant Network Using Valiant Load-Balancing
    Rui Zhang-Shen, Nick McKeown
    Presented at Infocom 2008.
    5 pages [ pdf ]
  2. Guaranteeing Quality of Service to Peering Traffic
    Rui Zhang-Shen, Nick McKeown
    Presented at Infocom 2008.
    7 pages [ pdf ]
  3. Designing a Predictable Internet Backbone with Valiant Load-Balancing
    Rui Zhang-Shen, Nick McKeown
    Thirteenth International Workshop on Quality of Service (IWQoS), Passau, Germany, June 2005.
    18 pages [ pdf ]
  4. Optimal Load-Balancing
    Isaac Keslassy, Cheng-Shang Chang, Nick McKeown, Duan-Shin Lee
    Proceedings of IEEE INFOCOM 2005, Miami, Florida, March 2005.
    11 pages [ pdf ]
  5. Designing a Predictable Internet Backbone Network
    Rui Zhang-Shen, Nick McKeown
    HotNets III, San Diego, CA, November 2004
    6 pages [ pdf ]
  6. Configuring a Load-Balanced Switch in Hardware
    Srikanth Arekapudi, Shang-Tse Chuang, Isaac Keslassy, Nick McKeown
    Hot Interconnects 12, Stanford, August 2004
    6 pages [ pdf ]
  7. A Load-Balanced Switch with an Arbitrary Number of Linecards
    Isaac Keslassy, Shang-Tse Chuang, Nick McKeown
    Proceedings of IEEE Infocom '04, Hong Kong, March 2004
    10 pages [ pdf ]
  8. Optics inside Routers
    Nick McKeown
    ECOC 2003, Rimini, Italy, September 2003.
    4 pages [ pdf ]
  9. Scaling Internet Routers Using Optics
    Isaac Keslassy, Shang-Tse Chuang, Kyoungsik Yu, David Miller, Mark Horowitz, Olav Solgaard, Nick McKeown
    ACM SIGCOMM Aug. 2003, Karlsruhe, Germany.
    12 pages [ pdf ]
  10. Analysis of the Parallel Packet Switch Architecture
    Sundar Iyer and Nick McKeown
    IEEE/ACM Transactions on Networking, pp. 314-324, April 2003.
    11 pages [ pdf ]
  11. A Load-Balanced Switch with an Arbitrary Number of Linecards
    Isaac Keslassy, Shang-Tse Chuang, Nick McKeown
    Stanford HPNG Technical Report TR03-HPNG-080102
    11 pages [ pdf ]
  12. Routers with a Single Stage of Buffering
    Sundar Iyer, Rui Zhang, and Nick McKeown
    ACM SIGCOMM Aug. 2002, Pittsburgh, USA. Also in Computer Communication Review, vol. 32, no. 4, Oct 2002.
    14 pages [ pdf ]
  13. Maintaining Packet Order in Two-Stage Switches
    Isaac Keslassy and Nick McKeown
    Proceedings of IEEE INFOCOM '02, New York, June 2002.
    10 pages [ pdf ]
  14. Scaling Internet Routers Using Optics (Extended Version)
    Isaac Keslassy, Shang-Tse Chuang, Kyoungsik Yu, David Miller, Mark Horowitz, Olav Solgaard, Nick McKeown
    Stanford HPNG Technical Report TR03-HPNG-080101
    16 pages [ pdf ]
  15. On the Speedup Required for a Multicast Parallel Packet Switch
    Sundar Iyer and Nick McKeown
    IEEE Communication Letters, June 2001, vol. 5, no. 6, pp.
    3 pages [ pdf ]
  16. Making Parallel Packet Switches Practical
    Sundar Iyer and Nick McKeown
    IEEE INFOCOM, Alaska, USA, March 2001, vol. 3, pp. 1680-87.
    8 pages [ pdf ]
  17. Analysis of a Packet Switch with Memories Running Slower than the Line Rate
    Sundar Iyer, Amr A. Awadallah, and Nick McKeown
    IEEE INFOCOM March 2000, Tel-Aviv, Israel, pp. 529-537.
    9 pages [ pdf ]

Congestion Control

  1. RCP-AC: Congestion Control to make flows complete quickly in any environment
    Nandita Dukkipati, Nick McKeown, Alexander G. Fraser
    High-Speed Networking Workshop: The Terabits Challenge (In Conjunction with IEEE Infocom '06), Barcelona, April 2006.
    3 pages [ pdf ]
  2. Why flow-completion time is the right metric for congestion control
    Nandita Dukkipati, Nick McKeown
    ACM SIGCOMM Computer Communication Review, Volume 36, Issue 1, January 2006.
    8 pages [ pdf ]

Scheduling and Arbitration Algorithms for Crossbar Switches

  1. Practical Algorithms for Performance Guarantees in Buffered Crossbars
    Shang-Tse Chuang, Sundar Iyer, Nick McKeown
    Proceedings of IEEE INFOCOM 2005, Miami, Florida, March 2005.
    11 pages [ pdf ]
  2. The Throughput of a Buffered Crossbar Switch
    Mingjie Lin, Nick McKeown
    IEEE Communications Letters 2004
    3 pages [ pdf ]
  3. Maximum Size Matching is Unstable for Any Packet Switch
    Isaac Keslassy, Rui Zhang-Shen, Nick McKeown
    IEEE Communications Letters, Vol. 7, No. 10, pp. 496-498, Oct. 2003.
    3 pages [ pdf ]
  4. Using Constraint Sets to Achieve Delay Bounds in CIOQ Switches
    Sundar Iyer and Nick McKeown
    IEEE Communication Letters, pp. 275-277, 2003
    3 pages [ pdf ]
  5. Maximum Size Matching and Input Queued Switches
    Sundar Iyer and Nick McKeown
    Proceedings of the 40th Annual Allerton Conference on Communication, Control and Computing.
    11 pages [ pdf ]
  6. Analysis of Scheduling Algorithms That Provide 100% Throughput in Input-Queued Switches
    Isaac Keslassy and Nick McKeown
    Proceedings of the 39th Annual Allerton Conference on Communication, Control, and Computing. Monticello, Illinois, October 2001
    10 pages [ pdf ]
  7. Practical Algorithms for Performance Guarantees in Buffered Crossbars
    Shang-Tse Chuang, Sundar Iyer, Nick McKeown
    Stanford HPNG Technical Report TR03-HPNG-061501
    11 pages [ pdf ]
  8. Maximum Size Matching is Unstable for Any Packet Switch
    Isaac Keslassy, Rui Zhang-Shen, Nick McKeown
    Stanford HPNG Technical Report TR03-HPNG-030100
    5 pages [ pdf ]
  9. Achieving 100% Throughput in an Input-Queued Switch (Extended Version)
    Nick McKeown, Adisak Mekkittikul, Venkat Anantharam and Jean Walrand
    IEEE Transactions on Communications, Vol.47, No.8, August 1999.
    22 pages [ pdf ]
  10. iSLIP: A Scheduling Algorithm for Input-Queued Switches
    Nick McKeown
    IEEE Transactions on Networking, Vol 7, No.2, April 1999.
    36 pages [ pdf ]
  11. A Quantitative Comparison of Scheduling Algorithms for Input-Queued Switches
    Nick McKeown and Thomas E. Anderson
    Computer Networks and ISDN Systems, Vol 30, No 24, pp 2309-2326, December 1998.
    16 pages [ pdf ]
  12. Design and Implmentation of a Fast Crossbar Scheduler
    Pankaj Gupta and Nick McKeown
    Hot Interconnects VI, Stanford University, August 1998. IEEE Micro Magazine, Jan-Feb 1999.
    8 pages [ pdf ]
  13. ATM Input-Buffered Switches with Guaranteed-Rate Property,
    Anthony Hung, George Kesidis, and Nick McKeown
    Proc. IEEE ISCC '98, Athens, Jul 1998, pp 331-335
    5 pages [ pdf ]
  14. A Practical Scheduling Algorithm to Achieve 100% Throughput in Input-Queued Switches.
    Adisak Mekkittikul, and Nick McKeown
    IEEE Infocom 98, Vol 2, pp. 792-799, April 1998, San Francisco.
    8 pages [ pdf ]
  15. Matching Output Queueing with a Combined Input Output Queued Switch
    Shang-Tse Chuang, Ashish Goel, Nick McKeown, Balaji Prabhakar
    Computer Systems Technical Report CSL-TR-98-758. March 1998. Also published in: Proceedings of INFOCOM '99, 1169-1178, IEEE, April 1999, and IEEE Journal on Selected Areas in Communications, vol.17, n.6, Dec.1999, pp. 1030-1039.
    17 pages [ pdf ]
  16. On the Speedup Required for Combined Input and Output Queued Switching.
    Balaji Prabhakar and Nick McKeown
    Computer Systems Technical Report CSL-TR-97-738. November 1997. Also published in: Automatica, Vol. 35, no. 12, December 1999
    8 pages [ pdf ]
  17. Matching Output Queueing with Combined Input and Output Queueing
    Nick McKeown, Balaji Prabhakar, and Mingyan Zhu
    Proceedings of the 35th Annual Allerton Conference on Communication, Control, and Computing. Monticello, Illinois, October 1997.
    10 pages [ pdf ]
  18. Multicast Scheduling for Input-Queued Switches
    Rietsh Ahuja, Balaji Prabhakar, Nick McKeown
    IEEE Journal on Selected Areas in Communications, Vol 15, No. 15, pp. 885-866, June 1997.
    20 pages [ pdf ]
  19. Scheduling VOQ Switches under Non-Uniform Traffic.
    Adisak Mekkittikul, and Nick McKeown
    CSL Technical Report, CSL-TR 97-747, Stanford University, 1997.
    35 pages [ pdf ]
  20. A Starvation-free Algorithm for Achieving 100% Throughput in an Input-Queued Switch
    Adisak Mekkittikul and Nick McKeown
    ICCCN '96, pp. 226-231, October 1996.
    6 pages [ pdf ]
  21. Tetris Models for Multicast Switches
    Balaji Prabhakar, Nick McKeown and Jean Mairesse
    Proceedings of the Princeton Conference, Princeton, March 1996.
    6 pages [ pdf ]
  22. Achieving 100% Throughput in an Input-Queued Switch
    Nick McKeown, Venkat Anantharam and Jean Walrand
    Proceedings of IEEE Infocom '96, Vol 1, pp. 296-302, San Francisco, March 1996.
    7 pages [ pdf ]
  23. Scheduling Multicast Cells in an Input-Queued Switch
    Nick McKeown and Balaji Prabhakar
    Proceedings of IEEE Infocom '96, San Francisco, Vol 1, pp. 271-278, March 1996
    11 pages [ pdf ]
  24. 8 Tb/s ATM Interconnection through optical WDM networks
    Adisak Mekkittikul, D. Sadot, L.G. Kazovsky, Nick McKeown
    High-Speed Semiconductor Laser Sources, San Jose, CA, Vol. 2684, pp. 186-98, 1-2 February, 1996.
    13 pages [ pdf ]
  25. Designing a Multicast Switch Scheduler
    Balaji Prabhakar and Nick McKeown
    Proceedings of the 33rd Annual Allerton Conference on Communication, Control, and Computing. pp. 984-993. Monticello, Illinois, October 1995.
    10 pages [ pdf ]
  26. Scheduling Algorithms for Input-Queued Cell Switches
    Nick McKeown
    PhD Thesis, University of California at Berkeley, May 1995.
    129 pages [ pdf ]
  27. A Fast Scheduling Algorithm for Input-Queued Switches
    Nick McKeown, Jean Walrand
    Proceedings of 7th IEEE LAN/MAN Workshop, Florida, March 1995.
  28. Scheduling Cells in an Input-Queued Switch
    Nick McKeown, Pravin Varaiya, and Jean Walrand
    IEE Electronics Letters, Dec 9th 1993, pp.2174-5
    4 pages [ pdf ]

Other papers on Switches and Routers

  1. The performance of circuit switching in the Internet
    Pablo Molinero-Fernandez, Nick McKeown
    OSA Journal of Optical Networking, Vol. 2, No. 4, March 2003
    14 pages [ pdf ]
  2. Is IP going to take over the world (of communications)?
    Pablo Molinero-Fernandez, Nick McKeown, Hui Zhang
    HotNets-I, Princeton, NJ, October 2002 Also appeared in ACM Computer Communications Review, Vol. 33, No. 1, January 2003
    6 pages [ pdf ]
  3. TCP Switching: Exposing circuits to IP
    Pablo Molinero-Fernandez, Nick McKeown
    IEEE Micro, Vol. 22, No. 1, Jan/Feb 2002
    8 pages [ pdf ]
  4. A 2.5Tb/s Switch Core with LCS Interface,
    Nick McKeown, Costas Calamvokis, and Shang-tse Chuang,
    Hot Chips 13, Stanford, CA, August 2001.
  5. TCP Switching: Exposing circuits to IP
    Pablo Molinero-Fernandez, Nick McKeown
    Hot Interconnects IX, Stanford University, August 2001
    6 pages [ pdf ]
  6. A Fast Switched Backplane for a Gigabit Switched Router
    Nick McKeown
    Business Communications Review, December 1997.
    30 pages [ pdf ]
  7. A Simulation Study of IP Switching
    Steven Lin, and Nick McKeown
    Proceedings of ACM Sigcomm, September 1997.
    10 pages [ pdf ]
  8. Output-buffer ATM Packet Switching for Integrated-Services Communication Networks
    George Kesidis, and Nick McKeown
    Presented at ICC '97, Montreal, Canada, Aug 1997.
    5 pages [ pdf ]
  9. A High Performance SMDS Interface at STS-3c Rate
    My T. Le, Nick McKeown, and Richard Edell
    Technical Report
    22 pages [ pdf ]
  10. Architecture and Performance of The BayBridge: A High Speed Bridge/Router between FDDI and SMDS
    Nick McKeown, Richard Edell, and My T. Le
    Technical Report
    29 pages [ pdf ]
  11. The Bay Bridge: A High Speed Bridge/Router
    Nick McKeown, Richard Edell, and My T. Le
    IFIP Workshop, Stockholm, Sweden, 1992.
    18 pages [ pdf ]

Packet Lookup and Classification

  1. Algorithms for Packet Classification
    Pankaj Gupta and Nick McKeown
    IEEE Network, March 2001.
    29 pages [ pdf ]
  2. Dynamic Algorithms with Worst-case Performance for Packet Classification
    Pankaj Gupta and Nick McKeown
    Proceedings IFIP Networking, May 2000, Paris, France.
    12 pages [ pdf ]
  3. Packet Classification on Multiple Fields
    Pankaj Gupta, and Nick McKeown
    ACM SIGCOMM '99, September 1999, Harvard University.
    14 pages [ pdf ]
  4. Packet Classification using Hierarchical Intelligent Cuttings
    Pankaj Gupta, and Nick McKeown
    Hot Interconnects VII, August 99, Stanford. This paper is also available in IEEE Micro, pp. 34-41, vol. 20, no. 1, January/February 2000
    9 pages [ pdf ]
  5. Routing Lookups in Hardware at Memory Access Speeds
    Pankaj Gupta, Steven Lin, and Nick McKeown
    IEEE INFOCOM April 1998, Vol 3, pp. 1240-1247, San Francisco.
    8 pages [ pdf ]

The Tiny Tera Switch

  1. A 50 Gb/s 32*32 CMOS crossbar chip using asymmetric serial links
    Kun-Yung Ken Chang, Shang-Tse Chuang, McKeown, N., Horowitz, M.
    1999 Symposium on VLSI Circuits. Digest of Technical Papers, page 19.
    4 pages [ pdf ]
  2. A 2 Gb/s Asymmetric Serial Link for High-Bandwidth Packet Switches
    Ken K.-Y. Chang, William Ellersick, Shang-Tse Chuang, Stefanos Sidiropoulos, Mark Horowitz, Nick McKeown
    Hot Interconnects VI, pp. 171-179, Stanford University, August 1997.
    9 pages [ pdf ]
  3. The Tiny Tera: A Small High-Bandwidth ATM Switch
    Nick McKeown, Martin Izzard, Adisak Mekkittikul;
    Proceedings of SPIE 96, Vol. 2917, pp. 387-397, Boston, November 1996
    11 pages [ pdf ]
  4. The Tiny Tera: A Packet Switch Core
    Nick McKeown, Martin Izzard, Adisak Mekkittikul, Bill Ellersick and Mark Horowitz
    Hot Interconnects V, Stanford University, August 1996. Also appeared in: IEEE Micro Jan/Feb 1997, pp 26-33.
    13 pages [ pdf ]
  5. The Tiny Tera: A Small High-Bandwidth Packet Switch Core
    Nick McKeown, Martin Izzard, Adisak Mekkittikul, Bill Ellersick, Mark Horowitz
    Proceedings of Hot Inteconnects IV, pp. 161-173, Stanford, August 1996
    13 pages [ pdf ]

Comments

Leave a Reply

Your email address will not be published. Required fields are marked *