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 |
id |
ndltd-TW-089CCU00392052 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-089CCU003920522016-07-06T04:09:53Z http://ndltd.ncl.edu.tw/handle/39890962648792853659 Pipelined Transmission Scheduling in TWDM TT-FR Rings 分時分波多工圓形網路上的管線排程法 Kun Chen 陳坤 碩士 國立中正大學 資訊工程研究所 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. SingLing Lee 李新林 2001 學位論文 ; thesis 31 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立中正大學 === 資訊工程研究所 === 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.
|
author2 |
SingLing Lee |
author_facet |
SingLing Lee Kun Chen 陳坤 |
author |
Kun Chen 陳坤 |
spellingShingle |
Kun Chen 陳坤 Pipelined Transmission Scheduling in TWDM TT-FR Rings |
author_sort |
Kun Chen |
title |
Pipelined Transmission Scheduling in TWDM TT-FR Rings |
title_short |
Pipelined Transmission Scheduling in TWDM TT-FR Rings |
title_full |
Pipelined Transmission Scheduling in TWDM TT-FR Rings |
title_fullStr |
Pipelined Transmission Scheduling in TWDM TT-FR Rings |
title_full_unstemmed |
Pipelined Transmission Scheduling in TWDM TT-FR Rings |
title_sort |
pipelined transmission scheduling in twdm tt-fr rings |
publishDate |
2001 |
url |
http://ndltd.ncl.edu.tw/handle/39890962648792853659 |
work_keys_str_mv |
AT kunchen pipelinedtransmissionschedulingintwdmttfrrings AT chénkūn pipelinedtransmissionschedulingintwdmttfrrings AT kunchen fēnshífēnbōduōgōngyuánxíngwǎnglùshàngdeguǎnxiànpáichéngfǎ AT chénkūn fēnshífēnbōduōgōngyuánxíngwǎnglùshàngdeguǎnxiànpáichéngfǎ |
_version_ |
1718336446269489152 |