Priority-based reservation protocol for variable-length messages in a WDM-based optical subscriber network 


Vol. 30,  No. 4, pp. 153-161, Apr.  2005


PDF
  Abstract

In a multi-channel network based of wavelength division multiplexing (WDM) technology, an efficient protocol is needed in order for the transmitter and receiver to be tuned to the same wavelength during message transmission time. This paper proposes a priority-based reservation protocol that can efficiently support variable-length messages that require different QoS requirements. In this proposed protocol, high-priority nodes can reserve the data channel before low-priority nodes. However, once a node reserves a data channel successfully, it can persistently use the reserved channel till message transmission is finished regardless of the priority of the node. Moreover, the protocol can operate independently of the number of nodes, and any new node can join the network anytime without requiring network re-initialization. The protocol is analyzed with a finite population model and the throughput-delay characteristics are investigated as performance measures.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. h. Lee, "Priority-based reservation protocol for variable-length messages in a WDM-based optical subscriber network," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 4, pp. 153-161, 2005. DOI: .

[ACM Style]

Jae hwoon Lee. 2005. Priority-based reservation protocol for variable-length messages in a WDM-based optical subscriber network. The Journal of Korean Institute of Communications and Information Sciences, 30, 4, (2005), 153-161. DOI: .

[KICS Style]

Jae hwoon Lee, "Priority-based reservation protocol for variable-length messages in a WDM-based optical subscriber network," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 4, pp. 153-161, 4. 2005.