Computer networking - a top-down approach featuring the internet

By Jim Kurose, Keith W. Ross. 2000

686 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/47c437a582e9995ce402962b49375f35492640f1

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

TCP Westwood: End-to-End Congestion Control for Wired/Wireless Networks (2002, methodology): “We will use an informal argument similar to that used for Reno in [ 14 ] to show that TCPW achieves the fair share.”
An on-demand secure routing protocol resilient to byzantine failures (2002, background): “A signi.cant concern in routing is the ability to function in the presence of byzantine failures which include nodes that drop, modify, or mis-route packets in an attempt to disrupt the routing service.”
Survey on Network Virtualization Hypervisors for Software Defined Networking (2015, background): “plane of the SDN that is controlled through an SDN controller can then support the classical end-user network applications, such as the web (HTTP) and e-mail (SMTP) [89], [90].”
When2com: Multi-Agent Perception via Communication Graph Grouping (2020, methodology): “To reduce the network complexity and bandwidth usage, inspired by communication network protocol [20], we propose a two-step group construction procedure: we ﬁrst apply the handshake communication [23] to determine the weights of connections, and we further prune the less important connections with…”
Learning to Schedule Communication in Multi-agent Reinforcement Learning (2019, methodology): “Softmax( k ) can be a simpliﬁed model of CSMA (Carrier Sense Multiple Access), which forms a basis of 802.11 Wi-Fi.”
D-ADMM: A Communication-Efficient Distributed Algorithm for Separable Optimization (2012, background): “Similarly, communication is known to be the algorithmic bottleneck in applications with more controlled environme nts, for example, in network protocols [3] or supercomputing platforms [4].”
TCP westwood: Bandwidth estimation for enhanced transport over wireless links (2001, methodology): “We will use an informal argument similar to that used for Reno in [14] to show that TCPW achieves the fair share.”
SPEED: a stateless protocol for real-time communication in sensor networks (2003, unknown): “We compute the current delay estimation by combining the newly measured delay with previous delays via the exponential weighted moving average (EWMA) [8].”
Performance Modeling and Design of Computer Systems: Queueing Theory in Action (2013, background): “The actual Ethernet protocol is based on the idea of exponential backoff, where each host waits some random time after each collision before resubmitting and where the mean of that “waiting time” increases exponentially as a function of the number of collisions experienced so far [114].”
Pollution in P2P file sharing systems (2005, background): “However, this approach has had little success at curtailing KaZaA, for which it is more difﬁcult to simply “pull the plug” due to its highly decentralized architecture and to its elusive international corporate structure.”