by

DOI: 10.1023/B:JONS.0000034394.51096.32
Print publication date: 6/1/2004
View article on SpringerLink

by Boutaba, Raouf; Cho, Young-Hyun; Ejiri, Masayoshi; Kim, Seong-Beom

DOI: 10.1023/B:JONS.0000034296.50817.83
Print publication date: 6/1/2004
View article on SpringerLink

by

DOI: 10.1023/B:JONS.0000034217.00268.cc
Print publication date: 6/1/2004
View article on SpringerLink

by Ray, Indrajit; Tideman, Sonja

Transmission Control Protocol (TCP) connection migration has been previously proposed to allow for the mobility of servers. In this paper we revisit TCP connection migration for purposes of server survivability against malicious denial-of-service attacks. We present a protocol that allows an on-going TCP connection to be migrated from one server to another. This migration is performed in a secure manner such that the protocol itself cannot be exploited for malicious attacks. Further the migration can be performed even in the case where the original server is compromised. The protocol has been designed so as to allow interoperability with legacy TCP protocols. It is intended to be the transport layer foundations over which survivable applications can be built.

DOI: 10.1023/B:JONS.0000034216.28565.c7
Print publication date: 6/1/2004
View article on SpringerLink

by Zheng, Dongfang; Liu, Xian; Mandal, Mrinal; Lu, Weidong

Traffic control is a critical issue in connection-oriented packet-switching networks such as asynchronus transfer mode, Mutiprotocol Label Switching, and Internet Protocol with IntServ. In this paper, we present a generalized concept, the virtual traffic path (VTP), to characterize the traffic control problems in connection-oriented networks. The VTP distribution typically addresses logical network design based on the physical network, and involves both the call level and the flow level controls. To date, various VTP optimization schemes for connection-oriented networks have been proposed. However, most reported schemes are based on the conventional flow assignment model. In this paper, we propose an extended flow assignment model focusing on the connection-oriented service with a non-linear objective function. The proposed model incorporates two concepts: VTP capacity and VTP flow, to perform the optimization. This model distributes traffic on all available VTPs evenly and takes the redundant capacities into account. In addition, we introduce a stochastic programming methodology to allocate VTPs when the injected traffic changes stochastically. Experimental results show that the proposed model and the stochastic methodology can significantly improve the performance of networks.

DOI: 10.1023/B:JONS.0000034215.58853.91
Print publication date: 6/1/2004
View article on SpringerLink

by Tayama, Kenichi; Inoue, Takashi; Maruyama, Tsutomu; Uno, Hiroshi

An operation support system architecture has been developed for network element allocation in optical access networks (OANs). Rather than deploying OAN elements to meet all potential customer demand, which would be very costly, only enough elements to meet current demand are installed. These elements are then allocated during service provisioning. The sequence of element allocation and re-allocation is controlled because OANs consist of various types of elements, including outside fibers, inside fibers, and equipment. Functions are provided for allocating each type of element; also provided is an allocation integration function to control the element allocation processes. Moreover, an efficient process for allocating the elements has been determined: first, the outside fiber is allocated, then the equipment, and finally the inside fiber.

DOI: 10.1023/B:JONS.0000034214.43194.a7
Print publication date: 6/1/2004
View article on SpringerLink

by dos Santos, Aldri L.; Duarte, Elias P.; Keeni, Glenn M.

This paper presents a new clustering architecture for SNMP agents that supports semi-active replication of managed objects. A cluster of agents provides fault-tolerant object functionality: replicated managed objects of a crashed agent of a given cluster may be accessed through a peer cluster. The proposed architecture is structured in three layers. The lower layer corresponds to the managed objects at the network elements. The middle layer contains management entities called clusters that monitor and replicate managed objects. The upper layer allows the definition of management clusters as well as the relationship between clusters. A practical tool was implemented and is presented. The impact of replication on network performance is evaluated as well as a probabilistic analysis of replicated object consistency.

DOI: 10.1023/B:JONS.0000034213.75955.8b
Print publication date: 6/1/2004
View article on SpringerLink

by Thaler, David G.; Ravishankar, Chinya V.

In this paper, we explore the constraints of a new problem: that of coordinating network troubleshooting among peer administrative domains and untrusted observers. Our approach permits any entity to report problems, whether it is a Network Operations Center (NOC), end-user, or application. Our goals are to define the inter-domain coordination problem clearly, and to develop an architecture which allows observers to report problems and receive timely feedback, regardless of their own locations and identities. By automating this process, we also relieve human bottlenecks at help desks and NOCs whenever possible. We present a troubleshooting approach for coordinating problem diagnosis, and describe Global Distributed Troubleshooting (GDT), a distributed protocol which realizes this approach. We show through simulation that GDT scales well as the number of observers and problems grows.

DOI: 10.1023/B:JONS.0000034212.53702.30
Print publication date: 6/1/2004
View article on SpringerLink

by da Fonseca, Nelson L. S.; Yunes, Sergio A.

This paper introduces a novel policing mechanism, called Packet Leaky Bucket in which all cells of a frame are marked with the same level of priority. Moreover, it discusses the need for having a frame discard mechanism in cell-switched networks when frame-oriented policing mechanisms are used.

DOI: 10.1023/B:JONS.0000034211.16065.d3
Print publication date: 6/1/2004
View article on SpringerLink