Browsing by Subject "Computer Networks"

Now showing 1 - 6 of 6

Open Access
Congestion control in interconnected computer networks
(1988) Ulusoy, Özgür
A computer network has a collection of resources shared by multiple users. The capacity of the resources is limited, and if the user demands exceed the capacity, the network becomes ’congested’. The congestion causes a degradation in system performance. In interconnected networks there are two classes of traffic within a network. One class is the local traffic that is generated and transmitted within the network. The other class is the internetwork traffic transmitted to or from other networks. In this thesis, the effect of internetwork traffic on the performance of a network is investigated. Computer simulation of an interconnected network model is provided in order to evaluate the effectiveness of a window-based congestion control mechanism on preventing congestion in gateways and in attached networks caused by the overload of internetwork traffic. Also two dynamic window congestion control algorithms are provided and studied. These algorithms provide further control to window mechanism by adjusting the window size in accordance with the availability of the network resources at the destination. Dynamic algorithms are evaluated comparing them with static window control.
Open Access
Estelle-based test generation tool
(Elsevier, 1991) Sarikaya, B.; Forghani, B.; Eswara, S.
A test design tool for functional analysis and test derivation of protocols formally specified using an extended finitestate machine model is presented. The formal description language supported is Estelle. The tool's main components include a compiler, a normalizer, a multiple module transition tour generator and several interactive programs. The tool is based on a static analysis of Estelle called normalization, which is explained in detail with various examples. The normalized specification facilitates graphical displays of the control and data flow in the specification by the interactive tools. Next discussed is test generation, which is based on verifying the control and data flow. First the data flow graph must be decomposed into blocks where each block represents the data flow in a protocol function. From the control graph the tool generates transition tours, and then test sequences are derived from the transition tour to test each function. The performance of the tool on various applications is also included. © 1991.
Open Access
Iterative methods based on splittings for stochastic automata networks
(1998) Uysal, E.; Dayar T.
This paper presents iterative methods based on splittings (Jacobi, Gauss-Seidel, Successive Over Relaxation) and their block versions for Stochastic Automata Networks (SANs). These methods prove to be better than the power method that has been used to solve SANs until recently. With the help of three examples we show that the time it takes to solve a system modeled as a SAN is still substantial and it does not seem to be possible to solve systems with tens of millions of states on standard desktop workstations with the current state of technology. However, the SAN methodology enables one to solve much larger models than those could be solved by explicitly storing the global generator in the core of a target architecture especially if the generator is reasonably dense. © 1998 Elsevier Science B.V. All rights reserved.
Open Access
Network access protocol for hard real-time communication systems
(Elsevier, 1995) Ulusoy, Özgür
Distributed hard real-time systems are characterized by communication messages associated with timing constraints, typically in the form of deadlines. A message should be received at the destination before its deadline expires. Carrier sense multiple access with collision detection (CSMA/CD) appears to be one of the most common communication network access schemes that can be used in distributed hard real-time systems. In this paper, we propose a new real-time network access protocol which is based on the CSMA/CD scheme. The protocol classifies the messages into two classes as 'critical' and 'noncritical' messages. The messages close to their deadlines are considered to be critical. A critical message is given the right to access the network by preempting a noncritical message in transmission. Extensive simulation experiments have been conducted to evaluate the performance of the protocol. It is shown that the protocol can provide considerable improvement over the virtual time CSMA/CD protocol proposed for hard real-time communication by Zhao et al.1. © 1995.
Open Access
Power efficient data gathering and aggregation in wireless sensor networks
(Association for Computing Machinery, 2003) Tan, H. Ö.; Körpeoǧlu, İ.
Recent developments in processor, memory and radio technology have enabled wireless sensor networks which are deployed to collect useful information from an area of interest The sensed data must be gathered and transmitted to a base station where it is further processed for end-user queries. Since the network consists of low-cost nodes with limited battery power, power efficient methods must be employed for data gathering and aggregation in order to achieve long network lifetimes. In an environment where in a round of communication each of the sensor nodes has data to send to a base station, it is important to minimize the total energy consumed by the system in a round so that the system lifetime is maximized. With the use of data fusion and aggregation techniques, while minimizing the total energy per round, if power consumption per node can be balanced as well, a near optimal data gathering and routing scheme can be achieved in terms of network lifetime. So far, besides the conventional protocol of direct transmission, two elegant protocols called LEACH and PEGASIS have been proposed to maximize the lifetime of a sensor network. In this paper, we propose two new algorithms under name PEDAP (Power Efficient Data gathering and Aggregation Protocol), which are near optimal minimum spanning tree based routing schemes, where one of them is the power-aware version of the other. Our simulation results show that our algorithms perform well both in systems where base station is far away from and where it is in the center of the field. PEDAP achieves between 4x to 20x improvement in network lifetime compared with LEACH, and about three times improvement compared with PEGASIS.
Open Access
The role of location of traffic control in internetwork gateways
(IEEE, 1990-03) Ulusoy, Özgür; Baray, Mehmet
Summary form only given. An evaluation of window-based gateway-to-gateway-level congestion control in an interconnected network environment is reported. Two dynamic control algorithms proposed by the author are intended to operate the system below the critical internetwork load that gives rise to congestion at gateways and connected networks. In one of the algorithms, source gateways regulate the traffic flow, whereas in the other, destination gateways provide the control. The algorithms provide further control to static window protocol by adjusting the window size in accordance with the availability of network resources at the destination. A comparison of the two algorithms has shown that controlling the internetwork messages at the destination gateway produces better performance results than control at the source gateway.