The Multi-Index Problem

Haley, K. B.

doi:10.1287/opre.11.3.368

Cited by 79 publications

(36 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Hence transportation cost varies with each data item. This work tries to address this concern by adapting a multi-commodity [17,18,19] based approach. In this work, the virtual resources are the commodities to be transported.…”

Section: Figure 3 Data Sharing Modelmentioning

confidence: 99%

A MultiCommodity Grid Logistics Model for Data Transportation in Federated Datagrid

Ramane¹,

Francis²

2011

IJCA

View full text Add to dashboard Cite

Data Sharing is the process of making data resources available across geographically distributed institutions working on a common purpose. When there is need or request, these data resources are transported so as to co-allocate them at desired destinations. Distributed computing, particularly Grid computing environment involves transporting huge volume of data across geographically spread sources and destinations managed by an efficient data management architecture called the Datagrid. This affinity towards movement of data is to have the data and task collocated to eliminate network traffic and to improve performance by reducing latency. Participants of the datagrid are autonomous organizations, organized in a federated fashion that can request for resources from the federation as long as they are authentic and authorized and can fall into or fall out of the grid at their own will. Data Transportation mechanism in grid can be compared to the Multi-index transportation problem i.e. an n-dimensional problem (here n = 3) and usually referred to as multi-commodity transportation problem with an additional index for handling multiple resource types. This work proposes a novel method to transport resources taking various challenges posed by the dynamic grid environment into account.

show abstract

Section: Figure 3 Data Sharing Modelmentioning

confidence: 99%

A MultiCommodity Grid Logistics Model for Data Transportation in Federated Datagrid

Ramane¹,

Francis²

2011

IJCA

View full text Add to dashboard Cite

show abstract

“….. 7 Haley (1962Haley ( , 1963 and Pierskalla (1968) Koopmans and Beckmann (1957) also formulated this problem, and later Gilmore (1962), Lawler (1975), Land (1963, Hillier and Connors (1967), Bowman et al (1971), Pierce and Crowston (1971), Gerrard (1976, 1979) and Los (1978) "* carried out further work on quadratic assignment problems (QAP).…”

Section: Chapter II Previous Related Work In Computer Aided Layoutmentioning

confidence: 99%

Computer Aided Layout of Procedure Information for Training and Job Aiding.

Sylla¹,

Babu²

1983

View full text Add to dashboard Cite

“…Minimizing a linear function subject to (1)-(4) is called a three-index transportation problem over T (A, B, C). Examples above can be found in ScheU (I 955), Haley (1962Haley ( , 1963, Schmid (1966), Junginger (1972) and Raskin-Kiri~enko (1982).…”

mentioning

confidence: 95%