Share Email Print

Proceedings Paper

Static task scheduling based on ethernet virtual connections with varied granularities in ethernet over SDH networks
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

This paper describes the Task Scheduling problem over Ethernet Virtual Connections which provides multiple-granularity and the problem of scheduling tasks over two user network interfaces is considered. Three approximate models, 2SP, 2LSP and BWS are proposed with algorithms respectively. Numerical simulation results and comparisons are also presented.

Paper Details

Date Published: 19 November 2007
PDF: 10 pages
Proc. SPIE 6784, Network Architectures, Management, and Applications V, 678407 (19 November 2007); doi: 10.1117/12.743739
Show Author Affiliations
Lei Shi, Shanghai Jiao Tong Univ. (China)
Weiqiang Sun, Shanghai Jiao Tong Univ. (China)
Guowu Xie, Shanghai Jiao Tong Univ. (China)
Yaohui Jin, Shanghai Jiao Tong Univ. (China)
Wei Guo, Shanghai Jiao Tong Univ. (China)
Weisheng Hu, Shanghai Jiao Tong Univ. (China)

Published in SPIE Proceedings Vol. 6784:
Network Architectures, Management, and Applications V
Jianli Wang; Gee-Kung Chang; Yoshio Itaya; Herwig Zech, Editor(s)

© SPIE. Terms of Use
Back to Top