Communications of the ACM
Proportional differentiated services: delay differentiation and packet scheduling
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Optimal oblivious routing in polynomial time
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Computing Elementary Symmetric Polynomials with a Subpolynomial Number of Multiplications
SIAM Journal on Computing
Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture
Competitive routing of virtual circuits in ATM networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Suppose that we would like to design a network for n users such that all users would be able to send and receive messages to and from all other users, and the communication should be secure, that is, only the addressee of a message could decode the message. The task can easily be completed using some classical interconnection network and secure routers in the network. Fast optical networks are slowed down considerably if routers are inserted in their nodes. Moreover, handling queues or buffers at the routers is extremely hard in all-optical setting. The main result of the present work is the generalization of our earlier work [6]. That work gave two mathematical models for secure routerless networks when the Senders and the Receivers formed disjoint sets. Here we present mathematical models for routerless secure networks in the general case: now all users can send and receive.