Optimal multichannel data transmission in computer networks

Xue, Guoliang

doi:10.1016/s0140-3664(02)00210-4

Cited by 13 publications

(12 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[12]. The TBTS problem not only needs to find a feasible path set, but must also facilitate the file transfer within a time constraint.…”

Section: Network Model and Definitionsmentioning

confidence: 99%

“…Therefore, the TBTS problem is NP-hard. Unlike the maximum-flow problem [12,18] , which only finds the maximum available aggregatedbandwidth between s and t, the TBTS problem considers a file of fixed size and finds a set of paths that can be used to transfer the file within a certain time.…”

Section: Network Model and Definitionsmentioning

confidence: 99%

“…In order to achieve higher network utilization, big-file transfer based on multi-path routing has attracted significant attention, particularly for resource-limited networks [8,9] . Multi-path file transfer problems encompass both the single-file multi-path transfer problem [10][11][12] and the multi-file multi-path transfer problem [13][14][15][16] . However, most of previous works do not consider the size of files and how to search for a path set in a given network.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Scheduling algorithms for time-constrained big-file transfers in the Internet of Vehicles

Lin

Zhang

et al. 2017

J. Commun. Inf. Netw.

View full text Add to dashboard Cite

In order to transfer large files and provide high-quality services in the IoV (Internet of Vehicles), intelligent routing and scheduling are indispensable for fast transfers and efficient network utilization, particularly when multi-path routing is allowed in the wired-transfer. Thus, a network administrator must select a set of feasible paths over which the transfer can be conducted. We consider a TBTS (Time-constrained Big-file Transfer Scheduling) problem in this paper. We prove that TBTS problem is NP-hard and that the TBTS problem can be solved by addressing a corresponding maximum flow over time problem with multi-path routing technique. We then propose both a heuristic algorithm (TBTS-H) and an exact algorithm (TBTS-A) to solve the TBTS problem. Although both of the proposed approaches can solve the TBTS problem, the heuristic runs more efficiently by trading accuracy for delay, while the exact algorithm can achieve high accuracy for delay, at the cost of increased running-time. The corresponding simulation results illustrate this trade-off. Additionally, we conduct some comparisons between our proposed approaches and a traditional single-path routing scheme.

show abstract

“…[12]. The TBTS problem not only needs to find a feasible path set, but must also facilitate the file transfer within a time constraint.…”

Section: Network Model and Definitionsmentioning

confidence: 99%

Section: Network Model and Definitionsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Scheduling algorithms for time-constrained big-file transfers in the Internet of Vehicles

Lin

Zhang

et al. 2017

J. Commun. Inf. Netw.

View full text Add to dashboard Cite

show abstract

“…In Sect. 2, we present a briefly survey of some existing unicast and multicast algorithms such as OSPF [16], GRP [1], OUMR [20], DPST [10], and OMMR [12]. In this section, we also present some terminologies and some mathematical definitions such as multicast multichannel path, multicast multichannel routing, etc., which are necessary to construct the proposed algorithm, Distributed-Optimal Multicast Multichannel Routing (DOMMR).…”

Section: Paper Outlinementioning

confidence: 99%

“…Examples are OUMR [20], GRP [1,8,19], and MNDP [7]. Fundamentally, there are some problems and weaknesses in applying these algorithms to the network.…”

Section: Introductionmentioning

confidence: 99%

Traffic distribution for end-to-end QoS routing with multicast multichannel services

Isazadeh

Heydarian

2009

J Supercomput

View full text Add to dashboard Cite

With the development of multimedia group applications and multicasting demands, the construction of multicast routing tree satisfying Quality of Service (QoS) is more important. A multicast tree, which is constructed by existing multicast algorithms, suffers three major weaknesses: (1) it cannot be constructed by multichannel routing, transmitting a message using all available links, thus the data traffic cannot be preferably distributed; (2) it does not formulate duplication capacity; consequently, duplication capacity in each node cannot be optimally distributed;(3) it cannot change the number of links and nodes used optimally. In fact, it cannot employ and cover unused backup multichannel paths optimally. To overcome these weaknesses, this paper presents a polynomial time algorithm for distributed optimal multicast routing and Quality of Service (QoS) guarantees in networks with multichannel paths which is called Distributed Optimal Multicast Multichannel Routing Algorithm (DOMMR). The aim of this algorithm is: (1) to minimize End-to-End delay across the multichannel paths, (2) to minimize consumption of bandwidth by using all available links, and (3) to maximize data rate by formulating network resources. DOMMR is based on the Linear Programming Formulation (LPF) and presents an iterative optimal solution to obtain the best distributed routes for traffic demands between all edge nodes. Computational experiments and numerical simulation results will show that the proposed algorithm is more efficient than the existing methods. The simulation results are obtained by applying network simulation tools such as QSB, OpNet and MATLB to some samples of network. We then introduce a generalized problem, called the delay-constrained multicast multichannel routing problem, and show that this generalized problem can be solved in polynomial time.

show abstract

Optimal Multicast Multichannel Routing in Computer Networks

Heydarian

Isazadeh

Isazadeh³

Frontiers of High Performance Computing and Networking ISPA 2007 Workshops

View full text Add to dashboard Cite

Optimal multichannel data transmission in computer networks

Cited by 13 publications

References 26 publications

Scheduling algorithms for time-constrained big-file transfers in the Internet of Vehicles

Scheduling algorithms for time-constrained big-file transfers in the Internet of Vehicles

Traffic distribution for end-to-end QoS routing with multicast multichannel services

Optimal Multicast Multichannel Routing in Computer Networks

Contact Info

Product

Resources

About