waashk/acm huggingface dataset:
handover management in low earth orbit (leo) satellite networks  low earth orbit (leo) satellite networks will play an important role in the evolving information infrastructure. satellites in the low earth orbits provide communication with shorter end-to-end delays and efficient frequency usage. however, some problems need to be solved before leo satellite systems can be successfully deployed. one of these problems is the handover management. the objective of this paper is to survey the basic concepts of leo satellite networks and the handover research.  ian f. akyildiz huseyin uzunalioglu michael d. bender
the masc/bgmp architecture for inter-domain multicast routing multicast routing enables efficient data distribution to multiple recipients. however, existing work has concentrated on extending single-domain techniques to wide- area networks, rather than providing mechanisms to realize inter-domain multicast on a global scale in the internet.we describe an architecture for inter-domain multicast routing that consists of two complementary protocols. the multicast address-set claim (masc) protocol forms the basis for a hierarchical address allocation architecture. it dynamically allocates to domains multicast address ranges from which groups initiated in the domain get their multicast addresses. the border-gateway multicast protocol (bgmp), run by the border routers of a domain, constructs inter-domain bidirectional shared trees, while allowing any existing multicast routing protocol to be used within individual domains. the resulting shared tree for a group is rooted at the domain whose address range covers the group's address; this domain is typically the group initiator's domain. we demonstrate the feasibility and performance of these complementary protocols through simulation.this architecture, together with existing protocols operating within each domain, is intended as a framework in which to solve the problems facing the current multicast addressing and routing infrastructure. satish kumar pavlin radoslavov david thaler cengiz alaettinoglu deborah estrin mark handley
modeling tcp throughput: a simple model and its empirical validation in this paper we develop a simple analytic characterization of the steady state throughput, as a function of loss rate and round trip time for a bulk transfer tcp flow, i.e., a flow with an unlimited amount of data to send. unlike the models in [6, 7, 10], our model captures not only the behavior of tcp's fast retransmit mechanism (which is also considered in [6, 7, 10]) but also the effect of tcp's timeout mechanism on throughput. our measurements suggest that this latter behavior is important from a modeling perspective, as almost all of our tcp traces contained more time-out events than fast retransmit events. our measurements demonstrate that our model is able to more accurately predict tcp throughput and is accurate over a wider range of loss rates. jitendra padhye victor firoiu don towsley jim kurose
optical interference produced by artificial light  wireless infrared transmission systems for indoor use are affected by noise and interference induced by natural and artificial ambient light. this paper presents a characterisation (through extensive measurements) of the interference produced by artificial light and proposes a simple model to describe it. these measurements show that artificial light can introduce significant in-band components for systems operating at bit rates up to several mbit/s. therefore it is essential to include it as part of the optical wireless indoor channel. the measurements show that fluorescent lamps driven by solid state ballasts produce the wider band interfering signals, and are then expected to be the more important source of degradation in optical wireless systems.  adriano j. c. moreira rui t. valadas a. m. de oliveira duarte
reducing the cost of branches  pipelining is the major organizational technique that computers use to reach higher single-processor performance. a fundamental disadvantage of pipelining is the loss incurred due to branches that require stalling or flushing the pipeline. both hardware solutions and architectural changes have been proposed to overcome these problems. this paper examines a range of schemes for reducing branch cost focusing on both static (compile-time) and dynamic (hardware-assisted) prediction of branches. these schemes are investigated from quantitative performance and implementation viewpoints.1  s. mcfarling j. hennesey
proof of a fundamental result in self-similar traffic modeling we state and prove the following key mathematical result in self-similar traffic modeling: the superposition of many _on/off_ sources (also known as _packet trains_) with strictly alternating _on_\\- and _off_-periods and whose _on_-periods or _off_-periods exhibit the _noah effect_ (i.e., have high variability or infinite variance) can produce aggregate network traffic that exhibits the _joseph effect_ (i.e., is self-similar or long-range dependent). there is, moreover, a simple relation between the parameters describing the intensities of the noah effect (high variability) and the joseph effect (self-similarity). this provides a simple physical explanation for the presence of self-similar traffic patterns in modern high-speed network traffic that is consistent with traffic measurements at the source level. we illustrate how this mathematical result can be combined with modern high- performance computing capabilities to yield a simple and efficient linear-time algorithm for generating self-similar traffic traces.we also show how to obtain in the limit a levy stable motion, that is, a process with stationary and independent increments but with infinite variance marginals. while we have presently no empirical evidence that such a limit is consistent with measured network traffic, the result might prove relevant for some future networking scenarios. murad s. taqqu walter willinger robert sherman
multiprocessor/multiarchitecture microprocessor design (m3d)  the level of support for high level programming languages (hlpls), despite the claim of support by some of the newly introduced microprocessors, is inadequate despite the falling (rising) cost of hardware (software). computer systems that are to be used to run programs written exclusively in hlpls have a need for a multiprocessor/multiarchitecture microprocessor design (m3 samuel aletan william lively
apl and halstead's theory: a measuring tool and some experiments  we have designed and implemented an algorithm which measures apl-programs in the sense of software science by m.h. halstead /1/. the reader is assumed to be familiar with the theories of software science.  our purpose has been to find the best possible algorithm to automatically analyse large quantities of apl-programs. we have also used our measuring tool to make some experiments to find out if apl-programs and workspaces obey the laws of software science or not.  becasue our purpose was to analyse large quantities, i.e. hundreds of programs we have not implemented an algorithm, which gives exactly correct results from software science point of view, because this would necessitate manual clues to the analysing algorithm and thus an interactive mode of analysis. instead of it we have strived for a tool, which carries out the analysis automatically and as correctly as possible.  in the next section some difficulties encountered in the design of the measuring algorithm and some inherent limitations of it are discussed. section 3 summarises the sources of errors in the analysis carried out by our algorithm, while section 4 gives a more detailed description of the way analysis is carried out.  the remaining sections of this paper report on some experiments we have carried out using our measuring tool. the purpose of these experiments has been to evaluate the explaining power of halstead's theory in connection of apl- programs. however, no attempt has been made to process the results of the experiments statistically. the results of the experiments have been treated here only when 'obvious' (in)compatibilities between the theory and the results have been observed. possible reasons for the (in)compatibilities are also pointed out.  timo laurmaa markku syrjänen
a high capacity multihop packet cdma wireless network wireless multihop networks overlaid with cellular structure havethe potential to support high data rate internet traffic. in thispaper, we consider techniques by which the system capacity of suchnetworks can be increased. first, methods for increasing linkcapacity in single-user systems are explored. subsequently, weconsider a different set of techniques suitable for multiusersystems. we also investigate the effect of traffic dynamics onsystem capacity and ways to achieve the maximum throughput.finally, we present capacity bounds which illustrate how thosetechniques help in trading off the conserved power for capacityadvantage. ali nabi zadeh bijan jabbari
tcp-real: improving real-time capabilities of tcp over heterogeneous networks  we present a tcp-compatible and -friendly protocol which abolishes thr ee major shortfalls of tcp for reliable multimedia applications over heterogeneous networks: (i) ineffective bandwidth utilization, (ii) unnecessary congestion-oriented responses to wireless link errors (e.g., fading channels) and operations (e.g. handoffs), and (iii) wasteful window adjustments over asymmetric, low-bandwidth reverse paths. we propose tcp-real, a high-throughput transport protocol that minimizes transmission-rate gaps, thereby enabling better performance and reasonable playback timers. in tcp- real, the receiver decides with better accuracy about the appropriate size of the congestion window. slow start and timeout adjustments are used whenever congestion avoidance fails; however, rate and timeout adjustments are cancelled whenever the receiving rate indicates sufficient availability of bandwidth. we detail the protocol design and we report significant improvement on the performance of the protocol with time-constrained traffic, wireless link errors and asymmetric paths.  c. zhang v. tsaoussidis
cnmgraf - graphic presentation services for network management  two key problems in the design of systems and network management applications are: how to efficiently manage large quantities of related data, and how to allow the application user to view this data at a user-defined level of detail. this paper describes an architecture for network management facilities that may help solve these problems. it also describes cnmgraf (communications network management graphics facility), which was developed to test the presentation service model defined by this architecture.  richard s. gilbert wolfgang b. kleinöoder
the specifications and design of a distributed workstation (abstract only)  this project includes the development of a general system for transparent sharing and access of resources in a distributed is&amp;r; environment. the proposed pc-based distributed workstation (pcdws) prototype will give is&amp;r; users an integrated pc-based workstation environment for transparent access and sharing of resources available from both local and remote facilities. the pcdws will provide a robust personal computer workstation environment with a comprehensive set of tools as functional components to serve the users, as well as intercommunication and uploading/downloading protocols between workstations and remote mainframes as well as between workstations, thus providing access to multiple local and/or remote dbms and is&amp;r; systems.  frank chum
flexible routing and addressing for a next generation ip  due to a limited address space and poor scaling of backbone routing information, the internet protocol (ip) is rapidly reaching the end of its useful lifetime. the simple internet protocol plus (sipp), a proposed next generation internet protocol, solves these problems with larger internet layer addresses. in addition, sipp provides a number of advanced routing and addressing capabilities including mobility, extended (variable-length) addressing, provider selection, and certain forms of multicast. these capabilities are all achieved through a single mechanism, a generalization of the ip loose source route. we argue that, for reasons of simplicity and evolvability, a single powerful mechanism to achieve a wide range of routing and addressing functions is preferable to having multiple specific mechanisms, one for each function.  paul francis ramesh govindan
comments on "carry-over round robin: a simple cell scheduling mechanism for atm networks"  saha, mukherjee, and tripathi [1] present and analyze an atm cell scheduling algorithm called carry-over round robin. unfortunately, one of the basic lemmas in their paper, related to the performance of this algorithm, does not hold. this adversely affects the delay and fairness properties that they subsequently derive. to substantiate this, we briefly describe carry-over round robin and present a counterexample to the lemma. we end with some concluding remarks.  verus pronk jan korst
x-net: a dual bus fiber-optic lan using active switches  x-net is a new local area network based on the dual, unidirectional bus topology. stations are connected to two fiber-optic busses using active switches. at light load, x-net behaves as a random access scheme. with increasing load, transmissions are done in an orderly manner, arranged into cycles.  the main advantage of x-net is its superior channel utilization and delay performance, compared to other bus schemes. the packet delay is bounded at all loads. performance is shown to be satisfactory over a wide range of a values, where a is the ratio of end-to-end medium propagation delay to the packet transmission time. therefore, x-net is a suitable candidate for operation at high speeds.  a. e. kamal b. w. abeysundara
data path issues in a highly concurrent machine (abstract)  it is desirable to achieve high read bandwidths for the processing elements of highly concurrent sisd computers, both while keeping the register and memory write bandwidths low, and while keeping the interconnection networks simple. solutions to these problems are proposed, simulated, verified, and measured. new techniques called write elimination and write liberation are presented that also greatly reduce the complexity of the data cache. the elimination of addressable hardware registers is also achieved.  augustus k. uht darin b. johnson
tradeoffs for selection in distributed networks (preliminary version)  algorithms are presented for selecting an element of given rank from a set of elements distributed among the nodes of a network. network topologies considered are a ring, a mesh, and a complete binary tree. for the ring and the mesh, upper bound tradeoffs are identified between the number of messages transmitted and the total delay due to message transmission. for the tree, an algorithm is presented that uses an asymptotically optimal number of messages.  greg n. frederickson
interworking between digital european cordless telecommunications and a distributed packet switch  the digital european cordless telecommunications (dect) standard specifies an air interface. dect requires an external infrastructure to transfer information between wireless terminals, and to transfer information between a wireless terminal and a fixed network. the public switched telephone network, the gsm cellular network, private branch exchanges and mobile data networks are all under investigation as dect backbone networks. in this paper we look to the future and describe interworking between the dect air interface and a wireless network infrastructure referred to as a cellular packet switch. to achieve distributed network control, the cellular packet switch uses an ieee 802.6 metropolitan area network to link base stations, databases and fixed networks. in this paper we specify details of dect information transport on the metropolitan area network. we also give examples of network layer message flows for location updating and handover. the messages for other key procedures including call origination and release appear in a more detailed technical report.  sudarshan rao david j. goodman gregory p. pollini kathleen s. meier-hellstern
a model for the design of high performance protocols for a networked computing environment  the advent of high bandwidth local area networks means that it is now possible to interconnect large numbers of devices with widely differing processing capabilities in such a manner that the various devices may closely interact. before such a system may be realised, it is necessary to define a set of conventions to govern the way in which the network nodes interact with each other.  the triadic network model is introduced to describe the interactions between personal computers and high performance computers over a general purpose network by using a third classification of devices, whose purpose is to support the operation of the network as a distributed system. the model is not restricted to any particular network or operating system, but may form the interface between the two. hence, the use of a protocol set based on this model enables the provision of a uniform interface to the applications software. some of the principles of a protocol set developed from the triadic network model are presented in the paper.  gary d. law
pipelining and bypassing in a vliw processor (abstract)  this paper describes issues involved in the bypassing mechanism for a vliw processor and its relation to the pipeline structure of the processor. we will first describe the pipeline structure of our processor and analyze its performance and compare it to typical risc-style pipeline structures given the context of a processor with multiple functional units. next, we shall study the performance effects of various bypassing schemes in terms of their effectiveness in resolving pipeline data hazards and their effect on the processor cycle time.  arthur abnous nader bagherzadeh
wireless ad hoc multicast routing with mobility prediction  an ad hoc wireless network is an infrastructureless network composed of mobile hosts. the primary concerns in ad hoc networks are bandwidth limitations and unpredictable topology changes. thus, efficient utilization of routing packets and immediate recovery of route breaks are critical in routing and multicasting protocols. a multicast scheme, on-demand multicast routing protocol (odmrp), has been recently proposed for mobile ad hoc networks. odmrp is a reactive (on-demand) protocol that delivers packets to destination(s) on a mesh topology using scoped flooding of data. we can apply a number of enhancements to improve the performance of odmrp. in this paper, we propose a mobility prediction scheme to help select stable routes and to perform rerouting in anticipation of topology changes. we also introduce techniques to improve transmission reliability and eliminate route acquisition latency. the impact of our improvements is evaluated via simulation.  sung-ju lee william su mario gerla
sharing the "cost" of multicast trees: an axiomatic analysis given the need to provide users with reasonable feedback about the "costs" their network usage incurs, and the increasingly commercial nature of the internet, we believe that the allocation of cost among users will play an important role in future networks. this paper discusses cost allocation in the context of multicast flows. the question we discuss is this: when a single data flow is shared among many receivers, how does one split the cost of that flow among the receivers? multicast routing increases network efficiency by using a single shared delivery tree. we address the issue of how these savings are allocated among the various members of the multicast group. we first consider an axiomatic approach to the problem, analyzing the implications of different distributive notions on the resulting allocations. we then consider a one-pass mechanism to implement such allocation schemes and investigate the family of allocation schemes such mechanisms can support. shai herzog scott shenker deborah estrin
transport and control issues in multimedia wireless networks  it is not an easy task in the umts environment to effectively design the transport and the management of traffic belonging to multimedia teleservices among those defined by iturecommendations, due to the hard communication requirements which this kind of application can call for. in this paper the results of an overall research work, dealing with an effective management of "multimedia" and "multi-requirement" services in enhanced third-generation mobile radio systems, are presented. the contemporary use of several bearers, one for each traffic component of the service, is proposed as a reference scenario for the transport of multimedia services in future mobile radio environments. the effectiveness of this choice is guaranteed by providing for innovative control techniques, on top of a prma-based access protocol, ad-hoc developed to recognise and jointly manage the different parts of a unique multimedia traffic. for this aim, a two-level priority (static and dynamic priorities) mechanism is proposed to be adopted by the higher protocol levels of umts for the adaptation of call set-up, channel access, handover, and admission control procedures to the nature of multimedia services and for optimising the sharing of radio channel resources and the management of the reservation buffer. achieved results demonstrate that the priority-based mechanism shows good performance especially during periods in which the system traffic load is high and well reacts to the worsening of multimedia service quality, both in terms of information loss and synchronisation of its different traffic components.  antonio iera salvatore marano antonella molinaro
window selection in flow controlled networks  the end-to-end window scheme is a popular mechanism for flow and congestion control in packet switched networks. the window scheme may be implemented in the transport layer protocol (like in tcp), or in the source-to-destination protocol(like in arpanet), or in the network layer protocol (like x.25). in many implementations, the window size is chosen at connection set up time.  in this paper, we provide guidelines for window selection. specifically, we show that if the network becomes overloaded, that is, the offered load exceeds network capacity, then the selection of user windows has a critical impact on individual user throughputs. thus, user windows should be chosen judiciously, so as to satisfy a well defined "fairness" criterion.  we formulate the optimal window assignment as a mathematical programming problem, and show that the exact solution is computationally impractical because of the combinatorial nature of the problem and the complexity of the underlying multiple chain, closed network of queue model. we then develop a heuristic approach which is computationally very efficient and provides nearly optimal solutions. numerical results are provided to illustrate and validate the method.  mario geria h. w. chan