Professional Documents
Culture Documents
Broadcast-and-Select Networks
Fabio Neri and Marco Mellia
TLC Networks Group Electronics Department
e-mail: lastname@polito.it
http://www.tlc-networks.polito.it/
fabio.neri@polito.it tel. 011 564 4076
marco.mellia@polito.it tel. 011 564 4173
Broadcast&Select WDM networks - 1
Broadcast-and-select networks
No routing, but full connectivity: information from a
source is broadcasted to all receivers; receivers select
the information directed to them, and discard the rest
Similar to traditional LAN operation
All nodes have visibility on all network traffic, but do
not need to process (switch) all of it
The aim is to limit the bandwidth processed by
network nodes, finding the proper balance between
photonic and electronic technology
Broadcast&Select WDM networks - 4
Broadcast-and-select networks
Typical topologies: star, bus and ring
1
8
2
star
coupler
4
5
Passive couplers
Passive component, to couple or split signals in different
fibers
input 1
output 1
input 2
output 2
O1 = I1 + (1-) I2
O2 = (1-) I1 + I2
Can be fiber based, or realized in waveguides
Can be wavelength selective
When = , the input power on one fiber is (as a first
approximation) halved on each output fiber (3 dB coupler)
When 1 (0.9 - 0.95), we have a tap
Broadcast&Select WDM networks - 6
Broadcast-and-select networks
Using a passive star coupler it is possible to build the
broadcast star topology
overall n/2 log2n 22 (3 dB) couplers
log2 n 22 devices crossed on all paths: same power loss
for every node pair
1
2
3
4
5
6
7
8
3-dB coupler
1
2
3
4
5
6
7
8
Broadcast&Select WDM networks - 7
Broadcast-and-select networks
A bus topology requires 2n 22 couplers
Losses along the path are typically larger
(linear with n)
Losses are different for each node pair
3-dB coupler
Broadcast-and-select networks
Each node is usually attached to two fibers: one
to transmit, one to receive
W WDM channels are available
Tx and Rx operate on a single WDM channel at
a time (to reduce electronic bandwidth)
It is possible to observe collisions and contention
Collision: two or more transmitters transmit on the
same channel at the same time
Contention: a single receiver must tune to two or
more channels at the same time
Broadcast-and-select networks
Nodes can be equipped with one or more tx and rx
devices, which may be tunable or fixed
Tunable txs and rxs are more expensive (and tunable rxs
usually cost more than tunable txs)
Connectivity may be limited due to components or
complexity constraints
For example, if node i has a fixed tx on i and a fixed rx
on |i-1|N, a ring logical topology results
Traffic will be then routed using multi-hop paths, going
through a number of intermediate nodes, where OEO
conversion is performed
Broadcast&Select WDM networks - 10
Broadcast-and-select networks
With limited connectivity, a logical topology is built
over the (broadcast star) physical topology
For example: 2 fixed tx/rx per node allow to build a
shuffle topology
1
1
2
5
2 3
9
5
10 13
6 11
3 4
7 6
4
8
7 14
15
8
16
1
1
2
5
2 3
3 4
12 7 6
4
8
Broadcast-and-select networks
Different resource allocation strategies can be adopted
when the traffic pattern is relatively stable (flow duration
much larger than propagation delays), or when a
dynamic, packet by packet, network control is necessary
Often time is slotted, and statistical time multiplexing is
adopted
Tuning time of tx/rx may be a non-negligible and must be
taken into proper account
One (or more) channel can be devoted to signaling
(almost necessary in broadcast stars )
Slot synchronization does not come for free, since the
slot time is small (guard times must be small compared
to the slot duration)
Bit synchronization must be faced as always
Broadcast&Select WDM networks - 12
Slot
synchronization
Synchronization problems
Varying propagation delays must be equalized (ranging)
Slot phase (when the slot starts) and frequency (how long does
it last) information must be distributed; chromatic dispersion
and tuning latencies must be taken in proper account using
guard times at slot boundaries
The bit frequency (not the bit phase) can be broadcasted (to
simplify the receiver design), or acquired at each receiver
The bit phase must be acquired at receivers
Burst mode receivers are necessary: each rx can receive from
a different source in different time slots (we no longer have
point-to-point channels); therefore bit synchronization and
decision threshold must be acquired for each new reception
L=5
data
Every node
Keeps listening to the control channel
When a transmission to its address is detected, it tunes the rx on
channel T
DT-WDMA
Broadcast-and-select star network; N nodes;
W=N channels plus a control channel on c
Time is divided into minislots (signaling) and
slots (data), with N minislots per data slot
data
data
control
N=6
DT-WDMA
Due to transmitter-dedicated channels, no
collision is possible on data channels
No collision on the control channel, due to TDMA
access
There could be contention on the data channel;
we assume that all nodes use the same algorithm
to solve these contentions, so that no explicit ack
is necessary
The destination id is the only information carried
by the control frame (source and data channel are
known due to the TDMA control access)
Broadcast&Select WDM networks - 20
Scheduling protocols
It is possible to increase performance keeping the same DTWDMA scheme, but delaying transmission of data frames
If data frame allocation is decided by all nodes with the
same rules after having received all reservations,
contentions can be avoided
data
slot X
control
end-to-end delay
reservations
for slot X
Performance of scheduling
Scheduling protocols
The previous schemes are distributed: no central control
node, no delay in collecting reservations
They can be viewed as extensions of traditional and
successful LAN MAC protocols to a multi-channel setup
If access delays are increased, and network resources
are allocated to signaling, it is possible to collect all
requests in a central node (or in all network nodes), and
compute a schedule for transmissions in the next slot,
or next set of slots (frame)
In case of a centralized scheduler, the outcome of the
scheduling algorithm must be returned to network nodes
The scheduling (or resource allocation) algorithm can
operate on the knowledge of the traffic request matrix
R[i,j]
Broadcast&Select WDM networks - 23
aN
input 1
output 1
.
.
.
.
.
.
input P
output P
x1
xP
Output buffering
In the packet switch: the switching fabric
and the output card buffers must operate
at the aggregate speed
Limited scalability
a1
input 1
x1
switching fabric
output 1
.
.
.
aN
input P
.
.
.
xP
output P
D
scheduler
Input buffering
Considering W=N WDM channels, the B&S
network behaves as a rearrangeably nonblocking crossbar (if W<N, it becomes a blocking
architecture)
Using a single TX/RX pair (tunable/fixed or
fixed/tunable) it is possible to mimic the behavior
of an input buffer switch
If more than one TX/RX is used, then a
speedup is possible
More than one data frame per slot from each s,d pair
a1
a1,1
output 1
x1,1
x1,P
a1,P
input P
aP
switching architecture
.
.
.
.
.
.
1
aP,1
xP,1
xP,P
aP,P
output P
scheduler
Broadcast&Select WDM networks - 29
Matching problem
input
output
input
output
Scheduling problem
Matching algorithms on bipartite graphs
are used
requests
maximum
matching
maximal
matching
Scheduling
By increasing the access delay, it is possible to solve a
time/frequency scheduling problem considering several
slots in a time frame
Input is the traffic request matrix (which can be static in case of
persistent requests, or dynamic)
Constraints: no more than one transmission per TX and no more
than one transmission per RX in each time slot; tuning latencies
may have to be taken into account
Utility: find the minimum number of slots (minimum frame size) to
satisfy all requests, or minimize losses for a fixed frame
3
1
2
3
1
2
3
1
2
3
1
2
3
1
2
4
1
4
1
4
1
10
1
2
3
4
3
1
4
2
1
3
1
4
2
2
3
1
4
3
3
1
4
4
3
1
2
5
4
1
2
3
4
1
2
3
6
2
3
2
3
10
1
2
3
4
3
1
4
2
1
3
1
4
2
2
3
1
4
3
3
1
4
4
3
4
2
1
5
4
1
2
3
4
1
2
3
6
4
1
2
3
7
4
2
3
9
2
4
1
10
1
2
3
4
3
1
4
2
1
3
1
4
2
2
3
1
4
3
3
1
4
4
3
4
2
1
5
4
1
2
3
4
1
2
3
6
4
1
2
3
7
2
4
1
3
4
3
2
3
1
4
2
3
1
4
2
10
3
1
4
3
3
1
4
4
Broadcast-and-select testbeds
Several B&S testbeds were described since the early 90s:
Lambdanet [Bellcore 1990]: 18 1.5 Gb/s with 2 nm channel spacing
Testbed NTT [NTT 1993]: 100 622 Mb/s with 10 GHz channels
spacing
Rainbow I [IBM 1990]: 32 300 Mb/s with 1 nm channel spacing
Rainbow II [IBM 1996]: 32 1 Gb/s with 1 nm channel spacing
SONATA [E.C. ACTS 1999]: 800 622 Mb/s with 6.25 GHz (0.05 nm)
channel spacing
AWG
Largely used
as WDM
mux/demux
Broadcast&Select WDM networks - 41
AWG-based networks
AWGs have very interesting features to
implement single-hop interconnections using
tunable TXs and (tunable) RXs
TT1
RX1
TT2
RX2
AWG
TTN
RXN
No broadcasting
Max total
bandwidth = N
RXs can be fixed
Broadcast&Select WDM networks - 42
TT
TT
TT
TT
TT
TT
TT
TT
TT
TT
TT
TT
RX
RX
RX
RX
RX
RX
RX
RX
AWG
couplers
couplers
RX
RX
RX
RX
TT
Tx
TX
TX
TX
TX
TX
TX
RX
RX
RX
RX
RX
RX
RX
RX
RX
RX
RX
RX
TT
TT
TT
TT
TT
TT
TT
TT
AWG-based networks
RX
RX
RX
RX
AWG
TT
TT
TT
TT
RX
RX
RX
RX
RX
RX
RX
RX
TT
TT
TT
TT
TT
TT
TT
TT
AWG-based networks
RX
RX
RX
RX
RX
RX
RX
RX
AWG
-converter
WDM mux