by

DOI: 10.1023/A:1019818712423
Print publication date: 9/1/2002
View article on SpringerLink

by Stadler, Rolf; Ulema, Mehmet

DOI: 10.1023/A:1021158428353
Print publication date: 9/1/2002
View article on SpringerLink

by Chang, Chi-Yuan; Kuo, Sy-Yen

This paper presents a new technique for constructing IP over photonic systems. The use of lable switching is assumed in the IP routers, while a new routing architecture is introduced to transport IP packets across an optical backbone network. The architecture is based on a two-level TDMA structure with wavelength division multiplexing (WDM). Many IP-based network applications such as high-resolution image, distributed database, and real-time video/audio service generally require high-speed transmissions in WAN/LAN. The network traffic in these applications usually exhibits traffic locality. As a result, traditional TDMA is not efficient for such traffic. Consequently, based on the traffic parameters such as locality and loading, an architecture named a PG (Partition-Group) Network is proposed. Furthermore, the interleaved control slot (ICS) with cross-group section (CGS) or non-cross-group section (NCGS) for reducing collisions is also presented. The slot reuse can be easily achieved by using the ICS scheme, and the slot utilization of the network can be improved within the high traffic locality.

DOI: 10.1023/A:1019866611514
Print publication date: 9/1/2002
View article on SpringerLink

by Al-Shaer, Ehab; Tang, Yongning

New network monitoring tools are necessary for supporting the deployment and the operations of multicast services on the Internet. Because of the peculiar characteristics of multicast routing (e.g., multicast forwarding trees) and the potential of message implosion problems, traditional network management tools are not sufficient for monitoring the quality of multicast delivery such as packet loss, delay, and jitter. Current multicast monitoring tools are either not scalable, limited in their functionality, or difficult to deploy in enterprise networks.In this paper, we present a new monitoring framework (called SMRM, SNMP-based multicast reachability monitoring) for multicast reachability based on SNMP. The SMRM framework is used for actively monitoring the health and the quality of service of multicast networks. SMRM provides a scalable real-time feedback on the packet loss, delay, and jitter of any selected segments of multicast delivery trees. In addition, NOC (network operations center) personnel can easily understand, deploy, and extend the SMRM framework in order to detect and isolate reachability and performance problems in multicast sessions. SMRM combines both distributed monitoring and centralized control, which offers scalability and simplicity. The integration of SMRM into SNMP is motivated by the wide distribution of SNMP agents in networks today, which significantly facilitates the deployment of SMRM is existing networks.

DOI: 10.1023/A:1019814627444
Print publication date: 9/1/2002
View article on SpringerLink

by Felstaine, Eyal; Cohen, Reuven; Hadar, Ofer

When an ATM node discovers that it cannot continue the setup of a virtual channel under the requested Quality of Service (QoS), it initiates a backtracking procedure called “crankback.” We propose a novel scheme, referred to as crankback prediction, that decreases the crankback overhead. Under the proposed scheme, nodes check during the connection admission control procedure whether the establishment of a virtual channel has a good chance to be admitted over the entire designated route. If this is not the case, crankback is initiated even before a particular QoS parameter is violated. The main idea behind the proposed scheme is to allocate a “quota” to the Peer Groups (PGs) along the message path, and then to suballocate this quota to the child PGs of these PGs. This process continues recursively until reaching the 1-level PG, which contains only physical nodes. The main advantage of the proposed scheme is that it lowers the setup delay and the processing and communication load imposed by signaling messages that establish unused portions of Virtual Channels (VCs)

DOI: 10.1023/A:1019862510606
Print publication date: 9/1/2002
View article on SpringerLink

by Boutaba, R.; Szeto, W.; Iraqi, Y.

This paper introduces DORA, a dynamic online routing algorithm for construction of bandwidth guaranteed paths in MPLS-enabled networks. The main objective of DORA is to place paths with reserved bandwidth evenly across the network in order to allow more future paths to be accepted into the network and to balance the traffic load. During path computation, the key operation in DORA is to avoid routing over links that (1) have high potential to be part of any other path, and (2) have low residual bandwidth available. Our simulation results based on unsuccessful path-setup ratio and successful path-reroutes upon link failure, show that DORA offers better performance than some sophisticated algorithms, while at the same time being less computationally expensive.

DOI: 10.1023/A:1019810526535
Print publication date: 9/1/2002
View article on SpringerLink

by Jiang, Jun; Papavassiliou, Symeon

Routing algorithms play a critical role in meeting both the stringent quality of service (QoS) requirements of guaranteed services and the certain QoS requirement of assured services over next-generation multiservice high-speed networks. In this paper, we propose the use of optimal least weight routing (OLWR) algorithm for routing QoS flows in high-speed networks. The main principle of our algorithm is that the choice of the most appropriate route is based on a set of parameters (least weight parameters) that estimate and consider the impact that the acceptance and routing decision of a call request belonging to a specific class would have on the network and other classes of service. Effective bandwidth, bandwidth and trunk reservation techniques, along with load balancing and packing trade-off considerations, are also introduced in the proposed routing algorithm. The performance evaluation of our algorithm is achieved via modeling and simulation of multiclass service routing in various network topologies. The performance results demonstrated that OLWR outperforms both the multihop least-loaded routing algorithms and the multihop most-loaded routing algorithms in terms of both revenue and carried load.

DOI: 10.1023/A:1019832809697
Print publication date: 9/1/2002
View article on SpringerLink

by Hasan, Masum Z.; Lu, Songwu

DOI: 10.1023/A:1021106425627
Print publication date: 9/1/2002
View article on SpringerLink

by Tsai, Wei K.; Iyer, Mahadevan; Ros, Jordi

The clouds (IP) versus strings (connection-oriented) debate over the Internet architecture is reexamined. Controllability and observability are shown to be the key to the performance (QoS) of the networks. The clouds architecture treats the network as a black box, making it uncontrollable and unobservable; in contrast, the strings architecture was designed to be a controllable and observable structure. In network management, the need for centralized management and control to obtain efficiency and optimal performance argues for strings architecture. Finally, TCP is shown to be unscalable in performance because of its poor observability and controllability.

DOI: 10.1023/A:1021102008788
Print publication date: 9/1/2002
View article on SpringerLink