1 / 21

Broadcast-and-select networks

Broadcast-and-select networks. 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)

cyma
Download Presentation

Broadcast-and-select networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Broadcast-and-select networks

  2. Broadcast-and-select networks • Each node is usually attached to two fibers: one to transmit, one to receive W WDM channels are available • Txand 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 • We need a Medium Access Control (MAC) protocol

  3. 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 usually cost more than tunable txs) • For example: 2 fixed tx/rxper node allow to build a shuffle topology

  4. Level of performance It is measured by Packet delay: The delay is specified from the start of the packet being transmitted at the source to the end of the packet being received at the destination and through put of network : data that are successfully received by their destination

  5. Slot synchronization

  6. Synchronization algorithm • Predicts the time of arrival of the next sync pulse at its receiver • Estimates the round trip delay • A node transmits the information one round trip delay prior to the estimated time of arrival.

  7. Slotted Aloha/Slotted Aloha protocol Some basic assumption • No. of wavelength or channel, W<N • Each node must have a fixed –tuned transmitter and receiver operating at control wavelength

  8. Slotted Aloha/Slotted Aloha • Aloha used in single channel broadcast network where any node that has a packet to send transmits it immediately. • Whereas In slotted aloha time is divided into slots whose length is equal to the maximum sized packet In multichannel network • The time is divided into slots for data as well as the control channel

  9. Basic Slotted Aloha/Slotted Aloha protocol Operation: When a data to be send : Control packet is sent in control slot Data packet is sent in data slot • Every node – Keeps listening to the control channel – When a transmission to its address is detected, it tunes the rx on channel λT This is called “tell-and-go” approach (data is assumed to be received after large propagation delays) There can be collisions and contention.

  10. Basic Slotted Aloha/Slotted Aloha protocol

  11. Control wavelength protocol : Slotted Aloha Data wavelength protocol: Slotted Aloha Thus the name Slotted Aloha / Slotted Aloha

  12. Modified SA/SA • To avoid useless transmissions on the data channels after collisions on control and data channels, it is possible to use a “wait-and-see” approach: do not transmit data until the control frame is received back (after a propagation delay); we get: • higher throughput • higher access delays

  13. Access delays Defined as the delay between the time at which a packet is available for transmission at a node and the time at which it is first transmitted

  14. Through put analysis Some assumptions are required • Independent transmission • Large “n” • Uniform traffic

  15. Independent transmission In any slot and for any node the probability that the node has a packet for transmission is p, independent of all other slots and all other nodes.

  16. Large “n” • No. of nodes in the network n is very large compared to W Assume that • W is fixed but n ∞ and p 0 then • The expected no. packets in the network is Gnp

  17. Uniform traffic • Data packets is equally likely to be transmitted on any one of the W data channels

  18. Throughput analysis Expected no. of data packets that are successful in any data slot for basic SA/SA is LGe-G/W.(e-G/W)2(L-1) And for modified SA/SA LGe-G/W.(1- Ge-G/W)2(L-1)

  19. DT-WDMA • Dynamic Time-Wavelength Division Multiaccess • This protocol assume that the • Number of nodes n is equal to the number of wavelengths W. • Each node has a 1 Fixed Tr, 1 Tunable Rx and 1 Fixed Rx for the control channel • The size of the data slots is n times the control slots. • The data slots do not overlap in time. • When ever a node, say xi, has a data packet to send, it sends a control packet in a control slot and the data packet in the data slot immediately following it. • Each node continuously monitors the control channel. Thus when node xj, receives a control packet send by node xi it knows that the next data slot has a packet intended for it being transmitted on wavelength I so it tunes its TR to that wavelength. • Features : Data packets never collide also control packet never collide.

  20. Scheduling protocol is a self study. ..

  21. Test beds

More Related