Abstract—This paper proposes a general, parameterized model for analyzing protocol control overhead in mobile ad-hoc networks. A probabilistic model for the network topology and the data traffic is proposed in order to estimate overhead due to control packets of routing protocols. Our analytical

This paper proposes a general, parameterized model for analyzing protocol control overheads in mobile ad-hoc networks. A probabilistic model for the network topology and the data traffic is proposed in order to estimate overhead due to control packets of routing protocols.

This paper addresses the issues of charging, rate control and routing for a communication network carrying elastic traffic, such as an ATM network offering an available bit rate service. A model is described from which max–min fairness of rates emerges as a limiting special case; more generally

A challenging research issue in high speed networking is how to control the transmission rate of statistical data P OWS. This paper describes a new algorithm, Virtual-Clock, for data trafic control in high-speed networks. VirtualClock maintains the statistical multiplexing flexibility of packet

We demonstrate that Ethernet LAN traffic is statistically self-similar, that none of the commonly used traffic models is able to capture this fractal-like behavior, that such behavior has serious implications for the design, control, and analysis of high-speed, cell-based networks

concludes (? 6) with a discussion of its relevance to problems of flow near junctions, including a discussion of the starting flow at a controlled junction. In the introductory sections 1 and 2, we have included some elementary material on the quantitative study of traffic flow for the benefit of scientific

This paper analyzes the survival of organizations in which decision agents do not bear a major share of the wealth effects of their decisions. This is what the literature on large corporations calls separation of “ownership” and “control.” Such separation of decision and risk bearing

This paper proposes a mechanism for equation-based congestion control for unicast traffic. Most best-effort traffic in the current Internet is well-served by the dominant transport protocol, TCP. However, traffic such as best-effort unicast streaming multimedia could find use for a TCP

/delay. In this work, we propose token flow control (TFC), a flow control mechanism in which nodes in the network send out tokens in their local neighborhood to communicate information about their available resources. These tokens are then used in both routing and flow control: to choose less congested paths

This paper considers the potentially negative impacts of an increasing deployment of non-congestion-controlled best-effort traffic on the Internet.’ These negative impacts range from extreme unfairness against competing TCP traffic to the potential for congestion collapse. To promote the inclusion