@INPROCEEDINGS{Gay01:Real,
AUTHOR="Mark Gaynor and Scott Bradner",
TITLE="The Real Options Approach to Standardization",
BOOKTITLE="Hawaii International Conference on Systems Sciences",
INSTITUTION="Harvard University",
ADDRESS="Hawaii",
YEAR=2001,
REFERENCES=27,
KEYWORDS="standardization",
ABSTRACT="In this paper, we propose a new model of technology
standardization under market uncertainty and show how its value is
quantifiable using the theory of real options.  Our options-based
approach to standardization shows that a rational way to standardize
some IT technology in uncertain markets is with correct structure and
proper staging of the standard.  First, highly modularized standards
provide a higher option value because of the ability to pick and choose
the best modules to change at a fine granularity.  Secondly, a modular
structure that promotes easy and non-disruptive parallel experimentation
(such as end-2-end applications) enhances the option value by providing
a larger field of options from which to select.  Lastly, allowing the
standard to evolve along with the customers' expectations of the
technology is a good strategy to match standards with uncertain user
markets.",
URL="http://www.eecs.harvard.edu/~gaynor/ITS-copyright.pdf",
}

@BOOK{Sun01:Compressed,
TITLE="Compressed Video over Networks",
EDITOR="Ming-Ting Sun and Amy Reibman",
ISBN="0-8247-9423-0",
PUBLISHER="Marcel Dekker",
ADDRESS="New York",
YEAR=2001,
KEYWORDS="packet video; Internet",
}

@INCOLLECTION{Schu01:IP,
AUTHOR="Henning Schulzrinne",
TITLE="{IP} Networks",
BOOKTITLE="Compressed Video Over Networks",
EDITOR="Amy Reibman and Ming-Ting Sun",
ISBN="0-8247-9423-0",
PUBLISHER="Marcel Dekker",
YEAR=2001,
KEYWORDS="IPv4; RSVP; video measurements; SIP; RTP",
}

@BOOK{Proc01:Practical,
AUTHOR="Paul E. Proctor",
TITLE="The Practical Intrusion Detection Handbook",
ISBN="0-13-025960-8",
PUBLISHER="Prentice Hall",
ADDRESS="Upper Saddle River, New Jersey",
YEAR=2001,
KEYWORDS="security; intrusion detection",
}

@BOOK{John01:SIP,
AUTHOR="Alan Johnston",
TITLE="{SIP:} Understanding the Session Initiation Protocol",
ISBN=1580531687,
PUBLISHER="Artech House",
YEAR=2001,
KEYWORDS="SIP; Internet telephony",
}

@MISC{Gemm01:Gaze,
AUTHOR="Jim Gemmell",
TITLE="Gaze-corrected video conferencing",
YEAR=2001,
KEYWORDS="video conferencing",
ABSTRACT="Corrects for gaze via image manipulation (eye cutout, head
translation).",
URL="http://research.microsoft.com/barc/telepresence/GazeMaster.htm",
}

@TECHREPORT{Cisc01:IP,
AUTHOR="{Cisco Systems}",
TITLE="{IP} Telephony Solutions Guide",
INSTITUTION="Cisco",
YEAR=2001,
KEYWORDS="Internet telephony; dimensioning",
ABSTRACT="Describes traffic and other issues for implementing IP
telephony.",
URL="http://www.cisco.com/warp/public/788/solution\_guide/",
}

@TECHREPORT{Inte01:ProShare,
AUTHOR="Intel",
TITLE="ProShare® Video Traffic -- A Traffic Engineering Model for {LAN}
Video Conferencing",
INSTITUTION="Intel",
YEAR=2001,
KEYWORDS="Traffic engineering; video conferencing; load factor",
URL="http://support.intel.com/support/proshare/8150.htm",
}

@TECHREPORT{Wire01:Position,
AUTHOR="Wireless Campus Networking Working Group",
TITLE="Position Paper on {WLAN} Radio Frequency Interference Issues",
TYPE="Position Paper",
INSTITUTION="net-at-edu",
YEAR=2001,
KEYWORDS="Wireless networks; wireless Ethernet",
ABSTRACT="The purpose of this position paper is to inform campus
decision makers about a critical issue associated with operating IEEE
802.11b wireless networks (WLANs).  It is not intended to encourage nor
discourage deployment of wireless networks but rather to educate
interested parties on the issue of radio frequency (RF) congestion and
interference problems when operating spread spectrum wireless systems.",
URL="http://www.educause.edu/ir/library/pdf/NET0014.pdf",
}

@BOOK{Hanz01:Voice,
AUTHOR="Lajos Hanzo and F. C.A. Somerville and J. P. Woodard",
TITLE="Voice Compression and Communications: Principles and Applications
for Fixed and Wireless Channels",
PUBLISHER="Wiley",
YEAR=2001,
KEYWORDS="speech coding; mobile telephony; telephony; packet audio;
MOS",
URL="http://www-mobile.ecs.soton.ac.uk/books/",
}

@TECHREPORT{3GPP01:Performance,
AUTHOR="3GPP",
TITLE="Performance Characterization of the {AMR} Speech Codec",
TYPE="Technical Specification",
INSTITUTION="3GPP",
NUMBER="TR 26.975 V3.0.0 (20",
YEAR=2001,
KEYWORDS="AMR; packet speech; voice coding; MOS",
ABSTRACT="This technical report provides background information on the
performances of the Adaptive Multi-Rate (AMR) speech codec. Experimental
test results from the Verification and Characterization phases of
testing are reported to illustrate the behavior of AMR in multiple
operational conditions.",
URL="http://www.quintillion.co.jp/3GPP/Specs/26975-300.pdf",
}

@TECHREPORT{Cao01:Internet,
AUTHOR="Jin Cao and William Cleveland and Dong Lin and Don Sun",
TITLE="{Internet} Traffic Tends To Poisson and Independent as the Load
Increases",
TYPE="Bell Labs Tech Report",
INSTITUTION="Bell Labs",
ADDRESS="Murray Hill, New Jersey",
YEAR=2001,
KEYWORDS="traffic characterization; Poisson model; Internet traffic",
ABSTRACT="The burstiness of Internet traffic was established in
pioneering work in the early 1990s, which demonstrated that packet
arrival times are not Poisson, and packet and byte counts in
fixed-length intervals are long-range dependent. Here we demonstrate
that these results are one end of a continuum of traffic
characteristics. At the other end are Poisson behavior and independence.
Our study focuses on packets, what devices actually see; we study the
statistical properties of packet inter-arrival times and packet sizes.
As the traffic load increases --- that is, as the number of simultaneous
transport connections increases --- arrivals tend to Poisson and sizes
tend to independence. More specifically, long-range dependence of
inter-arrivals and sizes decreases to independence, and the marginal
distribution of inter-arrivals tends toward exponential; this happens
(1) through time on a single link as the load increases due to daily
variation, or (2) at a single point in time as the load increases going
from lightly loaded links at the edges of the Internet to heavily loaded
links at the core. Convergence is rapid; the packet traffic gets quite
close to Poisson and independent loads far less than the maximum we
observe.",
URL="http://cm.bell-labs.com/stat/doc/ip.poissonindependent.pdf",
}

@TECHREPORT{Cao01:Scalable,
AUTHOR="Jin Cao and D. H. Davis and Scott Vander Wiel and Bin Yu and
Zhengyuan Zhu",
TITLE="A Scalable Method for Estimating Network Traffic Matrices from
Link Counts",
TYPE="Bell Labs Tech Report",
INSTITUTION="Bell Labs",
ADDRESS="Murray Hill, New Jersey",
YEAR=2001,
KEYWORDS="traffic matrix; traffic characterization",
ABSTRACT="Traffic matrices are extremely useful for network
configuration, management, engineering, and pricing. Direct measurement
is, however, expensive in general and impossible in some cases. This
paper proposes a scalable algorithm for statistically estimating a
traffic matrix from the readily available link counts. It relies on a
divide-and-conquer strategy to lower the computational cost without
losing estimation accuracy. The proposed algorithm is tested on a real
network with 18 nodes. The estimates are comparable to the direct
estimates but require dramatically less computation.",
URL="http://cm.bell-labs.com/stat/doc/trafficmatrix.ps",
}

@ARTICLE{Schw0101:Engineering,
AUTHOR="Daniel Schwabe and Luiselena Esmeraldo and Gustavo Hector Rossi
and Fernando Lyardet",
TITLE="Engineering Web Applications for Reuse",
JOURNAL=ieeemm,
VOLUME=8,
NUMBER=1,
MONTH="January--March",
YEAR=2001,
ABSTRACT="Web design frameworks combine generic conceptual,
navigational, and context schemas. Such frameworks offer developers a
conceptual approach to maximize design reuse, rather than code reuse, in
Web applications. The authors apply the object-oriented hypermedia
design extension, OOHDM-Frame, to determine key architectural components
and design structures that lend themselves to reuse.",
URL="http://www.computer.org/multimedia/mu2001/u1toc.htm",
}

@ARTICLE{Goes0101:Client,
AUTHOR="Karl M. Goeschka and Markus W. Schranz",
TITLE="Client and Legacy Integration in Object-Oriented Web
Engineering",
JOURNAL=ieeemm,
VOLUME=8,
NUMBER=1,
MONTH="January--March",
YEAR=2001,
ABSTRACT="To be successful, e-commerce and Web information systems
depend on systematic analysis and design processes. Even more important,
the authors' method is based on standard techniques like UML, XML, and
Corba and allows for the integration of different kinds of clients from
Java over HTML to WAP into a distributed environment. Through the smooth
integration of highly heterogeneous legacy software and databases, the
authors' object-oriented Web design provides techniques to achieve this
goal.",
URL="http://www.computer.org/multimedia/mu2001/u1toc.htm",
}

@ARTICLE{Lara01:Constructing,
AUTHOR="Juan de Lara and Manuel Alfonseca",
TITLE="Constructing Simulation-Based Web Documents",
JOURNAL=ieeemm,
VOLUME=8,
NUMBER=1,
MONTH="January--March",
YEAR=2001,
ABSTRACT="The authors present a system for constructing Web documents
that features visual interactive simulations and other hypermedia
elements. It uses a continuous simulation language composed of
abstraction layers that describe the simulation models' behavior, pages
or slides, and courses, articles, or presentations. The methods and
tools presented stress key points in the development of Web-based
applications such as maintainability, reusability integration, and easy
testing.",
URL="http://www.computer.org/multimedia/mu2001/u1toc.htm",
}

@ARTICLE{Kird0101:Experiences,
AUTHOR="Engin Kirda and Mehdi Jazayeri and Clemens Kerer and Markus W.
Schranz",
TITLE="Experiences in Engineering Flexible Web Services",
JOURNAL=ieeemm,
VOLUME=8,
NUMBER=1,
MONTH="January--March",
YEAR=2001,
ABSTRACT="The life cycle of Web service includes analysis, design,
implementation, and maintenance stages. The majority of existing Web
tools only address the implementation phase and lack support for other
stages. The authors' experiences in building and maintaining the annual
Vienna International Festival's Web site have led them to create
engineering tools that cover all phases of the life cycle.",
URL="http://www.computer.org/multimedia/mu2001/u1toc.htm",
}

@ARTICLE{Gmez0104:Conceptual,
AUTHOR="Jaime Gómez and Cristina Cachero and Oscar Pastor",
TITLE="Conceptual Modeling of Device-Independent Web Applications",
JOURNAL=ieeemm,
VOLUME=8,
NUMBER=2,
MONTH="April--June",
YEAR=2001,
ABSTRACT="Existing tools for building and deploying complex Web sites
are inadequate for dealing with the software production process that
involves connecting with underlying logic in a unified and systematic
way. As a solution, we propose the OO-H method, an object-oriented
software approach that captures relevant properties involved in modeling
and implementing Web application interfaces.",
URL="http://www.computer.org/multimedia/mu2001/u2toc.htm",
}

@ARTICLE{Ricc0104:Understanding,
AUTHOR="Filippo Ricca and Paolo Tonella",
TITLE="Understanding and Restructuring Web Sites with ReWeb",
JOURNAL=ieeemm,
VOLUME=8,
NUMBER=2,
MONTH="April--June",
YEAR=2001,
ABSTRACT="The authors investigated automatic and semiautomatic Web site
analysis with our tool ReWeb, focusing on a site's architecture and
evolution. Their case study demonstrates how ReWeb addresses the need to
support Web site maintenance and evolution while retaining and possibly
improving quality.",
URL="http://www.computer.org/multimedia/mu2001/u2toc.htm",
}

@ARTICLE{Barr0104:Multimedia,
AUTHOR="Chris Barry and Michael Lang",
TITLE="A Survey of Multimedia and Web Development Techniques and
Methodology Usage",
JOURNAL=ieeemm,
VOLUME=8,
NUMBER=2,
MONTH="April--June",
YEAR=2001,
ABSTRACT="The authors' survey results suggest that no uniform approach
exists to multimedia systems development and that practitioners aren't
using the multimedia models cited in the literature. They conclude that
developers need new techniques that capture requirements and integrate
them within a systems development framework.",
URL="http://www.computer.org/multimedia/mu2001/u2toc.htm",
}

@ARTICLE{Klap0104:Semantics,
AUTHOR="Reinhold Klapsing and Gustaf Neumann and Wolfram Conen",
TITLE="Semantics in Web Engineering: Applying the Resource Description
Framework",
JOURNAL=ieeemm,
VOLUME=8,
NUMBER=2,
MONTH="April--June",
YEAR=2001,
ABSTRACT="The authors present an extensible Web modeling framework that
applies the Resource Description Framework to Web engineering, providing
an interoperable exchange format. Their framework uses the same (meta)
data model to specify a Web application's structure and content, to make
statements about a Web application's elements, and to reason about the
data and metadata.",
URL="http://www.computer.org/multimedia/mu2001/u2toc.htm",
}

@ARTICLE{Naga0104:Semantic,
AUTHOR="Katashi Nagao and Yoshinari Shirrai and Kevin Square",
TITLE="Semantic Annotation and Transcoding: Making Web Content More
Accessible",
JOURNAL=ieeemm,
VOLUME=8,
NUMBER=2,
MONTH="April--June",
YEAR=2001,
ABSTRACT="The authors propose a method for constructing a superstructure
on the Web using XML and external annotations to Web documents. They
have three approaches for annotating documents-linguistic, commentary,
and multimedia. The result is annotated documents that computers can
understand and process more easily, allowing content to reach a wider
audience with minimal overhead.",
URL="http://www.computer.org/multimedia/mu2001/u2toc.htm",
}

@ARTICLE{Desh0104:Web,
AUTHOR="Yogesh Deshpande and Steve Mark Hansen",
TITLE="Web Engineering: Creating a Discipline among Disciplines",
JOURNAL=ieeemm,
VOLUME=8,
NUMBER=2,
MONTH="April--June",
YEAR=2001,
ABSTRACT="Web engineering is a discipline among disciplines, cutting
across computer science, information systems, and software engineering,
as well as benefitting from several non-IT specializations. Intertwining
so many disciplines presents a unique problem for organization and
development. Here the authors discuss Web engineering's classification,
define its characteristics, and contrast its present issues with
previous problems in information technology.",
URL="http://www.computer.org/multimedia/mu2001/u2toc.htm",
}

@ARTICLE{Turn0104:Comprehensive,
AUTHOR="David A. Turner and Keith W. Ross",
TITLE="A Comprehensive Architecture for Continuous Media Email",
JOURNAL=ieeemm,
VOLUME=8,
NUMBER=2,
MONTH="April--June",
YEAR=2001,
ABSTRACT="Continuous media email has numerous advantages over plain text
email. The authors propose solutions to the key problems resulting from
sender-stored delivery of continuous media email that have prevented
implementation. To address quality of service, message deletion, and
forwarding and replying problems, they advocate an integrated sender-
and recipient-stored delivery approach.",
URL="http://www.computer.org/multimedia/mu2001/u2toc.htm",
}

@BOOK{McKn01:Internet,
TITLE="{Internet} Telephony",
EDITOR="Lee McKnight and William H. Lehr and David D. Clark",
ISBN="0-262-13385-7",
PUBLISHER="The MIT Press",
ADDRESS="Cambridge, Massachusetts",
YEAR=2001,
KEYWORDS="Internet telephony",
}

@MISC{Tele01:International,
AUTHOR="Telegeography",
TITLE="International Bandwidth 2001",
YEAR=2001,
KEYWORDS="bandwidth; Internet; fiber; satellite; capacity;
transatlantic; transpacific",
ABSTRACT="Describes international bandwidth costs and availability, for
fiber and satellite.",
URL="http://www.telegeography.com",
}

@ARTICLE{Bouc0106:Why,
AUTHOR="Anna Bouch and M. Angela Sasse",
TITLE="Why Value Is Everything: A User-Centered Approach to {Internet}
Quality of Service and Pricing",
JOURNAL="Lecture Notes in Computer Science",
VOLUME=2092,
PAGES="59-72",
NOTE="International Workshop on Quality of Service (IWQoS)",
YEAR=2001,
ABSTRACT="To create acceptable levels of Quality of Service (QoS),
designers need to be able to predict users’behaviour in response to
different levels of QoS. However, predicting behaviour requires an
understanding of users’requirements for specific tasks and contexts.
This paper reports qualitative and experimental research that
demonstrates that future network service must be based on an old
principle: service and its associate cost must represent value in terms
of the contribution it makes to customers’goals. Human Computer
Interaction (HCI) methods can be applied to identify users’goals and
associated QoS requirements. Firstly, we used a qualitative approach to
establish the mental concepts that users apply when assessing network
services and charges. The subsequent experimental study shows that users
require certain types of feedback at the user interface to predict
future levels of quality. Price alone cannot be used to regulate demand
for QoS.",
URL="http://link.springer-ny.com/link/service/series/0558/tocs/t2092.htm",
}

@ARTICLE{Mann0106:Extended,
AUTHOR="Jukka M J Manner and Kimmo E.E. Raatikainen",
TITLE="Extended Quality-of-Service for Mobile Networks",
JOURNAL="Lecture Notes in Computer Science",
VOLUME=2092,
PAGES="275-280",
NOTE="International Workshop on Quality of Service (IWQoS)",
YEAR=2001,
ABSTRACT="Guaranteed QoS for multimedia applications is based on
reserved resources in each intermediate node on the whole end-to-end
path. This can be achieved more effectively for stationary nodes than
for mobile nodes. Many multimedia applications become useless if the
continuity is disturbed due to end-to-end or slow re-reservations of
resources each time a mobile node moves so that its point-of-presence in
the IP network changes. Additionally, due to lack of QoS support from
the correspondent node, mobile nodes would need a way to reserve at
least local resources, especially wireless link resources. This paper
proposes small modifications to the standard Internet resource
reservation protocol, RSVP, so that initial resource reservations and
re-reservations due to terminal mobility can often be done locally in an
access network. This is clearly a significant improvement to the current
RSVP.",
URL="http://link.springer-ny.com/link/service/series/0558/tocs/t2092.htm",
}

@ARTICLE{Eklu0101:IP,
AUTHOR="Carl Eklund and Jarmo T. Mäkinen and Tero Ojanperä and Juha
Pihlaja",
TITLE="{IP} optimized broadband wireless access",
JOURNAL=jhsn,
VOLUME=10,
NUMBER=1,
PAGES="7-17",
NOTE="International Workshop on Quality of Service (IWQoS)",
YEAR=2001,
ABSTRACT="Broadband Wireless Access(BWA)is moving into the IP era. New
open interoperability standards for millimeter wave
point-to-multipoint(PMP)radios, IEEE802.16 and HiperAccess, are being
developed enabling low cost, mass-market systems. In this paper PMP
standardization, regulation, service requirements and system design will
be discussed.",
URL="http://www.iospress.nl/site/html/09266801.html",
}

@ARTICLE{Kuma0101:Network,
AUTHOR="Apurva Kumar and Lakshmi Ramachandran and Rajeev Shorey",
TITLE="Performance of network formation and scheduling algorithms in the
Bluetooth wireless ad-hoc network",
JOURNAL=jhsn,
VOLUME=10,
NUMBER=1,
PAGES="59-76",
NOTE="International Workshop on Quality of Service (IWQoS)",
YEAR=2001,
KEYWORDS="Bluetooth technology; scatternet; piconet; device discovery;
inquiry; paging; scheduling; cluster; topology; Media Access
Control(MAC); Time Division Duplex(TDD); TCP; IP; UDP; utilization;
throughput; end-to-end delays",
ABSTRACT="Bluetooth is a promising new technology for short range, low
power, low cost, pico-cellular wireless connectivity between mobile
devices. Efficient clustering or topology construction algorithms play a
very important role in the fast connection establishment of such
networks. The performance of these algorithms is mainly dependent on the
device discovery time, i.e., the time taken by a node to discover and to
connect to another node in its radio range, as well as the protocols
used for organizing them into the required topology. We define metrics
for device discovery performance and evaluate them by simulating the
inquiry routine in Bluetooth for various ad-hoc scenarios. We indicate
the scenario where device discovery in Bluetooth can become a
bottleneck. We then describe some recent results on topology
construction algorithms for Bluetooth. Data applications running over
Bluetooth such as http, ftp and real audio will need transport layer
protocols such as TCP and UDP to send packets over the wireless links.
We propose and compare a number of MAC scheduling algorithms with the
aim of improving the performance of asynchronous data traffic over a
Bluetooth piconet that supports multiple active slaves. We study how the
presence of circuit-switched voice impacts the performance of data
traffic.",
URL="http://www.iospress.nl/site/html/09266801.html",
}

@ARTICLE{Gao0101:Improving,
AUTHOR="Xia Gao and Thyaga Nandagopal and Vaduvur Bharghavan",
TITLE="On improving the performance of utility-based wireless fair
scheduling through a combination of adaptive {FEC} and {ARQ}",
JOURNAL=jhsn,
VOLUME=10,
NUMBER=1,
PAGES="19-36",
NOTE="International Workshop on Quality of Service (IWQoS)",
YEAR=2001,
ABSTRACT="The increasing number of wireless data users and the
deployment of broadband wireless networks have brought the issue of
providing fair channel access to the forefront. Wireless fair scheduling
algorithms must deal with unique domain-specific issues such as
location-dependent and bursty channel error. In the past, a number of
scheduling disciplines have been proposed for approximating fluid fair
queueing in wireless channels, but using only the ARQ-based link-layer
retransmit model(Bhagwat et al., in: IEEE INFOCOM, 1996; Lu et al., in:
ACM SIGCOMM, 1997; Ng et al., in: IEEE INFOCOM, 1998; Lu et al., WINET
6, 2000, pp. 323---343; Nandagopal et al., in: ACM MOBICOM, 1999). In
this work, we generalize past work in three key ways:(a)we use the
notion of'utility-based'fair scheduling, wherein the goal of the
scheduler is to serve flows in a way that maximizes the aggregate
utility of the system,(b)we combine the techniques of FEC and ARQ in a
generalized framework in which different scheduling disciplines can be
realized by mixing and matching component algorithms within the
framework, and(c)we support the notion of'application level
fairness'when flows see different channel error probabilities.
Specifically, we explore the combination of adaptive FEC and ARQ-based
schemes within the utility-based wireless fair scheduling paradigm. We
show through simulation and analysis that this combination enables the
scheduling disciplines to optimize the aggregate system utility and
achieve application level fairness, while handling varying channel
errors effectively.",
URL="http://www.iospress.nl/site/html/09266801.html",
}

@ARTICLE{Toh0101:Intelligent,
AUTHOR="Ck Toh and Wei K. Tsai",
TITLE="Intelligent control of {QoS} adaptation in next generation
wireless broadband networks",
JOURNAL=jhsn,
VOLUME=10,
NUMBER=1,
PAGES="37-58",
NOTE="International Workshop on Quality of Service (IWQoS)",
YEAR=2001,
ABSTRACT="This paper highlights the differences in Quality of
Service(QoS)definitions for wired high speed ATM networks and wireless
broadband ATM networks. In particular, we highlight the issues behind
QoS mapping and discuss several frameworks for QoS adaptation in
wireless broadband networks. We explain the need for end-to-end
adaptation and reveal how such adaptation occurs during mobile handoffs.
The instability and sensitivity problems occurred as a result of
frequent handoffs and QoS adaptation are explained and related to
control theory. We provide several control approaches that will ensure
stability in the network under such circumstances. It is important that
future broadband wireless networks must be able to offer network
services and QoS assurance without causing network instability. This
paper, therefore, reveal possible approaches to be considered in the
design of future broadband wireless systems.",
URL="http://www.iospress.nl/site/html/09266801.html",
}

@ARTICLE{Tuck0102:New,
AUTHOR="Rod Tucker and Shiduan Cheng and Jian Ma and Runtong Zhang",
TITLE="An new approach to multi-layer network survivability: strategies,
model and algorithm",
JOURNAL=jhsn,
VOLUME=10,
NUMBER=2,
PAGES="127-134",
NOTE="International Workshop on Quality of Service (IWQoS)",
YEAR=2001,
KEYWORDS="Multi-layer survivability; escalation strategy; resources
sharing pool(RSP)",
ABSTRACT="This paper studies multi-layer survivability strategies in
multi-layer transport networks. Two escalation strategies,
failure-oriented and traffic-oriented, are proposed, with the former
reducing the time in both failure detection and notification, and the
latter allowing priority restoration for different traffic. To reach the
optimal spare resources for multi-layer survivability, a new resource
sharing pool(RSP)is provided, which allows resources to be shared among
adjacent layers without incurring any additional resource on lower
layers to provide for any redundant protection. The RSP is formulated as
a difficult optimization problem, and can be combined with any
escalation strategies and thus can be used in any type of multiple layer
networks, such as WDM-based SDH networks or IP over WDM networks.
Finally, simulation is supplied to examine the efficiency of the RSP
assuming the SDH-based ATM transport network is in use.",
URL="http://www.iospress.nl/site/html/09266801.html",
}

@ARTICLE{Srid0102:Approaches,
AUTHOR="Murari Sridharan and Arun Somani and Murti Salapaka",
TITLE="Approaches for capacity and revenue optimization in survivable
{WDM} networks",
JOURNAL=jhsn,
VOLUME=10,
NUMBER=2,
PAGES="109-125",
NOTE="International Workshop on Quality of Service (IWQoS)",
YEAR=2001,
KEYWORDS="WDM; protection; restoration; survivability; service
differentiation; revenue; optimization; ILP",
ABSTRACT="In this paper, we consider two important objectives of network
operation:(i)capacity minimization and(ii)revenue maximization. For
capacity minimization, we formulate three operational phases in
survivable WDM network operation viz., initial call set up,
short/medium-term reconfiguration, and long-term reconfiguration. All
three phases are derived from a single integer linear
programming(ILP)formulation. This common framework incorporates service
disruption. We modify the framework for revenue maximization that
includes a service differentiation model based on lightpath protection.
We propose a multistage solution methodology to solve individual service
classes sequentially and combine them to obtain a feasible solution. We
provide cost comparisons in terms of increase in revenue obtained by
various service classes with the base case of accepting demands without
any protection. Results are provided to demonstrate the effectiveness of
our framework.",
URL="http://www.iospress.nl/site/html/09266801.html",
}

@ARTICLE{Sahi0102:Optical,
AUTHOR="Gökhan Sahin and Murat Azizoglu",
TITLE="Optical layer survivability for single and multiple service
classes",
JOURNAL=jhsn,
VOLUME=10,
NUMBER=2,
PAGES="91-108",
NOTE="International Workshop on Quality of Service (IWQoS)",
YEAR=2001,
KEYWORDS="Optical layer protection; WDM; survivability; restoration;
service classes",
ABSTRACT="This paper considers capacity provisioning for service and
restoration in a WDM optical network which provides lightpaths to higher
layer networks. An optical network will likely serve several client
networks with different protection requirements from the optical layer.
In this paper, a framework is developed for jointly assigning
wavelengths to service and restoration paths for all failures, for
traffic patterns with single or multiple classes of protection. For
various restoration methods, the problem is reduced to a vertex coloring
problem in a graph. We present routing and wavelength assignment
algorithms for service and restoration with varying capacity/restoration
time tradeoffs, and evaluate their performance through simulations. We
consider three different kinds of traffic patterns in terms of
protection requirement: 100\%protected traffic, mixed
protected/unprotected traffic, and mixed protected/low-priority traffic.
We quantify the capacity cost of protection in mixed traffic patterns as
a function of the proportion\rhoof the protected traffic in the mix, and
identify the range of\rhowhere protection can be provided at low
capacity penalties. This is important for assessing the economical
feasibility of providing protection to a class of connections at the
expense of reducing the amount of traffic that could be served without
protection guarantees.",
URL="http://www.iospress.nl/site/html/09266801.html",
}

@ARTICLE{Vino0102:Survivability,
AUTHOR="Kulathumani Vinodkrishnan and Nikhil Chandhok and Arjan Durresi
and Raj Jain and Ramesh Jagannathan and Srinivasan Seetharaman",
TITLE="Survivability in {IP} over {WDM} networks",
JOURNAL=jhsn,
VOLUME=10,
NUMBER=2,
PAGES="79-90",
NOTE="International Workshop on Quality of Service (IWQoS)",
YEAR=2001,
ABSTRACT="The Internet is emerging as the new universal
telecommunication medium. IP over WDM has been envisioned as one of the
most attractive architectures for the new Internet. Consequently
survivability is a crucial concern in designing IP over WDM networks.
This paper presents a survey of the survivability mechanisms for IP over
WDM networks and thus is intended to provide a summary of what has been
done in this area and help further research. A number of optical layer
protection techniques have been discussed. They are examined from the
point of view of cost, complexity, and application. Survivability
techniques are being made available at multiple layers of the network.
This paper also studies the recovery features of each network layer and
explains the impact of interaction between layers on survivability. The
advantages and issues of multi-layer survivability have been identified.
The main idea is that the optical layer can provide fast protection
while the higher layers can provide intelligent restoration. With this
idea in mind, a new scheme of carrying IP over WDM using MPLS or Multi
Protocol Lambda-Switching has been discussed. Finally, an architecture
is suggested by means of which the optical layer can perform an
automatic protection switch, with priority considerations with the help
of signaling from the higher layers.",
URL="http://www.iospress.nl/site/html/09266801.html",
}

@ARTICLE{Josh01:Broadband,
AUTHOR="Anupam Joshi and Arvind Krishna",
TITLE="Broadband Wireless",
JOURNAL=jhsn,
VOLUME=10,
NUMBER=0,
PAGES="1-6",
NOTE="International Workshop on Quality of Service (IWQoS)",
YEAR=2001,
URL="http://www.iospress.nl/site/html/09266801.html",
}

@TECHREPORT{Bolo01:Operating,
AUTHOR="William J. Bolosky and Richard Draves and Robert P. Fitzgerald
and Christopher W. Fraser and Michael B. Jones and Todd B. Knoblock and
Rick Rashid",
TITLE="Operating System Directions for the Next Millennium",
INSTITUTION="Microsoft Research",
YEAR=2001,
KEYWORDS="operating systems",
ABSTRACT="We believe it is time to reexamine the operating system's role
in computing.  Operating systems exist to create an environment in which
compelling applications come to life.  They do that by providing
abstractions built on the services provided by hardware.  We argue that
advances in hardware and networking technology enable a new kind of
operating system to support tomorrow's applications.  Such an operating
system would raise the level of abstraction for developers and users, so
that individual computers, file systems, and networks become unimportant
to most computations in the same way that processor registers, disk
sectors, and physical pages are today.",
URL="http://research.microsoft.com/research/sn/Millennium/mgoals.html",
}

@ARTICLE{Oh0101:Visual,
AUTHOR="Paul Y. Oh and Peter K. Allen",
TITLE="Visual Servoing by Partitioning Degrees-of-Freedom",
JOURNAL=ieeera,
VOLUME=17,
NUMBER=1,
PAGES="1-17",
YEAR=2001,
}

@INPROCEEDINGS{Ghos01:Architecture,
AUTHOR="Atanu Ghosh and Michael Fry and Jon Crowcroft",
TITLE="An Architecture for Application Layer Routing",
BOOKTITLE="International Working Conference on Active Networks (IWAN)",
ADDRESS="Philadelphia, Pennsylvania",
MONTH="September/October",
YEAR=2001,
REFERENCES=35,
KEYWORDS="Application-layer routing; active networks",
ABSTRACT="We have previously proposed, implemented and demonstrated an
Application Layer Active Network (ALAN) infrastructure. This
infrastructure permits the dynamic deployment of active services in the
network, but at the application level rather than the router level. Thus
the advantages of active networking are realised, without the
disadvantages of router level implementation. However we have previously
left unsolved the issue of appropriate placement of ALAN supported
services. This is an Application Layer Routing problem. In this paper we
define this problem and show that, in contrast to IP, it is a
multi-metric problem. We then propose an architecture that helps
conceptualise the problem and build solutions. We propose detailed
approaches to the active node discovery and state maintenance aspects of
Application Layer Routing (ALR).",
URL="ftp://cs.ucl.ac.uk/darpa/iwan.ps.gz",
}

@ARTICLE{Ke0103:Cost,
AUTHOR="Kai-Wei Ke and Chin-Tau Lea",
TITLE="On cost-based routing in connection-oriented high-speed
networks",
JOURNAL=jhsn,
VOLUME=10,
NUMBER=3,
PAGES="135-160",
NOTE="International Workshop on Quality of Service (IWQoS)",
YEAR=2001,
ABSTRACT="Not only does cost-based routing achieve a higher throughput,
it also removes the instability problem inherent in fixed-path routing
networks with alternate paths. In the paper we evaluate the performance
of two cost-based routing schemes: one centralized and one distributed.
The latter has a much lower complexity than the former. Although the
distributed version does not always use the least-cost path, our results
indicate the performance of both schemes are about the same. We also
compare them with least-loaded routing to demonstrate the ability of
cost-based routing to stabilize the network performance even under an
over-loaded condition. But to make cost-based routing a viable option
for a high-speed network, we must find a way to compute the cost
function. Recently a theory based on the concept of quantization was
developed. It can significantly reduce the complexity of cost
computation. With this problem solved, cost-based routing becomes a
serious contending routing algorithm for a high-speed multirate network.
The results in the paper demonstrate that the performance degradation
caused by quantizing the cost function is insignificant.",
URL="http://www.iospress.nl/site/html/09266801.html",
}

@ARTICLE{Diwa0103:Speeded,
AUTHOR="Roch Guérin and Kumar N. Sivarajan",
TITLE="Performance analysis of speeded-up high-speed packet switches",
JOURNAL=jhsn,
VOLUME=10,
NUMBER=3,
PAGES="161-186",
NOTE="International Workshop on Quality of Service (IWQoS)",
YEAR=2001,
KEYWORDS="Input queueing; output queueing; high-speed packet switches;
speedup factor; HOL blocking",
ABSTRACT="In this paper, we study the performance of high-speed packet
switches, where the switch fabric operates at a slightly higher speed
than the links, i.e., a speeded-up switch. Such structures are by no
means new and there are two well studied architectures in the literature
for such packet switches: pure input queueing(no speedup)and pure output
queueing(speedup of N, the number of links), with output queueing
switches offering substantial performance benefits. However, as link
speeds keep increasing, the speedup of N needed for pure output queueing
becomes a significant technical challenge. This is one of the main
reasons for the renewed interest in moderately speeded-up switch
fabrics. The aim of this paper is to highlight the result that only a
moderate speed-up factor(less than two)is sufficient to achieve full
input link utilization. In particular, we emphasize that this holds,
even without relying on a central switch controller making intelligent
decisions on which packets to schedule through the switch. As shown in
recent works, i.e.,[5, 17, 20, 23, 25]there are clearly benefits to
using intelligent controllers, but they do come at a cost. Instead, in
this paper we focus on what can be achieved by relying simply on switch
speedup. We do so by means of analysis and simulations. Our analysis
provides explicit expressions for the average queue length in switches
with integer and rational speedups. The results are complemented by
simulations that are used to obtain delay estimates, and which also
allow us to extend our investigation to shared memory switches for which
we find that good performance can be achieved with an even lower
speedup.",
URL="http://www.iospress.nl/site/html/09266801.html",
}

@ARTICLE{Haas0103:Mobile,
AUTHOR="Zygmunt J. Haas and Abhijit Warkhedi",
TITLE="The design and performance of Mobile {TCP} for wireless
networks",
JOURNAL=jhsn,
VOLUME=10,
NUMBER=3,
PAGES="187-207",
NOTE="International Workshop on Quality of Service (IWQoS)",
YEAR=2001,
ABSTRACT="In this paper, we propose a novel approach to reduce the
wireless communication overhead associated with the transport layer.
Portability is a key element of mobile computing. As mobile devices
shrink in terms of size and weight, their computing capabilities are
also reduced, constrained by battery capacity. To sustain a good
performance level of mobile applications, we devise a solution that
reduces the processing complexity on computing-limited mobile devices.
Additionally, we aim to minimize the use of wireless resources to
further improve performance. Specifically, we develop a streamlined
protocol architecture, Mobile TCP(MTCP), that achieves the elimination
of IP processing on the wireless segment of the TCP connection. MTCP
operates over a single hop wireless link, and, consequently, it
eliminates the unnecessary overhead placed on mobile devices, such as
the TCP congestion control mechanisms. In addition, we investigate the
impact of streamlining the socket layer on offloading the processing
overhead. Our experimental results indicate a substantial improvement in
the efficiency of protocol processing. For instance, results show that
the MTCP processing time per packet is approximately only one fourth
that of TCP and the use of CPU resources is reduced by up to 50\%.
Furthermore, the protocol incorporates various robust, yet simple, loss
recovery techniques to considerably improve the throughput in lossy
wireless conditions.",
URL="http://www.iospress.nl/site/html/09266801.html",
}

@ARTICLE{Lee0103:Optimal,
AUTHOR="Sang-Kyu Lee and A. Duksu Oh and Hyeong-Ah Choi",
TITLE="Optimal transmission schedule in {WDM} optical networks with
multiple transmitters and receivers",
JOURNAL=jhsn,
VOLUME=10,
NUMBER=3,
PAGES="209-222",
NOTE="International Workshop on Quality of Service (IWQoS)",
YEAR=2001,
ABSTRACT="In this paper, we study the problem of optimal transmission
schedules for embedding complete graphs in WDM broadcast-and-select
optical networks. An optimal transmission schedule is defined to be the
one that schedules transmissions such that each node transmits once to
every other node within a repeating cycle of minimum length. Our model
assumes that the network has N nodes with k wavelength channels, and
each node is equipped with\αtunable transmitters
and\βfixed-tuned receivers.
Given\α,\β(1\≤\α,\β\≤k)and\δ(tuning
delay required for a transmitter to tune from one wavelength to
another), we develop an optimal transmission schedule with schedule
length
max\ \{\α\βN(N\−1)/k,\β(N\−1)+k\δ\}such
that each transmitter of each node transmits once to each receiver of
its neighboring nodes within this time period.",
URL="http://www.iospress.nl/site/html/09266801.html",
}

@ARTICLE{Jose0103:Hierarchical,
AUTHOR="Sabu Joseph and Terence D. Todd",
TITLE="Hierarchical photonic {LANs} using spectral folding",
JOURNAL=jhsn,
VOLUME=10,
NUMBER=3,
PAGES="223-244",
NOTE="International Workshop on Quality of Service (IWQoS)",
YEAR=2001,
ABSTRACT="Local area networks based on passive optical star couplers
were originally proposed to exploit the enormous bandwidth of optical
fiber[1]. Unfortunately, the maximum throughput of these systems is
restricted by the limited number of channels which can be achieved in
practice. To address this problem, two-level hierarchical WDM LANs have
been proposed[2---4]. These architectures can increase system capacity
by permitting a set of local channels(i.e., the local waveband)to be
spatially reused across a number of local optical networks(LONs). Full
connectivity is maintained by a globally shared remote waveband. In
systems of this kind the channels are typically accessed using a single
wavelength-agile transmitter at each station[4]. Since fast receiver
tuning is currently more difficult to achieve, practical designs are
based on dynamic transmitter tuning only[2---4]. Receiver tuning is
performed only rarely or during system initialization. An unfortunate
complication with hierarchical networks is that stations must maintain a
presence in both wavebands. In fixed-tuned receiver designs this means
that each station must have one receiver for each waveband. As a result,
the amount of station receiver hardware is at least twice that required
for single passive star networks just to maintain full connectivity. In
this paper, a simple technique is proposed for eliminating this
requirement. In the remote section of the network, fixed wavelength
conversion is used to fold certain remote wavelengths onto the local
ones. This results in an interesting design where the local/remote
allocation of bandwidth is dynamically controlled temporally by the
stations from the edge of the network. Full connectivity can be
maintained with only half the total number of station receivers and the
capacity can scale linearly with the number of LONs, as in conventional
hierarchies. The price to pay for this simplification however, is that
capacity is lost through the wavelength folding process. New media
access protocols are required to prevent conflicts in this case. The
capacity and delay performance of the system is investigated for four
proposed media access control protocols.",
URL="http://www.iospress.nl/site/html/09266801.html",
}

@ARTICLE{Katz0104:Fault,
AUTHOR="Irene Katzela and Georgios Ellinas and Won Yoon and Thomas
Stern",
TITLE="Fault diagnosis in optical networks",
JOURNAL=jhsn,
VOLUME=10,
NUMBER=4,
PAGES="269-291",
NOTE="International Workshop on Quality of Service (IWQoS)",
YEAR=2001,
ABSTRACT="Faults in the optical network environment propagate quickly to
different parts of the network raising a large number of alarms. This
paper describes two new fault diagnosis techniques for single fault
diagnosis in an optical network. Both techniques operate under the same
premises: when a fault occurs, a central manager detects the fault and
through tests and correlation of information identifies the failure. The
performance of the proposed schemes is compared both analytically and by
simulation to each other and other proposed schemes for fault diagnosis
in the optical network environment.",
URL="http://www.iospress.nl/site/html/09266801.html",
}

@ARTICLE{Mdar0104:Node,
AUTHOR="Muriel Médard and Stephen R. Chinn and Poompat Saengudomlert",
TITLE="Node wrappers for {QoS} monitoring in transparent optical nodes",
JOURNAL=jhsn,
VOLUME=10,
NUMBER=4,
PAGES="247-268",
NOTE="International Workshop on Quality of Service (IWQoS)",
YEAR=2001,
ABSTRACT="Transparent optical nodes(TONs), such as all-optical switches
and erbium-doped fiber amplifiers, are an increasingly important part of
wavelength-division multiplexed(WDM)networks. Our goal in this paper is
to consider how quality of service(QoS)may be monitored at such TONs.
The question is particularly important as access to WDM networks, and
associated security concerns, increase. Our paper has four parts. First,
we present an overview of the vulnerabilities of TONs to QoS degradation
for two main classes of TONs, namely all-optical switching nodes and
amplifiers in optical networks. Second, we discuss the applicability of
traditional supervisory methods to such degradations. Third, we propose
a novel approach to monitoring QoS degradations in TONs. Our approach
works by comparing the input and output at a node and deciding whether
unacceptable service degradation has occurred at that node. Finally, we
analyze the performance, under simple attack scenarios, of our approach
for jamming attacks at transparent optical switching nodes and
amplifiers. We show that our method is several orders of magnitude
faster than bit error rate testers in detecting QoS degradations.",
URL="http://www.iospress.nl/site/html/09266801.html",
}

@ARTICLE{Zhu0104:Topology,
AUTHOR="Keyao Zhu and Laxman Sahasrabuddhe and Biswanath Mukherjee",
TITLE="Topology design and upgrade of an optical network by
bottleneck-cut identification",
JOURNAL=jhsn,
VOLUME=10,
NUMBER=4,
PAGES="293-301",
NOTE="International Workshop on Quality of Service (IWQoS)",
YEAR=2001,
ABSTRACT="We investigate the problem of topology design of an optical
network by bottleneck-cut identification. For an optical network, the
topology-design problem can be viewed as a combined two-layer design
problem: physical-topology design and virtual-topology design. In this
study, we present the definition of bottleneck cut of an optical
network. A heuristic algorithm is proposed to find the bottleneck cut,
and then we show how to apply this algorithm to an optical network for
topology design and upgrade.",
URL="http://www.iospress.nl/site/html/09266801.html",
}

@ARTICLE{Anan0104:Static,
AUTHOR="Vishal Anand and Chunming Qiao",
TITLE="Static versus dynamic establishment of protection paths in {WDM}
networks",
JOURNAL=jhsn,
VOLUME=10,
NUMBER=4,
PAGES="317-327",
NOTE="International Workshop on Quality of Service (IWQoS)",
YEAR=2001,
ABSTRACT="In wavelength division multiplexed networks(WDM)with 1:1 path
protection, a link-disjoint protection(backup)path is also set up at the
time of setting up a working(primary)path. Hence, the failure of a
single fiber-link does not cause huge data losses. This paper considers
on-line routing and wavelength assignment(RWA)of protection paths in
such networks. In particular, we study two strategies based on the 1:1
path protection scheme. The Static strategy establishes protection paths
such that once a route and wavelength have been chosen they are not
allowed to change. On the other hand, the Dynamic strategy allows for
re-arrangement of protection paths, that is, both the route and
wavelength chosen for a protection path can change so as to accommodate
a new request. With either strategy, we assume that the working paths
cannot be re-arranged. This is to prevent the disruption of on-going
traffic. The two strategies are compared on the basis of the number of
connections requests that can be satisfied for a given number of
wavelengths, assuming that the requests come one at a time, and
wavelengths are assigned according to the First-Fit policy. One of the
results of our study is that, contrary to intuition, the Static strategy
performs better than the Dynamic strategy.",
URL="http://www.iospress.nl/site/html/09266801.html",
}

@ARTICLE{Sen0104:Survivability,
AUTHOR="Bao Hong Shen and Subir Bandyopadhyay",
TITLE="Survivability of lightwave networks---path lengths in {WDM}
protection scheme",
JOURNAL=jhsn,
VOLUME=10,
NUMBER=4,
PAGES="303-315",
NOTE="International Workshop on Quality of Service (IWQoS)",
YEAR=2001,
KEYWORDS="Optical networks; WDM; survivability; min-max path pair;
min-sum path pair; shortest path pair",
ABSTRACT="In the protection scheme of fault management in a WDM optical
network, corresponding to every source-destination path used for data
transmission, a backup path is maintained in a stand-by mode. In the
case of a failure(either due to a fiber cut or due to equipment
failure)in the primary path, data transmission is quickly switched to
the backup path. In order to tolerate any single fault, the backup path
must be edge(or node)disjoint from the primary path. Most often a
shortest path between the source and the destination is chosen as the
primary path. To obtain a link(node)disjoint backup(or secondary)path,
the links(nodes)of the primary path are removed from the graph and then
a shortest path in the modified graph is chosen as the backup path. The
attractive feature of this scheme is its simplicity. However, the scheme
has a severe drawback. Due to the choice of a shortest path as the
primary path, the length of a link disjoint secondary path may be
unacceptably large. In this paper, we propose a novel way of choosing
the primary and the secondary paths so that the lengths of both the
paths are small. Unfortunately, the problem of choosing primary and
secondary paths in this way turns out to be NP-complete. We provide the
NP-completeness proof of both the edge disjoint and the node disjoint
version of the problem. We provide an approximation algorithm for the
problem with a guaranteed performance bound of 2 and a mathematical
programming formulation for the exact solution of the problem. Though
the approximate solution provides a performance bound of 2, through
extensive experimental evaluation, we find that the approximate solution
is very close to the optimal solution and the ratio between the
approximate to the optimal solution never exceeds 1.2. Although we
discuss the single fault scenario in this paper, the algorithms
discussed here, can be used equally effectively for the multiple fault
scenario also. Finally, we discuss other variations of the disjoint path
problem relevant to the lightwave networks.",
URL="http://www.iospress.nl/site/html/09266801.html",
}

@ARTICLE{Choi0104:Survivable,
AUTHOR="Hyeong-Ah Choi and Suresh Subramaniam",
TITLE="Survivable Optical Networks---Part {II}",
JOURNAL=jhsn,
VOLUME=10,
NUMBER=4,
PAGES="245-245",
NOTE="International Workshop on Quality of Service (IWQoS)",
YEAR=2001,
URL="http://www.iospress.nl/site/html/09266801.html",
}

@TECHREPORT{Rabi01:Positioning,
AUTHOR="Matthew Rabinowitz and James Spilker",
TITLE="Positioning Using the {ATSC} Digital Television Signal",
TYPE="Rosum Corporation Whitepaper",
INSTITUTION="Rosum",
ADDRESS="Redwood City, California",
YEAR=2001,
KEYWORDS="GPS; geolocation; HDTV",
URL="http://www.rosum.com/whitepaper\_8-7-01.pdf",
}

@ARTICLE{Hedb01:Evolving,
AUTHOR="Tomas Hedberg and Stefan Parkvall",
TITLE="Evolving {WCDMA}",
JOURNAL=ericssonr,
NUMBER=3,
YEAR=2001,
KEYWORDS="UMTS; UTRAN; air interface",
ABSTRACT="WCDMA is rapidly emerging as the leading global
third-generation (IMT- 2000) standard, providing simultaneous support
for a wide range of services with different characteristics on a common
5 MHz carrier.  The current WCDMA specification fully satisfies the
IMT-2000 requirements, including support for data rates of up to 2
Mbit/s in indoor or small-cell outdoor environments, wide-area coverage
at rates of up to 384 kbit/s, and support for high-rate packet-data and
circuit-switched services.  Thus, the introduction of third-generation
cellular systems allows operators to offer a vast selection of services
to meet subscriber demands.  Ericsson’s WCDMA products are positioned to
guarantee cost-effective delivery of these services.  When launching a
WCDMA network, most operators will initially focus on delivering stable
coverage over a large area—capacity is a lesser concern.  The initial
deployment will also support essential end-user services, including
radio access bearers for circuit- and packet-switched data communication
as well as location-based services.  Over time, the capacity
requirements will increase as more and more subscribers enter the
system.  Likewise, greater support will be needed for end-user services
- that is, multimedia services, high-precision location services, and
high-speed packet-data services will become increasingly important.
These evolving requirements can be supported through enhancements and
additions of new functionality in the current WCDMA standard (R99) and
through future additions to it.  In this article, the authors discuss
ways of evolving the Ericsson family of WCDMA products.  Because packet
data is expected to have an increasingly important role, the scope of
this article is mostly limited to packet data services.  The authors
outline enhancements to the current standard and propose a subsequent
evolution.",
URL="http://www.ericsson.com/about/publications/review/2001\_03/files/2001034.pdf",
}

@INPROCEEDINGS{Kim01:Efficient,
AUTHOR="Kyung Tae Kim and Sung Kyo Jung and Young C. Park and Yong Choi
and Dae Hee Youn",
TITLE="An efficient transcoding algorithm for {G.723.1} and {EVRC}
speech coders",
BOOKTITLE="Vehicular Technology Conference (VTS)",
PAGES="1561-1564",
YEAR=2001,
REFERENCES=6,
KEYWORDS="transcoding; G.723.1; EVRC",
ABSTRACT="Interoperability is one of the most important factor for a
successful integration of the speech network. To operate speech networks
employing different speech coders, but integrated as one, bitstreams
generated by one coder should be translated seamlessly to those of the
other coders. Connecting two coders in tandem may be the simplest way to
accomplish this. However, codecs in tandem connection often produce
problems such as poor speech quality, high computational load, and
additional transmission delay. In this paper, we propose an efficient
transcoding algorithm that can provide interoperability to the networks
employing ITU-T G.723.1 and TIA IS-127 EVRC speech coders. Subjective
and objective quality evaluations have confirmed that the speech quality
produced by the proposed transcoding algorithm was equivalent to, or
better than the tandem encoding, while it had shorter processing delay
and less computational complexity.",
}

@INPROCEEDINGS{Tsai01:GSM,
AUTHOR="Shu-Min Tsai and Jar-Ferr YANG",
TITLE="{GSM} to {G.729} speech transcoder",
BOOKTITLE="8th IEEE International Conference on Electronics, Circuits
and Systems (ICECS)",
PAGES="485-488",
YEAR=2001,
REFERENCES=4,
KEYWORDS="transcoding; GSM",
ABSTRACT="With increasing demand of wireless and Internet accesses, the
interoperability crossing these two networks becomes increasingly
important for modern communications.  A transcoding system that
translates the coding parameters directly between the GSM and G.729
speech coders is discussed in the present paper.  The GSM coder is used
for mobile communications while the G.729 is the most favorable coder in
Internet communications.  For Internet/wireless gateway servers, it is
evident that the proposed transcoding system requires much less
computation than the conventional decode-then-encode (DTE) approach.",
}

@BOOK{Bush01:Active,
AUTHOR="Stephen Francis Bush and Amit Kulkarni",
TITLE="Active Networks and Active Network Management: A Proactive
Management Framework",
EDITION="1st",
PUBLISHER="Kluwer Academic/Plenum Publishers",
YEAR=2001,
LANGUAGE="English",
KEYWORDS="Active Networks, Network Management, Predictive Management",
ABSTRACT="Active networking is an exciting new paradigm in digital
networking that has the potential to revolutionize the manner in which
communication takes place. It is an emerging technology, one in which
new ideas are constantly being formulated and new topics of research are
springing up even as this book is being written. This technology is very
likely to appeal to a broad spectrum of users from academia and
industry. Therefore, this book was written in a way that enables all
these groups to understand the impact of active networking in their
sphere of interest. Information services managers, network
administrators, and e-commerce developers would like to know the
potential benefits of the new technology to their businesses, networks,
and applications. The book introduces the basic active networking
paradigm and its potential impacts on the future of information handling
in general and on communications in particular. This is useful for
forward-looking businesses that wish to actively participate in the
development of active networks and ensure a head start in the
integration of the technology in their future products, be they
applications or networks. Areas in which active networking is likely to
make significant impact are identified, and the reader is pointed to any
related ongoing research efforts in the area. The book also provides a
deeper insight into the active networking model for students and
researchers, who seek challenging topics that define or extend frontiers
of the technology. It describes basic components of the model, explains
some of the terms used by the active networking community, and provides
the reader with taxonomy of the research being conducted at the time
this book was written. Current efforts are classified based on typical
research areas such as mobility, security, and management. The intent is
to introduce the serious reader to the background regarding some of the
models adopted by the community, to outline outstanding issues
concerning active networking, and to provide a snapshot of the
fast-changing landscape in active networking research. Management is a
very important issue in active networks because of its open nature. The
latter half of the book explains the architectural concepts of a model
for managing active networks and the motivation for a reference model
that addresses limitations of the current network management framework
by leveraging the powerful features of active networking to develop an
integrated framework. It also describes a novel application enabled by
active network technology called the Active Virtual Network Management
Prediction (AVNMP) algorithm. AVNMP is a proactive management system; in
other words, it provides the ability to solve a potential problem before
it impacts the system by modeling network devices within the network
itself and running that model ahead of real time.",
URL="ISBN 0-306-46560-4",
}

@ARTICLE{Knob01:Ariadne,
AUTHOR="Craig A. Knoblock and Steven Minton and Jose Luis Ambite and
Naveen Ashish and Ion Muslea and Andrew G. Philpot and Sheila Tejada",
TITLE="The {ARIADNE} Approach to Web-based Information Integration",
JOURNAL="International Journal of Cooperative Information Systems",
VOLUME=10,
NUMBER="1-2",
YEAR=2001,
LANGUAGE="English",
}

@INPROCEEDINGS{Ilve01:Length,
AUTHOR="Mika Ilvesmäki and Sampo Kaikkonen",
TITLE="The Length of Measurement Period to Determine the Application
Profile for Traffic Classification in the {Internet}",
BOOKTITLE=icc,
ORGANIZATION="IEEE",
YEAR=2001,
LANGUAGE="English",
}

@INPROCEEDINGS{Ilve01:Notes,
AUTHOR="Mika Ilvesmäki and Jouni Karvo",
TITLE="Notes on the Per-Flow Packet Count Flow Classifier,",
BOOKTITLE=lcn,
YEAR=2001,
LANGUAGE="English",
}

@INPROCEEDINGS{Ilve01:Capabilities,
AUTHOR="Mika Ilvesmäki and Marko Luoma",
TITLE="On the Capabilities of Application Level Traffic Measurements to
Differentiate and Classify {Internet} Traffic",
BOOKTITLE="ITCOM",
ORGANIZATION="SPIE",
YEAR=2001,
LANGUAGE="English",
ABSTRACT="1. The use of network based tra±c classification to
di®erentiate aggregate tra±c has been introduced with the development of
new Internet service architectures, especially with the Di®erentiated
Services. We present measurements and analysis of various packet and
flow statistics to aid in classifying or di®erentiating tra±c flows
according to the application nature. Our study on methods tra±c
classification includes the background analysis of tra±c traces to
detect applications of varying nature by measuring packet inter-arrival
times, packet lengths, flow inter-arrival times, and packet and flow
shares of total tra±c. Most promising results with a single statistic
are achieved when classifying tra±c based on packet inter-arrival
patterns. The interarrival time distributions of packets seem to be able
to divide the tra±c into two distinguishable classes. However, the
division to three or more classes remains as somewhat ambiguous issue
and needs further research. However, the results also indicate that no
single statistic is able to classify application flows with reasonable
certainty but that this might be achieved when several statistics and
their analysis results are combined. A good method of increasing the
classification result would be to increase the dimensionality of the
classification. For instance, combining the classification results of
packet IAT and packet length distributions would almost certainly lead
to the detection of applications of di®erent nature.",
}

@PHDTHESIS{Ilve01:Behavior,
AUTHOR="Mika Ilvesmäki",
TITLE="On the Behavior and Performance of the Packet Count Flow
Classifier",
SCHOOL="Helsinki University of Technology",
NOTE="A Licentiate thesis, a pre-doctoral and post-graduate type of
thesis.",
YEAR=2001,
ABSTRACT="1. Flow classification is used in the Internet to find and
detect flows of packets that can be handled separately from the rest of
the traffic. The packet flows may receive diff erent service levels or
they may be treated differently in the network. This work studies a flow
classification method where the flows are detected by counting packets
on flow candidates. This counting is continued until the packet count
threshold is reached and an active flow is established. This work
studies the packet count classifier using a set of traffic measurements
made in di erent networks. Results show that the number of packets
outside of any active flows is relatively small thus reducing the
workload of conventional packet forwarding. However, the classified
flows are from a large number of different applications and it is
doubtful that packet count flow classification may be used to support
the introduction of quality of service in the Internet. Furthermore, the
candidate table, an essential part of the packet count classifier
implementation, forms a significant performance bottleneck because of
the size and frequent changes in it.",
}

@TECHREPORT{Berg01:Wireless,
AUTHOR="Magnus Berggren",
TITLE="Wireless communication in telemedicine using Bluetooth and {IEEE}
802.11b",
INSTITUTION="Department of Information Technology Uppsala University",
YEAR=2001,
LANGUAGE="English",
ABSTRACT="This thesis explores the issues surrounding the simultaneous
deployment of Bluetooth \& Wireless LAN (IEEE 802.11b) for networked
devices in a telemedicine environment. A key aspect in telemedicine is
the ability of the two standards to co-exist in close proximity. This
work defines telemedicine, gives examples of applications, and describes
the two wireless techniques and the issues that arise when considering
the introduction of wireless communication. The thesis tries to answer
the question whether the two wireless techniques Bluetooth and Wireless
LAN can co-exist in a telemedicine environment. In order to do this,
quantified measurements where performed were the two wireless techniques
where exposed to radio interference from the other technique. These
results are printed as graphs and explained.",
}

@PROCEEDINGS{Galt01:Predicting,
AUTHOR="Virginie Galtier and Yannick Carlinet and Kevin Mills and
Stephen Francis Bush",
TITLE="Predicting and Controlling Resource Usage in a Heterogeneous
Active Network",
ORGANIZATION="Active Middleware Services",
PUBLISHER="IEEE",
YEAR=2001,
LANGUAGE="English",
KEYWORDS="active network, complexity theory",
ABSTRACT="Active network technology envisions deployment of virtual
execution environments within network elements, such as switches and
routers. As a result, inhomogeneous processing can be applied to network
traffic. To use such technology safely and efficiently, individual nodes
must provide mechanisms to enforce resource limits. This implies that
each node must understand the varying resource requirements for specific
network traffic. This paper presents an approach to model the CPU time
requirements of active applications in a form that can be interpreted
among heterogeneous nodes. Further, the paper demonstrates how this
approach can be used successfully to control resources consumed at an
active-network node and to predict load among nodes in an active
network, when integrated within the Active Virtual Network Management
Prediction system.",
URL="http://www.research.ge.com/~bushsf/ftn",
}

@MISC{ViaVoice,
AUTHOR="International Business Machines Corporation",
TITLE="{{IBM} ViaVoice {ASR} {SDK} for Linux}",
YEAR=2001,
LANGUAGE="English",
ANNOTE="Available at
http://www.ibm.com/software/speech/dev/sdk\\_linux.html",
URL="http://www.ibm.com/software/speech/dev/sdk\\_linux.html",
}

@TECHREPORT{Abr:sicstech02,
AUTHOR="Henrik Abrahamsson and Ian Robin Marsh",
TITLE="{DTMsim} -- {DTM} channel simulation in ns",
INSTITUTION="SICS -- Swedish Institute of Computer Science",
YEAR=2001,
}

@INPROCEEDINGS{Ahlg01:Dimensioning,
AUTHOR="Bengt Ahlgren and Anders Andersson and Olof Hagsand and Ian
Robin Marsh",
TITLE="Dimensioning Links for {IP} Telephony",
BOOKTITLE="2nd IP-Telephony Workshop (IPtel 2001)",
ADDRESS="New York City, New York, USA",
MONTH="APR",
YEAR=2001,
ABSTRACT="Packet loss is an important parameter for dimensioning network
links or traffic classes carrying IP telephony traffic. We present a
model based on the Markov modulated Poisson process (MMPP) which
calculates packet loss probabilities for a set of superpositioned voice
input sources and the specified link properties. We do not introduce
another new model to the community, rather try and verify one of the
existing models via extensive simulation and a real world
implementation. A plethora of excellent research on queuing theory is
{\em still} in the domain of ATM researchers and we attempt to highlight
it's validity to the IP Telephony community. Packet level simulations
show very good correspondence with the predictions of the model. Our
main contribution is the verification of the MMPP model with
measurements in a laboratory environment. The loss rates predicted by
the model are in general close to the measured loss rates and the loss
rates obtained with simulation. The general conclusion is that the
MMPP-based model is a tool well suited for dimensioning links carrying
packetized voice in a system with limited buffer space",
URL="http://www.sics.se/~ianm/Publications/dimensioning.ps.gz",
}

@INPROCEEDINGS{Albe01:Simulation,
AUTHOR="Lars Albertsson",
TITLE="Simulation-Based Debugging of Soft Real-Time Applications",
BOOKTITLE="Real-Time Application Symposium",
ORGANIZATION="IEEE Computer Society",
PUBLISHER="IEEE Computer Society Press",
MONTH="MAY",
YEAR=2001,
ABSTRACT="We present a temporal debugger, capable of examining time flow
of soft real-time applications in Unix systems. The debugger is based on
a simulator modelling an entire workstation in sufficient detail to run
unmodified operating systems and applications. It provides a
deterministic and non-intrusive debugging environment, allowing
reproducible presentation of program time flow. The primary contribution
of this paper is virtual machine translation, a technique necessary to
debug applications in a simulated Unix system. We show how a virtual
machine translator maps low-level data, provided by the simulator, to
data useful to a symbolic debugger. The translator operates by parsing
data structures in the target operating system and has been implemented
for the GNU debugger and simulated Linux systems.",
URL="http://www.sics.se/~lalle/publications/debugging\_soft\_rt.pdf",
}

@TECHREPORT{Albe01:Overview,
AUTHOR="Lars Albertsson",
TITLE="An Overview of Practical Research Approaches to Real-Time System
Engineering",
INSTITUTION="SICS -- Swedish Institute of Computer Science",
NUMBER="T2001:16",
YEAR=2001,
URL="http://www.sics.se/~lalle/literature/literature.pdf",
}

@TECHREPORT{Dun:minimal-tcp-proxy,
AUTHOR="Adam Dunkels",
TITLE="Minimal {TCP/IP} implementation with proxy support",
INSTITUTION="SICS -- Swedish Institute of Computer Science",
NUMBER="T2001:20",
NOTE="Master's thesis",
MONTH="FEB",
YEAR=2001,
URL="http://www.sics.se/~adam/thesis.pdf",
}

@INPROCEEDINGS{Feeney:infocom01,
AUTHOR="Laura Feeney and Martin Nilsson",
TITLE="Investigating the Energy Consumption of a Wireless Network
Interface in an Ad Hoc Networking Environment",
BOOKTITLE="of IEEE Conference on Computer Communications (IEEE
InfoCom)",
ADDRESS="Anchorage AK, USA",
MONTH="APR",
YEAR=2001,
ABSTRACT="Energy-aware design and evaluation of network potocols
requires knowledge of the energy consumption behavior of actual wireless
interfaces. But little practical information is available about the
energy consumption behavior of well-known wireless network interfaces
and device specifications do not provide information in a form that is
helpful to protocol developers. This paper describes a series of
experiments which obtained detailed measurements of the energy
consumption of an IEEE 802.11 wireless network interface operating in an
ad hoc networking environment. The data is presented as a collection of
linear equations for calculating the energy consumed in sending,
receiving and discarding broadcast and point-to-point data packets of
various sizes. Some implications for protocol design and evaluation in
ad hoc networks are discussed.",
URL="http://www.sics.se/~lmfeeney/info01.ps",
}

@ARTICLE{Feen01:Energy,
AUTHOR="Laura Feeney",
TITLE="An Energy-consumption Model for Performance Analysis of
RoutingProtocols for Mobile Ad Hoc Networks",
JOURNAL="Mobile Networks and Applications (MONET) Journal",
VOLUME=6,
NUMBER=3,
PAGES="239-250",
MONTH="JUN",
YEAR=2001,
ABSTRACT="A mobile ad hoc network (or manet) is a group of mobile,
wireless nodes which cooperatively form a network independent of any
fixed infrastructure or centralized administration. In particular, a
manet has no base stations: a node communicates directly with nodes
within wireless range and indirectly with all other nodes using a
dynamically-computed, multi-hop route via the other nodes of the manet.
Simulation and experimental results are combined to show that energy and
bandwidth are substantively different metrics and that resource
utilization in manet routing protocols is not fully addressed by
bandwidth-centric analysis. This report presents a model for evaluating
the energy consumption behavior of a mobile ad hoc network. The model
was used to examine the energy consumption of two well-known manet
routing protocols. Energy-aware performance analysis is shown to provide
new insights into costly protocol behaviors and suggests opportunities
for improvement at the protocol and link layers.",
URL="http://www.sics.se/~lmfeeney/monet.ps",
}

@TECHREPORT{Voigt:docstech01,
AUTHOR="Thiemo Voigt and Per Gunningberg",
TITLE="Dealing with Memory-intensive Web Requests",
INSTITUTION="Dept. of Information Technology, Uppsala University",
NUMBER="2001--010",
MONTH="MAY",
YEAR=2001,
}

@INPROCEEDINGS{Voi:paws01,
AUTHOR="Thiemo Voigt and Per Gunningberg",
TITLE="Kernel-based Control of Persistent Web Server Connections",
BOOKTITLE="Performance and Architecture of Web Servers (PAWS)",
ADDRESS="Cambridge, MA, USA",
MONTH="JUN",
YEAR=2001,
ABSTRACT="Several overload admission control architectures have been
developed to protect web servers from overload. Some of these
architectures base their admission decision on information found in the
HTTP header. In this context, persistent connections represent a
challenging problem since the HTTP header of the first request does not
reveal any information about the resource consumption of the requests
that might follow on the same connection. We have previously presented a
kernel-based architecture that protects web servers from overload. The
implemented mechanisms have proven to be more efficient and scalable
than application level controls implemented in the web server. In this
paper, we extend the kernel-based architecture to prevent overload
caused by persistent connections. We evaluate our approach by various
experiments.",
URL="http://www.sics.se/~thiemo/pawslong.ps",
}

@MISC{Voi:usenix01,
AUTHOR="Thiemo Voigt and Renu Tewari and Douglas Freimuth and Ashish
Mehra",
TITLE="Kernel Mechanisms for Service Differentiation in Overloaded Web
Servers",
HOWPUBLISHED="2001 Usenix Annual Technical Conference",
MONTH="JUN",
YEAR=2001,
ABSTRACT="The increasing number of Internet users and innovative new
services such as e-commerce are placing new demands on Web servers. It
is becoming essential for Web servers to provide performance isolation,
have fast recovery times, and provide continuous service during overload
at least to preferred customers. In this paper, we present the design
and implementation of three kernel-based mechanisms that protect Web
servers against overload by providing admission control and service
differentiation based on connection and application level information.
Our basic admission control mechanism, {\em TCP SYN policing}, limits
the acceptance rate of new requests based on the connection attributes.
The second mechanism, {\em prioritized listen queue}, supports different
service classes by reordering the listen queue based on the priorities
of the incoming connections. Third, we present {\em HTTP header-based
connection control} that uses application-level information such as URLs
and cookies to set priorities and rate control policies. We have
implemented these mechanisms in AIX 5.0. Through numerous experiments we
demonstrate their effectiveness in achieving the desired degree of
service differentiation during overload. We also show that the kernel
mechanisms are more efficient and scalable than application level
controls implemented in the Web serv",
URL="http://www.sics.se/~thiemo/usenix01.ps",
}

@ARTICLE{Voigt:acmperfevalreview,
AUTHOR="Thiemo Voigt and Per Gunningberg",
TITLE="Kernel-based Control of Persistent Web Server Connections",
JOURNAL="ACM Performance Evaluation Review",
VOLUME=29,
NUMBER=2,
PAGES="20-25",
MONTH="SEP",
YEAR=2001,
}

@INPROCEEDINGS{WesterlundA:usenix2001,
AUTHOR="Assar Westerlund and Johan Danielsson",
TITLE="Heimdal and Windows 2000 Kerberos --- how to get them to play
together",
BOOKTITLE="Usenix 2001 Annual Technical Conference",
ADDRESS="Boston, USA",
MONTH="JUN",
YEAR=2001,
URL="http://www.sics.se/cna/publications/heimdal-2k.ps",
}

@INPROCEEDINGS{Delg01:Adaptation,
AUTHOR="A. Delgado and Andrej Mihailovic and N. Georganopuols and Hamid
Aghvami",
TITLE="Adaptation of Transport Protocols for an {IP} Micromobility
Scheme",
BOOKTITLE="International Conference on Communications, ICC 2001",
ADDRESS="Helsinki, Finland",
MONTH="June 11--14",
YEAR=2001,
}

@INPROCEEDINGS{Snoe01:Reconsidering,
AUTHOR="Alex C. Snoeren and Hari Balakrishnan and M. Frans Kaashoek",
TITLE="Reconsidering {Internet} Mobility",
BOOKTITLE="8th Workshop on Hot Topics in Operating Systems
(HotOS-VIII)",
YEAR=2001,
}

@INPROCEEDINGS{Ramj01:IP,
AUTHOR="Ramachandran Ramjee and T. La Porta and Lianyuan Li and Sneha
Kumar Kasera",
TITLE="{IP} Paging Architectures",
BOOKTITLE="IP-based Cellular Networks, IPCN",
ORGANIZATION="UpperSide",
YEAR=2001,
}

@INPROCEEDINGS{Jona01:TCP,
AUTHOR="Karl Jonas and  others",
TITLE="{TCP} Performance under Mobile {IP} Handoffs -- Survey and
Performance Results",
BOOKTITLE="IP-Based Cellular Networks, IPCN 2001",
ADDRESS="Paris, France",
MONTH="May 15-18",
YEAR=2001,
}

@INPROCEEDINGS{Hart01:Performance,
AUTHOR="Hannes Hartenstein and Karl Jonas and Marco Liebsch and R.
Schmitz and M. Stiemerling and Dirk Westhoff",
TITLE="Performance of {TCP} in Mobile in the Presence of Mobile {IP}
Handoffs",
BOOKTITLE="IEEE International Conference on Telecommunications, ICT
2001",
ADDRESS="Bucharest, Romania",
MONTH="June 4-7",
YEAR=2001,
}

@INPROCEEDINGS{Hart01:Role,
AUTHOR="Hannes Hartenstein and Karl Jonas and Marco Liebsch and R.
Schmitz and Heiner Josef Stuettgen",
TITLE="The Role of Mobile {IP} in Future Mobile Communication Networks",
BOOKTITLE="Eurescom Workshop on Mobility for all-IP Networks (MAIN)",
MONTH="April 26-27",
YEAR=2001,
}

@INPROCEEDINGS{Jona01:IP,
AUTHOR="Karl Jonas and Marco Liebsch and  others",
TITLE="{IP-based} Mobile Communication",
BOOKTITLE="5-th World Multi-Conference on Systemics, Cybernetics and
Informatics (SCI 2001): Invited Session on Mobile Networking beyond
UMTS",
ADDRESS="Orlando, USA",
MONTH="July 22-25",
YEAR=2001,
}

@TECHREPORT{Zand01:Reliable,
AUTHOR="Victor Zandy and Barton P. Miller",
TITLE="Reliable Sockets",
INSTITUTION="Wisconsin University",
YEAR=2001,
}

@INPROCEEDINGS{Leun01:Application,
AUTHOR="Ka-Cheong Leung and Dan Shell and Will Ivancic and D. Stewart
and T. L. Bell and B. A. Kachmar",
TITLE="Application of {Mobile-IP} to Space and Aeronautical Networks",
BOOKTITLE="IEEE Proceedings of the Aerospace Conference",
ADDRESS="Big Sky, MT",
VOLUME=2,
PAGES="1027-1033",
MONTH="Month",
YEAR=2001,
}

@TECHREPORT{Typp01:Mobility,
AUTHOR="Ville Typpo",
TITLE="Mobility within Wireless Ad Hoc Networks: Towards Hybrid Wireless
Multihop Networks",
TYPE="Thesis",
INSTITUTION="VTT Electronics and University of Oulu",
YEAR=2001,
}

@ARTICLE{Neme01:Throughput,
AUTHOR="Gabor Nemeth and Zoltán Richárd Turányi and Andras Valko",
TITLE="Throughput of Ideally Routed Wireless Ad Hoc Networks",
JOURNAL="Mobile Computing and Communications Review",
VOLUME=5,
NUMBER=4,
PAGES="40-46",
NOTE="October",
YEAR=2001,
}

@INPROCEEDINGS{Wan01:Minimum,
AUTHOR="Peng-Jun Wan and Gruia Calinescu and Xue Li and Ophir Frieder",
TITLE="Minimum-energy Broadcast Routing in Static Ad Hoc Wireless
Networks",
BOOKTITLE="of IEEE INFOCOM",
YEAR=2001,
}

@ARTICLE{Bink01:Authenticated,
AUTHOR="Jim Binkley and William Trost",
TITLE="Authenticated Ad Hoc Routing at the Link Layer for Mobile
Systems",
JOURNAL="Wireless Networks, Kluwer Academic Publishers",
PAGES="139-145",
YEAR=2001,
}

@INPROCEEDINGS{Chan01:Anonymous,
AUTHOR="Ranveer Chandra and Venugopalan Ramasubramanian and Ken Birman",
TITLE="Anonymous Gossip: Improving Multicast Reliability in Mobile
Ad-Hoc Networks",
BOOKTITLE="21st International Conference on Distributed Computing
Systems, 2001",
PAGES="275-283",
YEAR=2001,
}

@INPROCEEDINGS{Obra01:Pushing,
AUTHOR="Katia Obraczka and Gene Tsudik and Kumar Viswanath",
TITLE="Pushing the Limits of Multicast in Ad Hoc Networks",
BOOKTITLE="21st International Conference on Distributed Computing
Systems, 2001",
PAGES="719-722",
YEAR=2001,
}

@INPROCEEDINGS{Deva01:MZR,
AUTHOR="V. Devarapalli and D. Sidhu",
TITLE="{MZR:} A Multicast Protocol for Mobile Ad Hoc Networks",
BOOKTITLE="IEEE International Conference on Communications, ICC 2001",
VOLUME=3,
PAGES="886-891",
YEAR=2001,
}

@ARTICLE{Krav01:Cooperative,
AUTHOR="Robin Kravets and Casey Carter and Luiz Magalhaes",
TITLE="A Cooperative Approach to User Mobility",
JOURNAL="ACM Computer Communications Review",
VOLUME=31,
YEAR=2001,
}

@INPROCEEDINGS{Maga01:End,
AUTHOR="Luiz Magalhaes and Robin Kravets",
TITLE="End-to-End Inverse Multiplexing for Mobile Hosts",
BOOKTITLE="The 19th Brazilian symposium on Computer Networks",
ADDRESS="Florianapolis, Brazil",
YEAR=2001,
}

@TECHREPORT{Krav01:Moving,
AUTHOR="Robin Kravets",
TITLE="Moving from Mobile Hosts to Mobile Networks",
TYPE="Technical Report",
INSTITUTION="Department of Computer Science, University of Illinois,
Urbana-Champaign",
NUMBER="UIUCDCS-R-2000-2166",
YEAR=2001,
}

@INPROCEEDINGS{Soma01:Micromobility,
AUTHOR="Joseph Soma-Reddy and S. Acampora Anthony",
TITLE="Micromobility Strategies for {IP} Based Cellular Networks",
BOOKTITLE="Thyrrhenian International Workshop on Digital Communications,
IWDC 2001",
SERIES="Lecture Notes in Computer Science",
PUBLISHER="Springer",
ADDRESS="Taormina, Italy",
VOLUME=2170,
PAGES="67-75",
MONTH="September 17-20",
YEAR=2001,
}

@INPROCEEDINGS{Hris01:IP,
AUTHOR="Cristina Hristea and Fouad Tobagi",
TITLE="{IP} Routing and Mobility",
BOOKTITLE="Thyrrhenian International Workshop on Digital Communications,
IWDC 2001",
SERIES="Lecture Notes in Computer Science",
PUBLISHER="Springer",
ADDRESS="Taormina, Italy",
VOLUME=2170,
PAGES="279-294",
MONTH="September 17-20",
YEAR=2001,
}

@ARTICLE{Nasi01:Performance,
AUTHOR="Asis Nasipuri and R. Castaneda and Sajal Das",
TITLE="Performance of Multipath Routing for On-demand Protocols in Ad
Hoc Networks",
JOURNAL="ACM/Kluwer Mobile Networks and Applications (MONET)",
VOLUME=6,
NUMBER=4,
PAGES="339-349",
YEAR=2001,
}

@PHDTHESIS{Wood01:Internetworking,
AUTHOR="Lloyd Wood",
TITLE="Internetworking with Satellite Constellations",
TYPE="PhD thesis",
SCHOOL="University of Surrey",
YEAR=2001,
}

@TECHREPORT{Clar01:Personal,
AUTHOR="David D. Clark and John Wroclawski",
TITLE="The Personal Router Whitepaper",
INSTITUTION="MIT Laboratory for Computer Science",
YEAR=2001,
}

@INPROCEEDINGS{Sant01:Making,
AUTHOR="Cesar Santivanez and Ram Ramanathan and Ioannis Stavrakakis",
TITLE="Making Link-State Routing Scale for Ad Hoc Networks",
BOOKTITLE="ACM Mobihoc Conference",
ADDRESS="Long Beach, CA",
YEAR=2001,
}

@INPROCEEDINGS{Miu01:Dynamic,
AUTHOR="Allen Miu and Paramvir Bahl",
TITLE="Dynamic Host Configuration for Managing Mobility Between Public
and Private Networks",
BOOKTITLE="3rd USENIX Symposium on Internet Technologies and Systems",
ADDRESS="San Francisco, California",
MONTH="March 26-28",
YEAR=2001,
}

@PHDTHESIS{Erns01:Le,
AUTHOR="Thierry Ernst",
TITLE="Le Support de Reseaux Mobiles dans {IPv6}",
SCHOOL="INRIA Grenoble, Universite",
YEAR=2001,
ANNOTE="http://www.inria.fr/rrrt/tu-0714.html accessed July 9th, 2002",
}

@INPROCEEDINGS{Gwon01:Design,
AUTHOR="Yongjune Lee Gwon",
TITLE="Design and Performance of Mobile {IP} Predictive Handover with
Network Layer Prediction",
BOOKTITLE="IPCN 2001",
MONTH="May 15-18",
YEAR=2001,
}

@INPROCEEDINGS{Nika01:HARP,
AUTHOR="Navid Nikaein and Christian Bonnet and Neda Nikaein",
TITLE="{HARP} - Hybrid Ad Hoc Routing Protocol",
BOOKTITLE="of International Symposium on Telecommunications, IST",
ADDRESS="Tehran, Iran",
YEAR=2001,
}

@ARTICLE{Liao01:GRID,
AUTHOR="Wen-Hwa Liao and Jang-Ping Sheu and Yu-Chee Tseng",
TITLE="{GRID:} A Fully Location-Aware Routing Protocol for Mobile Ad Hoc
Networks",
JOURNAL="Telecommunication Systems",
VOLUME=18,
NUMBER="1--3",
PAGES="37-60",
YEAR=2001,
}

@MASTERSTHESIS{Liu01:Hybrid,
AUTHOR="Yolanda Liu",
TITLE="A Hybrid Forwarding Approach for the Mesh-based Geocast Routing
Protocol in an Ad Hoc Network",
SCHOOL="Colorado School of Mines",
YEAR=2001,
}

@INPROCEEDINGS{Bole01:Mesh,
AUTHOR="Jeff Boleng and Tracy Camp and Vishy Tolety",
TITLE="Mesh-based Geocast Routing Protocols in an Ad Hoc Network",
BOOKTITLE="IEEE International Workshop on Parallel and Distributed
Computing Issues in Wireless NEtworks and Mobile Computing, IPDPS",
YEAR=2001,
}

@INPROCEEDINGS{Chen01:SOM,
AUTHOR="Yuh-Shyan Chen and Tzung-Shi Chen and Ching-Jang Huang",
TITLE="{SOM:} Spiral-Fat-Tree Based On-Demand Multicast Protocol in a
Wireless Ad-hoc Network",
BOOKTITLE="15th International Conference on Information Networking",
PAGES="17-24",
YEAR=2001,
}

@INPROCEEDINGS{Lee01:Patchodmrp,
AUTHOR="Meejang Lee and Ye Kyung Kim",
TITLE="PatchODMRP: an Ad-hoc Multicast Routing Protocol",
BOOKTITLE="15th International Conference on Information Networking",
PAGES="537-543",
YEAR=2001,
}

@INPROCEEDINGS{Wang01:Intelligent,
AUTHOR="Kuochen Wang and Chou-Tang Chang",
TITLE="An Intelligent On-Demand Multicast Routing Protocol in Ad Hoc
Networks",
BOOKTITLE="15th International Conference on Information Networking",
PAGES="909-914",
YEAR=2001,
}

@INPROCEEDINGS{Jian01:Performance,
AUTHOR="Hang Jiang and J.J. Garcia-Luna-Aceves",
TITLE="Performance Comparison of Three Routing Protocols for Ad hoc
Networks",
BOOKTITLE="Tenth International Conference on Computer Communications and
Networks",
PAGES="547-554",
YEAR=2001,
}

@INPROCEEDINGS{Koub01:Fully,
AUTHOR="Hend Koubaa and Eric Fleury",
TITLE="A Fully Distributed Mediator Based Service Location Protocol in
Ad Hoc Networks",
BOOKTITLE="IEEE Clobal Telecommunications Conference, GLOBECOM'01",
VOLUME=5,
PAGES="2949-2953",
YEAR=2001,
}

@INPROCEEDINGS{Fleu01:Performance,
AUTHOR="Eric Fleury and Hend Koubaa",
TITLE="A Performance Study of a Service Covering Protocol in Ad Hoc
Networks",
BOOKTITLE="Ninth IEEE International Conference on Networks",
PAGES="87-92",
YEAR=2001,
}

@INPROCEEDINGS{Diag01:Extension,
AUTHOR="M. L. Diagne and Thomas Noel and Jean-Jacques Pansiot",
TITLE="Extension of Service Location Protocol for {IPv6} Communication
Mobility",
BOOKTITLE="IEEE Pacific Rim Conference on Communications, Computers and
Signal Processing, PACRIM 2001",
VOLUME=2,
PAGES="495-497",
YEAR=2001,
}

@INPROCEEDINGS{Goff01:Preemptive,
AUTHOR="Tom Goff and Nael Abu-Ghazaleh and D. Pathak and Ridvan
Kahvecioglu",
TITLE="Preemptive Routing in Ad Hoc Networks",
BOOKTITLE="of ACM MobiCom",
YEAR=2001,
}

@INPROCEEDINGS{Brow01:Optimal,
AUTHOR="Timothy Brown and Sheetalkumar Doshi and Qinqing Zhang",
TITLE="Optimal Power Aware Routing in a Wireless Ad Hoc Network",
BOOKTITLE="IEEE LANMAN",
PAGES="102-105",
YEAR=2001,
}

@INPROCEEDINGS{Chen01:SPAN,
AUTHOR="Biao Chen and Kyle A. Jamieson and Hari Balakrishnan and Robert
Morris",
TITLE="{SPAN:} An Energy-Efficient Coordination Algorithm for Topology
Maintenance in Ad Hoc Wireless Networks",
BOOKTITLE="of MOBICOM",
YEAR=2001,
}

@INPROCEEDINGS{Fenn01:Investigating,
AUTHOR="L. Fenney and Martin Nilsson",
TITLE="Investigating the Energy Consumption of a Wireless Network
Interface in an Ad Hoc Networking Environment",
BOOKTITLE="IEEE INFOCOM",
YEAR=2001,
}

@INPROCEEDINGS{Li01:Online,
AUTHOR="Qinghua Li and Javed Aslam and Daniela Rus",
TITLE="Online Power-aware Routing in Wireless Ad-Hoc Networks",
BOOKTITLE="of MOBICOM",
YEAR=2001,
}

@INPROCEEDINGS{Torn01:Design,
AUTHOR="Audun Tornquist and Michael Neufeld and Dirk Grunwald",
TITLE="The Design of a Modular Implementation of Ad Hoc Routing
Protocols",
BOOKTITLE="Submitted to INFOCOM 2001",
YEAR=2001,
}

@INPROCEEDINGS{Xu01:Geography,
AUTHOR="Youshi Xu and John Heidemann and Deborah Estrin",
TITLE="Geography-informed Energy Conservation for Ad Hoc Routing",
BOOKTITLE="of MOBICOM",
YEAR=2001,
}

@INPROCEEDINGS{Mari01:Multipath,
AUTHOR="Mahesh Marina and Sajal Das",
TITLE="On-demand Multipath Distance Vector Routing in Ad Hoc Networks",
BOOKTITLE="of IEEE International Conference on NEtwork Protocols, ICNP",
PAGES="14-23",
YEAR=2001,
}

@INPROCEEDINGS{Barr01:Robust,
AUTHOR="L. Barriere and  others",
TITLE="Robust Position Based Routing in Wireless Ad Hoc Networks with
Unstable Transmission Ranges",
BOOKTITLE="5th ACM International Workshop on Discrete Algorithms and
Methods for Mobile Computing and Communications",
PAGES="19-27",
YEAR=2001,
}

@ARTICLE{Stoj01:Loop,
AUTHOR="Ivan Stojmenovic and Xu Lin",
TITLE="Loop-free Hybrid Single-Path/Flooding Routing Algorithms with
Guaranteed Delivery for Wireless Networks",
JOURNAL=ieeepds,
VOLUME=12,
NUMBER=10,
PAGES="1023-1032",
YEAR=2001,
}

@ARTICLE{Stoj01:Power,
AUTHOR="Ivan Stojmenovic and Xu Lin",
TITLE="Power-Aware Localized Routing in Wireless Networks",
JOURNAL=ieeepds,
VOLUME=12,
NUMBER=11,
PAGES="1122-1133",
YEAR=2001,
}

@INPROCEEDINGS{Garc01:Quality,
AUTHOR="J. Antonio Garcias-Macias and Franck Rousseau and Gilles
Berger-Sabbatel and Leyla Toumi and Andrzej Duda",
TITLE="Quality of Service and Mobility for the Wireless {Internet}",
BOOKTITLE="First ACM Wireless Mobile Internet Workshop",
ADDRESS="Rome, Italy",
YEAR=2001,
}

@ARTICLE{Fiko01:Performance,
AUTHOR="N. Fikouras and C. Gorg",
TITLE="Performance Comparison of Hinted- and Advertisement-based
Movement Detection for Mobile {IP} Handoffs",
JOURNAL=cn,
YEAR=2001,
}

@BOOK{Toh01:Ad,
AUTHOR="Ck Toh",
TITLE="Ad Hoc Mobile Wireless Networks: Protocols and Systems",
PUBLISHER="Pearson Education",
YEAR=2001,
}

@INBOOK{LoWa_TelSys2001,
AUTHOR="Matthias Lott and B. Walke",
TITLE="Performance analysis of a wireless ad hoc network with {QoS}
support",
BOOKTITLE="Telecommunication Systems",
VOLUME=16,
PAGES="115-134",
YEAR=2001,
ABSTRACT="A wireless ad hoc multihop network is introduced and protocols
for the air interface are described and evaluated. Ad hoc networks can
be realized due to the ability of stations to route connections
according to the current meshing of the network. The decentrally
organized network is able to guarantee the bandwidth contracted to a
connection in a hidden station environment by means of contention-free
data transmission, for both cannel and packet switched services, based
on real channel connections. Channels are established and used for the
duration of a so called train of data packets, released when the train
ends and re-established when the next train arrives. To guarantee
available capacity of the network for the re-establishment of a
connection and to guarantee the quality of service needed for a wireless
extension of a fixed ATM network, connection admission control is
applied considering the overall interference situation and the current
meshing of the stations in the network.\n For the purpose of realistic
and reliable performance analysis a simulation tool appropriate for the
investigation of the proposed network is introduced, and performance
results for the proposed protocols are given by means of event-driven
simulation studies in example scenarios. the simulated protocols have
been formally specified in SDL, translated to C++, and embedded into a
simulation environment",
ANNOTE="System Analysis, Ad hoc, Multihop, Self-organizing network,
Decentral control",
}

@INPROCEEDINGS{Sinh01:Enhancing,
AUTHOR="Prasun Sinha and Raghupathy Sivakumar and V. Bjarghavan",
TITLE="Enhancing Ad-Hoc Routing with Dynamic Virtual Infrastructures",
BOOKTITLE="of IEEE INFOCOM",
YEAR=2001,
}

@INPROCEEDINGS{Bhar01:Security,
AUTHOR="S. Bhargava and Dakshi Agrawal",
TITLE="Security Enhancements in {AODV} Protocol for Wireless Ad Hoc
Networks",
BOOKTITLE="of Vehicular Technology Conference",
YEAR=2001,
}

@INPROCEEDINGS{Rama01:Comparison,
AUTHOR="Ramu Ramamurthy and Sudipta Sengupta and Sid Chaudhuri",
TITLE="Comparison of Centralized and Distributed Provisioning in Optical
Neworks",
BOOKTITLE="Optical Fiber Communications",
ORGANIZATION="IEEE",
YEAR=2001,
LANGUAGE="English",
ABSTRACT="This paper compares centralized and distributed online
provisioning approaches in optical networks. In the centralized
approach, complete network state is available for path computation. In
the distributed approach, summmarized information is available for path
computation.",
}

@INPROCEEDINGS{Seng01:Capacity,
AUTHOR="Sudipta Sengupta and Ramu Ramamurthy",
TITLE="Capacity Efficient Distributed Routing of Mesh-Restored
Lightpaths in Optical Networks",
BOOKTITLE=globecom,
YEAR=2001,
LANGUAGE="English",
}

@INBOOK{Elli01:Advances,
AUTHOR="Georgios Ellinas and Krishna Bala",
TITLE="Advances in Optical Networks",
CHAPTER=2,
PUBLISHER="Kluwer Academic Publishers",
PAGES="19-46",
YEAR=2001,
LANGUAGE="English",
}

@ARTICLE{Hust01:Scaling,
AUTHOR="Geoff Huston",
TITLE="Scaling Inter-Domain {RoutingA} View Forward",
JOURNAL=ipj,
VOLUME=4,
NUMBER=4,
YEAR=2001,
LANGUAGE="English",
REFERENCES=4,
ABSTRACT={In the previous IPJ article, "Analyzing the Internet BGP
Routing Table," (Vol. 4, No. 1, March 2001) we looked at the
characteristics of the growth of the routing table in recent years. The
motivation for this work is to observe aspects of the Internet routing
table in order to understand the evolving structure of the Internet and
thereby attempt to predict some future requirements for routing
technology for the Internet.},
URL="http://www.cisco.com/warp/public/759/ipj\_4-4/ipj\_4-4\_scaling.html",
}

@ARTICLE{Yuen01:Hybrid,
AUTHOR="Wing Ho Yuen and Wing Wong",
TITLE="A Hybrid Contention Free Location Update Strategy with
Probabilistic Paging for {PCS}",
JOURNAL=ieeevt,
YEAR=2001,
LANGUAGE="English",
}

@PROCEEDINGS{Mars01:Petri,
AUTHOR="M. Ajmone Marsan and  M.Gribaudo and  M.Meo and  M.Sereno",
TITLE="On Petri Net-based Modeling Paradigms for the Performance
Analysis of Wireless {Internet} Access",
ORGANIZATION="International Workshop on Petrinet and Performance
Models",
PUBLISHER="IEEE",
YEAR=2001,
LANGUAGE="English",
ABSTRACT="Abstract: In this paper we model a wireless Internet access
system based on the GSM/GPRS (Global System for Mobile
communications/General Packet Radio Service) technology, with three
different Petri net-based paradigms: Generalized Stochastic Petri Nets
(GSPNs), Deterministic and Stochastic Petri Nets (DSPNs), and Fluid
Stochastic Petri Nets (FSPNs). We show that all three Petri net-based
paradigms provide very similar performance predictions for some of the
considered realistic configurations of GSM/GPRS systems, and for some of
the performance metrics of interest. This proves that FSPNs can be an
adequate tool for the performance analysis of wireless Internet access
systems, and allow the investigation of large system configurations,
thanks to the availability of very efficient solution algorithms for
FSPN models. However, we also show that in other cases (which can be
clearly characterized), the performance predictions generated by FSPN
models may become quite optimistic, and thus not suitable for a careful
design and planning of GSM/GPRS systems. In those cases, both DSPNs and
GSPNs can provide a viable modeling alternative, at least in the case of
medium scale systems.",
}

@ARTICLE{Kaly01:Use,
AUTHOR="Shivkumar Kalyanaraman and Raj Jain and Rohit Goyal and Sonia
Fahmy and Seong-Cheol Kim",
TITLE="Use-it or Lose-it Policies for the Available Bit Rate {(ABR)}
Service in {ATM} Networks",
JOURNAL=cnis,
MONTH=jan,
YEAR=2001,
ABSTRACT="The Available Bit Rate (ABR) service has been developed to
support 21st century data applications over Asynchronous Transfer Mode
(ATM). The ABR service uses a closed-loop rate-based traffic management
framework where the network divides left-over bandwidth among contending
sources. The ATM Forum traffic management group also incorporated
open-loop control capabilities to make the ABR service robust to
temporary network failures and source inactivity. An important problem
addressed was whether rate allocations of sources should be taken away
if sources do not use them. The proposed solutions, popularly known as
the Use-It-or-Lose-It (UILI) policies, have had significant impact on
the ABR service capabilities. In this paper we discuss the design,
development, and the final shape of these policies and their impact on
the ABR service. We compare the various alternatives through a
performance evaluation.",
URL="http://www.cis.ohio-state.edu/~jain/papers/uili.htm",
}

@ARTICLE{Lupu0101:Selected,
AUTHOR="Emil Lupu and Subrata Mazumdar and Rolf Stadler",
TITLE="Selected topics in network and systems management",
JOURNAL=cnis,
VOLUME=35,
NUMBER=1,
PAGES="1-4",
MONTH=jan,
YEAR=2001,
URL="http://www.elsevier.com/locate/comnet",
}

@ARTICLE{Bhoj0101:SLA,
AUTHOR="P. Bhoj and Sharad Singhal and S. Chutani",
TITLE="{SLA} management in federated environments",
JOURNAL=cnis,
VOLUME=35,
NUMBER=1,
PAGES="5-24",
MONTH=jan,
YEAR=2001,
KEYWORDS="federated management; service level agreements; system
monitoring",
ABSTRACT="Increasingly, Internet services are being deployed over an
infrastructure that spans multiple control domains. These services
require cooperation between multiple organizations, systems and
entities. Currently, few standard mechanisms exist to share selective
management information between the various service providers or between
service providers and their customers. Such mechanisms are necessary for
end-to-end service management and diagnosis as well as for ensuring the
service level obligations between a service provider and its customers
or partners. This paper describes an architecture that uses contracts
based on service level agreements (SLAs) to share selective management
information across administrative boundaries. The design of a prototype
implementation for automatically measuring, monitoring, and verifying
service level agreements for Internet services is also described.",
URL="http://www.elsevier.com/locate/comnet",
}

@ARTICLE{Feri0101:Framework,
AUTHOR="M. Feridun and Jens Krause",
TITLE="A framework for distributed management with mobile components",
JOURNAL=cnis,
VOLUME=35,
NUMBER=1,
PAGES="25-38",
MONTH=jan,
YEAR=2001,
KEYWORDS="distributed management; code mobility; mobile agents; active
network management",
ABSTRACT="The increasing importance of networks and the growing numbers
of devices and services that run on them necessitate effective network
and systems management. The traditional centralized management paradigm
alone is no longer sufficient for effective management solutions,
primarily as it does not scale well. Distribution of management tasks is
a promising approach. The distributed management framework (DMF)
presented in this paper provides an environment that allows a broad
range of management tasks to move and run anywhere within the managed
system. In our approach, management tasks are lightweight applications
that can be configured and downloaded dynamically as required, reducing
the load on managed resources and simplifying the problem of management
software updates. We present an object-oriented, Java-based
implementation of the DMF and describe applications developed on this
platform.",
URL="http://www.elsevier.com/locate/comnet",
}

@ARTICLE{Schn0101:Secure,
AUTHOR="J’rgen Sch÷nw„lder and J’rgen Quittek",
TITLE="Secure {Internet} management by delegation",
JOURNAL=cnis,
VOLUME=35,
NUMBER=1,
PAGES="39-56",
MONTH=jan,
YEAR=2001,
KEYWORDS="network management; internet management; scripting; management
by delegation; security; safety; java",
ABSTRACT="The IETF Script management information base (MIB) integrates
the management by delegation (MbD) model into the Internet management
framework. This paper discusses the security aspects of the Script MIB
concerning MIB access security and runtime security of delegated
management functions. The paper shows how SNMPv3 security mechanisms
have been utilized to protect the Script MIB from unauthorized access. A
prototype implementation is presented using the Java virtual machine as
a runtime system for delegated management functions. The prototype
demonstrates how solutions to all security aspects can be integrated.",
URL="http://www.elsevier.com/locate/comnet",
}

@ARTICLE{Flor0101:QoSockets,
AUTHOR="Patricia Florissi and Yechiam Yemini and Danilo Florissi",
TITLE="QoSockets: a new extension to the sockets {API} for end-to-end
application {QoS} management",
JOURNAL=cnis,
VOLUME=35,
NUMBER=1,
PAGES="57-76",
MONTH=jan,
YEAR=2001,
KEYWORDS="QoS management; application management",
ABSTRACT="The key question addressed by this paper is how multimedia
applications can adapt to the QoS delivered by the network and vice
versa. QoSockets is an extension to the sockets mechanism, to enable QoS
reservation and management. QoSockets automatically generates the
instrumentation to monitor QoS. QoSockets mediates interactions among
applications and transport protocols, and collects in QoS MIBs
statistics on the QoS delivered. The main advantages are: support of
single API for transport layer QoS negotiation, connection
establishment, and data transmission; support of a single QoS
negotiation protocol; generality across application QoS needs; and
automatic management of application QoS needs.",
URL="http://www.elsevier.com/locate/comnet",
}

@ARTICLE{Hell0101:Statistical,
AUTHOR="Joseph Hellerstein and Fan Zhang and Perwez Shahabuddin",
TITLE="A statistical approach to predictive detection",
JOURNAL=cnis,
VOLUME=35,
NUMBER=1,
PAGES="77-95",
MONTH=jan,
YEAR=2001,
KEYWORDS="proactive management; time series model; prediction",
ABSTRACT={Service providers typically define quality of service problems
using threshold tests, such as "Are HTTP operations greater than 12 per
second on server XYZ?" Herein, we estimate the probability of threshold
violations for specific times in the future. We model the threshold
metric (e.g., HTTP operations per second) at two levels: (1)
non-stationary behavior (as is done in workload forecasting for capacity
planning) and (2) stationary, time-serial dependencies. Our approach is
assessed using simulation experiments and measurements of a production
Web server. For both assessments, the probabilities of threshold
violations produced by our approach lie well within two standard
deviations of the measured fraction of threshold violations.},
URL="http://www.elsevier.com/locate/comnet",
}

@ARTICLE{Schm0101:Aggregation,
AUTHOR="Jens Schmitt and Martin Karsten and Ralf Steinmetz",
TITLE="On the aggregation of deterministic service flows",
JOURNAL=comcom,
VOLUME=24,
NUMBER=1,
PAGES="2-18",
MONTH=jan,
YEAR=2001,
ABSTRACT="It is common belief that",
}

@ARTICLE{Li0101:Selective,
AUTHOR="Na Li and Sehyun Park and Shuo-Yen Robert Li",
TITLE="A selective attenuation feedback mechanism for rate oscillation
avoidance",
JOURNAL=comcom,
VOLUME=24,
NUMBER=1,
PAGES="19-34",
MONTH=jan,
YEAR=2001,
KEYWORDS="Rate oscillation; Flow diversity; Feedback overhead;
Differentiated service; Fairness",
ABSTRACT="We have studied the delay-related rate oscillation within
Diffserv. The rate oscillation can come from large round trip latency.
Enforcing low feedback overhead can also cause the rate oscillation. The
Selective Attenuation Feedback via Estimation (SAFE) is proposed to
reduce the oscillation while maintaining fast response to network
dynamics. SAFE has no per-flow accounting. Furthermore, the hashing
technique is adopted to keep the operating overhead of SAFE to its
minimum. System analysis supports the effectiveness of SAFE. Simulation
result also shows that SAFE significantly reduces rate oscillation,
therefore achieves high link utilization and small queue size while
maintaining very low control overhead.",
URL="http://www.elsevier.nl/gej-ng/10/15/19/47/24/26/abstract.html",
}

@ARTICLE{Yeom0101:Marking,
AUTHOR="Ikjun Yeom and A. Reddy",
TITLE="Marking for {QoS} improvement",
JOURNAL=comcom,
VOLUME=24,
NUMBER=1,
PAGES="35-50",
MONTH=jan,
YEAR=2001,
KEYWORDS="Differentiated service; Aggregation; Quality of service;
Packet marking strategies; Sender; Receiver QoS",
ABSTRACT="Differentiated services architecture is receiving wide
attention as a framework for providing different levels of service in
the Internet. Current architecture allows customers to mark their
packets and the network provider to check them for conformance to
service contracts. This paper looks at the problem of achieving specific
QoS goals of individual flows by flexibly managing resources available
to an aggregated source. The paper shows that an aggregated source can
maintain state of individual flows at the edge of the network and
utilize this state effectively in adaptively marking packets of
individual flows to meet their QoS goals. The paper also proposes a
simple scheme for improving the service provided to a
receiving-intensive application by transferring resources to the edge of
the network on the sender's side. The paper studies the impact of these
sender's side marking strategy and the receiver's willingness to pay for
resources in achieving QoS goals of individual flows.",
URL="http://www.elsevier.nl/gej-ng/10/15/19/47/24/27/abstract.html",
}

@ARTICLE{Zhu0101:Weighted,
AUTHOR="Haifeng Zhu and Aimin Sang and Shuo-Yen Robert Li",
TITLE="Weighted fair bandwidth sharing using {SCALE} technique",
JOURNAL=comcom,
VOLUME=24,
NUMBER=1,
PAGES="51-63",
MONTH=jan,
YEAR=2001,
ABSTRACT="Currently there is not enough work on the Internet weighted
fair bandwidth sharing without per-flow management, especially when both
UDP and TCP flows of different RTTs and different bandwidth targets
coexist. This paper contains two contributions: A mechanism called
SCALE-WFS, Scalable Core with Aggregation Level labEling Weighted Fair
bandwidth-Sharing, is presented to achieve near-optimal Max-Min weighted
fairness without per-flow management at core routers, in the context of
differentiated service (Diffserv) networks. Through extensive simulation
and simple analysis, we show the performance problems with current
solutions and propose SCALE-WFS to solve these problems. This scheme
works effectively for different flow weights, RTTs, protocols (TCP and
UDP), under the scenarios of different bandwidth provisioning and
multiple congested gateways, all of which we consider the basic
requirements for a practical solution. Apart from",
}

@ARTICLE{Park0101:QoS,
AUTHOR="Kihyun Park and W. Wang",
TITLE="QoS-sensitive transport of real-time {MPEG} video using adaptive
redundancy control",
JOURNAL=comcom,
VOLUME=24,
NUMBER=1,
PAGES="78-92",
MONTH=jan,
YEAR=2001,
KEYWORDS="Adaptive redundancy control; Quality of service; Forward error
correction; Real-time MPEG video",
ABSTRACT="This paper presents an adaptive end-to-end protocol for
quality of service (QoS)-sensitive transport of real-time MPEG video
using packet-level forward error correction in dynamic networks. The
objective is to facilitate a user-specified QoS end-to-end i.e. without
special network support for real-time MPEG video whose timing
constraints rule out the use of retransmission-based congestion control
and QoS provisioning schemes. The degree of redundancy overcode in
forward error correction injected into the network is adjusted as a
function of network state, decreasing when the network is well-behaved
to minimize unnecessary network resource consumption, and increasing
when it is not to compensate for adverse network effects so as to
maintain an invariant level of end-to-end QoS. We describe an adaptive
packet-level forward error correction protocol called AFEC and analyze
its properties with respect to optimality and stability. The optimal
control problem is nontrivial due to the fact that increased redundancy,
beyond a certain point, can backfire resulting in self-induced
congestion which impedes the timely recovery of information MPEG video
frames at the receiver. We experimentally evaluate the efficacy of our
end-to-end QoS control by implementing and customizing AFEC to the
transport of real-time MPEG video. We realize the system as a
transport/application layer protocol running on UNIX workstations, and
measure its performance over controlled network environments. We show
that AFEC is able to effectively hide potentially adverse network
effects such as packet drops and delays stemming from traffic burstiness
and nonstationary structural changes using adaptive redundancy control,
exporting a constant QoS service commensurate with user-specified QoS.",
URL="http://www.elsevier.nl/gej-ng/10/15/19/47/24/30/abstract.html",
}

@ARTICLE{Jeon0101:QoS,
AUTHOR="Sangjin Jeong and Henry Owen and John Copeland and Jr. Sokol",
TITLE="{QoS} support for {UDP/TCP} based networks",
JOURNAL=comcom,
VOLUME=24,
NUMBER=1,
PAGES="64-77",
MONTH=jan,
YEAR=2001,
KEYWORDS="QoS provisioning; Queue policy; Resource reservation;
Router-based QoS",
ABSTRACT="To support UDP-based real-time applications over the Internet,
it is necessary to provide bandwidth to the UDP applications within the
network so that the performance of the UDP applications will not be
seriously affected during periods of congestion. UDP flows do not
typically back off when they encounter congestion. Thus, UDP flows
aggressively use up more bandwidth than TCP friendly flows. Therefore,
while it is important to have router algorithms support UDP flows by
assigning appropriate bandwidth, it is also necessary to protect
responsive TCP flows from unresponsive or aggressive UDP flows so that
all users get a reasonable quality of service (QoS). In this paper, we
propose a set of router-based QoS mechanisms including queue policy,
resource reservation, and metering. These router-based QoS mechanisms
provide rate guarantees to UDP flows, protection of well-behaved TCP
flows from unresponsive UDP flows, and bandwidth fairness between TCP
flows.",
URL="http://www.elsevier.nl/gej-ng/10/15/19/47/24/29/abstract.html",
}

@ARTICLE{Dika0101:Content,
AUTHOR="M. Dikaiakos and A. Stassopoulou",
TITLE="Content-selection strategies for the periodic prefetching of
{WWW} resources via satellite",
JOURNAL=comcom,
VOLUME=24,
NUMBER=1,
PAGES="93-104",
MONTH=jan,
YEAR=2001,
KEYWORDS="Web caching; Satellite multicasting; Content selection;
Quality of service; Pricing",
ABSTRACT="In this paper we study satellite-caching, that is, the
employment of satellite multicasting for the dissemination of prefetched
content to WWW caches. This approach is currently being deployed by
major satellite operators and ISPs around the world. We introduce a
theoretical framework to study satellite-caching and formalize the
notions of Utility and Quality of Service. We explore two charging
schemes, Usage- and Subscription-based pricing, and propose a framework
for negotiating the provision of the satellite-caching service between a
satellite operator and its potential clients. We use this negotiation
framework to compare theoretically the two pricing schemes at hand. We
apply our modeling to formulate the selection of Web-content for
satellite-multicasting as a combinatorial optimization problem. We study
the complexity of Web-content selection and prove it is NP-complete.
Finally, we propose and implement an approximation algorithm for content
selection, and conduct experiments to assess its efficiency, validity
and applicability.",
URL="http://www.elsevier.nl/gej-ng/10/15/19/47/24/31/abstract.html",
}

@ARTICLE{Kon0101:Using,
AUTHOR="F. Kon and R. Campbell and Klara Nahrstedt",
TITLE="Using dynamic configuration to manage a scalable multimedia
distribution system",
JOURNAL=comcom,
VOLUME=24,
NUMBER=1,
PAGES="105-123",
MONTH=jan,
YEAR=2001,
KEYWORDS="Multimedia distribution; Dynamic configuration; Middleware;
CORBA; QoS-aware resource management",
ABSTRACT="Multimedia applications and interfaces will change radically
the way computer systems will look like in the coming years. Radio and
TV broadcasting will assume a digital format and their distribution
networks will be integrated to the Internet. Existing hardware and
software infrastructures, however, are unable to provide all the
scalability, flexibility, and quality of service (QoS) that these
applications require. We present a framework for building scalable and
flexible multimedia distribution systems that greatly improves the
possibilities for the provision of quality of service in large-scale
networks. We show how to use architectural-awareness, mobile agents, and
a CORBA-based framework to support dynamic (re)configuration, efficient
code distribution, and fault-tolerance. This approach can be applied not
only for multimedia distribution, but also for any QoS-sensitive
distributed application.",
URL="http://www.elsevier.nl/gej-ng/10/15/19/47/24/32/abstract.html",
}

@ARTICLE{Schu0101:Internet,
AUTHOR="Henning Schulzrinne",
TITLE="{Internet} Telefonie -- Mehr als nur ein Telefon mit
Paketvermittlung",
JOURNAL=pik,
VOLUME=24,
NUMBER=1,
MONTH=jan,
YEAR=2001,
KEYWORDS="Internet telephony",
URL="http://www.cs.columbia.edu/~hgs/papers/Schu0101\_Einfuhrung.pdf",
}

@ARTICLE{Part0101:Improving,
AUTHOR="Chiang Lee and Chih-Horng Ke and Chao-Chun Chen",
TITLE="Improving location management for mobile users with frequently
visited locations",
JOURNAL=pe,
VOLUME=43,
NUMBER=1,
PAGES="1-14",
MONTH=jan,
YEAR=2001,
KEYWORDS="Transient analysis; Tridiagonal determinants; Blocking
probabilities",
ABSTRACT="Most of the real-time applications involve connection
establishment in point-to-point (unicast) communication in computer
networks that can be modelled as a problem of resource allocation and
resource sharing. These applications have different streams, such as
video, voice, graphics, etc., each having different arrival rates. A
stream (call) will be admitted into the network only if the network
guarantees the `Quality of Service' (QoS) parameters of the call such as
bandwidth, delay, jitter and loss probability. Otherwise, the call is
rejected. Hence, the study of call blocking probabilities in such
communication networks is a problem of growing importance. Application
of queueing theory to solve these problems has received considerable
attention in the research community. Due to the real-time nature of the
applications, it is pertinent to study the time-dependent behaviour of
such systems. In this paper, a real-time unicast communication has been
modelled as a multi-dimensional Markov process to obtain the
time-dependent blocking probabilities. The time-dependent system size
probabilities, means, variances and correlation coefficients of
different streams are also obtained.",
URL="http://www.elsevier.nl/gej-ng/10/35/22/48/22/22/article.pdf",
}

@ARTICLE{Fern0101:Connection,
AUTHOR="Huei-Wen Ferng and Jin-Fu Chang",
TITLE="Connection-wise end-to-end performance analysis of queueing
networks with {MMPP} inputs",
JOURNAL=pe,
VOLUME=43,
NUMBER=1,
PAGES="39-62",
MONTH=jan,
YEAR=2001,
LANGUAGE="English",
KEYWORDS="MMPP; Queueing network; Output process characterization;
End-to-end performance analysis",
ABSTRACT="A systematic method for link/connection-wise end-to-end
performance evaluation in queueing networks receiving heterogeneous
Markov-modulated Poisson processes (H-MMPPs) is proposed. The method
consists of (i) connection-wise nodal performance analysis; (ii)tagged
departure process analysis; and (iii) moment matching. For the tagged
departure process of an H-MMPPs/G/1 queue, we propose two decomposition
schemes to approximate the output process of a tagged traffic stream
which is mixed with other traffic streams. A moment matching method is
further proposed to emulate the tagged output process as a two-state
MMPP. The adjacent down-stream node along a reference connection can be
then modeled as an H-MMPPs/G/1 queue. Recursively performing (i)-(iii),
the end-to-end performance of a reference connection is obtained. The
methodology developed in this paper can be applied to packet-switched
high-speed networks, especially to asynchronous transfer mode (ATM)
networks.",
URL="http://www.elsevier.nl/gej-ng/10/35/22/48/22/24/article.pdf",
}

@TECHREPORT{Cisc01:Migrating,
AUTHOR="{Cisco Systems}",
TITLE="Migrating to Multiservice Networks - A Planning Primer",
INSTITUTION="Cisco",
MONTH=jan,
YEAR=2001,
KEYWORDS="busy hour load; IP telephony; packet voice; dimensioning;
traffic engineering",
ABSTRACT="This planning guide reviews the decisions to consider when
evolving data-only networks toward a more robust multiservice
infrastructure that can include data, voice, and video traffic.",
URL="http://www.cisco.com/warp/public/cc/pd/rt/2600/tech/st10\_wp.htm",
}

@ARTICLE{Emil0101:Web,
AUTHOR="Emilia Mendes and Nile Mosley and Steve Counsell",
TITLE="Web Metrics--Estimating Design and Authoring Effort",
JOURNAL=ieeemm,
VOLUME=8,
NUMBER=1,
MONTH=jan,
YEAR=2001,
ABSTRACT="Like any software process, Web application development would
benefit from early-stage effort estimates. Using an undergraduate
university course as a case study, the authors collected metrics
corresponding to Web applications, developers, and tools. Then they used
those metrics to generate models for predicting design and authoring
effort for future Web applications.",
URL="http://www.computer.org/multimedia/mu2001/u1toc.htm",
}

@ARTICLE{Schl0101:Scalable,
AUTHOR="Julie Schlembach and Anders Skoe and Ping Yuan and Edward W.
Knightly",
TITLE="Design and Implementation of Scalable Admission Control",
JOURNAL="Lecture Notes in Computer Science",
VOLUME=1989,
PAGES="1-15",
MONTH=jan,
YEAR=2001,
REFERENCES=12,
ABSTRACT="While the IntServ solution to Internet QoS can achieve a
strong service model that guarantees flow throughputs and loss rates, it
places excessive burdens on high-speed core routers to signal, schedule,
and manage state for individual flows. Alternatively, the DiffServ
solution achieves scalability via aggregate control, yet cannot ensure a
particular QoS to individual flows. To simultaneously achieve
scalability and a strong service model, we have designed and implemented
a novel architecture and admission control algorithm termed Egress
Admission Control. In our approach, the available service on a network
path is passively monitored, and admission control is performed only at
egress nodes, incorporating the effects of cross traffic with implicit
measurements rather than with explicit signaling. In this paper, we
describe our implementation of the scheme on a network of prototype
routers enhanced with ingress-egress path monitoring and edge admission
control. We report the results of testbed experiments and demonstrate
the feasibility of an edge-based architecture for providing IntServ-like
services in a scalable way.",
URL="http://link.springer.de/link/service/series/0558/bibs/1989/19890001.htm",
}

@ARTICLE{Bern0101:Connection,
AUTHOR="Giulia Bernardini and Stefano Giordano and Gregorio Procissi and
Sandra Tartarelli",
TITLE="Analysis and Performance Evaluation of a Connection Admission
Control Scheme Based on the Many Sources Asymptotic",
JOURNAL="Lecture Notes in Computer Science",
VOLUME=1989,
PAGES="17-31",
MONTH=jan,
YEAR=2001,
REFERENCES=11,
ABSTRACT="A parsimonious traffic characterisation allows the design of
efficient measurement based Connection Admission Control (CAC)
algorithms. In recent years the notion of effective bandwidth (EB) has
been successfully employed to quantify the amount of bandwidth to allot
a connection in order to meet its Quality of Service (QoS) requirements.
The EB function depends on two parameters, namely the time scale and the
space scale, whose values represent the link operating point and they
are related to the link capacity, the buffer size and the traffic mix.
In this paper we present a study of the Many Sources Asymptotic (MSA), a
Large Deviations technique that employs the notion of EB to evaluate the
performance of a queueing system. Since the MSA requires to determine
the time and space parameters, we firstly analysed their sensitivity to
the variation of the traffic mix. We subsequently applied the results of
this analysis to the refinement of a CAC algorithm based on the MSA, by
using suitable thresholds for bounding the smallest mix variation beyond
which a new estimation of the link operating point is required. Finally,
we compared the performance of a CAC algorithm employing first the MSA
then the Large Buffer Asymptotic (LBA) to estimate the bandwidth
requirement of the active calls.",
URL="http://link.springer.de/link/service/series/0558/bibs/1989/19890017.htm",
}

@ARTICLE{Boll0101:Call,
AUTHOR="Raffaele Bolla and Franco R Davoli and Mario Marchese and Marco
Perrando",
TITLE="Call Admission Control and Routing of QoS-Aware and Best-Effort
Flows in an {IP-over-ATM} Networking Environment",
JOURNAL="Lecture Notes in Computer Science",
VOLUME=1989,
PAGES="33-49",
MONTH=jan,
YEAR=2001,
REFERENCES=20,
ABSTRACT="In the context of an IP-over-ATM access and transport network,
carrying guaranteed quality (CBR, rt-VBR) services as well as IP
datagrams (as ABR or UBR traffic classes), we consider the joint
problems of Call Admission Control (CAC), bandwidth allocation and
routing. The presence of distributed access multiplexers is assumed,
which are both geographically dispersed (e.g., at the user premises) and
hierarchically structured. Such multiplexers are intelligent devices
with decision making capabilities that operate jointly, in order to make
the best possible use of the transport capacity of the access network
and to maintain the Quality of Service (QoS) requirements of different
users and service classes. Following the physical system organization, a
hierarchical control structure is defined, where the admission of calls
for real-time traffic classes (or different users) is performed by
independent controllers; the latter are parametrized by the bandwidths
allocated by a common link agent, playing the role of a ``link
coordinator'' in the hierarchical control scheme. This decision maker
aims at minimizing a general cost that captures QoS requirements both at
the call-level (call blocking probability) for QoS-aware,
connection-oriented services and at the cell-level (cell loss
probability) for connectionless, best-effort, ones. The control
architecture also reflects the multilayer hierarchy introduced by the
presence of multiple teletraffic time scales, by essentially decoupling
the above problem from that of ensuring QoS at the cell-level for
services of the first type. We derive the optimal parameters' setting
from the numerical solution of a mathematical programming problem. Then,
the same structure is applied to link multiplexers of the transport
network nodes, which are supposed to possess both ATM and IP
switching/routing capabilities. Routing strategies at both ATM and IP
levels are defined, which are combined with the above described CAC and
bandwidth allocation scheme. The performance of the whole structure is
tested by simulation.",
URL="http://link.springer.de/link/service/series/0558/papers/1989/19890033.pdf",
}

@ARTICLE{List0101:Upper,
AUTHOR="Marco Listanti and Fabio Ricciato and Stefano Salsano",
TITLE="An Upper Bound to the Loss Probability in the Multiplexing of
Jittered Flows",
JOURNAL="Lecture Notes in Computer Science",
VOLUME=1989,
PAGES="51-66",
MONTH=jan,
YEAR=2001,
REFERENCES=7,
ABSTRACT={In the context of Diffserv networks some services should be
characterized by end-to-end quantitative QoS guarantees. In order to
provide such guarantees to single flows (or flow aggregates), the
end-to-end analysis of de-lay and loss performance in a Diffserv domain
is needed. The impact of jitter should be considered in the performance
analysis at the successive nodes along the path of a flow (flow
aggregate). Worst-case analysis is a solution to provide deterministic
quantitative guarantees, at the price of very low efficiency. As an
alternative this paper proposes a probabilistic approach, aimed at
providing statistical quantitative guarantees and achieve higher
efficiency. The proposed analytical approach is based on the insertion
of a discarding device before the FIFO queue, called "dropper". The
purpose of the dropper is to avoid the analysis of the congestion at the
burst level in the queue, allowing for the application of an analytical
result derived for packet scale conflicts in the modulated ND/D/1 queue.
Simulations are presented that validate the analytical bound. Finally
numerical results are provided to evaluate the efficiency of the bound
in an admission control scheme.},
URL="http://link.springer.de/link/service/series/0558/papers/1989/19890051.pdf",
}

@ARTICLE{Vutu0101:SMART,
AUTHOR="Srinivas Vutukury and Jose J. Garcia-Luna-Aceves",
TITLE="{SMART:} A Scalable Multipath Architecture for Intra-domain {QoS}
Provisioning",
JOURNAL="Lecture Notes in Computer Science",
VOLUME=1989,
PAGES="67-79",
MONTH=jan,
YEAR=2001,
REFERENCES=22,
ABSTRACT="The main concern with the IETF proposed Intserv architecture
is that the use of per-flow routing and reservation state in the routers
may not be scalable to high-speed backbone networks. This paper proposes
the Scalable Multipath Aggregated RouTing (SMART) architecture that
aggregates flows along multipaths such that the per-flow reservation
state in the routers is reduced to a small scalable aggregated state
whose size is dependent only on the number of destinations and flow
classes. The SMART architecture can be implemented in current IP
networks and the complexity is similar to the best-effort IP
architecture.",
URL="http://link.springer.de/link/service/series/0558/papers/1989/19890067.pdf",
}

@ARTICLE{Davo0101:Definition,
AUTHOR="Franco R Davoli and Daniele Luscardo and Piergiulio Maryni and
Angelo Pietra",
TITLE="Definition and Experimental Evaluation of an Architecture for
Joint Quality of Service Control in Multimedia Networks",
JOURNAL="Lecture Notes in Computer Science",
VOLUME=1989,
PAGES="81-95",
MONTH=jan,
YEAR=2001,
REFERENCES=28,
ABSTRACT="We introduce a control architecture in which several
(independent) multimedia clusters share the same (local or metropolitan)
networking resources in a controlled framework. In particular, a central
entity (i.e., the Gatekeeper) harmonizes the transmission rates of the
various clusters following a given sharing policy. Each cluster, in
turn, adopts its own end-to-end rate control mechanism to meet the
Gatekeeper's transmission rate indications. A testbed has been developed
and the system has been evaluated with real experiments by using
different types of transmission sources. A software architecture is also
introduced and described, with particular reference to the middleware
framework realized with the Jini system.",
URL="http://link.springer.de/link/service/series/0558/papers/1989/19890081.pdf",
}

@ARTICLE{Bore0101:Quality,
AUTHOR="Andrea Borella and Giovanni Cancellieri and Elena Pagani and
Gian Paolo Rossi",
TITLE="Quality-of-Service Guarantees for Multicast Traffic in
Heterogeneous Multi-service Networks*",
JOURNAL="Lecture Notes in Computer Science",
VOLUME=1989,
PAGES="97-112",
MONTH=jan,
YEAR=2001,
REFERENCES=16,
ABSTRACT="Multimedia and real-time applications have peculiar
requirements in terms of the quality of data transmission services, that
are not satisfied by the best effort nature of IP. Moreover, many of the
multimedia applications are characterized by a multicast communication
pattern. In this work, we propose a functional architecture aiming at
providing a common framework to deploy network protocols supporting QoS.
The architecture is compliant with the main standards proposed in the
literature. We discuss two possible implementations of the architecture
modules for the service set-up, in either the int-serv model or the
diff-serv model. We present some performance evaluations obtained by
performing experiments with those two implementations.",
URL="http://link.springer.de/link/service/series/0558/papers/1989/19890097.pdf",
}

@ARTICLE{Gerl0101:Resource,
AUTHOR="Mario Gerla and Claudio E. Casetti and Scott Seongwook Lee and
Gianluca Reali",
TITLE="Resource Allocation and Admission Control Styles in {QoS}
DiffServ Networks",
JOURNAL="Lecture Notes in Computer Science",
VOLUME=1989,
PAGES="113-128",
MONTH=jan,
YEAR=2001,
REFERENCES=20,
ABSTRACT="In this paper we propose a DiffServ architecture for the
support of real time traffic (e.g., video) with QoS constraints (e.g.,
bandwidth and delay) over an IP domain. The main goal of the paper is to
identify solutions which provide QoS guarantees without requiring per
flow processing in the core routers (as is commonly done in IntServ
solutions) and which are thus scalable. We propose, and evaluate through
simulation, different approaches for call admission control (CAC) and
resource allocation. These approaches are all consistent with the
DiffServ model, but place different processing and signaling loads on
edge and core routers. Paths are computed by means of a QoS routing
algorithm, Q-OSPF, and MPLS is used to handle explicit routing and class
separation.",
URL="http://link.springer.de/link/service/series/0558/papers/1989/19890113.pdf",
}

@ARTICLE{Paga0101:Multicast,
AUTHOR="Elena Pagani and Gian Paolo Rossi and Dario Maggiorini",
TITLE="A Multicast Transport Service with Bandwidth Guarantees for
Diff-Serv Networks*",
JOURNAL="Lecture Notes in Computer Science",
VOLUME=1989,
PAGES="129-140",
MONTH=jan,
YEAR=2001,
REFERENCES=18,
KEYWORDS="Quality-of-Service; multicast; call admission control;
diff-serv domains; bandwidth broker; performance evaluation.",
ABSTRACT="The Int-Serv and Diff-Serv differentiation approaches, which
have been proposed by the IETF, are in practice unable to provide QoS
guarantees to the emerging multicast-enabled applications by means of a
scalable mechanism able to support QoS services on a per-call basis and
dynamic group memberships. This paper describes a new approach that is
capable of ensuring bandwidth guarantees to multicast sessions on
IP-based networks and satisfies the above requirements. It includes a
scalable, end-to-end Call Admission Multicast Protocol (CAMP) that
operates as a sort of distributed bandwidth broker and allows to combine
the benefits of both the IS and DS approaches in a single approach which
is simple, scalable, operates on a per-call basis and supports the group
membership dynamics.",
URL="http://link.springer.de/link/service/series/0558/papers/1989/19890129.pdf",
}

@ARTICLE{Case0101:Modeling,
AUTHOR="Claudio E. Casetti and Michela Meo",
TITLE="Modeling the Stationary Behavior of {TCP} Reno Connections*",
JOURNAL="Lecture Notes in Computer Science",
VOLUME=1989,
PAGES="141-156",
MONTH=jan,
YEAR=2001,
REFERENCES=11,
ABSTRACT="In this paper, we outline a methodology that can be applied to
model the behavior of TCP Reno flows. The proposed methodology stems
from a Markovian model of a single TCP source, and eventually considers
the superposition and interaction of several such sources using standard
queueing analysis techniques. Our approach allows the evaluation of such
performance indices as throughput, queueing delay and segment loss of
TCP flows. The results obtained through our model are validated by means
of simulation, under different traffic settings.",
URL="http://link.springer.de/link/service/series/0558/papers/1989/19890141.pdf",
}

@ARTICLE{Coci0101:Markov,
AUTHOR="Francesco Cocimano and Alfio Lombardo and Giovanni Schembra",
TITLE="A Markov Model for the Design of Feedback Techniques to Match
Traffic Specification Parameters in {MPEG} Video Sources",
JOURNAL="Lecture Notes in Computer Science",
VOLUME=1989,
PAGES="157-172",
MONTH=jan,
YEAR=2001,
REFERENCES=14,
ABSTRACT="Guaranteeing of quality-of-service (QoS) is a challenging task
to promote the evolution of the Internet from a simple data network into
a true multiservice network. To this end, the IETF intserv Working
Group, with the goal of defining a next generation Internet, has defined
two QoS classes: Guaranteed Services and Controlled-Load Services. For
both of them the source is required to declare its traffic
characteristics by means of a number of Tspec parameters and guarantee
these traffic characteristics during transmission. The target of this
paper is to develop an analytical tool for the design of feedback laws
which allow MPEG encoders to inject into the network video traffic
shaped according to the declared Tspec, while maintaining an acceptable
perceived quality.