1,218 research outputs found

    Limits To Certainty in QoS Pricing and Bandwidth

    Get PDF
    Advanced services require more reliable bandwidth than currently provided by the Internet Protocol, even with the reliability enhancements provided by TCP. More reliable bandwidth will be provided through QoS (quality of service), as currently discussed widely. Yet QoS has some implications beyond providing ubiquitous access to advance Internet service, which are of interest from a policy perspective. In particular, what are the implications for price of Internet services? Further, how will these changes impact demand and universal service for the Internet. This paper explores the relationship between certainty of bandwidth and certainty of price for Internet services over a statistically shared network and finds that these are mutually exclusive goals.Comment: 29th TPRC Conference, 200

    Optimal distributed routing for virtual line-switched data networks

    Get PDF
    Bibliography: p. 35."September 1978."Supported by the Advanced Research Project Agency (monitored by ONR) under Contract no. N00014-75-C-1183Adrian Segall

    On Call Migration

    Get PDF
    In an environment where network resources are reserved e.g, telephone networks, the path with smallest number of hops is preferred and other alternate paths are used only when there the shortest path is full. However if the alternate path is longer more network resources are devoted to the circuit and this in turn could worsen the situation. Circuit migration is a solution to reduce the amount of resources inefficiently used due to alternate routing in connection oriented networks. By rerouting a circuit when its shortest path becomes available, one can smooth out the congestion and increases the utilization of the network. The overhead of circuit migration is comparable to call set up and the tradeoff of circuit migration is improvement in performance vs. some additional call processing capacity. In this report we will focus on the above tradeoff, evaluating it analytically and by simulation on a completely connected topology. Our initial results indicate that migration could improve the performance of the network at high load but it has to be done very often. Such a large amount of overhead could be expensive enough to offset the gain in performance. On further investigation, we discover that threshing can also occur in circuit migration. We proposed two solutions to the problem. The first solution is to migrate only when the shortest path is no longer highly utilized. The second solution migrates a circuit only if its path is congested. A hybrid solution using the two above is also examined. We will also address the reordering problem that could occur when a circuit is transferred to a new path

    Comparison Analysis Of Recovery Mechanism At Mpls Network

    Get PDF
    Multi-protocol Label Switching (MPLS) has become an attractive technology of choice for Internet backbone service providers.  MPLS features the ability to perform traffic engineering and provides support for Quality of Service traffic provisioning. To deliver reliable service, MPLS requires a set of procedures to provide protection for the traffic carried on Label Switched Paths (LSP). In this case Lable Switched Routers (LSRS) supports recovery mechanism when failure happened in the network.This paper studied about performance from usage of different techniques that can be used to reroute traffic faster then  the current IP rerouting methods in the case of a failure in a network. Local rerouting, fast reroute one to one backs up, Haskin, PSL oriented path protection and 1+1 path protection recovery mechanism was compared by given of aggregate traffic which has self-similarity character. Packet drop, rejection probability, recovery time, service disruption time and pre-reserved resources backup will be made as comparator parameter with various bitrate and different position of link failure. Packet loss, rejection probability, recovery time and service disruption time at five recovery mechanisms influenced by position of link failure to ingress. 1+1 path protection mechanism has least packet drop, but costliest way to do recovery in the case of usage resources, as traffic is sent simultaneously in two paths which disjoint. Fast reroute one to one backup is quickest way to operate protection switching recovery after 1+1 path protection mechanism. Keywords: MPLS, recovery, rerouting, self-similar traffic, protection switchingDOI:http://dx.doi.org/10.11591/ijece.v1i2.8

    A Scalable and Adaptive Network on Chip for Many-Core Architectures

    Get PDF
    In this work, a scalable network on chip (NoC) for future many-core architectures is proposed and investigated. It supports different QoS mechanisms to ensure predictable communication. Self-optimization is introduced to adapt the energy footprint and the performance of the network to the communication requirements. A fault tolerance concept allows to deal with permanent errors. Moreover, a template-based automated evaluation and design methodology and a synthesis flow for NoCs is introduced

    An efficient handoff management scheme for mobile wireless ATM networks

    Get PDF
    A new handoff management scheme for wireless ATM networks is proposed. In this scheme, all cells are connected to their neighboring cells by permanent virtual circuits (PVCs) and to the access switch (AS) by switched virtual circuits (SVCs) which are only for new calls. Some carefully chosen cells, called rerouting cells, are also connected to the AS by PVCs. In summary, if a mobile roams to an ordinary neighboring cell, its traffic path is simply elongated by a PVC connecting the old and new cells. If a mobile roams to a rerouting cell, its traffic path is rerouted to a PVC between the AS and rerouting cell. By using PVC's for handoff calls, we can guarantee fast and seamless handoff. At the same time, our scheme improves the path efficiency by limiting the maximum number of hops that a path can be extended. Also, allowing path rerouting at a suitable time means the network resources are more efficiently utilized.published_or_final_versio

    On-board processing satellite network architecture and control study

    Get PDF
    For satellites to remain a vital part of future national and international communications, system concepts that use their inherent advantages to the fullest must be created. Network architectures that take maximum advantage of satellites equipped with onboard processing are explored. Satellite generations must accommodate various services for which satellites constitute the preferred vehicle of delivery. Such services tend to be those that are widely dispersed and present thin to medium loads to the system. Typical systems considered are thin and medium route telephony, maritime, land and aeronautical radio, VSAT data, low bit rate video teleconferencing, and high bit rate broadcast of high definition video. Delivery of services by TDMA and FDMA multiplexing techniques and combinations of the two for individual and mixed service types are studied. The possibilities offered by onboard circuit switched and packet switched architectures are examined and the results strongly support a preference for the latter. A detailed design architecture encompassing the onboard packet switch and its control, the related demand assigned TDMA burst structures, and destination packet protocols for routing traffic are presented. Fundamental onboard hardware requirements comprising speed, memory size, chip count, and power are estimated. The study concludes with identification of key enabling technologies and identifies a plan to develop a POC model
    corecore