waashk/dblp huggingface dataset:
group allocation multiple access with collision detection. the group allocation multiple access with collision detection (gama/cd) protocol for scheduling variable-length packet transmissions in a local area network is specified and analyzed. gama/cd provides the advantages of both tdma and csma/cd by maintaining a dynamically-sized cycle that varies in length depending on the network load; each cycle is composed of a contention period and a group-transmission period. during the contention period, a station with one or more packets to send competes for membership in the transmission group. once a member of the transmission group, a station is able to send data without collision during each cycle; as long as a station has data to send, it maintains its position in the group. this can be viewed as either allowing stations to ``share the floor'' in an organized manner, or as establishing frames that are not synchronized on a slot-basis and vary their length dynamically based on demand. both the throughput and the delay of gama/cd are presented and analyzed. to validate our analysis, the results of both models are compared to the throughput and delay produced by a simulation of gama/cd.
dynamic time windows and generalized virtual clock: combined closed-loop/open-loop congestion control. the authors present mechanisms for congestion control of data traffic in high-speed wide area networks. the network model assumes reservation of resources based on average requirements. the key ideas involve separation of different sources of network congestion, short-term bursts and medium-term load, and using separate mechanisms to address them. thus, dynamic time window (dtw) admission control is proposed as a mechanism to limit traffic burstiness from sources as a function of the medium-term load on the system, while a new fairness criterion for short-term congestion (pulse) is proposed as a mechanism for dealing with fair scheduling by switches of short-term bursts. the model of the network is presented. the dtw and pulse mechanisms are discussed. a detailed analytical and simulation study is presented for static time-windows and various scheduling algorithms. preliminary results on dtw are discussed
an adaptive connection admission control policy for vbr+ service class. a new service class, called vbr+ (reininger, ramamurthy and raychaudhuri, in&colon; atm forum contribution 94-0353, 1994), has been proposed for multimedia applications on atm networks. vbr+ extends the functionality of the traditional vbr service with the added capability of dynamic resource renegotiation. it makes the specification and modification of the usage parameter controls flexible, and potentially can increase the network resource utilization through statistical multiplexing. these advantages come at the expense of a more complex connection admission controller which should be designed to handle bandwidth renegotiation efficiently. in this paper a connection admission controller for vbr+ service class is proposed. we identify the desirable features of a vbr+ connection admission controller, and present a novel one that can achieve them through (1) dynamic resource partitioning, and (2) dynamic resource redistribution among active connections. simulation results showing the performance of the controller using a number of actual video traces are presented. the results show that the controller is robust in admitting a variety of video sources with widely different traffic burstiness. by partitioning the resource pool dynamically, and distributing resources among contending connections fairly, it can maintain very good quality, and can achieve high utilization. comparison with traditional vbr service reveals that the cac is able to provide comparable quality with higher network utilization. the work was performed when this author was visiting c&c research laboratory, nec usa during summer 1996 while he was with department of computer science and engineering, university of nebraska, lincoln, ne 68588, usa.
comparative study on restoration schemes of survivable atm networks. in self-healing networks, end-to-end restoration schemes have been considered more advantageous than line restoration schemes because of a possible cost reduction of the total capacity to construct a fully restorable network. this paper clarifies the benefit of end-to-end restoration schemes quantitatively through a comparative analysis of the minimum link capacity installation cost. a jointly optimal capacity and flow assignment algorithm is developed for the self-healing atm networks based on end-to-end and line restoration. several networks with diverse topological characteristics as well as multiple projected traffic demand patterns are employed in the experiments to see the effect of various network parameters. the results indicate that the network topology has a significant impact on the required resource installation cost for each restoration scheme. contrary to a wide belief in the economic advantage of the end-to-end restoration scheme, this study reveals that the attainable gain could be marginal for a well-connected and/or unbalanced network.
analysis of flow enforcement algorithm for bursty traffic in atm networks. the authors analyze the flow enforcement algorithm suitable for regulating the flow of the bursty traffic in asynchronous transfer mode (atm) networks (for broadband packet switching). the flow enforcement algorithm has two objectives: to force the input traffic to conform to the traffic parameters which are specified by the source itself at its connection time; and to obtain greater performance gain at the cell multiplexer by regulating the flow to some extent. the authors reveal the tradeoff relationship between the regulation level of the cell flow and the improvement of the link performance. the authors first analyze the flow enforcement mechanism to derive the delay distribution and the interdeparture time distribution for cells at the flow enforcer. for the input traffic, they allow the general independent arrivals of cells to represent the traffic burstiness larger than a poisson distribution. the obtained interdeparture time distributions from the flow enforcer are then used to approximately analyze the performance of the cell multiplexer. for this purpose, a markov-modulated poisson process (mmpp) approximation method is extended to investigate the performance of individual traffic stream in the superposed arriving traffic streams
loop-free internet routing using hierarchical routing trees. we present a new hierarchical routing algorithm that combines the loop-free path-finding algorithm (lpa) with the area-based hierarchical routing scheme first proposed by mcquillan for distance-vector algorithms. the new algorithm, which we call the hierarchical information path-based routing (hipr) algorithm, accommodates an arbitrary number of aggregation levels and can be viewed as a distributed version of dijkstra's algorithm running over a hierarchical graph. hipr is verified to be loop-free and correct. simulations are used to show that hipr is much more efficient than ospf in terms of speed, communication and processing overhead required to converge to correct routing tables. hipr constitutes the basis for future internet routing protocols that are as simple as ripv2, but with no looping and better performance than protocols based on link-states.
approximation techniques for computing packet loss in finite-buffered voice multiplexers. in this paper we examine three different approximation techniques for modeling packet loss in finite-buffer voice multiplexers. the performance models studied differ primarily in the manner in which the superposition of the voice sources (i.e., the arrival process) is modeled. the first approach models the superimposed voice sources as a renewal process and performance calculations are based only on the first two moments of the renewal process. the second approach is based on modeling the superimposed voice sources as a markov modulated poisson process (mmpp). our choice of parameters for the mmpp attempts to capture aspects of the arrival process in an alternate, more intuitive, manner than previously proposed approaches for determining the mmpp parameters and is shown to compute loss more accurately. finally, we also evaluate a fluid flow approximation for computing packet loss. for all three approaches, we consider as a unifying example, the case of multiplexing voice sources over a t1-rate link. the main conclusion of this paper is that both the new mmpp model examined here and the fluid flow approximation can provide accurate loss predictions for parameter ranges of practical interest; these predictions are also shown to be many orders of magnitude better than modeling the superimposed voice sources simply as a poisson process. we also discuss the problem of modeling buffer overflow for general arrival processes and also consider modeling approaches for analyzing finite-buffer multiplexers with general arrival and service processes in a network environment.
qos provisioning in micro-cellular networks supporting multimedia traffic. we introduce an adaptive call admission control mechanism for wireless/mobile networks supporting multimedia traffic, and discuss a number of resource sharing schemes which can be used to allocate wireless bandwidth to different classes of traffic. the adaptive call admission control reacts to changing new call arrival rates, and the resource sharing mechanism reacts to rapidly changing traffic conditions in every radio cell due to mobility of mobile users. in addition, we have provided an analytical methodology which shows that the combination of the call admission control and the resource sharing schemes guarantees a predefined quality-of-service to each class of traffic. one major advantage of our approach is that it can be performed in a distributed fashion removing any bottlenecks that might arise due to frequent invocation of network call control functions.
analyzing non-determinism in telecommunication services using p-invariant of petri-net model. telecommunication service specifications are often modeled by the state transition machine in which a state moves to a next state by the execution of the user's event. if multiple transitions exist for a certain pair of state and user's event, then a non-deterministic behavior occurs at the state.as the result, the non-deterministic behavior causes an illegal state transition against the user's intention, and thus should be eliminated from the state transition machine. the conventional analysis method for non-determinism is based on reachability analysis. since the method must exhaustively enumerate all reachable states of the state transition machine, it cannot be applied to the complex communication services which include many users.this paper proposes a new analysis method based on a petri-net model. the method constructs a logically equivalent petri-net for a given service specification, and obtains a set of states which cause the non-deterministic behaviors using rules in the service specification. then, the method identifies states in the set which are not reachable from the initial state using p-invariant of the petri-net, and deletes them from the set. as p-invariant is sufficient condition, we must finally apply reachability analysis to states in the resultant set. since the number of states in the resultant set may be reduced to relatively small, the new method enables us to analyze the more complex services.
performance analysis of a multichannel local lightwave network with grouping property. the authors propose a multichannel lightwave network with a grouping property which exhibits better channel efficiency as the traffic is more likely within groups. the network also avoids both wavelength agility and pretransmission coordination problems. two network topologies are considered. one is a multichannel lightwave network with full connection within groups. while it requires many receivers in each network interface unit (niu) it exhibits low queuing delay and high network capacity. the other is a multichannel lightwave network with minimal connection within groups. while it gives relatively poor delay-throughput characteristics, a network can be constructed with each niu having only two fixed-wavelength receivers. the network capacities and the mean queuing delays for the two network topologies are presented
scheduled hot-potato routing. this paper is concerned with fast, hot-potato routing, performed according to a predetermined schedule. at each time period each node selects an outgoing link, through which an incoming packet is sent. no buffers are used. we investigate first the problem of how to route a network-wide demand of packets, given the predetermined schedule. we show that certain versions of the problem have efficient solutions, while other versions are intractable. we then consider the problem of finding an optimal schedule given a network-wide demand of packets. we indicate that the problem is tractable for either a single source or single destination. however for the multi-source multi-destination case we show that it is an np-complete problem. the problem remains intractable even for a simple topology of nodes arranged on a bidirectional line. we present an efficient heuristic for directed tree-networks, and adapt it to general topologies through a recursive scheme, for which an efficient performance bound is shown.
on defining, computing and guaranteeing quality-of-service in high-speed networks. future high-speed networks are expected to support a wide variety of services such as voice and video, and to provide a guaranteed quality-of-service (qos). the authors examine the issues of computing and guaranteeing qos. traditionally, the computation of user-oriented performance criteria such as the average delay has been carried out via steady-state analysis of queuing theoretic models of communication networks. it is shown that the steady-state computations are often not sufficient for qos purposes in future high-speed networks. the authors provide mechanisms for computing and guaranteeing qos criteria and consider the issue of approximate qos criteria. it is argued that, for certain envisaged applications, traditional qos criteria are not appropriate. a qos criterion for such applications is proposed
new dynamic spt algorithm based on a ball-and-string model. a key functionality in today's widely used interior gateway routing protocols such as ospf and is-is involves the computation of a shortest path tree (spt). in many existing commercial routers, the computation of an spt is done from scratch following changes in the link states of the network. as there may coexist multiple spts in a network with a set of given link states, such recomputation of an entire spt not only is inefficient but also causes frequent unnecessary changes in the topology of an existing spt and creates routing instability.this paper presents a new dynamic spt algorithm that makes use of the structure of the previously computed spt. our algorithm is derived by recasting the spt problem into an optimization problem in a dual linear programming framework, which can also be interpreted using a ball-and-string model. in this model, the increase (or decrease) of an edge weight in the tree corresponds to the lengthening (or shortening) of a string. by stretching the strings until each node is attached to a tight string, the resulting topology of the model defines an (or multiple) spt(s). by emulating the dynamics of the ball-and-string model, we can derive an efficient algorithm that propagates changes in distances to all affected nodes in a natural order and in a most economical way. compared with existing results, our algorithm has the best-known performance in terms of computational complexity as well as minimum changes made to the topology of an spt. rigorous proofs for correctness of our algorithm and simulation results illustrating its complexity are also presented.
fairness and optimal stochastic control for heterogeneous networks. we consider optimal control for general networks with both wireless and wireline components and time varying channels. a dynamic strategy is developed to support all traffic whenever possible, and to make optimally fair decisions about which data to serve when inputs exceed network capacity. the strategy is decoupled into separate algorithms for flow control, routing, and resource allocation, and allows each user to make decisions independent of the actions of others. the combined strategy is shown to yield data rates that are arbitrarily close to the optimal operating point achieved when all network controllers are coordinated and have perfect knowledge of future events. the cost of approaching this fair operating point is an end-to-end delay increase for data that is served by the network.
performance analysis of generalized multihop shuffle networks. this paper describes the performance analysis of a class of two-connected multihop shufflenets, known as generalized shuffle networks. the topology of such networks is described mathematically by the equation n=kn, where n is the total number of nodes in the network, k the number of stages in the network and n the number of nodes in each stage. compared to classical shufflenets, the definition of generalized shuffle networks allows a larger number of feasible network structures that are realizable for a given network size n. in attempting to find an optimum network structure, network characteristics are discussed and system performance is evaluated. important relationships and interdependencies among the various network parameters are developed to facilitate cross-structural comparison.
optical switching networks with minimum number of limited range wavelength converters. we study the problem of determining the minimum number of limited-range wavelength converters needed to construct strictly, wide-sense, and rearrangeably nonblocking optical cross-connects for both unicast and multicast traffic patterns. we give the exact formula to compute this number for rearrangeably and wide-sense nonblocking cross-connects under both the unicast and multicast cases. we also give optimal cross-connect constructions with respect to the number of limited-range wavelength converters.
on multihop optical network topology using kautz diagraphs. proposes a new topology for multihop, optical networks using kautz digraphs. the properties of such a network as a logical topology are evaluated and compared with other topologies proposed in the literature. for a given degree of each node and a given diameter of the network, a kautz digraph supports more nodes than other topologies like shufflenet or that using a debruijn digraph and hence seems to be an attractive design for the physical topology too.
network architecture and functional requirements for upt. the author identifies major functional requirements to support universal personal telecommunications (upt) within a broad upt reference model. these functional requirements are mapped on the current view of the intelligent network (in) architectural model so that the key functional elements and interfaces in the in architecture can be identified and the necessary network capabilities to support upt specified. network operations requirements for access security and personal privacy protection are presented and the relationship between the access security requirements and upt performance aspects discussed
addressing network survivability issues by finding the k-best paths through a trellis graph. due to the increasing reliance of our society on the timely and reliable transfer of large quantities of information (such as voice, data, and video) across high speed communication networks, it is becoming important for a network to offer survivability, or at least graceful degradation, in the event of network failure. in this paper we aim to offer a solution in the selection of the k-best disjoint paths through a network by using graph theoretic techniques. the basic approach is to map an arbitrary network graph into a trellis graph which allows the application of computationally efficient methods to find disjoint paths. use of the knowledge of the k-best disjoint paths for improving the survivability of atm networks at the virtual path and virtual circuit level is discussed.
optical routing control using coherent pattern-matching circuit for photonic self-routing switch. optical routing control using a coherent optical pattern-matching circuit is described. this circuit can detect any specified pattern in an ultrafast optical signal sequence by using tapped delay-lines to optically correlate the input pattern with a set pattern. a whole 4-bit pattern-matching circuit was monolithically integrated on a silicon substrate by the silica-based planar lightwave circuit technology. the fabricated circuit operated at a bit rate of 4.65 gb/s. pattern-matching circuits can apply to optical routing control for photonic self-routing switches. address-header formats for ring and banyan networks are also discussed from the point of view of the power penalty versus the number of addresses. the header for ring networks is composed of a binary code or a gold code. the header for banyan networks is composed of code-division-multiplexed gold codes. optically routing-controlled photonic packet switching using headers composed of binary codes was experimentally demonstrated at a bit rate of 10 gb/s
performance modelling of reliable multicast transmission. our aim is to investigate reliable transmission for multicast communication and explore its relationship to multicast routing. we derive two characterizations that enable the comparison of routing algorithms and error recovery mechanisms with respect to the multicast tree topology, namely the probability mass function of successful receptions and the expected number of retransmissions needed to deliver a packet from the source to all receivers. we also give a tight approximation of the computationally expensive expected number of retransmissions. these expressions allow to explore the relationship between routing and error recovery for multicast communication. we finally evaluate the impact of routing algorithms on the performance of reliable multicast transmission and give a realistic generic model for a multicast tree.
a look at the mpeg video coding standard for variable bit rate video transmission. the mpeg video coding standard for the transmission of variable-bit-rate video on asynchronous transfer mode (atm)-based broadband isdn is examined. the focus is on its use for real-time transmission of broadcast-quality video. the impact of two key parameters, the intraframe to interframe picture ratio and the quantization index that are defined in the standard, on the bit rates per frame was studied. these parameters can be used to control video sources depending on the state of the network. also, as opposed to previous work which looks only at bit rates per frame, the bits generated per macroblock are studied. this is the basic mpeg coding unit. by packetizing these bits, insight was obtained into the cell arrival process to a network for a mpeg video source