A generic 10 Gbps assembly edge node and testbed for frame switching networks

Mutter, Arthur; Köhn, Martin; Sund, Matthias

doi:10.1109/tridentcom.2009.4976201

Cited by 3 publications

(2 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is often assumed that assembled frames are sent immediately when either the timeout value or the frame length has been reached, without taking the scheduling problem into consideration [18][19][20].…”

Section: Relevant Workmentioning

confidence: 99%

See 1 more Smart Citation

Frame Assembly and Scheduling on Edge Routers in Fixed-Size Frame-Switching Networks

Zhang

Sun

2012

J. Opt. Commun. Netw.

View full text Add to dashboard Cite

Frame assembly is seen as an important technology in future core networks since it can mitigate the ever-increasing packet header processing load on network nodes. Since frame assembly changes the pattern of traffic entering the network, it has a significant impact on such aspects of network performance as packet drop probability and end-to-end delay. This paper focus on the packet drop and delay performance on assembly nodes, sometimes called edge routers. We reveal that frame assembly on edge routers is in fact a tradeoff between packet loss performance and fairness, especially when the input client traffic is non-uniformly distributed among multiple destinations. We evaluate existing frame assembly and scheduling algorithms and try to cope with the assembly and scheduling process holistically by proposing a new algorithm, named highest efficiency fair queuing. Simulation results show that the proposed algorithm provides better performance in terms of delay and jitter, while also minimizing the average packet loss rate. . He serves on panels for four journals and 12 conferences, including IEEE JLT, OFC, APOC. His interests are in optical transport networks with GMPLS control, and optical packet switching. He is the co-author of over 200 peer-reviewed journal and conference papers.

show abstract

Section: Relevant Workmentioning

confidence: 99%

“…Assembly algorithms/parameter tuning Traffic shaping; End-to-end delay, PLR [18][19][20] VOQ scheduling algorithms Nodal throughput; Time complexity [22][23][24][25] Assembly or scheduling algorithms Nodal delay, PLR [12,13] loss problem in systems with stable but non-uniform traffic distribution.…”

Section: Relevant Workmentioning

confidence: 99%