We present two formulations of the Quadratic Assignment Problem (QAP) that result in network Bow problems with integer variables and side constraints. A linearization of the QAP is obtained in both cases by considerin...
详细信息
We present two formulations of the Quadratic Assignment Problem (QAP) that result in network Bow problems with integer variables and side constraints. A linearization of the QAP is obtained in both cases by considering each facility to consist of two parts-a source for all outgoing flows from that facility, and a sink for all incoming flows to the facility. Preliminary computational experience with both approaches is presented. (C) 1998 Elsevier Science B.V.
Parallel and distributed computing (PDC) is finding its usage from system, algorithms, and architecture perspectives in research and industries of many domains. Due to its ever-increasing applications and benefits, th...
详细信息
Parallel and distributed computing (PDC) is finding its usage from system, algorithms, and architecture perspectives in research and industries of many domains. Due to its ever-increasing applications and benefits, the need of skilled manpower in the area of PDC is also increasing. It is felt that if the basic knowledge taught through the core course of PDC is supplemented with the discussion of PDC topics in integration with other computer science courses, then it will not only provide the students with more opportunities to 'think in parallel', but will also motivate them to harness the best of PDC. In this paper, we present our experiences of performing research-oriented teaching of PDC topics in integration with other undergraduate courses since 2014 to 2016 spread over multiple semesters. The courses mainly include Software Engineering, Computer networks, Computer Architecture, network programming, and network based Laboratory taught to undergraduate level students of Computer Science and Engineering. Our integration plan is encouraged from the objectives of NSF/TCPP-IEEE core curriculum initiative on PDC. Most of these courses are compulsory courses for undergraduate students of our department. In addition to the goals of the respective courses, we tried to fulfill many pedagogical goals corresponding to the PDC course. The teaching-contents of these courses have been adapted to also cover the aspects of PDC. A well-defined methodology for selection of PDC topics for integration, selection of topics for laboratory projects and home assignments, conduct of examinations (mid-term/end-term), pre-post feedback and evaluation, and other related activities has been planned. The methodology is intended to fulfill the priorly set goals and to achieve the intended learning outcomes (ILOs). This paper presents the methodology used, detailed topics and integration plan of PDC topics along with corresponding bloom levels, ILOs, evaluation strategies, and performance evalu
Wireless Sensor networks (WSN) monitor large environments for long periods of time. During this period, mechanisms are needed to propagate code updates to the network when needed. In this paper, a distributed code pro...
详细信息
Wireless Sensor networks (WSN) monitor large environments for long periods of time. During this period, mechanisms are needed to propagate code updates to the network when needed. In this paper, a distributed code propagation algorithm that utilises reliable transport to all sensors is presented. A mathematical model is developed to analyse the achievable network branch capacities in terms of optimum node numbers per tree level. The outcome of the analysis is used to construct an optimum tree with heuristically best children lists. The capacity analysis is verified with experimental testbed and simulation results and the performance gain is shown.
One of the more interesting developments recently gaining popularity in the server-side JavaScript space is ***. It\'s a framework for developing high-performance, concurrent programs that don\'t rely on the m...
详细信息
One of the more interesting developments recently gaining popularity in the server-side JavaScript space is ***. It\'s a framework for developing high-performance, concurrent programs that don\'t rely on the mainstream multithreading approach but use asynchronous I/O with an event-driven programming model.
In this paper, based on the idea of a projection and contraction method for a class of linear complementarity problems (Refs. 1 and 2), we develop a class of iterative algorithms for linear programming with linear spe...
详细信息
In this paper, based on the idea of a projection and contraction method for a class of linear complementarity problems (Refs. 1 and 2), we develop a class of iterative algorithms for linear programming with linear speed of convergence. The algorithms are used to solve transportation and network problems with up to 10,000 variables. Our experiments indicate that the algorithms are simple, easy to parallelize, and more efficient for some large practical problems.
Protocol-Oblivious Forwarding (POF) is a groundbreaking technology that enables a protocol-independent data plane for the future Software-Defined networking (SDN). Compared to OpenFlow and P4, POF provides more genera...
详细信息
Protocol-Oblivious Forwarding (POF) is a groundbreaking technology that enables a protocol-independent data plane for the future Software-Defined networking (SDN). Compared to OpenFlow and P4, POF provides more generality and flexibility in the data plane, but at a cost of additional complexity in the control plane. To overcome such complexity, in this paper we present PNPL, the first control plane programming framework over the POF SDN data plane. PNPL provides an easy-to-use programming paradigm that includes a header specification language and a set of protocol-agnostic programming APIs. With PNPL, a programmer can arbitrarily define network protocols, and compose network policies over the self-defined protocols with high-level abstractions. PNPL's runtime system takes the user program as input, automatically produces and maintains forwarding pipelines in POF switches. The pipeline efficiently parses the self-defined protocol headers and enforces the programmer's network policy. We have implemented a PNPL prototype, and experiment with existing and novel protocols and a number of network applications. We show that PNPL can effectively facilitate network innovations by simplifying programming over novel protocols, producing and maintaining forwarding pipelines of high quality;compared to P4, PNPL does not require a device configuration phase, and improves network performance by significantly reducing the packet parsing overhead. (C) 2018 Elsevier B.V. All rights reserved.
We present some reoptimization techniques for computing (shortest) hyperpath weights in a directed hypergraph. These techniques are exploited to improve the worst-case computational complexity (as well as the practica...
详细信息
We present some reoptimization techniques for computing (shortest) hyperpath weights in a directed hypergraph. These techniques are exploited to improve the worst-case computational complexity (as well as the practical performance) of an algorithm finding the K shortest hyperpaths in acyclic hypergraphs. (c) 2005 Elsevier B.V. All rights reserved.
In this paper, we study the single commodity flow problems, optimizing two objectives simultaneously, where the flow values must be integer values. We propose a method that finds all the efficient integer points in th...
详细信息
In this paper, we study the single commodity flow problems, optimizing two objectives simultaneously, where the flow values must be integer values. We propose a method that finds all the efficient integer points in the objective space. Our algorithm performs two phases. In the first phase, all integer points on the efficient boundary are found and in the second phase, the efficient integer points that do not lie on the efficient boundary are calculated. In addition, we carry out a computational experiment showing that the number of efficient integer solutions that do not lie on the efficient boundary is greater than the number of integer solutions on the efficient boundary.
A basis for a pure network flow problem always exhibits special structure, whose exploitation has led to the development of extremely efficient network optimization software. The backbone of these programs is a data s...
详细信息
A basis for a pure network flow problem always exhibits special structure, whose exploitation has led to the development of extremely efficient network optimization software. The backbone of these programs is a data structure which represents the basis as a tree and is used to perform the linear algebraic steps required for optimization. We demonstrate that the basis inverse also possesses a special structure which we call the inverse-tree. We develop a data structure to represent the inverse tree, and we show that it obeys a symmetric relationship with the basis-tree data structure. (The predecessor function of the inverse-tree is the preorder link function of the basis-tree and vice versa). We develop efficient computational procedures for exploiting these results and show that using the inverse-tree requires computation of the same order as the basis-tree. [ABSTRACT FROM AUTHOR]
The Balanced Linear programming Problem (BLPP) arises in situations which require equitable distribution of a scarce resource. The BLPP can be transformed to the standard form of the linear programming problem by intr...
详细信息
The Balanced Linear programming Problem (BLPP) arises in situations which require equitable distribution of a scarce resource. The BLPP can be transformed to the standard form of the linear programming problem by introducing 2\N\+2 additional variables and 2\N\ additional constraints. This transformation is not desirable from the computational point of view for larger values of \N\ as it increases the problem size substantially. It is also undesirable from a theoretical perspective as it might affect the special structure of the constraint matrix. In this paper, we develop an algorithm for the BLPP which does not require problem enlargement. The algorithm is based on the relationship between the BLPP and the minimax linear programming problem, and solving the latter problem parametrically. Our algorithm, in essence, performs steps that are similar to those performed in the parametric simplex method with parametric right hand side. We then adapt our algorithm for the network flow problem and this specialized algorithm can be applied on the network directly without maintaining the simplex tableau. (C) 1997 Elsevier Science B.V.
暂无评论