Sentence examples for methods of congestion from inspiring English sources

The sharing methods of congestion information can be classified in terms of network architectures.

Congestion-aware route selection schemes can be classified in terms of congestion models and sharing methods of congestion information.

To justify investments towards improved traffic operations, engineers and policy-makers need scientific and accurate methods of congestion measurement.

In addition, the existing dissemination methods of congestion information lack the necessary control mechanism, so the information may be disseminated to irrelevant geographical areas.

If a collision was detected, each station would back off a random number of transmit slots before retry; this method of congestion control became known as Slotted Aloha.

As a method of network congestion management, senders of data over the network (typically the Internet) are implicitly notified of network congestion by having their data packets (discrete chunks of data) probabilistically dropped from network queues.

Considering the context of high reliability and real-time response required for intervehicular communications (including emergency breaking notification for example), we propose a complete validation method of our congestion control algorithms, taking into account reliability, temporal, and operational aspects.

By employing spatial analytical methods to assess social implications of congestion and estimating spatial variations in user experiences, geographers can leverage new data sources to enrich the congestion research still dominated by engineering approaches.

Finally, the relationship between crowd congestion density and speed of recovery and a method of calculating the time of congestion disappearance are presented.

In this study, we present a method to quantify the amount of congestion and the intrinsic risk in pedestrian crowds.

This paper is concerned with a new type of congestion control method that we call anticipative congestion control, which exploits probabilistic information available at a network node about congestion at other nodes.