Optical networks are well suited to enable massive data exchanges between datacenters. Elephant data flows can be routed over custom provisioned and dedicated lightpaths (optical flows) while other (mice) flows, which are routed by electronic switches, are unaffected. In some solutions, wavelength-selective switch (WSS) devices are employed in the optical nodes to physically and individually route each lightpath toward its destination. WSS devices take time to be switched and consequently delay the lightpath setup completion time. In this paper, the authors present three approximate Markov chain models to account for three different WSS service policies. These models estimate the expected lightpath setup and teardown time across an optical node that makes use of WSS devices. The first and more conventional policy (model) assumes that each setup and teardown request is handled individually, while the other two policies (models) assume that groups of setup and/or teardown requests are handled together by the WSS. The models' estimates are compared against the results obtained from a computer-based simulator, where both analytical models and simulator account for experimentally measured WSS response times. The simulator is also used to investigate the end-to-end lightpath setup time across an arbitrary mesh network. Results obtained from the models and simulator show that the group-based service policies outperform the conventional policy at high loads. The group-based policies are especially useful in the presence of lightpaths that are frequently set up and have relatively short holding time (i.e., short duration of elephant-optical flows).
ASJC Scopus subject areas
- コンピュータ ネットワークおよび通信