waashk/acm huggingface dataset:
design, implementation, and evaluation of programmable handoff in mobile networks  we describe the design, implementation and evaluation of a programmable architecture for profiling, composing and deploying handoff services. we argue that future wireless access networks should be built on a foundation of open programmable networking allowing for the dynamic deployment of new mobile and wireless services. customizing handoff control and mobility management in this manner calls for advances in software and networking technologies in order to respond to specific radio, mobility and service quality requirements of future wireless internet service providers. two new handoff services are deployed using programmable mobile networking techniques. first, we describe a "multi- handoff" access network service, which is capable of simultaneously supporting multiple styles of handoff control over the same physical wireless infrastructure. second, we discuss a "reflective handoff" service, which allows programmable mobile devices to freely roam between heterogeneous wireless access networks that support different signaling systems. evaluation results indicate that programmable handoff architectures are capable of scaling to support a large number of mobile devices while achieving similar performance to that of native signaling systems.  michael e. kounavis andrew t. campbell gen ito giuseppe bianchi
nomadic computing - an opportunity we are in the midst of some truly revolutionary changes in the field of computer-communications, and these offer opportunities and challenges to the research community. one of these changes has to do with nomadic computing and communications. nomadicity refers to the system support needed to provide a rich set of capabilities and services to the nomad as he moves from place to place in a transparent and convenient form. this new paradigm is already manifesting itself as users travel to many different locations with laptops, pda's, cellular telephones, pagers, etc. in this paper we discuss some of the open issues that must be addressed as we bring about the system support necessary for nomadicity. in addition, we present some of the considerations with which one must be concerned in the area of wireless communications, which forms one (and only one) component of nomadicity. leonard kleinrock
the info superhighway: for the people  the opportunities are attractive, but some pavers of the information superhighway (ish) are too eager to pour concrete. they risk making rough roads that will alienate the very users they seek. these technologically oriented ish devotees may be building dramatic overpasses and painting stripes without figuring out where the highway should be going. i believe greater attention should be paid to identifying appropriate services, designing a consistent user interface, and developing a clearer model of the diverse user communities.  ben shneiderman
an internet multicast system for the stock market  we are moving toward an international, 24-hour, distributed, electronic stock exchange. the exchange will use the global internet, or internet technology. this system is a natural application of multicast because there are a large number of receivers that should receive the same information simultaneously. the data requirements for the stock exchange are discussed. the current multicast protocols lack the reliability, fairness, and scalability needed in this application. we describe a distributed architecture and a timed reliable multicast protocol, trmp, that has the appropriate characteristics. we consider three applications: (1) a unified stock ticker of the transactions that are being conducted on the various physical and electronic exchanges. our objective is to deliver the same combined ticker reliability and simultaneously to all receivers, anywhere in the world. (2) a unified sequence of buy and sell offers that are delivered to a single exchange or a collection of exchanges. our objective is to give all traders the same fair access to an exchange independent of their relative distances to the exchange or delay and loss characteristics of the international network. (3) a distributed, electronic trading floor that can replace the current exchanges. this application has the fairness attributes of the first two applications and uses trmp to conduct irrefutable, distributed trades.
high-speed policy-based packet forwarding using efficient multi-dimensional range matching the ability to provide differentiated services to users with widely varying requirements is becoming increasingly important, and internet service providers would like to provide these differentiated services using the same shared network infrastructure. the key mechanism, that enables differentiation in a connectionless network, is the packet classification function that parses the headers of the packets, and after determining their context, classifies them based on administrative policies or real-time reservation decisions. packet classification, however, is a complex operation that can become the bottleneck in routers that try to support gigabit link capacities. hence, many proposals for differentiated services only require classification at lower speed edge routers and also avoid classification based on multiple fields in the packet header even if it might be advantageous to service providers. in this paper, we present new packet classification schemes that, with a worst-case and traffic-independent performance metric, can classify packets, by checking amongst a few thousand filtering rules, at rates of a million packets per second using range matches on more than 4 packet header fields. for a special case of classification in two dimensions, we present an algorithm that can handle more than 128k rules at these speeds in a traffic independent manner. we emphasize worst-case performance over average case performance because providing differentiated services requires intelligent queueing and scheduling of packets that precludes any significant queueing before the differentiating step (i.e., before packet classification). the presented filtering or classification schemes can be used to classify packets for security policy enforcement, applying resource management decisions, flow identification for rsvp reservations, multicast look-ups, and for source-destination and policy based routing. the scalability and performance of the algorithms have been demonstrated by implementation and testing in a prototype system. t. v. lakshman d. stiliadis
deriving protocol specifications from service specifications including parameters  the service specification concept has acquired an increasing level of recognition by protocol designers. this architectural concept influences the methodology applied to service and protocol definition. since the protocol is seen as the logical implementation of the service, one can ask whether it is possible to formally derive the specification of a protocol providing a given service. this paper addresses this question and presents an algorithm for deriving a protocol specification from a given service specification. it is assumed that services are described by expressions, where names identifying both service primitives and previously defined services are composed using operators for sequence, parallelism and alternative. services and service primitives may have input and output parameters. composition of services from predefined services and service primitives is also permitted. the expression defining the service is the basis for the protocol derivation process. the algorithm presented fully automates the derivation process. future work will focus on the optimization of traffic between protocol entities and on applications.  reinhard gotzhein gregor von bochmann
a multi-layer collision resolution multiple access protocol for wireless  in mobile communication networks operating in unreliable physical transmission, random access protocol with the collision resolution (cr) scheme is more attractive than the aloha family including carrier sense multiple access (csma) [ieee networks (september 1994) 50--64], due to likely failure on the channel sensing. being a member of cr family schemes, a protocol known as non-preemptive priority multiple access (npma) is utilized in a new high- speed wireless local area network, hiperlan, standardized by european telecommunication standard institute (etsi). a conceptually three-layer cr multiple access protocol generalized from npma, supporting single type of traffic, is thus presented and analyzed in this paper. the cr capability of such a protocol (and hence npma) is proved to be significant by numerical substantiation that additional collision detection schemes are dispensable; also its throughput/delay performance is excellent when the proportion of the transmission phase to a channel access cycle is large enough (i.e., the winner of contention should transmit all of its packets successively). on the other hand, the simulated performance of npma serving integrated traffic is not fully satisfactory, primarily due to its distributed control mode and distinguishing traffic types only by the prioritization process.  ya- ku sun kwang-cheng chen
a data flow processor array system: design and analysis  this paper presents the architecture of a highly parallel processor array system which executes programs by means of a data driven control mechanism. the data driven control mechanism makes it easy to construct an mimd (multiple instruction stream and multiple data stream) system, since it unifies inter- processor data transfer and intra-processor execution control. the design philosophy of the data flow processor array system presented in this paper is to achieve high performance by adapting a system structure to operational characteristics of application programs, and also to attain flexibility through executing instructions based on a data driven mechanism.  the operational characteristics of the proposed system are analyzed using a probability model of the system behavior. comparing the analytical results with the simulation results through an experimental hardware system, the results of the analysis clarify the principal effectiveness of the proposed system. this system can achieve high operation rates and is neither sensitive to inter-processor communication delay nor sensitive to system load imbalance.  naohisa takahashi makoto amamiya
dynamic handoff of multimedia streams  sometimes a client that receives a multimedia stream from a server can change the connection used to transfer the data. there may be multiple paths or multiple servers, but a switch from one connection to another requires a handoff. during such a handoff, the player (of the video and/or audio stream) should be fed with a constant data stream so that they player does not have to stop. handoffs can be used in addition to adaptive (frame-dropping) filters to improve the quality of multimedia streams as received by the client.  this paper investigates the influence of several factors on the quality of the multimedia stream during the handoff: the time needed to establish the connection to the new server, the size and the fill degree of the client buffer, the length of the synchronization phase (where both the old and the new connection are sending) and the most appropriate start packet for the new connection. the evaluation showsm that a handoff can be a viable solution if an appropriate strategy is chosen to phase over from the old connection to the new one.  roger karrer thomas gross
cluster oriented architecture for the mapping of parallel processor networks to high performance applications  massively parallel computer architectures have been discussed since the very beginning of electronic computing. the major design goal was clearly getting a superior system performance. today, with supercomputers, most commonly used, this has changed to match the computing power of supercomputers for a fraction of their costs. up to now most parallel computer systems have been build up by university institutes for research work with few commercial success.  the recent progress in computer architecture design has made parallel processor networks much more feasible. due to combinatorical problems in processor interconnection networks, cluster oriented approaches are the most favorable way for designing parallel systems. this requires a special interconnection hardware as well as mapping algorithms.  in this paper we will present our new parallel cluster oriented computer system based on the inmos transputer technology. this system includes a special network manager supported by dedicated hardware to make use of advanced dynamic mapping strategies in an efficient and flexible way.  f-d. kubler f. lucking
aggregation and conformance in differentiated service networks: a case study  the differentiated service (diff-serv) architecture [1] advocates a model based on different "granularity" at network edges and within the network. in particular, core routers are only required to act on a few aggregates that are meant to offer a pre-defined set of service levels. the use of aggregation raises a number of questions for end-to-end services, in particular when crossing domain boundaries where policing actions may be applied. this paper focuses on the impact of such policing actions in the context of individual and the bulk services built on top of the expedited forwarding (ef) [7] per- hop-behavior (phb). the findings of this investigation confirm and quantify the expected need for reshaping at network boundaries, and identify a number of somewhat unexpected behaviors. recommendations are also made for when reshaping is not available.  roch a. guerin vicent pla
paging area optimization based on interval estimation in wireless personal communication networks  we consider an optimum personal paging area configuration problem to improve the paging efficiency in pcs/cellular mobile networks. the approach is to set up the boundaries of a one-step paging area that contain the locations of a mobile user with a high probability and to adjust the boundaries to gain a coverage that is matched to the mobile user's time- varying mobility pattern. we formulate the problem as an interval estimation problem. the objective is to reduce the paging signaling cost by minimizing the size of the paging area constrained to certain confidence measure (probability of locating the user), based on a finite number of available location observations of the mobile user. modeling user mobility as a brownian motion with the drift stochastic process and by estimating the parameters of the location probability distribution of the mobility process, the effects of the mobility characteristics and the system design parameters on the optimum paging area are investigated. results show: (1) the optimum paging area expands with the time elapsed after the last known location of the user; (2) it also increases with the length of a prediction interval and the location probability; (3) the relative change in the paging area size decreases with the increase in the number of location observations.  zhuyu lei cem u. saraydar narayan b. mandayam
single sided mpi implementations for sun mpir  this paper describes an implementation of generic mpi-2 single-sided communications for sun-mpi. our implementation is layered on top of point-to- point mpi communications and therefore can be adapted to other mpi implementations.  the code is designed to co-exist with other mpi-2 single-sided implementations (for example, direct use of shared memory) providing a generic fall-back implementation for those communication paths where an optimized single-sided implementation is not available. mpi-2 single-sided communications require the transfer of data-type information as well as user data. we describe a type packing and caching mechanism used to optimize the transfer of data-type information.  the performance of this implementation is measured in comparison to equivalent point-to-point operations and the sharedmemory implementation provided by sun.  s. booth e. mourao
fast connection establishment in high speed networks  protocols for establishing, maintaining and terminating connections in packet switched networks have been studied in the literature and numerous standards have been developed to address this problem. in this paper, we reexamine connection establishment in the context of a fast packet network with an integrated traffic load, explain why previously proposed solutions are inadequate and develop a protocol for connection establishment/takedown that is appropriate for such a network. the underlying model that we use is the recently developed paris network, though our ideas are sufficiently general to cover many other fast packet networking architectures.  i. cidon i. gopal a. segall
a flexible model for resource management in virtual private networks as ip technologies providing both tremendous capacity and the ability to establish dynamic secure associations between endpoints emerge, virtual private networks (vpns) are going through dramatic growth. the number of endpoints per vpn is growing and the communication pattern between endpoints is becoming increasingly hard to forecast. consequently, users are demanding dependable, dynamic connectivity between endpoints, with the network expected to accommodate any traffic matrix, as long as the traffic to the endpoints does not overwhelm the rates of the respective ingress and egress links. we propose a new service interface, termed a _hose_, to provide the appropriate performance abstraction. a hose is characterized by the aggregate traffic to and from one endpoint in the vpn to the set of other endpoints in the vpn, and by an associated performance guarantee.hoses provide important advantages to a vpn customer: (i) flexibility to send traffic to a set of endpoints without having to specify the detailed traffic matrix, and (ii) reduction in the size of access links through multiplexing gains obtained from the natural aggregation of the flows between endpoints. as compared with the conventional point to point (or customer-pipe) model for managing qos, hoses provide reduction in the state information a customer must maintain. on the other hand, hoses would appear to increase the complexity of the already difficult problem of resource management to support qos. to manage network resources in the face of this increased uncertainty, we consider both conventional statistical multiplexing techniques, and a new _resizing_ technique based on online measurements.to study these performance issues, we run trace driven simulations, using traffic derived from at&amp;t;'s voice network, and from a large corporate data network. from the customer's perspective, we find that aggregation of traffic at the hose level provides significant multiplexing gains. from the provider's perspective, we find that the statistical multiplexing and resizing techniques deal effectively with uncertainties about the traffic, providing significant gains over the conventional alternative of a mesh of statically sized customer-pipes between endpoints. n. g. duffield pawan goyal albert greenberg partho mishra k. k. ramakrishnan jacobus e. van der merive
presentation abstract: a tutorial on local networks  local networks have garnered ever-increasing attention during the past several years. local networks have been the subject of numerous conferences, of standardization activities, and of a proliferation of vendor offerings. the purpose of this tutorial is to overview the key technical issues underlying the design and application of local networks and thereby develop a framework for categorizing and, based on user requirements, evaluating local network approaches and products. naturally, an overview of this type draws from a large number of existing and planned networks. unfortunately, the limited time allotted to the topic does not permit a detailed review of any particular approach, but rather necessitates an attempt to extract the major concepts from each system.  the phrase "local network " (or any of its variations) has become so widely used, that it has been used here without further explanation. in general, local networks have been characterized as having relatively high bandwidth, i.e., total system bandwidth in excess of 1 megabit/second, and covering a limited geographic area, i.e., at most 25 kilometers. other characteristics which have been associated with local networks include broadcast capability and localized administrative control. this definition includes more traditional communication switching products, even though the ethernet is frequently noted as being prototypical of local networks. while this tutorial attempts to span the entire spectrum of local network approaches, the ethernet and other similar networks are the primary focus.  david j. kaufman
rearrangeability of multistage shuffle/exchange networks  in this paper we study the rearrangeability of multistage shuffle/exchange networks. although a theoretical lower bound of (2 log2n \\- 1) stages for rearrangeability of a network with n = 2n inputs and outputs has been known, the sufficiency of (2 log2n \\- 1) stages has neither been proved nor disproved. the best known upper bound for rearrangeability is (3 log2n \\- 3) stages. we prove that, if (2 log2r \\- 1) shuffle/exchange stages are sufficient for rearrangeability of a network with r = 2' inputs and outputs, then, for any n > r, 3 log2n \\- (r \\+ 1) stages are sufficient for a network with n inputs and outputs. this result is established by setting some of the middle stages of the network to realize a fixed permutation and showing the reduced network to be topologically equivalent to a member of the benes class of rearrangeable networks. we first characterize equivalence to benes networks in set-theoretic terms and use this to prove equivalence of the reduced shuffle/exchange network to the benes network. from the known result that 5 stages are sufficient for rearrangeability when n = 8, we obtain an upper bound of (3 log2n \\- 4) stages for rearrangeability when n ≥ 8\. further, any increase in the network size r for which the rearrangeability of (2 log2r \\- 1) stages could be shown, results in a corresponding improvement in the upper bound for all n ≥ r.  in addition, due to the one-to-one correspondence that exists between the switches in the reduced shuffle/exchange network and those in the benes network, the former network can be controlled by the well-known looping algorithm.  a. varma c. s. raghavendra
performance models for noahnet  noahnet is an experimental flood local area network with features such as high reliability and high performance. noahnet uses a randomly connected graph topology with four to five interconnections per node and a flooding protocol to route messages.  the purpose of this paper is to present two analytical performance models which we have designed to understand the load- throughput behavior of noahnet. both models assume slotted noahnet operation and also assume that if k messages attempt transmission in a slot, the network gets divided into k partitions of arbitrary sizes - one partition for each message. first, we show that the average number of successful messages in a slot given k partitions of transmissions is (m \\- k)/(n \\- 1), where n is the number of nodes in the network and m is the number of nodes out of n that participate in the flooding of k messages. this is an interesting result and is used in both models to derive the load- throughput equations.  each model is then presented using a set of assumptions, derivations of load- throughput equations, a set of plots, and the discussion of results. models one and two differ in the way they account for retransmissions.  g. m. parulkar a. s. sethi d. j. farber