Sciweavers

1912 search results - page 380 / 383
» Optimizing interconnection policies
Sort
View
CCR
2002
97views more  CCR 2002»
13 years 6 months ago
Multi-modal network protocols
Most network protocols are uni-modal: they employ a single set of algorithms that allows them to cope well only within a narrow range of operating conditions. This rigid design re...
Rajesh Krishna Balan, Aditya Akella, Srinivasan Se...
TELSYS
2002
128views more  TELSYS 2002»
13 years 6 months ago
An Evaluation of Shared Multicast Trees with Multiple Cores
Native multicast routing protocols have been built and deployed using two basic types of trees: singlesource, shortest-path trees and shared, core-based trees. Core-based multicas...
Daniel Zappala, Aaron Fabbri, Virginia Mary Lo
INFOCOM
2010
IEEE
13 years 5 months ago
Limitations and Possibilities of Path Trading between Autonomous Systems
Abstract—When forwarding packets in the Internet, Autonomous Systems (ASes) frequently choose the shortest path in their network to the next-hop AS in the BGP path, a strategy kn...
Yuval Shavitt, Yaron Singer
JSAC
2010
101views more  JSAC 2010»
13 years 5 months ago
Shortest propagation delay (SPD) first scheduling for EPONs with heterogeneous propagation delays
—Due to the geographic distribution of its subscribers, Ethernet Passive Optical Networks (EPONs) have typically varying propagation delays between the Optical Network Units (ONU...
Michael P. McGarry, Martin Reisslein, Frank Aurzad...
RTAS
2010
IEEE
13 years 5 months ago
Scheduling Self-Suspending Real-Time Tasks with Rate-Monotonic Priorities
Abstract—Recent results have shown that the feasibility problem of scheduling periodic tasks with self-suspensions is NPhard in the strong sense. We observe that a variation of t...
Karthik Lakshmanan, Ragunathan Rajkumar