Pipelined Transmission Scheduling in TWDM TT-FR Rings
碩士 === 國立中正大學 === 資訊工程研究所 === 89 === In this thesis, we focus on the scheduling problem for All-to-All Personalized Communication(AAPC) pipeline transmissions in unidirectional TWDM TT-FR rings. We assume that each node has only one TT-FR(fully tunable transmitter and fixed receiver) pair...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2001
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/39890962648792853659 |
| Summary: | 碩士 === 國立中正大學 === 資訊工程研究所 === 89 === In this thesis, we focus on the scheduling problem for All-to-All Personalized Communication(AAPC) pipeline transmissions in unidirectional TWDM TT-FR rings. We assume that each node has only one TT-FR(fully tunable transmitter and fixed receiver) pair, and tuning latency and propagation delay are considered. Each node has to send a unique packet to each of the other nodes. The objective is to minimize the number of time slots required to accomplish all tasks. In this thesis, we show how to formulate the scheduling problem as a 0/1 integer linear programming(ILP). Three heuristic algorithms are also proposed to solve this problem.
|
|---|