Sciweavers

506 search results - page 32 / 102
» The Packet Switching Brain
Sort
View
INFOCOM
2006
IEEE
15 years 3 months ago
Loss-Cognizant Pricing in Feed-Forward Networks with Greedy Users
— We consider feed-forward packet switched networks with fixed routing and random congestion losses. Users of the network are assumed to be greedy in the sense that each user in...
Ashraf Al Daoud, Murat Alanyali
SIGCOMM
2010
ACM
14 years 10 months ago
Scalable flow-based networking with DIFANE
Ideally, enterprise administrators could specify fine-grain policies that drive how the underlying switches forward, drop, and measure traffic. However, existing techniques for fl...
Minlan Yu, Jennifer Rexford, Michael J. Freedman, ...
INFOCOM
2003
IEEE
15 years 3 months ago
Providing Guaranteed Rate Services in the Load Balanced Birkhoff-von Neumann Switches
— In this paper, we propose two schemes for the load balanced Birkhoff-von Neumann switches to provide guaranteed rate services. As in [7], the first scheme is based on an Earli...
Cheng-Shang Chang, Duan-Shin Lee, Chi-Yao Yue
INFOCOM
2003
IEEE
15 years 3 months ago
Exploiting Parallelism to Boost Data-Path Rate in High-Speed IP/MPLS Networking
Abstract—Link bundling is a way to increase routing scalability whenever a pair of Label Switching Routers in MPLS are connected by multiple parallel links. However, link bundlin...
Indra Widjaja, Anwar Elwalid
IPPS
2000
IEEE
15 years 2 months ago
Optimal on Demand Packet Scheduling in Single-Hop Multichannel Communication Systems
In this paper, we study the problem of on demand minimum length packet scheduling in single-hop multichannel systems. Examples of these systems are those centered around switching...
Maurizio A. Bonuccelli, Susanna Pelagatti