Sciweavers

890 search results - page 6 / 178
» On the attractiveness of the star network
Sort
View
ISCC
2006
IEEE
14 years 1 months ago
SASA: A Synthesis Scheduling Algorithm with Prediction and Sorting Features
We present a new scheduling algorithm, which is a synthesis of all the remarkable features of pretransmission coordination-based protocols for broadcast and select star networks. ...
Panagiotis G. Sarigiannidis, Georgios I. Papadimit...
IPPS
2002
IEEE
14 years 14 days ago
Reliable Communication in Faulty Star Networks
‘ We take advantage of the hierarchical structure of the star graph network to obtain an efficient method for constructing node-disjoint paths between arbitrary pairs of nodes in...
Khaled Day, Abdel Elah Al-Ayyoub
USENIX
2004
13 years 9 months ago
EmStar: A Software Environment for Developing and Deploying Wireless Sensor Networks
Many Wireless Sensor Network (WSN) applications are composed of a mixture of deployed devices with varying capabilities, from extremely constrained 8-bit "Motes" to less...
Lewis Girod, Jeremy Elson, Alberto Cerpa, Thanos S...
GLOBECOM
2007
IEEE
14 years 1 months ago
Inter-Area Shared Segment Protection of MPLS Flows Over Agile All-Photonic Star Networks
—We study the resilience of MPLS flows over an agile all-photonic star WDM network (AAPN). On the basis of our previous inter-area optimal routing architecture, we propose and de...
Peng He, Gregor von Bochmann
SIROCCO
2010
13 years 9 months ago
Traffic Grooming in Star Networks via Matching Techniques
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
Ignasi Sau, Mordechai Shalom, Shmuel Zaks