TY - GEN
T1 - Batched circuit switched routing for efficient service of requests
AU - Harwood, Aaron
AU - Shen, Hong
N1 - Publisher Copyright:
© 2000 IEEE.
PY - 2000
Y1 - 2000
N2 - Circuit switching protocols were largely developed in light of ATM virtual circuits and also for the case of all-optical networks. The merging of ATM and IP packet switching technology may banish true circuit switching in the digital domain due to fast switching networks using TDM. Even so, the characteristics of all-optical light paths (an optical circuit switched path) are so desirable that digital WAN's using ATM may eventually be completely augmented by optical WAN's using a hybrid optoelectronic or complete optical switching fabric. A fundamental problem is servicing a large number of requests while maintaining a low blocking probability where a request is blocked if the path it requires is in use by a circuit. We present a simple routing method, namely Batched Circuit Switching (BCS), that batches requests according to the rate of arrival and service time. Compared to orthodox Circuit Switching (CS), BCS provides superior request service times due to the observation that many requests may traverse the same circuit (or channel) during the batch time interval, rather than being blocked by preceding requests (as is the case for CS). Thus, BCS exhibits better utilization of the network resources than CS. We demonstrate the requirements for this system to be stable, namely that the batch size must not increase to infinity before being serviced and the relationship between X (the arrival rate of requests) and p (the service rate of requests) to ensure stability.
AB - Circuit switching protocols were largely developed in light of ATM virtual circuits and also for the case of all-optical networks. The merging of ATM and IP packet switching technology may banish true circuit switching in the digital domain due to fast switching networks using TDM. Even so, the characteristics of all-optical light paths (an optical circuit switched path) are so desirable that digital WAN's using ATM may eventually be completely augmented by optical WAN's using a hybrid optoelectronic or complete optical switching fabric. A fundamental problem is servicing a large number of requests while maintaining a low blocking probability where a request is blocked if the path it requires is in use by a circuit. We present a simple routing method, namely Batched Circuit Switching (BCS), that batches requests according to the rate of arrival and service time. Compared to orthodox Circuit Switching (CS), BCS provides superior request service times due to the observation that many requests may traverse the same circuit (or channel) during the batch time interval, rather than being blocked by preceding requests (as is the case for CS). Thus, BCS exhibits better utilization of the network resources than CS. We demonstrate the requirements for this system to be stable, namely that the batch size must not increase to infinity before being serviced and the relationship between X (the arrival rate of requests) and p (the service rate of requests) to ensure stability.
UR - http://www.scopus.com/inward/record.url?scp=48149097116&partnerID=8YFLogxK
U2 - 10.1109/ISPAN.2000.900257
DO - 10.1109/ISPAN.2000.900257
M3 - Conference contribution
AN - SCOPUS:48149097116
T3 - Proceedings - International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN 2000
SP - 30
EP - 35
BT - Proceedings - International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN 2000
A2 - Sudborough, Hal
A2 - Monien, Burkhard
A2 - Hsu, D. Frank
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 5th International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN 2000
Y2 - 7 December 2000 through 9 December 2000
ER -