Arunabha (Arun) Sen, Arizona State University

Location :

Room 554,
LIP6, Paris

Abstract :

Efforts are currently underway in the U.S. Air Force to utilize a
heterogeneous  set of physical links (RF, Optical/Laser and SATCOM) to
interconnect a set of terrestrial, space and highly mobile airborne
platforms (satellites, aircrafts and  Unmanned Aerial Vehicles (UAVs))
to form an Airborne Network (AN). We propose an architecture for an
Airborne Network to provide a stable operating environment. We design
algorithms to compute the speed of movement of the airborne platforms,
so that the resulting dynamic topology remains connected at all times.
Faults are likely to be localized in military networks where an enemy
attack may inflict massive but localized damage to the network. To
capture the notion of locality in fault tolerance capability of such
networks, we introduce the notion of region-based connectivity. The
attractive feature of the region-based connectivity as a metric is that
it can achieve the same level of fault-tolerance as the metric
connectivity, but with much lower transmission power for the nodes.

Optical bypass is an emergent technology that eliminates the need for
optical-electrical-optical (O-E-O) conversion at most of the network
nodes.  However, the resulting network is still not all-optical,  i.e.,
all connections cannot be established solely in the optical domain.
Since the optical reach (the distance an optical signal can travel
before its quality degrades to a level that necessitates regeneration)
ranges from 500 to 2000 miles, regeneration of optical signals is
essential to establish lightpaths of lengths greater than the optical
reach. Given the optical reach of the signal, the goal of the
regenerator placement problem is to find the minimum number of
regenerators necessary in the network, so that every pair of nodes is
able to establish a lightpath between them. We formulate the regenerator
placement problem as a Connected Dominating Set problem in a Labeled
Graph (LCDS) and provide a procedure for computing it. We evaluate the
effectiveness of our approach on several networks.

Host :

Matthieu Latapy