Network locality at the scale of processes
- 1 May 1992
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
- Vol. 10 (2), 81-109
- https://doi.org/10.1145/128899.128900
Abstract
Packets on a LAN can be viewed as a series of references to and from the objects they address. The amount of locality in this reference stream may be critical to the efficiency of network implementations, if the locality can be exploited through caching or scheduling mechanisms. Most previous studies have treated network locality with an addressing granularity of networks or individual hosts. This paper describes some experiments tracing locality at a finer grain, looking at references to individual processes, and with fine-grained time resolution. Observations of typical LANs show high per-process locality; that is, packets to a host usually arrive for the process that most recently sent a packet, and often with little intervening delay.Keywords
This publication has 9 references indexed in Scilit:
- IPwatch: a tool for monitoring network localityACM SIGOPS Operating Systems Review, 1990
- Transport issues in the network file systemACM SIGCOMM Computer Communication Review, 1989
- Caching in the Sprite network file systemACM Transactions on Computer Systems, 1988
- On Packet Switches with Infinite StorageIEEE Transactions on Communications, 1987
- The packer filter: an efficient mechanism for user-level network codePublished by Association for Computing Machinery (ACM) ,1987
- Packet Trains--Measurements and a New Model for Computer Network TrafficIEEE Journal on Selected Areas in Communications, 1986
- Internet ProtocolPublished by RFC Editor ,1981
- Internet Control Message ProtocolPublished by RFC Editor ,1981
- Measured performance of an Ethernet local networkCommunications of the ACM, 1980