This paper develops a spatial general equilibrium model to explore the endogenous relations between urban sprawl, job decentralization, and traffic congestion, and then compare the efficiency and welfare impacts of anti-congestion policies. Results suggest that congestion spurs firms to decentralize and agglomerate away from the urban center, with households living more centrally. A congestion-...

| Typical placement objectives involve reducing net-cut cost or minimizing wirelength. Congestion minimization is the least understood, however, it models routability most accurately. In this paper, we study the congestion minimization problem during placement. First, we show that a global placement with minimum wirelength has minimum total congestion. We show that minimizing wirelength may (an...

In this article, we propose a unified solution called Transmission Control Protocol (TCP) for Non-Congestion Events (TCP NCE), to overcome the performance degradation of TCP due to non-congestion events over wireless networks. TCP NCE is capable to reduce the unnecessary reduction of congestion window size and retransmissions caused by non-congestion events such as random loss and packet reorde...

Congestion remains one of the main obstacles to the Quality of Service (QoS) on the Internet. We think that a good solution to Internet congestion should optimally combine congestion signaling from network and source reaction, with the following as its main goals: minimum losses and delays, maximum network utilization, fairness among flows, and last but not least, scalability of the solution. T...

ad hoc mobile networks have dynamic topology with no central management. because of the high mobility of nodes, the network topology may change constantly, so creating a routing with high reliability is one of the major challenges of these networks .in the proposed framework first, by finding directions to the destination and calculating the value of the rout the combination of this value with ...

The end-to-end nature of Internet congestion control is an important factor in its scalability and robustness. However, end-to-end congestion control algorithms alone are incapable of preventing the congestion collapse and unfair bandwidth allocations created by applications which are unresponsive to network congestion. In this paper, we propose and investigate a new congestion avoidance mechan...

In recent years, various non-linear phenomena of the Internet have been discovered. For instance, it is reported that the congestion of a router propagates to neighboring routers like a wave. Several researches on the congestion propagation between routers have been performed. However, in these researches, cause of the congestion propagation between routers and condition that the congestion pro...

The paper is devoted to estimates of the spanning tree congestion for some planar graphs. The main results of the paper: (1) We almost determined (up to ±1) the maximal possible spanning tree congestion for planar graphs. (2) The value of congestion indicator introduced in Ostrovskii [Discrete Math. 310 (2010), no. 6–7, 1204–1209] can be very far from the value of the spanning tree congestion. ...

Standardisation of Web Real-Time Communications (WebRTC) and Telepresence will likely lead to greatly increased deployment of interactive multimedia applications on the Internet. The resulting high-rate multimedia traffic may cause congestion, but few congestion control solutions have been proposed. We suggest that the congestion control, codec, and application be coupled and engage in a dialog...

Nodal congestion in ABR traac control design is often detected by comparison of present queue size with a pre-assigned queue-threshold. Such queue-threshold detection has the disadvantage of delayed congestion detection and undesired extension of congestion periods. In consequence, the oscillation of ABR traac in each control feedback loop is unnecessarily extended and magniied, causing a large...