Recently, a quasi-static routing scheme called path switching was proposed for large-scale packet switch systems.
The efficiency of this process can create large scale, highly reliable packet voice networks for service providers and enterprises.
We present an incremental graph-based clustering algorithm whose design was motivated by a need to extract and retain meaningful information from data streams produced by applications such as large scale surveillance, network packet inspection and financial transaction monitoring.
The scheme can further be applied to large-scale optical packet switching networks by exploiting efficient optical coders allocated at different WDM channels.
In order to provide reliable date delivery and system management for large scale wireless sensor networks (WSNs), tracing the route path of packets in a lightweight manner is crucial and critical.
Packets that travel between distant nodes of a large scale wired on-chip network significantly suffer from energy dissipation and latency due to the routing overhead at each hop.
However, a large scale of broadcasting the same message will cause the problems of channel contention and packet collisions.
Since packet-layer model is computationally lightweight, it can be deployed in large scale along the media service chain.
Large scale effects (i.e., path-loss) are supposed to be slowly varying compared to the data packet length.
"Alyse Rosner: Large Scale Work".
He does this on a large scale.
