waashk/dblp huggingface dataset:
on accommodating mobile hosts in an integrated services packet network. this paper considers the support of real-time applications to mobile hosts in an integrated services packet network. we have proposed a service model for mobile hosts that can support adaptive applications which can withstand wide range of available bandwidth, as well as applications which require mobility independent service guarantees. we describe an admission control scheme and a reservation protocol for implementing this service model. our admission control scheme achieves high utilization of network resources.
a novel upgrade path for transparent optical networks based on wavelength reuse. passive optical networks (pons) provide an economical method of delivering a wide variety of services to a small number of customers. using optical fibre amplifiers, pons can be aggregated to form transparent optical networks (tons) serving a very large customer base. however, the effective bandwidth per user is limited, particularly in the upstream direction. in the future, customers will demand increasingly high bandwidth services requiring tons to be regularly upgraded. a wdm ton upgrade is proposed based on a novel wavelength reuse scheme in which information is routed passively using optical filters without the need for electronic switching, buffering, wavelength conversion or network synchronisation. wavelengths are dynamically allocated to customers, enabling bandwidth to be offered on demand.
complexity of gradient projection method for optimal routing in data networks. derives a time complexity bound for the gradient projection method for optimal routing in data networks. this result shows that the gradient projection algorithm of the goldstein-levitin-poljak type formulated by bertsekas (1982) converges to within /spl epsiv/ in relative accuracy in o(/spl epsiv//sup 2/h/sub min/n/sub max//sup l/) iterations, where n/sub max//sup l/ is the number of paths sharing the maximally shared link, and h/sub min/ is the diameter of the network. based on this complexity result, the authors also show that the one-source-at-a-time update policy has a complexity bound which is o(n) times smaller than that of the all-at-a-time update policy [bertsekas, 1982], where n is the number of nodes in the network. the result of the paper argues for constructing networks with low diameter for the purpose of reducing the complexity of the network control algorithms. the result also implies that parallelizing the optimal rotating algorithm over the network nodes is beneficial.
closed-loop architecture and protocols for rapid dynamic spreading gain adaptation in cdma networks. we present a closed-loop architecture and protocols for rapid dynamic spreading gain adaptation and fast feedback between a transmitter and a receiver communicating with each other in cdma networks. these protocols and architecture do not require the transfer of an explicit control message indicating the change of cdma spreading gain from transmitter to receiver. also, with these protocols, the transmitter can change the spreading gain symbol-by-symbol as opposed to frame-by-frame, and feedback information (e.g., the fast-varying channel condition) can be exchanged almost as frequently as the symbol rate. thus, adaptation to the time-varying channel conditions of wireless networks and/or to the rate variation of traffic can be much faster than is possible with the existing frame-by-frame approach.
measurement-based call admission control: analysis and simulation. we consider the problem of admission control for variable-rate traffic sources sharing a bufferless link, in order to provide a quality-of-service in terms of overload probability. through analysis and simulations, we study the performance of a scheme which has no prior knowledge of the traffic statistics and makes admission decision based on the current network state only. we analyze the dynamics of the system under this control, and show that in the regime of large link capacity and separation of call and burst time-scales, this scheme performs as well as the optimal scheme which has full knowledge of the statistics. we evaluate the performance of the scheme on real traffic sources.
classbench: a packet classification benchmark. packet classification is an enabling technology for next generation network services and often a performance bottleneck in high-performance routers. the performance and capacity of many classification algorithms and devices, including tcams, depend upon properties of filter sets and query patterns. despite the pressing need, no standard performance evaluation tools or filter sets are publicly available. in response to this problem, we present classbench, a suite of tools for benchmarking packet classification algorithms and devices. classbench includes a filter set generator that produces synthetic filter sets that accurately model the characteristics of real filter sets. along with varying the size of the filter sets, we provide high-level control over the composition of the filters in the resulting filter set. the tool suite also includes a trace generator that produces a sequence of packet headers to exercise packet classification algorithms with respect to a given filter set. along with specifying the relative size of the trace, we provide a simple mechanism for controlling locality of reference. while we have already found classbench to be very useful in our own research, we seek to eliminate the significant access barriers to realistic test vectors for researchers and initiate a broader discussion to guide the refinement of the tools and codification of a formal benchmarking methodology. (the classbench tools are publicly available at the following site: http://www.arl.wustl.edu/~det3/classbench/.)
power-saving protocols for ieee 802.11-based multi-hop ad hoc networks. power-saving is a critical issue for almost all kinds of portable devices. in this paper, we consider the design of powersaving protocols for mobile ad hoc networks (manets) that allow mobile hosts to switch to a low-power sleep mode. the manets being considered in this paper are characterized by unpredictable mobility, multi-hop communication, and no clock synchronization mechanism. in particular, the last characteristic would complicate the problem since a host has to predict when another host will wake up to receive packets. we propose three power management protocols, namely dominating-awake-interval, periodically-fully-awake-interval, and quorum-based protocols, which are directly applicable to ieee 802.11-based manets. as far as we know, the power management problem for multihop manets has not been seriously addressed in the literature. existing standards, such as ieee 802.11, hiperlan, and bluetooth, all assume that the network is fully connected or there is a clock synchronization mechanism. extensive simulation results are presented to verify the effectiveness of the proposed protocols.
message authentication with one-way hash functions. fast message integrity and authentication services are much desired in today's high-speed network protocols. current message authentication techniques are mostly encryption-based which is undesirable for several reasons. in this brief paper, we introduce encryption-free message authentication based entirely on fast one-way hash functions. two methods are presented and their strength is analyzed. the security of the proposed methods is based on the strength of the underlying one-way hash function.
large-scale and high-speed interconnection of multiple fddis using atm-based backbone lan. the authors discuss problems related to the bridging method between the asynchronous transfer mode (atm)-based high-speed multimedia backbone local area network (mblan) and a fiber distributed data interface (fddi), especially the filtering database (fdb) construction method for filtering of frames. the problems are achieving high performance, correspondence to a large-scale system, and prevention of broadcast. the fdb construction method was evaluated based on these problems. through the evaluation, it was noted that the fdb learning failure rate must be below 10-3 and a frame filtering process when relaying frames from the mblan to an fddi is not necessary. an fdb access method is proposed. by using a multiple hashing algorithm for the fdb access, the proposed method makes it possible to deal with all terminal addresses, even in a large-scale network system that includes tens of thousands of terminals or more, and also enables high-speed filtering/forwarding of frames between terminals. both the entry search speed and an effective number of entries in the entry table can be adapted to the requirements of an application by changing the maximum number of hashing times
approximation formulae for blocking probabilities in a large erlang loss system: a probabilistic approach. in this paper, we use a probabilistic approach to present a unified view of classical blocking probabilities approximation formulae for a multi-rate erlang loss system, both in the finite and infinite population cases. combining our results with the uniform approximation due to bleistein, we recover the results mitra and morrison which were obtained by saddlepoint techniques. we also show that we can avoid using the uniform approximation to get "specialized" formulae for the heavy, critical, generalized critical and light traffic cases. numerical results for typical loss levels in the atm case are presented where we compare the uniform approximation (ua) with the specialized approximations (sa).
queueing analysis for shared buffer switching networks for non-uniform traffic. uniform traffic does not represent a realistic view of traffic patterns in real systems. non-uniform traffic models better reflect the traffic patterns that need to be accommodated. such traffic may cause the network performance to deteriorate to much lower levels than the ones predicted by uniform traffic analysis. the authors extend the queueing analysis for buffered networks by providing methods for analyzing the queueing behavior of switching networks under non-uniform traffic patterns. they focus on shared buffer switch elements because they have better performance than input or output buffered elements. the analytical method for performance evaluation is compared with simulation on the basis of accuracy, where the performance is measured in terms of maximum throughput and probability of cell loss.
the token grid: multidimensional media access for local and metropolitan networks. a token grid network in which media access is performed over a two-dimensional mesh is introduced. in the resulting system, each station is two-connected and has the same transmission hardware and small station latency as in a dual token ring. in the token grid, however, the total system throughput may be many factors larger than that which is possible in a dual token ring. this advantage increases with the normalized end-to-end propagation delay. in the results presented, the uniform load capacity of the token grid grows with the size of the network. in addition, the token grid can take advantage of communities-of-interest amongst the stations. it is possible to implement the system in such a way as to achieve robust operation in the presence of station and link failures
optical local area networks (lans) using wavelength-selective couplers. in wavelength-division-multiplexed ring and bus networks, stations normally connect to the fiber using fused biconical taper (fbt) attachments. in this paper, we investigate protocols for multichannel photonic bus/ring lans which use active wavelength-selective taps rather than passive ones. since stations actively tap the channel that they are accessing, synchronization and other functions are identical to existing single-channel lans. however, in order to avoid "re-tuning collisions", the media access protocols in these designs must ensure that stations do not re-tune their couplers at inappropriate times. this constraint places restrictions on the physical parameters over which system performance is efficient. in particular, we find that these designs may be efficient in the local area but lack the scalability required for metropolitan coverage. in this paper, capacity and delay models are also derived, and comparisons are made with conventional passive networks.
a transmission scheduling algorithm for mixed traffic: high and low priority. the authors are concerned with the effective accommodation of mixed traffic (high and low priority) by the cellular isdn system. they consider two mutually independent traffic streams sharing a single common channel for transmission. the two streams have different arrival and required transmission time characteristics, as well as different delay constraints. the authors present and analyze an algorithm for accommodating both traffics on the common transmission medium, so that the expected throughput of the system is high and the expected per message delays for both traffics are low. numerical results are presented
multicast routing algorithm for nodal load balancing. the authors propose two multicast routing algorithms which distribute copy operation of packets over all nodes along the multicast path: a link-added type algorithm and a loop-constructed type algorithm. both algorithms, at first, derive an approximate solution for minimum cast path, and then improve the solution to prevent concentration of packet copy operation at one switching node at a little sacrifice of total cost along the path. computer simulation results show that too much copy operation per node can be avoided by these algorithms. compared to the minimum cost solution of the tree-shaped multicast path, the solution of the proposed algorithms makes the average distance connecting a source-destination pair longer, but the sacrifice of total cost is verb small. these algorithms can be applied not only to packet networks but also asynchronous transfer mode (atm) networks
performance simulation of end-to-end windowing in atm networks. the authors focus on the application of adaptive end-to-end windowing as a reactive congestion control mechanism for data communications over asynchronous transfer mode (atm) networks. in particular, an adaptive window mechanism including go-back (n) retransmission is proposed. the performance achievable by its application was evaluated by simulation under a particular network model assumption. the gain possible in terms of improvement of cell acceptance is estimated with different source traffic descriptors and network parameter values. some comments on the interaction between the window mechanism and other congestion control mechanisms for atm networks are given
dqdb man as a transit network for atm cpns. the authors examine the internetworking of the distributed queue dual bus (dqdb) metropolitan area network (man) with asynchronous transfer mode (atm) of broadband integrated services digital network (b-isdn). several scenarios are discussed. it is suggested that the best solution is through the use of a connection-oriented (co) dqdb service. some of the provisions of the co dqdb service necessary for an efficient and simple interworking are provided
guaranteed scheduling for switches with configuration overhead. in this paper, we present three algorithms that provide performance guarantees for scheduling switches, such as optical switches, with configuration overhead. each algorithm emulates an unconstrained (zero overhead) switch by accumulating a batch of configuration requests and generating a corresponding schedule for a constrained switch. speedup is required both to cover the configuration overhead of the switch and to compensate for empty slots left by the scheduling algorithm. scheduling algorithms are characterized by the number of configurations ns they require to cover a batch of requests and the speedup required to compensate for empty slots smin. initially, all switch reconfiguration is assumed to occur simultaneously. we show that a well-known exact matching algorithm, exact, leaves no empty slots (i.e., smin = 1), but requires ns ≈ n2 configurations for an n-port switch leading to high configuration overhead or large batches and, hence, high delay. we present two new algorithms that reduce the number of configurations required substantially. min covers a batch of requests in the minimum possible number of configurations, ns = n, but at the expense of many empty slots, smin ≈ 4log2 n. double strikes a balance, requiring twice as many configurations,ns = 2n, while reducing the number of empty slots so that smin = 2. loosening the restriction on reconfiguration times, the scheduling problem is cast as an open shop. the best known practical scheduling algorithm for open shops, list scheduling (list), gives the same emulation requirements as double. therefore, we conclude that our architecture gains no advantages from allowing arbitrary switch reconfiguration. finally, we show that double and list offer the lowest required speedup to emulate an unconstrained switch across a wide range of port count and delay.
on the multiple shared memory module approach to atm switching. the authors propose a new approach to building large asynchronous transfer mode (atm) switches based on shared memory modules. shared memory modules are proposed to be placed in parallel, with every input and output port having access to every one of the switch models. this approach permits global sharing of the total buffer space. some basic issues in such an arrangement are studied, such as the necessary and sufficient conditions for optimal performance and the minimum number of modules required for the switch to have optimal performance while permitting sharing of the entire buffer space among all the input and output ports and while preserving packet sequencing for any virtual channel. a centralized control algorithm which yields optimal performance is also proposed
classification of access network types: ethernet wireless lan, adsl, cable modem or dialup? ethernet, wireless lan, adsl, cable modem, and dialup are common access networks that have dramatically different characteristics. fast and accurate classification of access networks can benefit a wide range of applications. in this paper, we propose a simple and efficient end-to-end scheme to classify access networks into three categories: ethernet, wireless lan and low-bandwidth connection. our scheme is based on the intrinsic characteristics of the various access networks, and utilizes the median and entropy of packet-pair inter-arrival times. extensive experiments show that our scheme obtains accurate classification results in a very short time (95% accuracy in 2s, with 10 packet pairs).
a nonpreemptive priority delay model with modified-vacation intervals for homogeneous fddi networks. a closed-form analytical expression is derived for the individual priority classes of fddi based on a nonpreemptive priority delay model. to faithfully model the fddi network using the nonpreemptive priority delay model, we use a concept of modified-vacations. the expressions for the mean waiting time of individual priority classes are functions of first and second moments of the modified-vacation intervals of that class. it can be shown that the expression derived for the first and second moments of the modified-vacation intervals of the respective classes are functions of mean and variance of the number of messages transmitted by each priority class per token rotation. these variables are evaluated using an iterative procedure that utilizes the prior knowledge of the throughput characteristics of the fddi network. simulation results show that the nonpreemptive priority delay model provides accurate estimates for the mean waiting time of individual priority classes of a homogeneous fddi network.
performance analysis of traffic control methods in multimedia atm lan. the authors treat traffic control methods suitable to atm lan, in which two service classes are considered; one is for high speed data transfer based on a fast reservation protocol (frp service class) and the other is for continuous bit rate (cbr) traffic such as motion video (cbr service class). the authors first evaluate the performance of the frp service class. when the terminal requests the data transfer, its usable bandwidth is negotiated with the traffic descriptor (c/sub max/, c/sub min/) the former is a desirable data transfer rate, and the latter is a sustainable rate when the network is congested. by carrying out a mathematical analysis, the authors show an appropriate set of the traffic descriptor. the coexistence of frp and cbr service classes are then treated. by using an analytic method, the performance of the cbr service class traffic is shown to be heavily affected by the frp service class traffic. therefore, the authors introduce a reserved bandwidth to the cbr service class to guarantee some appropriate level of performance to the cbr service class.
the helical switch: a multipath atm switch which preserves cell sequence. a novel cell switching architecture for asynchronous transfer mode (atm)-based networks is presented. the proposed helical switch is a multistage interconnection network which implements the self-routing technique with efficient buffer sharing. although the switch may route cells along multiple paths, the connection-oriented mode required by the atm-based network is supported. cell sequence integrity is guaranteed by introducing a virtual helix which forces cells routed along different paths to proceed in order and fill the internal buffers uniformly. under a uniform traffic pattern, it is shown that the minimum achievable throughput is 5/6 per output line
distributed construction of connected dominating set in wireless ad hoc networks. connected dominating set (cds) has been proposed as virtual backbone or spine of wireless ad hoc networks. three distributed approximation algorithms have been proposed in the literature for minimum cds. in this paper, we first reinvestigate their performances. none of these algorithms have constant approximation factors. thus these algorithms cannot guarantee to generate a cds of small size. their message complexities can be as high as o(n2), and their time complexities may also be as large as o(n2) and o(n3). we then present our own distributed algorithm that outperforms the existing algorithms. this algorithm has an approximation factor of at most 8, o(n) time complexity and o(n log n) message complexity. by establishing the ω(n log n) lower bound on the message complexity of any distributed algorithm for nontrivial cds, our algorithm is thus message-optimal.
a mini-product-form-based solution to data-delay evaluation in wireless integrated voice/data networks. although the product-form solution provides an accurate characterization of equilibrium voice-traffic behavior in wireless integrated voice/data networks, it does not directly provide a method to evaluate data-packet delay. however, examination of each link separately in a manner that incorporates interaction with the rest of the network permits one to take advantage of the wireless nature of the network and obtain a three-flow characterization of each link, which also satisfies a product-form solution and is hence termed a "mini-product-form" solution. by matching the values of these flows, which are natural to the wireless network, to the average values obtained from the product-form solution of the entire network, the authors obtain a three-dimensional markov chain characterization of the voice occupancy state on the link, which permits a simpler evaluation of data-packet delay. a further reduction is possible by converting the three-dimensional chain to a single-dimensional one.