Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Data networks (2nd ed.)
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
IEEE/ACM Transactions on Networking (TON)
Loop-free routing using diffusing computations
IEEE/ACM Transactions on Networking (TON)
The synchronization of periodic routing messages
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Reliable and efficient hop-by-hop flow control
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Network support for multimedia: a discussion of the Tenet approach
Computer Networks and ISDN Systems - Special issue on a multi-dimensional view of multimedia
A path-finding algorithm for loop-free routing
IEEE/ACM Transactions on Networking (TON)
An efficient routing protocol for wireless networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
A loop-free path-finding algorithm: specification, verification and complexity
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3
Contention-Aware Admission Control for Ad Hoc Networks
IEEE Transactions on Mobile Computing
| Hi-index | 0.00 |
A drawback of the conventional Internet routing architecture is that its route computation and packet forwarding mechanisms are poorly integrated with congestion control mechanisms. Any datagram offered to the network is accepted; routers forward packets on a best-effort basis and react to congestion only after the network resources have already been wasted. A number of proposals improve on this to support multimedia applications; a promising example is the Integrated Services Packet Network (ISPN) architecture. However, these proposals are oriented to networks with fairly static topologies and rely on the same conventional Internet routing protocols to operate. This paper presents a routing architecture for mobile integrated services networks in which network nodes (routers) can move constantly while providing end-to-end performance guarantees. In the proposed connectionless routing architecture, packets are individually routed towards their destinations on a hop by hop basis. A packet intended for a given destination is allowed to enter the network if and only if there is at least one path of routers with enough resources to ensure its delivery within a finite time. Once a packet is accepted into the network, it is delivered to its destination, unless resource failures prevent it. Each router reserves resources for each active destination, rather than for each source–destination session, and forwards a received packet along one of multiple loop-free paths towards the destination. The resources and available paths for each destination are updated to adapt to congestion and topology changes. This mechanism could be extended to aggregate dissimilar flows as well.