SIP: A routing protocol
β Scribed by Vijay K. Gurbani; Tsun-Chieh Chiang; Suresh Kumar
- Publisher
- Institute of Electrical and Electronics Engineers
- Year
- 2002
- Tongue
- English
- Weight
- 215 KB
- Volume
- 6
- Category
- Article
- ISSN
- 1089-7089
- DOI
- 10.1002/bltj.10
No coin nor oath required. For personal study only.
β¦ Synopsis
Routing in the Internet has traditionally implied shunting packets based on layer 2 (network layer of the IP reference model) addresses. While that may have been adequate in the past, the new protocols of the Internet are moving routing to the highest layer-the application layer. These protocols include established ones such as simple mail transport protocol (SMTP) and new ones such as session initiation protocol (SIP). One could argue that e-mail is, in a generalized form, a routing engine: Users can configure it to route e-mail messages to the location where they happen to be. Most recent protocols such as SIP add multiple novel dimensions to application-layer routing, such as mobility and end-user configuration. At its core, a SIP call controller (better known as a SIP proxy) is a pure routing engine. It analyzes an incoming invitation and makes a decision, after accounting for various factors, on how to best route the message. In this paper, we take a deeper look at how these new protocols route messages and, in the process, make the Internet that much more indispensable.
π SIMILAR VOLUMES
This paper presents modi"cations to the core-based tree (CBT) multicast routing protocol for selecting a set of optimal routers in a domain as core routers for a multicast group (It is optimal because it o!ers minimum average distance between any two members in a multicast group. The core is the roo
## Abstract Multipath routing can adapt to traffic changes, increase reliability and enhance the Quality of Service support in communication networks. This routing algorithm has been recognized as one of the salient features in Mobile __Ad hoc__ Networks (MANETs). However, existing multipath routin
## Abstract Scalability is a great concern in the design of multicast routing protocols for the global Internet. Building shortest path trees (SPT) is currently one of the most widely used approaches to supporting multicast routing because of the simplicity and low perβdestination cost of such tree