In this paper we investigate the problem of finding a layer2 network topology when the information available from SNMP MIB is incomplete. We prove that finding a network topology in this case is NPhard. We further prove that deciding whether the given information defines a unique network topology is a co-NP-hard problem. We show that if there is a single node r such that every other network nod...

This paper proposes a new method for transmission loss allocation. The share of each bus in the transmission line losses is determined using transmission line loss equations with respect to bus-injected currents. Then, it is applied to the total network transmission lines. In the proposed method, comparing with other methods, a solution to remove the negative loss allocation has been introd...

VoIP(Voice over IP), so called Internet phone, provides several unique advantages, for instance, inexpensive long distance call service than the existing wire telephone network and various multimedia services from Internet network added to voice call service. This has been widely discussed and has been a research topic throughout the developed countries in the recent years. The paper is intende...

Stable networks of order  where  is a natural number refer to those networks that are immune to coalitional deviation of size  or less. In this paper, we introduce stability of a finite order and examine its relation with efficient networks under anonymous and component additive value functions and the component-wise egalitarian allocation rule. In particular, we examine shapes of networks o...

The main approaches for the formation of generalized conclusions about operation quality of complex hierarchical network systems are analyzed. Advantages and drawbacks of the “weakest” element method and a weighted linear aggregation method are determined. Nonlinear aggregation method is proposed for evaluating the quality of the system, which consists of elements of the same priority. Hybrid a...

We study the scheduling problem for data collection from sensor nodes to the sink node in wireless sensor networks, also referred to as the convergecast problem. The convergecast problem in general network topology has been proven to be NP-hard. In this paper, we propose our heuristic algorithm (finding the minimum scheduling time for convergecast (FMSTC)) for general network topology and evalu...

We investigate the problem of topology design of an optical network by bottleneck-cut identification. For an optical network, the topology-design problem can be viewed as a combined two-layer design problem: physical-topology design and virtual-topology design. In this study, we present the definition of bottleneck cut of an optical network. A heuristic algorithm is proposed to find the bottlen...