Distributed route selection for establishing real-time channels

Shin, Kang G.; Chou, Chih-Che; Kweon, Seok-Kyu

doi:10.1109/71.841746

Cited by 20 publications

(7 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…al. [5] extend this work for distributed route selection to establish the real time channel. These algorithms are based on worst case response where the maximum account the channels are required.…”

Section: Related Workmentioning

confidence: 89%

Utility Based Channel Allocation Algorithm for Real-Time Systems

Renjith

Yadav

2006

2006 International Conference on Advanced Computing and Communications

View full text Add to dashboard Cite

Real-time channels are established between a source and destination have to provide guarantee in-time delivery of realtime messages in multi-hop networks. In this paper, we propose a real-time channel allocation algorithm where routing is based on the utility accrued for soft real-time applications, the timeliness are characterized by Jensen's Time Utility Function (TUFs) which are non-increasing. The utility and delay based heuristic function have been used to find out the shortest path in the network. This paper utilizes the concept of resource reclaiming where unused resources are reclaimed. Periodic timer function is used to reclaim the resources. The performance of the proposed algorithm is measured through simulation studies for wide range of network parameters and utility function. It is observed that proposed scheme have better performance as compared with the performance of scheme [10].

show abstract

Section: Related Workmentioning

confidence: 89%

Utility Based Channel Allocation Algorithm for Real-Time Systems

Renjith

Yadav

2006

2006 International Conference on Advanced Computing and Communications

View full text Add to dashboard Cite

show abstract

“…On-demand distributed routing can be achieved by probepooding, where the source node floods probes throughout the network towatds the destination node searching for suitable paths[9]. Paths are gradually computed as the probes travel in the forward direction.…”

mentioning

confidence: 99%

Integrating path computation and precomputation for quality-of-service provisioning

Elazhary

Gokhale

2004

Proceedings. ISCC 2004. Ninth International Symposium on Computers and Communications (IEEE Cat. No.04TH8769)

View full text Add to dashboard Cite

QoS provisioning involves reserving resources along a suitable path through the network for the entire lifetime of a connection. To assess the suitability of the possible paths, their QoS metrics which indicate the available resources, should be computed. The QoS metrics can be computed on-demand after the arrival of a QoS connection request or precomputed. On-demand path computation is superior to path precomputation in that suitable paths may be determined using most up to date network state. However, the delay incurred in determining a suitable path on demand may be unacceptable. Path precomputation overcomes the drawback of long delay of onldemand path computation.In addition, path precomputation may be preferred over on-demand path computation for scalability issues, when the number of expected QoS connection requests is very large. Typically, path precomputation needs to be performed frequently, for different k-constrained routing problems, and from each source node to every possible destination node, which causes excessive consumption of resources. The overheads associated with typical ondemand and path precomputation techniques become unacceptable when routing inter-domain connections, and hence these techniques have been used almost exclusively in the context of intra-domain connections. The present paper describes an effective QoS provisioning technique which integrates path computution and precomputation intelligently in order to exploit the advantages offered by both these approaches. A novel reverse path precomputation technique which reduces the overheads associated with the precomputation process is also described. The presented QoS provisioning technique is suitable for provisioning both intra-domain and interdomain connections

show abstract

“…al. in [34] propose a distributed route selection scheme to form RTCs. The only difference from [33], is that this scheme is taking into account the flows that are currently in the process of establishing the path has to be determined, is used to decide which of the neighbors is selected by a node.…”

Section: Real-time Channel Establishmentmentioning

confidence: 99%

On utility accrual real-time channel establishment in multi-hop networks

Channakeshava

Ravindran

Seventh IEEE International Symposium onObject-Oriented Real-Time Distributed Computing, 2004. Proceedings.

View full text Add to dashboard Cite

Real-time channels are established between a source and a destination to guarantee intime delivery of real-time messages in multi-hop networks. In this thesis, we propose two schemes to establish real-time channels for soft real-time applications whose timeliness properties are characterized using Jensen's Time Utility Functions (TUFs) that are nonincreasing. The two algorithms are (1) Localized Decision for Utility accrual Channel Establishment (LocDUCE) and (2) Global Decision for Utility accrual Channel Establishment (GloDUCE). Since finding a feasible path optimizing multiple constraints is an NP-Complete problem, these schemes heuristically attempt to maximize the system-wide accrued utility. The channel establishment algorithms assume the existence of a utilityaware packet scheduling algorithm at the interfaces. The route selection is based on delay estimation performed at the source, destination, and all routers in the path, from source to destination.We simulate the algorithms, measure and compare their performance with open shortest path first (OSPF). Our simulation experiments show that for most of the cases considered LocDUCE and GloDUCE perform better than OSPF. We also implement the schemes in a proof-of-concept style routing module and measure the performance of the schemes and compare them to OSPF. Our experiments on the implementation follow the same trend as the simulation study and show that LocDUCE and GloDUCE have a distinct advantage over OSPF and accrue higher system-wide utility. These schemes also react better to variation in the loading of the links. Among the two proposed approaches, we observe that GloDUCE performs better than LocDUCE under conditions of increased downstream link loads.

show abstract

Distributed route selection for establishing real-time channels

Cited by 20 publications

References 12 publications

Utility Based Channel Allocation Algorithm for Real-Time Systems

Utility Based Channel Allocation Algorithm for Real-Time Systems

Integrating path computation and precomputation for quality-of-service provisioning

On utility accrual real-time channel establishment in multi-hop networks

Contact Info

Product

Resources

About