Advance bandwidth reservation with deadline constraint in high-performance networks

Dharam, Poonam; Wu, Chase Q.; Wang, Yongqiang

doi:10.1109/iccnc.2014.6785481

Cited by 5 publications

(5 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Different algorithms for in‐advance scheduling are described in Lin and Wu, Dharam et al, Sahni et al() Lin and Wu considered an exhaustive combination of different path and bandwidth constraints and formulated 4 types of advance bandwidth scheduling problems, with the objective to minimize the data transfer end time for a given transfer request with a prespecified data size. Dharam et al considered deadline‐constrained in‐advance scheduling with the objective of finding a path to transfer data of a given size before a specified deadline by accounting estimated in‐progress on‐demand reservations in future time with a statistical scheme; such on‐demand reservations might otherwise be interrupted or preempted by newly activated in‐advance reservation. In our SFBR, in‐advance scheduling does not neglect on‐demand reservations in progress at all.…”

Section: Related Workmentioning

confidence: 99%

SDN‐based fault‐tolerant on‐demand and in‐advance bandwidth reservation in data center interconnects

Subedi

Nguyen

Cheriet

2017

Int J Communication

View full text Add to dashboard Cite

are typically shared by multiple services through on-demand and in-advance resource reservations, resulting in varying bandwidth availability in future time periods. Such an inter-data center network provides a dynamic and virtualized environment when augmented with cloud infrastructure supporting end-host migration. In such an environment, dynamically provisioned network resources are recognized as extremely useful capabilities for many types of network services. However, the existing approaches to in-advance reservation services provide limited reservation capabilities, eg, limited connections over links returned by the traceroute over traditional IP-based networks. Moreover, most existing approaches do not address fault tolerance in the event of node or link failures and do not handle end-host migrations; thus, they do not provide a reliability guarantee for in-advance reservation frameworks. In this paper, we propose using multiple paths to increase bandwidth usage in the WAN links between data centers when a single path does not provide the requested bandwidth.Emulation-based evaluations of the proposed path computation show a higher reservation acceptance rate compared to state-of-art reservation frameworks, and such computed paths can be configured with a limited number of static forwarding rules on switches. Our prototype provides the RESTful Web service interface for link-fail and end-host migration event management and reroutes paths for all the affected reservations.

show abstract

Section: Related Workmentioning

confidence: 99%

SDN‐based fault‐tolerant on‐demand and in‐advance bandwidth reservation in data center interconnects

Subedi

Nguyen

Cheriet

2017

Int J Communication

View full text Add to dashboard Cite

show abstract

“…To overcome this problem, some studies have introduced a model whereby a transfer request must either be completed by a user-specified deadline or rejected if the Manuscript deadline cannot be met [9], [10]. Note that in this model, it is not necessary to shorten the transfer time below its deadline and it is preferable to accept more requests, thereby reducing the number of rejected requests.…”

Section: Introductionmentioning

confidence: 99%

Joint Bandwidth Scheduling and Routing Method for Large File Transfer with Time Constraint and Its Implementation

Kinoshita

Aihara

Kono

et al. 2018

IEICE Trans. Commun.

View full text Add to dashboard Cite

In recent years, the number of requests to transfer large files via large high-speed computer networks has been increasing rapidly. Typically, these requests are handled in the "best effort" manner which results in unpredictable completion times. In this paper, we consider a model where a transfer request either must be completed by a user-specified deadline or must be rejected if its deadline cannot be satisfied. We propose a bandwidth scheduling method and a routing method for reducing the callblocking probability in a bandwidth-guaranteed network. Finally, we show their excellent performance by simulation experiments.Here, s i is the source node, d i is the destination node,

show abstract

“…It is known that request blocking and spectrum utilization are directly related to network operators' revenue. Hence, researchers have tried to address hybrid IR/AR service provisioning in various networks [9][10][11][12][13][14][15][16].…”

Section: Introductionmentioning

confidence: 99%

“…RELATED WORK Based on various networks, previous studies have considered the admission control, spectrum partition, routing and scheduling for IR or AR requests, and tried to limit the service preemption rate of IR ones [9][10][11][12][13][14][15][16]. Ref.…”

Section: Introductionmentioning

confidence: 99%

“…[14] proposed a scheduling algorithm for AR requests such that the number of preempted IR requests could be minimized. In [15], the authors investigated the integrated AR scheduling that involved both the routing and preemption phases. Specifically, in the preemption phase, they used a run-time scheme to minimize the number of preempted IR requests.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On Hybrid IR and AR Service Provisioning in Elastic Optical Networks

Lü

Zhu

Mukherjee

2015

J. Lightwave Technol.

View full text Add to dashboard Cite

This paper investigates hybrid immediate reservation (IR) and advance reservation (AR) service provisioning in elastic optical networks (EONs), with the objective to minimize IR/AR service conflicts. We design algorithms to coordinate service provisioning of IR and AR requests. Specifically, both proactive and reactive IR provisioning schemes are considered to minimize IR service failures. Our AR scheduling algorithm can coordinate AR service provisioning with various IR traffic patterns, balance spectrum utilization in both time and spectral domains, and reduce IR/AR service conflicts. Simulation results verify that our proposed IR + AR schemes can significantly reduce IR service failures as well as routing and spectrum allocation (RSA) reconfigurations in IR service provisioning. Moreover, the results indicate that the proposed IR + AR schemes can achieve more performance gain from AR flexibility when compared with two existing benchmarks.AR requests in an EON, where spectrum resources are fully shared among IR and AR requests. Specifically, we consider a dynamic EON, in which the IR requests' service durations are unknown while the AR ones use the specific start time and specific duration (STSD) reservation model [6]. For the STSD model, we consider both the STSD-fixed and STSD-flexible cases. The STSD-fixed case means that the service start time of an AR request is fixed in the future, while STSD-flexible reservation allows the service start time of an AR request to slide within a pre-defined time window. Regarding the relation between IR and AR requests, we assume that the AR ones possess higher priority, which means that, whenever a service conflict occurs, an in-service IR request has to compromise to the AR request which shares resources with it. Based on this model, we design both proactive and reactive IR provisioning algorithms to minimize IR service failures (i.e., including both service blocking and interruption), and also propose an AR scheduling algorithm that considers different IR traffic patterns to coordinate AR provisioning, to balance resource utilization in both time and spectral domains, and to eventually relieve IR/AR service conflicts in the EON.The rest of the paper is organized as follows. Section II reviews related work. In Section III, we describe the network model and define the problem of hybrid IR/AR service provisioning in an EON. To minimize IR/AR service conflicts, novel provisioning algorithms are proposed in Section IV. Section V discusses the simulations for performance evaluation. Finally, we summarize the paper in Section VI. 0733-8724 (c)

show abstract

Advance bandwidth reservation with deadline constraint in high-performance networks

Cited by 5 publications

References 13 publications

SDN‐based fault‐tolerant on‐demand and in‐advance bandwidth reservation in data center interconnects

SDN‐based fault‐tolerant on‐demand and in‐advance bandwidth reservation in data center interconnects

Joint Bandwidth Scheduling and Routing Method for Large File Transfer with Time Constraint and Its Implementation

On Hybrid IR and AR Service Provisioning in Elastic Optical Networks

Contact Info

Product

Resources

About