The Research of a Grid Security Agent for the Network Blocking
暂无分享,去创建一个
This paper will study an grid security agent for the network blocking, in which a connection between a pair of nodes in the network is assigned a path. Moreover, on the links of that path no other connection can share the assigned path. Then we calculate the blocking probabilities for the network model and the routing scheme is the least loaded routing.
[1] Jie Wu,et al. On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks , 2001, Journal of Communications and Networks.
[2] Vaduvur Bharghavan,et al. Routing in ad-hoc networks using minimum connected dominating sets , 1997, Proceedings of ICC'97 - International Conference on Communications.
[3] D. W. Davies,et al. The control of congestion in packet switching networks , 1971, Symposium on Problems in the Optimizations of Data Communications Systems.