Virtual path bandwidth distribution and capacity allocation with bandwidth sharing

Broadband high-speed networks, such as B-ISDN, are expected to play a dominant role in the future of networking due to their capability to service a variety of traffic types with very different bandwidth requirements such as video, voice and data. to increase network efficiency in B-ISDN and other such connection oriented networks, the concept of a virtual path (VP) has been proposed and studied in the literature. A VP is a permanent or semi-permanent reservation of capacity between two nodes. Using VPs can potentially reduce call setup delays, simplify hardware, provide quality of service performance guarantees, and reduce disruption in the event of link or node failure.;In order to use VPs efficiently, two problems must be solved. With the objective of optimizing network performance, (1) the VPs must be placed within the network, and (2) network link capacity must be divided among the VPs. Most previous work aimed at solving these problems has focused on one problem in isolation of the other. at the same time, previous research efforts that have considered the joint solution of these problems have considered only restricted cases. In addition, these efforts have not explicitly considered the benefits of sharing bandwidth among VPs in the network.;We present a heuristic solution method for the joint problem of virtual path distribution and capacity allocation without many of the limitations found in previous studies. Our solution method considers the joint bandwidth allocation and VP placement problem and explicitly considers the benefits of shared bandwidth. We demonstrate that our algorithm out-performs previous algorithms in cases where network resources are limited. Because our algorithm provides shared bandwidth, solutions found by our algorithm will have a lower setup probability than a network that does not use VPs as well as a lower loss probability than provided by VPDBA solutions produced by previous algorithms. In addition, our algorithm provides fairness not found in solutions produced by other algorithms by guaranteeing that some service will be provided to each source-destination pair within the network

How to improve the peer review method: Free-selection vs assigned-pair protocol evaluated in a computer networking course

This study provides field research evidence on the efficiency of a “free-selection” peer review assignment protocol as compared to the typically implemented “assigned-pair” protocol. The study employed 54 sophomore students who were randomly assigned into three groups: Assigned-Pair (AP) (the teacher assigns student works for review to student pairs), Free-Selection (FS) (students are allowed to freely explore and select peer work for review), and No Review (NR) (control group). AP and FS student groups studied and reviewed peer work in the domain of Computer Networking, supported by a web-based environment designed to facilitate the two peer review protocols. Our results indicate that students following the Free Selection protocol demonstrate (a) better domain learning outcomes, and (b) better reviewer skills, compared to the AP condition. Overall, the study analyzes the benefits and shortcomings of the FS vs AP review assignment protocol, providing evidence that the FS condition can be multiply beneficial to students who engage in peer review activities