THE APPLICATION OF THE BRANCH AND BOUND METHOD FOR DETERMINING THE MINIMUM FLOW OF A TRANSPORT NETWORK

Blockage is a kind of phenomenon frequently occurred in a transport network, in which the human beings are the moving subjects. The minimum flow of a network defined in this paper means the maximum flow quantity through the network in the seriously blocked situation. It is an important parameter in designing and operating a transport network, especially in an emergency evacuation network. A branch and bound method is presented to solve the minimum flow problem on the basis of the blocking flow theory and the algorithm and its application are illustrated by examples.

Using TCP/IP Programming to Realize the Communication among Different Network Platforms

This paper mainly introduces about how to use socket to design network program which can transfer data in different network platform in terms of TCP/IP Network Programming Standard.

The Construction of Linux System and Network Programming Course to Develop Engineering Ability

To meet society’s needs for undergraduate students to have engineering skills and to develop students’ability to operate Linux and engage in network software development,this paper proposes the construction of a new specialized course for network engineering major--Linux system and network programming.This paper analyzes the course’s advantages,presents the contents of this course,designs a series of teaching methods aimed at improving students’engineering ability,proposes a course assessment method that will encourage students to practice,lists the development requirements for an examination software designed for this course,and finally,presents the results of our practice in teaching this course.

New Latency Model for Dynamic Frequency Scaling on Network-on-Chip

Modulating both the clock frequency and supply voltage of the network-on-chip （NoC） during runtime can reduce the power consumption and heat flux, but will lead to the increase of the latency of NoC. It is necessary to find a tradeoff between power consumption and communication latency. So we propose an analytical latency model which can show us the relationship of them. The proposed model to analyze latency is based on the M/G/1 queuing model, which is suitable for dynamic frequency scaling. The experiment results show that the accuracy of this model is more than 90%.

Open Source Tool for Networks Management Communication

Considering the complexity of the networks and the need for telecommunication operators （Telco） to present innovations to their clients, the quickest possible, one of the solutions for this complexity could be to centralize its configuration. Thus the SDN （software-defmed networking） concept may be an important solution. This paper suggests the implementation of a tool to support the development and testing of networks and services before they are put into production. The use of a tool that simplifies the configuration of a network service makes the networks and services to be less susceptible to errors and failures by those who set them up, thus allowing telecom operators, among others, to be able to create new services, improve the monitorization of their human resources and, above all, improve their fmancial results. In the end, success will be achieved because with a simple interaction and basic knowledge we are able to manage network services.

TRANSPORTATION NETWORKS:OLD AND NEW

This paper shows a number of Problems in pure and applied mathematicsthat are solved by constructing transportation networks.Moreover,it also shows thatall the solutions are characterized by forbidden configurations which are not minors.However,all the characterizations are much related to the graphic method which wasfound by Chinese for solving a kind of the transportation problem in the fifties.

Efficient Algorithm for K-Barrier Coverage Based on Integer Linear Programming

Barrier coverage of wireless sensor networks is an important issue in the detection of intruders who are attempting to cross a region of interest.However,in certain applications,barrier coverage cannot be satisfied after random deployment.In this paper,we study how mobile sensors can be efficiently relocated to achieve k-barrier coverage.In particular,two problems are studied:relocation of sensors with minimum number of mobile sensors and formation of k-barrier coverage with minimum energy cost.These two problems were formulated as 0–1 integer linear programming(ILP).The formulation is computationally intractable because of integrality and complicated constraints.Therefore,we relax the integrality and complicated constraints of the formulation and construct a special model known as RELAX-RSMN with a totally unimodular constraint coefficient matrix to solve the relaxed 0–1 ILP rapidly through linear programming.Theoretical analysis and simulation were performed to verify the effectiveness of our approach.

PRECESION： progressive recovery and restoration planning of interdependent services in enterprise data centers

The primary focus of this paper is to design a progressive restoration plan for an enterprise data center environment following a partial or full disruption. Repairing and restoring disrupted components in an enterprise data center requires a significant amount of time and human effort. Following a major disruption, the recovery process involves multiple stages, and during each stage, the partially recovered infrastructures can provide limited services to users at some degraded service level. However, how fast and efficiently an enterprise infrastructure can be recovered de- pends on how the recovery mechanism restores the disrupted components, considering the inter-dependencies between services, along with the limitations of expert human operators. The entire problem turns out to be NP- hard and rather complex, and we devise an efficient meta-heuristic to solve the problem. By considering some real-world examples, we show that the proposed meta-heuristic provides very accurate results, and still runs 600-2800 times faster than the optimal solution obtained from a general purpose mathematical solver [1].

A GENERATOR AND A SIMPLEX SOLVER FOR NETWORK PIECEWISE LINEAR PROGRAMS

This is a brief report on our recent work in network piecewise linear programming (NPLP),and it consists of two parts. In the first park, we describe a generator for NPLP problems which is derived from the classical network linear program generator NETGEN. The generator creates networks of the same topological structures as NETGEN, but each arc is associated with a convex piecewise linear cost. The purpose of this program is to provide a set of standard test problems which can be used to compare the performance of various algorithms for NPLP. In the second part,we introduce a network simplex method that directly solves a network piecewise linear program without reformulating it as a network linear program of higher dimension. Forty benchmark NPLP problems are solved by this method and a reformulation method. The computational results are in favor of the direct method and show that solving an NPLP problem is not much harder than solving a network linear program of the same dimension.

Java Parallel Implementations of Kohonen Self-Organizing Feature Maps

The Kohonen self-organizing map (SOM) is an important tool to find a mapping from high-dimensional space to low dimensional space. The time a SOM requires increases with the number of neurons. A parallel implementation of the algorithm can make it faster. This paper investigates the most recent parallel algorithms on SOMs. Using Java network programming utilities, improved parallel and distributed system are set up to simulate these algorithms. From the simulations, we conclude that those algorithms form good feature maps.