Addisu Eshete

Learn More
—Most of router mechanisms proposed for fair band-width sharing lack either (1) simplicity due to complexity of intricate per flow management of all connections (e.g., WFQ, SFQ), (2) heterogeneity due to a design targeting a specific traffic type, e.g., RED-PD and Fair RED (FRED) or (3) robustness due to requirement for proper router configurations (e.g.,(More)
The Internet is no longer controlled by a single TCP algorithm. Due to the scalability limitations of traditional TCP algorithms, a plethora of new high-speed TCP congestion control algorithms have been proposed and deployed. Having no standards to follow, these algorithms are ad hoc fixes and some of them have been adopted by various operating system(More)
—The IEEE 802.16 is the standard for broadband wireless access. One promise of this technology (also called WiMAX) is to provide high-speed access to the Internet where the transmission control protocol (TCP) is the core transport protocol. In this paper, we study the impact of network asymmetry in WiMAX on TCP performance. In particular, we investigate the(More)
This paper proposes a simple and stateless active queue management (AQM) scheme, called geometric CHOKe (gCHOKe), to protect responsive flows from unresponsive ones. The proposed gCHOKe has its root on and is a generalization of the original CHOKe. It provides an extended power of flow protection, achieved by introducing an extra flow matching trial upon(More)
—This paper presents S-SFQ which is a single queue design and implementation of the well-known Start-time Fair Queueing (SFQ). This aggregate queue orders packets based on their timestamps rather than order of arrivals. Through simulation, we show the performance gains of S-SFQ over other default single-queue schemes such as RED and FIFO in terms of link(More)
This paper proposed to investigate and evaluate the performance of one of the algorithm used to provide fair bandwidth allocation to the flows. First In First Out (FIFO) queuing is simple but does not protect responsive flows from unresponsive one, flows that are sending more than their fair share. One of FIFO queuing is Random Early Detection which it can(More)
—This paper presents a formula for the throughput of a network considering the bursty nature and delay requirements of real sources by using the established results in the area of guaranteed rate scheduling. The network of which the throughput is derived, implements aggregate scheduling which has been tipped as the solution to address scalability issues in(More)
  • 1