Characteristics of wide-area TCP/IP conversations
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
IEEE/ACM Transactions on Networking (TON)
Performance Evaluation - Performance modelling and evaluation of high-performance parallel and distributed systems
An empirical comparison of generators for self similar simulated traffic
Performance Evaluation
Experimental validation of the ON-OFF packet-level model for IP traffic
Computer Communications
Multiclass G/M/1 queueing system with self-similar input and non-preemptive priority
Computer Communications
Double sampling for flow measurement on high speed links
Computer Networks: The International Journal of Computer and Telecommunications Networking
CRAHNs: Cognitive radio ad hoc networks
Ad Hoc Networks
Comparing network performance for constant and variable bit rate sources
Computer Communications
Aligned prefix caching based on singleton information
Computer Networks: The International Journal of Computer and Telecommunications Networking
Performance comparison of media access protocols for Gbit/s networks in the local area
Computer Communications
Case study: Traffic analysis of trans-Atlantic traffic
Computer Communications
Review: Traffic source models for ATM networks: a survey
Computer Communications
A scalable and collision-free MAC protocol for all-optical ring networks
Computer Communications
Traffic profiles and application signatures
Computer Communications
Analytical modeling of primary and secondary load as induced by video applications using UDP/IP
Computer Communications
A performance model of partial packet discard and early packet discard schemes in ATM switches
Computer Communications
On the use of learning automata in medium access control of single-hop lightwave networks
Computer Communications
RCDP: a novel content delivery solution for wireless networks based on raptor codes
ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
Methodically modeling the Tor network
CSET'12 Proceedings of the 5th USENIX conference on Cyber Security Experimentation and Test
CensorSpoofer: asymmetric communication using IP spoofing for censorship-resistant web browsing
Proceedings of the 2012 ACM conference on Computer and communications security
An efficient parallelized L7-filter design for multicore servers
IEEE/ACM Transactions on Networking (TON)
Stochastic computer network under accuracy rate constraint from QoS viewpoint
Information Sciences: an International Journal
Detection and classification of peer-to-peer traffic: A survey
ACM Computing Surveys (CSUR)
SoNIC: precise realtime software access and control of wired networks
nsdi'13 Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation
Choreo: network-aware task placement for cloud applications
Proceedings of the 2013 conference on Internet measurement conference
Bullet trains: a study of NIC burst behavior at microsecond timescales
Proceedings of the ninth ACM conference on Emerging networking experiments and technologies
Discrete-time Markov Model for Wireless Link Burstiness Simulations
Wireless Personal Communications: An International Journal
| Hi-index | 0.07 |
Traffic measurements on a ring local area computer network at the Massachusetts Institute of Technology are presented. The analysis of the arrival pattern shows that the arrival processes are neither Poisson nor compound Poisson. An alternative model called "packet train" is proposed. In the train model, the traffic on the network consists of a number of packet streams between various pairs of nodes on the network. Each node-pair stream (or node-pair process, as we call them) consists of a number of trains. Each train consists of a number of packets (or cars) going in either direction (from node A to B or from node B to A). The intercar gap is large (compared to packet transmission time) and random. The intertrain time is even larger. The Poisson and the compound Poisson arrivals are shown to be special cases of the train arrival model. Another important observation is that the packet arrivals exhibit a "source locality." If a packet is seen on the network going from A to B, the probability of the next packet going from A to B or from B to A is very high. Implications of the train arrivals and of source locality on the design of bridges, gateways, and reservation protocols are discussed. A numbet of open problems requiring development of analysis techniques for systems with train arrival processes are also described.