Proxy location for minimizing delivery delay in HRM networks

Byun, Sang-Seon

doi:10.1016/j.comcom.2007.02.023

Cited by 1 publication

(15 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, several two‐tier frameworks have been proposed in the literatures 2–22. In 2, the authors aim to minimize the round‐trip time from a client to its attached mirror in Internet by formalizing the mirror placement problem as a case of constrained mirror placement, where mirrors can only be placed on a preselected set of candidates.…”

Section: Related Workmentioning

confidence: 99%

“…According to the discussion above, almost all of previous works in 2–22 mainly focus on the kind of transmission cost from the clients to their attached facilities while selecting the facilities. However in an HPN, the applications are provided by passing through the selected facilities in co‐operated, parallel and distributed manners.…”

Section: Related Workmentioning

confidence: 99%

“…The problem of constructing two‐tier frameworks in 2–22 is a kind of facility location problem. Most of them regard the incurred costs as the transmission costs (e.g.…”

Section: Introductionmentioning

confidence: 99%

“…We observe that the facilities (e.g. Caches, proxies, mirror servers, relay stations, base stations and backbone hosts) determined in 2–22 are not only responsible for providing service to the clients, but also for transmitting a great deal of packets among the determined facilities to satisfy the user demands and to maintain the two‐tier framework.…”

Section: Introductionmentioning

confidence: 99%

“…In this paper, our problem is a variant of facility location problem, in which we select facilities and assign users/servers to the selected facilities in order to minimize the average transmission cost between server–user pairs by passing through the selected facilities. Our problem is different from the traditional facility location problem in 2–22 where only the transmission costs between the users/servers and their attached facilities are taken into consideration. In our problem, the transmission costs between the assigned facilities are further taken into consideration in the first stage of path determination, since most of the packets are transmitted among the facilities for application servicing and framework maintaining.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A two‐tier framework for transmission‐cost minimization of high‐performance communication applications

Lai

Huang

et al. 2012

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYIn two-tier high-performance networks (HPNs), some facilities are constructed to form a powerful supercomputing environment, and to alleviate server load. Then, the applications are provided by them in co-operated, parallel and distributed manners. A proper way to select facilities is crucial to the performance of two-tier HPNs The problem of selecting facilities can be regarded as a kind of the facility location problem, which is to determine an optimal subset of facilities that will be open to serve users. The traditional facility location problem aims to minimize the incurred costs between the users/servers and their assigned facilities. In two-tier HPNs, the incurred costs can be regarded as the transmission costs, e.g. transmission latency, bandwidth overhead. We observe that most of the packets are transmitted among the facilities for application servicing and framework maintaining. In this paper, we address the problem of selecting facilities in two-tier HPNs by minimizing the transmission costs from servers to users by passing through the selected facilities. Our problem is different from the traditional facility location problem, which only considers the transmission costs between the users/servers and their assigned facilities. In our problem, the transmission costs between the selected facilities are further considered. The problem is formulated as a 0/1 integer non-linear programming (0/1 INLP) and 0/1 integer linear programming (0/1 ILP). Further, a simple heuristic algorithm is proposed for obtaining a feasible solution when the network sizes increase, since solving INLPs and ILPs for large-scale problems takes long time.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

“…The problem of constructing two‐tier frameworks in 2–22 is a kind of facility location problem. Most of them regard the incurred costs as the transmission costs (e.g.…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations