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...
‘ 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...
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...
—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...
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 ...