Characterization of Failures in an Operational IP Backbone Network (2009)
Athina Markopoulou, Gianluca Iannaccone, Supratik Bhattacharyya, Chen-nee Chuah, Yashar Ganjali, Christophe Diot
Abstract—As the Internet evolves into a ubiquitous communication infrastructure and supports increasingly important services, its dependability in the presence of various failures becomes critical....
Obtaining High Throughput in Networks with Tiny Buffers (2009)
Neda Beheshti, Yashar Ganjali, Ashish Goel, Nick Mckeown
Abstract — In this paper we explore whether a general topology network built up of routers with very small buffers, can maintain high throughput under TCP’s congestion control mechanism. Recent...
Neda Beheshti, Nick Mckeown, Yashar Ganjali, Jad Naous, Monia Ghobadi, Geoff Salmon
It is commonly believed that the Internet has deficiencies that need to be fixed. However, making changes to the current Internet infrastructure is not easy, if possible at all. Any new protocol or...
Experimenting with Buffer Sizes in Routers (2009)
Neda Beheshti, Jad Naous, Nick Mckeown, Yashar Ganjali
Recent theoretical results in buffer sizing research suggest that core Internet routers can achieve high link utilization, if they are capable of storing only a handful of packets. The underlying...
Obtaining High Throughput in Networks with Tiny Buffers (2009)
Neda Beheshti, Yashar Ganjali, Ashish Goel, Nick Mckeown
Abstract — In this paper we explore whether a general topology network built up of routers with very small buffers, can maintain high throughput under TCP’s congestion control mechanism. Recent...
ABSTRACT Part III: Routers with very small buffers ∗ (2008)
Mihaela Enachescu, Ashish Goel, Tim Roughgarden, Yashar Ganjali, Nick Mckeown
Internet routers require buffers to hold packets during times of congestion. The buffers need to be fast, and so ideally they should be small enough to use fast memory technologies such as SRAM or...
ABSTRACT Part III: Routers with Very Small Buffers ∗ (2008)
Mihaela Enachescu, Ashish Goel, Tim Roughgarden, Yashar Ganjali, Nick Mckeown
Internet routers require buffers to hold packets during times of congestion. The buffers need to be fast, and so ideally they should be small enough to use fast memory technologies such as SRAM or...
ABSTRACT Update on Buffer Sizing in Internet Routers ∗ (2008)
In the past two years, several papers have proposed rules that suggest two to five orders of magnitude reduction in Internet core router buffers. Others present scenarios where buffer sizes need to...
Routing in a Highly Dynamic Topology (2008)
Routing in mobile ad-hoc networks is hard because the topology can change very rapidly. By the time new paths are discovered, the network can change again -- and in extreme cases, packets circulate...
Therese Biedl, Timothy Chan, Yashar Ganjali, Mohammadtaghi Hajiaghayi, David R. Wood
We consider the problem of determining a balanced ordering of the vertices of a graph; that is, the neighbors of each vertex v are as evenly distributed to the left and right of v as possible. This...
Therese Biedl, Timothy Chan, Yashar Ganjali, Mohammadtaghi Hajiaghayi, David R. Wood
We consider the problem of determining a balanced ordering of the vertices of a graph; that is, the neighbors of each vertex v are as evenly distributed to the left and right of v as possible. This...
Mohammad Taghi Hajiaghayi, Yashar Ganjali, Communicated F. Dehne
A binary matrix has the Consecutive Ones Property (C1P) for columns if there exists a permutation of its rows that leaves the 1’s consecutive in every column. The problem of Consecutive Ones...
Routers with Very Small Buffers (2006)
Mihaela Enachescu, Ashish Goel, Tim Roughgarden, Yashar Ganjali, Nick Mckeown
Internet routers require buffers to hold packets during times of congestion. The buffers need to be fast, and so ideally they should be small enough to use fast memory technologies such as SRAM or...
Routers with Very Small Buffers (2006)
Mihaela Enachescu Yashar, Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Nick Mckeown, Tim Roughgarden
Internet routers require buffers to hold packets during times of congestion. The buffers need to be fast, and so ideally they should be small enough to use fast memory technologies such as SRAM or...
Routers with Very Small Buffers (2006)
Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Nick Mckeown, Tim Roughgarden
Abstract — Internet routers require buffers to hold packets during times of congestion. The buffers need to be fast, and so ideally they should be small enough to use fast memory technologies such...
Buffer sizing in all-optical packet switches (2006)
Neda Beheshti, Yashar Ganjali, Ramesh Rajaduray, Daniel Blumenthal, Nick Mckeown
Abstract: Packet-switched routers need buffers during times of congestion. We show that a combined input-output queued router needs no more buffering than an output queued router. Using simulations,...
Routers with Very Small Buffers (2006)
Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Nick Mckeown, Tim Roughgarden
Abstract — Internet routers require buffers to hold packets during times of congestion. The buffers need to be fast, and so ideally they should be small enough to use fast memory technologies such...
Cell switching versus packet switching in input-queued switches (2005)
Yashar Ganjali, Abtin Keshavarzian, Student Member, Student Member, Devavrat Shah
Abstract—Input Queued (IQ) switches have been well studied in the past two decades by researchers. The main problem concerning IQ switches is scheduling the switching fabric in order to transfer...
Balanced Vertex-Orderings of Graphs (2004)
Therese Biedl, Timothy Chan, Yashar Ganjali, Mohammadtaghi Hajiaghayi, David R. Wood
In this paper we consider the problem of determining a balanced ordering of the vertices of a graph; that is, the neighbors of each vertex v are as evenly distributed to the left and right of v as...
Input Queued Switches: Cell Switching vs. Packet Switching (2003)
Yashar Ganjali, Abtin Keshavarzian, Devavrat Shah
Abstract--- Input Queued(IQ) switches have been very well studied in the recent past. The main problem in the IQ switches concerns scheduling. The main focus of the research has been the fixed length...
Input Queued Switches: Cell Switching vs. Packet Switching (2003)
Yashar Ganjali, Abtin Keshavarzian, Devavrat Shah, Student Member, Student Member, Student Member
Input Queued(IQ) switches have been very well studied in the recent past. The main problem in the IQ switches concerns scheduling. The main focus of the research has been the £xed length...
Abstract EE384Y: Packet Switch Architectures II Cell Switching vs. Packet Switching (2002)
Abtin Keshavarzian, Yashar Ganjali
In current switching systems, all packets are divided into equal-sized cells before being scheduled. This is because of the fact that cell-based scheduling is easier to be implemented in hardware. In...
A note on the consecutive ones submatrix problem (2002)
Mohammadtaghi Hajiaghayi, Yashar Ganjali
A binary matrix has the Consecutive Ones Property (C1P) for columns if there exists a permutation of its rows that leaves the 1's consecutive in every column. The problem of Consecutive Ones...
Multi-dimensional Interval Routing Schemes (2001)
Routing messages between pairs of nodes is one of the most fundamental tasks in any distributed computing system. An Interval Routing Scheme (IRS) is a well-known, space-efficient routing strategy...
Multi-dimensional Interval Routing Schemes (2001)
Routing messages between pairs of nodes is one of the most fundamental tasks in any distributed computing system. An Interval Routing Scheme (IRS) is a well-known, space-efficient routing strategy...
Multi-dimensional Interval Routing Schemes (2001)
Routing messages between pairs of nodes is one of the most fundamental tasks in any distributed computing system. An Interval Routing Scheme (IRS) is a well-known, space-efficient routing strategy...
Multi-dimensional Interval Routing Schemes (2001)
Routing messages between pairs of nodes is one of the most fundamental tasks in any distributed computing system. An Interval Routing Scheme (IRS) is a well-known, space-efficient routing strategy...
Characterization of Networks Supporting Multi-dimensional Linear Interval Routing Schemes (2001)
Yashar Ganjali, Mohammadtaghi Hajiaghayi
An Interval Routing Scheme (IRS) is a well-known, space ecient routing strategy for routing messages in a distributed network. In this scheme, each node of the network is assigned an integer label...
Balanced vertex-orderings of graphs (2001)
Therese Biedl, Timothy Chan, Mohammadtaghi Hajiaghayi, Yashar Ganjali
In this paper we consider the problem of determining a balanced ordering of the vertices of a graph; that is, the neighbouts of each vertex v are as evenly distributed to the left and right of v as...
Characterization of Networks Supporting Multi-dimensional Linear Interval Routing Schemes (2001)
Yashar Ganjali, Mohammadtaghi Hajiaghayil
An Interval Routing Scheme (IRS) is a well-known, space eificient routing strategy for routing messages in a distributed network. In this scheme, each node of the network is assigned an integer label...
Multi-dimensional interval routing schemes (2001)
Yashar Ganjali, C Yashar Ganjali
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required nal revisions, as accepted by my examiners. I understand that my thesis may be...
Balanced vertex-orderings of graphs (2001)
Therese Biedl, Timothy Chan, Yashar Ganjali, Mohammadtaghi Hajiaghayi, David R. Wood
In this paper we consider the problem of determining a balanced ordering of the vertices of a graph; that is, the neighbours of each vertex v are as evenly distributed to the left and right of v as...
Multi-dimensional interval routing schemes (2001)
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be...
Multi-dimensional interval routing schemes (2001)
Abstract. One of the fundamental tasks in any distributed computing system is routing messages between pairs of nodes. An Interval Routing Scheme (IRS) is a space efficient way of routing messages in...
Multi-dimensional interval routing schemes (2001)
One of the fundamental tasks in any distributed computing system is routing mes-sages between pairs of nodes. An Interval Routing Scheme (IRS) is a space efficient way of routing messages in a...
Characterization of Networks Supporting Multi-dimensional Linear Interval Routing Schemes (2001)
An Interval routing scheme (IRS) is a well-known, space efficient routing strategy for routing messages in a distributed network. In this scheme, each node of the network is assigned an integer label...
Multi-dimensional Interval Routing Schemes (2001)
Routing messages between pairs of nodes is one of the most fundamental tasks in any distributed computing system. An Interval Routing Scheme (IRS) is a well-known, space-efficient routing strategy...
Information Processing Letters 83 (2002) 163--166 (1979)
Note On The, Mohammad Taghi Hajiaghayi, Yashar Ganjali, Communicated F. Dehne
A binary matrix has the Consecutive Ones Property (C1P) for columns if there exists a permutation of its rows that leaves the 1's consecutive in every column. The problem of Consecutive Ones...