Shift factor-based SCOPF topology control MIP formulations with substation configurations

Topology control (TC) is an effective tool for managing congestion, contingency events, and overload control. The majority of TC research has focused on line and transformer switching. Substation reconfiguration is an additional TC action, which consists of opening or closing breakers not in series with lines or transformers. Some reconfiguration actions can be simpler to implement than branch opening, seen as a less invasive action. This paper introduces two formulations that incorporate substation reconfiguration with branch opening in a unified TC framework. The first method starts from a topology with all candidate breakers open, and breaker closing is emulated and optimized using virtual transactions. The second method takes the opposite approach, starting from a fully closed topology and optimizing breaker openings. We provide a theoretical framework for both methods and formulate security-constrained shift factor MIP TC formulations that incorporate both breaker and branch switching. By maintaining the shift factor formulation, we take advantage of its compactness, especially in the context of contingency constraints, and by focusing on reconfiguring substations, we hope to provide system operators additional flexibility in their TC decision processes. Simulation results on a subarea of PJM illustrate the application of the two formulations to realistic systems.The work was supported in part by the Advanced Research Projects Agency-Energy, U.S. Department of Energy, under Grant DE-AR0000223 and in part by the U.S. National Science Foundation Emerging Frontiers in Research and Innovation under Grant 1038230. Paper no. TPWRS-01497-2015. (DE-AR0000223 - Advanced Research Projects Agency-Energy, U.S. Department of Energy; 1038230 - U.S. National Science Foundation Emerging Frontiers in Research and Innovation)http://buprimo.hosted.exlibrisgroup.com/primo_library/libweb/action/openurl?date=2017&issue=2&isSerivcesPage=true&spage=1179&dscnt=2&url_ctx_fmt=null&vid=BU&volume=32&institution=bosu&issn=0885-8950&id=doi:10.1109/TPWRS.2016.2574324&dstmp=1522778516872&fromLogin=truePublished versio

Design and implementation of the Quarc network on-chip

Networks-on-Chip (NoC) have emerged as alternative to buses to provide a packet-switched communication medium for modular development of large Systems-on-Chip. However, to successfully replace its predecessor, the NoC has to be able to efficiently exchange all types of traffic including collective communications. The latter is especially important for e.g. cache updates in multicore systems. The Quarc NoC architecture has been introduced as a Networks-on-Chip which is highly efficient in exchanging all types of traffic including broadcast and multicast. In this paper we present the hardware implementation of the switch architecture and the network adapter (transceiver) of the Quarc NoC. Moreover, the paper presents an analysis and comparison of the cost and performance between the Quarc and the Spidergon NoCs implemented in Verilog targeting the Xilinx Virtex FPGA family. We demonstrate a dramatic improvement in performance over the Spidergon especially for broadcast traffic, at no additional hardware cost

Unsolved Problems in Virtual Knot Theory and Combinatorial Knot Theory

This paper is a concise introduction to virtual knot theory, coupled with a list of research problems in this field.Comment: 65 pages, 24 figures. arXiv admin note: text overlap with arXiv:math/040542

Optimal configuration of active and backup servers for augmented reality cooperative games

Interactive applications as online games and mobile devices have become more and more popular in recent years. From their combination, new and interesting cooperative services could be generated. For instance, gamers endowed with Augmented Reality (AR) visors connected as wireless nodes in an ad-hoc network, can interact with each other while immersed in the game. To enable this vision, we discuss here a hybrid architecture enabling game play in ad-hoc mode instead of the traditional client-server setting. In our architecture, one of the player nodes also acts as the server of the game, whereas other backup server nodes are ready to become active servers in case of disconnection of the network i.e. due to low energy level of the currently active server. This allows to have a longer gaming session before incurring in disconnections or energy exhaustion. In this context, the server election strategy with the aim of maximizing network lifetime is not so straightforward. To this end, we have hence analyzed this issue through a Mixed Integer Linear Programming (MILP) model and both numerical and simulation-based analysis shows that the backup servers solution fulfills its design objective

Genetic Algorithm-based Mapper to Support Multiple Concurrent Users on Wireless Testbeds

Communication and networking research introduces new protocols and standards with an increasing number of researchers relying on real experiments rather than simulations to evaluate the performance of their new protocols. A number of testbeds are currently available for this purpose and a growing number of users are requesting access to those testbeds. This motivates the need for better utilization of the testbeds by allowing concurrent experimentations. In this work, we introduce a novel mapping algorithm that aims to maximize wireless testbed utilization using frequency slicing of the spectrum resources. The mapper employs genetic algorithm to find the best combination of requests that can be served concurrently, after getting all possible mappings of each request via an induced sub-graph isomorphism stage. The proposed mapper is tested on grid testbeds and randomly generated topologies. The solution of our mapper is compared to the optimal one, obtained through a brute-force search, and was able to serve the same number of requests in 82.96% of testing scenarios. Furthermore, we show the effect of the careful design of testbed topology on enhancing the testbed utilization by applying our mapper on a carefully positioned 8-nodes testbed. In addition, our proposed approach for testbed slicing and requests mapping has shown an improved performance in terms of total served requests, about five folds, compared to the simple allocation policy with no slicing.Comment: IEEE Wireless Communications and Networking Conference (WCNC) 201