136 research outputs found

    Cost-based burst dropping strategy in optical burst switching networks

    Get PDF
    Optical burst switching (OBS) is a new paradigm for future all-optical networks. Intentional burst dropping is one of techniques used to achieve desired quality of service. In this paper we note that some bursts are more likely to cause contention. We propose a cost function that can be used to predict the likelihood that a given burst will interfere with other traffic, then we explain how, by using this information a new burst dropping strategy can be designed. We compare our method with a random burst dropping technique and show that the cost-based approach offers a significant performance improvement

    Connectivity aware routing - a method for finding bandwidth constrained paths over a variety of network topologies

    Get PDF
    Multimedia traffic and real-time e-commerce applications can experience quality degradation in traditional networks such as the Internet. These difficulties can be overcome in networks which feature dynamically set up paths with bandwidth and delay guarantees. The problem of selecting such constrained paths is the task of quality of service (QoS) routing. Researchers have proposed several ways of implementing QoS routing, preferring either mechanisms which distribute network load or algorithms which conserve resources. Our previous studies have shown that network connectivity is an important factor when deciding which of these two approaches gives the best performance. In this paper we propose an algorithm, which features both load distribution and resource conservation. It takes a hybrid approach which balances between these two extreme approaches, according to the level of network connectivity. Our simulations indicate that this algorithm offers excellent performance over a than existing algorithms

    MENU: multicast emulation using netlets and unicast

    Get PDF
    High-end networking applications such as Internet TV and software distribution have generated a demand for multicast protocols as an integral part of the network. This will allow such applications to support data dissemination to large groups of users in a scalable and reliable manner. Existing IP multicast protocols lack these features and also require state storage in the core of the network which is costly to implement. In this paper, we present a new multicast protocol referred to as MENU. It realises a scalable and a reliable multicast protocol model by pushing the tree building complexity to the edges of the network, thereby eliminating processing and state storage in the core of the network. The MENU protocol builds multicast support in the network using mobile agent based active network services, Netlets, and unicast addresses. The multicast delivery tree in MENU is a two level hierarchical structure where users are partitioned into client communities based on geographical proximity. Each client community in the network is treated as a single virtual destination for traffic from the server. Netlet based services referred to as hot spot delegates (HSDs) are deployed by servers at "hot spots" close to each client community. They function as virtual traffic destinations for the traffic from the server and also act as virtual source nodes for all users in the community. The source node feeds data to these distributed HSDs which in turn forward data to all downstream users through a locally constructed traffic delivery tree. It is shown through simulations that the resulting system provides an efficient means to incrementally build a source customisable secured multicast protocol which is both scalable and reliable. Furthermore, results show that MENU employs minimal processing and reduced state information in networks when compared to existing IP multicast protocols

    Generating Representative ISP Technologies From First-Principles

    Full text link
    Understanding and modeling the factors that underlie the growth and evolution of network topologies are basic questions that impact capacity planning, forecasting, and protocol research. Early topology generation work focused on generating network-wide connectivity maps, either at the AS-level or the router-level, typically with an eye towards reproducing abstract properties of observed topologies. But recently, advocates of an alternative "first-principles" approach question the feasibility of realizing representative topologies with simple generative models that do not explicitly incorporate real-world constraints, such as the relative costs of router configurations, into the model. Our work synthesizes these two lines by designing a topology generation mechanism that incorporates first-principles constraints. Our goal is more modest than that of constructing an Internet-wide topology: we aim to generate representative topologies for single ISPs. However, our methods also go well beyond previous work, as we annotate these topologies with representative capacity and latency information. Taking only demand for network services over a given region as input, we propose a natural cost model for building and interconnecting PoPs and formulate the resulting optimization problem faced by an ISP. We devise hill-climbing heuristics for this problem and demonstrate that the solutions we obtain are quantitatively similar to those in measured router-level ISP topologies, with respect to both topological properties and fault-tolerance

    Information diffusion on realistic networks

    No full text
    Prix du meilleur article étudiantNational audienceLes modèles de diffusion d'information mettent traditionnellement en jeu un réseau sous-jacent dont la topologie reproduit certaines propriétés observées dans les réseaux réels. Toutefois, la comparaison des phénomènes de diffusion observés sur des réseaux générés par des modèles classiques avec ceux se produisant au sein de réseaux réels reste peu étudiée. Dans une démarche empiriste, nous proposons dans cette étude d'évaluer l'écart de comportement induit par l'utilisation de divers modèles stylisés, dont notamment certains réseaux dits ``sans-échelle''
    corecore