Route Header

14,000,000 Leading Edge Experts on the ideXlab platform

Scan Science and Technology

Contact Leading Edge Experts & Companies

Scan Science and Technology

Contact Leading Edge Experts & Companies

The Experts below are selected from a list of 9 Experts worldwide ranked by ideXlab platform

Jonathan Rosenberg - One of the best experts on this subject based on the ideXlab platform.

  • construction of the Route Header field in the session initiation protocol sip
    2006
    Co-Authors: Jonathan Rosenberg
    Abstract:

    The Route Header field in the Session Initiation Protocol (SIP) is used to cause a request to visit a set of hops on its way towards the final destination. Several specifications have defined rules for how a user agent obtains and then uses a set of Route Header fields in the transmission of a request. These include the SIP specification itself, the Service-Route Header field specification, the SIP server option in the Dynamic Host Configuration Protocol (DHCP), and others. Unfortunately, these specifications are not consistent and the resulting behavior at clients and servers is not clear or complete. This document resolves this problem by defining a consistent set of logic, and in the process, serves as an update to the Service-Route specification.

Jingyu Wang - One of the best experts on this subject based on the ideXlab platform.

  • A linear chained approach for service invocation in IP Multimedia Subsystem
    Computers & Electrical Engineering, 2012
    Co-Authors: Jianxin Liao, Yufei Cao, Zhaoyong Xun, Jingyu Wang
    Abstract:

    IP Multimedia Subsystem (IMS) is considered to provide multimedia services to users through an IP-based control plane. The current IMS service invocation mechanism, however, requires the Serving-Call Session Control Function (S-CSCF) invokes each Application Server (AS) sequentially to perform service subscription profile, which results in the heavy load of the S-CSCF and the long session set-up delay. To solve this issue, this paper proposes a linear chained service invocation mechanism to invoke each AS consecutively. By checking all the initial Filter Criteria (iFC) one-time and adding the addresses of all involved ASs to the ''Route'' Header, this new approach enables multiple services to be invoked as a linear chain during a session. We model the service invocation mechanisms through Jackson networks, which are validated through simulations. The analytic results verify that the linear chained service invocation mechanism can effectively reduce session set-up delay of the service layer and decrease the load level of the S-CSCF.

Gabriel Paues - One of the best experts on this subject based on the ideXlab platform.

  • network admission and routing
    2002
    Co-Authors: Lars Rasmusso, Gabriel Paues
    Abstract:

    We describe the architecture of a network, in which the traffic ow is con-trolled by a market. The network access is controlled by a trusted access node, that separates traffic into best effort and first class traffic, adds a source Route Header, and shapes the traffic. The network core consists of rapid forwarding devices, such as label switches, and source routing gateways. Network ser-vices, including dynamic routing, load balancing, and fault tolerance, are built by bundling the transmission capacity in several independent network domains into a service, a bundle of resources with the right properties. The service is priced as financial derivative contract, and traded on a market, independent of the network access control. Besides describing the network model, we show how to implement parts of the network access node functionality on a standard Linux machine. The implementation has been tested on a system of virtual Linux machines

Jianxin Liao - One of the best experts on this subject based on the ideXlab platform.

  • A linear chained approach for service invocation in IP Multimedia Subsystem
    Computers & Electrical Engineering, 2012
    Co-Authors: Jianxin Liao, Yufei Cao, Zhaoyong Xun, Jingyu Wang
    Abstract:

    IP Multimedia Subsystem (IMS) is considered to provide multimedia services to users through an IP-based control plane. The current IMS service invocation mechanism, however, requires the Serving-Call Session Control Function (S-CSCF) invokes each Application Server (AS) sequentially to perform service subscription profile, which results in the heavy load of the S-CSCF and the long session set-up delay. To solve this issue, this paper proposes a linear chained service invocation mechanism to invoke each AS consecutively. By checking all the initial Filter Criteria (iFC) one-time and adding the addresses of all involved ASs to the ''Route'' Header, this new approach enables multiple services to be invoked as a linear chain during a session. We model the service invocation mechanisms through Jackson networks, which are validated through simulations. The analytic results verify that the linear chained service invocation mechanism can effectively reduce session set-up delay of the service layer and decrease the load level of the S-CSCF.

Lars Rasmusso - One of the best experts on this subject based on the ideXlab platform.

  • network admission and routing
    2002
    Co-Authors: Lars Rasmusso, Gabriel Paues
    Abstract:

    We describe the architecture of a network, in which the traffic ow is con-trolled by a market. The network access is controlled by a trusted access node, that separates traffic into best effort and first class traffic, adds a source Route Header, and shapes the traffic. The network core consists of rapid forwarding devices, such as label switches, and source routing gateways. Network ser-vices, including dynamic routing, load balancing, and fault tolerance, are built by bundling the transmission capacity in several independent network domains into a service, a bundle of resources with the right properties. The service is priced as financial derivative contract, and traded on a market, independent of the network access control. Besides describing the network model, we show how to implement parts of the network access node functionality on a standard Linux machine. The implementation has been tested on a system of virtual Linux machines