Learn More
— Considering a single bottleneck model of TCP with a constant number of greedy and nonhomogeneous sources, and assuming that TCP timeouts do not occur, we establish necessary and sufficient conditions, related to the bandwidth delay product, to guarantee that the buffer will never empty. We also demonstrate by simulation that weaker conditions could be(More)
— Using a simple model of saturated, synchronized and homogeneous sources of TCP Reno with drop-tail queue management and a discrete-time framework, we derive for-mulae for stationary as well as transient queueing behavior that shed light on the relationship between large buffers and work conservation (queue never empties). Using simulations, the relevance(More)
—This paper studies loss calculation in hierarchical networks with multiservice overflows which have different call arrival rates, mean holding times, bandwidth requirements and share a common link. The loss calculation involves two challenging problems: 1) the computation of the two moment characterizations of multiservice overflow traffic over the shared(More)
—Advances in computing and networking are generating a significant demand for video-on-demand (VOD) applications. In this paper, the condition for minimum blocking probability of a VOD system is derived. The optimal load-sharing requirement in such a system is found so that the minimum blocking probability is achieved. A combination of genetic algorithm and(More)
—Multipath routing is a key technique to support video transmission over wireless ad hoc networks (WANETs). In WANETs, the lifetime of a node is related to its residual energy, current traffic conditions and the required energy consumed for sending a packet to its next hop in the path. In this paper, we propose a new adaptive routing scheme termed(More)