@INPROCEEDINGS{,
AUTHOR="Lajos Hanzo",
TITLE="Full-day Tutorial: Joint Physical and Network Layer Optimisation of
Wireless Systems: Smart Antennas, Turbo Coding, Space-Time Coding,
Adaptive Transceivers and 'all that' for Improved QoS",
BOOKTITLE="Vehicular Technology Conference Fall 2003",
ADDRESS="Orlando, Florida",
DAYS=4,
MONTH=oct,
YEAR=2003,
ABSTRACT="This overview is based on the Wiley/IEEE Press monographs ``Blogh,
Hanzo: Third-Generation Systems and Intelligent Wireless Networking:
Smart Antennas and Adaptive Modulation''; ``L. Hanzo, et al.: Adaptive
Wireless Transceivers: Turbo-Coded, Turbo-Equalised and Space-Time
Coded TDMA, CDMA and OFDM systems''; ``L. Hanzo, et al.: Turbo Coding,
Turbo Equalisation and Space-Time Coding'' (for sample chapters and
full contents please refer to http://www-mobile.ecs.soton.ac.uk). The
short course provides an insight into the effects of turbo-coded,
turbo-equalised and space-time coded adaptive TDMA, CDMA and OFDM
transceivers as well as smart antennas and a range of other efficient
networking techniques on the achievable teletraffic capacity of
adaptive wireless systems.  

This research-oriented presentation considers the
joint benefits of both adaptive physical and adaptive
network-layer performance enhancement techniques.
More specifically, conventional systems would drop a call in progress,
if the communications quality falls below the target quality of
service and it cannot be improved by handing over to another physical
channel. By contrast, the adaptive transceivers of the near future are
expected to simply 'instantaneously drop the throughput, rather than
dropping the call' by reconfiguring themselves in a more robust mode
of operation. 
It is demonstrated that the proposed beam-forming
and adaptive transmission techniques may double the expected
teletraffic capacity of the system, whilst maintaining the same
AVERAGE performance as their conventional fixed-mode counterparts.


Whilst this overview is ambitious in terms of providing a
research-oriented outlook, potential attendees require only a modest
background in wireless communications. Network operators, service
providers, managers and researchers embarking on the joint
optimisation of the physical and network layer may find the coverage
of the presentation beneficial. The participants will receive
a number of book chapters downloadable from the www
and a set of slides as supporting material.


The lecturer of this course is Lajos Hanzo
(http://www-mobile.ecs.soton.ac.uk) 

During his 26-year carreer he has
held various academic and research positions in Hungary, Germany and
the UK.  Since 1986 he has been with the University of Southampton,
where he holds the Chair of Telecommunications. Over the years he has
co-authored 10 books on mobile radio communications, published
about 400 research papers and has been awarded a number of
distinctions. He is an IEEE Distinguished Lecturer.
For further information on research in progress and for associated
papers and book chapters please refer to http://www-mobile.ecs.soton.ac.uk"
}

@INPROCEEDINGS{,
AUTHOR="John Miller",
TITLE="Tutorial: Theory and Application of Ultracapacitors for Automotive Systems",
BOOKTITLE="Vehicular Technology Conference Fall 2003",
ADDRESS="Orlando, Florida",
DAYS=4,
MONTH=oct,
YEAR=2003,
ABSTRACT="In this tutorial the attendees will gain exposure to ultracapacitor theory,
modeling and applications.  Ultracapacitors are electrolytic double layer
structures that possess enormous surface area (2000 m2/kg), surface area
to interface dimensions on the order of 1012, have 100 times the energy
density of conventional capacitors and 10 times the power density of
electrochemical batteries.  Attendees will learn the system demands on
power density to energy density (P/E) of energy storage systems and how
ultracapacitors fit into various vehicle electrical architectures as
distributed energy sources and as energy buffers for hybrid vehicle
traction applications."
}

@INPROCEEDINGS{,
AUTHOR="Ali Emadi and Ranjit Jayabalan",
TITLE="Power Generation Systems and Integrated Starter/Alternators for Automotive
Applications",
BOOKTITLE="Vehicular Technology Conference Fall 2003",
ADDRESS="Orlando, Florida",
DAYS=4,
MONTH=oct,
YEAR=2003,
ABSTRACT="The electric power demands in automobiles have been increasing considerably
over the past few decades and, thus, there is a dire need for high power
generation systems. The concept of power-on-demand seeping rapidly into
the automobiles industry has given a significant boost for the need for
the new generation systems that not only provide high power, but also has
them delivered efficiently.
This tutorial presents the power generation systems in automobiles. Major
fuel cell structures, operation, and characteristics are explained. The
new high power alternators are also described and their performance and
system features are comprehensively outlined and compared to the
conventional systems. The concept of integrated starter/alternator (ISA),
a single machine that performs the function of both the starter and the
alternator, are introduced from the point of system characteristics,
design, and integration into the drive train of the vehicle along with the
associated issues involved. 
The current and future trends in power electronics are also highlighted
from the perspective of applications to the automotive power generation
systems for higher system flexibility, reliability, performance, and
efficiency. This tutorial will conclude with the inherent advantages of
these power electronic based generation systems and the cost aspects for
commercial introduction."
}

@INPROCEEDINGS{,
AUTHOR="Byoung-Jo Kim and Rajeev Shorey",
TITLE="The Theory and Practice of Wireless LANs and Wireless MANs: Design,
Performance, Architecture and Applications",
BOOKTITLE="Vehicular Technology Conference Fall 2003",
ADDRESS="Orlando, Florida",
DAYS=4,
MONTH=oct,
YEAR=2003,
ABSTRACT="The promise of untethered computing in workplaces and public areas is
becoming a reality. IEEE 802.11b and IEEE 802.11a (11 Mbps and 54 Mbps
respectively) wireless LAN standard, has arrived in full force, and market
response has been extremely positive. As the WLAN market takes off, the
broadband fixed wireless access industry, which provides high-rate network
connections to stationary sites, has matured to the point at which it now
has a standard for second-generation wireless metropolitan area networks.
IEEE 802.16, with its Wireless MAN air interface, sets the stage for
widespread and effective deployments worldwide. How are these standards
different and what markets are these standards chasing? This tutorial will
explain the key design aspects of IEEE 802.11 (a, b, g) and IEEE 802.16
standards and illustrate how technology innovation and market forces are
shaping their evolution. We will begin with some basic concepts (RF,
signal processing, propagation and wireless networking) and technology
trends. We will then give an overview of 802.11 and the 802.16
specification, followed by their application scenarios and current
commercial focuses. The theoretical and real-world performance of IEEE
802.11 will be discussed along with co-existence issues with other
technologies including Bluetooth, followed by their impact on higher layer
networking functions and applications. We will then briefly address issues
related to large scale deployment and management of WLAN and WMAN systems.
The final part will be devoted to future directions and open research
issues in Wireless LANs and Wireless MANs."
}

@INPROCEEDINGS{,
AUTHOR="Upkar Varshney",
TITLE="A Tutorial on {4G} Quality of Service",
BOOKTITLE="Vehicular Technology Conference Fall 2003",
ADDRESS="Orlando, Florida",
DAYS=4,
MONTH=oct,
YEAR=2003,
ABSTRACT="With recent advances in 3G wireless networks, the research and development
efforts are directed towards 4G wireless networks. The 4G wireless
networks will allow users to move from one type of wireless networks to
another. This roaming across multiple heterogeneous wireless networks,
high bandwidth services and wireless Internet applications require a
significant amount of research and development efforts. In the proposed
tutorial, we are planning to cover issues in 4G wireless networks, several
possible architectures, new and modified existing QoS schemes, and open
research problems."
}

@INPROCEEDINGS{,
AUTHOR="Jordi Perez-Romero",
TITLE="Radio Resource Management strategies for QoS provision in {UTRA}",
BOOKTITLE="Vehicular Technology Conference Fall 2003",
ADDRESS="Orlando, Florida",
DAYS=4,
MONTH=oct,
YEAR=2003,
ABSTRACT="One of the key factors that will determine the success of the third
generation (3G) technologies will be the ability to provide new wideband
multimedia services under different QoS guarantees. In this context, the
definition and assessment of suitable Radio Resource Management (RRM)
strategies for the UTRA segment of UMTS is a key issue for achieving the
expectations created on 3G technology. RRM functionalities are very
important in the framework of 3G systems since the system relies on them
to guarantee the target QoS, to maintain the planned coverage area and to
offer a high capacity. Moreover, RRM functions can be implemented in many
different ways, this having an impact on the overall system efficiency and
on the operator infrastructure cost, so that definitively RRM strategies
will play an important role in a mature UMTS scenario. Additionally, RRM
strategies are not subject of standardisation, so that they can be a
differentiation issue among equipment producers and operators. Under this
framework, this half-day tutorial presents how the RRM problem is dealt in
the context of UMTS and provides solutions with respect to different RRM
functions like admission control, load control, handover, packet
scheduling and power control."
}

@ARTICLE{Abdu0312:Model,
AUTHOR="Hasina Abdu and Hanan Lutfiyya and Michael Bauer",
TITLE="A model for efficient configuration of management agents in distributed
systems",
JOURNAL="Performance Evaluation",
VOLUME=54,
NUMBER=4,
PAGES="285-309",
MONTH=dec,
YEAR=2003,
REFERENCES=25,
KEYWORDS="Distributed systems management; Management agents; Management
configuration; Management policies; Optimisation",
ABSTRACT="With the increased availability and complexity of distributed systems comes
a greater need for solutions to assist in the management of distributed
system components. Despite the significant contributions made towards the
development of management tools that monitor and control distributed
systems, little has been done towards formally defining management systems
and the requirements to be satisfied by these systems. In this paper, we
model three main aspects of achieving efficiency in distributed systems
management: (i) the need for minimising resource consumption by
management, (ii) the need to satisfy system and application requirements,
and (iii) the need for dynamic solutions. We also present experimental
results that illustrate the scalability and validity of our model.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-4851D06-1-9H\&\_cdi=5663\&\_orig=browse\&\_coverDate=12\%2F31\%2F2003\&\_sk=999459995\&view=c\&wchp=dGLbVtz-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=5a0fd0453f683f89c2115b1d553f0371\&ie=f.pdf"
}

@ARTICLE{Abou0301:Comprehensive,
AUTHOR="Alhussein Abouzeid and Soumya Roy and Murat Azizoglu",
TITLE="Comprehensive Performance Analysis of a {TCP} Session over a Wireless
Fading Link with Queuing",
JOURNAL="IEEE Transactions on Wireless Communications",
VOLUME=2,
NUMBER=1,
MONTH=jan,
YEAR=2003
}

@INPROCEEDINGS{Abra0305:Analytical,
AUTHOR="Andrea Abrardo",
TITLE="Analytical Evaluation of Transmit Selection Diversity for {MIMO} wireless
channels",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The performance of a simple MIMO switched diversity scheme, where
the transmitter selects one out of n\_t available transmit
antennas, is presented. The selected antenna is chosen basing on
limited information feedback from the receiver, where the only
information fed back is the selected transmit antenna to be used.
In this context, an analytical approach for the evaluation of the
impact of mobile speed on the system performance is derived. Then,
comparisons between switched diversity and space-time coding
performance are given. Such results assess the validity of the
considered switched diversity approach for low mobility-low
complexity MIMO wireless systems."
}

@INPROCEEDINGS{Acha0303:IP,
AUTHOR="Swarup Acharya and Bhawna Gupta and Pankaj Risbood and Anurag Srivastava",
TITLE="IP-Subnet Aware Routing in {WDM} Mesh Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We explore the problem of routing bandwith grranteed paths in
wavelength-routed, WDM optical mesh networks. A WDM Mesh network offers
great flexibility in dynamically re-configuring the optical core to match
the IP layer demands.  In this paper, we argue that, IP subnets can limit
the re-configurability potential of the WDM Mesh network. We show that
finding the shortest IP-hop path, normally admitting a straightforward
polynomial solution on the WDM Mesh, is NP-hard in the presence of
subnets. We propose a new algorithm called
MobiTwist that finds the optimal shortest path when accounting for
subnets. We also observe that subnets impose a routing penalty by forcing
longer paths for bandwidth demands.  Consequently, they create a trade-off
between lower network efficiency if subnets are honored (due to longer
paths) or, higher utilization at the expense of upfront overhead of
dynamically changing subnets to derive shorter paths. We propose the
MobiFlex algorithm that attempts to achieve a balance by finding the
shortest path, given an upper limit on the number of subnet violations
acceptable.  The inherent hardness of the routing problem due to subnets
precludes a solution with low worst-case complexity. However, we present
performance results that show that both the algorithms proposed are
extremely efficient in routing demands, and in practice, do so in
polynomial time."
}

@INPROCEEDINGS{Acha0305:Mpls,
AUTHOR="Swarup Acharya and Bhawna Gupta and Pankaj Risbood and Anurag Srivastava",
TITLE="{MPLS} Network Tuning: Enabling Hitless Network Engineering",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="MPLS traffic engineering has primarily focussed on efficient route setups. 
However, as data traffic explodes, lacking the hierarchical growth
structure of voice traffic, there is an increased demand for tools that
enable network-wide tuning in order to sustain required levels of
end-to-end network efficiency. Network tuning aims to proactively
reconfigure traffic and topology without causing any service disruption.
In this paper, we explore the requirements on a management systems to
support tuning. While network design tools have similar goals, the
additional requirement for online, hitless optimization fundamentally
changes the nature of the problem. We present an efficient algorithm for
network tuning called MöbiTree. Using extensive simulation results, we
show that the greedy approach in MöbiTree outperforms traditional
traffic design schemes. More importantly, it achieves the gains while
ensuring a hitless reconfiguration.  Moreover, it has low computational
overhead making it feasible to implement in practice. Even though this
work is done in the context of MPLS tuning, it is applicable to Virtual
Topology reconfiguration in WDM Networks as well."
}

@INPROCEEDINGS{Acha0305:Ts,
AUTHOR="Arup Acharya and Chatschik Bisdikian and Archan Misra and Young-Bae Ko",
TITLE="ts-PWLAN: A Value-add System for Providing Tiered Wireless Services in
Public Hot-spots",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Access to data services via wireless LANs at private (e.g., corporations or
home) and public hot-spot (e.g., hotels and airports) settings is becoming
commonplace daily. Data access via (for profit) public wireless LAN
(PWLAN) instal-lations is typically based on user subscription and
pre-configured services profiles pertaining primarily access to the global
Internet. The goal of the ts-PWLAN  project is to define an architecture
and a prototype implementation that enables the provision of premium and
non-premium tiers of services to transient and non-transient users.
ts-PWLAN provides for dynamic renegotiations of tier of services and
enables various billing modes, e.g., based on connectivity time and usage,
thus enabling service providers to increase their revenue opportunities via
multiple service offerings."
}

@INPROCEEDINGS{Achi0305:Predictive,
AUTHOR="Mounir Achir and Yacine {Ghamri Doudane} and Guy Pujolle",
TITLE="Predictive Resource Allocation in Cellular Networks using Kalman Filters",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Controlling handoff drops in a cellular network is a very important QoS
issue. In order to keep the handoff-dropping probability as low as 
possible, we have designed a new predictive scheme for radio resource 
allocation. This scheme consists in dimensioning the amount of resources
to reserve for handoffs in each cell. The solution proposed is based on a
reservation mechanism with a threshold estimated according to the usage
history of the resources in the cell. This estimation is done using the
Kalman filter, a powerful mathematical tool. Evaluation of the proposed
scheme demonstrates a real improvement in the handoff-dropping 
probability compared to the static reservation scheme."
}

@ARTICLE{Adel0306:Distributed,
AUTHOR="Frank Adelstein and Golden Richard and Loren Schwiebert",
TITLE="Distributed multicast tree generation with dynamic group membership",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=10,
PAGES="1105-1128",
MONTH=jun,
YEAR=2003,
REFERENCES=23,
NOTE="Golden G. Richard's full name is Golden G. Richard, III",
KEYWORDS="Multicast protocols; Dynamic multicast groups; Distributed Steiner
algorithms; Mobile networks",
ABSTRACT="As group applications have become more prevalent, efficient network
utilization becomes a growing concern. Multicast transmission may use
network bandwidth more efficiently than multiple point-to-point messages,
however, creating optimal multicast trees is prohibitively expensive. For
this reason, heuristic methods are generally employed. These heuristics
are often based on a Steiner tree approach, which is known to produce
multicast trees that achieve an efficient use of network resources. Many
such algorithms, both centralized and distributed, have been proposed to
generate good multicast trees. Even these heuristics typically have
significant execution times, however, so changes to the initial group of
multicast participants during generation of the tree is likely.
Furthermore, periodic rebuilding of multicast trees or sub-trees has been
proposed to improve the efficiency of these trees as the group membership
evolves. Changes in group membership are also possible during this
rebuilding process. Existing algorithms, however, either do not support
changes to the multicast group during building of the tree or they impose
unrealistic restrictions, such as no overlapping modifications or
regeneration of the tree after every change. These restrictions prevent
the use of such algorithms in many situations, e.g.; networks with mobile
hosts. To remedy this, we propose an efficient distributed algorithm that
supports dynamic changes to the multicast group during tree building and
allows concurrent join/leave operations. In this paper, we present the
algorithm, a proof of correctness, and detailed simulation results.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47DMH5V-1-15\&\_cdi=5624\&\_orig=browse\&\_coverDate=06\%2F20\%2F2003\&\_sk=999739989\&view=c\&wchp=dGLbVzb-zSkzS\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=64dfe4240bb6f2e6f29573a493d771c1\&ie=f.pdf"
}

@INPROCEEDINGS{Adle0303:Estimation,
AUTHOR="Micah Adler and Jin-Yi Cai and Jonathan Shapiro and Don Towsley",
TITLE="Estimation of Congestion Price Using Probabilistic Packet Marking",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="One key component of recent pricing-based congestion control schemes is an
algorithm for probabilistically setting the Explicit Congestion
Notification bit at routers so that a receiver can estimate the sum of
link congestion prices along a path.
We consider two such algorithms---a well-known algorithm called Random
Early Marking (REM) and a novel algorithm called Self-Normalizing Additive
Marking (SAM).
We show that if link prices are unbounded, a class of REM-like algorithms
are the only ones possible.
Unfortunately, REM computes a biased estimate of total price and requires
setting a parameter for which no uniformly good choice exists in a network
setting.
However, we show that if prices can be bounded and therefore normalized,
then there is an alternate class of feasible algorithms, of which SAM is
representative and furthermore, only the REM-like and SAM-like classes are
possible.
We show that for properly normalized link prices, SAM returns an optimal
price estimate (in terms of mean squared error), outperforming REM even if
the REM parameter is chosen optimally.
SAM does not require setting a parameter like REM, but does require a
router to know its position along the path taken by a packet. 
We present an implementation of SAM for the Internet that exploits the
existing semantics of the time-to-live field in IP to provide the
necessary path position information. 
{\it Methods: statistics.}"
}

@TECHREPORT{Afan0306:Flow,
AUTHOR="Fedor Afanasiev and Anton Petrov and V. Grachev and Andrei Sukhov",
TITLE="Flow-based analysis of Internet traffic",
TYPE="arXiv technical report",
NUMBER="cs/0306037",
MONTH=jun,
YEAR=2003,
KEYWORDS="Networking and Internet Architecture",
ABSTRACT="We propose flow-based analysis to estimate quality of an Internet
connection. Using results from the queuing theory we compare two
expressions for backbone traffic that have different scopes of
applicability. A curve that shows dependence of utilization of a link on a
number of active flows in it describes different states of the network. We
propose a methodology for plotting such a curve using data received from a
Cisco router by NetFlow protocol, determining the working area and the
overloading point of the network. Our test is an easy way to find a moment
for upgrading the backbone.",
URL="http://arxiv.org/abs/cs/0306037"
}

@INPROCEEDINGS{Affe0305:Efficient,
AUTHOR="Sofiene Affes and Nahi Kandil and Paul Mermelstein",
TITLE="Efficient Use of Pilot Signals in Wideband {CDMA} Array-Receivers",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We extend application of a new scheme for efficient use of pilot signals
in wideband CDMA array-receivers from the pilot-channel to the
pilot-symbol
case. The new scheme exploits the pilot signals for the simple resolution
of the sign ambiguity arising in BPSK-decision-directed blind channel 
identification and allows significant spectrum efficiency gains and power
or overhead savings over the same array-receiver versions which use pilots
for conventional channel identification only. Both analysis and
simulations
suggest that pilot-channel and pilot-symbol array-receiver versions,
either
with conventional or new pilot use, have similar performance at weak
Doppler.
They also indicate increasing performance gains with increasing Doppler
due
to the improved use of the pilot information. For a data rate of 144 Kbps
with 60 Kmph speed, simulations indicate efficiency gains due to new pilot
use of about 25 and 70 \% in the pilot-channel and pilot-symbol cases,
respectively."
}

@INPROCEEDINGS{Affe0310:Enhanced,
AUTHOR="Sofiene Affes and Henrik Hansen",
TITLE="Enhanced Receiver Technologies for {3G} and Beyond",
BOOKTITLE="Vehicular Technology Conference Fall 2003",
ADDRESS="Orlando, Florida",
DAYS=4,
MONTH=oct,
YEAR=2003,
ABSTRACT="With the evolution of EDGE, GSM has become a competitor to 3G systems.
However, future integration of enhanced 3G receiver technologies that
employ spatial processing and multi-user detection will render the
advantage of 3G networks and beyond more evident; capacity gains of factor
4 seem possible. We will take the audience on a tour that surveys
the state-of-the-art on single-user and multi-user detection and that
ultimately enlightens the path to pursue in order to make space-time
multi-user detection a reality. We will certainly focus on the technical
obstacles and challenges. However, we will also briefly touch upon the
business part and identify the huge potential gain of enhanced receiver
technologies for 3G systems and beyond in dollars and cents."
}

@ARTICLE{Agar0309:Supporting,
AUTHOR="Anjali Agarwal and Kang Wang",
TITLE="Supporting Quality of Service in {IP} multicast networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=14,
PAGES="1533-1540",
MONTH=sep,
YEAR=2003,
REFERENCES=30,
KEYWORDS="IntServ; DiffServ; MPLS; Quality of Service; Multicast",
ABSTRACT="Developers and providers of data, voice and video applications have to
satisfy numerous Quality of Service (QoS) requirements and cope with
different architectures emerging to provide these QoS in the Internet.
IntServ, DiffServ or MPLS are technologies currently used in different
administrative domains in the Internet to provide QoS. With multicast
applications emerging, such as video conferencing, distance learning and
tele surgery, it has become almost impossible to provide end-to-end QoS
over multiple administrative business domains without interworking these
technologies. This paper analyses general issues on supporting QoS for
multicast applications and reviews different ways to implement IP
multicasting in IntServ, DiffServ or MPLS based networks. Subsequently,
network configurations based on these different architectures and their
interworking to provide end-to-end QoS are also discussed.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-48H8SP3-1-F\&\_cdi=5624\&\_orig=browse\&\_coverDate=09\%2F01\%2F2003\&\_sk=999739985\&view=c\&wchp=dGLbVlb-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=1c2b6adf07d1d727ef1d38568b9acc49\&ie=f.pdf"
}

@INPROCEEDINGS{Agra0303:Improving,
AUTHOR="Mukesh Agrawal and Amit Manjhi and Nikhil Bansal and Srinivasan Seshan",
TITLE="Improving Web Performance in Broadcast-Unicast Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Satellite operators have recently begun offering Internet access over their
networks. Typically, users connect to the network using a modem for uplink,
and a satellite dish for downlink. We investigate how the performance of
these networks might be improved by two simple techniques: caching and use
of the return path on the modem link.  We examine the problem from a
theoretical perspective and via simulation. We show that the general
problem is NP-Hard, as are several special cases, and we give
approximation algorithms for them. We then use insights from these cases
to design practical heuristic schedulers which leverage caching and the
modem downlinks. Via simulation, we show that caching alone can
simultaneously reduce bandwidth requirements by 33\% and improve response
times by 62\%. We further show that the proposed schedulers, combined with
caching, yield a system that performs far better under high loads than
existing systems."
}

@INPROCEEDINGS{Agra0305:Global,
AUTHOR="Gaurav Agrawal and Jagan Agrawal",
TITLE="The Global Multicast Routing Protocol - A new Architecture For Hierarchical
Multicast Routing",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper presents a new inter-domain multicast protocol, the Global 
Multicast Routing Protocol (GMRP), that has the potential to be highly
scalable and efficient, and, at the same time is simple to implement. 
GMRP minimizes signaling traffic, optimizes bandwidth use and remains
unaffected by the group dynamics. We show that GMRP performs better 
with respect to the signaling overhead and state requirements when
compared to Hierarchical Distance Vector Multicast Routing Protocol 
HDVMRP)."
}

@INPROCEEDINGS{Ahme0310:Radio,
AUTHOR="Mohamed Hossam Ahmed and Bassam Hashem and Halim Yanikomeroglu",
TITLE="Radio Resource Management in Wireless Multimedia Networks",
BOOKTITLE="Vehicular Technology Conference Fall 2003",
ADDRESS="Orlando, Florida",
DAYS=4,
MONTH=oct,
YEAR=2003,
ABSTRACT="It is expected that there will be a strong market for a rich variety of
wireless internet-based multimedia devices in a not-too-distant future.
It is quite difficult to predict the nature of these devices as well as
the corresponding applications from today; but, it is certain that those
devices and applications will have very different QoS, rate, delay, and
power constraints. Arguably, effective RRM is not only essential in such
future networks, but it is the key element in feasible and affordable
deployment and operation of these networks. This tutorial will discuss
the fundamental dynamics of RRM along with the current advances in the 
field; many implementation issues will be addressed as well."
}

@INPROCEEDINGS{Aida0303:Scalable,
AUTHOR="Masaki Aida and Naoto Miyoshi and Keisuke Ishibashi",
TITLE="A scalable and lightweight QoS monitoring technique combining passive and
active approaches: On the mathematical formulation of CoMPACT Monitor",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="To make a scalable and lightweight QoS monitoring system, we have proposed
a new QoS monitoring technique, Change-of-Measure based Passive/Active
Monitoring (CoMPACT Monitor), which is based on change-of-measure
framework and is an active measurement transformed by using passively
monitored data.  This technique enables us to measure detailed QoS
information for individual users, applications, and organizations, in a
scalable and lightweight manner.  In this paper, we present the
mathematical foundation of CoMPACT Monitor. In addition, we show its
characteristics through simulations in terms of typical implementation
issues for inferring the delay distributions.  The results shows that
CoMPACT Monitor gives accurate QoS estimations with only a small amount of
extra traffic for active measurement."
}

@INPROCEEDINGS{Akar0303:Joint,
AUTHOR="Mehmet Akar and Urbashi Mitra",
TITLE="Joint power and handoff control using a hybrid systems framework",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Power control and handoff are two significant problems for cellular 
wireless systems. While both problems have received considerable 
attention of late, the problems are not often treated in a joint manner.
Combined downlink power control and handoff design for cellular 
communication systems using a hybrid system framework is considered 
herein. Two new algorithms are proposed. The first one is a hard 
handoff/power control algorithm that endeavors a tradeoff between three
performance criteria: transmitted power, number of handoffs and call 
quality. The second algorithm is a joint soft handoff/power control 
algorithm that takes into account the effect of the number of base 
stations in the active set in addition to the above performance 
criteria. The significance of the algorithms is that they incorporate 
the effects of channel fading and mobility, and achieve a tradeoff 
between the satisfaction levels of the mobile user and the network 
operator, thereby provide satisfactory service for the user while 
reducing the burden on the network such as undesired switching between 
base stations. The tradeoffs involved in both algorithms are verified 
through simulations."
}

@INPROCEEDINGS{Akel0309:Toward,
AUTHOR="Aditya Akella and Srinivasan Seshan and Anees Shaikh",
TITLE="Toward Representative Internet Measurements",
BOOKTITLE="New York Metro Area Networking Workshop 2003",
ADDRESS="Bern Dibner Library Building, LC400,  Polytechnic University,  5 Metrotech
Cente",
DAYS=12,
MONTH=sep,
YEAR=2003,
ABSTRACT="Despite the numerous studies of Internet properties, there has been
little work to understand how to measure the network in terms of
the number and distribution of measurement sites.  It is clear that
further guidance as to the representativeness of results obtained
using existing measurement testbeds is a crucial missing element of
current network measurement research.  In this paper we argue that for
Internet measurements to be representative, data should be collected from
locations actually used by a large portion of Internet users.  We propose
a methodology for determining a more representative set of Internet
measurement locations, based on actual usage of the network.  The main
idea behind our technique is to leverage access records from a large
network of distributed application servers to understand where most of the
demand originates, and also where these client requests are directed.  With
this information, we describe how to arrive at a set of network measurement
locations that captures a significant fraction of this traffic."
}

@INPROCEEDINGS{Akta0305:Adaptive,
AUTHOR="Emre Aktas and Urbashi Mitra",
TITLE="Adaptive Blind Decoding of Unitary Space-Time Constellations in {ISI}
Channels",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Blind equalization and decoding of unitary space-time codes is 
considered for inter-symbol interference (ISI) channels. Previously, 
an adaptive equalization method that can equalize channel blindly was 
proposed, by exploiting the structure of the codes proposed by 
Hochwald it et al. In this paper, the performance of the decoder 
followed by this equalizer is investigated. After giving a modified 
version of the algorithm in order to avoid undesired convergence, a 
generalized likelihood ratio test based non-coherent decoder is 
presented. Semi-analytic methods are developed to investigate the 
performance of the non-coherent decoder followed by zero forcing and 
minimum mean squared error equalizers. Simulations results indicate 
that the performance of the algorithm is in between ZF and MMSE 
equalizers."
}

@ARTICLE{Akyi0303:New,
AUTHOR="Ian Akyildiz and Tricha Anjali and Leonardo Chen and Jaudelice {de
Oliveira} and Caterina Scoglio and Agatino Sciuto and Jeff Smith and
George Uhl",
TITLE="A New Traffic Engineering Manager for DiffServ/MPLS Networks: Design and
Implementation on an {IP} QoS Testbed",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=4,
PAGES="388-403",
MONTH=mar,
YEAR=2003,
REFERENCES=61,
KEYWORDS="DiffServ; MultiProtocol Label Switching; Traffic Engineering; Automated
Network Management; Testbed",
ABSTRACT="In a multi-service network, different applications have varying QoS
requirements. The IETF has proposed the DiffServ architecture as a
scalable solution to provide Quality of Service (QoS) in IP Networks. In
order to provide quantitative guarantees and optimization of transmission
resources, DiffServ mechanisms should be complemented with efficient
traffic engineering (TE) mechanisms, which operate on an aggregate basis
across all classes of service. The MultiProtocol Label Switching (MPLS)
technology is a suitable method to provide TE, independent of the
underlying layer2 technology. Currently, the combined use of
Differentiated Services (DiffServ) and MPLS is a promising technique to
provide Quality of Service (QoS), while efficiently exploiting network
resources. In this paper, TEAM, an automated manager for DiffServ/MPLS
networks is introduced and its design. The design and implementation
details are discussed.",
URL="http://users.ece.gatech.edu/~tricha/comcomm.pdf"
}

@INPROCEEDINGS{Al-G0305:Triangular,
AUTHOR="Abdullah Al-Ghamdi",
TITLE="Triangular {PFDR} antenna optimisation under the restriction of background
noise and multipath propagation in an optical wireless system",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Background noise and multipath propagation are the major impairments in
indoor optical wireless links. They can introduce heavy distortion in the
received optical signal and can degrade the system performance. In this
paper, we investigate these effects employing a novel triangular pyramidal
fly-eye diversity receiver (PFDR). Original results for fully diffuse
optical wireless links that utilise PFDR are presented. Impulse responses
and background noise collected on the PFDR faces at various locations on
communication floor are evaluated. It is demonstrated that through PFDR
field-of-view optimisation the directional background interference can be
reduced and that the received pulse shape can be improved. Results show a
marked improvement in the probability of error when the optimisation is
done. Moreover, system performance improvement over the conventional
diffuse system can be achieved."
}

@INPROCEEDINGS{Al-N0305:Blind,
AUTHOR="Tareq Al-Naffouri and Ahmad Bahai and Arogyaswami Paulraj",
TITLE="Blind Maximum-Likelihood Channel and Data Recovery in {OFDM}",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="OFDM modulation combines the advantages of high achievable
rates and relatively easy implementation. In this paper, we show
how to perform exact maximum-likelihood channel and data recovery
in OFDM  transmission. Our approach relies on decomposing the
OFDM channel into two subchannels (cyclic and linear) that
share the same input and are characterized by the same channel
parameters. This fact enables us to estimate the channel
parameters from one subchannel and substitute the estimates into
the other thus obtaining a nonlinear objective function involving
the input and the output data only. The objective  function makes
use of a priori channel information (sparsity and correlation) to
enhance the quality of the estimates. When the channel is known,
the algorithm can be used to recover symbols transmitted at deep
channel fades."
}

@INPROCEEDINGS{Al-R0305:Iterative,
AUTHOR="Ghazi Al-Rawi and Tareq Al-Naffouri and Ahmad Bahai and John Cioffi",
TITLE="An Iterative Receiver for Coded {OFDM} Systems Over Time-Varying Wireless
Channels",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper presents a low-complexity iterative receiver for coded
OFDM systems. We present an EM-based iterative algorithm for
combined channel estimation and decoding that makes collective use
of the available data and system constraints. Minimum number of
pilots are sent only in the first symbol of the packet to acquire
the channel; then the iterative algorithm is used to track the
channel time variation, which is assumed to follow a state-space
model, using an EM-based Kalman filter. Data recovery can be
achieved within a single OFDM symbol. We also propose the use of
an optional outer LDPC code in serial concatenation to offer a
trade-off between latency and performance, especially for
multi-amplitude modulations, without affecting the complexity of
the core iterative algorithm."
}

@INPROCEEDINGS{Al-S0305:Management,
AUTHOR="Ehab Al-Shaer and Hazem Hamed",
TITLE="Management and Translation of Filtering Security Policies",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Firewalls are essential elements for security policy enforcement in modern
networks. However, managing a filtering security policy, especially for
enterprise networks, has become complex and error-prone. Filtering rules
have to be carefully written and organized in order to correctly implement
the security policy and avoid policy anomalies. In this paper, we present a
set of techniques and algorithms that provide (1) automatic anomaly
discovery for rule conflicts and potential problems in legacy firewalls,
(2) anomaly-free policy editing for rule insertion, modification and
removal, and (3) concise translation of filtering rules to high-level
textual description for user visualization and verification. These
techniques significantly simplify the management of any generic firewall
policy written as filtering rules, while minimizing network vulnerability
due to firewall policy misconfiguration."
}

@ARTICLE{Albi0307:Statistical,
AUTHOR="F. Albizuri and Manuel {Graña} and Bogdan Raducanu",
TITLE="Statistical transmission delay guarantee for nonreal-time traffic
multiplexed with real-time traffic",
JOURNAL="IEEE Internet Computing",
VOLUME=26,
NUMBER=12,
PAGES="1365-1375",
MONTH=jul,
YEAR=2003,
REFERENCES=25,
KEYWORDS="ATM broadband network; Semi-Markov model; Transmission delay time
distribution; Multiplexed sources",
ABSTRACT="When nonreal-time sources are multiplexed with real-time sources in an ATM
broadband network, the probability distribution of the transmission delay
time of nonreal-time traffic cells provides a statistical delay guarantee
for this traffic, which is a significant performance parameter of the
Quality-of-Service (QoS) of the broadband network. In this paper we
develop a stochastic analysis based on a semi-Markov model in order to
compute the transmission delay distribution of nonreal-time cells. The
nonreal-time sources are characterized as onoff Markov modulated Poison
processes, and the real-time sources, like compressed video, are
continuous-time Markov chains with multiple states. A priority-based
schedule determines a differentiated QoS for each traffic type, and we
concentrate the analysis in the transmission queueing process of the
nonreal-time cells. This transmission process is modelled with a
regenerative semi-Markov process that has a matrix-geometric solution for
the limiting distribution of the embedded Markov chain. From the limiting
distribution of the continuous-time queueing process, we define a sequence
of delay distribution matrices that converges. The limiting distribution
matrix of this sequence corresponds to the delay distribution of the
nonreal-time cells.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47C3S2K-2-3Y\&\_cdi=5624\&\_orig=browse\&\_coverDate=07\%2F21\%2F2003\&\_sk=999739987\&view=c\&wchp=dGLbVzb-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=ff83011cf4a2667c6da3bda9a835d4b7\&ie=f.pdf"
}

@INPROCEEDINGS{Alen0305:Mlse,
AUTHOR="Marcelo Alencar and Juraci Galdino and Ernesto Pinto",
TITLE="{MLSE-PSP} Receiver with Optimized {LMS} Step-size Parameter",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper presents the performance evaluation of the MLSE-PSP reception
scheme which employs the LMS algorithm to identify the channel impulse
response (IR). The mobile communications channel is characterized as
presenting fast fading and being frequency selective. An analytical
approximation for the LMS algorithm step-size is proposed. An optimization
criterion that minimizes the steady state MSE and takes into account the
channel autocorrelation coefficients is used. Computer simulation results
are
provided to show the performance of the MLSE-PSP-LMS for random Doppler
scenarios. The results are compared to the ones obtained from a fixed
step-size
LMS, which is optimized for the same channel conditions."
}

@ARTICLE{Alfa0307:Alternative,
AUTHOR="Attahiru Alfa",
TITLE="An alternative approach for analyzing finite buffer queues in discrete time",
JOURNAL="Performance Evaluation",
VOLUME=53,
NUMBER=2,
PAGES="75-92",
MONTH=jul,
YEAR=2003,
REFERENCES=14,
KEYWORDS="Elapsed time approach; Matrix-analytic method; GI/G/1/K system; QBD
process; Queue length; Waiting time",
ABSTRACT="In this paper, we present a novel use of matrix-analytic method (MAM) for
analyzing the GI/G/1/K system. The novelty is based on an unconventional
arrangement of the state space and also a Markov-based representation of
the arrival and service processes with at least one of them based on the
elapsed time approach. This results in a matrix-product form solution,
because the resulting Markov chain is level-dependent. We therefore end up
with rate matrices which are level-dependent. The resulting matrices are
explicitly determined. We show that stationary distributions can be
determined explicitly. An illustrative example is presented. We discuss
some special cases such as GI/Geo/1/K and Geo/G/1/K and show extensions to
the GIX/G/1/K and the GI/Geo/c/K systems.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-481FV37-1-BK\&\_cdi=5663\&\_orig=browse\&\_coverDate=07\%2F31\%2F2003\&\_sk=999469997\&view=c\&wchp=dGLbVtz-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=304bcdb2cca65d6ac71879454b99a666\&ie=f.pdf"
}

@ARTICLE{Ali0301:Performance,
AUTHOR="Maaruf Ali and X. Zhang and J. Hayes",
TITLE="A performance analysis of a discrete-time queueing system with server
interruption for modeling wireless {ATM} multiplexer",
JOURNAL="Performance Evaluation",
VOLUME=51,
NUMBER=1,
PAGES="1-31",
MONTH=jan,
YEAR=2003,
REFERENCES=43,
KEYWORDS="Markov channel models; Wireless ATM; Discrete-time queue; Mean queue
length; Mean delay",
ABSTRACT="In this paper, we study the effect of channel errors on wireless ATM. The
salient characteristic of the wireless channel is that it is time varying.
This variability is modeled by a Markov chain with two states corresponding
to high and low error states, respectively. The channel is modeled as being
synchronous with the basic time unit being the slot. The transitions from
high to low error states, and vice versa occur at the slot boundaries. It
is assumed that no transmission over the channel is possible during the
high-error state.

The information source feeding into the channel is modeled as the
superposition of independent sources. Each source is controlled by a
two-state Markov chain which operates in synchronism with, but
statistically independent of the channel. In the source Off state, no data
is emitted while, in the On state, the source generates a random number of
packets in a slot each of which fits into a channel slot.

It is assumed that the traffic generated by all the sources will form a
single global queue which will be served by the two-state Markov channel.
A discrete-time queuing analysis derives the probability generating
function (PGF) of the queue length under the assumption of an infinite
buffer. From the PGF, we determine mean queue length and mean delay.
Finally, numerical results are presented to demonstrate the effect of
wireless channel error characteristics on performance.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-46WPNY4-8-97\&\_cdi=5663\&\_orig=browse\&\_coverDate=01\%2F31\%2F2003\&\_sk=999489998\&view=c\&wchp=dGLbVlz-zSkzk\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=c8db291a5b9986f43c0165990a750767\&ie=f.pdf"
}

@INPROCEEDINGS{Ali0305:Routing,
AUTHOR="Maher Ali and David Elie-Dit-Cosaque",
TITLE="Routing of 40Gb/s Traffic in Heterogeneous Optical Networks",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we introduce the Routing of Multi-rate Traffic (RMT) problem
that
arises in current backbone networks required to carry the new 40Gb/s
traffic streams.
 The RMT problem is informally defined as the process of finding the best
routing which
maximizes the total bandwidth carried in the network,
 for a set of sessions, within a given  TDM equipment budget.
 We propose a two-phase iterative optimization scheme (two-phase RMT).
This scheme first obtains a basis solution used in routing
40Gb/s traffic only on OC-768 capable links without the use of TDM
equipment.
In the second phase, an iterative routing,
re-routing, and resource allocation step is used to optimize the total
bandwidth
carried in the network while allowing 40Gb/s traffic
to be routed on OC-768 incapable links by the proper installation of TDM
multiplexors
and demultiplexers at some strategic locations in the network.
Numerical results demonstrate the performance of the proposed approach on
a mesh-type heterogeneous topology."
}

@ARTICLE{Allo0303:Italian,
AUTHOR="Claudio Allocchio and Claudia Battista and Massimo Carboni and Luca
dell'Agnello",
TITLE="The Italian academic network {GARR:} evolution in the Gigabit era",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=5,
PAGES="477-480",
MONTH=mar,
YEAR=2003,
REFERENCES=6,
KEYWORDS="Gigabit; MPLS; Network; SDH; WDM",
ABSTRACT="an efficient, fast, reliable connectivity. Between its own and the other
similar networks, but also to provide the top technologies contributing in
development, experimentation and deployment of new services and protocols.
GARR, the Italian Academic and Research Networks is thus preparing its own
next generation service while providing a reliable production service to
its users.

In this paper we will present the network current status, but the main
focus is however on the network evolution: GARR-B Phase 3, with a large
increase of access bandwidth, new application like Computational GRID, a
large dedicated mesh of VPNs for users' groups, more connectivity in south
and Mediterranean regions and the GARR-Gigabit (GARR-G) network pilot
project, where SDH and WDM technologies will be experimented, and where
also multi-carrier and multi-operators will be a reality. We will also
present how GARR-G expands GEANT service to Italy and possibly beyond
Italy, towards the Mediterranean area.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-46VTFGG-1-5\&\_cdi=5624\&\_orig=browse\&\_coverDate=03\%2F20\%2F2003\&\_sk=999739994\&view=c\&wchp=dGLbVtz-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=e19c2336747f219b09c402514c164404\&ie=f.pdf"
}

@INPROCEEDINGS{Alpc0303:Utility,
AUTHOR="Tansu Alpcan and Tamer Basar",
TITLE="A Utility-Based Congestion Control Scheme for Internet-Style Networks with
Delay",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="In this paper, we develop, analyze and implement a congestion control
scheme obtained in a noncooperative game framework where each user's
cost function is composed of a pricing function, proportional
to the queueing delay experienced by the user, and a broad class
of utility functions capturing the user demand for bandwidth.
Using a network model based on fluid approximations and through a
realistic modelling of queues, we establish the existence of a unique
equilibrium as well as its global stability for a general network
topology. We also provide sufficient conditions for system stability when
there is a bottleneck link shared by multiple users experiencing
non-negligible communication delays. Based on these theoretical
foundations, we implement a window-based, end-to-end congestion control
scheme, and simulate it in ns-2 network simulator on various network
topologies with sizable propagation delays."
}

@INPROCEEDINGS{Alth0305:Channel,
AUTHOR="Frank Althaus",
TITLE="Channel Estimation with Hard Limiter Receiver as Key Technology for Low
Cost Wireless Systems",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Future wireless indoor network applications will require
technologies that allow high data rate transmission in multipath
propagation environment. The acceptance of new technologies will
depend essentially on the expense of its realization. A key
technology for link level cost reduction is the use of hard
(amplitude) limiting receiver structures that substantially save
the costs for the analogue domain of the receivers. Technologies suited
for
multipath propagation, such as ML based detection or smart
antennas training, require the knowledge of the complex channel
impulse response (CIR). Up to
now, there is no method known how to estimate the complex CIR in
case of a hard limited receiver structure. In this paper an
estimation method is presented that allows an estimation of the
complex CIR on basis of phase samples. The new estimation
technique is a two level approach which exploits the finite-state
nature of the transmission system. With the help of an appropriate
training sequence an estimate of the desired phase and amplitude
is performed. The second level procedure performs a subspace
approach to estimate the CIR which yields a well treatable over
determined linear equation system. Simulation results for a GMSK
transmission system highlight the suitability of this estimation
method."
}

@ARTICLE{Alzo0303:Geometric,
AUTHOR="Khaled Alzoubi and Xiang-Yang Li and Yu Wang and Peng-Jun Wan and Ophir
Frieder",
TITLE="Geometric Spanners for Wireless Ad Hoc Networks",
JOURNAL="IEEE Transactions on Parallel and Distributed Systems",
VOLUME="Volume 14",
NUMBER="Issue 4",
PAGES="408 - 421",
MONTH=mar,
YEAR=2003,
REFERENCES=39,
ABSTRACT="Abstract¿We propose a new geometric spanner for static wireless ad hoc
networks, which can be constructed efficiently in a localized manner. It
integrates the connected dominating set and the local Delaunay graph to
form a backbone of the wireless network. Priori arts showed that both
structures can be constructed locally with bounded communication costs.
This new spanner has these following attractive properties: 1) the
backbone is a planar graph, 2) the node degree of the backbone is bounded
from above by a positive constant, 3) it is a spanner for both hops and
length, 4) it can be constructed locally and is easy to maintain when the
nodes move around, and 5) moreover, the communication cost of each node is
bounded by a constant. Simulation results are also presented for studying
its practical performance."
}

@INPROCEEDINGS{Amba0305:Experimental,
AUTHOR="Rajesh Ambati",
TITLE="Experimental studies in {OFDM} carrier frequency offset estimation",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In OFDM carrier frequency offset must be estimated
and compensated at the receiver to maintain orthogonality. OFDM
carrier frequency synchronization performance can be improved
by using diversity. In this paper, we examine the sensitivity of
the carrier frequency estimator against key system parameters in
a practical implementation using real data obtained on the Stevens
wireless testbed. The experimental setup is comprised of a wide-band
65 Msamples/second digital to analog converter, a radio fre-quency
(RF) transmitter which transmits at 2.4 GHz frequency with
12 MHz bandwidth and two RF receiver chains whose outputs are
sampled at 65 Msamples/sec. Insights obtained from these experi-ments
provided the motivation to explore the fundamental relation-ships
between estimator performance and multipath fading."
}

@INPROCEEDINGS{Ambr0305:Magnitude,
AUTHOR="Marcel Ambroze and Martin Tomlinson and Graham Wade",
TITLE="Magnitude Modulation for Small Satellite Earth Terminals using {QPSK} and
{OQPSK}",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper investigates the design and application of data magnitude
modulation to reduce power amplifier back-off for QPSK and OQPSK
modulations for small satellite Earth stations. 
The coefficients for data magnitude modulation are obtained by using an
iterative design loop. 
The parameters of this loop are tuned to obtain maximum gain. 
Roll-off factors from 10\% to 100\% are considered, with emphasis on small
roll-off values for increased bandwidth efficiency. 
It is shown that a gain of almost 6dB can ideally be obtained for a
roll-off factor of 10\%. 
Error correction coding is used to compensate for the increased
sensitivity to noise of the magnitude modulated data. 
The loss due to this increased sensitivity is reduced from almost 5.5dB to
1.2dB for a roll-off factor of 10\% by using high rate product codes, thus
giving an overall gain of 4.8dB.
Trade offs between spectral regrowth and implementation are addressed."
}

@INPROCEEDINGS{Amin0305:Modeling,
AUTHOR="Lisa Amini and Henning Schulzrinne",
TITLE="Modeling Redirection in Geographically Diverse Server Sets",
BOOKTITLE="WWW",
ADDRESS="Budapest, Hungary",
MONTH=may,
YEAR=2003,
KEYWORDS="BGP; server clusters",
ABSTRACT="Internet server selection mechanisms attempt to optimize, subject
to a variety of constraints, the distribution of client requests to a
geographically and topologically diverse pool of servers. Research
on server selection has thus far focused primarily on techniques
for choosing a server from a group administered by single entity,
like a content distribution network provider. In a federated,
multiprovider
computing system, however, selection must occur over
distributed server sets deployed by the participating providers,
without the benefit of the full information available in the
singleprovider
case. Intelligent server set selection algorithms will
require a model of the expected performance clients would
receive from a candidate server set.
In this paper, we study whether the complex policies and
dynamics of intelligent server selection can be effectively
modeled in order to predict client performance for server sets. We
introduce a novel server set distance metric, and use it in a
measurement study of several million server selection transactions
to develop simple models of existing server selection schemes.
We then evaluate these models in terms of their ability to
accurately predict performance for a second, larger set of
distributed clients. We show that our models are able to predict
performance within 20ms for over 90\% of the observed samples.
Our analysis demonstrates that although existing deployments use
a variety of complex and dynamic server selection criteria, most
of which are proprietary, these schemes can be modeled with
surprising accuracy.",
URL="http://www.cs.columbia.edu/IRT/papers/Amin0305\_Modeling.pdf"
}

@INPROCEEDINGS{Anag0303:Cing,
AUTHOR="Kostas G. Anagnostakis and Michael Greenwald and Raphael Ryger",
TITLE="cing: Measuring Network-Internal Delays using only Existing Infrastructure",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Several techniques have been proposed for measuring network internal
delays. However, those that rely on router responses
have questionable performance, and all proposed alternatives
require either new functionality in routers or the existence
of a measurement infrastructure.
In this paper we revisit the feasibility of measuring network-internal
delays
using only existing infrastructure, focusing on the use of
ICMP Timestamp probes to routers. We present network measurements showing
that
ICMP Timestamp is widely supported, that TTL-responses often perform
poorly,
and analyze the effect of path instability and routing irregularities on
the performance and applicability of using ICMP Timestamp.
We also confirm that router responses rarely introduce errors to our
measurements.  Finally, we present a practical clock calibration algorithm
that addresses problems with previous methods and has been found to
perform
well in our setting.

methods keywords: Network measurements, Experimentation with real
networks/Testbeds"
}

@ARTICLE{Anas0308:Performance,
AUTHOR="G. Anastasi and M. Conti and E. Gregori and Andrea Passarella",
TITLE="Performance comparison of power-saving strategies for mobile Web access",
JOURNAL="Performance Evaluation",
VOLUME=53,
NUMBER="3-4",
PAGES="273-294",
MONTH=aug,
YEAR=2003,
REFERENCES=41,
KEYWORDS="Power saving; Mobile Internet; Indirect-TCP; Web; Performance analysis;
Measurements",
ABSTRACT="One of the critical issues in mobile Web access is the usage of limited
energy resources of mobile computers. Unfortunately, the legacy TCP/IP
architecture is very inefficient. This work proposes and analyzes
power-saving strategies for mobile Web access. Specifically, in this paper
we develop an energy-consumption model for Web transactions and, based on
it, we propose and compare four different energy saving strategies: ideal,
Indirect-TCP (I-TCP), local and global. The ideal strategy is unfeasible
but it is used as a reference bound as it guarantees the lowest energy
consumption. The other strategies have been implemented and compared in a
real test-bed. The performance comparison is carried out by measuring two
main performance figures: the energy spent for downloading a Web page, and
the associated transfer-time. Experimental results show that relevant
energy saving is achievable and that, among the feasible strategies, the
global one gives the best performance: with this strategy we can save (on
average) up to 88\% of the energy. Furthermore, our results indicate that
this power saving is obtained without a significant increase in the
transfer-time perceived by the users (on average, 0.2 s). Finally, by
comparing the feasible strategies, we observe that the global one is much
closer to the ideal case than the other strategies. In detail, the global
strategy is about twice more efficient than the local one, and eight times
more efficient than the I-TCP strategy.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-48S4RNB-1-2Y\&\_cdi=5663\&\_orig=browse\&\_coverDate=08\%2F31\%2F2003\&\_sk=999469996\&view=c\&wchp=dGLbVlb-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=3043ae646abb13bca38f75aae0f7db1d\&ie=f.pdf"
}

@ARTICLE{Ande0303:Local,
AUTHOR="S.-e. Andersson and T. Ryden",
TITLE="Local dependencies and Poissonification: a case study",
JOURNAL="Performance Evaluation",
VOLUME=52,
NUMBER=1,
PAGES="41-58",
MONTH=mar,
YEAR=2003,
REFERENCES=14,
KEYWORDS="Microdynamics; Poissonification; Traffic analysis; Performance analysis;
Point process spectrum",
ABSTRACT="Traffic characterization is of great importance in the analysis and
dimensioning of modern telecommunication networks. In this paper, the
microdynamics of some sets of traffic are investigated. The approach we
use to study the microdynamics is Poissonification, which is a way of
transforming a point process into a Poisson process locally. We want to
gain basic knowledge of how the traffic behaves on smaller time scales,
but we also want to see if there are any effects when the traffic is fed
into a queue. As an application, Poissonification can be used when
modeling is done with a doubly stochastic Poisson process to find the time
scale where we no longer have the doubly stochastic behavior. Three
different traffic traces were analyzed in this paper. The results show
that provided the Poissonification is carried out at a sufficiently small
time scale, the performance characteristics are not decisively changed and
this gives a guide to choosing the time scale at which to start traffic
modeling.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-47CXJPG-1-8H\&\_cdi=5663\&\_orig=browse\&\_coverDate=03\%2F31\%2F2003\&\_sk=999479998\&view=c\&wchp=dGLbVlb-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=7e5561672230498f5ab5093c0f066375\&ie=f.pdf"
}

@INPROCEEDINGS{Ande0303:Stability,
AUTHOR="Eric Anderson and Thomas Anderson",
TITLE="On the Stability of Adaptive Routing in the Presence of Congestion Control",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Efficient use of network resources has long been an
important problem for large-scale network operators.
To this end, several recent research efforts have proposed
automated methods for optimizing routes based on
traffic measurements.  However, these efforts have
not considered the stability of the dual feedback control
mechanisms of adaptive routing and congestion control, when
operating together.
In this paper, we demonstrate that an important class
of adaptive routing algorithms can yield stable
optimal routes in the presence of congestion control,
provided that either the congestion control mechanism is fair or
the network workload behaves under reasonable constraints.
We further show that one or the other of
these assumptions is necessary for this
class of adaptive routing algorithms -- otherwise,
unstable, sub-optimal routes may result in pathological cases.

Method keywords: Mathematical programming/optimization,
Graph theory."
}

@INPROCEEDINGS{Ande0311:Preventing,
AUTHOR="Tom Anderson and Timothy Roscoe and David Wetherall",
TITLE="Preventing Internet Denial-of-Service with Capabilities",
BOOKTITLE="HotNets II",
ORGANIZATION="ACM",
ADDRESS="Cambridge, Massachusetts",
MONTH=nov,
YEAR=2003,
ABSTRACT={In this paper, we propose a new approach to preventing and constraining
denial-of-service (DoS) attacks.  Instead of being able to send anything
to anyone at any time, in our architecture, nodes must first obtain 
{"}permission to send'' from the destination; a receiver provides tokens,
or capabilities, to those senders whose traffic it agrees to accept. The
senders then include these tokens in packets.  This enables verification
points distributed around the network to check that traffic has been
certified as legitimate by both endpoints and the path in between, and to
cleanly discard unauthorized traffic.  We show that our approach addresses
many of the limitations of the currently popular approaches to DoS based on
anomaly detection, traceback, and push-back. Further, we argue that our
approach can be readily implemented in today's technology, is suitable for
incre- mental deployment, and requires no more of a security infrastructure
than that already needed   to fix BGP's security weaknesses.  Finally, our
proposal facilitates innovation in application and networking protocols,
something  increasingly curtailed by existing DoS measures.},
URL="http://www.acm.org/sigs/sigcomm/HotNets-II/papers/netcap.pdf"
}

@INPROCEEDINGS{Andr0303:Scheduling,
AUTHOR="Matthew Andrews and Milan Vojnovic",
TITLE="Scheduling reserved traffic in input-queued switches: New delay bounds via
probabilistic techniques",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We consider the problem of providing delay bounds to reserved traffic in
input-queued switches. We assume that the matrix of bandwidth demands
is known and we use the now standard approach of decomposing this
matrix into a convex combination of permutation matrices.  Our problem
therefore reduces to the problem of constructing a schedule for these
permutation matrices.  

In this paper we derive delay bounds for four algorithms that are
based on probabilistic techniques. For each algorithm we first place
tokens randomly in continuous time for each permutation matrix.  If
the $n$th token that appears corresponds to permutation matrix $M\_k$
then we schedule matrix $M\_k$ in the $n$th time slot.  The algorithms
differ in how the random token processes are defined.  For two of the
algorithms we are able to perform a derandomization so as to obtain
deterministic schedules.

We show through numerical computation that in many situations the
resulting delay bounds are smaller than the previously best-known
delay bounds of Chang, Chen, and Huang.

Methods keywords: Stochastic processes/Queueing theory, Deterministic
network calculus"
}

@ARTICLE{Andr0310:Achieving,
AUTHOR="Matthew Andrews and Lisa Zhang",
TITLE="Achieving Stability in Networks of Input-Queued Switches",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=5,
PAGES="848-857",
MONTH=oct,
YEAR=2003,
REFERENCES=19,
KEYWORDS="input-queued switches; scheduling; stability",
ABSTRACT="Recent research has generated many interesting results
on scheduling input-queued switches. However, most of this
work focuses on a single switch in isolation. In this paper, we study
the problem of scheduling a network of input-queued switches.We
consider the Longest-Queue-First and Longest-Port-First scheduling
policies that are stable for a single switch, and show that they
can be unstable even for a fixed traffic pattern in a simple network
of eight input-queued switches. Moreover, this result holds regardless
of how the traffic sharing the same port-pair is scheduled at
each switch. On the positive side, we present a policy, Longest-in-
Network, that is stable in networks of input-queued switches. This
result holds even if the traffic pattern is allowed to change over
time.",
URL="http://ieeexplore.ieee.org/iel5/90/27747/01237461.pdf?isNumber=27747\&prod=JNL\&arnumber=1237461\&arSt=+848\&ared=+857\&arAuthor=Andrews\%2C+M.\%3B+Zhang\%2C+L."
}

@ARTICLE{Anja0304:New,
AUTHOR="Tricha Anjali and Caterina Scoglio and George Uhl",
TITLE="A New Scheme for Traffic Estimation and Resource Allocation for Bandwidth
Brokers",
JOURNAL="Computer Networks",
VOLUME=41,
NUMBER=6,
PAGES="761-777",
MONTH=apr,
YEAR=2003,
REFERENCES=26,
KEYWORDS="Bandwidth broker; Resource allocation; Resource provisioning; Capacity
reservation; Traffic estimation; Bandwidth usage",
ABSTRACT="This paper is motivated by the concern of a multi-service network provider
who plans to offer quality of service guarantees to users. A bandwidth
broker acts as the resource manager for each network provider. Neighboring
bandwidth brokers communicate with each other to establish inter-domain
resource reservation agreements. Conventional approaches for resource
allocation rely on pre-determined traffic characteristics. If allocation
follows the traffic demand very tightly, the resource usage is efficient
but leads to frequent modifications of the reservations. This would lead
to increased inter-bandwidth-broker signaling in order to propagate the
changes to all the concerned networks. Contrarily, if large cushions are
allowed in the reservations, the modifications are far spaced in time but
the resource usage becomes highly inefficient. In this paper, a new scheme
for estimating the traffic on an inter-domain link and forecasting its
capacity requirement, based on a measurement of the current usage, is
proposed. The method allows an efficient resource utilization while
keeping the number of reservation modifications to low values.",
URL="http://users.ece.gatech.edu/~tricha/bb.pdf"
}

@ARTICLE{Anju0306:Comparative,
AUTHOR="Farooq Anjum and Leandros Tassiulas",
TITLE="Comparative Study of Various {TCP} Versions Over a Wireless Link With
Correlated Losses",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=3,
PAGES="370-383",
MONTH=jun,
YEAR=2003,
REFERENCES=20,
KEYWORDS="correlated losses; packet train model; performance analysis; TCP algorithm;
TCP over wireless",
ABSTRACT="We investigate the behavior of the various transmission control protocol
(TCP) algorithms over wireless links with correlated packet losses. For
such a scenario, we show that the performance of NewReno is worse than the
performance of Tahoe in many situations and even OldTahoe in a few
situations because of the inefficient fast recovery method of NewReno. We
also show that random loss leads to significant throughput deterioration
when either the product of the square of the bandwidth-delay ratio and the
loss probability when in the good state exceeds one, or the product of the
bandwidth-delay ratio and the packet success probability when in the bad
state is less than two. The performance of Sack is always seen to be the
best and the most robust, thereby arguing for the implementation of
TCP-Sack over the wireless channel. We also show that, under certain
conditions, the performance depends not only on the bandwidth-delay
product but also on the nature of timeout, coarse or fine. We have also
investigated the effects of reducing the fast retransmit threshold.",
URL="http://ieeexplore.ieee.org/iel5/90/27187/01208299.pdf?isNumber=27187\&prod=JNL\&arnumber=1208299\&arSt=+370\&ared=+383\&arAuthor=Anjum\%2C+F.\%3B+Tassiulas\%2C+L."
}

@INPROCEEDINGS{Anju0312:Voice,
AUTHOR="Farooq Anjum and Moncef Elaoud and David Famolari and Abhrajit Ghosh and
Ravichander Vaidyanathan and Ashutosh Dutta and Prathima Agrawal and
Yasuhiro Katsube",
TITLE="Voice Performance in {WLAN} Networks, an Experimental study",
BOOKTITLE="Globecom 2003 - General Conference",
ORGANIZATION="IEEE",
PUBLISHER="IEEE",
ADDRESS="San Francisco, California",
MONTH=dec,
YEAR=2003,
REFERENCES=12,
KEYWORDS="QoS, 802.11b, Performance Analysis, VoIP",
ABSTRACT="Abstract - In this work, we measure Wireless Local Area Network
(WLAN) voice performance and capacity. While most WLAN
applications today are data centric, the growing popularity of Voice
over IP (VoIP) applications and the trend towards convergence with
cellular networks will catalyze increased voice traffic. Since voice
applications compete not only with each other, but also with data
applications for WLAN bandwidth, quantifying voice performance
and capacity in the presence of simultaneous data traffic is an
important issue. We offer a practical investigation of the 802.11b
MAC layers ability to support simultaneous voice and data
applications. We quantify VoIP capacity for standard WLAN
networks, indicative of those already in the field, as well as evaluate
the practical benefits of implementing backoff control and priority
queuing at the access point. Conclusions are drawn based on an
extensive set of real-world measurements conducted using off-theshelf
equipment in an experimental testbed.",
URL="http://www.cs.columbia.edu/~dutta/research/wavelan-globecom.pdf"
}

@ARTICLE{Anto0302:VIRUS,
AUTHOR="Theodore Antonakopoulos and Alex Maniatopoulos and Aggeliki Pantazi and
Vassilios Makios",
TITLE="{VIRUS:} a pseudo-framing method for cell-based interfaces",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=2,
PAGES="165-176",
MONTH=feb,
YEAR=2003,
REFERENCES=13,
KEYWORDS="Asynchronous transfer mode; VIRUS interface; Idle order set",
ABSTRACT="This paper presents the coding scheme and the timing recovery method of an
interface for high-speed cell-based networks. The synchronization
technique used in this interface is based on the functionality resulting
from combining functions of the fiber channel with the basic features of
pure asynchronous transfer mode. The main advantage of this interface is
its implementability at high transmission rates, since most of its
functions, like cell delineation and cell header error detection and
correction, are performed at byte-level by using a pseudo-framing
structure. The paper presents the basic principles of this interface, the
analytic formulas for calculating its mean synchronization time under
various traffic conditions and describes how the various parameters affect
the method's performance.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-469W6GV-1-2R\&\_cdi=5624\&\_orig=browse\&\_coverDate=02\%2F01\%2F2003\&\_sk=999739997\&view=c\&wchp=dGLbVzz-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=e8a2e08322ac5ec678be300ddb36b522\&ie=f.pdf"
}

@INPROCEEDINGS{Apos0305:Routing,
AUTHOR="George Apostolopoulos",
TITLE="Routing Alternatives for Virtual Private Networks",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Virtual Private Networks (VPNs) is a popular method for
connecting enterprises over a public network infrastructure.
Until recently, service providers offered VPN service by building
a backbone network based on a specific layer 2 technology
like Frame-relay and Asynchronous Transfer Mode (ATM).
Recently a variety of methods has been proposed that
enable implementation of VPN services over IP-based backbone networks.
Using an IP-based backbone has the potential to significantly reduce
the capital expenditure of the service providers and allow them to offer
a variety of legacy and new services using a common
infrastructure.

Scalability is one of the basic requirements in all the IP-based
VPN architectures. One of the most important ways to achieve scalability
is to limit the amount of VPN specific information that is maintained
in the common (i.e. backbone) infrastructure of the service provider.
Thus, information that is not necessary to be known by the backbone
infrastructure is ``hidden'', allowing for better scalability.
In this paper, we focus on cases where the backbone must provide
explicit control on the placement of customers traffic on the backbone,
and thus
has to implement some form of constrained path
computation. Constrained path computation has been known to result in
high volumes of routing protocol control traffic. We will
explore if we can apply a similar information hiding
approach to the routing protocol control traffic. In particular, we
will investigate the feasibility and effectiveness of methods
for maintaining accurate
topology information at the edge of the provider's network, without
burdening
with routing protocol control traffic the routers that are internal to
this network.
We show that with relatively straightforward changes to the protocols used
in the
backbone, it is possible to achieve considerable savings in the amount of
the
routing protocol control overhead without compromising routing
performance."
}

@INPROCEEDINGS{Appl0303:Load,
AUTHOR="David Applegate and Mikkel Thorup",
TITLE="Load optimal {MPLS} routing with {N+M} labels",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="MPLS is becoming an important protocol for intra-domain routing. MPLS
routers are offered by the major vendors and many ISPs are deploying
MPLS in their IP backbones, as well as in ATM and Frame Relay networks.
For this period of possible transition to MPLS, it is urgent to
increase our understanding of the power and limitation of MPLS.

An attraction to MPLS is the flexibility it offers in engineering the
routing of traffic in a network, e.g., to support higher demands
without overloading any links. Mitra and Ramakrishnan [GLOBECOM'99]
showed that optimal routing solutions may be found for a diverse set
of traffic engineering goals. However, for a network with N nodes
(routers) and M edges (links), their MPLS implementation may use
N x M different labels. This is prohibitive since the number of
labels is the number of entries needed in the router tables.

We present an algorithm reducing the number of MPLS labels to N+M
without increasing any link load. Our explicit N+M bound makes it
easy to limit the table size requirement for a planed network, and
the linearity allows for tables implemented in fast memory. For
differentiated services with K traffic classes with different load
constraints, our bound increases to K(N+M). Our stack-depth is only
one, justifying implementations of MPLS with limited stack-depth.

Keywords: traffic engineering
Methods Keywords: mathematical programming/optimization"
}

@ARTICLE{Apte0305:Performance,
AUTHOR="Varsha Apte and Tony Hansen and Paul Reeser",
TITLE="Performance comparison of dynamic web platforms",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=8,
PAGES="888-898",
MONTH=may,
YEAR=2003,
REFERENCES=11,
KEYWORDS="Dynamic; Web; Common Gateway Interface; FastCGI; C++; Java; Servlets; Java
Server Pages; Performance; Comparison",
ABSTRACT="Over the last few years, the World Wide Web has transformed itself from a
static content-distribution medium to an interactive, dynamic medium. The
Web is now widely used as the presentation layer for a host of on-line
services such as e-mail and address books, e-cards, e-calendar, shopping,
banking, and stock trading. As a consequence (HyperText Markup
Language)HTML files are now typically generated dynamically after the
server receives the request. From the Web-site providers' point of view,
dynamic generation of HTML pages implies a lesser understanding of the
real capacity and performance of their Web servers. From the Web
developers' point of view, dynamic content implies an additional
technology decision: the Web programming technology to be employed in
creating a Web-based service. Since the Web is inherently interactive,
performance is a key requirement, and often demands careful analysis of
the systems. In this paper, we compare four dynamic Web programming
technologies from the point of view of performance. The comparison is
based on testing and measurement of two cases: one is a case study of a
real application that was deployed in an actual Web-based service; the
other is a trivial application. The two cases provide us with an
opportunity to compare the performance of these technologies at two ends
of the spectrum in terms of complexity. Our focus in this paper is on how
complex vs. simple applications perform when implemented using different
Web programming technologies. The paper draws comparisons and insights
based on this development and performance measurement effort.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-473N429-3-X\&\_cdi=5624\&\_orig=browse\&\_coverDate=05\%2F20\%2F2003\&\_sk=999739991\&view=c\&wchp=dGLbVtb-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=a4beb0c62b27951a1e12b8a1fb8cdf8c\&ie=f.pdf"
}

@INPROCEEDINGS{Arab0306:Sip,
AUTHOR="Knarig Arabshian and Henning Schulzrinne",
TITLE="A Sip-based Medical Event Monitoring System",
BOOKTITLE="5th International Workshop on Enterprise Networking and Computing in
Healthcare Industry (HealthCom)",
ADDRESS="Santa Monica, CA",
MONTH=jun,
YEAR=2003,
REFERENCES=18,
KEYWORDS="SIP; XML; SOAP; medical event monitoring; clinical event monitoring;",
ABSTRACT="The medical industry is transitioning to Internetbased
communication as the field of telemedicine broadens to
include medical event monitoring systems. A medical event
monitor generates different types of messages and alerts for healthcare
providers, institutions and patients. We describe how the Session
Initiation Protocol (SIP), a signaling protocol for Internet conferencing,
telephony, presence, event notification and instant messaging, can be used
to create a medical event monitoring system. SIP can work on a variety of
devices; its adoption as the protocol of choice for third generation
wireless networks allows for a robust and scalable environment that can
easily extend across institutions. First, we describe the basics of SIP
and how it can be used for event notifications. Secondly, we describe the
use of Medical Logic Modules (MLMs) in a clinical event monitoring system
and we propose a SIP medical event monitoring system that can combine the
use of MLMs, such as the Arden Syntax, with SIP event notification. We
also propose an alternate method of event notification with the use of XML
filters to deliver only relevant notifications. Finally, we
discuss the different types of devices and wireless protocols that can be
incorporated within the system, creating an integrated architecture.",
URL="http://www.cs.columbia.edu/~knarig/sipMed.pdf"
}

@INPROCEEDINGS{Arab0309:Generic,
AUTHOR="Knarig Arabshian and Henning Schulzrinne",
TITLE="A Generic Event Notification System Using {XML} and {SIP}",
BOOKTITLE="New York Metro Area Networking Workshop 2003",
ADDRESS="Bern Dibner Library Building, LC400,  Polytechnic University,  5 Metrotech
Cente",
DAYS=12,
MONTH=sep,
YEAR=2003,
ABSTRACT="We discuss a generic event notification system
using XML and SIP. XML messages are used for configuration
and filtering of events as well as the generation
of GUI. Event notification handling is implemented using
SUBSCRIBE and NOTIFY methods. The integration of
XML and SIP offers greater flexibility in creating a robust
event notification architecture. We describe the protocol
design and implementation of such a system."
}

@INPROCEEDINGS{Armo0303:Cache,
AUTHOR="Aner Armon and Hanoch Levy",
TITLE="Cache Satellite Distribution Systems: Modeling and Analysis",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT={Web caches have become an integral component contributing to the
improvement of the performance observed by Web clients. Content
Distribution Networks (CDN) and Cache Satellite Distribution Systems
(CSDS) have emerged as technologies for feeding the caches with the
information clients are expected to request, ahead of time. In a Cache
Satellite Distribution System (CSDS), the proxies participating in the
CSDS periodically report to a central station about the requests they are
receiving from their clients. The central station processes this
information and selects a collection of Web documents (or {"}Web
pages{"}), which it then {"}pushes{"} via a satellite broadcast to all, or
some, of the participating proxies, hoping most of them will request most
documents in the near future. The result is that upon such request, the
documents will reside in the local cache, and will not need to be fetch.

In this paper we aim at addressing the issues of how to operate the CSDS,
how to design it, and how to estimate its effect. Questions of interest
are 1) What classes of Web documents should be transmitted by the central
station, and how they are characterized, and 2) What is the benefit of
adding a particular proxy into a CSDS. We offer a model of this system
that accounts for the request streams addressed to the proxies and which
captures the intricate interaction between the proxy caches. Unlike models
that are based only on the access frequency of the various documents, this
model captures both their frequency and their locality of reference. We
provide an analysis of this system that is based on the stochastic
properties of the traffic streams that can be derived from HTTP logs. The
model and analysis can serve as a basis for the design and efficient
operation of the system.}
}

@ARTICLE{Arta0303:Performance,
AUTHOR="J. Artalejo and O. {Hernández-Lerma}",
TITLE="Performance analysis and optimal control of the Geo/Geo/c queue",
JOURNAL="Performance Evaluation",
VOLUME=52,
NUMBER=1,
PAGES="15-39",
MONTH=mar,
YEAR=2003,
REFERENCES=18,
KEYWORDS="Discrete queues; Multiple servers; Optimal control; Steady-state
distribution",
ABSTRACT="Discrete-time multiserver queues have been used for many years to
investigate the behavior of communication and computer systems in which
time is slotted. In this paper, we consider the discrete-time Geo/Geo/c
queue. We first develop an efficient recursive procedure to obtain the
steady-state probabilities and prove the convergence to the
continuous-time counterpart. We also deal with the infinite-horizon
discounted cost criterion for the arrival and service rate control
problems. Optimal stationary policies and value functions are determined.
This allows us to compare both control problems.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-47BXBWJ-2-GN\&\_cdi=5663\&\_orig=browse\&\_coverDate=03\%2F31\%2F2003\&\_sk=999479998\&view=c\&wchp=dGLbVzz-zSkzk\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=5963571b8be2f072d21a5fe0d6d9983c\&ie=f.pdf"
}

@ARTICLE{Ash0305:Performance,
AUTHOR="Gerald Ash",
TITLE="Performance evaluation of QoS-routing methods for IP-based multiservice
networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=8,
PAGES="817-833",
MONTH=may,
YEAR=2003,
REFERENCES=30,
KEYWORDS="Performance analysis; Traffic overload; Enhance network scalability; QoS
Routing",
ABSTRACT="This paper provides a performance analysis of lost/delayed traffic and
control load for various quality of service (QoS)-routing methods, which
control a network's response to traffic demands and other stimuli, such as
traffic overloads, link failures, or node failures. Essentially all of the
methods analyzed are already widely applied in operational networks
worldwide, particularly in PSTN networks employing TDM-based technology.
However, the methods are shown to be extensible to packet-based
technologies, in particular, to Internet protocol (IP)-based technologies.
Results of performance analysis models are presented which illustrate the
tradeoffs between various approaches. Based on the results of these
studies as well as established practice and experience, methods for
dynamic QoS routing and admission control are proposed for consideration
in network evolution to IP-based technologies. In particular, we find that
aggregated per-virtual-network bandwidth allocation compares favorably with
per-flow allocation. We also find that event-dependent routing (EDR)
methods for management of label switched paths perform just as well or
better than the state-dependent routing methods with flooding, which means
that EDR path selection has potential to significantly enhance network
scalability.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-473VSDP-1-C\&\_cdi=5624\&\_orig=browse\&\_coverDate=05\%2F20\%2F2003\&\_sk=999739991\&view=c\&wchp=dGLbVlb-zSkzk\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=d3277552af8f3950bd66eae68d5c7a2d\&ie=f.pdf"
}

@INPROCEEDINGS{Ashi0305:Impact,
AUTHOR="Majdi Ashibani",
TITLE="Impact of Renegotiation Frequency on {ATM} Network Performance",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Abstract- Bandwidth requirements for Variable Bit Rate (VBR) traffic such,
as compressed video, shows a dramatic variation over different time
intervals. Allocating a bandwidth at peak bit rate for the entire call
duration will guarantee the quality of service (QoS) but this result in
poor network resources utilization. We have proposed an alternative
approach that renegotiates the allocated bandwidth and QoS during the
lifetime of the connection.  In this paper, we present the results of a
performance evaluation for the proposed renegotiation-based dynamic
bandwidth allocation scheme. In particular, we determine the impact of the
renegotiation frequency on the network performance."
}

@INPROCEEDINGS{Assi0305:Performance,
AUTHOR="Chadi Assi and Abdallah Shami and Yinghua Ye and Sudhir Dixit and Mohamed
Ali",
TITLE="Performance Evaluation of Efficient Path Selection and Fast Restoration
Algorithms for Shared Restorable Mesh {WDM} Networks",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Efficient path selection combined with fast restoration algorithms is a key
requirement for designing shared restorable mesh networks. In this paper we
propose two distributed path selection algorithms for efficiently routing
restorable connections in optical networks. Routing restorable connections
implies the computation of two link/node disjoint paths (working and
backup) between every s-d pair. The first approach maintains global
information on network resource usage to determine link sharability and
compute optimal shared paths.  The second approach only relies upon local
information maintained at each node. Results indicate that path selection
algorithms that maximally exploit the use of reserved sharable channels
favor the selection of longer backup paths, which in turn increase the
network restoration time unless effective restoration algorithms are
implemented; we the propose a fast restoration algorithm that is
independent of the backup path length. We evaluate the performance of the
different path selection algorithms in terms of sharability gain; we also
conduct a detailed numerical validation for the proposed restoration
algorithm."
}

@INPROCEEDINGS{Atki0303:Evaluation,
AUTHOR="Benjamin Atkin and Ken Birman",
TITLE="Evaluation of an Adaptive Transport Protocol",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Applications on mobile computers must adapt to high variability in
wireless network performance. Extending the semantics of transport
protocols to offer more control over communication to the user allows
applications to adapt their behavior to bandwidth variability. We
examine adding bandwidth notifications, priorities and timeliness
guarantees to a network API as a method for achieving greater
application control over bursty traffic. Experiments demonstrate that
the extended API allows applications to adjust to bandwidth variations
effectively. We also compare three different implementations: two
extensions of TCP at the user-level, and one new protocol, ATP, which
performs comparably to the TCP extensions, but has better performance
for some workloads, including a workload simulating remote filesystem
traffic.

Methods keywords: system design, experimentation with real
networks/testbeds"
}

@TECHREPORT{Aubu0306:Voice,
AUTHOR="Rj Auburn and Michael Cafarella and Don Jackson and Jeff Peck and Pramod
Sharma and Saravanan Shanmughan and Corey Stohs and Yi Zhang",
EDITOR="Rj Auburn",
TITLE="Voice Browser Call Control: {{CCXML}} Version {1.0}",
TYPE="W3C Working Draft",
INSTITUTION="World Wide Web Consortium (W3C)",
MONTH=jun,
YEAR=2003,
NOTE="http://www.w3.org/TR/ccxml/",
ABSTRACT="This document describes CCXML, or the Call Control eXtensible Markup
Language. CCXML is designed to provide telephony call control support for
VoiceXML or other dialog systems. CCXML has been designed to complement
and integrate with a VoiceXML system. Because of this you will find many
references to VoiceXML's capabilities and limitations. You will also find
details on how VoiceXML and CCXML can be integrated. However it should be
noted that the two languages are separate and are not required in an
implementation of either language. For example CCXML could be integrated
with a more traditional IVR system and VoiceXML or other dialog systems
could be integrated with some other call control systems.",
URL="http://www.w3.org/TR/ccxml/"
}

@ARTICLE{Auer0302:Multicast,
AUTHOR="Joshua Auerbach and Madan Gopal and Marc Kaplan and Shay Kutten",
TITLE="Multicast Group Membership Management",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=1,
PAGES="166-175",
MONTH=feb,
YEAR=2003,
REFERENCES=31,
KEYWORDS="broadband; broadcast; distributed algorithms; distributed control; group
communication; multicast; protocols",
ABSTRACT="Multicast services, assisted by special hardware, are being considered as a
part of high-speed wide-area networks (WANs) in order to support new
generations of multiuser applications. The paper describes a multicast
service application for high-speed WANs which is capable of exploiting
multicast hardware. Indeed, this research was conducted in the context of
the spanning tree hardware structure of PARIS and of plaNET, the
pioneering broadband experimental networks that predated ATM. The results
of this research were also included in IBM's ATM, called networking
broadband services (NBBS). We achieve modularity and low cost by assigning
to distinct components the separate problems of: 1) naming groups; 2)
finding group members in a network; 3) configuring multicast hardware; 4)
delivering multicast messages in sequence. This modularity enables, for
example, the multicast, on one hand, to a group to which the user
initiates the joining (formed by using 1 and 2 above) and, on the other
hand, to groups computed by the source. We give the overall organization
of our service and then describe in detail the methods used to solve the
first two of the subproblems.",
URL="http://ieeexplore.ieee.org/iel5/90/26510/01180553.pdf?isNumber=26510\&prod=JNL\&arnumber=1180553\&arSt=+166\&ared=+175\&arAuthor=Auerbach\%2C+J.\%3B+Gopal\%2C+M.\%3B+Kaplan\%2C+M.\%3B+Kutten\%2C+S."
}

@ARTICLE{Avra0302:Large,
AUTHOR="Florin Avram",
TITLE="On the large deviations approximation for the stationary distribution of
skip-free regulated queueing networks",
JOURNAL="Performance Evaluation",
VOLUME=51,
NUMBER="2-4",
PAGES="171-190",
MONTH=feb,
YEAR=2003,
REFERENCES=26,
KEYWORDS="Large deviations; Stationary distribution; Skip-free networks; Phase-type;
Compensation expansion",
ABSTRACT={Large deviations papers like that of Ignatyuk et al. [Russ. Math. Surv. 49
(1994) 4199] have shown that asymptotically, the stationary distribution
of homogeneous regulated networks is of the form 

 


with the coefficient  being different in various {"}boundary influence
domains{"} and also depending on some of these domains on n. In this
paper, we focus on the case of constant exponents  and on a subclass of
networks we call {"}strongly skip-free{"} (which includes all Jackson and
all two-dimensional skip-free networks). We conjecture that an asymptotic
exponent  is constant iff it corresponds to a large deviations escape path
which progresses gradually (from the origin to the interior) through
boundary facets whose dimension always increases by one. Solving the
corresponding large deviations problem for our subclass of networks leads
to a family of {"}local large deviation systems{"} (LLDSs) (for the
constant exponents), which are expressed entirely in terms of the cumulant
generating function of the network. In this paper, we show that at least
for {"}strongly skip-free{"} Markovian networks with independent
transition processes, the LLDS is closely related to some {"}local
boundary equilibrium systems{"} (LESs) obtained by retaining from the
equilibrium equations only those valid in neighborhoods of the boundary.
Since asymptotic results require typically only that the cumulant
generating function is well-defined over an appropriate domain, it is
natural to conjecture that these LLDSs will provide the asymptotic
constant exponents regardless of any distributional assumptions made on
the network.

Finally, we outline a practical recipe for combining the local
approximations to produce a global large deviations approximation , with
the coefficients Kj determined numerically.},
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-46WPNY4-1-DJ\&\_cdi=5663\&\_orig=browse\&\_coverDate=02\%2F28\%2F2003\&\_sk=999489997\&view=c\&wchp=dGLbVlz-zSkWW\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=4bf89a4d823744f3124c62271cbdacd6\&ie=f.pdf"
}

@ARTICLE{Azon03:Indoor,
AUTHOR="Victor Azondekon and Michel Barbeau and Ramiro Liscano",
TITLE="Indoor Ad Hoc Proximity-Location Sensing for Service Provider Selection",
JOURNAL="Telecommunications Systems",
ADDRESS="Basel",
YEAR=2003,
REFERENCES=18,
KEYWORDS="location-based services; user location; call follow-me; infrared",
ABSTRACT="There are protocols that can be used by mobile clients to discover service
providers in foreign
networks to which they get attached, e.g. SDP of Bluetooth and SLP of
IETF. These protocols do
address service discovery, but do not address the selection of a service
provider among a set of
candidates according to physical proximity of the client and service
provider. The goal of the
research described in this paper is to integrate proximity-based selection
mechanisms to service
discovery protocols. We present in this paper protocols that allow nomadic
clients to discover and
select service providers according to physical proximity.",
URL="http://www.scs.carleton.ca/~liscano/docs/telecomsys.pdf"
}

@ARTICLE{Çam0311:Non,
AUTHOR="Hasan Cam",
TITLE="Non-blocking {OVSF} codes and enhancing network capacity for {3G} wireless
and beyond systems",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=16,
PAGES="1907-1917",
MONTH=nov,
YEAR=2003,
REFERENCES=15,
KEYWORDS="Non-blocking; Orthogonal variable spreading factor; Wideband CDMA;
Capacity; Time multiplexing; Encoding",
ABSTRACT="Orthogonal variable spreading factor (OVSF) codes are employed as
channelization codes in wideband CDMA. Any two OVSF codes are orthogonal
if and only if one of them is not a parent code of the other. Therefore,
when an OVSF code is assigned, it blocks all of its ancestor and
descendant codes from assignment because they are not orthogonal to each
other. Unfortunately, this code-blocking problem of OVSF codes can cause a
substantial spectral efficiency loss of up to 25\%. This paper presents
non-blocking OVSF (NOVSF) codes to increase substantially the utilization
of channelization codes without having the overhead of code reassignments.
In addition, an encoding algorithm is presented to increase network
capacity and support higher data rates when NOVSF codes are employed.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-48S4CP8-3-4N\&\_cdi=5624\&\_orig=browse\&\_coverDate=11\%2F01\%2F2003\&\_sk=999739982\&view=c\&wchp=dGLbVzb-zSkzS\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=fa2fa00febd5ea51a81a7d10d68937a9\&ie=f.pdf"
}

@INPROCEEDINGS{Babo0303:Packet,
AUTHOR="Florin Baboescu and Sumeet Singh and George Varghese",
TITLE="Packet Classification for Core Routers: Is there an alternative to CAMs?",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="A classifier consists of a set of rules for classifying packets based
on header fields.  Because core routers can have fairly large (e.g.,
2000 rule) database and must use limited SRAM to meet OC-768 speeds,
the best existing classification algorithms (RFC, HiCuts, ABV) are
precluded because of the large amount of memory they need. Thus the
general belief is that hardware solutions like CAMs are needed,
despite the amount of board area and power they consume.  In this
paper, we provide an alternative to CAMs via an Extended Grid-of-Tries
(EGT) algorithm whose worst-case speed scales well with database size
while using a minimal amount of memory. Our evaluation is based on 
real databases used by Tier 1 ISPs, and synthetic databases. 
EGT is based on a observation that we found
holds for all the Tier 1 databases we studied: regardless of database
size, any {\em packet matches only a small number of distinct
source-destination prefix pairs}.  The code we wrote for EGT, RFC,
HiCuts, and ABV is publically available, providing the first publically
available code to encourage experimentation with classification
algorithms."
}

@INPROCEEDINGS{Bacc0303:Downlink,
AUTHOR="Francois Baccelli and Bartlomiej Blaszczyszyn and Florent Tournois",
TITLE="Downlink Admission/Congestion Control and Maximal Load in {CDMA} Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="This paper is focused on the influence of geometry
on the combination of inter-cell and intra-cell interferences
in the downlink of large cdma networks. We use an exact representation
of the geometry of the downlink channels to define scalable
admission and congestion control schemes, namely schemes that
allow each base station to decide independently of the others
what set of voice users to serve and/or what bit rates to offer
to elastic traffic users competing for bandwidth.
We then study the load of these schemes when the size
of the network tends to infinity using stochastic geometry tools.
By load, we mean here the distribution of the number of voice users 
that each base station can serve and that of the bit rate offered
to each elastic traffic user."
}

@INPROCEEDINGS{Bacc0303:Flow,
AUTHOR="Francois Baccelli and Dohy Hong",
TITLE="Flow Level Simulation of Large {IP} Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="The aim of this paper is to simulate the interaction
of a large number of TCP controlled flows and UDP flows sharing many
routers/links, from the knowledge of the network parameters (capacity,
buffer size, topology, scheduling) and of the characteristics of
each TCP (RTT, route etc.) and UDP flow.
This work is based on the description
via some fluid evolution equations, of the joint evolution of the
window sizes of all flows over a single bottleneck router/link,
in function of the synchronization rate. It is shown that
the generalization of this fluid dynamics to a network composed
of several routers can be described via equations
allowing one to simulate the interaction of e.g.
millions of TCP flows on networks composed of tens of thousands of
links and routers on a standard workstation.
The main output of the simulator are the
mean value and the fluctuations of the throughput obtained by each flow,
the localization of the bottleneck routers/links, the losses on each
of them and the time evolution of aggregated input traffic at each router
or link. The method is validated against NS simulations.
We show that several important statistical
properties of TCP traffic which were identified on traces are also
present on traffic generated by our simulator: for instance,
aggregated traffic generated by this representation exhibits the same
short time scale statistical properties as those observed on real traces.
Similarly, the experimental laws describing the fairness of the bandwidth
sharing operated by TCP over a large network are also observed on
the simulations."
}

@INPROCEEDINGS{Bacc0303:Interaction,
AUTHOR="Francois Baccelli and Dohy Hong",
TITLE="Interaction of {TCP} Flows as Billiards",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="The aim of this paper is to analyze the performance
of a large number of long lived TCP controlled flows sharing many
routers (or links), from the knowledge of the network parameters
(capacity,
buffer size, topology) and of the characteristics of each TCP
flow (RTT, route etc.) when taking synchronization into account.
It is shown that the dynamics of such a network can be described
in terms of iterate of random piecewise affine maps,
or geometrically as a billiards in the Euclidean space with as
many dimensions as the number of flow classes and as many reflection
facets as there are routers. This class of billiards exhibits
both periodic and non-periodic asymptotic oscillations,
the characteristics of which are
extremely sensitive to the parameters of the network.
This indicates that for large populations
and in the presence of synchronization, aggregated throughputs
exhibit fluctuations that are due to the
network as a whole, that follow some complex fractal patterns,
and that come on top of other and more classical
flow or packet level fluctuations.
The consequences on TCP's fairness are exemplified on a
few typical cases of small dimension."
}

@INPROCEEDINGS{Bacc0305:Adaptive,
AUTHOR="Enzo Baccarelli and Mauro Biagi",
TITLE="An Adaptive Codec for Multi-User Interference Mitigation for UWB-based
WLANs",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this contribution we propose a simple codec for Ultra WideBand (UWB)
radio networks limited by Multi-User Interference (MUI). The proposed
codec exhibits adaptive capabilities with respect to MUI degrading effects
and, depending on MUI level, it may switch from an
hard-detection operating mode to a soft-detection one. So doing, the
presented scheme gains resistance against near-far effect. Several
numerical tests show that our scheme outperforms conventional ones
currently planned for UWB systems up to several orders of magnitude in
MUI-limited Wireless Local Area Networks (WLANs)."
}

@INPROCEEDINGS{Badi0305:Model,
AUTHOR="Leonardo Badia and Michele Zorzi and Alessandro Gazzini",
TITLE="A Model for Threshold Comparison Call Admission Control A Model for
Threshold Comparison Call Admission Control in Third Generation Cellular
Systems",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we present a study of Admission
Control in 3G systems. In particular, the behavior of algorithms
already presented in the literature is analyzed, with respect
to their implementation in UMTS-like systems, and a model of
trade-off between the QoS metrics, blocking and dropping probability,
is presented. Obtained performance is discussed and analyzed under
different points of view.
Finally, possibilities to improve fairness and generality of these
results open up when a more detalied model for mobility, data rate and
discontinuous transmission (DTX) is considered."
}

@INPROCEEDINGS{Baer0305:Iterative,
AUTHOR="Stephan Baero and Joachim Hagenauer and Melanie Witzke",
TITLE="Iterative Detection of {MIMO} Transmission Using a List-Sequential {(LISS)}
Detector",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="For iterative detection in systems employing multiple antennas with
  an outer code we need a MIMO detector delivering a-posteriori
  probabilities (APP) about the coded bits. Full-APP detection would
  lead to prohibitive complexity, therefore we extend for high-level
  signals the concept of the sphere decoder using an approach from
  sequential decoding instead of geometrical considerations. We show
  how a priori information can be incorporated into the metric, which
  is then optimized by systematic tree search. Furthermore, we show
  how the reliability of the resulting L-values can be improved by
  augmenting the complete search tree.  Simulation results show
  an improved performance over the list sphere decoder."
}

@ARTICLE{Bagl0308:Proposal,
AUTHOR="Marco Baglietto and Raffaele Bolla and Franco Davoli and Mario Marchese and
Maurizio Mongelli",
TITLE="A proposal of new price-based Call Admission Control rules for Guaranteed
Performance services multiplexed with Best Effort traffic",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=13,
PAGES="1470-1483",
MONTH=aug,
YEAR=2003,
REFERENCES=44,
KEYWORDS="Call Admission Control; Pricing; Proportional Fairness; Best Effort
services; Guaranteed Performance services; IP Quality of Service;
Asynchronous Transfer Mode; Flow control",
ABSTRACT="Pricing for the use of telecommunication services is an issue widely
treated in the literature. In the last years it has received a growing
attention in order to establish various fairness criteria in the bandwidth
allocation for each type of traffic class. A number of pricing models have
been proposed and analyzed in the context of Quality of Service (QoS)
guaranteed networks (e.g. ATM, IP Integrated Services, IP Differentiated
Services) and more recently, also for Best Effort (BE) environments. In
the context of QoS networks the pricing scheme can influence the Call
Admission Control (CAC) rules. On the contrary, for a BE service, users
accept a variable bandwidth allocation, they are not subject to CAC and
their pricing policies, according to the Proportional Fairness Pricing,
are integrated within the flow control. In this paper we investigate the
condition where both BE traffic and traffic explicitly requiring QoS
(Guaranteed Performance, GP) are present. We propose three CAC rules for
the GP traffic. The aim is to maximize the Internet Service Provider's
overall revenue and to establish a bound over the GP traffic prices.
Numerical results are presented to show the good performance of the
proposed techniques.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47X1KYX-3-6B\&\_cdi=5624\&\_orig=browse\&\_coverDate=08\%2F15\%2F2003\&\_sk=999739986\&view=c\&wchp=dGLbVzz-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=91a68508a5832b8c6a4b2d66dac87e72\&ie=f.pdf"
}

@INPROCEEDINGS{Baha0303:Optimal,
AUTHOR="Omri Bahat and Armand Makowski",
TITLE="Optimal replacement policies for non-uniform cache objects with optional
eviction",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Replacement policies for general caching applications and Web caching in
particular have been extensively addressed in the literature.
Many policies that focus on document costs, size, probability of
references and temporal locality of requested documents, have been
proposed. In many cases these policies are ad-hoc attempts to take
advantage of the statistical information contained in the stream of
requests, and to address the factors above. However, since the
introduction of optimal replacement policies for conventional caching,
the problem of finding optimal replacement policies under the factors
indicated has not been studied in any systematic manner. In this paper, we
take a step in that direction: We first show, still under the Independent
Reference Model, that a simple Markov stationary replacement policy,
called the policy C0, minimizes the long-run average metric induced by
non-uniform document costs when document eviction is optional. We then use
these results to propose a framework to operate caching systems with
multiple performance metrics. We do so
by solving a constrained caching problem with a single constraint.
The resulting constrained optimal replacement policy is obtained by simple
randomization between two Markov stationary optimal replacement policies C0
but induced by different costs."
}

@INPROCEEDINGS{Bai0303:IMPORTANT,
AUTHOR="Fan Bai and Narayanan Sadagopan and Ahmed Helmy",
TITLE="{IMPORTANT:} A framework to systematically analyze the Impact of Mobility
on Performance of RouTing protocols for Adhoc NeTworks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="A Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes
forming a temporary network without using any existing infrastructure.
Since not many MANETs are currently deployed, research in this area is
mostly simulation based. Random Waypoint is the commonly used mobility
model in these simulations. Random Waypoint is a simple model that may be
applicable to some scenarios. However, we believe that it is not
sufficient to capture some important mobility characteristics of scenarios
in which MANETs may be deployed. Our framework aims to evaluate the impact
of different mobility models on the performance of MANET routing
protocols. We propose various protocol independent metrics to capture
interesting mobility characteristics, including spatial and temporal
dependence and geographic restrictions. In addition, a rich set of
parameterized mobility models is introduced including Random Waypoint,
Group Mobility, Freeway and Manhattan models. Based on these models
several 'test-suite' scenarios are chosen carefully to span the metric
space. We demonstrate the utility of our test-suite by evaluating various
MANET routing protocols, including DSR, AODV and DSDV. Our results show
that the protocol performance may vary drastically across mobility models
and performance rankings of protocols may vary with the mobility models
used. This effect can be explained by the interaction of the mobility
characteristics with the connectivity graph properties. Finally, we
attempt to decompose the routing protocols into mechanistic ``building
blocks'' to gain a deeper insight into the performance variations across
protocols in the face of mobility."
}

@PROCEEDINGS{Bai0310:Enhancing,
AUTHOR="Haowei Bai and Mohammed Atiquzzaman",
TITLE="Enhancing {TCP} Throughput over Lossy Links Using ECN-Capable {RED}
Gateways",
ORGANIZATION="58th IEEE Vehicular Technology Conference",
ADDRESS="Orlando, Florida, USA",
MONTH=oct,
YEAR=2003,
ABSTRACT="Explicit Congestion Notification (ECN), when used with Random Early
Detection (RED)
bu®ers, reduces packet losses and delays of Transport Control Protocol
(TCP) based applications.
However, choosing the bu®er size and optimum parameter values of RED
bu®ers are still
open research issues. In this paper, we first present a model to determine
the optimal value
of REDs maximum threshold to achieve zero packet loss at RED routers.
Secondly, as one
of our models applications, we propose a new TCP algorithm, called
Di®erentiation Capable
TCP (Di®-C-TCP) to improve the TCP performance over wireless links.
Since most of network
congestion losses can be eliminated by our zero loss model, Di®-C-TCP
assumes packet losses to
be the indicator of link corruption and uses ECN mechanism to explicitly
indicate the network
congestion. We have shown that our analytical zero packet loss model
matches simulation results
very well, and our proposed Di®-C-TCP algorithm is able to improve the
TCP throughput
significantly. The significance of our zero packet loss model is that the
RED bu®er size, and
consequently the queuing delay, can be much smaller than what has been
proposed earlier.",
URL="http://www.cs.ou.edu/~atiq/papers/03-BAI\_VTC.pdf"
}

@ARTICLE{Bai0312:Error,
AUTHOR="Haowei Bai and Mohammed Atiquzzaman",
TITLE="Error Modeling Schemes For Fading Channels in Wireless Communications: A
Survey",
JOURNAL="IEEE Communications Surveys",
VOLUME=5,
NUMBER=2,
MONTH=dec,
YEAR=2003,
ABSTRACT="Network system designers need to understand the error performance of
wireless
mobile channels in order to improve the quality of communications by
deploying
better modulation and coding schemes, and better network architectures. It
is also
desirable to have an accurate and thoroughly reproducible error model,
which would
allow network designers to evaluate a protocol or algorithm and its
variations in a
controlled and repeatable way. However, the physical properties of radio
propagation, and the diversities of error environments in a wireless
medium, lead to
complexity in modeling the error performance of wireless channels. This
article
surveys the error modeling methods of fading channels in wireless
communications,
and provides a novel user-requirement (researchers and designers) based
approach
to classify the existing wireless error models.",
URL="http://www.cs.ou.edu/~atiq/papers/03-BAI\_Com\_Surv.pdf"
}

@ARTICLE{Bak0303:Framework,
AUTHOR="Andrzej Bak and W. Burakowski and F. Ricciato and Stefano Salsano and
Halina Tarasiuk",
TITLE="A framework for providing differentiated QoS guarantees in IP-based network",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=4,
PAGES="327-337",
MONTH=mar,
YEAR=2003,
REFERENCES=14,
KEYWORDS="Quality of service; Traffic classes; Admission control algorithm",
ABSTRACT="The paper describes the traffic handling mechanisms implemented in the
AQUILA pilot QoS IP network [AQUILA Project Consortium (2001)] [11]. The
AQUILA architecture enhances the DiffServ concept [A Conceptual Model for
DiffServ Routers (2000), An Architecture for Differentiated Services
(1998), An Expedited Forwarding PHB (2001)] by adding new functionality
for admission control and resource management as well as by defining new
set of Network Services (NSs) [4, 6 and 3]. Each NS is optimised for
specific type of traffic (e.g. reactive and non-reactive) and has its own
traffic handling mechanisms. The mentioned mechanisms operate at different
time scales, ranging from long-medium term resources management
(provisioning, resource pools) to flow level admission control, down to
packet level scheduling and queuing management. Some of these mechanisms
are related to NSs: in particular each NS is associated to a set of
traffic handling algorithms at flow and packet level, collectively
referred to as Traffic Classes (TCLs). This paper describes the set of
traffic handling mechanisms defined in AQUILA, with a special focus on the
implementation of TCLs, both at packet and flow level. In particular the
scheduling/queuing and admission control schemes for each TCL are
presented. Exemplary measurement results verifying the effectiveness of
AQUILA approach for providing Quality of Service (QoS) guarantees and QoS
differentiation are also included.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47DTGX7-1-15\&\_cdi=5624\&\_orig=browse\&\_coverDate=03\%2F01\%2F2003\&\_sk=999739995\&view=c\&wchp=dGLbVtz-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=c22d341424287b719ee0be8882b4ecd3\&ie=f.pdf"
}

@BOOK{Bakk0308:PHP,
AUTHOR="Stig Bakken and Alexander Aulbach and Egon Schmid and Jim Winstead and Lars
Wilson and Rasmus Lerdorf and Andrei Zmievski and Jouni Ahto",
TITLE="{PHP} Manual",
PUBLISHER="The PHP Documentation Group",
MONTH=aug,
YEAR=2003,
KEYWORDS="php; web services",
ABSTRACT={PHP, which stands for {"}PHP: Hypertext Preprocessor{"} is a widely-used
Open Source general-purpose scripting language that is especially suited
for Web development and can be embedded into HTML. Its syntax draws upon
C, Java, and Perl, and is easy to learn. The main goal of the language is
to allow web developers to write dynamically generated webpages quickly,
but you can do much more with PHP.

This manual consists primarily of a function reference, but also contains
a language reference, explanations of some of PHP's major features, and
other supplemental information.},
URL="http://www.php.net"
}

@ARTICLE{Bala03:Study,
AUTHOR="Elias Balafoutis and Antonis Panagakis and Nikolaos Laoutaris and Ioannis
Stavrakakis",
TITLE="Study of the Impact of Replacement Granularity and Associated Strategies on
Video Caching",
JOURNAL="Cluster Computing",
YEAR=2003,
NOTE="to appear",
URL="http://users.cnl.di.uoa.gr/~laoutaris/ClusterComputing.pdf"
}

@ARTICLE{Bald0306:Comparison,
AUTHOR="Mario Baldi and Yoram Ofek",
TITLE="A Comparison of Ring and Tree Embedding for Real-Time Group Multicast",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=3,
PAGES="451-464",
MONTH=jun,
YEAR=2003,
REFERENCES=30,
KEYWORDS="communication systems; computer networks; flow control; multicast channels;
multimedia communications; multimedia systems; real-time system;
synchronization; timing",
ABSTRACT="In general topology networks, routing from one node to another over a tree
embedded in the network is intuitively a good strategy, since it typically
results in a route length of O(logn) links, n being the number of nodes in
the network. Routing from one node to another over a ring embedded in the
network results in route length of O(n) links. However, in group
(many-to-many) multicast, the overall number of links traversed by each
packet, i.e., the networks elements on which resources must possibly be
reserved, is typically O(N) for both tree and ring embedding, where N is
the size of the group. The paper focuses on tree versus ring embedding for
real-time group multicast in which all packets should reach all the nodes
in the group with a bounded end-to-end delay. Real-time properties are
guaranteed by the deployment of time-driven priority in network nodes. In
order to have a better understanding of the nontrivial problem of ring
versus tree embedding, we consider static, dynamic and adaptive group
multicast scenarios. Tree and ring embedding are compared using different
metrics. The results are interesting and counterintuitive, showing that
embedding a tree is not always the best strategy. In particular, dynamic
and adaptive multicast on a tree require a protocol for updating state
information during operation of the group. Such a protocol is not required
on the ring where the circular topology and implicit token passing
mechanisms are sufficient. Moreover, the bandwidth allocation on the ring
for the three multicast scenarios is O(N), while on a general tree it is
O(N) for the static multicast scenario and O(N^2) for the dynamic and
adaptive multicast scenarios.",
URL="http://ieeexplore.ieee.org/iel5/90/27187/01208305.pdf?isNumber=27187\&prod=JNL\&arnumber=1208305\&arSt=+451\&ared=+464\&arAuthor=Baldi\%2C+M.\%3B+Ofek\%2C+Y."
}

@ARTICLE{Bals0302:Review,
AUTHOR="Simonetta Balsamo and Vittoria Personè and Paola Inverardi",
TITLE="A review on queueing network models with finite capacity queues for
software architectures performance prediction",
JOURNAL="Performance Evaluation",
VOLUME=51,
NUMBER="2-4",
PAGES="269-288",
MONTH=feb,
YEAR=2003,
REFERENCES=56,
KEYWORDS="Queueing network; Blocking after service; Software architectures; Modelling",
ABSTRACT="A review is carried out on how queueing network models with blocking have
been applied so far into the performance evaluation and prediction of
Software Architectures (SA). Queueing network models with finite capacity
queues and blocking have recently been introduced and applied as more
realistic models of systems with finite capacity resources and population
constraints. Queueing network models have been often adopted as models for
the evaluation of software performance. Starting from our own experience,
we observe the need of a more accurate definition of the performance
models of SA to capture some features of the communication systems. We
consider queueing networks with finite capacity and blocking after service
(BAS) to represent some synchronization constraints that cannot be easily
modeled with queueing network models with infinite capacity queues. We
investigate the use of queueing networks with blocking as performance
models of SA with concurrent components and synchronous communication.
Queueing theoretic analysis is used to solve the queueing network model
and study the synchronous communication and performance of concurrent
software components. Our experience is supported by other approaches that
also propose the use of queueing networks with blocking. Directions for
future research work in the field are included.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-47BXBWJ-1-24\&\_cdi=5663\&\_orig=browse\&\_coverDate=02\%2F28\%2F2003\&\_sk=999489997\&view=c\&wchp=dGLbVlb-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=d9780ad47f59945a3e40a43a58d07a95\&ie=f.pdf"
}

@INPROCEEDINGS{Band0303:Energy,
AUTHOR="Seema Bandyopadhyay and Edward Coyle",
TITLE="An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor
Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="A wireless network consisting of a large number of small sensors with
low-power transceivers can be an effective tool for gathering data in a
variety of environments. The data collected by each sensor is communicated
through the network to a single processing center that uses all reported
data to determine characteristics of the environment or detect an event.
The communication or message passing process must be designed to conserve
the limited energy resources of the sensors. Clustering sensors into
groups, so that sensors communicate information only to clusterheads and
then the clusterheads communicate the aggregated information to the
processing center, may save energy. In this paper, we propose a
distributed, randomized clustering algorithm to organize the sensors in a
wireless sensor network into clusters. We then extend this algorithm to
generate a hierarchy of clusterheads and observe that the energy savings
increase with the number of levels in the hierarchy.  Results in
stochastic geometry are used to derive solutions for the values of
parameters of our algorithm that minimize the total energy spent in the
network when all sensors report data through the clusterheads to the
processing center.

Methods Keywords: Optimization, stochastic processes, simulation"
}

@INPROCEEDINGS{Band0305:Improving,
AUTHOR="Somprakash Bandyopadhyay and Manab Pal and Dola Saha and Tetsuro Ueda and
Kazuo Hasuike",
TITLE="Improving System Performance of Ad Hoc Wireless Network with Directional
Antenna",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="It has been shown that use of directional antenna in the context of ad hoc
wireless networks can largely reduce radio interference, thereby improving
the utilization of wireless medium. However, that alone does not always
guarantee improvement in overall system performance. In this paper, we
have identified several criteria and investigated their interrelationships
and impact on overall system performance in this context. Our methodology
uses optimisation techniques using multicriteria decision analysis. We use
analytic hierarchy process (AHP) to identify relative weights of different
criteria under different application-specific scenario in order to solve
the optimisation problem for each scenario by TOPSIS approach. The result
shows that the parameter setting required to get optimum performance is
application-specific; depending on the situation or application-scenario,
several parameters need to be controlled to get better system performance."
}

@INPROCEEDINGS{Bane0303:Construction,
AUTHOR="Suman Banerjee and Christopher Kommareddy and Koushik Kar and Samrat
Bhattacharjee and Samir Khuller",
TITLE="Construction of an Efficient Overlay Multicast Infrastructure for Real-time
Applications",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We consider an overlay architecture where service providers deploy
a set of service nodes (called MSNs) in the network to efficiently
implement media-streaming applications. These MSNs are organized
into an overlay and act as application-layer multicast forwarding
entities for a set of clients.

We present a decentralized scheme that organizes the MSNs into an
appropriate overlay structure that is particularly beneficial for
real-time applications.  We formulate our optimization criterion
as a ``degree-constrained minimum average-latency problem'' which
is known to be NP-Hard.  A key feature of this formulation is that
it gives a dynamic priority to different MSNs based on the size of
its service set.

Our proposed approach iteratively modifies the overlay tree using
localized transformations to adapt with changing distribution of MSNs,
clients, as well as network conditions. We show that a centralized
greedy approach to this problem does not perform quite as well,
while our distributed iterative scheme efficiently converges to
near-optimal solutions."
}

@INPROCEEDINGS{Bans0303:Capacity,
AUTHOR="Nikhil Bansal and Zhen Liu",
TITLE="Capacity, Delay and Mobility in Wireless Ad-Hoc Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Network throughput and packet delay are two important
parameters in the design and the evaluation of routing protocols  for
ad-hoc
networks. While mobility has been shown to increase the capacity of a
network, it is not clear whether the delay can be kept low without trading
off
the throughput.
We consider a theoretical framework and
 propose a routing algorithm which exploits the patterns in the mobility
of
nodes to provide guarantees on the delay. Moreover, the throughput
achieved by the algorithm is only a poly-logarithmic factor off from the
optimal.
The algorithm itself is fairly simple. In order to analyze its
feasibility and the performance guarantee, we used various
techniques of probabilistic analysis of algorithms.
The approach taken in this paper could be applied to the analyses
of some other routing algorithms for  mobile ad hoc networks
proposed in the literature."
}

@TECHREPORT{Bans0307:Observation,
AUTHOR="Sorav Bansal and Mary Baker",
TITLE="Observation-based Cooperation Enforcement in Ad Hoc Networks",
TYPE="arXiv",
NUMBER="cs.NI/0307012",
MONTH=jul,
YEAR=2003,
KEYWORDS="Networking and Internet Architecture",
ABSTRACT="Ad hoc networks rely on the cooperation of the nodes participating in the
network to forward packets for each other. A node may decide not to
cooperate
to save its resources while still using the network to relay its traffic.
If
too many nodes exhibit this behavior, network performance degrades and
cooperating nodes may find themselves unfairly loaded. Most previous
efforts to
counter this behavior have relied on further cooperation between nodes to
exchange reputation information about other nodes. If a node observes
another
node not participating correctly, it reports this observation to other
nodes
who then take action to avoid being affected and potentially punish the
bad
node by refusing to forward its traffic. Unfortunately, such second-hand
reputation information is subject to false accusations and requires
maintaining
trust relationships with other nodes. The objective of OCEAN is to avoid
this
trust-management machinery and see how far we can get simply by using
direct
first-hand observations of other nodes' behavior. We find that, in many
scenarios, OCEAN can do as well as, or even better than, schemes requiring
second-hand reputation exchanges. This encouraging result could possibly
help
obviate solutions requiring trust-management for some contexts.",
URL="http://arXiv.org/abs/cs/0307012"
}

@INPROCEEDINGS{Barb0305:Concatenated,
AUTHOR="Sergio Barbarossa and Gesualdo Scutari and Giancarlo Paccapeli",
TITLE="Concatenated space-time block coding with maximum diversity gain",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this work we propose a concatenated space-time block coding
scheme for transmissions over block fading frequency selective
channels, which guarantees maximum diversity gain and high coding
gain, with affordable receiver complexity. We derive a closed form
expression for the bound of the pairwise error probability which
is instrumental to devise the optimal coding strategy and then we
check our theoretical derivations with simulations and compare our
approach with alternative ones."
}

@INPROCEEDINGS{Barh0305:Time,
AUTHOR="Imad Barhumi and Geert Leus and Marc Moonen",
TITLE="Time-Varying {FIR} Equalization of Doubly-Selective Channels",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper we propose a zero forcing (ZF) time-varying
(TV) Finite Impulse Response (FIR) equalizer for doubly-selective
(time- and frequency-selective) channels. We use the basis
expansion model (BEM) to approximate the doubly-selective channel and
to design the TV FIR equalizer. This allows us to turn a large TV
problem into an equivalent small time-invariant (TIV) problem,
containing only the BEM coefficients of the doubly-selective channel
and the TV FIR equalizer. It is shown that a ZF TV FIR equalizer
only exists if there is more than one
receive antenna.
The ZF TV FIR equalizer approach we propose here unifies and extends
many previously proposed serial equalization approaches.
Through computer simulations we show that the performance of the
proposed ZF TV FIR equalizer
 approaches the one of the ZF block equalizer, while the equalization
 as well as the design
 complexity is much lower."
}

@ARTICLE{Bart0302:Call,
AUTHOR="P. Barta and F. {Németh} and R. Szabó",
TITLE="Call admission control in generalized processor sharing schedulers with
tight deterministic delay bounds",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=2,
PAGES="65-78",
MONTH=feb,
YEAR=2003,
REFERENCES=26,
KEYWORDS="Generalized processor sharing; Bandwidthdelay decoupling; Call admission
control",
ABSTRACT="Generalized processor sharing (GPS) is reported as the most important ideal
fluid scheduling discipline, which many practical packet scheduling
algorithms (WFQ, WF2Q) are built on. However, all of them bear the
bandwidthdelay coupling property due to the commonly used
rate-proportional weighting of sessions and offer too loose deterministic
delay bounds. These deficiencies lead to poor network utilization and
preclude the development of efficient call admission control (CAC)
schemes. In this paper we address these problems by proposing an algorithm
for tight individual session delay bound computation and several CAC
algorithms for session resource assignment in a bandwidthdelay decoupled
GPS system. Besides the analytical framework numerical examples as well as
the complexity analysis of different CAC algorithms are also presented.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-45WGHWB-1-6K\&\_cdi=5624\&\_orig=browse\&\_coverDate=02\%2F01\%2F2003\&\_sk=999739997\&view=c\&wchp=dGLbVzb-zSkzS\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=dd47a0cbd9ac0ae30cb35915c1523fac\&ie=f.pdf"
}

@ARTICLE{Bart0303:Implementation,
AUTHOR="Nevenko Bartolincic and Ivana Pezelj and Igor Velimirovic and Andelko
Zigman",
TITLE="The implementation of broadband network technologies in CARNet",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=5,
PAGES="465-471",
MONTH=mar,
YEAR=2003,
REFERENCES=11,
KEYWORDS="Academic ISP; xDSL; Multicast; Videoconferencing; MoD; Streaming",
ABSTRACT="During the first decade of its existence, Croatian Academic and Research
NetworkCARNet faced a number of changes in all segments of its activities.
In its efforts not to wait for future to happen, but to predict its users
needs, and present acceptable solutions to them, a lot of research and
practical work is done concluding with a strong network infrastructure and
a number of network services, including real-time applications. In this
paper, researches in the field of lower layers network technologies and
multimedia application like videoconferencing, media on demand and
broadcast technologies implementation in CARNet network is presented.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-472JK9W-2-C\&\_cdi=5624\&\_orig=browse\&\_coverDate=03\%2F20\%2F2003\&\_sk=999739994\&view=c\&wchp=dGLbVlb-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=08864645c71efd8ff73e72be150032f1\&ie=f.pdf"
}

@ARTICLE{Bass0302:Hierarchy,
AUTHOR="Harpal Bassali and Krishnanand Kamath and Rajendraprasad Hosamani and Lixin
Gao",
TITLE="Hierarchy-aware algorithms for {CDN} proxy placement in the Internet",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=3,
PAGES="251-263",
MONTH=feb,
YEAR=2003,
REFERENCES=24,
KEYWORDS="Internet Routing; CDN; Proxy Server",
ABSTRACT="The wide adoption and explosive growth of the Internet has led to
increasing demand for near instantaneous response from users. Caching is
an important avenue to save network bandwidth, reduce server load and the
response time experienced by web clients. Content Distribution Networks
(CDNs) have emerged as a powerful solution to improve the client response
time and to reduce the traffic in the Internet. CDNs consist of a set of
distributed proxy servers replicating the content for better performance
and availability than centralized servers. The key factor in determining
the effectiveness of a CDN is the placement of proxy servers. Network
topology and routing policies play an important role on the effectiveness
of proxy server placement. However, existing studies on proxy server
placement either consider simplified topology (i.e. tree topology) or
focus on a particular snapshot of Internet topology. In addition, none of
the studies have taken into consideration of the routing policies imposed
by Internet Service Providers (ISPs), which is crucial in determining the
performance of web access. In this paper, we present heuristic algorithm
for CDN proxy server placement by taking into account the hierarchical
Internet structure and the routing policy constraint resulting from it.
Our experimental results on the Internet topology over three years show
that the heuristic algorithms adapt to the Internet growth well.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-469W6GV-2-1N\&\_cdi=5624\&\_orig=browse\&\_coverDate=02\%2F15\%2F2003\&\_sk=999739996\&view=c\&wchp=dGLbVzb-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=1ac529b6054b80780e454a4326fab3ea\&ie=f.pdf"
}

@INPROCEEDINGS{Basu0303:Fast,
AUTHOR="Anindya Basu and Girija Narlikar",
TITLE="Fast Incremental Updates for Pipelined Forwarding Engines",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Pipelined ASIC architectures are increasingly being used in forwarding 
engines for high speed IP routers.  We explore optimization issues in
the design of memory-efficient data structures that support fast
incremental updates in such forwarding engines. Our solution aims to
balance the memory utilization across the multiple pipeline stages. We
also propose a series of optimizations that minimize the disruption to
the forwarding process caused by route updates. These optimizations
reduce the update overheads by a factor of 2-6 for a variety of
different core routing tables and update traces."
}

@INPROCEEDINGS{Batt0303:Computing,
AUTHOR="Giuseppe {Di Battista} and Maurizio Patrignani and Maurizio Pizzonia",
TITLE="Computing the Types of the Relationships between Autonomous Systems",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We investigate the problem of computing the types of the relationships 
between Internet Autonomous Systems. We refer to the model introduced 
in [Gao 2001], [Subramanian et al. 2002] that bases the discovery of 
such relationships on the analysis of the AS paths extracted from the 
BGP routing tables. We characterize the time complexity of the above 
problem, showing both NP-completeness results and efficient algorithms 
for solving specific cases. Motivated by the hardness of the general 
problem, we propose heuristics based on a novel paradigm and show their
effectiveness against publicly available data sets. The experiments put
in evidence that our approach performs significantly better than 
previously presented approaches."
}

@INPROCEEDINGS{Beau0305:Performance,
AUTHOR="Frédéric Beaulieu and Sonia Aissa",
TITLE="On the performance and complexity of a position-based scheduling algorithm
for {WCDMA} networks",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We recently proposed a method to control the downlink packet flow at
the base stations of CDMA wireless networks [1] where we maximize
data throughput while ensuring fairness among users. In this work, we
investigate important issues for realistic implementations. 
Firstly, we evaluate the network performance when cell subdivision
is utilized for the purpose of complexity reduction. 
We obtain up to 50\% reduction for a minimal loss in total throughput.
Secondly, a modified algorithm is
proposed to support multi-class users. The results show 
that priority for distant users requesting high data rate
can be maintained with no significant decrease in throughput.
The compromise between short-term fairness ensured by
our algorithm and long-term fairness taking benefit of mobility
is also studied and compared.
Moreover, to be able to support high priority users even when they 
undergo bad channel conditions, we implement two transmit diversity
schemes, an open-loop method and a closed-loop method. Simulations
show that the closed-loop technique provides up to 29\% gain in
throughput."
}

@TECHREPORT{Beck0312:RDF,
AUTHOR="Dave Beckett and Brian McBride",
TITLE="{RDF/XML} Syntax Specification (Revised)",
TYPE="W3C proposed recommendation",
INSTITUTION="World Wide Web Consortium",
MONTH=dec,
YEAR=2003
}

@INPROCEEDINGS{Bege0305:Multi,
AUTHOR="Ali Begen and Yucel Altunbasak and Ozlem Ergun",
TITLE="Multi-Path Selection for Multiple Description Encoded Video Streaming",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper presents a new framework for multimedia streaming that
integrates the application and network layer functionalities to
meet such stringent application requirements as delay and loss.
The coordination between these two layers provides more robust
media transmission even under severe network conditions. In this
framework, a multiple description source coder is used to produce
multiple independently-decodable streams that are routed over
partially link-disjoint (non-shared) paths to combat bursty packet
losses. We model multi-path streaming and propose a multi-path
selection method that chooses a set of paths maximizing the
overall quality at the client. Overlay infrastructure is then used
to achieve multi-path routing over these selected paths. The
simulation results show that the average peak signal-to-noise
ratio (PSNR) improves by up to 8.1 dB, if the same source video is
routed over intelligently selected multiple paths instead of the
shortest path or maximally link-disjoint paths. In addition to
PSNR improvement in quality, the end-user experiences a more
continual streaming quality."
}

@ARTICLE{Begu0303:Development,
AUTHOR="Dinko Begusic and Nikola Rozic and Hrvoje Dujmic",
TITLE="Development of the communication/information infrastructure at the academic
institution",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=5,
PAGES="472-476",
MONTH=mar,
YEAR=2003,
REFERENCES=3,
KEYWORDS="Communication/information infrastructure; Academic institution; Academic
networking; Wireless local area network",
ABSTRACT="The quality and functionality of the communication/information
infrastructure is essential for the development of the academic
institution. The status of the academic institution and its relationship
with other subjects such as government institutions and companies
establish the basic potentials and constraints for the infrastructural
development. The Faculty of Electrical Engineering, Mechanical Engineering
and Naval Architecture (FESB) of the University of Split in Croatia is an
example of the academic institution with dynamic development of its
communication/information infrastructure. The support by the Ministry of
Science and Technology and the CARNet has been the major driving force in
development of the basic communication/information infrastructure. The
major result of this cooperation has been the deployment of the local area
network and provision of the Internet connections and services. However,
the intensive collaboration with the renown ICT companies on joint
research and development projects in the area of ICT technology and
services have generated new potentials for development of the
communication/information infrastructure at FESB. Important results of
this cooperation include installation of the digital PABX, development of
the experimental communication network based on technologies such as ATM,
ISDN, IP, xDSL, GSM and DECT. Another important step is the ongoing
process of introduction of the wireless local area network to enable the
mobility of students and faculty members within the premises. The plans
for the future development of the communication/information infrastructure
at FESB include continuous work on introduction of new ICT technologies and
improvement of the functionality through the cooperation with the partners.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-46SG6BV-1-G\&\_cdi=5624\&\_orig=browse\&\_coverDate=03\%2F20\%2F2003\&\_sk=999739994\&view=c\&wchp=dGLbVlb-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=136f66e286a056094d392a6c4f76a2cd\&ie=f.pdf"
}

@INPROCEEDINGS{Beje0303:Algorithms,
AUTHOR="Yigal Bejerano and Yuri Breitbart and Ariel Orda and Rajeev Rastogi and
Alex Sprintson",
TITLE="Algorithms for Computing QoS Paths with Restoration",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="There is a growing interest among service providers
to offer  new services with Quality of Service (QoS)
guaranties that are also resilient to failures. Supporting QoS
connections requires the existence of a routing mechanism, that
computes the QoS paths, i.e., paths that satisfy QoS constraints
(e.g., delay or bandwidth).  Resilience to failures, on the other
hand, is achieved by providing, for each primary QoS path,
a set of alternative QoS paths used upon a failure of either a
link or a node. The above objectives, coupled with the need to
minimize the global use of network resources, imply that the cost
of both the primary path and the restoration topology should be a
major consideration of the routing process.

We undertake a comprehensive study of problems related to finding
suitable restoration topologies for QoS paths. We consider both
bottleneck QoS constraints, such as bandwidth, and additive QoS
constraints, such as delay and jitter. This is the first study to
provide a rigorous solution, with proven guaranties, to the
combined problem of computing QoS paths with
restoration. It turns out that the widely used approach of
disjoint primary and
restoration paths is not an optimal strategy. Hence, the proposed
algorithms construct a restoration
topology, i.e., a set of bridges, each bridge protecting a
portion of the primary QoS path. This approach guaranties to find
a restoration topology with low cost when one exists.

In addition to analysis, we test our approach also by way of
simulations. The simulation results demonstrate that our proposed
approximation algorithms identify QoS restoration paths whose
cost is significantly smaller than those provided by alternative
approaches.

METHODS KEYWORDS: Graph Theory, Combinatorics."
}

@INPROCEEDINGS{Beje0303:Physical,
AUTHOR="Yigal Bejerano and Yuri Breitbart and Minos Garofalakis and Rajeev Rastogi",
TITLE="Physical Topology Discovery for Large Multi-Subnet Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Knowledge of the up-to-date physical (i.e., layer-2) topology
of an Ethernet network is crucial to a number of critical 
network management tasks, including reactive and proactive
resource management, event correlation, and root-cause analysis.
Given the dynamic nature of today's IP networks, keeping track
of topology information manually is a daunting (if not impossible)
task.  Thus, effective algorithms for automatically discovering
physical network topology are necessary. In this paper, we propose
the first complete algorithmic solution for discovering the physical
topology of a large, heterogeneous Ethernet network comprising
multiple subnets as well as (possibly) dumb or uncooperative network
elements. Our algorithms rely on standard SNMP MIB information that
is widely supported in modern IP networks and require no modifications
to the operating system software running on elements or hosts.  
Furthermore, we formally demonstrate that our solution is complete
for the given MIB data; that is, if the MIB information is sufficient
to uniquely identify the network topology then our algorithm is
guaranteed to recover it.  To the best of our knowledge, ours is
the first solution to provide such a strong completeness guarantee."
}

@INPROCEEDINGS{Beje0303:Robust,
AUTHOR="Yigal Bejerano and Rajeev Rastogi",
TITLE="Robust Monitoring of Link Delays and Faults in {IP} Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="In this paper, we develop failure-resilient techniques for monitoring link
delays and faults in a Service Provider or Enterprise IP network. Our
two-phased approach attempts to minimize both the monitoring
infrastructure costs as well as the additional traffic due to probe
messages. In the first phase of our approach, we compute the locations of
a minimal set of monitoring stations such that all network links are
covered, even if some network links were to fail. Subsequently, in the
second phase, we compute a minimal set of probe messages that are
transmitted by the stations to measure link delays and isolate network
faults. We show that both the station selection problem as well as the
probe assignment problem are NP-hard. We then propose greedy approximation
algorithms that achieve a logarithmic approximation factor for the station
selection problem and a constant factor for the probe assignment problem.
These approximation ratios are provably very close to the best possible
bounds for any algorithm.

Methods Keywords: Mathematical optimization, Graph theory."
}

@ARTICLE{Beki0303:Role,
AUTHOR="Zoran Bekic and Jasenka Gojsic and Predrag Pale",
TITLE="The role and strategy of an ARNet in a developing country",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=5,
PAGES="460-464",
MONTH=mar,
YEAR=2003,
REFERENCES=10,
KEYWORDS="Information technology; ARNet; Strategy; Connectivity; Content; Pilot
projects; Services; Consulting; Education; CARNet",
ABSTRACT="Information technology is changing the way we live and work. The extent and
speed of change is tremendous. Society needs a guide and an aide in the
introduction of changes. This is the role of academic and research
community. However, they too need help, integration and infrastructure,
which should be the assignment for an Academic and Research Network
(ARNet). It should provide infrastructure for academic community, research
testbed, and be pilot for other nation-wide networks, organizer and
motivator of the community.

To accomplish this, ARNet's strategy should be to ensure connectivity by
the mean of connecting all, public access and broadband connections. It
should also provide content through reference information, referral
information, common databases, centralized databases and information
services. By offering services like specialized helpdesks, national
services (DNS, IP addresses), public host and resource sharing and by
organizing and providing education for end-users, teachers, technicians
and administrators ARNet would enable and empower academic users. Through
pilot projects and consulting services for non-academic communities and
activities ARNet would guide academic community in fulfilling it's
mission.

Approach, described in this paper as theory on role and strategy of an
ARNet, has been approved by 9 years of practical experience and results of
Croatian Academic and Research Network.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-46RDF5H-5-5\&\_cdi=5624\&\_orig=browse\&\_coverDate=03\%2F20\%2F2003\&\_sk=999739994\&view=c\&wchp=dGLbVlb-zSkzk\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=d3008b709d458d4bf4927fc0aba38bd8\&ie=f.pdf"
}

@MASTERSTHESIS{Bels0301:Enterprise,
AUTHOR="Meletis Belsis",
TITLE="An Enterprise {IT} Security Incident Management System",
SCHOOL="Coventry University",
ADDRESS="Priory St, Coventry CV1 5FB, UK",
MONTH=jan,
YEAR=2003,
REFERENCES=91,
NOTE="MPhil in Information Security",
KEYWORDS="Security Incident, Enterprise Security, Security Management",
ABSTRACT="In the past few decades the world of computing has changed. The TCP/IP
protocol
suite has shaped the way computing power is used. People use computers
almost daily.
The prime concern every user is facing revolves around the safety of
his/her personal
data whether those are located on his local drive or in a remote location.
The problem
of information security increases when one thinks of the enterprises that
use
information technology systems to store \“sensitive\”
information.
Computer scientists have developed a number of security software and
hardware. To
provide adequate protection for a modern enterprise, experts combine these
different
processes to produce security architectures. This dissimilarity usually
makes the
security architecture unstable and thus leaves security flaws into the
system. Today
security incidents are a common phenomenon for modern enterprises.
Security incident
management is one of the areas that can offer valuable information to
security specialists but still lacks development
This research aims to develop an Enterprise IT Security Incident Data
Model. The
proposed model is able to store all the information associated with a
security incident.
Although a general Enterprise IT Security data model is being described we
choose to
perform deeper analysis only in the incident structure. This selection is
done due to the
applicability problems of the existing incident structures in a modern
enterprise. The
incident structure allows security specialists and the management to
decide on the weak
links in the security architecture and to spread the security budget
accordingly.
Security specialist will be able to learn the technical details of an
incident (i.e. server
software that was attack) and the management is going to be able to learn
the managerial details associated with every incident (i.e. how much did
it cost to theenterprise). In later stages of the implementation of this
model security experts will be
able to use the incident data gathered inside the model and to perform
hypothetical
simulated attacks on their systems. Along with that, the proposed incident
management
system, described in this thesis, will allow for the automated recording
of every
security incident that takes place in the enterprise."
}

@PROCEEDINGS{Bels0305:Building,
AUTHOR="Meletis Belsis and Leonid Smalov",
TITLE="Building an Enterprise {IT} Security Management System",
ORGANIZATION="18th IFIP International Conference on Information Security",
MONTH=may,
YEAR=2003,
REFERENCES=18,
KEYWORDS="Securtiy Model, Enterprise Security Architecture, Security Management",
ABSTRACT="Moving towards a knowledge economy, managing effectively and safely the
corporate data is the key to an organisation\’s survival and
success. Corporative employees that technologies like computers, mobile
and portable devices to access the information. Safeguarding corporate
information that flows in unprotected land lines and airwaves is
critically important. Adversaries attack information systems, their tools
and techniques are numerous and widely available. Analysis of various
security incidents has shown that the corporative attempt to achieve and
maintain \“absolute\” security is not always effective and
usually is far too expensive. To provide adequate protection for the
modern enterprise, security architectures need to be build. These include
security mechanisms, tools and policies that provide an acceptable level
of protection for the enterprise. This paper presents the work in progress
in developing an enterprise information security data model. The proposed
prototype aims at presenting security specialists with more effective ways
of managing existing security architectures implemented by the enterprise."
}

@INPROCEEDINGS{Bels0305:Building,
AUTHOR="Meletis Belsis and Leonid Smalov",
TITLE="Building an enterprise {IT} security management system",
BOOKTITLE="18th IFIP International Conference on Information Security",
MONTH=may,
YEAR=2003,
KEYWORDS="Security Model, Enterprise Security Architecture, Security Management.",
ABSTRACT=":   Moving towards a knowledge economy, managing effectively and safely the
corporate data is the key to an organisation\’s survival and success.
Corporative employees that technologies like computers, mobile and portable
devices to access the information. Safeguarding corporate information that
flows in unprotected land lines and airwaves is critically important.
Adversaries attack information systems, their tools and techniques are
numerous and widely available. Analysis of various security incidents has
shown that the corporative attempt to achieve and maintain
\“absolute\” security is not always effective and usually is
far too expensive. To provide adequate protection for the modern
enterprise, security architectures need to be build. These include
security mechanisms, tools and policies that provide an acceptable level
of protection for the enterprise. This paper presents the work in progress
in developing an enterprise information security data model. The proposed
prototype aims at presenting security specialists with more effective ways
of managing existing security architectures implemented by the enterprise."
}

@ARTICLE{Bels03:Accessing,
AUTHOR="Meletis Belsis and Anthony Godwin and Leon Smalov",
TITLE="Accessing Security Incident information on the Internet",
JOURNAL="Journal Of Information Warfare",
YEAR=2003,
REFERENCES=22,
KEYWORDS="Computer Security Incident Response Teams, Security Incident reporting and
retrieval",
ABSTRACT="Computer security Incident Response teams have emerged due to the increase
of computer crime. These can be
national, international or organisation based.  Maintaining a CSIRT poses
a number  of  problems .In this paper
the authors describe two of the technical problems that CSIRT's have, the
storage and the acquisition of incident
data.  The paper describes a system based on the CORBA model that can be
used for the efficient management of
the incident recording database.  The proposal also provides for
alternative ways of accessing the database by
companies and security analysts."
}

@INPROCEEDINGS{Berg0303:Performance,
AUTHOR="Gilles Berger-Sabbatel and Franck Rousseau and Martin Heusse and Andrzej
Duda",
TITLE="Performance anomaly of 802.11b",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We analyze the performance of the IEEE 802.11b standard for wireless
local area networks. We have observed that when some mobile hosts use
a lower bit rate than the others, the performance of all hosts is
considerable degraded. Such a situation is a common case in wireless
local area networks in which a host far away from an access point is
subject to important signal fading and interference. To cope with this
problem, the host degrades its bit rate to some lower
value. Typically, 802.11b products degrade the bit rate from 11 Mb/s
to 5.5, 2, or 1 Mb/s when repeated frame drops are detected. In this
case, a host transmitting for example at 1 Mb/s reduces the throughput
of all other hosts transmitting at 11 Mb/s to a low value below 1
Mb/s. The reason for this anomaly is the basic CSMA/CA channel access
method: it guarantees that a long term channel access probability is
equal for all hosts. When one host captures the channel for a long
time because its bit rate is low, it penalizes other hosts that use
the higher rate. We analyze the anomaly theoretically by deriving
simple expressions for the available throughput and provide several
performance measurements."
}

@INPROCEEDINGS{Berg0306:Ubiquitous,
AUTHOR="Stefan Berger and Henning Schulzrinne and Stylianos Sidiroglou and Xiaotao
Wu",
TITLE="Ubiquitous Computing Using {SIP}",
BOOKTITLE="ACM NOSSDAV 2003",
ADDRESS="Monterey, California, USC",
PAGES="82-89",
MONTH=jun,
YEAR=2003,
ABSTRACT="In the past decade, there have been numerous efforts in ubiquitous
computing, making computational resources or communication
more widely available. We believe that it is time to move to
a global-scale ubiquitous computing system that is securable, administered
by multiple independent administrators and integrates
off-the-shelf hardware and software. We are developing such a system
based on the Session Initiation Protocol (SIP), with Bluetooth
devices for location sensing and Service Location Protocol (SLP)
for service discovery. We also introduce context-aware location
information
to augment device discovery and user communication.
The system builds on our CINEMA infrastructure and can support
a range of activities, from home-based settings to collaboration between
distant sites.",
URL="http://www.cs.columbia.edu/IRT/papers/Berg0306\_Ubiquitous.pdf"
}

@INPROCEEDINGS{Bert0305:Mlse,
AUTHOR="Tanya Bertozzi",
TITLE="{MLSE} receiver using particle filtering over a multipath fading channel",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Instead of reduced-state decision-feedback sequence estimation (DFSE)
equalization which is the state-of-the-art solution for the complexity
reduction of the full-state Viterbi decoder over a fading multipath
channel, we propose a new reduced-complexity maximum likelihood sequence
detector (MLSD) based on the particle filtering technique. The
computational complexity of this new detector is adapted according to the
signal-to-noise ratio. Compared to the DFSE detector the particle detector
offers a better trade-off between performance and computational complexity."
}

@INPROCEEDINGS{Bhat0303:Distributed,
AUTHOR="Sudeept Bhatnagar and Badri Nath",
TITLE="Distributed Admission Control to Support Guaranteed Services in
Core-Stateless Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="The core-stateless service architecture alleviates the scalability
problems of integrated service architecture while maintaining its
guaranteed service semantics. The admission control methods proposed
to support core-stateless guaranteed services have significant
drawbacks. We propose a scalable and robust distributed admission
control architecture to support core-stateless guaranteed
services. Our architecture maintains high network utilization while
ensuring that resources are not over-allocated. In our architecture,
admission control is performed at the ingress edge routers of a
request on an edge-to-edge path basis. A token-passing mechanism
is used as the resource management framework. The token helps in
dynamic and fair division of bandwidth and allows completely
distributed resource allocation on a link unless the link is close to
saturation. The edge routers co-operate to provide fault tolerance
effectively
acting as a resilient overlay network. Our admission control framework
can support statistical guarantees and diffserv architecture's premium
service as well. The resource management part of our architecture is
well-suited to aid QoS routing algorithms. Analytical and simulation
results are
presented to show the effectiveness of our architecture."
}

@INPROCEEDINGS{Bhat0305:\epsilon,
AUTHOR="Sudeept Bhatnagar and Badri Nath",
TITLE="$\epsilon$-fairness: A trade-off between overhead and max-min fairness",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Max-min fair bandwidth allocation is desirable because it protects
well-behaved flows from ill-behaved ones, while keeping network
utilization high. Achieving absolute global max-min
fairness at a fine flow granularity is difficult. Moreover, computing
and communicating max-min fair rates has a significant overhead. In
this paper, we define the notion of $\epsilon$-fairness and derive the
conditions for flow rates to be $\epsilon$-fair. We describe a technique
where max-min fairness is computed at the level of {\em flow groups} while
$\epsilon$-fairness is provided to {\em individual flows}. Using
$\epsilon$-fairness allows the network administrator to control the degree
of fairness with an overhead proportional to the degree. An important
implication of our technique is that traffic-pattern knowledge can be used
to reduce overhead while still maintaining
$\epsilon$-fairness."
}

@ARTICLE{Bhat0312:Efficient,
AUTHOR="Supratik Bhattacharyya and James Kurose and Don Towsley and Ramesh
Nagarajan",
TITLE="Efficient Rate-Controlled Bulk Data Transfer Using Multiple Multicast
Groups",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=6,
PAGES="895-907",
MONTH=dec,
YEAR=2003,
REFERENCES=28,
KEYWORDS="bulk data; heterogeneity; multiple multicast groups; rate control",
ABSTRACT="Controlling the rate of bulk data multicast to a large number of receivers
is difficult, due to the heterogeneity among the end systems' capabilities
and their available network bandwidth. If the data transfer rate is too
high, some receivers will lose data, and retransmissions will be required.
If the data transfer rate is too slow, an inordinate amount of time will be
required to transfer the data. In this paper, we examine an approach toward
rate-controlled multicast of bulk data in which the sender uses multiple
multicast groups to transmit data at different rates to different
subgroups of receivers. We present simple algorithms for determining the
transmission rate associated with each multicast channel, based on static
resource constraints, e.g., network bandwidth bottlenecks. Transmission
rates are chosen so as to minimize the average time needed to transfer
data to all receivers. Analysis and simulation are used to show that our
policies for rate selection perform well for large and diverse receiver
groups and make efficient use of network bandwidth. Moreover, we find that
only a small number of multicast groups are needed to reap most of the
possible performance benefits.",
URL="http://ieeexplore.ieee.org/iel5/90/28078/01255428.pdf?isNumber=28078\&prod=JNL\&arnumber=1255428\&arSt=+895\&ared=+907\&arAuthor=Bhattacharyya\%2C+S.\%3B+Kurose\%2C+J.F.\%3B+Towsley\%2C+D.\%3B+Nagarajan\%2C+R."
}

@INPROCEEDINGS{Bian0303:Kalman,
AUTHOR="Giuseppe Bianchi and Ilenia Tinnirello",
TITLE="Kalman Filter Estimation of the Number of Competing Terminals in an {IEEE}
{802.11} network",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Throughput performance of the IEEE 802.11 Distributed Coordination 
Function (DCF) is very sensitive to the number $n$ of competing 
stations. The contribute of this paper is threefold. First, we show 
that $n$ can be expressed as function of the collision probability 
encountered on the channel; hence, it can be estimated based 
on run-time measurements. Second, we show that the estimation of $n$, 
based on exponential smoothing of the measured collision probability
(specifically, an ARMA filter), results to be a biased estimation, 
with poor performance in terms of accuracy/tracking trade-offs. Third,
we propose a methodology to estimate $n$, based on an extended Kalman 
filter coupled with a change detection mechanism. This approach
shows both high accuracy as well as prompt reactivity to changes in 
the network occupancy status. Numerical results show that, although 
devised in the assumption of saturated terminals, our proposed approach 
results effective also in non saturated conditions, and specifically in 
tracking the average number of competing terminals."
}

@INPROCEEDINGS{Bigl0305:Suboptimum,
AUTHOR="Ezio Biglieri and Alessandro Nordio and Giorgio Taricco",
TITLE="Suboptimum receiver interfaces for coded multiple-antenna systems",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We compare complexities and performances of some
suboptimum linear and nonlinear (BLAST) interfaces used for
decoding space-time codes used over a Rayleigh fading channel. We
observe how the introduction of an interleaver can be beneficial
here. We introduce a new simple iterative linear interface, based
on hard Viterbi decoding and offering a performance considerably
improved with respect to noniterative receivers."
}

@INPROCEEDINGS{Birk0303:Multicast,
AUTHOR="Yitzhak Birk and Diego Crupnicoff",
TITLE="A Multicast Transmission Schedule for Scalable Multi-Rate Distribution of
Bulk Data Using Non-Scalable Erasure-Correcting Codes",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="This paper addresses the efficient multicast dissemination of bulk data
from a single server to numerous clients. The challenge is complex: a
client may commence reception at arbitrary times, should receive as little
extra data as possible until it can reconstruct the entire content, and
should have flexibility in choosing the data rate. From the network
perspective, the data rate over any link should be as close as possible to
the maximum single-downstream-client subscription rate. Also, the solution
should scale to huge files and numerous subscribers, and should withstand
changing network conditions and packet loss. Finally, it should be
friendly to other traffic. For any base client-subscription rate and
integer factors thereof, we jointly achieve all these goals in a
near-optimal way while using standard (any k of N) block
erasure-correcting codes. Scalability in file size is attained by breaking
the file into equisized groups of equisized blocks and separately encoding
each group. The other properties are attained by a unique open-loop
layered multicast transmission schedule. Each client merely subscribes to
one or more standard multicast groups. The need to use special,
non-standard and possibly proprietary codes that scale well is thus
obviated."
}

@INPROCEEDINGS{Blae03:TopBot,
AUTHOR="Paul Blaer and Peter Allen",
TITLE="TopBot: Automated Network Topology Detection with a Mobile Robot",
BOOKTITLE="of ICRA",
ADDRESS="Taipei",
YEAR=2003,
REFERENCES=9,
KEYWORDS="802.11; network measurements; positioning",
ABSTRACT="We have demonstrated that a properly-equipped mobile robot can
easily construct a detailed map of the wireless coverage of an urban
environment. The Autonomous Vehicle for Exploration and Navigation of
Urban Environments (AVENUE) mobile robot was successfully used to
generate such maps in both manual and autonomous modes of operation. The
resulting database contained a wealth of information for many different
positions in the region, with a list of all access points viewable from
each location together with a quality measure (the signal-to-noise
ratio) of every detected signal. At a later time, the AVENUE system
effectively used the data in this map to determine the approximate
position of the robot as it traveled through the urban area.",
URL="http://www.cs.columbia.edu/~allen/PAPERS/icra2003.blaer.pdf"
}

@ARTICLE{Blas0303:Advanced,
AUTHOR="Mario Blasi and Carlo {des Dorides}",
TITLE="Advanced solutions for distance learning via satellite",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=5,
PAGES="423-429",
MONTH=mar,
YEAR=2003,
REFERENCES=2,
KEYWORDS="Skyplex; Distance learning; Satellite based telecommunication",
ABSTRACT="Distance learning has aroused more and more interest during the last few
years due to the convergence of several factors, namely the growth of
education as a key driver for socio-economic development, the remarkable
step forward of telecommunication technology and the number of people
involved in the education process itself (user basin).

A major obstacle has resulted to be, in many cases, the cost factor
induced by the telecom transmission cost which has often made the distance
learning system non-viable. This consideration has directed people's
attention to satellite systems which, due to their intrinsic
peculiarities, well answer the most important requisites: wide coverage
area, high geographical penetration, low unit cost when operating in
broadcasting mode, mature technology and so affordable terminal receiving
cost.

In this direction an interactive solution is offered by SkyplexNet,1 an
advanced satellite telecommunication platform based on innovative space
technology and integrated with versatile network management functions.

SkyplexNet well answers distance learning service requirements, providing
an asymmetrical connection to the user, namely a high rate on the forward
(receiving) link via satellite and a low rate on the return (interactive)
one via a terrestrial modem: this paper describes the main functions of
the system highlighting its operational characteristics as well as the
tele-education application which allows the creation of new pedagogical
education models.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-46SWC8F-3-9\&\_cdi=5624\&\_orig=browse\&\_coverDate=03\%2F20\%2F2003\&\_sk=999739994\&view=c\&wchp=dGLbVlz-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=f80903c316b94218d8ec11d946fbea98\&ie=f.pdf"
}

@INPROCEEDINGS{Blef0305:Theoretical,
AUTHOR="Nicola Blefari-Melazzi and Dario {Di Sorte} and Mauro Femminella and
Gianluca Reali",
TITLE="Theoretical Analysis of a Virtual Delay based Tariff Model",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we present a per-call usage-based tariff model to charge for
IP guaranteed services. The tariff is built on the basis of the virtual
delay, which is a value characterizing an improved IP service. We propose
a model to compute the virtual delay within an administrative domain from
purely technical considerations, taking into account traffic, performance
and system parameters. In addition, we analyze the sensitivity of the
virtual delay and of the tariff to the involved parameters, taking into
account both users benefit and operators' income. Our goal is to provide
directions for dimensioning purposes."
}

@ARTICLE{Blef0312:Accounting,
AUTHOR="N. Blefari-Melazzi and D. Sorte and G. Reali",
TITLE="Accounting and pricing: a forecast of the scenario of the next generation
Internet",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=18,
PAGES="2037-2051",
MONTH=dec,
YEAR=2003,
REFERENCES=55,
KEYWORDS="IP; Quality of service; Accounting; Pricing; Inter-domain routing;
Scalability; Market flexibility",
ABSTRACT="The Internet is becoming a multi-service network. This transformation makes
it necessary to differentiate both network services and tariffs, according
to the types of applications and customers' willingness to pay.
Significant changes to existing architectures, procedures and protocols
are necessary in order to turn the Internet into a multi-service network
and a platform to develop business solutions efficiently. This evolution
will favor the realization and deployment of advanced architectures to
support routing, Quality of Service (QoS) provisioning, pricing, billing,
accounting, and security functions.

The flat-rate pricing model, commonly applied by Internet Service
Providers, may become inadequate when added value IP services have to be
charged. Hence, the need to define new pricing criteria, based on an
appropriate combination of current usage of network resources and on the
amount of the reserved resources, is expected. Other issues specifically
related to these aspects are QoS-and-price based inter-domain routing,
transport and content accounting models and architectures. The paper aims
at introducing these problems, by describing and evaluating the solutions
proposed in literature from the point of view of scalability and
flexibility of market offers, and by identifying possible short-medium
term trends in the field.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-48PVF5J-2-20\&\_cdi=5624\&\_orig=browse\&\_coverDate=12\%2F31\%2F2003\&\_sk=999739981\&view=c\&wchp=dGLbVtz-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=8f7bed9de02cb8db547114fdd2990514\&ie=f.pdf"
}

@ARTICLE{Blob0310:Using,
AUTHOR="B. Blobel and P. Hoepner and R. Joop and Stamatis Karnouskos and G.
Kleinhuis and G. Stassinopoulos",
TITLE="Using a privilege management infrastructure for secure web-based e-health
applications",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=16,
PAGES="1863-1872",
MONTH=oct,
YEAR=2003,
REFERENCES=13,
KEYWORDS="Privilege Management Infrastructure; e-Health; Attribute certificates;
X.509",
ABSTRACT="Within the European HARP project, the HARP Cross Security Platform (HCSP)
has been specified to design and to implement trustworthy distributed
applications for health over the open Internet enabling both communication
and application security services. Certified servlets composed and
attributed according to the user's authorisation create certified and
signed XML messages. From those messages, user-role-related applets are
generated. The HCSP consists of a client environment, web server, an
application server, as well as a database server and an archive server.
The needed Privilege Management Infrastructure (PMI) has been established
by an Attribute Authority and a policy server. The HCSP components are
distributed installed over all countries involved. The role-based
authorization has been defined according to the policy deploying the
user's attribute certificates. The HARP solution has been practically
implemented for a Clinical Study demonstrator.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-484KMB6-1-H\&\_cdi=5624\&\_orig=browse\&\_coverDate=10\%2F15\%2F2003\&\_sk=999739983\&view=c\&wchp=dGLbVlz-zSkzS\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=aa7ad992bf37016023d1431ae0de0efe\&ie=f.pdf"
}

@INPROCEEDINGS{Blum0305:Analysis,
AUTHOR="Rick Blum",
TITLE="Analysis of {MIMO} Capacity with Interference",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="System capacity is considered for a group of interfering users 
employing single user detection and multiple transmit and receive 
antennas for flat Rayleigh fading channels with independent fading 
coefficients for each path. The focus is on the case where there is 
no channel state information at the transmitter, but channel state 
information is assumed at the receiver.   It is shown that the 
optimum signaling is sometimes different from cases where the users 
do not interfere with each other. In particular, the optimum 
signaling will sometimes put all power into a single transmitting 
antenna, rather than divide power equally between the different 
antennas.   We show that either the optimum interference-free 
approach, which puts equal power into each antenna, or the 
approach that puts all power into a single antenna are optimum for
the majority of signal and interference powers and we show how to 
find the regions where each approach is best."
}

@INPROCEEDINGS{Blum0305:Properties,
AUTHOR="Rick Blum and Mu Qin",
TITLE="Properties of Space-Time Codes for Frequency Selective Channels and Trellis
Code Designs",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper derives some properties of the diversity gain and the
coding gain of space-time codes (STCs) for frequency selective
channels. It is shown that additional diversity order can be
obtained by STCs when they are employed in frequency selective
channels rather than in flat fading channels. It is demonstrated
that spatial dependence, correlated taps and non-uniform power
delay profile will cause coding gain penalty. The optimum codes
designed for spatial independence with uncorrelated taps and
uniform power distribution are shown to be the optimum codes for
the other channel scenarios with the same number of taps. A
systematic design procedure is applied to search for the best
space-time trellis code (STTC) for frequency selective channels.
At an FER of 0.01, our example 16-state BPSK STTC outperforms the
delay diversity code by 4.7dB for a channel with 3 uncorrelated
uniform taps. It is demonstrated that a STC designed for a channel
with the maximum expected memory, will guarantee good performance
if a channel with less memory is encountered."
}

@ARTICLE{Bobb0309:Acyclic,
AUTHOR="A. Bobbio and Andras Horvath and Marco Scarpa and M. Telek",
TITLE="Acyclic discrete phase type distributions: properties and a parameter
estimation algorithm",
JOURNAL="Performance Evaluation",
VOLUME=54,
NUMBER=1,
PAGES="1-32",
MONTH=sep,
YEAR=2003,
REFERENCES=18,
KEYWORDS="Continuous and discrete phase type distributions; Acyclic discrete phase
type distributions; Canonical forms",
ABSTRACT="This paper provides a detailed study on discrete phase type (DPH)
distributions and its acyclic subclass referred to as acyclic-DPH (ADPH).
Previously not considered similarities and differences between DPH and
continuous phase type (CPH) distributions are investigated and minimal
representations, called canonical forms, for the subclass of ADPH
distributions are provided. We investigate the consequences of the recent
result about the minimal coefficient of variation of the DPH class [The
minimal coefficient of variation of discrete phase type distributions, in:
Proceedings of the Third International Conference on Matrix-analytic
Methods in Stochastic Models, July 2000] and show that below a given order
(that is a function of the expected value) the minimal coefficient of
variation of the DPH class is always less than the minimal coefficient of
variation of the CPH class. Since all the previously introduced Phase Type
fitting methods were designed for fitting over the CPH class we provide a
DPH fitting method for the first time. The implementation of the DPH
fitting algorithm is found to be simple and stable. The algorithm is
tested over a benchmark consisting of 10 different continuous
distributions. The error resulted when a continuous distribution sampled
in discrete points is fitted by a DPH is also considered.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-487DRF2-1-GS\&\_cdi=5663\&\_orig=browse\&\_coverDate=09\%2F30\%2F2003\&\_sk=999459998\&view=c\&wchp=dGLbVlz-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=272c46f023a70588c10085bee3dece4e\&ie=f.pdf"
}

@INPROCEEDINGS{Boch0305:Effective,
AUTHOR="Holger Boche and Martin Schubert",
TITLE="Effective Bandwidth Maximization for Uplink/Downlink Multi-Antenna Systems",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We study optimization criteria for uplink and downlink transmission
  in a cellular wireless system, assuming that the base station is
  equipped with multiple antennas and the mobiles have single
  antennas.  In particular, we focus on the mean effective bandwidth,
  which provides a performance measure for the overall quality of all
  users. In the downlink, maximizing the mean effective bandwidth is
  shown to be a convex optimization problem, which can be solved by
  standard optimization tools. A closed-form solution is given for the
  2-user case.  The downlink problem has a more complicated analytical
  structure.  In order to find a solution we show that the same
  effective bandwidth can be achieved in uplink and downlink for a
  given transmission power.  Hence, we can find the global optimum of
  the downlink problem by solving the convex uplink problem instead."
}

@INPROCEEDINGS{Boel0305:Space,
AUTHOR="Helmut Boelcskei and Moritz Borgmann and Arogyaswami Paulraj",
TITLE="Space-frequency coded {MIMO-OFDM} with variable multiplexing-diversity
tradeoff",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Space-frequency coded Orthogonal Frequency Division Multiplexing (OFDM)
is capable of realizing both spatial and frequency-diversity gains in
multipath multiple-input multiple-output (MIMO) fading channels.
This naturally leads to the question 
of variable allocation of the channel's degrees of freedom in
space and frequency to multiplexing and diversity 
transmission modes.
In this paper, we provide a systematic method for the design of
space-frequency codes which realize
prescribed multiplexing-diversity tradeoffs. Simulation results illustrate
the performance of the
proposed codes."
}

@INPROCEEDINGS{Boha0303:Stochastic,
AUTHOR="Stephan Bohacek",
TITLE="A Stochastic Model of {TCP} and Fair Video Transmission",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="A stochastic model of TCP is developed. This model accounts for variations
in latency and loss probability. The latency is modeled as a
one-dimensional diffusion process with the loss probability depending on
the state of the latency model. The model is validated with ns-2
simulations. New insights provided by the model include the effect of the
rate of change of the latency on the performance of TCP. Specifically,
this model predicts the well-known TCP-friendly formula only if the
round-trip time rapidly varies. However, if the round-trip time does not
vary quickly, then, according to this model, the TCP-friendly formula may
not hold. Both rapidly and slowly varying round-trip times have been
observed in real networks. As an application of the model, the question as
to when a video can be fairly transmitted is addressed. If it is possible
to transmit the video, the model yields the size of the receiving buffer
required to avoid underflow."
}

@INPROCEEDINGS{Boko0305:Reduced,
AUTHOR="Dhammika Bokolamulla",
TITLE="Reduced Complexity Iterative Decoding for Concatenated Coding Schemes",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="A new algorithm to reduce the computational complexity of iterative 
decoding is presented. The algorithm reduces the complexity by removing 
certain branches from the corresponding trellis diagram. A threshold on
a priori values is used as the elimination criterion. To asses the 
performance, numerical results for serially concatenated convolutional
codes transmitted over an additive white gaussian noise channel is 
presented. The results show that for the system considered, the 
algorithm can reduce the complexity by one third with a negligible 
degradation in error performance."
}

@INPROCEEDINGS{Borr0305:Channel,
AUTHOR="Mohammad Borran and Prabodh Varshney and Hannu Vilpponen and Panayiotis
Papadimitriou",
TITLE="Channel Estimation and Signal Detection for Multi-Carrier {CDMA} Systems
with Pulse-Shaping Filter",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We consider the problem of digital communication in a fading environment
using the Multi-Carrier CDMA technology.  By incorporating the effect of
the pulse-shaping filter in the channel estimation and signal detection
modules, we develop new estimator and detector structures which
significantly outperform the commonly used time-domain equalizers and
matched filter detector.  Our simulation results demonstrate the
elimination of some of the error floors which one would experience if
usual time-domain techniques were used to cancel the effect of non-ideal
pulse-shaping filter."
}

@INPROCEEDINGS{Bors0303:User,
AUTHOR="Sem Borst",
TITLE="User-Level Performance of Channel-Aware Scheduling Algorithms in Wireless
Data Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Channel-aware scheduling strategies, such as the Proportional Fair
algorithm for CDMA 1xEV-DO, provide an effective mechanism for
improving throughput performance in wireless data networks by
exploiting channel fluctuations.
The performance of channel-aware scheduling algorithms has mostly
been explored at the packet level for a static user population,
often assuming infinite backlogs.
In the present paper, we focus on the performance at the flow level
in a dynamic setting with random finite-size service demands.
We show that in certain cases the user-level performance may be
evaluated by means of a multi-class Processor-Sharing model where
the total service rate varies with the total number of users.
The latter model provides explicit formulas for the distribution of
the number of active users of the various classes, the mean
response times, the blocking probabilities, and the mean throughput.
In addition we show that, in the presence of channel variations,
greedy, myopic strategies which maximize throughput in a static
scenario, may result in sub-optimal throughput performance for
a dynamic user configuration and cause potential instability effects."
}

@ARTICLE{Bors0310:Generalized,
AUTHOR="Sem Borst and Michel Mandjes and Miranda {van Uitert}",
TITLE="Generalized Processor Sharing With Light-Tailed and Heavy-Tailed Input",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=5,
PAGES="821-834",
MONTH=oct,
YEAR=2003,
REFERENCES=35,
KEYWORDS="generalized processor sharing (GPS); heavy-tailed traffic; large
deviations; light-tailed traffic; Markov fluid; regular variation;
weighted fair queueing; workload asymptotics",
ABSTRACT="We consider a queue fed by a mixture of light-tailed and heavy-tailed
traffic. The two traffic flows are served in accordance with the
generalized processor sharing (GPS) discipline. GPS-based scheduling
algorithms, such as weighted fair queueing, have emerged as an important
mechanism for achieving service differentiation in integrated networks. We
derive the asymptotic workload behavior of the light-tailed traffic flow
under the assumption that its GPS weight is larger than its traffic
intensity. The GPS mechanism ensures that the workload is bounded above by
that in an isolated system with the light-tailed flow served in isolation
at a constant rate equal to its GPS weight. We show that the workload
distribution is in fact asymptotically equivalent to that in the isolated
system, multiplied with a certain pre-factor, which accounts for the
interaction with the heavy-tailed flow. Specifically, the pre-factor
represents the probability that the heavy-tailed flow is backlogged long
enough for the light-tailed flow to reach overflow. The results provide
crucial qualitative insight in the typical overflow scenario.",
URL="http://ieeexplore.ieee.org/iel5/90/27747/01237459.pdf?isNumber=27747\&prod=JNL\&arnumber=1237459\&arSt=+821\&ared=+834\&arAuthor=Borst\%2C+S.\%3B+Mandjes\%2C+M.\%3B+van+Uitert\%2C+M."
}

@ARTICLE{Bors0310:Impact,
AUTHOR="S. Borst and O. Boxma and R. {Núñez-Queija} and A. Zwart",
TITLE="The impact of the service discipline on delay asymptotics",
JOURNAL="Performance Evaluation",
VOLUME=54,
NUMBER=2,
PAGES="175-206",
MONTH=oct,
YEAR=2003,
REFERENCES=63,
KEYWORDS="M/G/1; Service discipline; Delay asymptotics; Regular variation",
ABSTRACT="This paper surveys the M/G/1 queue with regularly varying service
requirement distribution. It studies the effect of the service discipline
on the tail behavior of the waiting-time and/or sojourn-time distribution,
demonstrating that different disciplines lead to quite different tail
behavior. The orientation of the paper is methodological: We outline four
different methods for determining tail behavior, illustrating them for
service disciplines like FCFS, Processor Sharing and LCFS.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-491RT6R-1-J6\&\_cdi=5663\&\_orig=browse\&\_coverDate=10\%2F31\%2F2003\&\_sk=999459997\&view=c\&wchp=dGLbVzz-zSkWW\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=78cd2e0fe59ff6fe0b86775185ac422c\&ie=f.pdf"
}

@INPROCEEDINGS{Boub0305:Ultra,
AUTHOR="Nejib Boubaker and Khaled Letaief",
TITLE="Ultra Wideband {DSSS} for Multiple Access Communications Using Antipodal
Signaling",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Ultra wideband (UWB) technology is characterized by transmitting extremely 
short duration radio impulses.
To improve its multiple access (MA) capability, UWB technology can be
combined 
with traditional spread spectrum techniques. 
So far, much of the research has focused on employing time hopping spread
spectrum with 
impulse radio using pulse position modulated (PPM) signals. 
In this paper, we outline the attractive features of direct sequence (DS)
ultra wideband  
multiple access systems employing antipodal signaling and compare it with
time hopping (TH). 
An appropriate DS-UWB transmitter and receiver are designed, 
and the system signal processing formulation is investigated. 
Performance of such communication systems in terms of multiple access
capability, 
error rate performance, and achievable transmission rate are evaluated. 
Upper bounds on both the maximum number of users supported by the system 
and the total combined bit transmission rate are discussed."
}

@ARTICLE{Bouc0302:Arrival,
AUTHOR="Richard Boucherie and XiuLi Chao and Masakiyo Miyazawa",
TITLE="Arrival first queueing networks with applications in kanban production
systems",
JOURNAL="Performance Evaluation",
VOLUME=51,
NUMBER="2-4",
PAGES="83-102",
MONTH=feb,
YEAR=2003,
REFERENCES=19,
KEYWORDS="Arrival first networks; Arrival rules; Kanban; Partial balance; Product
form solutions; Pull system",
ABSTRACT="In this paper, we introduce a new class of queueing networks called arrival
first networks. We characterise its transition rates and derive the
relationship between arrival rules, linear partial balance equations, and
product form stationary distributions. This model is motivated by
production systems operating under a kanban protocol. In contrast with the
conventional departure first networks, where a transition is initiated by
service completion of items at the originating nodes that are subsequently
routed to the destination nodes (push system), in an arrival first network
a transition is initiated by the destination nodes of the items and
subsequently those items are processed at and removed from the originating
nodes (pull system). These are similar to the push and pull systems in
manufacturing systems.

Our characterisation provides necessary and sufficient conditions for the
network to possess linear traffic equations, and sufficient conditions for
the network to have a product form stationary distribution. We apply our
results to networks operating under a kanban mechanism and characterise
the rate at which items are pulled as well as the routing and blocking
protocols that give rise to a product form stationary distribution.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-46VJSK5-1-9J\&\_cdi=5663\&\_orig=browse\&\_coverDate=02\%2F28\%2F2003\&\_sk=999489997\&view=c\&wchp=dGLbVzz-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=077cb13524462b7f5de0dcc2fee620f3\&ie=f.pdf"
}

@ARTICLE{Boud0309:Optical,
AUTHOR="Noureddine Boudriga",
TITLE="Optical burst switching protocols for supporting QoS and adaptive routing",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=15,
PAGES="1804-1812",
MONTH=sep,
YEAR=2003,
REFERENCES=12,
KEYWORDS="Optical networks; Optical burst switching; Optical packet switching;
Adaptive routing",
ABSTRACT="In this paper, we present a scheme for dynamic resource management using
traffic descriptors. A priority multi-class scheme to support QoS on an
optical network is defined. Unlike existing mechanisms that depend on
buffers management and scheduling algorithms, our mechanism does not
require any electronic buffering in the intermediate optical network
nodes, which is greatly desired. The proposed scheme assigns different
delay times to service classes in order to isolate higher priority from
lower priority classes. We also develop a traffic model and an allocation
wavelength model, and analyze the blocking probability of each class.
Finally, we present a view of our scheme that allows the integration of
optical packet switching to the optical burst switching.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47YXW9F-5-5V\&\_cdi=5624\&\_orig=browse\&\_coverDate=09\%2F22\%2F2003\&\_sk=999739984\&view=c\&wchp=dGLbVtb-zSkzS\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=a81263ede56ac4f4d909fe865405aefe\&ie=f.pdf"
}

@ARTICLE{Boud0310:Packet,
AUTHOR="Jean-Yves Boudec and anna charny",
TITLE="Packet Scale Rate Guarantee for Non-FIFO Nodes",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=5,
PAGES="810-820",
MONTH=oct,
YEAR=2003,
REFERENCES=19,
KEYWORDS="differentiated services; expedited forwarding; min-max; network calculus",
ABSTRACT="Packet scale rate guarantee (PSRG) is a generic node model which underlies
the definition of expedited forwarding (EF) proposed in the context of
Internet differentiated services. For the case of first-in-first-out
(FIFO) nodes, PSRG is equivalent to the well-understood concept of
adaptive service curve. However, in practice, many devices do not
necessarily preserve the FIFO property, and therefore, known FIFO results
do not hold. This paper analyzes the properties of PSRG in the absence of
FIFO assumption. Our analysis is based on a novel characterization of PSRG
which avoids the use of virtual finish times and is obtained by min-max
algebra. We use it to show that delay bounds previously obtained for the
FIFO case are still valid; in contrast, we find that this is not true for
the characterization of the concatenation of two nodes.",
URL="http://ieeexplore.ieee.org/iel5/90/27747/01237458.pdf?isNumber=27747\&prod=JNL\&arnumber=1237458\&arSt=+810\&ared=+820\&arAuthor=Le+Boudec\%2C+J.-Y.\%3B+Charny\%2C+A."
}

@INPROCEEDINGS{Boui03:Local,
AUTHOR="Eric Bouillet and Jean-Francois Labourdette and Georgios Ellinas and Ramu
Ramamurthy and Sid Chaudhuri",
TITLE="Local Optimization of Shared Backup Channels in Optical Mesh Networks",
BOOKTITLE="Optical Fiber Communications (OFC)",
MONTH=mar,
YEAR=2003,
KEYWORDS="shared protection",
ABSTRACT="This paper illustrates the complexity of assigning backup-channels in
shared-mesh-protected optical networks. We propose a distributed recurring
method to solve this problem, and show that substantial savings are
achievable.",
URL="http://www-ee.engr.ccny.cuny.edu/www/web/ellinas/localChannelReoptimizationOFC03.pdf"
}

@ARTICLE{Boun0309:Ipv6,
AUTHOR="Jim Bound",
TITLE="IPv6 Behind the Wall",
JOURNAL="Internet Protocol Journal",
VOLUME=6,
NUMBER=3,
MONTH=sep,
YEAR=2003,
REFERENCES=3,
ABSTRACT={IPv6 has technology advantages over IPv4, and most of them will not be seen
by the end user any more than users see features added to other extensions
to the Internet Protocol suite, sensors on their automobiles, or from any
core technology evolution. This article focuses on three of those IPv6
technology advantages {"}Behind the Wall.{"}

An essential catalyst for the Next-Generation Internet is the Internet
Protocol Version 6 (IPv6), which will provide an evolution to a more
pervasive use of the Internet and networking in general. The current
Internet, using IPv4, is insufficient to support the business and
operational preconditions for peer-to-peer applications and security,
billions of mobile devices, sensor networks, and the requisite distributed
computing infrastructure to support a mobile society. The {"}band aids{"}
applied to permit the current Internet to keep it operating has created
additional operational costs and reduced operational capabilities for
users and networks.

This article is an IPv6 Forum (www.ipv6forum.com) statement of the
technology advantages of IPv6.},
URL="http://www.cisco.com/warp/public/759/ipj\_6-3/ipj\_6-3\_ipv6.html"
}

@INPROCEEDINGS{Bout0303:Adaptive,
AUTHOR="Catherine Boutremans and Jean-Yves {Le Boudec}",
TITLE="Adaptive joint playout buffer and {FEC} adjustement for Internet Telephony",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We develop a joint playout buffer and Forward Error Correction
(FEC) adjustment scheme for Internet Telephony that incorporates
the impact of end-to-end delay on the perceived audio quality. We
show that it provides a better quality than the adjustment
schemes for playout buffer and FEC that were previously
published. This is important because of a threshold effect in
end-to-end delay of interactive audio around 150 ms. We represent
the perceived audio quality as a function of both the end-to-end
delay and the distortion of the voice signal.  We develop a joint
rate/error/playout delay control algorithm which optimizes this
measure of quality and is TCP-Friendly.  It uses a channel model
for both loss and delay.  We validate our approach by simulation
and show that (1) our scheme allows a source to increase its
utility by avoiding to increase the playout delay when it is not
really necessary, (2) it performs better than direct combinations
of existing algorithms in the cases where end-to-end delay is
important and (3) adaptive delay aware FEC adjustment brings
significant improvements only if it is coupled with adaptive
playout adjustment."
}

@INPROCEEDINGS{Bout0304:Adaptive,
AUTHOR="Catherine Boutremans and Jean-Yves Boudec",
TITLE="Adaptive Joint Playout Buffer and {{FEC}} Adjustment for {Internet}
Telephony",
BOOKTITLE="IEEE Infocom 2003",
MONTH=apr,
YEAR=2003,
ABSTRACT="We develop a joint playout buffer and Forward
Error Correction (FEC) adjustment scheme for Internet Telephony,
which incorporates the impact of end-to-end delay on
the perceived audio quality. We show that it provides better
quality than the adjustment schemes for playout buffer and FEC
that were previously published. This is important because of a
threshold effect when the end-to-end delay of interactive audio
is around 150 ms. We represent the perceived audio quality
as a function of both the end-to-end delay and the distortion
of the voice signal. We develop a joint rate/error/playout delay
control algorithm that optimizes this measure of quality and is
TCP-Friendly. It uses a channel model for both loss and delay.
We validate our approach by simulation and show that (1) our
scheme allows a source to increase its utility by avoiding an
increase of the playout delay when it is not really necessary, (2)
it performs better than direct combinations of existing algorithms
in the cases where end-to-end delay is important and (3) adaptive
delay aware FEC adjustment brings significant improvements
only if it is coupled with an adaptive playout adjustment.",
URL="http://lcawww.epfl.ch/Publications/Boutremans/BoutremansL03.pdf"
}

@ARTICLE{Boxm0308:Delay,
AUTHOR="Onno Boxma and Dee Denteneer and Jacques Resing",
TITLE="Delay models for contention trees in closed populations",
JOURNAL="Performance Evaluation",
VOLUME=53,
NUMBER="3-4",
PAGES="169-185",
MONTH=aug,
YEAR=2003,
REFERENCES=23,
KEYWORDS="Machine repair model; Contention tree; Request-grant mechanism; Cable
networks",
ABSTRACT="In this paper we consider some models for contention resolution in cable
networks, in case the contention pertains to requests from a finite
population of stations and is carried out by means of contention trees.
More specifically, we study a number of variants of the standard machine
repair model, that differ in the service order at the repair facility.
Considered service orders are first come first served, random order of
service, and gated random order of service. For these variants, we study
the sojourn time at the repair facility. In the case of the free access
protocol for contention trees, the first two moments of the access delay
in contention are accurately represented by those of the sojourn time at
the repair facility under random order of service. In the case of the
blocked access protocol, gated random order of service is shown to be more
appropriate.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-48R7D51-1-69\&\_cdi=5663\&\_orig=browse\&\_coverDate=08\%2F31\%2F2003\&\_sk=999469996\&view=c\&wchp=dGLbVtz-zSkWW\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=46881164894301786e72f1225b5c9caf\&ie=f.pdf"
}

@INPROCEEDINGS{Boye0303:Heavy,
AUTHOR="Jacqueline Boyer and Fabrice Guillemin and Philippe Robert and Bert Zwart",
TITLE="Heavy tailed {M/G/1-PS} queues with impatience and admission control in
packet networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="In this  paper we analyze the  $M/G/1$ processor sharing queue  with heavy
tailed
services  and with  impatient  customers.  It is assumed that impatience
depends on the
value of the service required. We  prove  that a  reduced  service rate 
(RSR)
approximation holds for estimating the sojourn time  of a customer in the
system, when the
queue capacity is finite or infinite.  This allows us to evaluate the
reneging probability
of customers with very  large service times. We then use these  results to
investigate the
impact  of admission control  on a  link of  a packet  network.  Admission
 control simply
consists of limiting the number of simultaneous connections.  It turns out
that there is a
real benefit for  the efficiency of the system to perform  admission
control.  It globally
increases the fraction  of customers, who complete their  service (i.e.
without being
impatient). Finally, we investigate the fairness of the system and propose
a criterion to
assess the capacity of the system so as to allow the completion of very
large service
times."
}

@ARTICLE{Bran0305:Model,
AUTHOR="Alexandre Brandwajn",
TITLE="A model of periodic acknowledgement",
JOURNAL="Performance Evaluation",
VOLUME=52,
NUMBER=4,
PAGES="221-235",
MONTH=may,
YEAR=2003,
REFERENCES=31,
KEYWORDS="Performance evaluation; Fork/join queuing networks; Finite buffers;
Computer networks; Multicast protocols",
ABSTRACT="We study a problem abstracted from modeling a multicast protocol. In our
model, messages generated by a single source are simultaneously forwarded
to a set of receivers where they are independently processed. We assume a
state-dependent message arrival rate and memoryless service time
distributions. The receivers may process messages at different average
rates. Messages processed by all receivers are periodically acknowledged
and cleared from the system. Due to finite buffer space, the total number
of non-acknowledged messages in the system is limited. Our focus in this
paper is on the number of messages cleared at acknowledgement time.

The problem under consideration bears resemblance to a fork/join process
with heterogeneous servers, used in the study of multiprocessing computer
systems. Our model includes the additional features of finite buffer space
and delayed periodic departure of completed jobs. Even without these
features, the resulting type of queuing model has no known closed-form
solution in the general case of more than two servers. Because the arrival
processes to the servers are correlated, the model is difficult to
decompose. We propose a relatively simple decomposition technique and a
fixed-point iteration scheme. In our approach, we consider each receiver
(server) in isolation, and we account for the influence of other receivers
through the probability that a given number of messages can be cleared at
acknowledgement time. We derive elementary differential equations for the
number of messages processed by a receiver. These equations involve the
conditional probability of the number of messages not yet processed given
the number of messages waiting to be cleared. We compute an approximate
solution using the conditional probability obtained from a model with
exponentially distributed acknowledgement periods. Our numerical results
for the average number of messages cleared at acknowledgment time are
typically within a few percent of simulation midpoints.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-47MJ3M7-2-30\&\_cdi=5663\&\_orig=browse\&\_coverDate=05\%2F31\%2F2003\&\_sk=999479995\&view=c\&wchp=dGLbVlz-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=66882d3eb223d13f237ca12c72fb0b7e\&ie=f.pdf"
}

@INPROCEEDINGS{Breg0305:Deflection,
AUTHOR="Stefano Bregni and Michele Baresi and Achille Pattavina and Gianluca
Vegetti",
TITLE="Deflection Routing Effectiveness in Full-Optical {IP} Packet Switching
Networks",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This work is based on the optical switch architecture proposed in [5][6] to
handle variable-length packets such as IP datagrams. This optical switch is
based on an AWG device to route packets and is equipped with a fiber
delay-line stage as optical input buffer. Unfortunately, this switch would
require considerable buffering capability to achieve acceptable
performance. A possible solution, studied in this paper, is to implement
efficient packet deflection inside the optical network as a mean for
solving packet contentions on outputs of optical switches. Thus, optical
transport networks have been simulated to assess deflection effectiveness,
based on a traffic model adherent to real IP traffic measurements.
Full-mesh and wheel network topolo-gies have been considered, comparing
results to assess deflection effectiveness."
}

@INPROCEEDINGS{Brem0303:Improved,
AUTHOR="Anat Bremler-Barr and Yehuda Afek and Shemer Schwarz",
TITLE="Improved {BGP} Convergence via Ghost Flushing",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="In \cite{policy,conv} it was noticed that sometimes it takes BGP a
substantial amount of time and messages to converge and stabilize
following the failure of some node in the Internet.  In this paper
we suggest a minor modification to BGP that eliminates the problem
pointed out and substantially reduces the convergence time and
communication complexity of BGP.  Roughly speaking, our
modification ensures that bad news (the failure of a node/edge)
propagate fast, while good news (the establishment of a new
path to a destination) propagate somewhat slower.  This is
achieved in BGP by allowing withdrawal messages to propagate with
no delay as fast as the network forwards them, while announcements
propagate as they do in BGP with a delay at each node of one
$minRouteAdver$ (except for the first wave of announcements)."
}

@INPROCEEDINGS{Bren0312:Tuning,
AUTHOR="Paul Brenner and Trevor Cickovski",
TITLE="Tuning FreeBSD for Web Server Performance",
BOOKTITLE="University of Notre Dame CSE542",
MONTH=dec,
YEAR=2003,
ABSTRACT="This research investigates FreeBSD operating system parameter modifications
that provide for enhanced web server performance. Data throughput is used
as the predominant measure of web server performance. Three primary OS
parameter modifications are discussed and implemented with subsequent
experimental benchmark tests. The effects of the parameter modifications
are reviewed and the controlling influence of the model provider/client
relationship demonstrated."
}

@INPROCEEDINGS{Bres0303:Optimal,
AUTHOR="Thomas Bressoud and Rajeev Rastogi and Mark Smith",
TITLE="Optimal Configuration for {BGP} Route Selection",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="An Internet Service Provider must provide transit service for traffic
between its customers and its providers and, at the same time,
attempt to minimize network utilization and balance traffic according
to the capacities of its border routers.  Central to the selection of
border routers for transit traffic flows is the Border Gateway
Protocol (BGP) between Autonomous Systems peers, through which route
advertisements for network prefixes determine the selection of border
routers for each traffic flow.

This paper examines the problem of determining an optimal set of border
routers for the advertisement of network prefixes so as to minimize the
cost of traffic across a transit service provider's network while
maintaining egress bandwidth constraints at the border routers.  Egress
bandwidth constraints are considered because there is anecdotal evidence
to suggest that the peering links between ASes are often bottleneck
links in the Internet, and so the optimal utilization of these links is
also
critical.  After precisely formulating the optimization
problem in accordance with 
the operation of BGP,  we relate the problem to the
{\it Generalized Assignment Problem} and develop heuristic solutions 
for solving it.  Simulation results from 
an implementation show up to a 37\\% improvement
in the utilization of the peering links when compared to hot potato
routing."
}

@ARTICLE{Bris0303:Market,
AUTHOR="Bob Briscoe and Vasilios Darlagiannis and Oliver Heckman and Huw Oliver and
Vasilios Siris and David Songhurst and Burkhard Stiller",
TITLE="A market managed multi-service Internet {(M3I)}",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=4,
PAGES="404-414",
MONTH=mar,
YEAR=2003,
REFERENCES=30,
KEYWORDS="Data communication; Networks; Internet; Quality of service; Congestion
control; Charging; Pricing; Policy; Accounting; Admission control;
Architecture",
ABSTRACT="In this paper, we describe our approach to managing quality of service
(QoS) using pricing. We show how it is possible to synthesise network QoS
in the end-systems along the lines of the end to end design principle, as
one of many possible business models. We have: (i) developed an
architecture for market management; (ii) invented new business models to
test and demonstrate its flexibility; (iii) implemented generic mechanisms
that not only enable these models but also many others; (iv) modelled
selected features of the resulting systems and markets and (v) conducted
experiments on users to assess acceptability and the feasibility of the
overall approach. Each of these aspects is outlined in brief overview,
with numerous references to more detailed work.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47JD1WJ-1-F\&\_cdi=5624\&\_orig=browse\&\_coverDate=03\%2F01\%2F2003\&\_sk=999739995\&view=c\&wchp=dGLbVzb-zSkWW\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=320f7759f4ce2467043b851c5a3843f9\&ie=f.pdf"
}

@TECHREPORT{Brod0302:Data,
AUTHOR="Andrej Brodnik and Andreas Nilsson",
TITLE="Data Structure for a Time-Based Bandwidth Reservations Problem",
TYPE="arXiv report",
INSTITUTION="arXiv",
MONTH=feb,
YEAR=2003,
KEYWORDS="Data Structures and Algorithms; Networking and Internet",
ABSTRACT="We discuss a problem of handling resource reservations. The resource can be
reserved for some time, it can be freed or it can be queried what is the
largest amount of reserved resource during a time interval. We show that
the
problem has a lower bound of $\\Omega(\\log n)$ per operation on average
and we
give a matching upper bound algorithm. Our solution also solves a dynamic
version of the related problems of a prefix sum and a partial sum.",
URL="http://arXiv.org/abs/cs/0302009"
}

@INPROCEEDINGS{Broe0303:Novel,
AUTHOR="Mark {Van den Broek} and Ivo {J.B.F. Adan} and Saishankar Nandagopalan and
Sem Borst",
TITLE="A Novel Mechanism for Contention Resolution in {HFC} Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="The Medium Access Control (MAC) scheme proposed by DAVIC/DVB, IEEE
802.14 and DOCSIS for the upstream channel of Hybrid Fiber Coaxial
(HFC) access networks is based on a mixable
contention-based/contention-less time slot assignment.
Contention-less slots are assigned by the head end to end stations
according to a reservation scheme.
Contention-based slots are randomly accessed by active terminals
without any preliminary allocation, so that collisions may occur.
To resolve contention, the contention tree algorithm has been
widely accepted by the DVB/DAVIC, IEEE 802.14 and DOCSIS standards
for MAC because of higher throughput and lower access delay.
In this paper we propose a novel contention resolution mechanism
and compare its performance with that of existing procedures.
The proposed procedure is termed as static arrival slot mechanism.
In this mechanism, one slot in each frame is exclusively reserved
for new arrivals that wish to access the channel using contention
resolution, and at least one slot is reserved for resolving their
contention if there was one in the arrival slot.
The performance of the proposed mechanism is evaluated through
analysis and simulation.
The results show that the proposed mechanism outperforms
existing contention resolution procedures under heavy traffic."
}

@INPROCEEDINGS{Budd0303:Integration,
AUTHOR="Milind Buddhikot and Girish Chandranmenon and Seung-Jae Han and Yui-Wah Lee
and Scott Miller and Luca Salgarelli",
TITLE="Integration of {802.11} and Third-Generation Wireless Data Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="The third-generation (3G) wide area wireless networks and 802.11 local area
wireless networks possess complementary characteristics. 3G networks
promise to offer always-on, ubiquitous connectivity with relatively low
data rates. 802.11 offers much higher data rates, comparable to wired
networks, but can cover only smaller areas, suitable for hot-spot
applications in hotels and airports.  The performance and flexibility of
wireless data services would be dramatically improved if users could
seamlessly roam across the two networks.  In this paper, we address the
problem of integration of these two classes of networks to offer such
seamless connectivity.  Specifically, we describe two possible integration
approaches - namely tight integration and loose integration and advocate
the latter as the preferred approach.  Our realization of the loose
integration approach consists of two components: a new network element
called IOTA gateway deployed in 802.11 networks, and a new client
software. The IOTA gateway is composed of several software modules, and
with co-operation from the client software offers integrated 802.11/3G
wireless data services that support seamless inter-technology mobility,
Quality of Service (QoS) guarantees and multi-provider roaming agreements.
 We describe the design and implementation of the IOTA gateway and the
client software in detail and present experimental performance results
that validate our architectural approach."
}

@ARTICLE{Burn0304:Path,
AUTHOR="James Burns and Teunis Ott and Anthony Krzesinski and Karen {Müller}",
TITLE="Path selection and bandwidth allocation in {MPLS} networks",
JOURNAL="Performance Evaluation",
VOLUME=52,
NUMBER="2-3",
PAGES="133-152",
MONTH=apr,
YEAR=2003,
REFERENCES=13,
KEYWORDS="protocol; Label switched path; Multi-protocol label switching; Quality of
service",
ABSTRACT="Multi-protocol label switching extends the IP destination-based routing
protocols to provide new and scalable routing capabilities in
connectionless networks using relatively simple packet forwarding
mechanisms. MPLS networks carry traffic on virtual connections called
label switched paths. This paper considers path selection and bandwidth
allocation in MPLS networks in order to optimize the network quality of
service. The optimization is based upon the minimization of a non-linear
objective function which under light load simplifies to OSPF routing with
link metrics equal to the link propagation delays. The behavior under
heavy load depends on the choice of certain parameters. It can essentially
be made to minimize maximal expected utilization, or to maximize minimal
expected weighted slacks (both over all links). Under certain
circumstances it can be made to minimize the probability that a link has
an instantaneous offered load larger than its transmission capacity. We
present a model of an MPLS network and an algorithm which optimally
distributes the traffic among a set of active paths and reserves a set of
back-up paths for carrying the traffic of failed or congested paths. The
algorithm is an improvement of the well-known flow deviation non-linear
programming method. The algorithm is applied to compute optimal LSPs for a
100-node network carrying a single traffic class. A link carrying some 1400
routes fails. The back-up paths are activated and we compare the
performance of the path sets before and after the back-up paths are
deployed.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-47K337C-2-7F\&\_cdi=5663\&\_orig=browse\&\_coverDate=04\%2F30\%2F2003\&\_sk=999479997\&view=c\&wchp=dGLbVlz-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=0884d77b83a9b3393bbc7974a5cf9f0a\&ie=f.pdf"
}

@INPROCEEDINGS{Bush0303:Integrity,
AUTHOR="Randy Bush and Timothy Griffin",
TITLE="Integrity for Virtual Private Routed Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="The term Virtual Private Network (VPN) encompasses a wide array of diverse
technologies 
and network architectures. 
All VPNs should provide users with the isolation and security associated
with private networks, 
but at lower costs made possible by implementing these networks over some
type of shared infrastructure. 
One type of VPN attracting Internet Service Providers
is defined in RFC 2547, whose acronym encrusted title ``BGP/MPLS VPNs'' 
highlights the routing (BGP) and tunneling (MPLS) 
technology currently implementing this particular flavor of VPN. 
We believe that the distinguishing feature of RFC 2547 VPNs is 
that they allow customers to outsource their internal routing to Internet
Service Providers. 
For this reason we refer to this class of VPNs as Virtual Private Routed
Networks (VPRNs). 

We present the first formal analysis of RFC2547-like VPRNs. 
In particular, we focus on {\em integrity constraints} that 
must be maintained in order to ensure that 
(a) address space overlap between VPRNs does not cause forwarding
ambiguity, 
(b) that intra-VPRN connectivity is achieved, and 
(c) that there is no connectivity between disjoint VPRNs. 
We show that in order to fulfill the general VPRN model of 
RFC 2547, both the forwarding and routing models need 
to be modified, since VPRN integrity can currently be guaranteed 
only for a very limited class of VPRNs."
}

@INPROCEEDINGS{Buzz0305:Blind,
AUTHOR="Stefano Buzzi and Marco Lops and Luca Venturino",
TITLE="Blind multiantenna receivers for dispersive {DS/CDMA} channels with no
channel-state information",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The problem of blind multiuser detection for a DS/CDMA system employing
multiple transmit and receive antennae over a fading, dispersive channel
is considered. Relying upon a well known signal representation, which is
here adapted to account for MIMO channels, we first develop a new family
of linear receivers: all of them share the key property of substantial
immunity to co-channel interference, no matter its strength,
while not requiring any prior knowledge on the signals to be decoded,
except for the spreading sequence. The performance assessment, conducted
through semianalytical methods - whenever possible - and validated through
MonteCarlo counting techniques show that the newly proposed receivers are
pretty close to their non-blind counterparts, i.e those relying on prior
knowledge of the spreading codes, symbol timings and channel impulse
responses for all of the active users."
}

@INPROCEEDINGS{Cagl0305:Traffic,
AUTHOR="Richard Cagley and John Shynk and Richard Gooch",
TITLE="Traffic Channel Amplitude Estimation with Rate Determination for the
{IS-95} Downlink",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we discuss amplitude estimation algorithms for the Walsh
traffic channels in the downlink of Interim Standard 95 (IS-95).  This
parameter estimate is designed to improve the performance of the
successive interference canceler (SIC) by providing greater reconstruction
accuracy.  The primary feature of the IS-95 downlink that makes amplitude
estimation difficult is that during lowered voice activity levels, bit
repetition occurs with a corresponding drop in the symbol energy for that
frame of data. Therefore, unlike other systems, the amplitude level cannot
be assumed to remain constant and should be taken into account during
signal reconstruction in the SIC.  We explore various algorithms for
estimating the nominal Walsh traffic channel amplitude level.  The
distinguishing characteristic of the different techniques is the type of a
priori knowledge employed for the estimation.  For example, one parameter
that may need to be estimated is the bit repetition multiple using a rate
determination algorithm."
}

@INPROCEEDINGS{Cai0305:Congestion,
AUTHOR="Lin Cai and Sherman Shen and Jon Mark",
TITLE="Congestion Control for Web-based Multimedia Playback Applications",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="To guarantee network stability while supporting multimedia
applications over the Internet, a new dynamically adjusted
TCP-friendly Additive Increase and Multiplicative Decrease (AIMD)
congestion control algorithm, DTAIMD, is proposed. By studying the
competition behavior of TCP and AIMD flows, the TCP-friendly
condition for the AIMD(alpha, beta) congestion control is
analytically derived.  Quality of Service(QoS) for multimedia
playback applications is enhanced by choosing an appropriate
parameter pair of (alpha, beta).  Simulation results show that
the proposed DTAIMD congestion control scheme is TCP-friendly and
suitable for supporting multimedia playback applications."
}

@INPROCEEDINGS{Cai0305:Performance,
AUTHOR="Kui Cai",
TITLE="Performance Bounds for Parity Coded Optical Recording Channels with d=1
Constraint",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We derive performance bounds on bit error rates and error event
probabilities for optical recording channels with d=1
constraint. The bounds account for the use of various parity
codes. They serve as benchmarks for the development of parity
codes and post-processing schemes. Computer simulations have been
carried out to demonstrate the accuracy of the proposed bounds and
to evaluate the performance of various parity codes."
}

@INPROCEEDINGS{Cair0310:Space,
AUTHOR="Giuseppe Caire and Mohamed Oussama Damen and Hesham {El Gamal} and Michael
Fitz",
TITLE="Space-Time Signaling",
BOOKTITLE="Vehicular Technology Conference Fall 2003",
ADDRESS="Orlando, Florida",
DAYS=4,
MONTH=oct,
YEAR=2003,
ABSTRACT="In this tutorial, we give a comprehensive treatment of
space-time signalings under different channel state 
information (CSI) assumptions.  
We provide a unified treatment of the different design approaches 
proposed in the literature. We cut through the confusion of many
mathematical aspects of the problem and illustrate the
connection between these aspects. After reviewing the 
information theoretic foundations, multiple-input multiple-output
channels modeling, and the signal design criteria, we 
elaborate a unified approach to the different space-time signaling
schemes in the literature, under different CSI scenarios (i.e., adaptive,
coherent, non-coherent, and differentially coherent). Similarly, we
elaborate a unified approach to the receiver architecture and the 
signal processing  of the different signaling schemes. Finally, we
draw some conclusions and present some problems for future research."
}

@INPROCEEDINGS{Calv0305:Wifi,
AUTHOR="Andrea Calvagna and Giacomo Morabito and Antonio Pappalardo and Lorenzo
Vita",
TITLE="WiFi mobility framework supporting {GPRS} roaming: Design and
Implementation",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="AbstractTo provide IP mobility for wireless users
several micro-mobility protocols are currently available.
These are capable of supporting this feature
inside the scope of a LAN, by means of performing
handovers between adjacent WiFi radio-access cells in
order to follow users movements. Also, it is possible
to achieve wireless mobility in a larger extent, i.e.
across whole network domains. But, in order to do it
these protocols have to be used in conjunction with a
macro-mobility protocol, like Mobile IP. In this context,
a problem arises if such domains are so far away
from each other that wireless-access gaps exist between
them. In fact, this prevents wireless IP users from
experiencing access continuity while traveling across
these domains. In this paper we describe a solution
which was designed and implemented to cope with the
above problem. Starting from the Cellular IP protocol,
we developed a new mobility framework that extends
it to seamlessly manage roaming into GPRS access network,
whenever the mobile host is out of range from
any WiFi domain. Also, management of inter-domain
macro-mobility is integrated in our framework, eliminating
the need to externally rely on Mobile IP. The proposed middleware
has been deployed on a real test-bed and extensively tested, so test
results are presented."
}

@INPROCEEDINGS{Camp0303:Tuning,
AUTHOR="Enrique Campos-Nanez and Stephen Patek",
TITLE="On-line Tuning of Prices for Network Services",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Recent investigations into the pricing of multiclass loss networks have
shown that static prices are optimal in the asymptotic regime of many
small sources. These results suggest that nearly optimal prices for highly
aggregated systems can be computed from the solution to a limiting
deterministic optimization model. When the assumption of many small
sources does not hold, static prices are still preferable (for practical
reasons), but we are left with the difficult issue of computing an optimal
solution when the stochastic nature of the process cannot be ignored. In
this paper, we develop a computational procedure for optimizing static
prices that operates by adjusting prices in response to actual customer
arrivals and departures and is robust to parametric uncertainty about the
underlying system. We provide initial arguments for the convergence
properties of our optimization algorithm, and we illustrate its
application in several numerical examples.

Method Keywords: Mathematical programming/optimization, Control theory"
}

@ARTICLE{Cao0301:Obtaining,
AUTHOR="Xi-Ren Cao and Junjie Wang",
TITLE="Obtaining packet response times for nonblocking {ATM} switches",
JOURNAL="Performance Evaluation",
VOLUME=51,
NUMBER=1,
PAGES="33-45",
MONTH=jan,
YEAR=2003,
REFERENCES=15,
KEYWORDS="Power series algorithm; Rational approximation; NewtonPadé approximation",
ABSTRACT="In this paper, we propose an approach that yields accurate approximations
for the packet response times in a generic ATM switch. The approach
combines three existing methodologies: power series algorithm for light
traffic, saturation analysis for heavy traffic, and the NewtonPadé
rational approximation for curve fitting. This approach works especially
well for small to medium size switches, for which the traditional
assumption of the Poisson arrival to the transmission channels does not
apply well. Numerical samples reveal a close agreement between the
approximant and the simulation result.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-46VJSK5-2-52\&\_cdi=5663\&\_orig=browse\&\_coverDate=01\%2F31\%2F2003\&\_sk=999489998\&view=c\&wchp=dGLbVlb-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=911cab1c3e586b67b70e3f0e1a7e7a65\&ie=f.pdf"
}

@ARTICLE{Cao0303:Integrating,
AUTHOR="Guohong Cao",
TITLE="Integrating Distributed Channel Allocation and Adaptive Handoff Management
For QoS-Sensitive Cellular Networks",
JOURNAL="ACM/Kluwer Wireless Networks (WINET)",
VOLUME=9,
NUMBER=2,
PAGES="131-142",
MONTH=mar,
YEAR=2003,
KEYWORDS="Distributed channel allocation; handoff management; call dropping; quality
of service; intra-handoff; cellular networks",
ABSTRACT="Next generation high-speed cellular networks are expected to support
multimedia applications, which require QoS provisions.
Since frequency spectrum is the most expensive resource in wireless
networks, it is a challenge to support QoS using limited frequency
spectrum.
In the literature, two orthogonal approaches are used to address the
bandwidth utilization issue and the QoS provision issue; that is,
channel allocation schemes have been proposed to
improve bandwidth efficiency, whereas handoff management
schemes, based on bandwidth reservation,
have been proposed to guarantee a low connection dropping rate.
However, little effort has been taken to address both issues together.
In this paper, we integrate distributed channel allocation and
adaptive handoff management to provide QoS guarantees and efficiently
utilize the bandwidth. First, we present a complete
distributed channel allocation algorithm and propose techniques to reduce
its message complexity and intra-handoff overhead.
Second, we integrate the proposed distributed channel allocation algorithm
with an adaptive handoff management scheme to provide QoS guarantees
and efficiently utilize the bandwidth. Detailed simulation experiments
are carried out to evaluate the proposed methodology. Compared
to previous schemes, our scheme can significantly reduce the message
complexity and intra-handoff overhead. Moreover, the proposed scheme can
improve the bandwidth utilization while providing QoS guarantees.",
URL="http://www.cse.psu.edu/~gcao"
}

@INPROCEEDINGS{Cao0303:Performance,
AUTHOR="Xiaojun Cao and Vishal Anand and Yizhi Xiong and Chunming Qiao",
TITLE="Performance Evaluation of Wavelength Band Switching in Multi-fiber
All-Optical Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Wavelength band switching (WBS) has only recently attracted attention from
the optical networking industry for its practical importance in reducing
the control complexity and cost of optical cross-connects (OXCs). However,
WBS-related problems of theoretical interest have not been addressed
thoroughly by the research community, and many issues are still wide open.
In particular, WBS is different from wavelength routing, and thus
techniques developed for wavelength-routed networks (including e.g., those
for traffic grooming) cannot be directly applied to effectively address
WBS-related problems.

In this paper, we first propose a new multi-granular OXC (MG-OXC)
architecture for WBS, which is more flexible than any existing WBS node
architectures. We also adopt the most powerful waveband assignment
strategy, and develop an efficient heuristic algorithm called Balanced
Path routing with Heavy-Traffic first (BPHT). To verify its
near-optimality, we also develop an integer linear programming (ILP)
model. Both the ILP and the BPHT algorithms can handle the case with
multiple fibers per link and hence are more general than our previous
single-fiber solutions \cite{LANDER-OptiComm02}.

We conduct a comprehensive evaluation of the benefits of WBS through
detailed analysis and simulations. We show that the proposed heuristic
BPHT can perform much better than a heuristic which applies the optimal
routing and wavelength assignment (RWA) method. We also show that WBS
using BPHT is even more beneficial in multi-fiber networks than in
single-fiber networks in terms of reducing the port count. Our analytical
and simulation results also provide valuable insights into the effect of
wavelength band granularity, as well as the trade-offs between the
wavelength-hop and the port count required in WBS networks."
}

@INPROCEEDINGS{Cao0305:Efficient,
AUTHOR="Zhongren Cao",
TITLE="Efficient Structure-based Carrier Frequency Offset Estimation for
Interleaved {OFDMA} Uplink",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In orthogonal frequency division multiple access (OFDMA), closely
spaced multiple subcarriers are assigned to different users for
parallel data transmissions. The subcarriers are overlapping but
orthogonal to each other such that there is no inter-carrier
interference. Carrier frequency offsets between the transmitters
and the uplink receiver will cause the loss of the orthogonality
among subcarriers, hence introduce inter-carrier interference
resulting in multiple access interference. This paper proposed a
novel carrier frequency offsets estimation algorithm for the
uplink receiver of OFDMA systems that adopt interleaved subcarrier
assignment schemes. This algorithm requires only one OFDMA block
and utilizes the inner structure of the signals without any aid
from training symbols or the knowledge of channels. Simulation
results illustrate the high accuracy and efficiency of the
proposed estimation algorithm."
}

@ARTICLE{Cao0305:Online,
AUTHOR="Guohong Cao and Wu-chi Feng and Mukesh Singhal",
TITLE="Online variable-bit-rate video traffic smoothing",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=7,
PAGES="639-651",
MONTH=may,
YEAR=2003,
REFERENCES=26,
KEYWORDS="Bandwidth smoothing; Traffic management; Video-on-demand; Compressed video;
Online smoothing",
ABSTRACT="The efficient transmission of variable-bit-rate (VBR) video streams is
complicated by the burstiness that video compression standards such as
MPEG introduce. Most of the existing techniques concentrate on stored
video traffic smoothing or real-time video traffic smoothing. However,
there is a growing number of live video applications, such as video-casts
of courses or television news, where many clients may be willing to
tolerate a playback delay of several seconds or minutes in exchange for a
smaller throughput requirement. Bandwidth smoothing for these live video
applications is referred to as online smoothing. In this paper, in order
to measure the effectiveness of online video smoothing methods, we propose
a benchmark algorithm, which provides an upper bound on some of the
performance metrics in the smoothing results. Based on this algorithm, we
found that significant discrepancy exists between the results produced by
the existing online smoothing methods and the upper bound. With this
observation, we focus on designing algorithms that can improve the
smoothing results. Experimental results show that the proposed algorithms
make considerable improvements compared to existing smoothing methods.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-472JDM9-2-26\&\_cdi=5624\&\_orig=browse\&\_coverDate=05\%2F01\%2F2003\&\_sk=999739992\&view=c\&wchp=dGLbVtz-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=2508f334f9744b31e9c3f890086bac05\&ie=f.pdf"
}

@INPROCEEDINGS{Cao0305:Scheduling,
AUTHOR="Yaxin Cao and Rayadurgam Ravikanth and Hemant Chaskar",
TITLE="Scheduling and Admission Control Support for {MPLS} Service Granularity
Constraint",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="MPLS services sometimes require that an LSP (label-switched path) be 
guaranteed a minimal service rate with certain granularity constraint. 
To support such a service requirement, proper scheduling and admission 
control mechanisms are needed. We propose two solutions that are based 
on WF$^2$Q and DCS, respectively. The corresponding scheduling and 
admission control policies are designed. The two solutions are compared
both analytically and numerically."
}

@INPROCEEDINGS{Cao0305:Scheduling,
AUTHOR="Yaxin Cao and Victor Li and Zhigang Cao",
TITLE="Scheduling Delay-Sensitive and Best-Effort Traffics in Wireless Networks",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper we propose a novel wireless scheduling algorithm for
delay-sensitive (DS) and best-effort (BE) traffics. Unlike the majority of
the previous wireless scheduling, where the wireless links are modeled as
having only two states, our algorithm is applicable to links with multiple
states. For DS flows, the algorithm is capable of providing statistical
delay violation bounds. Such bounds are derived, analytically, using the
idea of the statistical service envelope. For BE flows, we propose a new
notion of fairness, called long-term link-quality-weighted outcome-fair,
which we believe is more suited to wireless networks than pure
outcome-fair or effort-fair. The algorithm achieves a balance between
bandwidth efficiency requirement and fairness requirement, and guarantees
minimal goodput levels for BE flows."
}

@ARTICLE{Cao03:Online,
AUTHOR="Guohong Cao and Wuchi Feng and Mukesh Singhal",
TITLE="Online Variable-Bit-Rate Video Traffic Smoothing",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=7,
PAGES="639 - 651",
YEAR=2003,
KEYWORDS="Bandwidth smoothing; traffic management; video-on-demand; compressed video;
online smoothing",
ABSTRACT="The efficient transmission of variable-bit-rate (VBR) video streams is
complicated by the burstiness that video
compression standards such as MPEG introduce.
Most of the existing techniques concentrate on stored
video traffic smoothing or real-time video traffic smoothing.
However, there is a growing number of live video
applications, such as video-casts of courses or television news, where
many
clients may be willing to tolerate a playback delay of several seconds or
minutes in exchange for a smaller throughput requirement. Bandwidth
smoothing for these live video applications is
referred to as {\em online smoothing}.
In this paper, in order to measure the effectiveness of online video
smoothing methods, we propose a benchmark algorithm which provides an
upper bound on some of the performance metrics in the smoothing results.
Based on this algorithm, we found that significant discrepancy exists
between the results produced by the existing online
smoothing methods and the upper bound.
With this observation, we focus on designing  
algorithms that can improve the smoothing results. Experimental results
show
that the proposed algorithms make considerable improvements
compared to existing smoothing methods.",
URL="http://www.cse.psu.edu/~gcao"
}

@INPROCEEDINGS{Carb0305:Channel,
AUTHOR="Cecilia Carbonelli and Antonio Alberto D'Amico and Umberto Mengali and
Michele Morelli",
TITLE="Channel Acquisition and Tracking for the Uplink of a Code-Division
Multiple-Access System",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper investigates channel acquisition and tracking for the uplink of
a DS-CDMA system. The transmission medium is characterized by multipath
propagation and the goal is to estimate the time-varying channel impulse
response (CIR) of a new user entering the system. Channel acquisition is
pursued through maximum likelihood techniques while channel tracking is
performed through weighted least squares methods. At each signaling
interval the CIR estimate is updated making use of data decisions and
exploiting the inverse of the interference covariance matrix to mitigate
the near-far problem. Performance is assessed by simulation in a scenario
inspired by the UMTS system."
}

@INPROCEEDINGS{Cart0303:Localized,
AUTHOR="Julien Iguchi-Cartigny and David Simplot-Ryl and Ivan Stojmenovic",
TITLE="Localized minimum-energy broadcasting in ad-hoc networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="In the minimum energy broadcasting problem, each node can adjust
    its transmission power in order to minimize total energy
    consumption but still enable a message originated from a source
    node to reach all the other nodes in an ad-hoc wireless network.
    In all existing solutions each node requires global network
    information (including distances between any two neighboring nodes
    in the network) in order to decide its own transmission radius. In
    this paper, we describe a localized protocol where each node
    requires only the knowledge of its distance to all neighboring
    nodes and distances between its neighboring nodes (or,
    alternatively, geographic position of itself and its neighboring
    nodes). In addition to using only local information, our protocol
    is shown experimentally to even provide more energy savings than
    the best known globalized BIP solution. Our solutions are based on
    the use of relative neighborhood graph which preserves
    connectivity and is defined in localized manner."
}

@INPROCEEDINGS{Casa0305:Performance,
AUTHOR="Olga Casals and Llorenç Cerdà and Gert Willems and Chris Blondia and Nik
{Van den Wijngaert}",
TITLE="Performance Evaluation of the Post-Registration Method, a Low Latency
Handoff in MIPv4",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper we evaluate a low latency handoff protocol for MIPv4, 
the Post-Registration Handoff method. This mechanism proposed by the 
IETF tries to improve the performance of Hierarchical Mobile IP. 
We give a detailed description of the protocol behavior by means of 
an ns simulation and propose a simple queuing model to study the 
influence of various parameters on the protocol performance."
}

@INPROCEEDINGS{Cass0305:Effects,
AUTHOR="Dajana Cassioli and Moe Win and Francesco Vatalaro and Andreas Molisch",
TITLE="Effects of Spreading {BW} on the Performance of {UWB} Rake Receivers",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We consider an ultra-wide bandwidth system using reduced-complexity Rake
receivers, which are based on
either selective (called SRake) or partial (called PRake) combining of a
subset of the available resolved
multipath components. We investigate the influence of the spreading
bandwidth on the system performance
using the two considered types of Rake receivers. We show that there is an
optimum bandwidth, that it
increases with the number of Rake fingers, and that it is higher for an
SRake than for a PRake. We also
investigate the effects of the fading statistics on the optimization of
the spreading bandwidth. We find
that the optimum spreading bandwidth is approximately the same for both
types of fading, but that the
performance of an SRake can be better or worse in Rayleigh fading
(compared to Nakagami), depending on the
spreading bandwidth and the number of fingers."
}

@INPROCEEDINGS{Cast0303:Evaluation,
AUTHOR="Miguel Castro and Michael Jones and Anne-Marie Kermarrec and Antony
Rowstron and Marvin Theimer and Helen Wang and Alec Wolman",
TITLE="An Evaluation of Scalable Application-Level Multicast Built Using
Peer-To-Peer Overlays",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Structured peer-to-peer overlay networks such as CAN, Chord, Pastry, and
Tapestry can be used to implement Internet-scale application-level
multicast.  There are two general approaches to accomplishing this: tree
building and flooding. This paper evaluates these two approaches using two
different types of structured overlay: 1) overlays which use a form of
generalized hypercube routing, e.g., Chord, Pastry and Tapestry, and 2)
overlays which use a numerical distance metric to route through a
Cartesian hyper-space, e.g., CAN. Pastry and CAN are chosen as the
representatives of each type of overlay.

To the best of our knowledge, this paper reports the first head-to-head
comparison of CAN-style versus Pastry-style overlay networks, using
multicast communication workloads running on an identical simulation
infrastructure. The two approaches to multicast are independent of overlay
network choice, and we provide a comparison of flooding versus
tree-based multicast on both overlays. Results show that the tree-based
approach consistently outperforms the flooding approach. Finally, for
tree-based multicast, we show that Pastry provides better performance than
CAN."
}

@INPROCEEDINGS{Cast0305:Overlay,
AUTHOR="Josefina {Castañeda-Camacho} and Domingo {Lara-Rodríguez}",
TITLE="Overlay of {TDMA} and Multiclass {CDMA} Systems with Slots Reallocation on
the {TDMA} Layer",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper extends and complements a previous research where we show that
the overlay of multiclass CDMA and TDMA systems is possible with the
assumption of an ordered hunt. In this work, we present a new scheme of
overlay situation in which the co-channel TDMA slots are placed at the end
of the list but with the additional assumption of a slots reallocation
(reallocation control model), in order to reduce the CDMA interference to
TDMA layer and increase the overlay capacity. It means that if one slot is
set free among the first k ordered busy slots, the user who occupies the
kth slot (last position) will be reallocated to the released position.
Comparing with the pure ordered hunt scheme whose results are a capacity
increase factor equal to 0.58-2.8 for an outage ranging from 9.17\% to
21.12\% in the IS-136 system and a blocking probability equal to 2\% in
the CDMA2000 system; with the reallocation strategy we obtain a capacity
increase factor equal to 0.68-2.82 for an outage ranging from 8.5\% to
20.72\% in the IS-136 system. Therefore, we have obtained an important
improvement on the capacity due to the reallocation strategy, associated
to a better performance on the TDMA system in terms of the outage
probability."
}

@INPROCEEDINGS{Cast0305:Survivable,
AUTHOR="Francisco Castano and Jaime Garcia-Reinoso",
TITLE="Survivable Bluetooth Location networks",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we propose a Bluetooth Location Network (BLN)
for location-aware or context-driven mobile networks, 
such as m-commerce environments or e-museums.  
We assume that, in any of those scenarios, there exist service
servers that need to know user location in real-time, 
to send context-oriented information to user handhelds when 
necessary. The BLN transmits position information to service servers,
without user participation. It is not subject to
line-of-sight constraints and is supported by existing commercial 
handhelds.  BLN users carry either a Bluetooth-enabled handheld
or any mobile data terminal and a Bluetooth badge. The BLN is  
composed by wireless Bluetooth nodes, which establish 
an spontaneous network topology at system initialization. The
BLN can coexist with other Bluetooth systems."
}

@TECHREPORT{Cast03:Proximity,
AUTHOR="Miguel Castro and Peter Druschel and Y. Hu and Antony Rowstron",
TITLE="Proximity neighbor selection in tree-based structured peer-to-peer overlays",
TYPE="technical report",
INSTITUTION="Microsoft Research",
NUMBER="MSR-TR-2003-52",
YEAR=2003,
URL="http://research.microsoft.com/~antr/PAST/location-msrtr-2003-52.pdf"
}

@INPROCEEDINGS{Cavu0307:Real,
AUTHOR="Bulent Cavusoglu and Dan Schonfeld and Rashid Ansari",
TITLE="Real-Time Adaptive Forward Error Correction for {MPEG-2} Video
Communications over {RTP} Networks",
BOOKTITLE="IEEE International Conference on Multimedia \& Expo (ICME)",
ORGANIZATION="IEEE",
ADDRESS="Baltimore, Maryland",
MONTH=jul,
YEAR=2003,
REFERENCES=8,
KEYWORDS="Forward error correction; real-time transport protocol; video
communications; video compression; MPEG-2; maximum entropy; motion
compensation",
ABSTRACT="We present an algorithm for real-time adaptive forward error correction
(FEC) of MPEG-2 video stream, encapsulated using real-time transport
protocol (RTP) and delivered over best-effort networks. Our algorithm
provides an efficient method to determine the allocation of redundancy to
the MPEG-2 video stream. The redundancy is allocated such that the
resulting estimated degradation density function for video (DDF) is
uniformly distributed. A weight, which indicates the relative importance
of RTP packets, together with the communication channel characteristics
and FEC scheme are used to model the density function of the video stream
and allow us to determine the allocation of FEC packets. The weight is
based on the content of RTP packets in the video stream. Parameters
extracted from the RTP header are used to determine the weights, so that
the proposed algorithm can be implemented in real-time. In our
simulations, we have relied on motion compensation and group of picture
(GOP) data to determine the relative weights. Simulation results provided
establish the significant improvement in performance based on our proposed
approach to adaptive FEC.",
URL="http://www.icme2003.org/Papers/viewpapers.asp?papernum=1929"
}

@ARTICLE{Cen0310:End,
AUTHOR="Song Cen and Pamela Cosman and Geoffrey Voelker",
TITLE="End-to-End Differentiation of Congestion and Wireless Losses",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=5,
PAGES="703-717",
MONTH=oct,
YEAR=2003,
REFERENCES=16,
KEYWORDS="congestion control; loss differentiation; TCP-friendly rate control; video
transport protocol; wireless loss",
ABSTRACT="In this paper, we explore end-to-end loss differentiation algorithms (LDAs)
for use with congestion-sensitive video transport protocols for networks
with either backbone or last-hop wireless links. As our basic video
transport protocol, we use UDP in conjunction with a congestion control
mechanism extended with an LDA. For congestion control, we use the
TCP-Friendly Rate Control (TFRC) algorithm. We extend TFRC to use an LDA
when a connection uses at least one wireless link in the path between the
sender and receiver. We then evaluate various LDAs under different
wireless network topologies, competing traffic, and fairness scenarios to
determine their effectiveness. In addition to evaluating LDAs derived from
previous work, we also propose and evaluate a new LDA, ZigZag, and a hybrid
LDA, ZBS, that selects among base LDAs depending upon observed network
conditions. We evaluate these LDAs via simulation, and find that no single
base algorithm performs well across all topologies and competition.
However, the hybrid algorithm performs well across topologies and
competition, and in some cases exceeds the performance of the best base
LDA for a given scenario. All of the LDAs are reasonably fair when
competing with TCP, and their fairness among flows using the same LDA
depends on the network topology. In general, ZigZag and the hybrid
algorithm are the fairest among all LDAs.",
URL="http://ieeexplore.ieee.org/iel5/90/27747/01237446.pdf?isNumber=27747\&prod=JNL\&arnumber=1237446\&arSt=+703\&ared=+717\&arAuthor=Song+Cen\%3B+Cosman\%2C+P.C.\%3B+Voelker\%2C+G.M."
}

@ARTICLE{Chad0310:Experiences,
AUTHOR="David Chadwick and Darren Mundy and John New",
TITLE="Experiences of using a {PKI} to access a hospital information system by
high street opticians",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=16,
PAGES="1893-1903",
MONTH=oct,
YEAR=2003,
REFERENCES=18,
KEYWORDS="Public key infrastructure; Digital signatures; Encryption; WWW; Medical
telematics; Usability; Validation testing",
ABSTRACT="This paper describes a system that gives opticians Internet access from
their high street shops to patient data held in a hospital Diabetes
Information System (DIS), using a standard Web browser. The system is a
revision of an earlier one we provided to General Practitioners (GPs), and
uses a public key infrastructure with strong encryption and digitally
signed messages to secure the data as it traverses the Internet.

We describe the PKI and the security architecture, the DIS we chose to
distribute, the changes that we made to the Web interface to tailor it to
the opticians needs, the validation testing we performed, the results of
the pilot testing and the feedback we obtained from the opticians. We also
compare the results with our earlier work with GPs.

We found that in a well-designed system the underlying PKI is virtually
invisible to the users, and its security is taken for granted. Users then
concentrate on the costs and benefits of the electronic application. In
our system, benefits can accrue to opticians by giving them access to the
latest patient data, and this can help to improve patient care. Benefits
also accrue to the DIS administrators and the wider community of DIS
users, in that data quality can be significantly improved. However, we
found that the slow speed of Internet access via a dial up connection is a
significant impediment to its frequent use. We also found that it is
extremely difficult to produce a user interface that pleases everyone.
Finally, in complex information systems such as this PKI, failure of just
one component or administrative procedure can have a catastrophic effect
on the availability of the entire system.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-484KMB6-2-F\&\_cdi=5624\&\_orig=browse\&\_coverDate=10\%2F15\%2F2003\&\_sk=999739983\&view=c\&wchp=dGLbVlb-zSkzS\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=5ac6997677e924b57d84a2586e43a79c\&ie=f.pdf"
}

@INPROCEEDINGS{Chah0305:End,
AUTHOR="Tijani Chahed and Anne-Florence Canton and Salah Eddine Elayoubi",
TITLE="End-to-end {TCP} Performance in {W-CDMA} / {UMTS}",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this work, we focus on modeling of TCP in an end-to-end path where 
both a wired and a wireless, mobile sections of the network are present.
 The former is governed by loss and is subject to TCP retransmission. 
The latter is governed by error and path loss and is under data layer 
control error detection/retransmission mechanisms as well as 
UMTS-oriented error correction and power control. We first investigate 
the end-to-end performance of TCP in the outer-loop, with Bit Error 
Ratio (BER) as a QoS metric. Second, we consider the inner-loop control
 case, and relate TCP performance to the Signal-to-Interference Ratio 
(SIR) and the despread bit energy to interference density ratio 
$E\_b / N\_0$. Third, we review the power control algorithm and propose 
a novel one basing it on end-to-end TCP performance rather than UMTS 
channel measurements."
}

@INPROCEEDINGS{Chak0303:Flow,
AUTHOR="Rajiv Chakravorty and Sachin Katti and Ian Pratt and Jon Crowcroft",
TITLE="Flow Aggregation for Enhanced {TCP} over Wide Area Wireless",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT={Throughout the world, GSM cellular mobile networks are being upgraded
to support the {"}always-on{"} General Packet Radio Service (GPRS).
Despite the apparent availability of levels of bandwidth not
dissimilar to that provided by conventional fixed-wire telephone
modems, the user experience using GPRS is much worse.
 
In this paper we examine the performance of protocols such as TCP over
GPRS, and show how certain network characteristics interact badly with
TCP to yield problems such as: link under-utilization for short-lived
flows, excess queueing for long-lived flows, ACK compression, poor
loss recovery, and gross unfairness between competing flows.
 
We present the design and implementation of a transparent TCP proxy
that mitigates many of these problems without requiring any changes to
the TCP implementations in either mobile or fixed-wire end systems.
 
The proxy transparently splits TCP connections into two halves, the
wired and wireless sides. Connections destined for the same
mobile host are treated as an aggregate due to their statistical
dependence. We demonstrate packet scheduling and flow control
algorithms that use information shared between the connections to
maximise performance of the wireless link while inter-working with
unmodified TCP peers.  We also demonstrate how fairness between flows
and response to loss is improved, and that queueing and hence network
latency is reduced.  We conclude that installing such a proxy into
GPRS network would be of significant benefit to users.}
}

@INPROCEEDINGS{Chak0305:Dynamic,
AUTHOR="Rajiv Chakravorty and Jon Crowcroft and Ian Pratt and Maurizio D'Arienzo",
TITLE="Dynamic SLA-based QoS Control for Third Generation Wireless Networks: The
{CADENUS} Extension",
BOOKTITLE="ICC 2003 - Global Services and Infrastructure for Next Generation Networks",
ADDRESS="Anchorage, Alaska",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="With the evolution of QoS-capable third generation wireless networks,
the wireless network community has been increasingly looking for a
framework that can provide an effective, network independent, end-to-end
QoS control. In this paper, we first construct such a framework and then
describe how dynamic SLA-based control can be used to achieve end-to-end
QoS in a wired and wireless (UMTS) environment. The proposed framework,
which is an extension to the IST CADENUS project, offers an effective
wired-wireless QoS translation, an efficient QoS control and management,
and a dynamic SLA policy-based QoS provisioning."
}

@INPROCEEDINGS{Chak0305:Efficient,
AUTHOR="Anirban Chakrabarti and Manimaran Govindarasu",
TITLE="An Efficient Algorithm for Malicious Update Detection \& Recovery in
Distance Vector Protocols",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The Internet infrastructure security has been gaining importance in recent
years due to growing concerns for cyber-warfare.
Among different network threats, the routing table poisoning attack is the
most devastating and least researched topic which needs immediate
research attention. In this paper, we develop a scalable algorithm for
detecting and recovering from router attacks in distance vector routing
protocols. The algorithm is able to detect and recover from malicious
updates under certain well-defined conditions. We carry out extensive
simulation studies to evaluate the
proposed Pivot Based Algorithm for Inconsistency Recovery (PAIR)for three
performance metrics, viz. detection probability, recovery
probability and malicious distance under different network and attack
scenarios.
Our studies show that the PAIR is extremely scalable and offers high
detection and recovery capability."
}

@ARTICLE{Chak0306:Case,
AUTHOR="Amit Chakrabarti and G. Manimaran",
TITLE="A case for tree migration and integrated tree maintenance in QoS
multicasting",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=9,
PAGES="1007-1017",
MONTH=jun,
YEAR=2003,
REFERENCES=35,
KEYWORDS="Tree migration; Constrained online multicast; Global tree maintainance",
ABSTRACT="The proliferation of QoS-aware group applications coupled with the limited
availability of network resources demand for efficient mechanisms to
support QoS multicasting. During a life-cycle of a multicast session,
three important events can occur: membership dynamics, network dynamics,
and traffic dynamics. The first two are concerned with maintaining a good
quality (cost) multicast tree taking into account dynamic join/leave of
members, and changes in network topology due to link/node
failures/additions, respectively. The third aspect is concerned with flow,
congestion, and error control. There has been many solutions proposed for
dealing with each of these issues. However, the issue of tree migration
has not been addressed as part of these solutions. In this paper, we
highlight the importance of tree migration as a mechanism for handling
membership and network dynamics in core-based multicasting, prove that it
is NP-Complete, and propose four heuristic algorithms for it. The proposed
algorithms are evaluated under two performance metrics: service disruption
and resource wastage. Our simulation studies show that two of the
algorithms offer comparable performance to that of the other two, in
addition to being highly scalable and easily implementable. Moreover, we
also propose an integrated approach for group management involving both
local and global tree maintenance techniques.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-470M8MN-1-Y\&\_cdi=5624\&\_orig=browse\&\_coverDate=06\%2F02\%2F2003\&\_sk=999739990\&view=c\&wchp=dGLbVtz-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=67a4c14795ef3e928f8b8e97187d599a\&ie=f.pdf"
}

@ARTICLE{Chal0302:Topology,
AUTHOR="Robert Chalmers and Kevin Almeroth",
TITLE="On the Topology of Multicast Trees",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=1,
PAGES="153-165",
MONTH=feb,
YEAR=2003,
REFERENCES=35,
KEYWORDS="efficiency; modeling; multicast; topology",
ABSTRACT="The benefit derived from using multicast is seemingly dependent upon the
shape of the distribution tree. We attempt to model interdomain multicast
trees accurately. We measure a number of key parameters, such as depth,
degree frequency, and average degree, for a number of real and synthetic
data sets. We find that interdomain multicast trees actually do share a
common shape at both the router and autonomous system levels. Furthermore,
we develop a characterization of multicast efficiency which reveals that
group sizes as small as 20 to 40 receivers offer a 55\%-70\% reduction in
the total number of links traversed when compared to separately delivered
unicast streams. A final contribution of our work consists in a number of
data sets, compiled from multicast group membership and path data, that
can be used to generate large sample trees, representative of the current
multicast infrastructure.",
URL="http://ieeexplore.ieee.org/iel5/90/26510/01180552.pdf?isNumber=26510\&prod=JNL\&arnumber=1180552\&arSt=+153\&ared=+165\&arAuthor=Chalmers\%2C+R.C.\%3B+Almeroth\%2C+K.C."
}

@INPROCEEDINGS{Chan0303:Providing,
AUTHOR="Cheng-Shang Chang and Duan-Shin Lee and Chi-Yao Yue",
TITLE="Providing Guaranteed Rate Services in the Load Balanced Birkhoff-von
Neumann Switches",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="In this paper, we propose two schemes for the load balanced Birkhoff-von
Neumann switches to provide guaranteed rate services. As in [7], the first
scheme is based on an Earliest Deadline First (EDF) scheduling policy. In
such a scheme, we assign every packet of a guaranteed rate flow a {\em
targeted departure time} that is the departure time from the corresponding
work conserving link with capacity equal to the guaranteed rate. By adding
a jitter control mechanism in front of the buffer at the second stage and
running the EDF policy  at the output buffer, we show that the end-to-end
delay for every packet of a guaranteed rate flow is bounded by the sum of
its targeted departure time and a constant that only depends on the number
of flows and the size of the switch.

Our second scheme is a frame based scheme as in Keslassy and McKeown [17].
There, time slots are grouped into fix size frames. Packets
are placed in appropriate bins (buffers) according to their {\em arrival
times} and their {\em flows}. We show that if the incoming traffic
satisfies certain assumptions, then the end-to-end delay for
every packet and the size of the central buffers are both bounded by
constants that only depend on the size of the switches and the frame size.
The second scheme is much simpler than the first one in many aspects: (i)
the on-line complexity is $O(1)$ as there is no need
for EDF, (ii) central buffers are finite and thus can be built into a
single chip, (iii) connection patterns of the two switch fabrics are
changed less frequently, (iv) there is no need for resequencing-and-output
buffer after the second stage, and (v) variable length packets may be
handled without segmentation and reassembly."
}

@INPROCEEDINGS{Chan0303:Using,
AUTHOR="Cheng-Shang Chang and Duan-Shin Lee and Chao-Kai Tu",
TITLE="Using Switched Delay Lines for Exact Emulation of {FIFO} Multiplexers with
Variable Length Bursts",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="It has been studied extensively in the literature how one achieves exact
emulation of  First In First Out (FIFO) multiplexers for fixed size cells
(or packets) using optical crossbar Switches and fiber Delay Lines (SDL).
In this paper, we take a step further and propose a new architecture that
achieves exact emulation of FIFO multiplexers for variable length bursts.
Our architecture consists of two blocks: a cell scheduling block and an
FIFO multiplexer for fixed size cells. Both blocks are made of SDL units. 
The objective of the cell scheduling block is to schedule cells in a burst
to the right input at the right time so that cells in the same burst
depart contiguously from the multiplexer for fixed size cells. We show
that cell scheduling can be done efficiently by keeping track of a single
state variable, called the total virtual waiting time in this
paper.Moreover, the delay through the cell scheduling block is bounded
above by a constant that only depends on the number of inputs and the
maximum number of cells in a burst. Such a delay bound provides a limit on
the number of fiber delay lines needed in the cell scheduling block."
}

@ARTICLE{Chan0304:Statistical,
AUTHOR="Man Chan and Tony Lee",
TITLE="Statistical Performance Guarantees in Large-Scale Cross-Path Packet Switch",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=2,
PAGES="325-337",
MONTH=apr,
YEAR=2003,
REFERENCES=16,
KEYWORDS="Clos network; cross-path switch; exponential bounded burstiness (EBB)
processes; path switching; quality of service (QoS); semioptical network;
service curves; statistical performance guarantees; token assignment
algorithm",
ABSTRACT="We develop a general framework for a novel switch architecture, the
cross-path switch, to provide per-session statistical quality of service
(QoS) guarantees. With characterizing the service each session receives by
service curves, we derive a set of statistical bounds on the delay,
backlog, and departure processes at the switch on a per-session manner
using exponential bounded burstiness processes as source session traffic
models. These bounds show that the service guarantees offered by the
cross-path switch depend on the way of token assignment in the central
stage of the switch. To provide better performance guarantees, we
determine the criteria for designing a token assignment algorithm for the
cross-path switch. Also, we quantify the service guaranteed by the
cross-path switch with the central stage implemented in optical domain,
which is important for the provision of QoS guarantees to each session in
semioptical networks.",
URL="http://ieeexplore.ieee.org/iel5/90/26877/01194827.pdf?isNumber=26877\&prod=JNL\&arnumber=1194827\&arSt=+325\&ared=+337\&arAuthor=Man+Chi+Chan\%3B+Lee\%2C+T.T."
}

@INPROCEEDINGS{Chan0305:Adaptive,
AUTHOR="Rajarathnam Chandramouli and Kiran Sampath",
TITLE="An Adaptive Energy-efficient Link Layer Protocol Using Stochastic Learning
Control",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We present a computationally simple stochastic learning control
framework for an adaptive energy efficient link layer protocol. A
stochastic iterative technique is discussed that can produce {\em
soft} channel state predictions and track slow/rapidly varying
bursty, finite state wireless channels. No {\em a priori}
knowledge about the state transition probabilities is needed for
this. Theoretical convergence of the proposed technique is shown.
The proposed link layer protocol utilizes the channel state
predictions from the stochastic learning algorithm while computing
energy efficient transmission policies. This entire process is
performed on-line with no pilot (training) symbols, etc., thereby
improving the throughput and avoiding energy wastage due to pilot
symbols. Simulation results show that up to 50\\% energy savings
can be obtained for some channels when compared with a popular
link layer protocol. Energy and delay can be traded-off
efficiently using the proposed method."
}

@INPROCEEDINGS{Chan0305:Synchronized,
AUTHOR="Ing-Chau Chang",
TITLE="Synchronized Multimedia Multicast on Mobile {IP} Networks",
BOOKTITLE="ICC 2003 - Global Services and Infrastructure for Next Generation Networks",
ADDRESS="Anchorage, Alaska",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="With the IP multicast technique, the source sender can efficiently transmit
only one copy of the multimedia stream to multiple mobile hosts
simultaneously. However, because the mobile host can roam to any wireless
cell, the multimedia stream issued by the same source may follow different
paths to different mobile hosts, which introduces different end-to-end
delays. As soon as the mobile host handoffs to another wireless cell with
a different end-to-end delay, it will not receive the correct streaming
multimedia data for continuous playback. In this paper, we propose the
Synchronized Multimedia Multicast (SMM) scheme to achieve two most
important characteristics that the traditional Home Subscription (HS) and
Remote Subscription (RS) schemes cannot support. First, the SMM scheme
supports synchronized multimedia multicast on mobile IP networks and
achieves seamless playback of continuous media stream when the mobile host
handoffs. Further, combined with the Fine Granularity Scalability (FGS)
approach in the MPEG-4 standard, the SMM scheme achieves unlimited numbers
of handoff only at the cost of degraded video quality for a short period
after handoff."
}

@INPROCEEDINGS{Chan0305:Traffic,
AUTHOR="Chung-Ju Chang and Yung-Hong Cheng and Li-Fong Lin",
TITLE="The Traffic Conditioner with Promotion and Fairness Guarantee {(TC\_PFG)}
Scheme for DiffServ Network",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we propose a traffic conditioner with promotion and fairness
guarantee (TC\_PFG) scheme to amend the inappropriate marking by
conventional traffic conditioners. The TC\_PFG is based on the Two Rate
Three Color Marker (TRTCM) scheme. It can allocate appropriate bandwidth
to micro-flows to reduce the unfair distribution among micro-flows and
improve the utilization by allowing promotion of packets when there is
available bandwidth. Simulation results show that TC\_PFG outperforms
TRTCM; the former achieve higher fairness among microflows and better
throughput than the latter."
}

@ARTICLE{Chan0309:High,
AUTHOR="Chia-Tai Chan and Pi-Chung Wang and Shuo-Cheng Hu and Chung-Liang Lee and
Rong-Chang Chen",
TITLE="High-performance {IP} forwarding with efficient routing-table update",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=14,
PAGES="1681-1692",
MONTH=sep,
YEAR=2003,
REFERENCES=21,
KEYWORDS="Internet protocol version 6; Routing-table; Fast forwarding-table
construction algorithm",
ABSTRACT="There has been an extensive study in constructing the routing tables during
the past few years. Although the existing works have certain advantages,
those approaches either use complicated data structures which result in
large storage requirement and high complexity for updating/building the
forwarding table or they are not scalable to fit in Internet protocol
version 6 (IPv6). In this work, we propose a fast forwarding-table
construction algorithm. With the modified multiway search tree, we can
further reduce the depth of the tree and eliminate the storage for
pointers. It leads to reduce the FT size and shorten the routing-table
lookup time. While considering the route flaps, the forwarding performance
will degrade by only 3.1\% with 4000 BGP updates per 30 s in the worst
case. Moreover, it is simple enough to fulfill the need of the fast packet
forwarding. An extension approach to solve the IPv6 routing lookup is also
presented for the future deployment.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-4805VF7-4-3G\&\_cdi=5624\&\_orig=browse\&\_coverDate=09\%2F01\%2F2003\&\_sk=999739985\&view=c\&wchp=dGLbVlb-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=3a33a7b01f5a55934b92d67dba0eb7fc\&ie=f.pdf"
}

@INPROCEEDINGS{Chao0303:Petabit,
AUTHOR="H. Jonathan Chao and Kung-Li Deng and Zhigang Jing",
TITLE="A Petabit Photonic Packet Switch {(P3S)}",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="This paper presents a novel petabit photonic packet switch (P3S)
architecture that is highly scalable both in dimension and capacity while
maintaining high system performances.  Using a novel multi-dimensional
photonic multiplexing scheme that includes space, time, wavelength, and
sub-carrier domains, we propose a photonic switch fabric based on a
3-stage Clos network to provide scalable large-dimension photonic
interconnections with nanosecond reconfiguration speed.  Packet buffering
is implemented electronically at the input and output  port controllers,
allowing the central photonic switch fabric to transport high-speed
optical signals without electrical-to-optical conversion.  Optical time
division multiplexing (OTDM) technology further scales port speed beyond
electronic speed up to 160 Gbits/s to minimize the fiber connections.  To
solve output contention, we propose a new arbitration scheme, called
Frame-based Exhaustive Matching (FEM), using extended frames to aggregate
cells from different incoming lines.  The extended frame relaxes the
stringent arbitration time constraint at a 160 Gbit/s port speed.  Based
on the FEM scheme in the proposed architecture, a 6400 x 6400 switch with
total capacity of 1.024 petabit/s can be achieved with throughput close to
100\% under various traffic conditions."
}

@INPROCEEDINGS{Chao0305:Load,
AUTHOR="Chih-Min Chao and Jang-Ping Sheu and I-Cheng Chou",
TITLE="A Load Awareness Medium Access Control Protocol for Wireless Ad Hoc Network",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="A contention-based wireless ad hoc
medium access control (MAC) protocol, such as carrier sense
multiple access with collision avoidance (CSMA/CA), has the
excellence of simple and efficient when the system is
light-loaded. The main drawback of such protocols is their
inefficiency and unbounded delay when system load is heavy. On
the other hand, a contention-free MAC protocol, such as token
passing, has the better and fair throughput when the system is
heavy-loaded. The main problem of such protocols is their
inefficiency when only a small amount of users want to transmit.
In this paper, we propose a new load awareness wireless ad hoc
MAC protocol (which is called LA) that exploits the benefits of
both contention-based and contention-free protocols. A
contention-based MAC protocol is used when system is light-loaded
and a contention-free one is used otherwise. Our LA protocol,
which operates distributed and is fully compatible with IEEE
802.11 wireless local area network (WLAN) standard, can switch
smoothly between the contention-based  protocol and the
contention-free one. Simulation results show that our protocol indeed
extracts the better part of two kinds of protocols and performs well in
all system loads."
}

@INPROCEEDINGS{Chao0305:Packet,
AUTHOR="H. Jonathan Chao and Zhigang Jing and Kung-Li Deng",
TITLE="Packet Scheduling Scheme for A 3-stage Clos-Network Photonic Switch",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper presents a new packet scheduling scheme, called Frame-based
Exhaustive Matching (FEM), to efficiently resolve the contention in a
3-stage Clos-network photonic switch. Using extended frames to aggregate
cells from different incoming lines, the extended frame relaxes the
stringent arbitration time constraint at the ultrafast port speed
achievable in the photonic switch fabric. We also evaluate and analyze
system performances, including throughout and packet delay, under various
traffic conditions. At the expanse of a moderate internal speedup of 1.5,
throughput close to 100\% under various traffic conditions can be achieved
in a 6400 x 6400 3-stage Clos-network switch without expansion."
}

@INPROCEEDINGS{Char0303:National,
AUTHOR="Pambos Charalambous and Chad Dennis and Georgios Ellinas and Eric Bouillet
and Jean-Francois Labourdette and Ahmet Akyamac and Sid Chaudhuri and
Mikhail Morokhovich",
TITLE="A National Mesh Network Using Optical Cross-Connect Switches",
BOOKTITLE="Optical Fiber Communications (OFC)",
MONTH=mar,
YEAR=2003,
ABSTRACT="This paper presents Dynegys long-haul national
network utilizing intelligent optical switches. This
network offers end-to-end point-and-click provisioning,
shared mesh restoration, re-provisioning
of connections and network re-optimization.",
URL="http://www-ee.engr.ccny.cuny.edu/www/web/ellinas/OFC03\_dynegy.pdf"
}

@ARTICLE{Char0305:Observed,
AUTHOR="Joachim Charzinski",
TITLE="Observed performance of elastic Internet applications",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=8,
PAGES="914-925",
MONTH=may,
YEAR=2003,
REFERENCES=24,
KEYWORDS="Internet; Application level performance; HTTP; SMTP; POP3; Latency; Traffic
measurement; Packet trace; Parallel connections; Heavy tail",
ABSTRACT="Elastic Internet applications have the greatest share in the traffic
transported over the Internet today. Web access and e-mail are the most
popular applications among most people using the Internet. Although these
applications can well adapt to a wide range of bandwidths, their
performance is an issue to people using services interactively.

In this paper, we use sophisticated application-level evaluations to
extract traffic characteristics and performance measures for HTTP, SMTP
and POP3 from traffic traces. The process of loading Web pages by real
browsers using persistent and parallel connections is studied in detail,
revealing statistics about the elements in Web pages as well as the number
of parallel connections and the accumulated waiting time during Web page
loads.

The main results are: (1) High variance distributions are not only found
as expected in file sizes, but also in the number of items in a Web page,
the number of e-mails transmitted in one connection, the duration of SMTP
command exchanges or even the users' viewing times for Web pages. (2) Web
browsers utilize more parallel connections than usually expected to
simultaneously load items. (3) A large portion of the delay in Web page
retrievals or e-mail transfers is due to serial waiting and can therefore
not be significantly reduced by increasing bandwidths. Therefore, low
latency is as much an issue in access systems as high bandwidth.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-473N429-6-3F\&\_cdi=5624\&\_orig=browse\&\_coverDate=05\%2F20\%2F2003\&\_sk=999739991\&view=c\&wchp=dGLbVlz-zSkWW\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=6d7a04d6c09a7feada2129741f8c4301\&ie=f.pdf"
}

@ARTICLE{Chas0308:Fair,
AUTHOR="Hemant Chaskar and Upamanyu Madhow",
TITLE="Fair Scheduling With Tunable Latency: A Round-Robin Approach",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=4,
PAGES="592-601",
MONTH=aug,
YEAR=2003,
REFERENCES=15,
KEYWORDS="quality of service; round robin; scheduling; weighted fair queueing",
ABSTRACT="Weighted fair queueing (WFQ)-based packet scheduling schemes require
processing at line speeds for tag computation and tag sorting. This
requirement presents a bottleneck for their implementation at high
transmission speeds. We propose an alternative and lower complexity
approach to packet scheduling, based on modifications of the classical
round-robin scheduler. Contrary to conventional belief, we show that
appropriate modifications of the weighted round-robin (WRR) service
discipline can, in fact, provide tight fairness properties and efficient
delay guarantees to multiple sessions. Two such modifications are
described: 1) list-based round robin, in which the server visits different
sessions according to a precomputed list which is designed to obtain the
desirable scheduling properties; 2) multiclass round robin, a version of
hierarchical round robin with controls designed for good scheduling
properties. The schemes considered are compared with well-known WFQ
schemes and with deficit round robin (a credit-based WRR), on the basis of
desirable properties such as bandwidth guarantees, fairness in excess
bandwidth sharing, worst-case fairness, and efficiency of latency (delay
guarantee) tuning. The scheduling schemes proposed and analyzed here
operate with fixed packet sizes, and hence can be used in applications
such as cell scheduling in ATM networks, time-slot scheduling on wireless
links as in GPRS air interface, etc. A credit-based extension of the
proposed schemes to handle variable packet sizes is also possible.",
URL="http://ieeexplore.ieee.org/iel5/90/27488/01224458.pdf?isNumber=27488\&prod=JNL\&arnumber=1224458\&arSt=+592\&ared=+601\&arAuthor=Chaskar\%2C+H.M.\%3B+Madhow\%2C+U."
}

@INPROCEEDINGS{Chat0305:Black,
AUTHOR="Gwyn Chatranon and Miguel Labrador and Sujata Banerjee",
TITLE="{BLACK} Detection and Preferential Dropping of High Bandwidth Unresponsive
Flows",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we present the BLACK scheme that aims to prevent the
unfairness problem generated by high bandwidth unresponsive flows. The
scheme needs to store only a small amount of state information to
maintain and exercises its fairness mechanism and utilizes a packet
sampling technique that estimates both the flow's buffer occupancy
fraction and the number of active flows. When working in conjunction
with RED, BLACK has shown not only to be able to handle unresponsive
traffic, but also improve the fairness among TCP connections with
different round trip delays."
}

@INPROCEEDINGS{Chat0305:Game,
AUTHOR="Mainak Chatterjee and Sajal Das and Kalyan Basu",
TITLE="A Game Theoretic Approach for Utility Maximization in {CDMA} Systems",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we  provide a game theoretic approach for
maximizing the utility of a carrier in a competitive market.
Due to the deregulation of the telecommunications industry
there are more than one service provider in any region.
This gives the users the flexibility to switch their
service provider if they are not satisfied with their service.
In this perspective, we propose an utility function based on
non-cooperative game  which considers the probabilities
of users leaving the network. We categorize users into three
classes who get differentiated services based on the price
they are willing to pay.  The game theoretic approach
allocates resources both during service admission and burst admission.
The utility function considered is from the service provider's
point of view.  Our model demonstrates the impact of admitting
high paying users on other users."
}

@INPROCEEDINGS{Chel0305:Comparative,
AUTHOR="Robin {Chellappa Doss} and Andrew Jennings and Nirmala Shenoy",
TITLE="A comparative study of mobility prediction in fixed wireless networks and
mobile ad hoc networks",
BOOKTITLE="ICC 2003 - Global Services and Infrastructure for Next Generation Networks",
ADDRESS="Anchorage, Alaska",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper we have introduced a mobility prediction scheme that proposes
the use of a new sector-based tracking of mobile users, with a sector
numbering scheme to predict user movements. The proposed scheme is
applicable for both the fixed network and the ad hoc networking
structures. Our study shows that accurate prediction is possible with
reduced area of tracking for both types of networks."
}

@INPROCEEDINGS{Chen0303:Efficient,
AUTHOR="Li-Wei Chen and Eytan Modiano",
TITLE="Efficient Routing and Wavelength Assignment for Reconfigurable {WDM}
Networks with Wavelength Converters",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We consider the problem of wavelength assignment in a reconfigurable
bi-directional ring network with wavelength converters.  We show that for
N-node P-port bidirectional rings, a minimum number of $\lceil PN/4
\rceil$ wavelengths are required to support all possible virtual
topologies in a rearrangeably non-blocking fashion, and provide an
algorithm that meets this bound for connected topologies using no more 
than $\lceil PN/2 \rceil$ wavelength converters.  This improves over the
tight lower bound of $\lfloor PN/3 \rfloor$ wavelengths required for such
rings given in [1] if no wavelength conversion is available. We also
provide another algorithm that uses more wavelengths yet requires
significantly fewer converters. Both algorithms are then extended to the
case of unconnected topologies using at most one additional wavelength.
Finally, we develop a method that allows the wavelength converters to be
arbitrarily located at any node in the
ring. This gives significant flexibility in the design of the networks.
For example, all $\lceil PN/2 \rceil$ converters can be collocated at a
single hub node, or distributed evenly among the N nodes with $\lceil P/2
\rceil$ converters at each node."
}

@INPROCEEDINGS{Chen0303:Large,
AUTHOR="William Cheng and Cheng-Fu Chou and Leana Golubchik and Samir Khuller and
Yung-Chun Wan",
TITLE="Large-scale Data Collection: a Coordinated Approach",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="In this paper we consider the problem of collecting a large amount
of data from several different hosts to a single destination in a
wide-area network. Often, due to congestion conditions, the paths
chosen by the network may be poor. By choosing an alternate route at
the application level, we may be able to obtain substantially higher
performance. This data collection problem is a non-trivial one
because the issue is not only to avoid congested link(s), but to
devise a *coordinated* transfer schedule which would afford maximum
possible utilization of available network resources. In this paper
we present an approach for computing coordinated data collection
schedules, which can result in significant performance improvements.
We make no assumptions about knowledge of the topology of the
network or the capacity available on individual links of the
network, i.e., we only use end-to-end information. Finally, we also
study the shortcomings of this approach in terms of the gap between
the theoretical formulation and the resulting data transfers in
wide-area networks. In general, our approach can be used for solving
arbitrary data movement problems over the Internet. We use the
Bistro platform to illustrate one application of our techniques.

Methods keywords:
System design, Simulations, Graph theory."
}

@INPROCEEDINGS{Chen0303:Modeling,
AUTHOR="Zesheng Chen and Lixin Gao and Kevin Kwiat",
TITLE="Modeling the Spread of Active Worms",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Active worms spread in an automated fashion and can flood the Internet in a
very short time. Modeling the spread of active worms can help us understand
how active worms spread, and how we can monitor and defend against the
propagation of worms effectively. In this paper, we present a mathematical
model, referred to as the Analytical Active Worm Propagation (AAWP) model,
which characterizes the propagation of worms that employ random scans. We
compare our model to the Epidemiological model and Weaver's simulator. Our
results show that our model can characterize the spread of worms
effectively. Taking the Code Red v2 worm as an example, we give a
quantitative analysis for monitoring, detecting and defending against
worms. Furthermore, we extend our AAWP model to understand the spread of
worms that employ local subnet scans. To the best of our knowledge, there
is no model for the spread of a worm that employs the localized scanning
strategy and we believe that this is the first attempt in understanding
local subnet scans quantitatively."
}

@ARTICLE{Chen0303:Performance,
AUTHOR="Sheng-Tzong Cheng and Chi-Ming Chen and Ing-Ray Chen",
TITLE="Performance evaluation of an admission control algorithm: dynamic threshold
with negotiation",
JOURNAL="Performance Evaluation",
VOLUME=52,
NUMBER=1,
PAGES="1-13",
MONTH=mar,
YEAR=2003,
REFERENCES=17,
KEYWORDS="Admission control; Negotiation; Multimedia systems; Stochastic Petri-Net;
Queuing theory",
ABSTRACT="An admission control algorithm for a multimedia server is responsible for
determining if a new request can be accepted without violating the QoS
requirements of the existing requests in the system. Most admission
control algorithms treat every request uniformly and hence optimize the
system performance by maximizing the number of admitted and served
requests. In practice, requests might have different levels of importance
to the system. Requests offering high contribution or reward to the system
performance deserve priority treatment. Failure of accepting a
high-priority request would incur high penalty to the system.

A novel threshold-based admission control algorithm with negotiation for
two priority classes of requests is proposed in our previous study. The
server capacity is divided into three partitions based on the threshold
values: one for each class of requests and one common pool shared by two
classes of requests. Reward and penalty are adopted in the proposed system
model. High-priority requests are associated with higher values of reward
as well as penalty than low-priority ones. In this paper, given the
characteristics of the system workload, the proposed analytical models aim
to finds the best partitions, optimizing the system performance based on
the objective function of the total reward minus the total penalty. The
negotiation mechanism reduces the QoS requirements of several low-priority
clients, by cutting out a small fraction of the assigned server capacity,
to accept a new high-priority client and to achieve a higher net earning
value. Stochastic Petri-Net model is used to find the optimal threshold
values and two analytical methods are developed to find sub-optimal
settings. The experiment results show that the sub-optimal solutions found
by the proposed analytical methods are very close to optimal ones. The
methods enable the algorithm to dynamically adjust the threshold values,
based on the characteristics of the system workload, to achieve higher
system performance.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-473W0B5-1-2N\&\_cdi=5663\&\_orig=browse\&\_coverDate=03\%2F31\%2F2003\&\_sk=999479998\&view=c\&wchp=dGLbVlz-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=aad8f69159ba37a1a7bbeef00d507012\&ie=f.pdf"
}

@ARTICLE{Chen0304:Fuzzy,
AUTHOR="Ping Chen and Tian-lin Dong",
TITLE="A fuzzy genetic algorithm for QoS multicast routing",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=6,
PAGES="506-512",
MONTH=apr,
YEAR=2003,
REFERENCES=16,
KEYWORDS="Fuzzy set; QoS multicast routing; Genetic algorithm",
ABSTRACT="It is impossible for nodes in an actual dynamic network to maintain the
global accurate network state information. Therefore, it is unreasonable
and inefficient to express the QoS constraints with deterministic crisp
values. In this paper, the QoS multicast routing problem is solved by use
of the generalized fuzzy-constrained fuzzy-optimization model. Both
imprecision of the network state information and the fuzziness of QoS
constraints are taken into account invoking fuzzy set theory. A new fuzzy
genetic algorithm for QoS multicast routing is also presented and
simulation experiments demonstrate that the algorithm is efficient.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-46SP0HB-2-4P\&\_cdi=5624\&\_orig=browse\&\_coverDate=04\%2F15\%2F2003\&\_sk=999739993\&view=c\&wchp=dGLbVlz-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=48a11c06d22574188ade3f4a7eae89d2\&ie=f.pdf"
}

@INPROCEEDINGS{Chen0305:Capacity,
AUTHOR="Jay Cheng and Toby Berger",
TITLE="Capacity and Performance Analysis for Hybrid Selection/Maximal-Ratio
Combining in",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We consider a hybrid selection/maximal-ratio combining (HS/MRC)
diversity system and assume independent Nakagami fading on the
diversity branches with unequal fading parameters and unequal
signal-to-noise ratios (SNR's).
We use the virtual branch technique and two series expressions for
the characteristic function (CF) of the sum of independent gamma
random variables to derive closed-form expressions for the CF, the
probability density function (PDF), the mean, and the variance of
the instantaneous combiner output SNR.
We also obtain closed-form expressions for the outage probability,
the channel capacity under different transmission policies, and
the average symbol error probability (SEP) for a general class of
$M$-ary modulation schemes (including MPSK, MQAM, BFSK, and MSK)
with coherent detection.
Our approach provides a \emph{canonical structure} for the
closed-form expressions as a weighted sum of elementary
closed-form expressions, which are the closed-form expressions for
a single-branch system in different Nakagami fading environments."
}

@INPROCEEDINGS{Chen0305:Efficient,
AUTHOR="Yie-tarng Chen",
TITLE="An Efficient Packet Classification Algorithm for Network Processors",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The exponential growth in optical link speed has stressed the 
performance of routers and switches. Consequently, a new breed of
microprocessor, called Network Processors, are designed and fabricated 
specifically to effectively process packets on switches and router.
Packet classification is a major function in network processors to fit 
requirements of next-generation Internet. In this paper, we present a
 hardware-based packet classification algorithm for network processors.
 The innovative aspect of the proposed algorithm is to use the prior
 knowledge of rule characteristics to customize the structure of packet
 classifiers. First, we use divide-and-conquer approach to partition
 rules into several clusters and perform parallel search in different
 clusters. Then, we encode each rule into shorter bit string to prune
 unnecessary search. Finally, we employ level compression scheme to
 accelerate the lookup time. By running an intensive computer
 simulation, we show that the performance of the proposed algorithm can
 achieve 8 million packets per second even in the worst-case, when
 implemented by 549 KB 10-ns SRAM for 20000 four-dimensional rules.
 This result demonstrates the proposed scheme is superior to previous
approaches."
}

@INPROCEEDINGS{Chen0305:Iterative,
AUTHOR="Hangjun Chen and Alexander Haimovich",
TITLE="An Iterative Method to Restore the Performance of Clipped and Filtered
{OFDM} Signals",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Clipping is an efficient and simple method to reduce the peak-to-average
power ratio (PAPR) of OFDM signals. However, clipping causes distortion
and out-of-band radiation. In this paper, a novel iterative receiver is
proposed to estimate and cancel the distortion caused by clipping noise.
The proposed method is applied to clipped and filtered OFDM signals. It is
shown by simulation that for an 802.11a system, the PAPR can be reduced to
as low as 4 dB while the system performance can be restored to within 1 dB
of the non-clipped case with only moderate complexity increase and with no
bandwidth expansion."
}

@INPROCEEDINGS{Chen0305:New,
AUTHOR="Shi-Yang Chen and Yi-Shuang Chen and Hsiao-Kuang Wu",
TITLE="A New Approach Using Time-Based Model for TCP-Friendly Rate Estimation",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In the growing Internet, the end-to-end congestion control often relies on
the transport protocol, and TCP is satisfying the requirement for
traditional data applications. Alternatively, for the multimedia streaming
applications, RTP/RTCP suite is considered, instead of TCP, to provide the
end-to-end streaming quality and congestion control. However, there still
are research and implementation problems of applying RTP/RTCP. Two
significant factors are the performance of longer periodic control, and
the friendliness to TCP on the rate adjustment. To satisfy these two
criteria, this paper proposes a rate estimation scheme based on the
packets loss ratio and jitter ratio sampling at the RTP/RTCP-like receiver
and adopting the time-based TCP model. The 'time-based' model is a rate
equation of time variables, while the existing model, named
'packet-based', is another equation of the variables of packet counting.
The meaning of the rate estimation is that for one connection of a
particular sending rate, the receiver can closely estimate the average
transmission rate of other TCP flows in competition. The simulation
results show that our rate estimation approach conducts good estimation,
and can be the basis of rate adjustment and congestion control."
}

@INPROCEEDINGS{Chen0305:Nice,
AUTHOR="Anderson Chen and Yan-Xiu Zheng and Bill Yang and Li-Chun Wang and David
Wei and Yu Ted Su",
TITLE="{NICE-A} Decentralized Medium Access Control Using Neighborhood Information
Classification and Estimation",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The desired properties of an IEEE 802.11 medium access control (MAC)
protocol include 1) meet quality of service (QoS) requirements for
real-time nodes, 2) be decentralized, 3) achieve fairness among
non-real-time nodes, and 4) be immune to the hidden node problem. Though
there have been numerous proposed MAC protocols for 802.11 WLAN, none of
them possesses all of the above four properties. Each of them was designed
aiming at either providing QoS guarantees for real-time nodes or achieving
fairness among non-real-time nodes. In this paper, we propose a new
802.11-compliant MAC scheme satisfying all of above four properties. Our
protocol can support constant bit rate real-time traffic and satisfy QoS
requirements, and thus can be employed for multimedia applications. Also,
since our protocols operation is compliant with that of 802.11 DCF without
using any centralized control, it can be easily deployed in an Ad Hoc
environment.  When scheduling data packets, we also take
location-dependent contention into account to reduce access delay for
non-real-time nodes and avoid the hidden node problem. The superiority of
our protocol over those existing ones is demonstrated in terms of channel
throughput and access delay via simulations using the ns-2 simulator. An
analytic model of the protocol's throughput has also been developed. We
compare the protocol's throughput obtained from its analytic model and
simulation to validate each other."
}

@INPROCEEDINGS{Chen0305:Performance,
AUTHOR="Yang Chen and Hongyi Wu and Dahai Xu and Chunming Qiao",
TITLE="Performance Analysis of Optical Burst Switched Node with Deflection Routing",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="As the optical network evolves from static long haul connection provider to
an adaptive and °smart?backbone solution, Optical Burst Switching (OBS)
becomes an attractive scheme for its flexibility and
efficiency. However, how to reduce data loss is a crucial issue in such an
asynchronous and one way
reservation system. In this paper, we study one contention resolution
scheme in OBS networks: deflection
routing. We extend an existing work to provide approximate models as well
as accurate ones for
single OBS node¯s performance with and without wavelength conversion
capability. The accuracy of our
models are evaluated by simulation results."
}

@INPROCEEDINGS{Chen0305:Setting,
AUTHOR="Kai Chen and Klara Nahrstedt and Yuan Xue",
TITLE="On Setting TCP's Congestion Window Limit in Mobile Ad Hoc Networks",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Improving TCP performance has long been the focus of many research
efforts in mobile ad hoc networks (MANET). In this paper, we
address one aspect of this endeavor: how to properly set TCP's
congestion window limit (CWL) to achieve optimal performance. Past
research has shown that using a small CWL improves TCP performance
in certain scenarios \cite{GTB99,FZLLZG03}, however, no
comprehensive study has been given.
 
To this end, we turn the problem of setting TCP's optimal CWL into
identifying the bandwidth-delay product (BDP) of a path in MANET.
We first show and prove that, independent of the MAC layer protocol
being used, the BDP of a path in MANET cannot exceed the round-trip
hop-count (RTHC) of the path. We further refine this upper bound
based on the IEEE 802.11 MAC layer protocol, and show that in
a chain topology, a tighter upper bound exists which is approximately
$1/5$ of the RTHC of the path. Based on this tighter bound,
we propose an adaptive CWL setting strategy to dynamically
adjust TCP's CWL according to the current RTHC of its path.
Using ns-2 simulations, we show that our simple strategy improves
TCP performance by 8\\% to 16\\% in a dynamic MANET environment."
}

@INPROCEEDINGS{Chen0305:Theoretical,
AUTHOR="Gang Cheng and Nirwan Ansari",
TITLE="A Theoretical Framework for Selecting the Cost Function for Source Routing",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Finding a feasible path subject to multiple constraints in a network is an
NP-complete problem and has been extensively studied. Many proposed source
routing algorithms tackle this problem by transforming it into the shortest
path selection problem, which is P-complete, with an integrated cost
function that maps the multi-constraints of each link into a single cost.
However, how to select an appropriate cost function is an important issue
that has rarely been addressed in literature. In this paper, we provide a
theoretical framework for picking a cost function that can improve the
performance of source routing in terms of complexity, convergence, and
probability of finding a feasible path."
}

@INPROCEEDINGS{Chen0306:Adaptive,
AUTHOR="Songqing Chen and Bo Shen and Susie Wee and Xiaodong Zhang",
TITLE="Adaptive and Lazy Segmentation Based Proxy Caching for Streaming Media
Delivery",
BOOKTITLE="ACM NOSSDAV 2003",
ADDRESS="Monterey, California, USC",
DAYS=1,
MONTH=jun,
YEAR=2003,
ABSTRACT="Streaming media objects are often cached in segments. Previous
segment-based caching strategies cache segments with a constant or an
exponentially increased length and always favor the caching of the
beginning segments of media objects. But the fact that a lot of
accesses are targeted to a few popular objects is not well
considered. In this paper, we argue that neither the use of a predefined
segment length nor the favorable caching of the beginning segments is
the best caching strategy for reducing the server traffic. We propose an
adaptive and lazy segmentation based caching mechanism by delaying the
segmentation as late as possible and determining the segment length
based on the client access behaviors at real time. In addition, the
admission and eviction of the segment are carried out adaptively based
on an accurate utility function. The proposed method is evaluated by
simulations using traces including one from real enterprise server logs.
Simulation results indicate that our proposed method achieves about 30\%
more network traffic reduction."
}

@ARTICLE{Chen0309:ACES,
AUTHOR="Xiangping Chen and Huamin Chen and Prasant Mohapatra",
TITLE="{ACES:} An efficient admission control scheme for QoS-aware web servers",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=14,
PAGES="1581-1593",
MONTH=sep,
YEAR=2003,
REFERENCES=17,
KEYWORDS="Admission control; Bounded response time; Internet; Admission control based
on estimation of service time; QoS; Service differentiating Internet
servers",
ABSTRACT="The unpredictability of server response performance hinders the advance of
new application on the Internet. In this paper, we present an efficient
admission control algorithm, ACES, based on the server workload
characteristics. The admission control algorithm ensures the bounded
response time from a web server by periodical allocation of system
resources according to the resource requirements of incoming tasks. By
rejecting requests exceeding server capacity, the response performance of
the server is well maintained even under high system utilization. The
resource requirements of tasks are estimated based on their types. A
double-queue structure is implemented to reduce the effects caused by
estimation inaccuracy, and to exploit the spare capacity of the server,
thus increasing the system throughput. The admission control algorithm can
be used for server overload control and for QoS provisioning of service
differentiating Internet servers. Response delays of accepted tasks are
bounded by the desired predefined time period. Theoretical analyses and
experimental studies show that the ACES algorithm provides desirable
throughput and bounded response delay to the tasks, without any
significant impact on the aggregate throughput performance of the system
under various workload situations.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47VHBFH-1-3X\&\_cdi=5624\&\_orig=browse\&\_coverDate=09\%2F01\%2F2003\&\_sk=999739985\&view=c\&wchp=dGLbVzb-zSkWW\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=8a2ed3a2cfd4a1653e355bc57b0162f3\&ie=f.pdf"
}

@ARTICLE{Chen0309:Trends,
AUTHOR="Thomas Chen",
TITLE="Trends in Viruses and Worms",
JOURNAL="Internet Protocol Journal",
VOLUME=6,
NUMBER=3,
MONTH=sep,
YEAR=2003,
REFERENCES=21,
ABSTRACT="The modern computer virus was conceived and demonstrated by Fred Cohen in
1983. Like biological viruses, computer viruses reproduce by attaching to
a normal program or document and taking over control of the execution of
that program to infect other programs. Early viruses could spread slowly
mostly by floppies (such as the 1986 Brain virus), but the Internet has
made it much easier for viruses to move among computers and spread
rapidly. Networks have created a fertile environment for worms, which are
related to viruses in their ability to self-replicate but are not attached
to other programs. Worms are particularly worrisome as standalone automated
programs designed to exploit the network to seek out vulnerable computers.
The term worm was originated by John Shoch and Jon Hupp during their
experiments on mobile software at Xerox PARC in 1979, inspired by the
network-based tapeworm monster in John Brunner's novel, The Shockwave
Rider [1]. Shoch and Hupp thought of worms as multisegmented programs
distributed across networked computers.",
URL="http://www.cisco.com/warp/public/759/ipj\_6-3/ipj\_6-3\_virus.html"
}

@INPROCEEDINGS{Cheu0309:Alpha,
AUTHOR="Patrick Cheung and Nick Maxemchuk",
TITLE="Alpha Tree in Sensor Network",
BOOKTITLE="New York Metro Area Networking Workshop 2003",
ADDRESS="Bern Dibner Library Building, LC400,  Polytechnic University,  5 Metrotech
Cente",
DAYS=12,
MONTH=sep,
YEAR=2003,
ABSTRACT="When data is not aggregated or compressed, the routing structure that uses
the least energy to transmit the data from the sensors to a destination is
a minimum depth tree (MDT) that is rooted at the sink, with link weights
indicating the energy needed to transmit on a link. In contrast, when the
information from multiple sensors is completely redundant, only one unit
of message is forwarded to the destination, regardless of the number of
incoming messages. The tree that uses the least energy to collect the data
in this case is a minimum spanning tree (MST). In most cases, the data from
multiple sensors is not completely redundant, but has some redundancy. In
the alpha tree algorithm, a single parameter alpha can be adjusted
according to different levels of data redundancy in order to find routes
that minimize the overall energy consumption."
}

@INPROCEEDINGS{Chev0305:Dynamic,
AUTHOR="Pierre Chevillat and Jens Jelitto and Andre Barreto and Hong Linh Truong",
TITLE="A Dynamic Link Adaptation Algorithm For {IEEE} 802.11a Wireless LANs",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper we present a simple but powerful dynamic link adaptation
mechanism for wireless LANs, which is compliant to the IEEE 802.11a
standard. Using this method, a transmitter is able to detect whether the
quality of the link is improving or deteriorating and, based on this
information, to switch to a higher or lower transmission rate
respectively. For determining the link quality, the transmitter employs
only information that is available locally. Therefore, the proposed method
can be implemented without changes or enhancements to the current IEEE
802.11 standard. The efficiency of our method is investigated and
evaluated by means of simulations."
}

@INPROCEEDINGS{Chey0305:Performance,
AUTHOR="Jan Cheyns and Erik {Van Breusegem} and Chris Develder and Ann Ackaert and
Mario Pickavet and Piet Demeester",
TITLE="Performance Improvement of an Internally-Blocking Optical Packet/Burst
Switch",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Optical packet/burst switching is considered a promising technique to
improve the performance of optical networks.  Key components in these
technologies are the optical switching nodes.  Some of these node
architectures suffer from internal blocking.  Synchronous operation allows
overcoming most of the problems introduced by this internal blocking. 
However, in asynchronous networks internal blocking can be a much more
limiting factor.  In this paper we propose a windowing tech-nique to
improve the performance of internally blocking optical switching nodes in
asynchronous operation.  Simulations will show significant improvements
can be made."
}

@INPROCEEDINGS{Chha0305:Controlling,
AUTHOR="Parminder Chhabra and Ajita John and Rajeev Shorey and Huzur Saran",
TITLE="Controlling Malicious Sources at Internet Gateways",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Internet Gateways drop packets in the event of congestion.
While TCP is designed to back off in response to such packet
drops, there are flows from sources in the internet that are
not TCP-compliant. These flows do not back off in response to
packet drops and as a result, consume a larger share of the
bandwidth. This paper describes an algorithm to control
malicious sources in a simple and lightweight fashion that
does not maintain per-flow state information. The paper also
presents an analysis of the algorithm and the experimental
results from the simulations that demonstrate that the
algorithm outperforms current well-known algorithms for
buffer management in providing better protection for TCP
flows under varying degrees of attack from non-adaptive flows."
}

@INPROCEEDINGS{Chia0305:Performance,
AUTHOR="Kuo-Hsing Chiang and Nirmala Shenoy",
TITLE="Performance of an overlapped Macro-cell based location Area scheme",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we define a new location area for location management in
wireless networks. Location management schemes comprise of location update
and terminal paging. Efforts to introduce efficient location update schemes
results in increased paging costs and vice-versa. Dynamic Location Area
(LA) schemes, which are per-user and mobility pattern based were proposed
to overcome the problems of frequent location updates made by users in the
LA boundary. In this work we propose a Base Station Controller (BSC) based
scheme, which is a static scheme, but reduces the effect of frequent
location updates at the boundary, by using the overlap concept. The
proposed LA, normally under the control of one BSC overlaps with adjacent
LAs. We evaluate the scheme and compare it with other popular schemes like
movement-based and distance-based LA schemes, which are more complex to
implement. Though this type of BSC- based overlapped LA would result in
minimal paging costs also, if the paging control were maintained at the
BSC, the results of paging analysis have not been provided here due to
space limitations. This scheme is simple to implement and has considerably
reduced signalling traffic and associated costs. Another major contribution
in this work is the extension of a mobility model, to study the location
update rates in an overlapped LA approach, which is difficult to
analytically model"
}

@INPROCEEDINGS{Chie0305:Performance,
AUTHOR="Feng-Tsun Chien and Chien-Hwa Hwang and C.C. Jay Kuo",
TITLE="Performance of Asynchronous Long-Code Multicarrier {CDMA} Systems in the
Presence of Correlated Fading and Inter-carrier Interference",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The effect of inter-carrier interference (ICI) and aperiodic
random spreading sequences on the performance of asynchronous
multicarrier code division multiple access (CDMA) systems with
correlated fading is investigated in this research. Random
parameters including asynchronous delays, correlated Rayleigh
fading and spreading sequences are averaged to determine the
unconditional covariance matrix of the interference-plus-noise
vector. An analytic expression for the bit error probability is
obtained based on the Gaussian approximation. Then, we extend the
result by considering situations where eigenvalues are not
necessarily all identical or distinct. Finally, design tradeoffs
among the number of sub-carriers, fading correlations, ICI and
multipath effect are presented in simulation results."
}

@INPROCEEDINGS{Chin0305:Improve,
AUTHOR="Yoon-Tze Chin and Shiro Handa and Fumihito Sasamori and Shinjiro Oshita",
TITLE="Improve {TCP} Performance Over {ATM-UBR} with {FED}",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We have proposed a fuzzy logic-based buffer management scheme (BMS) called
fuzzy early detection (FED) to improve transmission control protocol (TCP)
performance over the unspecified bit rate service of asynchronous transfer
mode networks. FED uses early congestion detection and selective packet
discard strategies to achieve its design goals, and adopts early packet
discard (EPD) to prevent frequent buffer overflows. Its performance is
compared with those of pure EPD and P-random early detection (P-RED)
through various simulations. The effects of TCP implementation, TCP
maximum segment size, switch buffer size and network propagation delay on
their performances are studied. If the issues of efficiency, fairness,
robustness, ease of tuning parameters, and buffer requirement of a BMS are
considered collectively, we conclude that FED is better than the others."
}

@INPROCEEDINGS{Chir0305:Agent,
AUTHOR="Mohan Chirumamilla and Byrav Ramamurthy",
TITLE="Agent Based Intrusion Detection and Response System for Wireless LANs",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Wireless LAN technology, despite the numerous advantages it has over its
competing technologies, has not seen widespread deployment. The one and
only reason for markets not adapting to this technology is its failure to
provide adequate security. Data that is sent over wireless links can be
compromised with utmost ease. In this project, we propose a
distributed agent based intrusion detection and response system for
wireless LANs that can detect unauthorized wireless elements like access
points, wireless clients that are in promiscuous mode etc. The system
reacts to intrusions by either notifying the concerned personnel, in case
of rogue access points and promiscuous nodes, or blocking unauthorized
users from accessing the network resources."
}

@INPROCEEDINGS{Chit0305:Dynamic,
AUTHOR="Francesco Chiti and Romano Fantacci and Giada Mennuti and Daniele Tarchi",
TITLE="Dynamic {SIR} Based Admission Control Algorithm for {3G} Wireless Networks",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Next generation wireless systems, as Universal Mobile Telecommunications
System (UMTS), aim at revolutionizing the actual wireless communication
paradigm offering real time multimedia services now available on fixed
terminals whose Quality of Service (QoS) requirements could be satisfied
by network resources adaptation to traffic conditions. Since radio
interface is based on CDMA technology, this system suffers from mutual
interference among active connections. Approximately, the communication
quality decreases at the increasing of active users number. As a
consequence, there exists an active user threshold below which an
intolerable QoS degradation is produced, especially for those applications
named in 3GPP standard as Interactive or Background. Therefore, proper
Admission Control (AC) algorithms that mitigate mutual interference by
keeping active users under a dynamic threshold, is a crucial topic in UMTS
system optimization. 

This paper deals with an advanced AC scheme proposal that estimates the
requesting connections Signal to Noise plus Interference Ratio (SINR) by
means of accurate Multiple Access Interference (MAI) analysis results.
Basically, this algorithm verifies the possibility of a new call admission
by valuating if an overall power configuration there exists, whose
predicted SINR values satisfy each QoS constraints. Whenever a new
connection is accepted, a further optimization is performed in order to
allow a QoS higher than the requested value under a maximum radiated power
constraint. This value is delivered to Power Control (PC) algorithm jointly
with the associated SINR value. Numerical simulations, closely related to
an UMTS system, underline a remarkable number of active users increase up
to four times traditional AC policies, together with the maximisation of
QoS requirements."
}

@INPROCEEDINGS{Chit0305:Soft,
AUTHOR="Francesco Chiti and Romano Fantacci and Farncesco Versaci and Tommaso
Pecorella",
TITLE="Soft Combining Hybrid {ARQ} Techniques Application to {3G} Wireless Packet
Networks",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper deals with the application of Hybrid Automatic Repeat reQuest
(H-ARQ) techniques to reliable data communications in wireless 3G
networks, whose typical applications have to match accurate Quality of
Service (QoS) requirements. A common approach to guarantee such services
enhances the H-ARQ features by exploiting turbo codes error correction
capabilities. This paper, following the previous approach, investigates
the further benefits achieavable by developing a strategy that
estabilishes a connection between packet retransmissions and decoding
results. Two kind of these techniques, belonging to soft recombining
schemes, are proposed and applied, respectively, to consecutive received
packet replicas, or to decoding algorithm outputs, in both cases, without
remarkable hardware complexity increase.

By means of analytical derivations and simulations, focused on a typical
Universal Mobile Telecommunication System (UMTS) environment, a noticeable
Bit Error Rate (BER) and, then, Frame Error Rate (FER) improvements have
been shown. For the proposed schemes, whenever communications suffer from
low Signal to Noise Ratio (SNR) values, a significant link throughput
increase is also pointed out. As a consequence, these techniques can
assure a lower packet delivery delay, besides to avoiding transmitted
power wasting, if compared with protocols commonly used in wired networks."
}

@INPROCEEDINGS{Choe0303:Stabilized,
AUTHOR="Hyojeong Choe and Steven Low",
TITLE="Stabilized Vegas",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We show that the current TCP Vegas algorithm can
become unstable in the presence of network delay and propose
a modification that stabilizes it. The stabilized Vegas remains
completely source-based and can be implemented without any
network support. We suggest an incremental deployment strategy
for stabilized Vegas when the network contains a mix of links,
some with active queue management and some without."
}

@INPROCEEDINGS{Choi0305:Adaptive,
AUTHOR="Ji-Woong Choi",
TITLE="Adaptive channel estimation in {WCDMA} {STTD} systems",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The receiver performance with the use of a space time transmit diversity
(STTD) scheme is more susceptible to the accuracy of channel estimate than
that without the use of the STTD scheme since the despreading signals
suffer from the effect of crosstalk and the transmit power is equally
divided into multiple transmit antennas. As a result, the efficiency of
channel estimation in the WCDMA STTD system becomes an important issue
more than that in the non-STTD system. In this paper, an adaptive channel
estimator is designed to mitigate the performance degradation due to
inaccurate channel estimation. Numerical results show that the performance
improvement significantly increases with the use of the proposed ACE,
particularly when the channel condition becomes worse."
}

@INPROCEEDINGS{Choi0305:Adaptive,
AUTHOR="Baek-Young Choi and Jaesung Park and Zhi-Li Zhang",
TITLE="Adaptive Random Sampling for Traffic Load Measurement",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Traffic  measurement  and  monitoring  is an  important  component  of
network  QoS  management  and  traffic engineering.   With  high-speed
Internet  backbone  links,  efficient  and effective  packet  sampling
techniques  for  traffic  measurement  and  monitoring  are  not  only
desirable, but  increasingly becoming a necessity.  In  this paper, we
propose and analyze an adaptive random packet sampling technique
for traffic load measurement. In particular, we address the problem of
bounding sampling error within a pre-specified tolerance level.
We derive  a relationship  between the number  of packet  samples, the
accuracy of  load estimation and the squared  coefficient of variation
of packet size distribution.  Based on this relationship, we propose a
sampling  technique   that  determines  the   minimum  sampling
probability  adaptively  according to  traffic  dynamics.  Using  real
network  traffic traces,  we show  that the  proposed  adaptive random
sampling technique  indeed produces  the desired accuracy,  while also
yielding significant  reduction in the amount of  traffic samples, yet
simple to implement."
}

@INPROCEEDINGS{Choi0305:Configuring,
AUTHOR="Sumi Yunsun Choi and Jonathan Turner",
TITLE="Configuring Sessions in Programmable Networks with Capacity Constraints",
BOOKTITLE="ICC 2003 - Global Services and Infrastructure for Next Generation Networks",
ADDRESS="Anchorage, Alaska",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT={The provision of advanced computational services within 
networks is rapidly becoming both feasible and economical.
As computational services become popular,
it is important to have effective methods for configuring 
application sessions so that they use resources efficiently.

In this paper, we discuss the problem of configuring application
sessions that require intermediate processing.
The problem was introduced in an earlier paper,
where we showed how to optimally configure sessions 
in programmable networks by reducing the session configuration problem 
to the problem of finding a shortest path in a special graph constructed
for the particular problem. This {"}layered graph method{"} is quite
flexible
and can handle a variety of specific session configuration problems.
However, it does not explicitly model limits on link bandwidth or
processing capacity. In this paper,
we show that the optimal session configuration problem is NP-hard when
capacity is constrained. Nevertheless, we have found efficient
heuristics for which the network performance closely approximates the
performance that can be achieved with optimal session configurations.}
}

@INPROCEEDINGS{Choi0305:Ieee,
AUTHOR="Sunghyun Choi and Javier {del Prado Pavon} and Saishankar Nandagopalan and
Stefan Mangold",
TITLE="{IEEE} 802.11e Contention-Based Channel Access {(EDCF)} Performance
Evaluation",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="IEEE 802.11e Medium Access Control (MAC) is an emerging supplement to the
IEEE 802.11 Wireless Local Area Network (WLAN) standard to support
Quality-of-Service (QoS). The 802.11e MAC is based on both
centrally-controlled and contention-based channel accesses. In this paper,
we evaluate the contention-based channel access mechanism, called enhanced
distributed coordination function (EDCF), in comparison with the 802.11
legacy MAC. The EDCF provides differentiated channel access to frames with
different priorities. We also consider an extension to the EDCF, called
EDCF bursting, that allows multiple MAC frame transmissions during a
single transmission opportunity (TXOP). Through our simulation study, with
realistic home networking traffic scenarios, EDCF bursting is found to
enhance the system performance by increasing the overall system throughput
and achieving more acceptable streaming quality in terms of frame losses
and delays."
}

@INPROCEEDINGS{Choi0305:Qos,
AUTHOR="Young-June Choi",
TITLE="QoS Scheduling for Multimedia Traffic in {CDMA} Data Networks",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="CDMA data networks such as cdma2000 1x EV-DO are proposed in the midst of
evolving to the 3rd generation wireless networks.
The design goal of them is to support high data rates, and it uses time
division multiplexing and rate control that needs downlink scheduling to
increase the system capacity. 
As the system needs to support various services including multimedia
traffic eventually, 
we need to have a proper criterion for scheduling that can count various
service requirements - delay bound or loss rate.
Therefore we visit the concept of 
the utility and opportunity cost considering not only delay but also data
loss. 
We design an algorithm to schedule the job having maximum profit that
equals its utility minus the opportunity cost about the other's utility.
The simulation results show that it provides 
appropriate QoS - delay bound and loss rate for various traffic."
}

@INPROCEEDINGS{Choi0305:Throughput,
AUTHOR="Kwonhue Choi",
TITLE="Throughput and optimum parameters of {FHMA} system with multilevel {FSK}",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Optimization for system parameters including the modulation order,
diversity order and traffic density   to maximize the network throughput
of FHMA networks with multi-level FSK is performed. Theoretical limit on
the throughput and optimal system parameters are derived. We also
indicated the analogy in multiple access channel model between the
considered system and the conventional synchronous fast FHMA
system with MFSK modulation."
}

@INPROCEEDINGS{Choi0305:Unscented,
AUTHOR="Jongsoo Choi and Antonio Lima",
TITLE="Unscented Kalman Filter-Trained Recurrent Neural Equalizer for Time-Varying
Channels",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Recurrent neural networks have been successfully applied to communications
channel equalization because of their modelling capability for nonlinear
dynamic systems. Major problems of gradient descent learning techniques
commonly employed to train recurrent neural networks are slow convergence
rates and long training sequences required for satisfactory performance.
This paper presents a decision feedback equalizer using a recurrent neural
network trained with unscented Kalman filter (UKF). The main features of
the proposed recurrent neural equalizer are fast convergence and good
performance using relatively short training symbols. Experimental results
for various time-varying channels are presented to evaluate the
performance of the proposed approaches over a conventional recurrent
neural qualizer."
}

@PROCEEDINGS{Choi0308:EuroPar,
AUTHOR="Jong-Mu Choi and Jin-Seok Choi and Jai-Hoon Kim and Young-Bae Ko",
TITLE="Energy Efficient Algorithm for Disconnected Write Operation in Mobile Web
Environmets",
ORGANIZATION="ACM/IFIP",
PUBLISHER="Springer-de",
ADDRESS="EuroPar",
MONTH=aug,
YEAR=2003,
ABSTRACT="Because wireless links are subject to disturbance and failures, supporting
disconnected operations is important issues in mobile computing research.
Many algorithms have been proposed for supporting the efficient
disconnected operations to continue performing task with a low
communication cost and are focused on how the mobile client-server model
can be adapted to the dynamic wireless environments. However, energy
efficient algorithms are also important in mobile computing environments
since mobile devices are powered by battery. In this paper, we propose
energy efficient algorithm for disconnected write operations in mobile Web
environments and develop analytical models with the goal of saving
energy-consumption.",
URL="http://dmc.ajou.ac.kr/paper/EuroPar03\_jmc.pdf"
}

@PROCEEDINGS{Choi0309:PWC,
AUTHOR="Jong-Mu Choi and Young-Bae Ko and Jai-Hoon Kim",
TITLE="Enhanced Power Saving Scheme for {IEEE} {802.11} {DCF} based Wireless
Networks",
ORGANIZATION="IFIP",
PUBLISHER="Springer-de",
ADDRESS="International Conference on Personal Wireless Communication 2003",
MONTH=sep,
YEAR=2003,
ABSTRACT={Providing energy efficiency in MAC (Medium Access Control) layer, while
achieving desirable throughput, is an important research issue in the area
of wireless networking. A wireless LAN such as IEEE 802.11 using the
Distributed Coordination Function (DCF) also provides a mechanism for
power conservation which allows each node to {"}sleep{"} for some amount
of periods, but also requires the nodes to wake up periodically and stay
{"}awake{"} for a certain duration called the ATIMWindow. In this paper,
we propose a new energy-efficient MAC protocol that allows the nodes to go
to sleep early, 
without the need to be {"}on{"} for the whole ATIM interval, in the case
they are acknowledged that no data is buffered within an ad hoc network
and therefore no data transmission will be taken place.},
URL="http://dmc.ajou.ac.kr/paper/pwc03\_jmc.pdf"
}

@INPROCEEDINGS{Chou0303:Distributed,
AUTHOR="Jim Chou and Dragan Petrovic and Kannan Ramchandran",
TITLE="A Distributed and Adaptive Signal Processing Approach to Reducing Energy
Consumption in Sensor Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We propose a novel approach to reducing energy consumption in sensor
networks using a distributed adaptive signal processing framework and
efficient algorithm. While the topic of energy-aware routing to
alleviate energy consumption in sensor networks has received attention  
recently, in this paper, we propose an orthogonal approach to
previous methods. Specifically, we propose a distributed way of
continuously exploiting existing correlations in sensor data based on 
adaptive signal processing and distributed source coding principles.  
Our approach enables sensor nodes to blindly compress their readings 
with respect to one another without the need for explicit and 
energy-expensive inter-sensor communication to effect this compression.  
Furthermore, the distributed algorithm used by each sensor node is low
in complexity and easy to implement, while an adaptive filtering
framework is used to continuously learn the relevant correlation
structures in the sensor data.  Our simulations show the power of our 
proposed algorithms, revealing their potential to effect significant 
energy savings (from 15\%-40\%) for typical sensor data corresponding to 
a multitude of sensor modalities."
}

@ARTICLE{Chou0304:Analysis,
AUTHOR="Gagan Choudhury",
TITLE="Analysis of combined voice/data/video operation in cable and {DSL} access
networks: graceful degradation under overload",
JOURNAL="Performance Evaluation",
VOLUME=52,
NUMBER="2-3",
PAGES="89-103",
MONTH=apr,
YEAR=2003,
REFERENCES=14,
KEYWORDS="Cable; DSL; Combined voice/data/video operation; Markov chain; Bufferless
and buffered models; Quality of service; Graceful degradation",
ABSTRACT={We develop exact models to analyze the performance of several types and
grades of data, voice and video sessions over a cable or DSL-based access
network. Each session is characterized by a minimum guaranteed data-rate
and a maximum allowed data-rate. Sessions would normally transmit at the
maximum rate but under congestion some or all sessions would see graceful
rate degradation. For each class the blocking probability, the average
data-rate attained by a session, the probability that the attained
data-rate exceeds a certain target value, and the data-rate that is
exceeded a certain target percent of the time are computed. In addition, a
system-wide probability of data-rate degradation is also computed. A
bufferless model with product-form structure and insensitivity to session
holding time distribution except through mean (heavy-tailed distributions
are allowed), and a buffered model with standard Markov chain structure
are developed. The models are also generalized to allow data-rate
degradation of real-time streaming traffic (e.g., switch from G.711 to
G.728 encoding or turn on silence suppression) whenever the total
bandwidth usage exceeds a certain threshold. Whenever a model is sensitive
to session holding time distribution, that sensitivity is studied through
simulations. Several numerical examples are given to illustrate the use of
the models in providing quality of service mechanisms over the {"}last
mile{"} of access.},
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-47CXJPG-2-40\&\_cdi=5663\&\_orig=browse\&\_coverDate=04\%2F30\%2F2003\&\_sk=999479997\&view=c\&wchp=dGLbVtb-zSkWW\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=29d40bf2ae0cccd462f72efdce0e6e32\&ie=f.pdf"
}

@INPROCEEDINGS{Chou0305:Multihomed,
AUTHOR="Li-Der Chou and Chi-Chia Kao",
TITLE="Multihomed Network Fault Management Systems Using Multiple Mobile Agents",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="One of the modern network management concepts is to
separate the management network
              from the transport network. As the management network
manages
multiple transport networks
              at a time, or so-called multihomed, any transport network is
the backup of other transport
              networks. For the increasing of the network complexity, it
is
not easy to exactly determine
              where the network fault is. Using the characteristic of
multihoming, the paper proposes a
              scheme to identify the network faults, where six types of
mobile agents are developed to
              cooperate to provide fault management functions. Moreover,
the
characteristics of mobility,
              intelligence and flexibility help the proposed scheme to
identify the faults quickly. Besides,
              the proposed scheme is implemented on National Broadband
Experimental Network (NBEN) and
              Taiwan Research Network (TANet2), where the two
interconnected
networks have their own routing
              policies, but are managed by the common mobile-agent-based
network management network.
              Experimental results show that the ping monitoring agent
implemented in the proposed network
              fault management system has a 59.66\% reduction in the time
of
monitoring the whole NBEN
              network."
}

@INPROCEEDINGS{Chu0303:Dynamic,
AUTHOR="Xiaowen Chu and Bo Li",
TITLE="A Dynamic {RWA} Algorithm in a Wavelength-Routed All-Optical Network with
Wavelength Converters",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Existing research demonstrated that an effective Routing and Wavelength
Assignment (RWA) scheme and a wavelength converter placement algorithm are
the two primary vehicles for improving the blocking performance in a
wavelength-routed all-optical network. However, these issues have largely
been investigated separately, in particular, the RWA has seldom considered
the existence of wavelength converters. In this paper, we argue perhaps for
the first time, that an effective RWA algorithm needs to take into account
the presence of wavelength conversion as the later is usually done at much
earlier stage during the capacity planning. We proceed to show that
existing dynamic RWA algorithms largely fail in the presence of wavelength
conversion. We then propose a weighted least-congestion routing and
first-fit wavelength assignment (WLCR-FF) RWA algorithm in conjunction
with a simple heuristic wavelength converter placement algorithm called
Minimum Blocking Probability First (MBPF) that considers both the
distribution of free wavelengths and the lengths of each route jointly. We
further introduce an analytical model that can obtain the blocking
performance of the proposed WLCR-FF algorithm. Using both analysis and
simulation, we carry out extensive numerical studies over the typical
topologies including the ring, mesh-torus, and two mesh topologies, the
14-node NSFNET and the 19-node EON; we compare the performance of proposed
algorithm with a wide variety of existing routing algorithms including
static routing, fixed-alternate routing and least-loaded routing
algorithms. The results conclusively demonstrate that the proposed WLCR-FF
algorithm can achieve much better blocking performance in the environment
of sparse or/and full wavelength conversion."
}

@INPROCEEDINGS{Chua0305:Impact,
AUTHOR="Mooi Choo Chuah and Santosh Abraham and Cem Saraydar and Ashwin Sampath",
TITLE="Impact of Rate Control on the Capacity of an Iub Link: Single Service Case",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Universal Mobile Telecommunications System (UMTS) networks are capable of
serving packet-switched data applications at bit rates as high as 384
Kbps. This paper studies the capacity and utilization of the downlink of
the Iub interface, which lies between the Radio Network Controller (RNC)
and the base station (NodeB) in a UMTS network. The 3GPP standards define
a Node B receive window within which a frame should arrive for it to be
processed and transmitted to the UE in time. If the frame arrives too
late, it will be discarded. Such frame discard event results in some loss
in voice/data quality. Via simulations, we evaluate the link capacity for
web-browsing traffic at 64Kbps, 128Kbps and 384Kbps, with a frame discard
probability target of 0.05\%. Our results indicate that the Iub link
utilization is very poor due to the highly bursty nature of data traffic.
In order to alleviate this problem, we introduce a rate control scheme
where the peak user data rate is temporarily lowered during times of high
congestion.  This lowering of data rate is done through appropriate
selection of the transport block size within the transport format set. As
a result of such rate control, the capacity of the Iub link  improves by
30-50\%"
}

@INPROCEEDINGS{Chun0305:Capacity,
AUTHOR="Seong Taek Chung",
TITLE="The Capacity Region of Frequency-Selective Gaussian Interference Channels
Under Strong Interference",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper presents the capacity region of frequency-selective Gaussian
interference channels under the condition of strong interference, assuming
an average power constraint per user. First, a frequency-selective Gaussian
interference channel is modeled as a set of independent parallel memoryless
Gaussian interference channels. Using non-frequency selective results, the
capacity region of frequency-selective Gaussian interference channels
under strong interference is expressed mathematically. Exploiting
structures inherent in the problem, a dual problem is constructed for each
independent memoryless channel, and solved. Furthermore, three suboptimal
methods are compared with the capacity-achieving coding and power
allocation scheme. Iterative waterfilling, a suboptimal scheme, provides
close-to-optimum performance and has a distributed coding and power
allocation scheme, which are attractive in practice."
}

@INPROCEEDINGS{Cion0305:Turbo,
AUTHOR="Stefano Cioni and Giovanni Emanuele Corazza and Alessandro Vanelli-Coralli",
TITLE="Turbo Embedded Estimation with Imperfect Phase/Frequency Recovery",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In recent years large scientific interest has been devoted to joint data
decoding and parameter estimation techniques. In this paper, iterative
turbo decoding joint to channel frequency and phase estimation is
proposed. The phase and frequency estimator is embedded into the structure
of the turbo decoder itself, keeping into consideration both turbo
interleaving and puncturing. Results show that the proposed technique
outperforms conventional approaches both in terms of detection
capabilities and implementation complexity."
}

@TECHREPORT{Ciuf0307:Architecture,
AUTHOR="Augusto Ciuffoletti and Tiziana Ferrari and A. Ghiselli and C. Vistoli",
TITLE="Architecture of monitoring elements for the network element modeling in a
Grid infrastructure",
TYPE="arXiV report",
NUMBER="cs.NI/0307024",
MONTH=jul,
YEAR=2003,
KEYWORDS="Networking and Internet Architecture",
ABSTRACT="Several tools exist that collect host-to-host connectivity measurements. To
improve the usability of such measurements, they should be mapped into a
framework consisting of complex subsystems, and the infrastructure that
connects them. We introduce one such framework, and analyze the
architectural implications on the network structure. In our framework, a
complex subsystem consists of several computing facilities and the
infrastructure that connects them: we call it a -monitoring domain-. The
task of measuring the connectivity between -monitoring domains- is
considered distinct from the activity of -storage- and -computing-
elements. Therefore we introduce a new element in our topology: we call it
-theodolite- element, since its function is similar to that of a
transponder. Using these basic concepts, we analyze the architectural
implications on the network structure: in a nutshell, if we want that
-theodolites- serve as a reference, than the contribution to the relevant
network metrics due to the -monitoring domain- infrastructure must be
negligible with respect to contributions of the inter-domain
infrastructure. In addition all -theodolites- of a -monitoring domain-
must give an image of the inter-domain infrastructure that is consistent
with that experienced by network applications. We conclude giving a
running SQL example of how information about -monitoring domains- and
-theodolites- could be organized, and we outline the application of such
framework in the GLUE schema activity for the network element",
URL="http://arXiv.org/abs/cs/0307024"
}

@INPROCEEDINGS{Clas0305:Multi,
AUTHOR="Brian Classon and Philippe Sartori and Vijay Nangia and Xiangyang Zhuang
and Kevin Baum",
TITLE="Multi-dimensional Adaptation and Multi-user Scheduling Techniques for
Broadband Wireless {OFDM} Systems",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper considers techniques to increase the performance of a broadband
wireless OFDM system through adaptation in both the time and frequency
domains.  System throughput estimates are provided for frequency
non-selective coding (coding for frequency diversity across subcarriers)
and frequency selective coding (e.g., DSL) for single antenna, Alamouti,
and selective closed-loop MIMO configurations. Additional gains from
performing multi-user frequency-domain scheduling are also determined
using proportional fair and maximum (subcarrier) C/I schedulers.  The
performance gains of the multi-dimensional adaptation and multi-user
scheduling techniques are contrasted with the amount of feedback required.
 Measured data from a 20 MHz experimental system and turbo coding
simulations are used to estimate the size of each feedback report, and a
realistic user speed distribution is used to estimate an appropriate
feedback frequency."
}

@INPROCEEDINGS{Cler0305:Mutual,
AUTHOR="Bruno Clerckx",
TITLE="Mutual Coupling Effects on the Channel Capacity and the Space-Time
Processing of {MIMO} Communication Systems",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The channel capacity and the performance of MIMO systems in presence of
fading correlation and antenna coupling are investigated.  Simulation
results demonstrate that mutual coupling can improve the performance
depending on the inter-element spacing and the richness of scattering.  It
is shown that the bit error rate performance of spatial multiplexing is
particularly influenced by the decorrelation/correlation effect caused by
mutual coupling.  On the other hand, the bit error rate performance of
transmit diversity is mainly affected by the resulting modification of
antenna gain and received power."
}

@INPROCEEDINGS{Cler0305:Robust,
AUTHOR="Bruno Clerckx",
TITLE="Robust Signal Constellations for Spatial Multiplexing in the Presence of
Real Fading Propagation Channels",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Spatial multiplexing is employed in MIMO communication systems to increase
spectral efficiency. The performance of spatial multiplexing is highly
dependent on the propagation conditions such as the richness of
scattering, the presence of dominant components and the inter-element
spacings. In this paper, new robust signal constellations for use in
spatial multiplexing over real fading propagation channels are developed.
It is shown that these new constellations are by far more robust against
fading correlations and high Rice factor than the classical PSK and QAM
constellations. With these new constellations, spatial multiplexing
presents excellent symbol error rate performance whatever the propagation
environment and the inter-element distance."
}

@INPROCEEDINGS{Cohe0303:Associative,
AUTHOR="Edith Cohen and Amos Fiat and Haim Kaplan",
TITLE="Associative Search in Peer to Peer Networks: Harnessing Latent Semantics",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT={The success of a P2P file-sharing network highly depends on the
scalability and versatility of its search mechanism.  Two particularly
desirable search features are scope (ability to find infrequent items)
and support for partial-match queries (queries that contain typos or
include a subset of keywords). While centralized-index architectures
(such as Napster) can support both these features, existing
decentralized architectures seem to support at most one: prevailing
unstructured P2P protocols (such as Gnutella and FastTrack) deploy a
{"}blind{"} search mechanism where the set of peers probed is unrelated to
the query; thus they support partial-match queries but have limited
scope.  On the other extreme, the recently-proposed distributed hash
tables (DHTs) such as CAN and CHORD, couple index location with the
item's hash value, and thus have good scope but can not effectively
support partial-match queries.  Another hurdle to DHTs deployment is
their tight control of the overlay structure and the information (part
of the index) each peer maintains, which makes them more sensitive to
failures and frequent joins and disconnects.

 We develop a new class of decentralized P2P architectures.  Our
design is based on unstructured architectures such as gnutella and
FastTrack, and retains many of their appealing properties including
support for partial match queries, and relative resilience to peer
failures.  Yet, we obtain orders of magnitude improvement in the
efficiency of locating rare items.  Our approach exploits associations
inherent in human selections to steer the search process to peers that
are more likely to have an answer to the query.  We demonstrate the
potential of associative search using models, analysis, and
simulations.}
}

@TECHREPORT{Cohe0305:Tomography,
AUTHOR="Reuven Cohen and Danny Dolev and Shlomo Havlin and Tomer Kalisky and Osnat
Mokryn and Yuval Shavitt",
TITLE="On the Tomography of Networks and Multicast Trees",
TYPE="arXiv technical report",
NUMBER="cond-mat/0305582",
MONTH=may,
YEAR=2003,
KEYWORDS=topology,
ABSTRACT="In this paper we model the tomography of scale free networks by studying
the
structure of layers around an arbitrary network node. We find, both
analytically and empirically, that the distance distribution of all nodes
from
a specific network node consists of two regimes. The first is
characterized by
rapid growth, and the second decays exponentially. We also show that the
nodes
degree distribution at each layer is a power law with an exponential
cut-off.
We obtain similar results for the layers surrounding the root of multicast
trees cut from such networks, as well as the Internet. All of our results
were
obtained both analytically and on empirical Interenet data.",
URL="http://arXiv.org/abs/cond-mat/0305582"
}

@INPROCEEDINGS{Coll0305:Fully,
AUTHOR="Iain Collings and Dae Han Won",
TITLE="Fully Adaptive {MLSE} Equalizer Performance with {MPSK} Signals",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper analyzes a fully adaptive MLSE equalizer in fast fading channel
conditions. The receiver requires no channel state information, and even
adapts to learn the channel fading statistics. The equalizer is analyzed
using pairwise error probabilities to derive lower bounds on performance
for MPSK signals. Simulation studies confirm that the analytic bounds are
close to the true performance.  A new decision delay adaption rule is
proposed, based on the bit error rate analysis.  With this new rule, the
fully adaptive MLSE equalizer is shown to outperform existing fixed-delay
equalizers when channel statistics are unknown."
}

@ARTICLE{Conw0310:Simulation,
AUTHOR="Adrian Conway and Yali Zhu",
TITLE="A simulation-based methodology and tool for automating the modeling and
analysis of voice-over-IP perceptual quality",
JOURNAL="Performance Evaluation",
VOLUME=54,
NUMBER=2,
PAGES="129-147",
MONTH=oct,
YEAR=2003,
REFERENCES=31,
KEYWORDS="Objective perceptual quality evaluation; Packet voice quality; VoIP
quality; Simulation methodology; Network models; PSQM; PESQ",
ABSTRACT="A simulation-based methodology is developed for analyzing the perceptual
quality of voice-over-IP calls as a function of network quality-of-service
(QoS) parameters and choices in configuration and implementation. The
proposed method combines the use of existing objective voice-quality
measurement algorithms, such as the ITU-T P.861 PSQM and P.862 PESQ, and
pre-recorded natural or artificial voice reference signals, such as the
ITU-T P.50, with the discrete-event simulation of a network QoS model. A
significant advantage of the method is that it does not involve the use of
human subjects in evaluating subjective voice quality. This enables one to
entirely automate the process of quantifying call quality as a function of
network QoS and implementation choices such as packet size and codec type.
Such automation enables one to realize significant time and cost savings
in obtaining experimental results. A tool implementation is described that
includes basic network packet loss, delay jitter, and call multiplexing
models. Example numerical results are presented. The generalization of the
method to the automated perceptual quality evaluation of audio, video, and
multimedia signals is also described.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-4938RPS-1-1B\&\_cdi=5663\&\_orig=browse\&\_coverDate=10\%2F31\%2F2003\&\_sk=999459997\&view=c\&wchp=dGLbVlz-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=aebede0f0e39336f39ccfb76165b8f50\&ie=f.pdf"
}

@INPROCEEDINGS{Corr0305:Method,
AUTHOR="Pedro Correia and Vitor Silva and Pedro Assuncao",
TITLE="A Method for Improving the Quality of Mobile Video under Hard Transcoding
Conditions",
BOOKTITLE="ICC 2003 - Global Services and Infrastructure for Next Generation Networks",
ADDRESS="Anchorage, Alaska",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Mobile access to multimedia contents requires video transcoding
functionality at the edge of the mobile network for  interworking with
heterogeneous networks and services. Under hard transcoding conditions,
the bandwidth of a coded video stream needs to be drastically reduced such
that the original temporal resolution cannot be maintained and consecutive
frame skipping is often unavoidable at the transcoder.
We propose an efficient mechanism for improving the quality of service
(QoS) delivered to the mobile user by minimising consecutive frame
skipping in transcoding systems. The simulation results show that a better
signal quality is obtained at the receiver during hard transcoding periods."
}

@INPROCEEDINGS{Cost0305:Mc,
AUTHOR="Elena Costa and Harald Haas and Egon Schulz and Eugene Krouk and Felix
Taubin and Peter Trifonov",
TITLE="{MC-CDMA} uplink channel coding scheme with built-in channel estimation",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, a coding scheme with $M$-ary Walsh-Hadamard (WH)
orthogonal modulation is considered for multi-carrier (MC) transmission. 
A novel pilot-assisted channel estimation approach is proposed, 
that efficiently exploits the properties of the WH codes. 
Firstly, simulation results on the single-user performance show
the influence of the energy distribution between pilot and information 
symbols. Then, the impact of the channel estimation method is assessed for

different system loads in a MC code division multiple access (MC-CDMA) 
uplink scenario."
}

@ARTICLE{Cost0309:Freeze,
AUTHOR="G. Costa and Harsha Sirisena",
TITLE="Freeze {TCP} with timestamps for fast packet loss recovery after
disconnections",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=15,
PAGES="1792-1799",
MONTH=sep,
YEAR=2003,
REFERENCES=17,
KEYWORDS="End-to-end TCP enhancements; Wireless networks; Round trip time estimate;
Proactive control; Disconnection; Mobility",
ABSTRACT="TCP optimization for wireless networks, for dealing with packet losses and
disconnections due to fading, shadowing and handoffs, ideally should
maintain TCP end-to-end semantics with minimal dependence on intermediate
nodes. This paper presents such a mechanism that uses disconnection
duration estimates at the receiver, derived from timestamps, to avoid an
increase in the retransmission timeout (RTO) estimate at the sender
following disconnections. Simulation results are presented to illustrate
the problem, and to show that the proposed modification significantly
improves performance. Incorporating this into the recently proposed
Freeze-TCP scheme, which uses disconnection predictions at the receiver,
is shown to increase robustness to packet losses during disconnections.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47YXW9F-2-V\&\_cdi=5624\&\_orig=browse\&\_coverDate=09\%2F22\%2F2003\&\_sk=999739984\&view=c\&wchp=dGLbVzb-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=1ef481fcec2eb188e5291e98e76207a0\&ie=f.pdf"
}

@INPROCEEDINGS{Coud0305:Traffic,
AUTHOR="David Coudert",
TITLE="Traffic Grooming in Unidirectional {WDM} Ring Networks using Design Theory",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We address the problem of traffic grooming in WDM rings with
all-to-all uniform unitary traffic. We want to minimize the total
number of SONET add-drop multiplexers (ADMs) required. We show that
this problem corresponds to a partition of the edges of the complete
graph into subgraphs, where each subgraph has at most $C$ edges
(where C is the grooming ratio) and where the total number of
vertices has to be minimized.  Using tools of graph and design
theory, we optimally solve the problem for practical values and
infinite congruence classes of values for a given C, and thus
improve and unify all the preceding results.  We disprove a
conjecture of [6] saying that the minimum number of ADMs
cannot be achieved with the minimum number of wavelengths, and also
another conjecture of [16]."
}

@INPROCEEDINGS{Cran0306:Design,
AUTHOR="Chuck Cranor and Rick Ethington and Amit Sehgal and David Shur and Cormac
Sreenan and Kobus {van der Merwe}",
TITLE="Design and Implementation of a Distributed Content Management System",
BOOKTITLE="ACM NOSSDAV 2003",
ADDRESS="Monterey, California, USC",
DAYS=1,
MONTH=jun,
YEAR=2003,
ABSTRACT="We present the design and implementation of the
Spectrum content management architecture. Spectrum allows 
storage policies to be applied to large volumes of content 
to facilitate efficient storage. Specifically, the system allows different
policies to be applied to the same content without replication.
Spectrum can also apply policies that are ``time-aware'' which 
effectively deals with the storage of continuous media content.
Finally, the modular design of the Spectrum architecture allows
both standalone and distributed realizations so that the system
can be deployed in a variety of applications."
}

@ARTICLE{Cris0301:Corrigendum,
AUTHOR="Ken Crisler and Mikael Anneroth and Andy Aftelak and Petri Pulli",
TITLE={Corrigendum to {"}The human perspective of the wireless world{"}},
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=1,
PAGES=64,
MONTH=jan,
YEAR=2003,
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-484TRVF-2-1\&\_cdi=5624\&\_orig=browse\&\_coverDate=01\%2F01\%2F2003\&\_sk=999739998\&view=c\&wchp=dGLbVlb-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=2bb12a0f9101fb13e550a21e28b255b2\&ie=f.pdf"
}

@ARTICLE{Cris0301:Human,
AUTHOR="Ken Crisler and Mikael Anneroth and Andy Aftelak and Petri Pulil",
TITLE="The human perspective of the wireless world",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=1,
PAGES="11-18",
MONTH=jan,
YEAR=2003,
REFERENCES=13,
KEYWORDS="Communication; Wireless; Users; interaction",
ABSTRACT="The Wireless World Research Forum (WWRF) is a global academic and industry
forum, which is contributing to the visions of future wireless
communications and is identifying research topics on which to build the
vision. The next two decades promises us almost unimaginable communication
capabilities; the technology can deliver almost anything we want it to, but
the key to success is understanding what capabilities people will find
valuable, and how to simply access those capabilities. The WWRF is putting
the user at the centre of its visions by identifying research, which
uncovers the functionality that people will value in the future. These
research topics fall into three areas; understanding the user, by studying
human behaviour and needs, the development of next generation technologies
becomes user requirements driven rather than technology lead; new generic
application elements, in which technologies closely associated with the
understanding of the user, such as virtual reality, are identified for
research; and new interaction techniques, which allow for intuitive
interaction between humans and the terminals and underlying network
services. Studying the user, especially in these research areas, is the
only way to ensure that the future wireless world meets and exceeds the
expectations of people in the coming decades.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-461XPFR-B-F\&\_cdi=5624\&\_orig=browse\&\_coverDate=01\%2F01\%2F2003\&\_sk=999739998\&view=c\&wchp=dGLbVtb-zSkzS\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=0d8614fdbfac8874929112ce31ffbdf9\&ie=f.pdf"
}

@INPROCEEDINGS{Crov0303:Graph,
AUTHOR="Mark Crovella and Eric Kolaczyk",
TITLE="Graph Wavelets for Spatial Traffic Analysis",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="A number of problems in network operations and engineering call
for new methods of traffic analysis.  While most existing traffic
analysis methods are fundamentally temporal, there is a clear need
for the analysis of traffic across multiple network links --- that is, for
spatial traffic analysis.   In this paper we give examples of
problems that can be addressed via spatial traffic analysis.   We then
propose a formal approach to spatial traffic analysis based on the
wavelet transform.   Our approach generalizes the traditional wavelet
transform so that it can be applied to data elements connected via an
arbitrary topology.  We explore the necessary and desirable properties
of this approach (graph wavelets) and consider some of its
possible realizations.   We then apply graph wavelets to measurements
from an operating network.  Our results show that graph wavelets are
very useful for our motivating problems;  for example, they can be used
to form highly summarized views of an entire network's traffic load, to
gain insight into a network's global traffic response to a link failure,
and to localize the extent of a failure event within the network.

Network measurements, statistics"
}

@INPROCEEDINGS{Cruz0303:Optimal,
AUTHOR="Rene L. Cruz and Arvind Santhanam",
TITLE="Optimal Routing, Link Scheduling , and Power Control in Multi-hop Wireless
Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="In this paper we study the problem of joint routing link scheduling and
power control to support high data rates 
for broadband wireless multi-hop networks. We first address the problem of
finding an optimal link scheduling and 
power control policy that minimizes the total average transmission power
in the wireless multi-hop network, subject 
to given constraints regarding the minimum average data rate per link, as
well as peak transmission power constraints 
per node. Multi-access signal interference is explicitly modeled. We use a
duality approach whereby, as a byproduct of
 finding the optimal policy, we find the sensitivity of the minimal total
average power with respect to the average data
 rate for each link. Since the minimal total average power is a convex
function of the required minimum average data rates,
 shortest path algorithms with the link weights set to the link
sensitivities can be used to guide the search for a globally 
optimum routing. We present a few simple examples that show our algorithm
can find policies that support data rates that are 
not possible with conventional approaches. Moreover, we find that optimum
allocations do not necessarily route traffic over 
minimum energy paths."
}

@INPROCEEDINGS{Cruz0305:Adaptive,
AUTHOR="Felipe {Cruz-Pérez} and Lauro Ortigoza-Guerrero",
TITLE="Adaptive Resource Allocation Strategy with Service Type Prioritisation for
Class-Based QoS Mobile Networks",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, a new adaptive resource allocation strategy called Equal
Resource Sharing Allocation with differentiated QoS (ERSAQoS) is
presented. This strategy is suitable for operation in environments with
integrated service types (i.e.: voice, video, videophone) with different
bandwidth requirements and priorities each. ERSAQoS consists of a
two-phase allocation process. Resources are first distributed among the
different groups of active calls with the same service type, respecting
priorities and then equally distributed among active calls with the same
service type. Our strategy allows soft-controlled differentiated QoS
provisioning. Results show that ERSAQoS meets the upper capacity bound for
Flexible Resource Allocation strategies while improving the QoS of the
prioritised service types."
}

@INPROCEEDINGS{Cruz0305:Multiple,
AUTHOR="Felipe {Cruz-Pérez} and Lauro Ortigoza-Guerrero and Heraclio Heredia-Ureta",
TITLE="Multiple Fractional Channel Reservation for Multi-Service Cellular Networks",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, the Multiple Fractional Channel Reservation (MFCR) strategy
for service differentiation is proposed. Contrary to the rest of the
channel reservation schemes proposed in the literature, this strategy
reserves, on average, real numbers of channels to prioritise different
call types (new or handoffs) in multiple service environments. (In a
multi-service mobile cellular network with n different services and 2n
individual Quality of Service (QoS) constraints (n new call types + n
handoff call types), MFCR reserves 2n-1 different real numbers of
channels). Then, the capacity maximisation problem in this type of
environments when using several channel reservation schemes is
investigated. Determining the right number of reserved channels for each
call type to satisfy all QoS constraints is a difficult task. Also,
selecting the right prioritisation order is not a trivial process, as it
depends on QoS constraints and system characteristics. Furthermore, only
one prioritisation order achieves maximum capacity. Thus, an algorithm to
determine the optimum numbers of reserved channels to achieve maximum
system capacity when using the MFCR is also proposed. To our knowledge,
the capacity optimisation problem considering individual QoS constraints
for each call type had only been addressed in single service environments."
}

@INPROCEEDINGS{Cui0303:Precomputation,
AUTHOR="Yong Cui and Ke Xu and Jianping Wu",
TITLE="Precomputation for Multi-constrained QoS Routing in High-speed Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Abstract-As one of the most challenging problems of the upcoming
next-generation high-speed networks, quality-of-service routing (QoSR)
with multiple (k) constraints has the complexity of NP-complete.  In this
paper, we propose a novel multi-constrained energy function based
precomputation algorithm, MEFPA.  This algorithm divides the continuous
QoS metric into (b-1) parts, and constructs the number (B=C(b+k-2, k-1))
of linear energy functions (LEFs) distributed uniformly in the k-dimension
metric space.  Using LEFs, it then converts k QoS constraints to a single
energy.  At last, it uses Dijkstra's algorithm to create the least energy
trees, based on which QoS routing table is created.  The paper first
analyzes the performance of LEFs with k constraints, and gives the method
to determine the feasible and unfeasible areas in the k-dimension QoS
metric space for a QoS request.  We then introduce our MEFPA, whose time
complexity is O(B(m+n+nlogn)), for k-constrained routing.  Extensive
simulations show that, with few (e.g. when k=2, B=b=7) LEFs, the generated
routing table can route most (>95\%) QoS request in absolute performance. 
Compared with the on-line algorithm, our MEFPA also has the advantage in
each aspect.  In conclusion, MEFPA is a scalable, high-performance and
easily implemented precomputation algorithm that can provide QoSR in
high-speed networks."
}

@INPROCEEDINGS{Cui0305:Beam,
AUTHOR="Jun-Hong Cui and Li Lao and Dario Maggiorini and Mario Gerla",
TITLE="{BEAM:} A Distributed Aggregated Multicast Protocol Using Bi-directional
Trees",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="IP multicast confronts a severe scalability problem when
there are large numbers of multicast groups in the network due to
state explosion and control explosion. In backbone networks, this
state scalability problem is exacerbated, since there are
potentially enormous multicast groups crossing backbone domains.
To improve the state scalability of multicast in backbone domains,
in this paper, we propose a scalable protocol, called {\it BEAM}
(Bi-dirEctional Aggregated Multicast), which uses the concept of
aggregated multicast \cite{Fei01:aggmcgi}. BEAM is a distributed
protocol using bi-directional trees. It is simple and easy to
implement. Through simulations, we show that BEAM can greatly
improve state scalability with very low overhead: up to $98\\%$
state and tree setup and maintenance overhead reduction with less
than $0.14$ bandwidth waste in our experiments."
}

@INPROCEEDINGS{Cui0305:Modulation,
AUTHOR="Shuguang Cui",
TITLE="Modulation Optimization under Energy Constraints",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We consider radio applications where the nodes operate on
batteries so that energy consumption must be minimized
while satisfying given throughput and delay requirements.
In this context, we analyze the best modulation strategy to
minimize the total energy consumption required to send a
given number of bits. The total energy consumption includes
both the transmission energy and the circuit energy
consumption. We show that for both MQAM and MFSK the
transmission energy decreases with the $BT\_{on}$ product
while the circuit energy consumption increases with
$T\_{on}$, where $B$ is the modulation bandwidth and
$T\_{on}$ is the transmission time. Thus, in short-range
applications where the circuit energy consumption is
nonnegligible compared with the transmission energy, the
total energy consumption is minimized by using the maximum
system bandwidth along with an optimized transmission time
$T\_{on}$. We derive this optimal $T\_{on}$ for MQAM and MFSK
modulation in both AWGN channels and Rayleigh fading
channels. Our optimization considers both delay and
peak-power constraints. Numerical examples are given, where
we exhibit up to $80\\%$ energy savings over modulation
strategies that minimize the transmission energy alone."
}

@INPROCEEDINGS{Cui0305:Precomputation,
AUTHOR="Yong Cui and Ke Xu and Jianping Wu",
TITLE="Precomputation for Finding Paths with Two Additive Weights",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="As the most challenging problems of the upcoming next-generation high-speed
networks, 2-constrained quality-of-service routing (QoSR) and
one-constrained optimal QoSR have the complexity of NPC.  In this paper,
we propose a novel precomputation algorithm, LEFPA, for them.  This
algorithm converts two additive weights to a single metric with linear
energy functions (LEFs) and pre-computes QoS routing table with multiple
(B) LEFs to further enhance its scalability.  We first analyze the
performance of LEFs and give a method to determine the feasible and
unfeasible areas in the metric space for a QoS request.  We then introduce
the proposed LEFPA, whose computation complexity is O(B(m+nlogn+n)). 
Furthermore, we use three methods to evaluate the routing performance. 
Extensive simulations show that with seven (B=7) LEFs in uniform
distribution, our LEFPA has both absolutely and competitively high
performance.  In conclusion, LEFPA is an easily implemented, high-scalable
and high-performance precomputation algorithm that can provide QoSR in
next-generation networks."
}

@INPROCEEDINGS{Cui0305:Simulated,
AUTHOR="Yong Cui and Ke Xu and Jianping Wu and Zhongchao Yu",
TITLE="A Simulated Annealing Based Heuristic for Multi-constrained Routing",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Multi-constrained quality-of-service routing (QoSR) is to find a feasible
path that satisfies multiple constraints simultaneously, as an NPC
problem, which is also a big challenge for the upcoming next-generation
networks.  In this paper, we propose SA\_MCP, a novel heuristic algorithm,
by applying simulated annealing to Dijkstra's algorithm.  This algorithm
first uses a nonlinear energy function to translate multiple QoS weights
into a single metric and then seeks to find a feasible path by simulated
annealing.  The paper outlines simulated annealing algorithm and analyzes
the problems met when we apply it to QoSR.  Extensive simulations
demonstrate the following conclusions: (1) SA\_MCP has high routing
performance.  (2) It has good scalability regarding both network size and
the number of QoS constraints.  (3) It is insensitive to the distribution
of QoS constraints.  Furthermore, when most QoS requests are feasible, the
running time of SA\_MCP is about O(k(m+nlogn)), which is only k times that
of the traditional Dijkstra's algorithm, where k is the number of QoS
constraints."
}

@INPROCEEDINGS{Cui0306:Layered,
AUTHOR="Yi Cui and Klara Nahrstedt",
TITLE="Layered Peer-to-Peer Streaming",
BOOKTITLE="ACM NOSSDAV 2003",
ADDRESS="Monterey, California, USC",
DAYS=1,
MONTH=jun,
YEAR=2003,
ABSTRACT="In this paper, we propose a peer-to-peer streaming solution to address the
on-demand media distribution problem. We identify two issues, namely the
asynchrony of user requests and heterogeneity of peer network bandwidth.
Our key techniques to address these two issues are cache-and-relay and
layer-encoded streaming. A unique challenge of peer-to-peer streaming is
that the bandwidth and data availability (number of layers received) of
each receiving peer are constrained and heterogeneous, which further
limits the bandwidth and data availability of its downstream node when it
acts as the supplying peer. This challenge distinguishes our work from
existing studies on layered multicast. Our experiments show that our
solution is efficient at utilizing bandwidth resource of supplying peers,
scalable at saving server bandwidth consumption, and optimal at maximizing
streaming qualities of all peers."
}

@INPROCEEDINGS{Cuyp0305:Combining,
AUTHOR="Gert Cuypers and Koen Vanbleu and Geert Ysebaert and Marc Moonen and Piet
Vandaele",
TITLE="Combining raised cosine windowing and per tone equalization for {RFI}
mitigation in {DMT} receivers",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Discrete multitone (DMT) offers an elegant way to achieve high capacity,
dividing the spectrum into small bands and processing these individually.
The per tone equalizer (PTEQ) optimizes the capacity for each band
individually, thus optimizing the whole.
However, it provides little protection against narrow band radio frequency
interference (RFI), being spread over all tones because of the high side
lobes of the DFT filter bank used in the receiver.
The use of windowing functions limits this noise spreading, but is
difficult to combine with the PTEQ.
This paper describes a method to combine the PTEQ with a raised cosine
window, while keeping the complexity reasonable. 
Extensions to other windowing functions are also given."
}

@INPROCEEDINGS{DAgo0305:Simulative,
AUTHOR="Fabio D'Agostino and Enrico Masala and Laura Farinetti and Juan Carlos {De
Martin}",
TITLE="A Simulative Study of Analysis-By-Synthesis Perceptual Video Classification
and Transmission over DiffServ {IP} Networks",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper presents the results of transmission of video data on
2-class DiffServ IP networks using  perceptual packet classification
and slicing. An analysis-by-synthesis technique
to identify perceptually important video regions, to create optimal video
slices and to assign the resulting packets to the appropriate DiffServ
classes is described. 
The proposed technique was implemented using the ISO/IEC MPEG-2 video
coding standard. Several transmission scenarios, including homogeneous
video traffic and interfering FTP traffic, were simulated using Network
Simulator (NS). 
The proposed perception-based video transmission approach outperformed
classical data partitioning in all tested network conditions, while
delivering greater flexibility both in terms of network usage and 
potential to match time-varying channels. 
Substantially higher PSNR values than the regular best-effort case
were also obtained assigning to the high-QoS class as little as 10\% of
the traffic. 
Demo sequences are available at
http://multimedia.polito.it/icc2003."
}

@ARTICLE{Dahl0304:End,
AUTHOR="Michael Dahlin and Bharat Chandra and Lei Gao and Amol Nayate",
TITLE="End-To-End {WAN} Service Availability",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=2,
PAGES="300-313",
MONTH=apr,
YEAR=2003,
REFERENCES=48,
KEYWORDS="availability; disconnected operation; failure model; Internet; overlay
routing; replication; World-Wide Web",
ABSTRACT="This paper seeks to understand how network failures affect the availability
of service delivery across wide-area networks (WANs) and to evaluate
classes of techniques for improving end-to-end service availability. Using
several large-scale connectivity traces, we develop a model of network
unavailability that includes key parameters such as failure location and
failure duration. We then use trace-based simulation to evaluate several
classes of techniques for coping with network unavailability. We find that
caching alone is seldom effective at insulating services from failures but
that the combination of mobile extension code and prefetching can improve
average unavailability by as much as an order of magnitude for classes of
service whose semantics support disconnected operation. We find that
routing-based techniques may provide significant improvements but that the
improvements of many individual techniques are limited because they do not
address all significant categories of network failures. By combining the
techniques we examine, some systems may be able to reduce average
unavailability by as much as one or two orders of magnitude.",
URL="http://ieeexplore.ieee.org/iel5/90/26877/01194825.pdf?isNumber=26877\&prod=JNL\&arnumber=1194825\&arSt=+300\&ared=+313\&arAuthor=Dahlin\%2C+M.\%3B+Chandra\%2C+B.B.V.\%3B+Lei+Gao\%3B+Nayate\%2C+A."
}

@INPROCEEDINGS{Dahl0305:Optimization,
AUTHOR="Joachim Dahl",
TITLE="Optimization of signature sequences and receiver filters for downlink
{DS-CDMA} systems",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Joint optimization of both signature sequences and linear receiver
filters for a downlink DS-CDMA system with multipath propagation
channels is considered. The signature sequences and the receiver filters
are optimized in order to minimize the sum of the mean-squared-errors at
the output all the receivers while maintaining a fixed total
transmitting power. The signature sequences and receiver filters
are derived using a filtering approach to accommodate for the
multipath propagation effects."
}

@INPROCEEDINGS{Dahm0305:Full,
AUTHOR="Ingo Dahm and Stefan Schmermbeck",
TITLE="A Full Adaptive Signalspace Detector with Soft Information",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Signalspace Detection is a promising concept for symbol detection -
especially on magnetic recording channels. Conventional implementations of
this concept provide low power dissipation but require a complete redesign
when channel parameters are changed.  Adaptive SSD is characterized by a
higher detection performance using dynamic decision planes that render a
circuit redesign unnecessary."
}

@INPROCEEDINGS{Dai0305:Cdma,
AUTHOR="Huaiyu Dai and Laurence Mailaender and H. Vincent Poor",
TITLE="{CDMA} Cellular Downlink Transmission with Transmit Arrays and Power
Control: Circuit-Switched and Packet-Switched Systems",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Wireless CDMA cellular downlink communications with transmit antenna arrays
in multipath fading channels is studied. Transmit diversity and various
beamforming techniques are investigated and compared, in conjunction with
power control. No instant downlink channel information is assumed;
however, the obtained results are also compared with results assuming
ideal feedback. The study is carried out for both circuit-switched and
packet-switched systems, for which different conclusions are drawn."
}

@INPROCEEDINGS{Dai0305:Distributed,
AUTHOR="Fei Dai and Jie Wu",
TITLE="Distributed Dominant Pruning in Ad Hoc Networks",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Efficient routing among a set of mobile hosts is one of the most
important functions in ad hoc wireless networks. Routing based on
a connected dominating set is a promising approach, where the
search space for a route is reduced to the hosts in the set. A set
is dominating if all the hosts in the system are either in the set
or neighbors of hosts in the set. The efficiency of
dominating-set-based routing mainly depends on the overhead
introduced in the formation of the dominating set and the size of
the dominating set. In this paper, we first review a distributed
formation of a connected dominating set called marking
process and dominating-set-based routing. Then we propose a
dominant pruning rule to reduce the size of the dominating set.
This dominant pruning rule (called Rule k) is a generalization
of two existing rules (called Rule 1 and Rule 2 respectively). We
prove that the vertex set derived by applying Rule k is still a
connected dominating set. When implemented with local neighborhood
information, Rule k is more effective in reducing the dominating 
set derived from the marking process than the combination of Rules 
1 and 2, and has the same communication complexity and less 
computation complexity. Simulation results confirm that Rule k 
outperforms Rules 1 and 2, especially in relatively dense networks 
with unidirectional links."
}

@INPROCEEDINGS{Dai0306:Rate,
AUTHOR="Min Dai and Dmitri Loguinov",
TITLE="Rate-Distortion Framework for Scalable Internet Video Streaming",
BOOKTITLE="ACM NOSSDAV 2003",
ADDRESS="Monterey, California, USC",
DAYS=1,
MONTH=jun,
YEAR=2003,
ABSTRACT="Internet streaming applications usually have strict requirements on
bandwidth, delay and packet loss, while the current best-effort Internet
does not provide any Quality-of-Service (QoS) guarantees for end-to-end
flows. To achieve a higher level of QoS for the end user, Fine-granular
Scalability (FGS), which has both strong error-resilience and flexibility
during streaming over variable-bandwidth channels, has been accepted as a
standard coding scheme for the video streaming profile in MPEG-4 [7]. FGS
and its extensions (e.g., progressive FGS [9]) can also be used in the
emerging video coding standards such as H.26L [8]. Our research
investigates closed-form rate-distortion (R-D) models of FGS coders and
shows how such models can be used in a simple congestion control framework
for FGS streaming over the Internet. In this framework, the server uses
closed-form R-D models to scale the FGS layer to both comply with the
available bandwidth and maintain constant video quality for the end user.
Experimental results demonstrate that our FGS R-D model provides better
end-to-end performance than previous work or the rate control approach
currently applied in the MPEG-4 standard."
}

@ARTICLE{Daig0308:Analysis,
AUTHOR="John Daigle and Marcos {Magalhães}",
TITLE="Analysis of Packet Networks Having Contention-Based Reservation With
Application to {GPRS}",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=4,
PAGES="602-615",
MONTH=aug,
YEAR=2003,
REFERENCES=30,
KEYWORDS="cellular communications; communication networks; contention protocols;
General Packet Radio Service (GPRS); markov renewal processes; queueing
systems; performance analysis; wireless communications",
ABSTRACT="We develop a model to quantify the performance of message transmission
systems in which users must reserve transmission resources via a
contention mechanism prior to transmission. Our work is motivated by a
desire to understand the performance characteristics of systems such as
the general packet radio service (GPRS), where the single forward link of
the wireless access system is organized as a sequence of frames, each of
which has first a contention period and then a service period. There are a
fixed number of fixed-length contention slots in each contention period.
Each contending customer chooses at random the slot in which to contend,
and success is determined by a capture model. A contender who fails waits
for the next contention period, then again chooses at random the slot in
which to contend; this process is repeated until the contender is
successful. Customers who have contended successfully are served during
the service period, which has a prescribed number of fixed-length slots,
on a first-come-first-served (FCFS) basis, with the required number of
service units being drawn independently from a general discrete
distribution having finite support. We model the system as a Markov
renewal process embedded at service departure times. We solve the model
and then compute the equilibrium distributions of the number of customers
in the system at arbitrary points in time and at customer arrival times.
Finally, we give a numerical example in which we demonstrate the
usefulness of our results in understanding the behavior of GPRS.",
URL="http://ieeexplore.ieee.org/iel5/90/27488/01224459.pdf?isNumber=27488\&prod=JNL\&arnumber=1224459\&arSt=+602\&ared=+615\&arAuthor=Daigle\%2C+J.N.\%3B+Magalhaes\%2C+M.N."
}

@INPROCEEDINGS{Dame0305:Optimal,
AUTHOR="Mohamed Oussama Damen and Hesham {El Gamal} and Norman Beaulieu",
TITLE="On Optimal Linear Space-Time Constellations",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We construct a novel class of linear space-time (ST) constellations
that achieve 
full rate and full  
diversity over quasi-static multi-antenna fading channels with 
maximum likelihood detection of polynomial complexity. We 
further 
optimize the peak to mean envelope power ratio (PMEPR) of these
constellations, such 
that one achieves a tradeoff between the PMEPR and the 
coding gain. 
The proposed constellations are proved to be optimal with respect to
the coding and diversity gains and the PMEPR when the number of
receive antennae $N=1$. 
Simulations suggest that this class of constellations is 
near-optimal when $N>1$.  
It is proved that our construction gives {\em constant modulus} ST
constellations that achieve full rate and full diversity for
any number of transmit antennae $M$ when using PSK constellations."
}

@INPROCEEDINGS{DAmi0305:Joint,
AUTHOR="Antonio Alberto D'Amico and Umberto Mengali and Michele Morelli",
TITLE="Joint {DOA} and Channel Parameter Estimation for Code-Division
Multiple-Access Systems",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We consider the uplink of a DS-CDMA system and we assume that the base
station is endowed with a linear antenna array. Transmission takes place
over a multipath channel and the goal is to estimate the channel
parameters and the directions of arrival of the signals from a user
entering the network. Maximum likelihood estimation of all these
parameters is not feasible as it involves a search over a
multi-dimensional domain. Through suitable approximations we replace the
above search by a sequence of mono-dimensional searches. This results in
an estimation algorithm of reasonable complexity for third-generation
cellular applications. The performance of the algorithm is assessed by
simulation in a scenario inspired by the specifications of the FDD
component of the UMTS standard. It is found that the channel parameters
and the directions of arrival can be estimated with accuracy close to the
Cramer-Rao bound."
}

@INPROCEEDINGS{Dane0305:Improved,
AUTHOR="Fred Daneshgaran and Massimiliano Laddomada",
TITLE="An Improved Interleaver Design Technique For Parallel Concatenated
Convolutional Codes",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper addresses the problem of optimized interleaving design for
Parallel Concatenated Convolutional Codes (PCCC) satisfying several
simultaneous requirements: 1) generate interleavers tailored to the
constituent codes of the PCCC; 2) optimize the distance spectra of the
resulting PCCC codes in order to control their asymptotic performance; and
3) use a recursive optimization technique so that the resulting
interleavers are implicitly prunable.
The optimization is achieved via constrained minimization of a cost
function closely related to the asymptotic Bit Error Rate (BER) or Frame
Error Rate (FER) of the code.
Two modifications of a previously developed iterative Interleaver Growth
Algorithm (IGA) of polynomial complexity \cite{fred1} are presented to
improve the performance of the optimized interleavers at a reduced
complexity. In particular, 1) a growing window is used to trap error
patterns of proper length in order to generate the cost function; and 2)
an error feedback technique is applied in order to further improve the
distance spectrum of the optimized PCCC scheme and to reduce complexity."
}

@INPROCEEDINGS{Dane0305:Improving,
AUTHOR="Fred Daneshgaran and Paolo Mulassano",
TITLE="Improving the Performance of Turbo Codes via Optimal Rate Allocation",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper looks at the problem of the implicit unequal error protection
observed in the asymptotic performance of most Parallel Concatenated
Convolutional Codes (PCCC) or Turbo codes. In particular we propose a new
formulation of the rate allocation problem associated with the
distribution of a fixed quota of coded bits in the trellis sections of the
upper and lower Recursive Systematic Convolutional (RSC) codes of the Turbo
code structure. The main goal of this work is the design of an effective
greedy approach for solving this rate
allocation problem via a two phase process of puncturing and repetition
coding. Sample simulation results confirm that the asymptotic performance
in terms of error floor are improved confirming the potential gain of this
approach."
}

@ARTICLE{Dani0306:WAP,
AUTHOR="Edgar Danielyan",
TITLE="{WAP:} Broken Promises or Wrong Expectations?",
JOURNAL="Internet Protocol Journal",
VOLUME=6,
NUMBER=3,
MONTH=jun,
YEAR=2003,
REFERENCES=19,
ABSTRACT="The Wireless Application Protocol (WAP) was once hailed as the ultimate
mobile Internet solution that would revolutionize how we use the Internet
and mobile phones. As you may already know, it didn't. What is to blame?
Is it bad technology, wrong time, or greedy network operators? Actually,
is there a reason to blame anyone? This article introduces WAP with its
related technologies and tries to answer these questions. Although WAP is
available on a variety of wireless mobile networks, such as those
employing Code Division Multiple Access (CDMA) IS-95, Time Division
Multiple Access (TDMA) IS-136, International Mobile Telecommunications
(IMT-2000), Universal Mobile Telecommunication System (UMTS), and Wideband
Code Division Multiple Access (W-CDMA), in addition to GSM/GPRS this
article covers WAP over GSM/GPRS networks only.",
URL="http://www.cisco.com/warp/public/759/ipj\_6-2/ipj\_6-2\_wap.html"
}

@INPROCEEDINGS{Dard0305:Exact,
AUTHOR="Davide Dardari",
TITLE="Exact analysis of joint clipping and quantization effects in high speed
{WLAN} receivers",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="An accurate method to analyze the joint effect of clipping and
 quantization in the A/D conversion in high speed
 WLAN receivers is presented.
 The model provides information about the spectral properties of the
distortion noise
 which allows the analytical characterization of the signal-to-distortion
noise ratio at the input of the
 demodulator.
 Oversampling, filtering, uniform and optimal non uniform
 quantization effects are taken into account. The optimal AGC working
point
 is evaluated for each parameters configuration.
 The differences from the results obtained by the classical pseudo
 quantization noise model are highlighted showing that, due to the
spectral characteristics,
  the gain introduced by
 oversampling is in general some decibels lower than what foreseen
 by the classical theory."
}

@TECHREPORT{Das0303:Conferences,
AUTHOR="Abhishek Das and G. Mayer-Kress and C. Gershenson and Pratik Das",
TITLE="Conferences with Internet Web-Casting as Binding Events in a Global Brain:
Example Data From Complexity Digest",
INSTITUTION="arXiv",
NUMBER="cs.NI/0303023",
MONTH=mar,
YEAR=2003,
KEYWORDS="Networking and Internet Architecture; Artificial Intelligence",
ABSTRACT="There is likeness of the Internet to human brains which has led to the
metaphor of the world-wide computer network as a `Global Brain'. We
consider
conferences as 'binding events' in the Global Brain that can lead to
metacognitive structures on a global scale. One of the critical factors
for
that phenomenon to happen (similar to the biological brain) are the
time-scales
characteristic for the information exchange. In an electronic newsletter-
the
Complexity Digest (ComDig) we include webcasting of audio (mp3) and video
(asf)
files from international conferences in the weekly ComDig issues. Here we
present the time variation of the weekly rate of accesses to the
conference
files. From those empirical data it appears that the characteristic
time-scales
related to access of web-casting files is of the order of a few weeks.
This is
at least an order of magnitude shorter than the characteristic time-scales
of
peer reviewed publications and conference proceedings. We predict that
this
observation will have profound implications on the nature of future
conference
proceedings, presumably in electronic form.",
URL="http://arXiv.org/abs/cs/0303023"
}

@INPROCEEDINGS{Das0303:Dynamic,
AUTHOR="Suman Das and Harish Viswanathan and Gee Rittenhouse",
TITLE="Dynamic Load Balancing Through Coordinated Scheduling in Packet Data
Systems",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Third generation code-division multiple access (CDMA) systems propose
to provide packet data service through a high speed shared channel
with intelligent and fast scheduling at the basestations. In the
current approach basestations schedule independently of other base
stations.  We consider scheduling schemes in which scheduling
decisions are made jointly for a cluster of cells thereby enhancing
performance through interference avoidance and dynamic load balancing.
We consider algorithms that assume complete knowledge at the
centralized scheduler of the channel quality information from each of
the basestations to the terminals as well as a two-tier scheduling
strategy that assumes only the knowledge of the long term channel
conditions at the centralized scheduler. We demonstrate that in the
case of asymmetric traffic distribution, where load balancing is most
pronounced, significant throughput gains can be obtained while the
gains in the symmetric case are modest. Since the load balancing is
achieved through centralized scheduling, our scheme can adapt to
time-varying traffic patterns dynamically."
}

@INPROCEEDINGS{Das0303:Minimum,
AUTHOR="Arindam Kumar Das",
TITLE="Minimum Power Broadcast Trees for Wireless Networks: Integer Programming
Formulations",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Wireless multicast/broadcast sessions, unlike wired networks, inherently
reaches several nodes with a single transmission.  For omnidirectional
wireless broadcast to a node, all nodes closer will also be reached.
Heuristic algorithms for constructing the minimum power tree in wireless
networks have been proposed by Wieselthier et al. and Stojmenovic et al.
Recently, an evolutionary search procedure has been proposed by Marks et
al. In this paper, we present three different integer programming models
which can be used for an optimal solution of the minimum power
broadcast/multicast problem in wireless networks. The models assume
complete knowledge of the distance matrix and is therefore most suited for
networks where the locations of the nodes are fixed."
}

@INPROCEEDINGS{Das0305:Variable,
AUTHOR="Arnab Das and Farooq Khan and Ashwin Sampath and Hsuan-Jung Su",
TITLE="A Variable Rate Channel Quality Feedback Scheme for {3G} Wireless Packet
Data Systems",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="An expanded effort is underway to support the 
evolution of the UMTS and cdma2000-1x standards to meet the 
rapidly developing needs associated with wireless Internet 
applications. A number of performance enhancing technologies 
are proposed to ensure high peak and average packet data rates 
while supporting circuit-switched voice and packet data on the 
same spectrum. These techniques include adaptive modulation and 
coding (AMC), Hybrid ARQ (H-ARQ) and fat-pipe scheduling. In 
order to enable these techniques downlink channel quality 
feedback (CQF) through explicit uplink signaling is necessary. 
Frequent CQF results in good estimates of downlink channel 
quality at the base station, which, in turn, improves downlink 
system performance. However, this comes at the expense of larger 
uplink signaling overhead, thereby impacting the overall uplink 
capacity. Infrequent CQF, on the other hand, reduces this signaling 
overhead in the uplink at the expense of larger errors in the 
channel quality estimates available at the base station, thereby 
leading to system performance degradation. In this paper, we 
present a variable rate CQF scheme that significantly reduces 
uplink signaling overhead without affecting dowlink system 
performance. In addition to simulation results demonstrating 
the performance of the proposed scheme, we also compare the 
reduction in uplink signaling overhead of the said scheme with 
other known methods."
}

@INPROCEEDINGS{Dasg0305:Evaluation,
AUTHOR="Udayan Dasgupta and Fernando Mujica and Murtaza Ali",
TITLE="Evaluation of Timing Recovery Schemes for Asymmetrical Digital Subscriber
Line {(ADSL)}",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper proposes a practical evaluation methodology for timing recovery
mechanisms in ADSL systems.
The proposed methodology decouples the generation of timing instants and
the actual introduction
of timing imperfections to transform a closed-loop problem into a more
tractable open-loop system.
This results in a simpler and less computational intensive evaluation
methodology as compared to
detailed time domain simulations.
We demonstrate the versatility of the proposed methology by evaluating
three timing recovery mechanisms, one based on a voltage controlled
crystal oscillator (VCXO) and two jitter-based mechanisms. The first
jitter-based approach applies all the jitters in the same time instant
while the second distributes the jitters over time. We also study the
effect of non-ideal system behavior, like clock jitter, on system
performance using the same framework."
}

@INPROCEEDINGS{Datt0303:Blocking,
AUTHOR="Somdip Datta and Jean-Francois Labourdette and Hisashi Kobayashi",
TITLE="Blocking in a Clos Switch in the Presence of Bicast Connections with Outer
Stage Splitting",
BOOKTITLE="Annual Conference on Information Science and Systems",
ADDRESS="John Hopkins University, Baltimore, MD",
MONTH=mar,
YEAR=2003,
REFERENCES=7,
KEYWORDS="Clos network, Bicast, Multicast, Blocking",
ABSTRACT="Clos networks, which have been widely used for large capacity
switches, have been widely studied as well for unicast connection
requests. As most of these results are not valid when the switch
has to support multicast connections, there has been some recent
interest in studying its blocking properties in the presence of
multicast connections. Tellium, Inc., where the author worked in
the summer of 2002, was interested in studying the blocking
properties of a clos switch in the presence of bidirectional
bicast connections which are vital to support protected optical
circuits in an optical switch, Tellium's main product. In this
work we have cited two approximation algorithms to estimate the
blocking probability of a switch which is not strictly
non-blocking in the presence of bicast connections. We have also
carried out simulations to compare with our analytical results and
found that they closely matched. Furthermore, we have compared two
path selection (or block selection) methods to setup connections
and found that one of them significantly reduces blocking."
}

@INPROCEEDINGS{Datt0306:Routing,
AUTHOR="Somdip Datta and Subir Biswas and Sudipta Sengupta and Debanjan Saha",
TITLE="Routing and Grooming in Two-tier Survivable Optical Mesh Networks",
BOOKTITLE="International Conference on Quality of Service (IWQoS)",
PUBLISHER="Springer Verlag",
ADDRESS="Monterey, CA",
MONTH=jun,
YEAR=2003,
REFERENCES=12,
KEYWORDS="Optical mesh networks, grooming",
ABSTRACT="While deploying the next generation of optical networks with a
mesh topology, telecommunications carriers are being confronted
with a choice between wavelength switches that can switch traffic
at SONET STS-48 (2.5 Gbps) granularity and sub-wavelength grooming
capable switches that can switch at STS-1 (51 Mbps) granularity.
The former cannot switch circuits of capacity lower than STS-48
without the help of external grooming devices, and consumes high
fragmented/unused capacity to support low capacity end to end
circuits using high capacity STS-48 channels. The latter almost
eliminates such capacity wastage by supporting STS-1 level
switching, but involves larger switching delays leading to slower
restoration and requires more complicated hardware design that
decreases switch scalability with increasing port count.

This paper proposes an intelligent packing and routing algorithm
in a network architecture which contains both kinds of switches
configured in two tiers, and compares it with the other two
network architectures - one with only wavelength switches with
STS-48 granularity, and another with only grooming switches with
STS-1 switching granularity. It is shown that the two-tier
architecture with our routing scheme is comparable in capacity
efficiency to the STS-1 only network, while its scalability and
restoration delays are at par with the STS-48 only network.

Furthermore, we propose a partial two-tier network architecture
where the functionality of STS-1 grooming is deployed at a subset
of the network nodes. Our simulations show that the capacity
efficiency of this architecture does not decrease significantly
with reduction in the number of STS-1 switch equipped nodes."
}

@INPROCEEDINGS{Datt0312:Blocking,
AUTHOR="Somdip Datta and Jean-Francois Labourdette and Hisashi Kobayashi",
TITLE="Blocking Probability of Bicast Connections in a Clos Network",
BOOKTITLE="Globecom 2003 - General Conference",
ADDRESS="San Francisco, CA",
MONTH=dec,
YEAR=2003,
REFERENCES=10,
KEYWORDS="Clos network, Bicast, Multicast, Blocking",
ABSTRACT="Clos networks, which are ubiquitous in large capacity switches,
have been widely studied for unicast connection requests. But most
of the results for unicast do not hold when the switch has to
support multicast connections. Our interest is specifically in
bicast connections which are required for setting up backup
protected circuits in optical backbone networks. In this work we
have proposed two approximation methods to estimate the blocking
probability of a switch that is not strictly non-blocking in the
presence of bicast connections. We have considered two ways of
realizing a bicast connection - by splitting the circuit at the
outer stage or at the middle stage. We have also carried out
simulations to be compared with our analytical results and found
that they closely match. Furthermore, we have compared two routing
strategies - one randomly selects an available middle stage block
and the other selects one of the highly loaded ones, and found
that the latter significantly reduces blocking."
}

@INPROCEEDINGS{Davi0305:Perceptually,
AUTHOR="Gabriele Davini and Davide Quaglia and Juan Carlos {De Martin} and Claudio
Casetti",
TITLE="Perceptually-Evaluated Loss-Delay Controlled Adaptive Transmission of
{MPEG} Video over {IP}",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper presents the Adaptive Video over IP (AViP) approach to transmit
video sequences. 
A rate-selection algorithm based on both delay and loss indications is
presented and its performance measured using actual MPEG-2 video
sequences, networks simulations and objective measures of perceptual
quality.  The results show that the AViP approach
leads to efficient use of available network resources,
reactiveness to congestions and TCP-friendliness. Moreover, AViP
delivers significantly higher perceptual levels of quality of
service than traditional constant-bit-rate systems operating at
the same average rate."
}

@INPROCEEDINGS{De0305:Does,
AUTHOR="Swades De and Chunming Qiao",
TITLE="Does Packet Replication Along Multipath Really Help?",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="For reliability in communication and simplicity, 
oftentimes packets are replicated along predetermined 
multiple routes to the destination. Alternatively, 
for traffic load balancing, data traffic is distributed
along disjoint or meshed multiple routes to the 
destination -- called selective forwarding. In this 
paper, we study and quantify the resource usage in 
these schemes, namely, packet replication and 
selective forwarding approaches. Our evaluation shows 
that for successfully routing a message using forward 
error correction coding technique, packet replication 
wastes much higher network resource, such as channel 
bandwidth and battery power."
}

@INPROCEEDINGS{Deb0303:Stability,
AUTHOR="Supratim Deb and Sanjay Shakkottai and R. Srikant",
TITLE="Stability and Convergence of TCP-like Congestion Controllers in a
Many-Flows Regime",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="With the rapid growth of Internet, parameter design and analysis for
large-scale networks has become a topic of active interest.  Since
simulation of such large scale systems is not easy, deterministic
fluid models have been widely used for both qualitative
understanding of the behavior, as well as parameter design for such
networks.
  
In this paper, we first study a deterministic fluid model for
congestion-controlled flows.  We provide conditions under which such
a system is globally asymptotically stable in the presence of
feedback delay.
  
We then study the corresponding system with the addition of web mice
and other non-responsive flows modeled as stochastic disturbances.
We show that, when there are a large number of flows, choosing
TCP parameters based on the global stability criterion for the
deterministic system (with the noise replaced by its mean value)
ensures global stability for the stochastic system as well.
  
Numerical examples and simulation results with some popular active
queue management mechanisms validate the parameter choices from
analysis. The results indicate that a system with multiple TCP-like
flows is globally stable as long as the bandwidth-delay product
per flow is not very small.

methods keyword: Control theory, Stochastic processes/Queueing theory"
}

@INPROCEEDINGS{Dejo0305:Comparison,
AUTHOR="Antoine Dejonghe and Luc Vandendorpe",
TITLE="A comparison of bit and symbol interleaving in {MMSE} turbo-equalization",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The purpose of this paper is to compare bit and symbol interleaving 
in turbo-equalization (TE) schemes. Considering a single binary encoder 
and a memoryless mapper, the corresponding transmission schemes are 
respectively bit-interleaved coded modulation (BICM) and trellis-coded 
modulation (TCM) over a static frequency selective channel. 
Appropriate turbo processing at the receiver is ensured in both cases. 
For the sake of tractability, efficient low-complexity MMSE-based 
implementations are proposed. The asymptotic performance of the 
resulting bit- and symbol-interleaved TE schemes is then linked 
with that of the underlying coded modulation schemes. As an extension 
to [Li and Ritcey: ID\_BICM vs. TCM], this enables to show that 
bit-interleaved TE with carefully chosen constellation mapping and 
proper implementation can outperform its symbol-interleaved counterpart."
}

@INPROCEEDINGS{Deng0305:Decision,
AUTHOR="Xinmin Deng and Alexander Haimovich and Javier Garcia-Frias",
TITLE="Decision Directed Iterative Channel Estimation for {MIMO} Systems",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Decision directed channel estimation is investigated
in this paper. For systems with multiple transmit antennas, high
computation complexity of the inversion of a data-dependent matrix
hinders the application of optimal channel estimation. An iterative
method is introduced to avoid the matrix inversion. Performance
of the proposed method is demonstrated by simulation
results."
}

@ARTICLE{Deri0310:M,
AUTHOR="Salem Derisavi and Peter Kemper and William Sanders and Tod Courtney",
TITLE="The Möbius state-level abstract functional interface",
JOURNAL="Performance Evaluation",
VOLUME=54,
NUMBER=2,
PAGES="105-128",
MONTH=oct,
YEAR=2003,
REFERENCES=41,
KEYWORDS="Markov chain analysis; Kronecker representation",
ABSTRACT="A key advantage of the Möbius modeling environment is the ease with
which one can incorporate new modeling formalisms, model composition and
connection methods, and model solution methods. We present a new
state-level abstract functional interface (AFI) for Möbius that allows
numerical solution methods to communicate with Möbius state-level
models via the abstraction of a labeled transition system (LTS). This
abstraction and its corresponding implementation yield a useful separation
of concerns. We illustrate use of the Möbius state-level AFI by
implementing two state-space representations and several numerical solvers
for steady-state and transient analysis.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-48WJSXK-1-47\&\_cdi=5663\&\_orig=browse\&\_coverDate=10\%2F31\%2F2003\&\_sk=999459997\&view=c\&wchp=dGLbVzz-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=64084e3801f271ada58fbdbaa3203930\&ie=f.pdf"
}

@INPROCEEDINGS{Dhar0305:Rsvp,
AUTHOR="Kalaiarul Dharmalingam",
TITLE="{RSVP} Reservation Gaps: Problems and Solutions",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="High-end networking applications such as e-commerce, multimedia,
distributed data analysis and advanced collaborative environments
feature demanding end-to-end quality of service (QoS)
requirements. Due to the heterogeneity exhibited by the Internet,
a route from source to destination for such a flow may not be
available which is comprised exclusively of QoS supporting path
segments. Hence the flow must traverse one or more non-QoS path
segments referred to here as reservation gaps.

In this paper we study the problem of reservation gaps and their
impact on QoS and present a solution to address the deficiencies
caused by such gaps, using an Active Network approach based on the
mobile agent paradigm. Furthermore, to improve the reliability in
path selection and to minimise the influence of reservation gaps
along the path of a QoS flow, we propose two routing algorithms,
the most reliable --shortest path (MR-S) algorithm and the
shortest --most reliable path (S-MR) algorithm, that select paths
with the minimum number of reservation gaps. The Active Network
based solution we propose works autonomously and scales to large
networks such as the Internet. We demonstrate the advantages of
such a solution using simulations which compares operational
characteristics of QoS flows when traversing non-managed and
actively managed reservation gaps. We also demonstrate the
benefits of employing a routing algorithm such as MR-S or S-MR
that account for reservation gaps in place of conventional
Shortest-Path routing algorithms."
}

@ARTICLE{Dhar0309:Performance,
AUTHOR="S. Dharmaraja and K. Trivedi and D. Logothetis",
TITLE="Performance modeling of wireless networks with generally distributed
handoff interarrival times",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=15,
PAGES="1747-1755",
MONTH=sep,
YEAR=2003,
REFERENCES=21,
KEYWORDS="Blocking probabilities; Handoff interarrival times; Markov regenerative
process; Quality of service; Wireless networks",
ABSTRACT="Handoff is an important issue in cellular mobile telephone systems.
Recently, studies that question the validity of the assumption of handoff
arrivals being Poissonian have appeared in the literature. The reasoning
behind this claim can be summarized as follows: even if the new call
arrival process is assumed to be Poisson, the handoff process due to
dependencies with neighboring cells, call blocking and other reasons is
not necessarily Poisson. The above-mentioned fact mandates the need to
consider more general performance models that allow for arbitrarily
distributed interarrival times. In this paper we provide numerical
solutions for new and handoff call blocking probabilities with arbitrary
handoff interarrival time distribution. For this purpose, we first prove
that the underlying stochastic process is a Markov regenerative process
and subsequently we use their mathematical theory to develop numerical
techniques for important Quality of Service measures. Our results can be
seen as a generalization of the recent work by Haring et al. [IEEE Trans.
Vehi. Technol. 50 (2001) 664] where handoff traffic was assumed to form a
Poisson process. Our work can be used for more accurate dimensioning of
cellular systems with realistic traffic.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47YPYD6-3-6X\&\_cdi=5624\&\_orig=browse\&\_coverDate=09\%2F22\%2F2003\&\_sk=999739984\&view=c\&wchp=dGLbVzz-zSkzS\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=60f8b72e1c48703bb361686168b97453\&ie=f.pdf"
}

@TECHREPORT{Diet0310:Information,
AUTHOR="Thomas Dietz and Falko Dressler and Georg Carle and Benoit Claise",
TITLE="Information Model for Packet Sampling Exports",
TYPE="Internet-Draft",
INSTITUTION="IETF",
NUMBER="draft-ietf-psamp-info-00",
MONTH=oct,
YEAR=2003,
URL="http://www7.informatik.uni-erlangen.de/~dressler/publications/draft-ietf-psamp-info-00.txt"
}

@INPROCEEDINGS{Digg0305:Multiuser,
AUTHOR="Suhas Diggavi and Naofal Al-Dhahir and A. Robert Calderbank",
TITLE="Multiuser joint equalization and decoding of space-time codes",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper we study the multiple-access channel where users employ
space-time block codes (STBC).  The problem is formulated in the
context of an inter-symbol interference (ISI) multiple-access channel.
The algebraic structure of the STBC is utilized to design joint
interference suppression, equalization, and decoding schemes.  Each
user transmits using $2$ transmit antennas and a time-reversed
space-time block code suitable for frequency-selective channels. We
first show that a diversity order of $2M\_r(\nu+1)$ is achievable at
full transmission rate for each user, when we have $M\_r$ receive
antennas, channel memory of $\nu$ and an optimal multiuser
maximum-likelihood (ML) decoder is used.  Due to the decoding
complexity of the ML detector we study the algebraic structure of
linear multiuser detectors which utilize the properties of the STBC.
We do this both in the transform domain (D-domain formulation)  and when
we impose finite block length constraints (matrix formulation). The
receiver is designed to utilize the algebraic structure of the codes
in order to preserve the block quaternionic structure of the
equivalent channel for each user."
}

@INPROCEEDINGS{Digh0305:Energy,
AUTHOR="Fadel Digham and Mohamed-Slim Alouini and Marvin Simon",
TITLE="On the Energy Detection of Unknown Signals over Fading Channels",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper presents another look at the problem of energy
detection of unknown signals over different fading channels. We
start with the no diversity case and present some alternative
closed-form expressions for the probability of detection P\_d
to those recently reported in Kostylev's paper in ICC02 conference. We
then investigate the system performance when different diversity
schemes are employed. It is shown that there is not much
improvement in the probability of detection when either the
probability of false alarm P\_f exceeds 0.1, the average
signal-to-noise ratio (SNR) exceeds 20 dB or the Nakagami
parameter $m$ exceeds 2. In addition, receiver operating
characteristics (ROC) curves comparing the performance of
equal-gain combining (EGC), selection combining (SC), and switch
and stay combining (SSC) are presented. As an example, EGC, SC,
and SSC achieve a P\_d of 0.9998, 0.997, and 0.995,
respectively at a P\_f value of 0.1."
}

@INPROCEEDINGS{Digh0305:Variable,
AUTHOR="Fadel Digham and Mohamed-Slim Alouini and Sant Arora",
TITLE="Variable-Rate Variable-Power {M-FSK} Scheme for Power Limited Systems",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The first two authors have recently proposed a variable-rate and
fixed-power (VRFP) non-coherent M-ary frequency shift keying (M-FSK)
scheme for power limited systems. 
In this paper, we propose a variable-rate and variable-power
(VRVP) scheme which lands itself in many applications,
specifically for power limited systems. We impose the power
assignment or power loading as a design variable to minimize the
objective function which is the average transmitted power while
meeting the average spectral efficiency and bit error rate (BER)
constraints. The power allocation mechanism is executed based on
the channel gain feedback estimates. Our results show that the
proposed system provides power saving varying from roughly 2.5 up
to 5 dB. Moreover, the power loading function exhibits two
interesting features. The first is that its peak is always less
than the fixed amount of power used to guarantee the same system
performance. The second is the self control type of behavior in
which the peak occurs at a moderate value of channel gain while it
tends to allocate less power at both high and low values of
channel gain. We further investigate the problem with an
additional maximum power constraint. In this case, we obtain a
modified power loading function which can still fulfill the rate
constraint up to a certain limit after which there is a rate
maximum-power tradeoff."
}

@ARTICLE{Ding0302:Survey,
AUTHOR="Aijun Ding and Gee-Swee Poo",
TITLE="A survey of optical multicast over {WDM} networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=2,
PAGES="193-200",
MONTH=feb,
YEAR=2003,
REFERENCES=36,
KEYWORDS="Optical multicast; WDM networks; Multicast routing; optical components",
ABSTRACT="Multicast applications such as multimedia, medical imaging, digital audio
and video conferencing are bandwidth-intensive. With the advance in
optical technology providing abundant bandwidth, it is natural to extend
the multicast concept to optical networks in order to gain enhanced
performance. This paper provides a comprehensive review of optical
multicast techniques, covering the main optical multicast concept, the
optical multicast switches, the multicast over single-hop
broadcast-and-select networks, the multicast over multi-hop wide area mesh
networks, and the related challenging algorithms developed for multicast
routing in the optical domain.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-462BR6W-3-J\&\_cdi=5624\&\_orig=browse\&\_coverDate=02\%2F01\%2F2003\&\_sk=999739997\&view=c\&wchp=dGLbVtz-zSkzk\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=e67c0d02219768acb1ad39c5509492d2\&ie=f.pdf"
}

@INPROCEEDINGS{Ding0305:Type,
AUTHOR="Zhihong Ding and Michael Rice",
TITLE="Type-I Hybrid-ARQ Using {MTCM} Spatio-Temporal Vector Coding for {MIMO}
Systems",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="A system that combines MTCM modified for type-I hybrid-ARQ error control 
with space-time vector coding (STVC) for use over a slowly varying MIMO
channel is presented. An idealistic retransmission protocol is defined
that maximizes the channel utilization is described and analyzed.
Numerical examples, based on a set of simple 8-state trellis codes
providing a granularity of 0.5 bit per 2-dimensional symbol, demonstrate
that this simple type-I hybrid-ARQ system can reduce the code gap by
the same amount as an FEC system based on a set of 64-state trellis codes.
This shows that type-I hybrid-ARQ STVC can close the code gap 
(the SNR gap between actual performance and channel capacity) 
without an increase in the code complexity or a decrease in performance.
We also demonstrate the limitations of this approach: as the bit
error rate increases and the probability of retransmission increases,
the channel utilization drops. As a consequence, the code gap does not
decrease or even increases."
}

@INPROCEEDINGS{Djor0305:Forward,
AUTHOR="Ivan Djordjevic and Bane Vasic",
TITLE="A Forward Error Correction Scheme for Ultra Long Haul Optical Transmission
Systems Based on Low-Density Parity-Check Codes",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="FEC scheme based on LDPC codes is presented in this paper. We show that
LDPC codes provide a significant system performance improvement with
respect to the state-of-the-art FEC schemes, such as BCH and RS codes,
employed in optical communications systems. The system performance is
further improved by a code design that eliminates short cycles in a graph
employed in iterative decoding. As opposed to additive white Gaussian
noise (AWGN) model for optical fiber channel, which is used very often in
the analysis of error controlling schemes, our model takes into account
all major impairments in a long-haul optical transmission such as ASE
noise, pulse distortion due to fiber nonlinearities, chromatic dispersion,
crosstalk, intersymbol-interference, etc."
}

@ARTICLE{Do0306:Effect,
AUTHOR="Mi-Sun Do and Jung-shin Park and HahnEarl Jeon and  Jai-YongLee",
TITLE="The effect of spreading gain control on a {CDMA} slotted {ALOHA} system",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=9,
PAGES="996-1006",
MONTH=jun,
YEAR=2003,
REFERENCES=15,
KEYWORDS="CDMA; Slotted ALOHA; Capture probability; Spreading gain control",
ABSTRACT="In a CDMA slotted ALOHA channel, the bit rate of user information is
determined by a spreading gain. The large value of spreading gain enhances
the packet throughput by increasing the probability of a successful packet
transmission. However, it degrades the effective throughput by reducing
the number of information bits carried via a packet. To solve the problem,
we investigated the effect of spreading gain control (SGC) on both
throughputs, and evaluated the throughput performance for various SGC
schemes. The results show that variable SGC achieves considerably higher
effective throughput by adjusting the value of spreading gain to
interference level.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47907VR-1-5S\&\_cdi=5624\&\_orig=browse\&\_coverDate=06\%2F02\%2F2003\&\_sk=999739990\&view=c\&wchp=dGLbVzz-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=72a488b56bce95b4fb4822f5794883b9\&ie=f.pdf"
}

@INPROCEEDINGS{Dole0303:Multicast,
AUTHOR="Danny Dolev and Osnat Mokryn and Yuval Shavitt",
TITLE="On Multicast Trees: Structure and Size Estimation",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="This work presents a thorough investigation of the structure
of multicast trees cut from the Internet and power-law topologies.
Based on both generated topologies and real Internet data,
we characterize the structure of such trees and show that they
obey the rank-degree power law; that most high degree tree nodes 
are concentrated in a low diameter neighborhood; and that the
sub-tree size also obeys a power law.

Our most surprising empirical finding suggests that there is a linear
ratio
between the number of high-degree network nodes, namely nodes whose 
tree degree is higher than some constant, and the number of 
leaf nodes in the multicast tree (clients). 
We also derive this ratio analytically.
Based on this finding, we develop the Fast Algorithm, that 
estimates the number of clients, and show that it converges 
faster than one round trip delay from the root to a randomly selected
client."
}

@TECHREPORT{Dolg0303:Measurements,
AUTHOR="Dmitry Dolgikh and Andrei Sukhov",
TITLE="The measurements, parameters and construction of Web proxy cache",
INSTITUTION="arXiv",
NUMBER="cs.NI/0303012",
MONTH=mar,
YEAR=2003,
KEYWORDS="Networking and Internet Architecture",
ABSTRACT="The aim of this paper is an experimental study of cache systems in order to
optimize proxy cache systems and to modernize construction principles. Our
investigations lead to the criteria for the optimal use of storage
capacity and
allow the description of the basic effects of the ratio between
construction
parts, steady-state performance, optimal size, etc. We want to outline
that the
results obtained and the plan of the experiment follow from the
theoretical
model. Special consideration is given to the modification of the key
formulas
supposed by Wolman at al.",
URL="http://arXiv.org/abs/cs/0303012"
}

@TECHREPORT{Dolg0303:Theoretical,
AUTHOR="Dmitry Dolgikh and Andrei Sukhov",
TITLE="Theoretical study of cache systems",
INSTITUTION="arXiv",
MONTH=mar,
YEAR=2003,
ABSTRACT="The aim of this paper is a theoretical study of a cache system in order to
optimize proxy cache systems and to modernize construction principles
including
prefetching schemes. Two types of correlations, Zipf-like distribution and
normalizing conditions, play a role of the fundamental laws. A
corresponding
system of equations allows to describe the basic effects like ratio
between
construction parts, steady-state performance, optimal size, long-term
prefetching, etc. A modification of the fundamental laws leads to the
description of new effects of documents' renewal in the global network. An
internet traffic caching system based on Zipf-like distribution (ZBS) is
invented. The additional module to the cache construction gives an
effective
prefetching by lifetime.",
URL="http://arXiv.org/abs/cs/0303014"
}

@INPROCEEDINGS{Dong0305:Low,
AUTHOR="Bin Dong and Steven Blostein",
TITLE="Low Complexity {PN} Code Acquisition with Tree Search in Wideband {CDMA}
Multipath Channels",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we propose a novel matched filter-type parallel code
acquisition scheme to detect
uplink short-code wideband CDMA multipath signals. A tree-structured
parallel adaptive network of RAKE fingers is created for all possible
shifts and users. Employing a sequential 
detection scheme, only viable fingers are used to generate the output
decision statistics. 
Monte-Carlo computer simulations and numerical calculations have been
carried out to study
the performance of the algorithm in single-path and multipath channels
corrupted with co-channel interference (CCI) and additive Gaussian white
noise (AWGN). Both simulation and
numerical calculations demonstrate that the proposed algorithm can, at the
expense of signal
combining loss, significantly reduce the computation complexity and
latency of the reciever.
Additional signal combining loss is also quantified when the channel
estimation error from
weighted multislot averaging (WMSA) is taken into account."
}

@INPROCEEDINGS{Dong0305:Ser,
AUTHOR="Xiaodai Dong",
TITLE="{SER} of Two-Dimensional Signalings in Rayleigh Fading with Channel
Estimation Error",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="A general analytic framework to evaluating the performance of practical
coherent two-dimensional (2-D) signaling in frequency flat Rayleigh fading
with the channel estimation is proposed in this paper. A new and simple
analytical expression for the symbol error rate (SER) of an arbitrary 2-D
constellation in Rayleigh fading in the presence of channel estimation
error is presented. This framework is applicable to many current channel
estimation methods such as pilot symbol aided modulation and minimum mean
square error estimation where the fading estimate is a complex Gaussian
variable correlated with the channel fading. The sensitivity of various
2-D signaling formats to static and dynamic channel amplitude and phase
estimation errors in Rayleigh fading can be easily studied using the
derived formula. The new exact SER expression makes it possible to
optimize constellation parameters and various parameters associated with
channel estimation schemes. It also provides insights into choosing an
appropriate signaling format for
a fading environment with practical channel estimation methods used at the
receiver."
}

@INPROCEEDINGS{Douf0305:Evaluation,
AUTHOR="Angela Doufexi and Simon Armour and Beng-Sin Lee and Andrew Nix and David
Bull",
TITLE="An Evaluation of the Performance of {IEEE} 802.11a and 802.11g Wireless
Local Area Networks in a Corporate Office Enrivonment",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In recent years there has been considerable interest in the development of
standards for Wireless Local Area Networks. In particular, IEEE's 802.11
standard has now been extended to a family of WLAN standards. 802.11a and
802.11g both employ Coded Orthongonal Frequency Division Multiplexing
(COFDM) but operate in different frequency bands. In this paper, the
performance and relative merits of 802.11a and 802.11g are compared for
the scenario of a corporate office wireless LAN application. It is shown
that for comparable scenarios 802.11g achieves superior range but that
802.11a achieves higher data rates. Thus the two standards are found to
have complimentary strengths and weaknesses."
}

@INPROCEEDINGS{Douk0305:Blind,
AUTHOR="Xenofon Doukopoulos and George Moustakides",
TITLE="Blind Channel Estimation for Downlink {CDMA} Systems",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The problem of channel estimation in code-division
multiple-access (CDMA) systems is considered. Using only the
spreading code of the user of interest, a technique is
proposed to identify the impulse response of the multipath
channel from the received data sequence. While existing
blind methods suffer from high computational complexity
and sensitivity to accurate knowledge of
the noise subspace rank, the proposed method overcomes both
problems. In particular we estimate the noise subspace by a
simple matrix power that is computationally efficient and
requires no knowledge of the noise subspace rank. Once an
estimate of the noise subspace is available the channel
impulse response can be directly identified through a small
size (order of the channel) SVD or a least squares approach.
Extensive simulations demonstrate similar performance of our
method as compared to the existing schemes but at a
considerably lower computational cost."
}

@INPROCEEDINGS{Dous0303:Impact,
AUTHOR="Olivier Dousse and Francois Baccelli and Patrick Thiran",
TITLE="Impact of Interferences on Connectivity in Ad Hoc Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We study the impact of interferences on the connectivity of
large-scale ad-hoc networks, using percolation theory. We assume
that a bi-directional connection can be set up between two nodes
if the signal to noise ratio at reception is larger than some threshold. 
The noise is the sum of the contribution of
interferences from all other nodes, weighted by a coefficient g, 
and of a background noise.

We find that there is a critical value of g above which
the network is made of disconnected clusters of nodes. We also
prove that if g is non zero but small enough, there exist
node spatial densities for which the network contains a large
(theoretically infinite) cluster of nodes, enabling distant nodes to
communicate in multiple hops. 
Since small values of g cannot be achieved without efficient CDMA 
codes, we investigate the use of a very simple TDMA scheme, where 
nodes can emit only every n-th time slot. We show qualitatively
that it even achieves a better connectivity than the previous system 
with a parameter g/n."
}

@ARTICLE{Dovr0302:Dynamic,
AUTHOR="Constantinos Dovrolis and Parmesh Ramanathan",
TITLE="Dynamic class selection and class provisioning in proportional
differentiated services",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=3,
PAGES="204-221",
MONTH=feb,
YEAR=2003,
REFERENCES=32,
KEYWORDS="Packet sheduling; quality of service; network pricing; network capacity;
adaptive applications",
ABSTRACT="The relative differentiation architecture does not require per-flow state
at the network core or edges, nor admission control, but it can only
provide higher classes with better service than lower classes. A central
premise in the relative differentiation architecture is that users with an
absolute QoS requirement can dynamically search for a class, which provides
the desired QoS level. In the first part of this paper, we investigate this
Dynamic Class Selection (DCS) framework in the context of Proportional
Delay Differentiation (PDD). We illustrate that, under certain conditions,
DCS-capable users can meet absolute QoS requirements, even though the
network only offers relative differentiation. For a simple link model, we
give an algorithm that checks whether it is feasible to satisfy all users,
and if this is the case, computes the minimum acceptable class selection
for each user. Users converge in a distributed manner to this minimum
acceptable class, if the DCS equilibrium is unique. However, suboptimal
and even unacceptable DCS equilibria may also exist. Simulations of an
end-to-end DCS algorithm provide further insight in the dynamic behavior
of DCS, show the relation between DCS and the network Delay
Differentiation Parameters (DDPs), and demonstrate how to control the
trade-off between a flow's performance and cost using DCS.

In the second part of the paper, we consider the related problem of class
provisioning. At the provisioning phase, the network manager configures
the link to support the QoS requirements of all traffic types. Each
traffic type is specified by an expected arrival rate and a delay
requirement. The objective of the provisioning phase is to jointly
determine: the minimum link capacity needed to support the given traffic
types, the nominal class of service for each traffic type, and the
appropriate resource allocation between classes. Our class provisioning
methodology is also based on PDD. The major advantage of PDD is that it
avoids the computation of an explicit bandwidth share for each class. The
class provisioning methodology is illustrated with examples.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-46HBS2J-1-DY\&\_cdi=5624\&\_orig=browse\&\_coverDate=02\%2F15\%2F2003\&\_sk=999739996\&view=c\&wchp=dGLbVzz-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=580cb7cd1ab9098066966671cb257671\&ie=f.pdf"
}

@TECHREPORT{draft-wu-sipping-floor-control,
AUTHOR="Xiaotao Wu and Petri Koskelainen and Henning Schulzrinne",
TITLE="Conference Floor Control Protocol",
TYPE="Internet Drafts",
INSTITUTION="Internet Engineering Task Force",
YEAR=2003,
ABSTRACT="During a conference, floor control coordinates simultaneous access to
shared resource in multimedia conferences. Floor control allows
applications and users to gain safe and mutually exclusive or non-
exclusive access to the shared resources. This document defines the
data format of the floor control events and commands.",
URL="http://www1.cs.columbia.edu/~xiaotaow/rer/Research/Paper/draft-wu-sipping-floor-control-04.txt"
}

@ARTICLE{Drek0309:Preemptive,
AUTHOR="Steve Drekic",
TITLE="A preemptive resume queue with an expiry time for retained service",
JOURNAL="Performance Evaluation",
VOLUME=54,
NUMBER=1,
PAGES="59-74",
MONTH=sep,
YEAR=2003,
REFERENCES=32,
KEYWORDS="LaplaceStieltjes transform; Preemptive resume; Preemptive repeat; Expiry
time; Flow time; Interruption time",
ABSTRACT="This paper introduces a new variant of the classical preemptive resume
priority queue, in which the partially rendered service of an interrupted
task is retained only if the time spent serving the higher priority work
falls below a specified threshold. Both preemptive repeat-different (RD)
and preemptive repeat-identical (RI) strategies are considered in the
event that service is to start over. The LaplaceStieltjes transforms
(LSTs) of the waiting time and flow time distributions are derived for
each class. Using a recursive procedure to derive the moments of
interruption times, the first two moments of the waiting time and flow
time are also obtained. The results are then applied to two numerical
examples.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-4817DX4-2-78\&\_cdi=5663\&\_orig=browse\&\_coverDate=09\%2F30\%2F2003\&\_sk=999459998\&view=c\&wchp=dGLbVzz-zSkWW\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=606cb8c58edc72a5201a67274ca12fb1\&ie=f.pdf"
}

@INPROCEEDINGS{Dres0301:Approach,
AUTHOR="Falko Dressler",
TITLE="An Approach to Select a Best Suitable Video Server",
BOOKTITLE="International Conference on Advances in Infrastructure for Electronic
Business, Education, Science, Medicine, and Mobile Technologies on the
Internet (SSGRR)",
ADDRESS="L'Aquila, Italy",
MONTH=jan,
YEAR=2003,
URL="http://net.informatik.uni-tuebingen.de/~dressler/publications/ssgrr-2003w-abstract\_en.html,http://net.informatik.uni-tuebingen.de/~dressler/publications/ssgrr-2003w.pdf"
}

@PHDTHESIS{Dres0305:Monitoring,
AUTHOR="Falko Dressler",
TITLE="Monitoring of Multicast Networks for Time-Synchronous Communication",
SCHOOL="University of Erlangen-Nuremberg",
ADDRESS="Erlangen, Germany",
MONTH=may,
YEAR=2003,
URL="http://net.informatik.uni-tuebingen.de/members/dressler/publications/dissertation-abstract\_en.html,http://net.informatik.uni-tuebingen.de/~dressler/publications/dissertation.pdf"
}

@MISC{Dres0305:Scalable,
AUTHOR="Falko Dressler",
TITLE="Scalable QoS Measurements in Multicast Environments",
HOWPUBLISHED="Poster",
MONTH=may,
YEAR=2003,
NOTE="Dept. of Computer Sciences, University of Erlangen",
URL="http://www7.informatik.uni-erlangen.de/~dressler/publications/mqm-poster-2003-abstract\_en.shtml"
}

@INPROCEEDINGS{Dres0307:Considerations,
AUTHOR="Falko Dressler",
TITLE="Considerations on Selection Criteria for Sources of Multimedia Traffic",
BOOKTITLE="World Multiconference on Systematics, Cybernetics and Informatics (SCI)",
ADDRESS="Orlando, Florida, USA",
PAGES="34-38",
MONTH=jul,
YEAR=2003,
URL="http://net.informatik.uni-tuebingen.de/~dressler/publications/sci2003-abstract\_en.html,http://net.informatik.uni-tuebingen.de/~dressler/publications/sci2003.pdf"
}

@INPROCEEDINGS{Dres0308:Metric,
AUTHOR="Falko Dressler",
TITLE="A Metric for Numerical Evaluation of the QoS of an Internet Connection",
BOOKTITLE="International Teletraffic Congress (ITC)",
PUBLISHER="Elsevier",
ADDRESS="Berlin, Germany",
MONTH=aug,
YEAR=2003,
URL="http://net.informatik.uni-tuebingen.de/~dressler/publications/itc18-abstract\_en.html,http://net.informatik.uni-tuebingen.de/~dressler/publications/itc18.pdf"
}

@INPROCEEDINGS{Dres0311:Availability,
AUTHOR="Falko Dressler",
TITLE="Availability Analysis in Large Scale Multicast Networks",
BOOKTITLE="IASTED International Conference on Parallel and Distributed Computing and
Systems (PDCS)",
ORGANIZATION="IASTED",
ADDRESS="Marina del Rey, CA",
PAGES="399-403",
MONTH=nov,
YEAR=2003,
URL="http://net.informatik.uni-tuebingen.de/~dressler/publications/pdcs2003-abstract\_en.html,http://net.informatik.uni-tuebingen.de/~dressler/publications/pdcs2003.pdf"
}

@INPROCEEDINGS{Dres0311:Scalable,
AUTHOR="Falko Dressler",
TITLE="A Scalable Environment for Quality of Service Measurements in the Internet",
BOOKTITLE="IASTED International Conference on Communications, Internet, and
Information Technology (CIIT)",
ORGANIZATION="IASTED",
ADDRESS="Scottsdale, AZ, USA",
PAGES="307-312",
MONTH=nov,
YEAR=2003,
URL="http://net.informatik.uni-tuebingen.de/~dressler/publications/ciit2003b-abstract\_en.html,http://net.informatik.uni-tuebingen.de/~dressler/publications/ciit2003b.pdf"
}

@INPROCEEDINGS{Dres0311:Voice,
AUTHOR="Falko Dressler and Ursula Hilgers and Peter Holleczek",
TITLE="Voice over {IP} in the German Research Network: Challenges and Solutions",
BOOKTITLE="IASTED International Conference on Communications, Internet, and
Information Technology (CIIT)",
ORGANIZATION="IASTED",
ADDRESS="Scottsdale, AZ, USA",
PAGES="710-714",
MONTH=nov,
YEAR=2003,
URL="http://net.informatik.uni-tuebingen.de/~dressler/publications/ciit2003a-abstract\_en.html,http://net.informatik.uni-tuebingen.de/~dressler/publications/ciit2003a.pdf"
}

@INPROCEEDINGS{DSou0303:Measuring,
AUTHOR="Raissa D'Souza and Sharad Ramanathan and Duncan {Temple Lang}",
TITLE="Measuring performance of ad hoc networks using timescales for information
flow",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We define metrics to characterize the performance of ad hoc networks
based on timescales for information flow, power consumption and
interference. The statistical distribution of timescales has not been
previously considered. Yet, it is important for understanding the
feasibility of communicating over such networks, for comparing
different algorithms for building up network topology and for
distinguishing regimes of routing.  We quantify the longest timescale
for information flow and estimate its distribution.  We also introduce
a decentralized adaptive power algorithm, that uses only information
local to each device, for building ad hoc networks. This algorithm is
shown to perform significantly better by all our metrics when compared
with a standard, constant power, algorithm."
}

@INPROCEEDINGS{Duan0305:Capacity,
AUTHOR="Xiang Duan and Zhisheng Niu and Junli Zheng",
TITLE="Capacity Analysis of Uplink and Downlink in Multimedia {DS-CDMA} Systems
Based On Constraint Models",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Capacity analysis in wireless communication systems is essential for system
design, call admission
control and radio resource allocation. Since CDMA is a kind of
power-constrained or
interference-limited system, its system capacity is not so ``hard'' as in
bandwidth-limited
systems, such as TDMA-based systems. In this paper, we analyze the uplink
and downlink capacity of
multimedia DS-CDMA systems based on constraint models. System capacity is
given by \emph{feasible
condition}, which is the sufficient and necessary condition of the
existence of feasible solutions
to the constraint model. As a byproduct, we also deduct the optimum
solution to uplink and downlink
transmit power minimization problem, which can be used as references for
power control and radio
resource allocation multimedia DS-CDMA systems."
}

@ARTICLE{Duan0312:Service,
AUTHOR="Zhenhai Duan and Zhi-Li Zhang and Yiwei Hou",
TITLE="Service Overlay Networks: SLAs, QoS, and Bandwidth Provisioning",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=6,
PAGES="870-883",
MONTH=dec,
YEAR=2003,
REFERENCES=18,
KEYWORDS="bandwidth provisioning; overlay networks; service level agreements",
ABSTRACT="We advocate the notion of service overlay network (SON) as an effective
means to address some of the issues, in particular, end-to-end quality of
service (QoS), plaguing the current Internet, and to facilitate the
creation and deployment of value-added Internet services such as VoIP,
Video-on-Demand, and other emerging QoS-sensitive services. The SON
purchases bandwidth with certain QoS guarantees from the individual
network domains via bilateral service level agreement (SLA) to build a
logical end-to-end service delivery infrastructure on top of the existing
data transport networks. Via a service contract, users directly pay the
SON for using the value-added services provided by the SON. In this paper,
we study the bandwidth provisioning problem for a SON which buys bandwidth
from the underlying network domains to provide end-to-end value-added QoS
sensitive services such as VoIP and Video-on-Demand. A key problem in the
SON deployment is the problem of bandwidth provisioning, which is critical
to cost recovery in deploying and operating the value-added services over
the SON. The paper is devoted to the study of this problem. We formulate
the bandwidth provisioning problem mathematically, taking various factors
such as SLA, service QoS, traffic demand distributions, and bandwidth
costs. Analytical models and approximate solutions are developed for both
static and dynamic bandwidth provisioning. Numerical studies are also
performed to illustrate the properties of the proposed solutions and
demonstrate the effect of traffic demand distributions and bandwidth costs
on SON bandwidth provisioning.",
URL="http://ieeexplore.ieee.org/iel5/90/28078/01255426.pdf?isNumber=28078\&prod=JNL\&arnumber=1255426\&arSt=+870\&ared=+883\&arAuthor=Zhenhai+Duan\%3B+Zhi-Li+Zhang\%3B+Hou\%2C+Y.T."
}

@INPROCEEDINGS{Dube0303:Goodput,
AUTHOR="Parijat Dube and Eitan Altman",
TITLE="Goodput Analysis of a Fluid Queue with Selective Discarding and a
Responsive Bursty Source",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="In this paper we analyse a feedback system consisting of a finite buffer
fluid 
queue and a responsive source. The source alternates between silence
periods 
and active periods. At random epochs of times the source becomes ready to
send 
a burst of fluid. The length of the bursts (length of the active periods) 
are indepenedent and identically distributed with some general
distribution. 
The queue employs a threshold discarding policy in the sense that only 
those burts at whose commencement epoch (the instant at which the source 
is ready to send), the workload (i.e., the amount of fluid in the buffer) 
is less than some preset threshold are accepted. If the burst is rejected 
then the source backs off from sending and goes into a silence period.
Using techniques from Volterra Integral Equations we obtain an explicit 
characterization of the queue length distribution at commencement epochs 
of bursts from which we obtain an explicit characterization of the 
goodput ratio associated with such a feedback system. For the particular 
case of exponential distribution of on-periods we are able to obtain 
explicit closed form expression for the goodput ratio. Our explicit 
characterizations shall be quite helpful in studying the sensitivity of 
goodput ratio to different parameters, in selecting optimal discarding 
threshold etc. which will further provide useful ``engineering'' 
guideines for better network designing."
}

@ARTICLE{Dube0308:Loss,
AUTHOR="Parijat Dube and Omar Ait-Hellal and Eitan Altman",
TITLE="On loss probabilities in presence of redundant packets with random drop",
JOURNAL="Performance Evaluation",
VOLUME=53,
NUMBER="3-4",
PAGES="147-167",
MONTH=aug,
YEAR=2003,
REFERENCES=9,
KEYWORDS="Queueing analysis; Forward error correction; Poisson process; Loss
probabilities; Generating functions; Ballot theorems",
ABSTRACT="The purpose of this paper is to study the loss probabilities of messages in
an M/M/1/K queueing system where in addition to losses due to buffer
overflow there are also random losses in the incoming and outgoing links.
We focus on the influence of adding redundant packets to the messages (as
in error correction coding, e.g. ReedSolomon code, etc.). In the first
part we use multi-dimensional probability generating functions for solving
the recursions which generalize those introduced by Cidon et al. [IEEE
Trans. Inform. Theory 39 (1) (1993) 98] for computing the loss
probabilities and derive analytical formulae for a special case. In the
second part of the paper we use combinatorial arguments and Ballot theorem
results to alternatively obtain the loss probabilities. The analytical
results allow us to investigate when does adding redundancy decrease the
loss probabilities.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-48SP8VM-1-C6\&\_cdi=5663\&\_orig=browse\&\_coverDate=08\%2F31\%2F2003\&\_sk=999469996\&view=c\&wchp=dGLbVtz-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=8b8e5189a2f3eeb2b8cbae5d613baa18\&ie=f.pdf"
}

@INPROCEEDINGS{Duch0309:Alternatives,
AUTHOR="Daniel Duchamp",
TITLE="Alternatives to End-to-End Congestion Control",
BOOKTITLE="New York Metro Area Networking Workshop 2003",
ADDRESS="Bern Dibner Library Building, LC400,  Polytechnic University,  5 Metrotech
Cente",
DAYS=12,
MONTH=sep,
YEAR=2003,
ABSTRACT="Work on congestion control has always been focused on end-to-end transport
layer techniques.  The reason is that there are only two layers of
protocol in the TCP/IP architecture, and IP is limited to being a dumb
routign layer.  This paper explains a new architecture for the Internet
that introduces a third layer of protocol, at the ``session layer'' above
transport.  The session layer handles end-to-end delivery verification,
freenig the transport layer to focus on congestion control techniques that
need not necessarily be end-to-end.  Accordingly, the paper proposes an
inter-router congestion control protocol that would operate at the
transport layer."
}

@INPROCEEDINGS{Dunk03:Full,
AUTHOR="Adam Dunkels",
TITLE="Full {TCP/IP} for 8 Bit Architectures",
BOOKTITLE="First International Conference on Mobile Systems, Applications and Services
(MobiSys)",
ORGANIZATION={<a href={"}#USENIX{"}>USENIX</a>},
ADDRESS="San Francisco",
YEAR=2003,
ABSTRACT="We describe two small and portable TCP/IP implementations fulfilling the
subset of RFC1122 requirements needed for full host-to-host
interoperability. Our TCP/IP implementations do not sacrifice any of TCP's
mechanisms such as urgent data or congestion control. They support IP
fragment reassembly and the number of multiple simultaneous connections is
limited only by the available RAM. Despite being small and simple, our
implementations do not require their peers to have complex, full-size
stacks, but can communicate with peers running a similarly light-weight
stack. The code size is on the order of 10 kilobytes and RAM usage can be
configured to be as low as a few hundred bytes."
}

@INPROCEEDINGS{Dura0305:Upper,
AUTHOR="Ozgur Dural and John Proakis",
TITLE="Upper Bounds on Error Probability of Serially Concatenated Convolutional
Codes and {MSK} in {AWGN} and Fading Channels",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Serial concatenation of convolutional codes and MSK through an interleaver
has a similar structure as turbo codes. Although the union bound which is
an analytical tool to estimate the bit error probability of such systems
is tight for high signal-to-noise ratio (SNR), it diverges for low SNR
where the performance of our system is the most appealing. For this
reason, we apply improved upper bounding techniques to our system to
estimate the performance at low SNR. We show that by applying these
techniques, it is possible to obtain about $0.5dB$ or more improvement
over the union bound in AWGN channel and $1dB$ or more improvement in
fading channels."
}

@INPROCEEDINGS{Duri0305:Performance,
AUTHOR="Giuseppe Durisi and Sergio Benedetto",
TITLE="Performance Evaluation and Comparison of Different Modulation Schemes for
{UWB} Multiaccess Systems",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Ultra wideband system performance is analyzed in terms of error
probability for different  modulation and multiaccess schemes over
the AWGN channel. The analysis leads to closed-form expressions of
the bit error probability  under the hypothesis of chip
synchronous systems, allowing a comparison of different techniques
in a possible scenario for UWB applications. The use of
convolutional code to improve the performance of Time Hopping
systems is also addressed."
}

@INPROCEEDINGS{Dutt0303:Oblivious,
AUTHOR="Debojyoti Dutta and Ashish Goel and John Heidemann",
TITLE="Oblivious {AQM} and Nash Equilibria",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="An oblivious Active Queue Management scheme is one which does not 
differentiate between packets belonging to different flows. In this 
paper, we study the existence and the quality of Nash equilibria 
imposed by oblivious AQM schemes on selfish agents. Oblivious AQM 
schemes are of obvious importance because of the ease of implementation
and 
deployment, and Nash equilibrium offers valuable clues into network 
performance under non-cooperative user behavior. Specifically, we ask
the following three questions: 
1. Do there exist oblivious AQM schemes that impose Nash equilibria
on selfish agents?
2. Are the imposed equilibria, if they exist,  efficient in terms of
the goodput obtained and the drop probability experienced at the 
equilibrium?
3. How easy is it for selfish users to reach the Nash equilibrium state?
We assume that the traffic sources are Poisson but the users can 
control the average rate. We show that drop-tail and RED do not 
impose Nash equilibria. We modify RED slightly to obtain an oblivious 
scheme, VLRED, that imposes a Nash equilibrium, but is not efficient. 
We then  present another AQM policy, EN-AQM, that can impose 
an efficient Nash equilibrium. Finally, we show that for any
oblivious AQM, the Nash equilibrium imposed on selfish agents 
is highly sensitive as the number of agents increases, thus 
making it hard for the users to converge to the Nash equilibrium, 
and motivating the need for equilibria-aware protocols."
}

@INPROCEEDINGS{Dutt0309:GPS,
AUTHOR="Ashutosh Dutta and Sunil Madhani and Wai Chen and Onur Altintas and
Shengwei Cai",
TITLE="{GPS-IP} based Fast-handoff for Mobiles",
BOOKTITLE="New York Metro Area Networking Workshop 2003",
ADDRESS="Bern Dibner Library Building, LC400,  Polytechnic University,  5 Metrotech
Cente",
DAYS=12,
MONTH=sep,
YEAR=2003,
ABSTRACT="Reducing transient data loss during a mobile's frequent subnet handoff
depends upon several factors such as layer 2  handoff detection,  faster
IP address  discovery, registration  and media  re-direction. This paper
investigates GPS  coordinate based faster IP address discovery  method
suitable for high-speed vehicular users. This extended abstract   presents
 a new methodology associated with GPS-IP discovery approach that has been
implemented in the testbed. It discusses several issues involved with this
 process  such  as   layer  2  detection, IP address assignment,  and 
duplicate  address detection."
}

@INPROCEEDINGS{Dutt0309:GPS,
AUTHOR="Ashutosh Dutta and Sunil Madhani and Wai Chen and Onur Altintas",
TITLE="{GPS-IP} based Fast-handoff for Mobiles",
BOOKTITLE="NYMAN 2003 Conference",
MONTH=sep,
YEAR=2003,
REFERENCES=9,
KEYWORDS="Handoff, GPS-IP, Fast-handoff",
ABSTRACT="REducing transient data loss during a mobile's frequent subnet handoff
depends upon several factors such as layer 2 handoff detection, faster IP
address discovery, registration and media re-direction. This
paperinvestigates GPS coordinate based faster IP address discovery method
suitable for high-speed vehicular users. This extended abstract presents a
new methodology associated with GPS-IP discovery approach that has been
implemented in the testbed. It discusses several issues involved with this
proces such as layer 2 detection, IP address assignment and duplicate
address detection.",
URL="www.cs.columbia.edu/~dutta/research/gps-ip-nyman-final.pdf"
}

@ARTICLE{Dutt0310:Multicasting,
AUTHOR="Ashutosh Dutta and Jasmine Chennikara-Varghese and Wai Chen and Onur
Altintas and Henning Schulzrinne",
TITLE="Multicasting Streaming Media to mobile users",
JOURNAL="IEEE Communications Magazine",
MONTH=oct,
YEAR=2003,
REFERENCES=15,
KEYWORDS="Multicast, Mobile, Handoff",
ABSTRACT="Content distribution in general, and multicasting in particular, over a
wired network to static hosts can be realized by placing proxies and
gateways at several parts of the network. However, if the end hosts are
mobile over heterogeneous wireless access networks, one needs to consider
many operational issue such as network detection, handoff, join and leave
latency, and desired level of quality of service, as well as caching and
load balancing. This article surveys a set of protocols and technologies
that offer multicast-based services for streaming multi-media in a mobile
environment. It also brings forth some issues related to mobile content
distribution in the wireless Internet that may be helpful during its
deployment by application service providers.",
URL="http://www.cs.columbia.edu/~dutta/research/ieee-com-multicast.pdf"
}

@ARTICLE{Dutt0310:Realizing,
AUTHOR="Ashutosh Dutta and Prathima Agrawal and Jyh-Cheng Chen and Subir Das and
David Famolari and Yoshihiro Ohba and Sinichi Baba and Anthony McAuley and
Henning Schulzrinne",
TITLE="Realizing Steaming Wireless Internet Telephony and Streaming Multimedia
Testbed",
JOURNAL="Elsevier, Computer and Communication",
MONTH=oct,
YEAR=2003,
KEYWORDS="Testbed, Wireless Internet Telephony, Mobile IP, SIP, Multicast",
ABSTRACT="momentum in the communications, entertainment, music and interactive
game industries as well as in the military. In general, streaming
applications include IP telephony, multimedia broadcasts and various
interactive applications such as multi-party conferences, collaborations
and multiplayer games. Successfully realizing such applications in a
highly mobile environment, however, presents many research challenges.
In order to investigate such challenges and demonstrate viable solutions,
we have developed an experimental indoor and outdoor testbed laboratory.
By implementing standard IETF protocols into this testbed, we
have demonstrated the basic functionalities required of the mobile
wireless
Internet to successfully support mobile multimedia access. These
requirements
include signaling, registration, dynamic configuration, mobility
binding, location management, Authentication Authorization and
Accounting (AAA), and quality of service (QoS) over a variety of radio
access network (RAN) technologies (e.g. 802.11b, CDMA/GPRS). In
this paper, we describe this testbed and discuss important design issues
and tradeoffs. We detail the incorporation and inter-relation of a wide
catalog of IETF protocols - such as SIP, SAP, SDP, RTP/RTCP/RTSP,
MGCP, variants of Mobile-IP, DRCP, HMMP, PANA, and DSNP - to
achieve our goals. We believe that the results and experiences obtained
from this experimental testbed will advance the understanding of the
pertinent deployment issues for a Mobile Wireless Internet.",
URL="www.cs.columbia.edu/~dutta/research/testbed-elsevier.pdf"
}

@INPROCEEDINGS{Dwiv0303:Towards,
AUTHOR="Ashish Dwivedi and Rajeev Bali and Meletis Belsis and Raouf Naguib and
Peter Every and Nahy Nassar",
TITLE="{TOWARDS} A {PRACTICAL} {HEALTHCARE} {INFORMATION} {SECURITY}",
BOOKTITLE="IEEE EMBS Fourth International Conference on Information Technology
Applications in Biomedicine (ITAB 2003)",
MONTH=mar,
YEAR=2003,
REFERENCES=19,
KEYWORDS="electronic patient records, smartcards, biometrics, public key
infrastructure, iris recognition",
ABSTRACT="In recent years, a number of countries have introduced plans for national
electronic patient record (EPR) systems. This paper argues that, in the
near future, both patients and healthcare stakeholders will be able to
access medical records from WWW-based EPR systems.  We contend that the
primary impediment to the successful implementation and widespread uptake
of the EPR concept is the fact that current healthcare information
security (HIS) applications are not sufficiently robust.  This paper
identifies two main Information Security technologies: 1) Public key
infrastructure (PKI) and 2) Biometrics that hold a lot of promise in a
healthcare context.  The key contribution of this paper is to propose a
novel multi-layered HIS framework based on a combination of PKI, Smartcard
and Biometrics technologies.  We argue that this new HIS framework could
assist healthcare institutions to provide a truly secure infrastructure
for the electronic transmission of clinical data in the future. This paper
also makes a case for the creation of a new nodal HIS body because existing
information security bodies like the Forum of Incident Response and
Security Teams are for general-purpose organizations and not specifically
suited for the healthcare sector."
}

@INPROCEEDINGS{Dysa0312:Differentiated,
AUTHOR="Timothy Dysart and Chad Mano and Ravi Raina",
TITLE="Differentiated Quality of Service using RedHat Linux and Apache",
BOOKTITLE="University of Notre Dame CSE542",
MONTH=dec,
YEAR=2003,
ABSTRACT="One goal of many Internet Service Provider's (ISP's) is to provide
different levels of service to customers based on the customers
willingness to pay more for a higher quality connection. This providing of
different levels of service is known as Differentiated Quality of Service
(DQoS). In this paper, a baseline study of two default instances of the
Apache web server is completed first. Then, three modifications,
implemented individually, are made to one instance of Apache to provide
DQoS. Lastly, all modifications are tested at once to see the cumulative
effects. The results presented here show how all three modifications
demonstrate performance improvements that could be used to provide DQoS."
}

@INPROCEEDINGS{Edlu0305:Performance,
AUTHOR="Magnus Edlund and Mikael Skoglund and Bhaskar Rao",
TITLE="On The Performance of Closed-Loop Transmit Diversity with Non-Ideal
Feedback",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Abstract  A closed-loop transmit diversity system is evaluated, taking
several major feedback non-idealities into account both separately and in
combination,contrasting most previous work in the field. The focus of the
study is on the trade-off between quantization errors and feedback
periodicity (i.e., a trade-off between sparse high-resolution data and
frequent low-resolution data). Different number of transmit antennas,
transmission rates and receiver velocities are investigated. In addition,
we also study the impact of feedback delay. Some main results are as
follows: For each receiver velocity and feedback channel rate, there
exists an optimal choice of quantization resolution, and hence an optimal
choice of feedback period. Furthermore, there is an optimum choice of the
number of transmit antennas to employ for a given degree of Doppler and a
given feedback rate. Finally, the bit error rate performance for a fixed
feedback rate and a given receiver velocity is practically independent of
the transmission rate."
}

@INPROCEEDINGS{Ehsa0305:Analysis,
AUTHOR="Navid Ehsan and Mingyan Liu",
TITLE="Analysis of {TCP} Transient Behavior and Its Effect on File Transfer
Latency",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper we present a Markov Chain model for TCP congestion avoidance
phase. With this model we are able to analyze congestion window behavior
as a discrete-time stochastic process and distinguish between window
transient period and steady state. Using this result we are able to obtain
more accurate estimate of TCP latency over lossy links compared to existing
models. We then simplify the proposed model and show that the transient
period evolves with an exponential rate. Our results are validated using
NS2 simulation and show significant improvement in latency estimates for a
wide range of file sizes."
}

@ARTICLE{Elbi0308:Shaping,
AUTHOR="Halima Elbiaze and Tijani Chahed and Tülin Atmaca and Gérard {Hébuterne}",
TITLE="Shaping self-similar traffic at access of optical network",
JOURNAL="Performance Evaluation",
VOLUME=53,
NUMBER="3-4",
PAGES="187-208",
MONTH=aug,
YEAR=2003,
REFERENCES=14,
KEYWORDS="Optical networks; Self-similar traffic; Shaping; Service curves; Markov
chain",
ABSTRACT="The focus of this paper is shaping of self-similar traffic at the access of
an optical node. Due to the lack of optical memories, we suggest a combined
exploitation of electronic memories in the edge of the optical network by
means of shaping and propose two novel shaping algorithms that dynamically
shape the incoming traffic so as to meet Quality of Service (QoS)
requirements while keeping with the optical core network constraints. The
first algorithm follows a deterministic approach and is based on the
service curves theory. It dynamically, on an interval basis, adjusts the
shaping parameters to the token bucket described self-similar traffic. The
second, alternative shaping algorithm follows a stochastic approach. It
blindly shapes the traffic using a jumping observation window.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-48WB998-1-4M\&\_cdi=5663\&\_orig=browse\&\_coverDate=08\%2F31\%2F2003\&\_sk=999469996\&view=c\&wchp=dGLbVlz-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=bff4eaed57dc8f52adcdb2a726b90949\&ie=f.pdf"
}

@INPROCEEDINGS{Elha0305:Performance,
AUTHOR="Itamar Elhanany and Dan Sadot",
TITLE="Performance Analysis of a Robust Scheduling Algorithm for Scalable
Input-Queued Switches",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper a high-performance, robust and scalable scheduling algorithm
for input-queued switches, called distributed sequential allocation
(DISA), is presented and analyzed. Contrary to pointer-based arbitration
schemes, the algorithm proposed is based on a synchronized channel
reservation cycle whereby each input port selects a designated output
channel, considering both its local transmission requests as well as
global channel availability information. The distinctiveness of the
algorithm is in its ability to offer high-performance when multiple cells
are transmitted within each switching intervals. The subsequent relaxed
switching-time requirement allows for the utilization of commercially
available crosspoint switches, yielding a pragmatic scalable solution for
high port-density switching platforms. The efficiency of the algorithms
and its robustness to is established through analysis and simulations of
traffic scenarios with non-uniform destination distribution."
}

@INPROCEEDINGS{Elha0305:Uniformly,
AUTHOR="Itamar Elhanany and Michael Kahane and Dan Sadot",
TITLE="On Uniformly Distributed {ON/OFF} Arrivals in Virtual Output Queued
Switches with Geometric Service Times",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Virtual output queueing is commonly deployed as a buffering technique in
high-performance input-queued switch architectures. This paper presents
analysis for discrete-time virtual output queued switches with incoming
traffic governed by a uniformly distributed Markov modulated ON/OFF
process, and geometrically distributed inter-service times. We utilize the
k-step first-passage time probability matrix to derive the probability
generating function of the inter-arrival times distribution. Based on the
latter, closed-form expressions for the queue size distribution, mean
queue occupancy and mean delay are obtained. The validity of the analysis
is established through simulation results."
}

@ARTICLE{Elli02:Transparent,
AUTHOR="Georgios Ellinas and Jean-Francois Labourdette and James Walker and Sid
Chaudhuri and Lih Lin and Evan Goldstein and Krishna Bala",
TITLE="Transparent Optical Switches: Technology Issues and Challenges",
JOURNAL="Annual Review of Communications for the International Engineering
Consortium (IEC)",
YEAR=2003,
URL="http://www-ee.engr.ccny.cuny.edu/www/web/ellinas/IEC\%202002\%20Paper.pdf"
}

@ARTICLE{Elli0301:Routing,
AUTHOR="Georgios Ellinas and Eric Bouillet and Ramu Ramamurthy and Jean-Francois
Labourdette and Sid Chaudhuri and Krishna Bala",
TITLE="Routing and Restoration Architectures in Mesh Optical Networks",
JOURNAL="Optical Network Magazine",
VOLUME=4,
NUMBER=1,
MONTH=jan,
YEAR=2003,
REFERENCES=35,
NOTE="Kluwer Academic Publishers",
KEYWORDS="optical networks; optical switches; protection; restoration; WDM",
ABSTRACT="This paper provides an overview of various techniques used to provision
lightpaths in a layered architecture that utilizes a dedicated control and
management plane for each layer. It also reviews and compares a set of
OXC-based protection and restoration architectures, focusing only in the
optical domain. The comparison takes into consideration figures of merit
such as economic aspects, availability of restoration, and speed of
restoration to sieve out the most appropriate protection schemes in
conformance to each scenario.",
URL="http://www-ee.engr.ccny.cuny.edu/www/web/ellinas/MeshRoutingONM.pdf"
}

@ARTICLE{Elli0302:Characterizing,
AUTHOR="Vivian Elliott and Kenneth Christensen",
TITLE="Characterizing and reducing route oscillations in the Internet",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=2,
PAGES="143-153",
MONTH=feb,
YEAR=2003,
REFERENCES=24,
KEYWORDS="Routing; Border Gateway Protocol; Route oscillation; Route flap damping",
ABSTRACT="Oscillation of routes in the Internet causes unnecessary overhead. Border
Gateway Protocol (BGP) transactions collected from the MAE-East exchange
point for 2000 (JanuaryDecember) show that approximately 16\% of routing
overhead traffic exhibits oscillating Autonomous System paths. About 66\%
of these paths used extra, unnecessary hops to route data traffic
resulting in up to 10\% extra-hop count. Common characteristics are shown
to exist in oscillating routes. Our findings demonstrate that
long-theorized route oscillations really do occur in the Internet. Faulty
implementations and/or poor policy choices are likely causes, where the
currently specified method of BGP implicit withdrawals causes propagation
through the Internet. To reduce oscillations, we propose a new method of
forcing explicit withdrawals in BGP. Simulation experiments with forcing
explicit withdrawals show an overall reduction of the transaction traffic,
as well as a reduction in path length.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-462BR6W-1-M\&\_cdi=5624\&\_orig=browse\&\_coverDate=02\%2F01\%2F2003\&\_sk=999739997\&view=c\&wchp=dGLbVlz-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=c9cf7271e59d49383867581018dcd350\&ie=f.pdf"
}

@INPROCEEDINGS{Elmu0305:Multi,
AUTHOR="Mohammed Elmusrati",
TITLE="Multi-Objective Distributed Power and Rate Control for Wireless
Communications",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we introduce a new fully distributed algorithm for combining
power and rate control in wireless communication systems. The algorithm is
based on minimizing a multi-objective definition of an error function. In
this paper we defined three objectives. The objectives are 1) minimizing
the transmitted power, 2) achieving at least the target Carrier to
Interference Ratio (CIR) which is defined at the minimum data rate, and 3)
achieving the maximum CIR which is defined at maximum data rate. An
optimized solution can be obtained by using a multi-objective optimization
technique. The suggested algorithm is simple to implement and very
efficient. The simulations carried out on the UMTS specifications indicate
that our algorithm give a very optimistic performance in terms of data
rate, outage probability, convergence speed and transmission power
consumption."
}

@ARTICLE{Elsa0304:Measurement,
AUTHOR="Khaled Elsayed and Ola Hendy",
TITLE="A measurement-based call admission control scheme for {ATM} networks based
on the diffusion approximation",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=6,
PAGES="622-630",
MONTH=apr,
YEAR=2003,
REFERENCES=15,
KEYWORDS="Measurement-based call admission control; Traffic management; Effective
bandwidth; Asynchronous transfer mode networks; Diffusion approximation",
ABSTRACT="We present a dynamic call admission control method based on the diffusion
approximation method. The diffusion approximation method is traditionally
used for calculating the effective bandwidth for a number of connections
having a certain cell loss requirement. The proposed method has a low
implementation overhead since it performs measurements on the aggregate
traffic stream at a particular ATM switch as opposed to other methods that
need to perform per-source measurements. We provide a study of the
performance of the method for specific traffic types using simulation and
compare with the performance of the static diffusion approximation
effective bandwidth method. We also study the influence of variation in
traffic parameters such as the source traffic descriptors, the buffer
capacity, and the required cell loss probability on the performance of the
method.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-46RDF5H-4-21\&\_cdi=5624\&\_orig=browse\&\_coverDate=04\%2F15\%2F2003\&\_sk=999739993\&view=c\&wchp=dGLbVtb-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=b708ed3a06e6ea78aefb27f7475b48b1\&ie=f.pdf"
}

@INPROCEEDINGS{Elta0305:Modified,
AUTHOR="Ahmed Eltawil and Babak Daneshrad",
TITLE="Modified All Digital Timing Tracking Loop for Wireless Applications",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, a novel architecture for a fine timing tracking loop is
presented. The loop is a second order feedback loop utilizing an
interpolating filter to relax the requirements on the analog to digital
section of the receiver. A complete analysis of the interpolating filter,
loop filter along with a system simulation based on direct sequence spread
spectrum are presented."
}

@INPROCEEDINGS{Enge0305:Name,
AUTHOR="Paal Engelstad and Do Van Thanh and Geir Egeland",
TITLE="Name Resolution in On-Demand MANETs and over External {IP} Networks",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Abstract - Common user applications cannot run in mobile ad-hoc networks
(MANETs) before a method for name resolution is in place. While the Domain
Name System (DNS) works well on the fixed Internet, it represents a
centralized approach to name resolution, which is not suitable for MANETs.
This article refines the framework developed for name resolution in MANETs
and shows how a mechanism for local name resolution can be implemented
transparently to the application. It also proposes methods to align local
name resolution on the MANET with DNS over external IP networks, forming
one integrated method for name resolution. Finally, different strategies
for how to store name-to-address mappings on MANETs are discussed."
}

@INPROCEEDINGS{Enge03:Name,
AUTHOR="Paal Engelstad and Do {Van Thanh} and Tore Jonvik",
TITLE="Name Resolution in Mobile Ad-hoc Networks",
BOOKTITLE="10th IEEE International Conference on Telecommunications, ICT 2003",
ADDRESS="Papeete, Tahiti",
YEAR=2003
}

@INPROCEEDINGS{Eram0305:Dimensioning,
AUTHOR="Vincenzo Eramo",
TITLE="Dimensioning of the Wavelength Converters in Synchronous and Asynchronous
Switching Architecture",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Abstract - The objective of this study is to investigate the performance
difference of packet switching architectures working in a synchronous and
asynchronous way respectively; in such architectures the packet contention
is resolved in the wavelength domain and the used Wavelength Converters are
shared; we investigate on the saving of the number of converters that the
sharing technique allows to obtain in the synchronous and asynchronous
architectures and compare the obtained results. These ones show that when
a packet loss probability is fixed, in the synchronous case a greater
number of converters is saved, in some cases the gain is 40\% more than
the asynchronous case; furthermore in the asynchronous case a more
expensive switching matrix is needed."
}

@INPROCEEDINGS{Eun0303:Simplification,
AUTHOR="Do Young Eun and Ness Shroff",
TITLE="Simplification of Network Analysis in Large-Bandwidth Systems",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="In this paper, we show that significant simplicities can arise in the
analysis of a network when link capacities are large enough to carry
many flows. In particular, we prove that, when an upstream queue
serves a large number of regulated traffic sources, the queue-length
of the downstream queue converges almost surely to the queue-length of
a simplified queueing system (single queue) obtained by removing the
upstream queue. We provide similar results (convergence of the
queue-length in distribution) for general (including non-regulated)
traffic arrivals. In both cases, the convergence of the overflow
probability is uniform and at least exponentially fast. Through an
extensive numerical investigation, we demonstrate several aspects and
implications of our results in simplifying network analysis.

Methods Keywords: Stochastic processes/queueing theory"
}

@ARTICLE{Eun0304:Measurement,
AUTHOR="Do Eun and Ness Shroff",
TITLE="A Measurement-Analytic Approach for QoS Estimation in a Network Based on
the Dominant Time Scale",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=2,
PAGES="222-235",
MONTH=apr,
YEAR=2003,
REFERENCES=31,
KEYWORDS="dominant time scale (DTS); Gaussian processes; measurements; overflow
probability; stopping criterion",
ABSTRACT="We describe a measurement-analytic approach for estimating the overflow
probability, an important measure of the quality of service (QoS), at a
given multiplexing point in the network. A multiplexing point in the
network could be a multiplexer or an output port of a switch or router
where resources such as bandwidth and buffers are shared. Our approach
impinges on using the notion of the dominant time scale (DTS), which
corresponds to the most probable time scale over which overflow occurs.
The DTS provides us with a measurement window for the statistics of the
traffic, but is in fact itself defined in terms of the statistics of the
traffic over all time. This, in essence, results in a chicken-and-egg type
of unresolved problem. For the DTS to be useful for on-line measurements,
we need to be able to break this chicken-and-egg cycle, and to estimate
the DTS with only a bounded window of time over which the statistics of
the traffic are to be measured. We present a stopping criterion to
successfully break this cycle and find a bound on the DTS. Thus, the
result has significant implications for network measurements. Our approach
is quite different from other works in the literature that require off-line
measurements of the entire trace of the traffic. In our case, we need to
measure only the statistics of the traffic up to a bound on the DTS. We
also investigate the characteristics of this upper bound on the DTS, and
provide numerical results to illustrate the utility of our measurement
analytic approach.",
URL="http://ieeexplore.ieee.org/iel5/90/26877/01194819.pdf?isNumber=26877\&prod=JNL\&arnumber=1194819\&arSt=+222\&ared=+235\&arAuthor=Do+Young+Eun\%3B+Shroff\%2C+N.B."
}

@INPROCEEDINGS{Fan0303:AWG,
AUTHOR="Chun Fan and Martin Maier and Martin Reisslein",
TITLE="The {AWG||PSC} Network: A Performance Enhanced Single-Hop {WDM} Network
with Heterogeneous Protection",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Single-hop WDM networks based on a central Passive Star Coupler 
(PSC) or Arrayed--Waveguide Grating (AWG) hub 
have received a great deal of attention as promising 
solutions for the quickly increasing traffic in metropolitan  
and local area networks. 
These single-hop networks suffer from a single point of failure: 
If the central hub fails, then all
network connectivity is lost.
To address this single point of failure in an efficient manner,
we propose a novel single-hop WDM network, 
the AWG||PSC network. 
The AWG||PSC network consists of an AWG in parallel with a PSC. 
The AWG and PSC provide heterogeneous protection for
each other;
the AWG||PSC 
network remains functional when either the AWG or the PSC fails. 
If both AWG and PSC are functional, the AWG||PSC network
uniquely combines the respective strengths of the two devices.
By means of analysis and verifying simulations we find that the 
throughput of the AWG||PSC network is significantly larger
than the total throughput obtained by combining 
the throughput of a stand-alone AWG network with the throughput 
of a stand-alone PSC network.
We also find that the AWG||PSC network
gives over a wide operating range a better throughput-delay
performance than a network consisting of either two load sharing PSCs 
in parallel or two load sharing AWGs in parallel.

Keywords:
Arrayed-Waveguide Grating, Medium Access Control, Passive Star Coupler, 
Protection, Single-hop Networks, Wavelength Division Multiplexing, 
Throughput-Delay Performance.

Methods Keywords: 
System design, Simulations, Stochastic processes/Queueing theory"
}

@INPROCEEDINGS{Fang0305:Novel,
AUTHOR="Zuyuan Fang and Brahim Bensaou",
TITLE="A novel topology-blind fair medium access control for wireless {LAN} and
ad-hoc networks",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper propose a new backoff mechanism for IEEE802.11 which aims 
to achieve fair channel access without knowledge on the topology.  
By adjusting a time interval dynamically and the contention window 
the algorithm aims to approach the optimal equilibrium where the time 
interval is the minimum possible such that each nodes that face the 
same contention send successfully only one packet per such interval. 
We show how this algorithm can be modelled as a game and using game 
theoretic arguments prove that it is stable. Simulation results 
are also given."
}

@INPROCEEDINGS{Fang0305:Performance,
AUTHOR="Xiaoyan Fang and Dipak Ghosal",
TITLE="Performance Modeling and QoS Evaluation of {MAC/RLC} Layer in {GSM/GPRS}
Networks",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper we present an analytical model to study the performance
of channel sharing schemes to support both circuit switched voice and
packet data services in a GSM/GPRS network. We study three channel
sharing schemes: 1) {\em fixed sharing} in which cell channels are
statically partitioned into two sets one for voice calls and the other
for data traffic; 2) {\em partial sharing} in which $n\_{data}$
channels are reserved for data while the remaining $N-{n\_{data}}$
channels are shared by voice and data with preemptive priority for
voice calls; and 3) {\em complete sharing} in which all the channels
shared by voice and data with preemptive priority to voice calls. We
investigate several key issues such as call blocking rate and mean
packet delay for different cell loads with the data source modeled by
a Markov Modulated Poisson Process (MMPP). We validate the
mathematical model through simulations and quantify the impact of the
data source model and the voice call load on the mean packet delay for
different channel sharing schemes."
}

@INPROCEEDINGS{Fant0305:Performance,
AUTHOR="Romano Fantacci and Dania Marabissi and Lorenzo Panichi and Daniele Tarchi",
TITLE="Performance Evaluation of an Efficient Fixed Microwave Communication System
to be Added to an Operating {UMTS} Network",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper deals with the proposal and performance evaluation of a
  Fixed Microwave Communication (FMC) system that shares the same
  bandwidth as that of an existing UMTS network. The main application
  of the FMC system is for wireless connections between remote base
  stations and a core network access point for an UMTS network
  implementation in a dense urban environment, where a wired
  connection could be very expensive for service providers. Besides,
  sharing of the same frequency band could be attractive for the
  actual cost and lack of frequency spectrum. The mutual interference
  effects between the FMC and the existing UMTS systems are
  investigated by focusing on typical application scenarios. The
  performance for the two systems under consideration has been
  evaluated in terms of bit error rate by means of computer
  simulations for proposed receiving scheme where mutual interference
  are, firstly, detected and then canceled from the other system. The
  obtained results clearly demonstrate the feasibility of the
  bandwidth sharing between the proposed FMC system and an existing
  UMTS network and the improvement of performance in terms of bit
  error rate with proposed receiving system."
}

@ARTICLE{Fant0307:Qos,
AUTHOR="Romano Fantacci and Giovanni Giambene and Gianluca Nisticò",
TITLE="A QoS-aware policer for a fair resource sharing in wireless {ATM}",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=12,
PAGES="1392-1404",
MONTH=jul,
YEAR=2003,
REFERENCES=21,
KEYWORDS="Wireless ATM; Fuzzy logic; Traffic policing; Quality of service",
ABSTRACT="This paper deals with the Radio Resource Management (RRM) layer of future
broadband systems capable to realize a wireless access to Asynchronous
Transfer Mode networks. The interest here is in designing an efficient
scheme operated by an access point to integrate demanding traffics, such
as high-quality real-time video and interactive Web traffics. We adopt a
time division multiple access air interface and we propose an original
solution where a medium access protocol and a usage parameter control
technique jointly define the radio resource management. In particular, we
use a cyclic assignment scheme with a novel traffic policer based on fuzzy
logic for video sources and on a token-bucket scheme for Web sources. Our
technique is named Fuzzy Logic-Based Multiple Access (FLBMA) to remark the
central function of the fuzzy policer. The FLBMA performance, derived
through simulations, has highlighted the following interesting results:
(i) very high capacity of video traffic sources in comparison with
alternative RRM schemes; (ii) fair service of different traffic sources;
(iii) video traffic Quality of Service independent of Web traffic load.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-4805VF7-1-8N\&\_cdi=5624\&\_orig=browse\&\_coverDate=07\%2F21\%2F2003\&\_sk=999739987\&view=c\&wchp=dGLbVtz-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=34b8368c45747269b9e02036cb78bd81\&ie=f.pdf"
}

@INPROCEEDINGS{Fara0305:Incorporating,
AUTHOR="Andras Farago and Ferenc Unghvary and Andrea Fumagalli",
TITLE="On Incorporating Dependent Link Failures in a Traffic Engineering Model",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="A  method  is  presented  to  compute  a fundamental
traffic   engineering   parameter,   the   end-to-end  blocking
probability, when both traffic and reliability aspects are taken into
account. Additionally, link failures are not assumed independent. This
situation is justified  by the practical  scenario of logical  overlay
networks over a  physical network. In  a logical network,  even if the
physical link  failures are  independent, after  mapping the  failures
into the logical network, the logical links do not fail independently.
Dependent link failures can also occur as a result of a node failure."
}

@INPROCEEDINGS{Farh0305:Efficient,
AUTHOR="Behrouz Farhang-Boroujeny",
TITLE="Efficient multicarrier realization of full-rate space-time orthogonal block
coded systems",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Space-time block codes based on orthogonal designs, known as
space-time orthogonal block (STOB) codes, have recently been
proposed. It has been noted that when the number of transmit
antennas is more than two, full-rate STOB codes could only be
designed for real-valued data symbols. Real-valued symbols form
pulse amplitude modulated (PAM) sequences whose bandwidth
efficient transmission is only possible through single side-band
(SSB) modulation. We propose cosine modulated filter bank (CMFB)
multicarrier modulation (MCM) as a bandwidth efficient method of
implementing full-rate STOB-coded systems. The impact of channel
distortion on the received signal is studied, and a method of
designing a zero-forcing equalizer that removes intersymbol
interference (ISI) and interchannel interference (ICI) in the
system is developed. Some relevant properties of the proposed
system are also reported."
}

@INPROCEEDINGS{Fatm0305:Impulse,
AUTHOR="Fatma Abdelkefi and Pierre Duhamel and Florence Alberge",
TITLE="Impulse noise correction in Hiperlan {2:} improvement of the decoding
algorithm and application to {PAPR} reduction",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this contribution, we propose a cascade structure to improve the impulse
noise cancellation algorithm that we have already presented. 
The new structure of this decoding algorithm is easy to implement and
reliable (several parameters can be obtained theoretically rather than
tuned experimentally). 
We also show that this decoding algorithm can be used for eliminating
impulse noise and for reducing the Peak-to-Average Power Ratio (PAPR)
level. 
The efficiency of this technique is corroborated by simulations in the
practical context of Hiperlan2."
}

@TECHREPORT{Faul0305:Npc,
AUTHOR="Lukas Faulstich",
TITLE="The {NPC} Framework for Building Information Dissemination Networks",
TYPE="arXiv",
NUMBER="cs.DL/0305010",
MONTH=may,
YEAR=2003,
KEYWORDS="Digital Libraries; Networking and Internet Architecture",
ABSTRACT="Numerous systems for dissemination, retrieval, and archiving of documents
have been developed in the past. Those systems often focus on one of these
aspects and are hard to extend and combine. Typically, the transmission
protocols, query and filtering languages are fixed as well as the
interfaces to
other systems. We rather envisage the seamless establishment of networks
among
the providers, repositories and consumers of information, supporting
information retrieval and dissemination while being highly interoperable
and
extensible.
  We propose a framework with a single event-based mechanism that unifies
document storage, retrieval, and dissemination. This framework offers
complete
openness with respect to document and metadata formats, transmission
protocols,
and filtering mechanisms. It specifies a high-level building kit, by which
arbitrary processors for document streams can be incorporated to support
the
retrieval, transformation, aggregation and disaggregation of documents.
Using
the same kit, interfaces for different transmission protocols can be added
easily to enable the communication with various information sources and
information consumers.",
URL="http://arXiv.org/abs/cs/0305010"
}

@ARTICLE{Füze0306:Provisioning,
AUTHOR="Peter Fuzesi and Krisztian Nemeth and Niklas Borg and Rikard Holmberg and
Istvan Cselenyi",
TITLE="Provisioning of QoS enabled inter-domain services",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=10,
PAGES="1070-1082",
MONTH=jun,
YEAR=2003,
REFERENCES=19,
KEYWORDS="End-to-end QoS; Inter-domain management; Service description;
Differentiated Services",
ABSTRACT="Provisioning quality-enhanced services across IP networks is in the focus
of intensive research. However, the lack of an inter-domain management
concept still hinders the deployment of Internet-wide end-to-end QoS. This
paper introduces a management architecture that considers Internet as a set
of inter-connected autonomous domains, where carriers offer and request
inter-domain services. We propose mechanisms for delivering service
descriptions in order to gather information about available QoS parameters
before actually purchasing the service. Methods for propagation of traffic
predictions towards their destinations are also defined. Several metrics
characterising an inter-domain management architecture are introduced, and
the proposed architecture is evaluated in terms of scalability and accuracy
by simulations.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-481FWJ7-2-37\&\_cdi=5624\&\_orig=browse\&\_coverDate=06\%2F20\%2F2003\&\_sk=999739989\&view=c\&wchp=dGLbVlb-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=1e2f33c8399fc7ee1e796419a2683cd2\&ie=f.pdf"
}

@INPROCEEDINGS{Feam0306:Measuring,
AUTHOR="Nick Feamster and David Anderson and Hari Balakrishnan and M. Kaashoek",
TITLE="Measuring the Effects of Internet Path Faults on Reactive Routing",
BOOKTITLE="Proceedings of the ACM Sigmetrics Conference on Measurement and Modeling of
Computer Systems",
ORGANIZATION="ACM",
MONTH=jun,
YEAR=2003,
REFERENCES=25,
ABSTRACT="Empirical evidence suggests that reactive routing systems improve
resilience to Internet path failures. They detect and route around faulty
paths based on measurements of path performance. This paper seeks to
understand why and under what circumstances these techniques are
effective. 

To do so, this paper correlates end-to-end active probing experiments,
loss-triggered traceroutes of Internet paths, and BGP routing messages.
These correlations shed light on three questions about Internet path
failures: (1) Where do failures appear? (2) How long do they last? (3) How
do they correlate with BGP routing instability? 

Data collected over 13 months from an Internet testbed of 31 topologically
diverse hosts suggests that most path failures last less than fifteen
minutes. Failures that appear in the network core correlate better with
BGP instability than failures that appear close to end hosts. On average,
most failures precede BGP messages by about four minutes, but there is
often increased BGP traffic both before and after failures. Our findings
suggest that reactive routing is most effective between hosts that have
multiple connections to the Internet. The data set also suggests that
passive observations of BGP routing messages could be used to predict
about 20\% of impending failures, allowing re-routing systems to react
more quickly to failures.",
URL="http://nms.lcs.mit.edu/papers/failures-sigm2003.html"
}

@ARTICLE{Feck0310:Technique,
AUTHOR="Mariusz Fecko and M. Uyar and Ali Duale and Paul Amer",
TITLE="A Technique to Generate Feasible Tests for Communications Systems With
Multiple Timers",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=5,
PAGES="796-809",
MONTH=oct,
YEAR=2003,
REFERENCES=40,
KEYWORDS="conformance testing; test-case generation; testing timers; timing
constraints",
ABSTRACT="We present a new model for testing real-time protocols with multiple
timers, which captures complex timing dependencies by using simple linear
expressions involving timer-related variables. This new modeling
technique, combined with the algorithms to eliminate inconsistencies,
allows generation of feasible test sequences without compromising their
fault coverage. The model is specifically designed for testing to avoid
performing full reachability analysis, and to control the growth of the
number of test scenarios. Based on extended finite state machines, it is
applicable to languages such as SDL, VHDL, and Estelle. The technique
models a realistic testing framework in which each I/O exchange takes a
certain time to realize and timers can be arbitrarily started or stopped.
A software tool implementing this technique is used to generate test cases
for the US Army wireless standard MIL-STD 188-220.",
URL="http://ieeexplore.ieee.org/iel5/90/27747/01237457.pdf?isNumber=27747\&prod=JNL\&arnumber=1237457\&arSt=+796\&ared=+809\&arAuthor=Fecko\%2C+M.A.\%3B+Uyar\%2C+M.U.\%3B+Duale\%2C+A.Y.\%3B+Amer\%2C+P.D."
}

@ARTICLE{Fei0307:Framework,
AUTHOR="Zongming Fei and Mengkun Yang and Mostafa Ammar and Ellen Zegura",
TITLE="A framework for allocating clients to rate-constrained multicast servers",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=12,
PAGES="1255-1262",
MONTH=jul,
YEAR=2003,
REFERENCES=21,
KEYWORDS="Multicast; Replication; Server selection; Rate constraint",
ABSTRACT="Forming multiple multicast groups is a technique often used to deal with
the problem of heterogeneous client capacities by allocating clients with
different capacities to different groups. In this paper, we investigate
the problem of allocating clients to constrained multicast servers, which,
similar to clients, have different capacities. We explore several
interesting issues caused by these constraints and propose a framework for
generating optimal solutions to the allocation problem. We evaluate the
method by simulation and show a substantial performance gain of our
algorithm over those considering the server constraints separately.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47C4CX6-2-59\&\_cdi=5624\&\_orig=browse\&\_coverDate=07\%2F21\%2F2003\&\_sk=999739987\&view=c\&wchp=dGLbVzz-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=159f0629a2760cbbae5a5b86bbe6f048\&ie=f.pdf"
}

@UNPUBLISHED{Felb03:Data,
AUTHOR="Pascal Felber and E. Biersack and Luis Garces-Erice and Keith Ross and
Guillaume Urvoy-Keller",
TITLE="Data Indexing and Querying in {DHT} Peer-to-Peer Networks",
YEAR=2003,
NOTE="citeseer.ist.psu.edu/574289.html",
URL="http://citeseer.ist.psu.edu/574289.html"
}

@ARTICLE{Feng0309:Performance,
AUTHOR="Christian Fenger and A. Glenstrup",
TITLE="Performance evaluation of multirate time division multiplexed wavelength
routed optical networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=14,
PAGES="1644-1650",
MONTH=sep,
YEAR=2003,
REFERENCES=10,
KEYWORDS="Time slot; Wavelength routing; All-optical; Integer linear programming",
ABSTRACT="We consider a wavelength routed all-optical mesh network, where the
wavelengths are divided into individually routed timeslots to improve
utilization and to allow for a higher degree of optical transparency. The
multirate scheduling problem is defined mathematically by integer linear
programming formulations. The equivalence of this problem to traditional
wavelength routed optical networks is shown. An approximative analytical
expression for the gain of using timeslots is derived and verified by
simulation. We find that this type of network improves scalability and
utilization of all-optical networks significantly when the typical size of
a traffic demand corresponds to a couple of wavelengths or less.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-48643D2-2-4H\&\_cdi=5624\&\_orig=browse\&\_coverDate=09\%2F01\%2F2003\&\_sk=999739985\&view=c\&wchp=dGLbVtb-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=cb58d0c4937df5642d3007d49ba67608\&ie=f.pdf"
}

@ARTICLE{Fern0307:Effectiveness,
AUTHOR="M. {Fernández-Veiga} and C. {López-García} and J. {López-Ardao} and A.
{Suárez-González} and M. Sousa-Vieira",
TITLE="On the effectiveness of the many-sources asymptotic for admission control",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=12,
PAGES="1376-1391",
MONTH=jul,
YEAR=2003,
REFERENCES=22,
KEYWORDS="Many sources asymptotic; Admission control; Network simulation; Fluid
traffic models",
ABSTRACT="In this paper we analyze the performance of a dynamic admission control
algorithm in a network of aggregate traffic. The algorithm is designed for
statistical quality of service guarantees and its theoretical foundation
stems from the application of the many sources asymptotic, a large
deviation result whose general validity and accuracy are specially useful
to cope with admissions both to buffered and unbuffered resources making
minimal assumptions about the statistical properties of the traffic. We
describe an implementation of the method, discuss some practical tradeoffs
and illustrate its robustness against traffic with complex (e.g. long-range
dependent) behavior. Our numerical results show that the computational
effort needed by the algorithm is reasonable and that the multiplexing
gain is nearly optimal in systems of realistic size.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47C94T0-1-3H\&\_cdi=5624\&\_orig=browse\&\_coverDate=07\%2F21\%2F2003\&\_sk=999739987\&view=c\&wchp=dGLbVlb-zSkzS\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=d88497ee818af9b7d13fa7eb92cfca0a\&ie=f.pdf"
}

@ARTICLE{Ferr0306:Discrete,
AUTHOR="Ricardo Ferreira and Henrique Luna",
TITLE="Discrete capacity and flow assignment algorithms with performance guarantee",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=10,
PAGES="1056-1069",
MONTH=jun,
YEAR=2003,
REFERENCES=27,
KEYWORDS="Routing; Capacity and flow assignment; Separable convexification; Nonconvex
multicommodity flow problem; Discrete capacity allocation",
ABSTRACT="The joint problem of selecting routing and a capacity value for each link
in networks is considered. We apply an alternative approach for some
models that have been addressed to (store-and-forward) packet-switched
computer network discrete capacity allocation and routing problems. The
network topology and traffic characteristics are supposed to be given. The
goal is to obtain a feasible solution with minimum total cost, where the
total cost include both leasing capacity and congestion costs. Heuristic
algorithms with performance guarantee based on lower bounds and on the
separability of the objective function are proposed. Experiments were
conducted to verify the performance and to confirm the efficiency of the
proposed algorithms.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-481FWJ7-1-7P\&\_cdi=5624\&\_orig=browse\&\_coverDate=06\%2F20\%2F2003\&\_sk=999739989\&view=c\&wchp=dGLbVzz-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=2be0d4a02d6780622ca4763df0793e39\&ie=f.pdf"
}

@TECHREPORT{Fike03:OWL,
AUTHOR="R. Fikes and P. Hayes and I. Horrocks",
TITLE="{OWL-QL} - A Language for Deductive Query Answering on the Semantic Web",
INSTITUTION="Stanford University",
YEAR=2003,
ABSTRACT="This paper discusses the issues involved in designing a query language for
the Semantic Web and presents the OWL Query Language (OWL-QL) as a
candidate standard language and protocol for query-answering dialogues
among Semantic Web computational agents using knowledge represented in the
W3C's Ontology Web Language (OWL). OWL-QL is a formal language and
precisely specifies the semantic relationships among a query, a query
answer, and the knowledge base(s) used to produce the answer. Unlike
standard database and Web query languages, OWL-QL supports query-answering
dialogues in which the answering agent may use automated reasoning methods
to derive answers to queries, as well as dialogues in which the knowledge
to be used in answering a query may be in multiple knowledge bases on the
Semantic Web, and/or where those knowledge bases are not specified by the
querying agent. In this setting, the set of answers to a query may be of
unpredictable size and may require an unpredictable amount of time to
compute."
}

@ARTICLE{Fink0306:IETF,
AUTHOR="Bob Fink and Margaret Wasserman and Jun-ichiro Hagino",
TITLE="The {IETF} IPv6 Operations Group and the Development of a Framework for
Deployment of IPv6 into IPv4 Networks",
JOURNAL="Internet Protocol Journal",
VOLUME=6,
NUMBER=3,
MONTH=jun,
YEAR=2003,
REFERENCES=4,
ABSTRACT="During 2002, the Internet Engineering Task Force (IETF) determined that it
was best to focus the introduction of IPv6 into the IPv4 Internet by
developing deployment scenarios before further development of transition
mechanisms without any clearly identified framework for their place in an
IPv6 deployment.",
URL="http://www.cisco.com/warp/public/759/ipj\_6-2/ipj\_6-2\_ipv6\_ops\_group.html"
}

@INPROCEEDINGS{Flam0305:Virtual,
AUTHOR="Maxime Flament and Arne Svensson",
TITLE="Virtual Cellular Networks for 60 GHz Wireless Infrastructure",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper gives comprehensive description of a broadband communication
system using the 60 GHz frequency band. We describe the channel and its
inherent problems such as interference situations and body shadowing. We
introduce the use of Virtual Cellular Networks and multiple receiving
antennas in order to solve these problems resulting in an overlapping
cellular architecture. We explain how the diversity of the channel can be
used to increase reliability and performance. Finally, we simulate the
link performance of a VCN using two receiving antennas for a set of OFDM
parameters."
}

@INPROCEEDINGS{Flor0303:Packet,
AUTHOR="Cedric Florens and Robert McEliece",
TITLE="Packet distribution Algorithms for Sensor Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="In this paper we formulate and solve the problems of data distribution and
data collection in sensor webs via simple discrete mathematical models.
The work that follows is a continuation of the work presented by the
authors in \cite{florens} where the focus was on unidirectional antenna
sensor networks. Here we shift our interest to networks equipped with
omnidirectional antenna elements. We show that the distribution and
collection tasks can be performed optimally on tree networks and give
corresponding optimal transmission scheduling strategies.
We also present a strategy for general graph networks that performs within
a factor of 3 of the optimal performance. Finally we compare the
performance of a network equipped with omnidirectional antenna
elements with one equipped with directional antenna
elements. We show the latter outperforms the former by 50\\% at most on
tree networks."
}

@INPROCEEDINGS{Fons0303:Intrinsic,
AUTHOR="Rodrigo Fonseca and Virgilio Almeida and Mark Crovella and Bruno Abrahao",
TITLE="On the Intrinsic Locality Properties of Web Reference Streams",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="There has been considerable work done in the study of Web reference
  streams: sequences of requests for Web objects.  In particular, many
  studies have looked at the locality properties of such streams,
  because of the impact of locality on the design and performance of
  caching and prefetching systems.  However, a general framework for
  understanding why reference streams exhibit given locality
  properties has not yet emerged.  In this paper we take a first step in
  this direction.  We propose a framework for describing how reference
  streams are transformed as they pass through the Internet, based on
  three operations: aggregation, disaggregation, and filtering.  We also
  propose metrics to capture the temporal locality of reference streams
  in this framework.  We argue that these metrics (marginal entropy and
  interreference coefficient of variation) are more natural and more
  useful than previously proposed metrics for temporal locality; and we
  show that these metrics provide insight into the nature of reference
  stream transformations in the Web."
}

@INPROCEEDINGS{Fons0305:Fractional,
AUTHOR="Nelson {L. S. da Fonseca} and Flavio Pereira and Dalton Arantes",
TITLE="Fractional Bounded Arrival Process for Self-Similar Traffic Policing",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, an envelope process called Fractional Bounded Arrival 
Process (FBAP) is proposed for self-similar traffic representation.
The queueing analysis for FBAP traffic is developed, and upper bounds for
the maximum backlog, for the maximum delay and for the size of busy
cycles are obtained. Finally, the use of the Leaky Bucket algorithm for
policing FBAP traffic is investigated."
}

@INPROCEEDINGS{Fons0305:Need,
AUTHOR="Nelson {L. S. da Fonseca} and Segio Yunes",
TITLE="On the Need for Frame Discard in {ATM} Networks",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper introduces a novel policing mechanisms, called Packet Leaky
Bucket which marks all cells of a frame with the same priority level.
Moreover, it investigates the need for having frame discard mechanisms
in ATM networks when frame-oriented policing mechanisms are used."
}

@INPROCEEDINGS{Font0305:Choosing,
AUTHOR="Francesc Font",
TITLE="Choosing the Set of Rendezvous Points in Shared Trees Minimizing Traffic
Concentration",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In the current Internet there are two main types of intra-domain multicast
routing protocols: dense mode and sparse mode. Dense mode protocols
construct shortest path trees from a sender to receivers while sparse mode
protocols construct shared trees rooted at a certain router, called core or
RP (rendezvous point), to which all senders of a certain group send their
packets in order to be transmitted to all receivers along such shared
tree. These kinds of trees are well suited for wide-area networks, because
we are sending information only to interested receivers and we maintain the
same routing state for each group, independently of the number of senders,
and only on the routers along the shared tree. While solving important
scalability problems, such trees bring other drawbacks; mainly traffic
concentration and delay. In current standards, PIM-SM and CBT, no
algorithms are specified to choose such RPs. In this paper we present an
approach to select the best set of RPs that minimizes traffic
concentration while limiting the maximum delay."
}

@TECHREPORT{Foru0312:Upnp,
AUTHOR="Upnp Forum",
TITLE="UPnP Device Architecture {1.0}",
MONTH=dec,
YEAR=2003,
URL="http://www.upnp.org/resources/documents/CleanUPnPDA101-20031202s.pdf"
}

@ARTICLE{Fost0306:Application,
AUTHOR="Kris Foster",
TITLE="Application of {BGP} Communities",
JOURNAL="Internet Protocol Journal",
VOLUME=6,
NUMBER=2,
MONTH=jun,
YEAR=2003,
REFERENCES=5,
ABSTRACT="The Border Gateway Protocol (BGP) is the glue that binds networks and their
individual policies together. Several attributes are passed along and
possibly modified with each individual prefix, one of which is the
community attribute. BGP communities are described poorly in most texts.
The problem is not in explaining how they fit into the protocol, but in
how to apply these to the real world. In this article I describe how they
can be applied within a service provider network and between service
provider networks. However, communities are not limited to service
providers and can be applied creatively in enterprise networks.",
URL="http://www.cisco.com/warp/public/759/ipj\_6-2/ipj\_6-2\_bgp\_communities.html"
}

@INPROCEEDINGS{Fozu0305:Sphere,
AUTHOR="Majid Fozunbal",
TITLE="A Sphere Packing Bound on Rayleigh {MIMO} Channels",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We present a sphere packing bound (SPB) approach to investigate
the performance limits of Rayleigh block-fading, multiple antenna
systems.  Specifically, we derive three sphere packing lower
bounds, one tight, one loose, and one approximate, on average word
error probability of space-time codes. These bounds provide us
intuition on how system parameters affect the performance limits. It is
shown that the performance limits
improve significantly for space-time codes that span a larger
number of fading blocks. It is shown that the achievable diversity
depends not only on the number of antennas and number of fading
blocks, $K$, but also on the block length, $L$, and the data rate.
Moreover, it is shown that the block length, $L$, has a marginal
effect on improving the performance limits and it is not possible
to achieve arbitrarily small WEP by increasing $L$."
}

@INPROCEEDINGS{Fral0303:Provisioning,
AUTHOR="Chuck Fraleigh and Fouad Tobagi and Christophe Diot",
TITLE="Provisioning {IP} Backbone Networks to Support Latency Sensitive Traffic",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="To support latency sensitive traffic ISPs can either use
service differentiation to prioritize such traffic or provision
their network with enough bandwidth so that all traffic
meets the most stringent delay requirements. In the context
of wide-area Internet backbones, two factors make overprovisioning
an attractive approach. First, the high link speeds and
large volumes of traffic make service differentiation complex
and potentially costly to deploy. Second, given the degree
of aggregation and resulting traffic characteristics, the
amount of overprovisioning required may not be very large.
This study develops a methodology to compute the amount
of overprovisioning needed in a backbone network to support
a given delay requirement. We first develop a model for
backbone traffic which is used to compute the end-to-end
delay through the network. The model is validated using
331 one-hour traffic measurements collected from the Sprint
IP network. We then develop a procedure which uses this
model to find the amount of bandwidth needed on each link
in the network so that an end-to-end delay requirement is
satisfied. Applying this procedure to the Sprint network,
we find that satisfying end-to-end delay requirements as
low as 3 ms requires only 15\% extra bandwidth above the
average data rate of the traffic."
}

@INPROCEEDINGS{Fran0305:Comparison,
AUTHOR="Mark Joseph Francisco and Fengjie Yuan and Changcheng Huang and Harry Peng",
TITLE="A Comparison of Two Buffer Insertion Ring Architectures with Fairness
Algorithms",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Buffer Insertion Rings (BIR) are known to provide higher throughputs than
other competing ring technologies.  With the introduction of spatial
reuse, MANs and LANs are at a greater advantage of maximizing bandwidth
efficiency.  Spatial reuse introduces the concept of congestion and
Fairness Algorithms are needed to police the fair access of the low
priority traffic on the ring.  Two architectures are studied in this
paper, Mono Transit Buffer (MTB) and the Dual Transit Buffer (DTB). 
Different from earlier BIR architectures, the congestion control
mechanisms studied in this paper are rate based and traffic streams are
regulated using leaky buckets. It has been shown through simulations that
both architectures exhibit oscillatory behavior under certain congestion
conditions.  MTB oscillates due to the overreaction of rate estimations,
whereas DTB oscillates due to the buffer threshold settings.  We show that
by correctly setting parameters, oscillations can be dampened to achieve
fair throughputs for all nodes contributing to the congestion."
}

@INPROCEEDINGS{Fu0206:Improving,
AUTHOR="Shaojian Fu and Mohammed Atiquzzaman",
TITLE="Improving End-to-End Throughput of Mobile {IP} using {SCTP}",
BOOKTITLE="2003 Workshop on High Performance Switching and Routing",
MONTH=jun,
YEAR=2003,
ABSTRACT="Mobile IP is the IETF-proposed  standard to offer  seamless mobile
computing. A new transport layer protocol, called Stream Control
Transmission Protocol (SCTP), has recently been accepted by as a proposed
standard by IETF to address a number of TCP limitations. 
Most of the previous research on  end-to-end throughput over Mobile 
IP has been carried out on TCP-Reno. Both TCP and SCTP can use Selective
Acknowledgment (SACK) for error recovery. In this paper, 
the effect of SCTP on the improvement of throughput during handovers 
in Mobile IP is analyzed. We show that SCTP has a better performance
than TCP-Reno and TCP-SACK due to its support for unlimited number of SACK
blocks. We conclude that  SCTP can be used to improve the end-to-end
throughput when the bottleneck link bandwidth is low."
}

@INPROCEEDINGS{Fu0303:Impact,
AUTHOR="Zhenghua Fu and Petros Zerfos and Haiyun Luo and Songwu Lu and Lixia Zhang
and Mario Gerla",
TITLE="The Impact of Multihop Wireless Channel on {TCP} Throughput and Loss",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="This paper studies TCP performance over multihop wireless networks that use
IEEE 802.11 protocol as the access method. Our analysis and simulations
show that, given a specific network topology and flow patterns, 
there exists a TCP window size W*, at which the 
TCP throughput is maximized and spatial channel reuse is increased. 
However, TCP does not operate around W*, and typ