arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1701.02030cs.NI
收藏

WDM网络中近似最优数据传输时间的开放式方法

An open shop approach in approximating optimal data transmission duration in WDM networks

Timotheos Aslanidis, Stavros Birmpilis

摘要:

在过去的十年中,光WDM网络(波分复用)被非常频繁地使用,特别是就宽带应用而言。通过这种网络传输的消息包可以使用时隙中断,以便最大限度地提高网络使用率,并最大限度地减少所有消息到达目的地所需的时间。然而,抢占数据包将导致时间成本。通过这样的网络调度消息分组的问题被称为PBS,并且已知是NP困难的。在本文中,我们已经减少了PBS开放车间调度和设计的多项式可解的情况下,开放车间近似PBS的变化。我们结合这些变化,并呼吁诱导算法HSA(混合调度算法)。我们进行了实验来建立HSA的效率,并发现在所有使用的数据集中,它产生的时间表非常接近最优。为了进一步确定HSAs的效率,我们进行了测试,将其与SGA进行比较,SGA是另一种算法,在过去的测试中取得了很好的结果。

英文摘要:

In the past decade Optical WDM Networks (Wavelength Division Multiplexing) are being used quite often and especially as far as broadband applications are concerned. Message packets transmitted through such networks can be interrupted using time slots in order to maximize network usage and minimize the time required for all messages to reach their destination. However, preempting a packet will result in time cost. The problem of scheduling message packets through such a network is referred to as PBS and is known to be NP-Hard. In this paper we have reduced PBS to Open Shop Scheduling and designed variations of polynomially solvable instances of Open Shop to approximate PBS. We have combined these variations and called the induced algorithm HSA (Hybridic Scheduling Algorithm). We ran experiments to establish the efficiency of HSA and found that in all datasets used it produces schedules very close to the optimal. To further establish HSAs efficiency we ran tests to compare it to SGA, another algorithm which when tested in the past has yielded excellent results.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑