@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={USENIX},
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 typically
grows its average window size much larger; this leads to decreased
throughput
and increased packet loss. The TCP throughput reduction can be explained
by
its loss behavior. Our results show that, Link-layer contention drops
offer the first sign of network overload in multihop wireless networks.
Link-layer drops precede buffer overflows. In fact, our observation shows
that,
buffer overflow-induced packet loss is rare and
packet drops due to link-layer contention dominate in typical scenarios.
Our analysis and simulations
further show that multihop wireless links collectively exhibit
graceful drop behavior: As the network overload increases, the link
contention
drop probability also increases, but saturates eventually. In general,
the link drop probability is insufficient to make the average TCP
window size stabilize around W*. Consequently, TCP suffers from
increased loss and reduced throughput from its maximum achievable value.
We further propose two techniques to improve TCP performance,
which are able to improve TCP throughput by 5\% to 30\% in
simulated topologies. Some simulation
results are also validated by real hardware measurements."
}
@INPROCEEDINGS{Fu0303:Optimal,
AUTHOR="Alvin Fu and Eytan Modiano and John Tsitsiklis",
TITLE="Optimal Energy Allocation for Delay-Constrained Data Transmission over a
Time-Varying Channel",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We seek to maximize the data throughput of an energy and time
constrained transmitter sending data over a fading channel.
The transmitter has a fixed amount of energy and a limited
amount of time to send data. Given that the channel fade
state determines the throughput obtained per unit of energy
expended, the goal is to obtain a policy for scheduling
transmissions that maximizes the expected data throughput. We
develop a dynamic programming formulation that leads to an
optimal transmission schedule. We then extend our approach to
the problem of minimizing the energy required to send a fixed
amount of data over a fading channel given deadline
constraints."
}
@INCOLLECTION{Fu0303:rsvplite,
AUTHOR="Xiaoming Fu and Cornelia Kappler",
TITLE="Towards {RSVP} Lite: Light-weight {RSVP} for Generic Signaling",
MONTH=mar,
YEAR=2003,
REFERENCES=10,
NOTE="IEEE Computer Society Press",
KEYWORDS="RSVP, Multicast, Signaling, QoS",
ABSTRACT="RSVP is a reservation setup protocol designed specifically to support QoS
signaling in the Internet. However, RSVP end-to-end signaled QoS for the
Internet has not become a reality. Moreover, there are many other
applications demanding different signaling services. This paper analyses
the features of RSVP version 1 we believe to be essential, and its
complexity due to QoS-oriented design and multicast support as an
indispensable component in a signaling protocol, deriving the design
principles to be covered
in a more generic signaling protocol. Based on this analysis, we present a
light-weight version of RSVP, RSVP Lite, which clearly separates the
signaled data from signaling messages and removes the multicast capability
from the mandatory components of RSVP. RSVP Lite is intended to be
applicable to a wide range of networking environments, while providing the
flexibility to serve for generic signaling purposes and incremental
deployment in the Internet.",
URL="http://user.informatik.uni-goettingen.de/~fu/paper/AINA2003\_fu.pdf"
}
@ARTICLE{Fu0306:Optimal,
AUTHOR="Alvin Fu and Eytan Modiano and John Tsitsiklis",
TITLE="Optimal Energy Allocation and Admission Control for Communications
Satellites",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=3,
PAGES="488-500",
MONTH=jun,
YEAR=2003,
REFERENCES=16,
KEYWORDS="communication; dynamic programming; resource allocation; satellite",
ABSTRACT="We address the issue of optimal energy allocation and admission control for
communications satellites in Earth orbit. Such satellites receive requests
for transmission as they orbit the Earth, but may not be able to serve
them all, due to energy limitations. The objective is to choose which
requests to serve so that the expected total reward is maximized. The
special case of a single energy-constrained satellite is considered.
Rewards and demands from users for transmission (energy) are random and
known only at request time. Using a dynamic programming approach, an
optimal policy is derived and is characterized in terms of thresholds.
Furthermore, in the special case where demand for energy is unlimited, an
optimal policy is obtained in closed form. Although motivated by satellite
communications, our approach is general and can be used to solve a variety
of resource allocation problems in wireless communications.",
URL="http://ieeexplore.ieee.org/iel5/90/27187/01208308.pdf?isNumber=27187\&prod=JNL\&arnumber=1208308\&arSt=+488\&ared=+500\&arAuthor=Fu\%2C+A.C.\%3B+Modiano\%2C+E.\%3B+Tsitsiklis\%2C+J.N."
}
@ARTICLE{Fu0306:Simple,
AUTHOR="Huirong Fu and Edward Knightly",
TITLE="A Simple Model of Real-Time Flow Aggregation",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=3,
PAGES="422-435",
MONTH=jun,
YEAR=2003,
REFERENCES=13,
KEYWORDS="admission control; aggregation; DiffServ; IntServ; model; performance; QoS;
scalability; simulation",
ABSTRACT={The IETF's integrated services (IntServ) architecture, together with
reservation aggregation, provides a mechanism to support the
quality-of-service demands of real-time flows in a scalable way, i.e.,
without requiring that each router be signaled with the arrival or
departure of each new flow for which it forwards data. However, reserving
resources in {"}bulk{"} implies that the reservation does not precisely
match the true demand. Consequently, if the flows' demanded bandwidth
varies rapidly and dramatically, aggregation can incur significant
performance penalties of under-utilization and unnecessarily rejected
flows. On the other hand, if demand varies moderately and at slower time
scales, aggregation can provide an accurate and scalable approximation to
IntServ. We develop a simple analytical model and perform extensive
trace-driven simulations to explore the effectiveness of aggregation under
a broad class of factors. Example findings include: 1) a simple
single-time-scale model with random noise can capture the essential
behavior of surprisingly complex scenarios; 2) with a
two-order-of-magnitude separation between the dominant time scale of
demand and the time scale of signaling and moderate levels of secondary
noise, aggregation achieves a performance that closely approximates that
of IntServ.},
URL="http://ieeexplore.ieee.org/iel5/90/27187/01208303.pdf?isNumber=27187\&prod=JNL\&arnumber=1208303\&arSt=+422\&ared=+435\&arAuthor=Huirong+Fu\%3B+Knightly\%2C+E.W."
}
@INPROCEEDINGS{Fu0310:Development,
AUTHOR="Xiaoming Fu",
TITLE="Development of QoS Signaling Protocols in the Internet",
BOOKTITLE="IEEE Conference on Local Computer Networks",
ADDRESS="Bonn/Koenigswinter, Germany",
MONTH=oct,
YEAR=2003,
NOTE="Workshop on High-Speed Local Networks (HSLN)",
ABSTRACT="QoS signaling protocol is one of the key components
in Internet QoS architectures to establish, maintain, and remove
reservation states in network nodes. This paper gives an overview
of the recent efforts underway on next steps in QoS signaling
protocols, namely RSVP extensions with mobility support,
QoSconditionalized
handoff protocol, the layered architecture RSVP
Lite and the Cross-Application Signaling Protocol (CASP). These
efforts address main issues with existing approaches differently :
modularity, complexity and mobility support, with a focus on
protocol behaviors based on different design principles. The
paper also provides pointers to standards effort towards general
Internet signaling and other service-specific signaling protocols."
}
@INPROCEEDINGS{Fu0310:Mobility,
AUTHOR="Xiaoming Fu and Henning Schulzrinne and Hannes Tschofenig",
TITLE="Mobility Support for Next-Generation Internet Signaling Protocols",
BOOKTITLE="VTC 2003 - IP Mobility",
DAYS=4,
MONTH=oct,
YEAR=2003,
ABSTRACT={Internet signaling protocols manage state along the data path. They
deliver signaling service for a variety of applications such as QoS,
NAT/firewall configuration and network diagnostics. The RSVP protocol is
probably the best-known signaling protocol. However, its complexity, lack
of extensibility and security issues limit its usefulness. Also, RSVP was
not designed with mobility in mind.
We present a two-layer signaling protocol, the Cross-Application Signaling
Protocol (CASP), that is flexible, easy to implement and extensible, while
supporting mobile end points. CASP consists of a general messaging layer
and a client layer, including a specialized next-hop discovery client. We
remove the dependency on IP addresses for session identification and allow
branch merging, so that resources on {"}dead{"} branches can be freed
expeditiously.}
}
@INPROCEEDINGS{Fu0310:Modelling,
AUTHOR="Shaojian Fu and Mohammed Atiquzzaman",
TITLE="Modelling {TCP} Reno with Spurious Timeouts in Wireless Mobile Environment",
BOOKTITLE="International Conference on Computer Communication and Network",
ORGANIZATION="ICCCN 2003",
ADDRESS="Dallas, TX",
PAGES="391-396",
MONTH=oct,
YEAR=2003,
REFERENCES=13,
KEYWORDS="TCP Reno; Spurious Timeout; modelling; wireless;",
ABSTRACT="TCP has been found to perform poorly in the presence of spurious
timeouts (ST) caused by delay spikes which are especially more
frequent in today's wireless mobile networks than in traditional
wired network. Because STs are generally considered to represent a
transient state in wired networks, previous research did not
consider the effects of ST on the steady state performance of
TCP. In this paper, we propose an analytical model for the sending
rate and throughput of TCP Reno as a function of packet error rate
and characteristics of spurious timeouts. The proposed model has
been validated against simulation results and has been found to be
more accurate than previous models in the presence of spurious
timeouts.",
URL="http://www.cs.ou.edu/~atiq/publications.html"
}
@ARTICLE{Fu0312:Low,
AUTHOR="Huirong Fu and Liren Zhang",
TITLE="Low cost pre-stored video transmission across networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=18,
PAGES="2061-2069",
MONTH=dec,
YEAR=2003,
REFERENCES=20,
KEYWORDS="Networks; Video transmission; Bandwidth allocation; QoS; Simulation;
Performance",
ABSTRACT="This paper proposes a simple, practical and low-cost dynamic segmentation
and bandwidth allocation scheme, called middle point, to transmit
pre-stored video from source to playback destination across networks. The
proposed scheme is based on two concepts, playback tunnel and bandwidth
tunnel, to determine the segmentation boundary and transmission bandwidth
with the objective of reducing transmission cost while guaranteeing the
playback buffer neither underflows nor overflows. The performance of the
proposed scheme is evaluated by a set of real-life MPEG video traces and
also compared with the well-known optimal smoothing scheme. The obtained
results show that the proposed scheme can be easily implemented with low
complexity and low transmission cost.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-491BJGG-1-43\&\_cdi=5624\&\_orig=browse\&\_coverDate=12\%2F31\%2F2003\&\_sk=999739981\&view=c\&wchp=dGLbVzb-zSkzS\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=a0a25255d6d05edf10ee85c90d8e3f1a\&ie=f.pdf"
}
@INPROCEEDINGS{Fuma0305:Low,
AUTHOR="Andrea Fumagalli and Prasanna Krishnamoorthy",
TITLE="A Low-Latency and Bandwidth-Efficient Distributed Optical Burst Switching
Architecture for Metro Ring",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Optical Burst Switching (OBS) provides statistical
multiplexing capabilities at the optical layer
with relaxed hardware requirements when compared
to optical packet switching.
One of the open challenges of OBS is to assemble as many
packets as possible in the same burst, while at the
same time ensuring low latency of the transmitted packets.
The authors propose the use of OBS to realize a
geographically distributed packet switch for metro rings.
High efficiency of the ring bandwidth and low packet
latency are obtained at the ring node by combining
a multi-token based protocol for contention-less
and loss-free transmission of bursts, known as the LightRing protocol,
with the creation of bursts that contain packets belonging
to multiple traffic flows (classified by priority and destination).
As illustrated in the paper, the proposed solution yields
throughput that is significantly higher than that one offered
by a centralized packet switch connected to the ring nodes
via dedicated optical circuits.
Latency of real time packets is kept at few dozens
of milliseconds under a variety of network scenarios.
The solution scales well geographically
for metro applications."
}
@ARTICLE{Fuma0306:Optimal,
AUTHOR="Andrea Fumagalli and Isabella Cerutti and Marco Tacca",
TITLE="Optimal Design of Survivable Mesh Networks Based on Line Switched {WDM}
Self-Healing Rings",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=3,
PAGES="501-512",
MONTH=jun,
YEAR=2003,
REFERENCES=25,
KEYWORDS="self-healing ring; shared-line protection; survivability; wavelength
converter",
ABSTRACT="Network survivability provided at the optical layer is a desirable feature
in modern high-speed networks. For example, the wavelength division
multiplexed (WDM) self-healing ring (or SHR/WDM) provides a simple and
fast optically transparent protection mechanism against any single fault
in the ring. Multiple self-healing rings may be deployed to design a
survivable optical mesh network by superposing a set of rings on the
arbitrary topology. However, the optimum design of such a network requires
the joint solution of three subproblems: the ring cover of the arbitrary
topology (the RC subproblem); the routing of the working lightpaths
between end node pairs to carry the offered traffic demands (the WL
subproblem); and the provisioning of the SHR/WDM spare wavelengths to
protect every line that carries working lightpaths (the SW subproblem).
The complexity of the problem is exacerbated when software and hardware
requirements pose additional design constraints on the optimization
process. The paper presents an approach to optimizing the design of a
network with arbitrary topology protected by multiple SHRs/WDM. Three
design constraints are taken into account, namely, the maximum number of
rings acceptable on the same line, the maximum number of rings acceptable
at the same node, and the maximum ring size. The first objective is to
minimize the total wavelength mileage (working and protection) required in
the given topology to carry a set of traffic demands. The exact definition
of the problem is given based on an integer linear programming (ILP)
formulation that takes into account the design subproblems and constraints
and assumes ubiquitous wavelength conversion availability. To circumvent
the computational complexity of the exact problem formulation, a
suboptimal solution is proposed based on an efficient pruning of the
solution space. By jointly solving the three design subproblems, it is
numerically demonstrated that the proposed optimization technique yields
up to 12\% reduction of the total wavelength mileage when compared to
solutions obtained by sequentially and independently solving the
subproblems. The second objective is to reduce the number of wavelength
converters required in the solution produced by the ILP formulation. Two
approaches- are proposed in this case that trade the required wavelength
mileage for the number of wavelength converters.",
URL="http://ieeexplore.ieee.org/iel5/90/27187/01208309.pdf?isNumber=27187\&prod=JNL\&arnumber=1208309\&arSt=+501\&ared=+512\&arAuthor=Fumagalli\%2C+A.\%3B+Cerutti\%2C+I.\%3B+Tacca\%2C+M."
}
@INPROCEEDINGS{Furm0305:Design,
AUTHOR="Sonia Furman and Mario Gerla",
TITLE="The Design of a Spatial Diversity Model to Mitigate Narrowband and
Broadband Interference in {DSSS} Ad Hoc Networks",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Spatial diversity has been gaining significant momentum in cellular
systems primarily due to its ability to provide increased channel
capacity and spectrum efficiency, extended range coverage as well as
reductions in delay spread, multipath fading, and co-channel
interference. However, in contrast to cellular systems, applications of
spatial diversity in Direct Sequence Spread Spectrum (DSSS) ad hoc
networks has been limited by the inherent nature of ad hoc networks
though the benefits to be gained may be similar to those in cellular
networks. It is therefore imperative to quantify the performance
advantage of spatial diversity in spread spectrum ad hoc networks.
This has been the primary motive for this study. In this paper we
describe an approach to modeling interference and we present a
design of a spatial diversity model to mitigate narrowband and
broadband interference in DSSS ad hoc networks. Further, we
demonstrate through simulation the performance advantages in the DSSS
ad hoc network with spatial diversity compared to that without spatial
diversity."
}
@TECHREPORT{Galb0304:Growth,
AUTHOR="Douglas Galbi",
TITLE={Growth in the {"}New Economy{"}: {U.S.} Bandwidth Use and Pricing Across
the 1990s},
TYPE="arXiv",
MONTH=apr,
YEAR=2003,
NOTE="Telecommunications Policy 25 (2001) 139-154",
KEYWORDS="pricing; bandwidth",
ABSTRACT="An acceleration in the growth of communications bandwidth in use and a
rapid
reduction in bandwidth prices have not accompanied the U.S. economy's
strong
performance in the second half of the 1990s. Overall U.S. bandwidth in use
has
grown robustly throughout the 1990s, but growth has not significantly
accelerated in the second half of 1990s. Average prices for U.S. bandwidth
in
use have fallen little in nominal terms in the second half of the 1990s.
Policy
makers and policy analysts should recognize that institutional change,
rather
than more competitors of established types, appears to be key to dramatic
improvements in bandwidth growth and prices. Such a development could
provide a
significant additional impetus to aggregate growth and productivity.",
URL="http://arXiv.org/abs/cs/0304032"
}
@TECHREPORT{Galb0304:Revolutionary,
AUTHOR="Douglas Galbi",
TITLE="Revolutionary Ideas for Radio Regulation",
TYPE="arXiv",
MONTH=apr,
YEAR=2003,
KEYWORDS=regulation,
ABSTRACT="Radio technology seems destined to become part of the standard
micro-processor input/output system. But unlike for memory or display
systems,
for radio systems government regulation matters a lot. Much discussion of
radio
regulation has focused on narrow spectrum management and interference
issues.
Reflecting on historical experience and centuries of conversation about
fundamental political choices, persons working with radio technology
should
also ponder three questions. First, what is a good separation and balance
of
powers in radio regulation? Second, how should radio regulation be
geographically configured? Third, how should radio regulation understand
and
respect personal freedom and equality? Working out answering to these
questions
involves a general process of shaping good government. This process will
be
hugely important for radio regulation, technology, and applications.",
URL="http://arXiv.org/abs/cs/0304034"
}
@TECHREPORT{Galb0304:Transforming,
AUTHOR="Douglas Galbi",
TITLE="Transforming the Structure of Network Interconnection and Transport",
TYPE="arXiv",
MONTH=apr,
YEAR=2003,
NOTE="CommLaw Conspectus, v. 8, n. 2 (Summer 2000) pp. 203-18",
KEYWORDS="Networking and Internet Architecture",
ABSTRACT="Vibrant development of a network-based economy requires separating
investment
in highly location specific local access technology from the development
of
standardized, geography-independent, wide-area network services. Thus far
interconnection arrangements and associated regulations have been too
closely
tied to the idiosyncratic geographic structure of individual operators'
networks. A key industry challenge is to foster the development of a wide
area
lattice of common geographic points of interconnection. Sound regulatory
and
anti-trust policy can help address this industry need.",
URL="http://arXiv.org/abs/cs/0304031"
}
@INPROCEEDINGS{Gall0303:Analytical,
AUTHOR="Laura Galluccio and Giacomo Morabito and Sergio Palazzo",
TITLE="An Analytical Study of a Tradeoff Between Transmission Power and {FEC} for
{TCP} Optimization in Wireless Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="It is well known that TCP has
performance problems when wireless links are involved in the end-to-end
connection. This is due to the high bit error rate characterizing
wireless links. Appropriate power management and error correction
can improve the link reliability observed by TCP and increase the
throughput performance accordingly.
In the literature, the effects of transmission power and error
correction capability on TCP performance have been considered separately,
so far.
In this paper, a study of the tradeoff between power management
and error correction is presented.
To this end, an analytical framework to
maximize a user satisfaction function, defined as the
ratio between the TCP throughput and a cost function, is
introduced. The proposed analytical framework does not depend on
the specific wireless system and does not rely on any TCP
throughput approximation formula. The benefits of joint power
management and error control are demonstrated in several relevant
case studies.
Methods Keywords: Mathematical programming/optimization"
}
@INPROCEEDINGS{Gama0305:Space,
AUTHOR="Hesham Gamal and Anand Arunachalam",
TITLE="Space-Time Coding techniques for {MIMO} block fading channels with
Co-channel Interference",
BOOKTITLE="International Conference on Communications",
ADDRESS="Anchorage, Alaska",
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we consider the design of space-time codes for
multi-input-multi-output systems operated in the presence of co-channel
interference (CCI). In particular, we consider two different scenarios. In
the first, the channel state information (CSI) is assumed to be known only
at the receiver. Based on the pairwise probability of error analysis, we
develop a new design criterion that determines the code robustness to
co-channel interference (CCI diversity gain). We further develop an
algebraic framework for constructing space-time codes that jointly
optimize the fading and CCI diversity gains. The proposed framework is
general for arbitrary numbers of transmit antennas and quadrature
amplitude modulation (QAM) constellations. In the second scenario, we
investigate adaptive space-time techniques that exploit partial CSI at the
transmitter. Our proposed design combines appropriate transmit antenna
selection with adaptive rate and power allocation to combat both
multi-path fading and CCI.
Index terms: wireless communication, space-time codes (STCs), block fading
(BF) channels, co-channel interference (CCI), channel state information
(CSI) and erasure channel."
}
@INPROCEEDINGS{Gane0303:YAPPERS,
AUTHOR="Prasanna Ganesan and Qixiang Sun and Hector Garcia-Molina",
TITLE="{YAPPERS:} A Peer-to-Peer Lookup Service over Arbitrary Topology",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Existing peer-to-peer search networks generally fall into
two categories: Gnutella-style
systems that use arbitrary topology and rely on controlled flooding for
search, and systems that explicitly build an underlying topology
to efficiently support a distributed hash table (DHT). In
this paper, we propose a hybrid scheme for building a peer-to-peer lookup
service over arbitrary
network topology. Specifically, for each node in the search network,
we build a small DHT consisting of nearby nodes and then provide an
intelligent search mechanism that can traverse all the small DHTs. Our
hybrid approach can reduce the nodes contacted for a lookup by an order
of magnitude compared to Gnutella, allows rapid searching of nearby
nodes through quick fan-out, does not reorganize the underlying overlay,
and isolates the effect of topology changes to small areas for
better scalability and stability.
Methods Keywords: System Design, Peer-to-Peer"
}
@INPROCEEDINGS{Gane0305:Priority,
AUTHOR="Kalpana Ganesan and Byrav Ramamurthy",
TITLE="Priority-based Lambda Scheduler",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Optical networks provide a new dimension to meet the demands of
exponentially growing traffic. Optical packet switching needs a good
switch architecture, which eliminates the O/E/O conversion as much as
possible. WDM provides a breakthrough to exploit the huge bandwidth of the
optical fiber. The demands for bandwidth increase with certain
applications, which necessitate employing, differentiated services for
different types of applications. This paper presents the idea of
priority-based l-scheduler, where the packets are differentiated into
different classes and services are provided accordingly. For example,
class 0 can correspond to non real time applications like email and ftp,
while class 1 can correspond to real-time audio and video communications."
}
@INPROCEEDINGS{Gang0303:Optimal,
AUTHOR="Samrat Ganguly and Badri Nath and Navin Goyal",
TITLE="Optimal Bandwidth Reservation Schedule in Cellular Network",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Efficient bandwidth allocation strategy with simultaneous fulfillment of
QoS requirement of a user in a mobile cellular network is still a critical
and an
important practical issue.
We explore the problem of finding the reservation schedue that would
minimize the amount of time for which bandwidth has to be allocated in a
cell while meeting the QoS
constraint. With the knowledge about the
the arrival and residence time distribution of a user in a cell, the
above problem can be optimally solved using a dynamic programming based
approach in polynomial time.
To be able to use the solution, we provide
a mechanism for constructing the arrival/residence time distribution based
on the measurement
of hand-off events in a cell. The above solution allows
us to propose an optimal time based bandwidth reservation and call
admission scheme.
By being scalable and distributed, the proposed scheme
justifies for practical implementation.
Simulations results are
also presented to show the effectiveness of the scheme to achieve the
target QoS level and
optimal bandwidth utilization."
}
@INPROCEEDINGS{Ganj0303:Input,
AUTHOR="Yashar Ganjali and Abtin Keshavarzian and Devavrat Shah",
TITLE="Input Queued Switches: Cell Switching vs. Packet Switching",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Input Queued(IQ) switches have been very well studied in the recent past.
The main problem in the IQ switches concerns scheduling. The main focus of
the research has been the fixed length packet-known as cell-case. The
scheduling decision becomes relatively easier for cells compared to the
variable length packet case as scheduling needs to be done at a regular
interval of fixed cell time. In real traffic dividing the variable
packets into cells at the input side of the switch and then re-assembling
these cells into packets on the output side achieve it. The disadvantages
of this cell-based approach are the following: (a) bandwidth is lost as
division of a packet may generate incomplete cells, and (b) additional
overhead of segmentation and reassembling cells into packets. This
motivates the packet scheduling: scheduling is done in units of arriving
packet sizes and in non-preemptive fashion. In [7] the problem of packet
scheduling was first considered. They show that under any admissible
Bernoulli i.i.d. arrival traffic a simple modification of Maximum Weight
Matching(MWM) algorithm is stable, similar to cell-based MWM [1-4]. In
this paper, we study the stability properties of packet based scheduling
algorithm for general admissible arrival traffic pattern. We first show
that the result of [7] extends to general re-generative traffic model
instead of just admissible traffic, that is, packet based MWM is stable.
Next we show that there exists an admissible traffic pattern under which
any work-conserving (that is maximal type) scheduling algorithm will be
unstable. This suggests that the packet based MWM will be unstable too. To
overcome this difficulty we propose a new class of waiting algorithms. We
show that waiting-MWM algorithm is stable for any admissible traffic using
fluid limit technique [6]."
}
@INPROCEEDINGS{Gao0303:State,
AUTHOR="Yuan Gao and Jennifer Hou",
TITLE="A State Feedback Control Approach to Stabilizing Queues for ECN-Enabled
{TCP} Connections",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="In this paper, we present an analytical TCP model that takes into account
of several issues that were ignored in the other existing models, i.e.,
(i) the congestion window is not gradually decreased at the rate of
w^2*p/2, but suddenly halved upon receipt of congestion indication and
(ii) the congestion window is halved at most once during one round-trip
time. We also include the delayed ACK option in the model. We show that
this enhanced model more realistically characterizes the TCP dynamics.
With the use of state feedback control theory, we then design (in
conjunction with the enhanced TCP model) an AQM controller to stabilize
the queue length at routers. The performance of the new controller is
shown, via ns-2 simulation to outperform several other schemes under a
variety of network scenarios and traffic loads, in terms of fluctuation in
the queue length, link utilization, and packet loss ratio.
Method keyword: state feedback control theory"
}
@INPROCEEDINGS{Gao0305:End,
AUTHOR="Xia Gao and Suhas Diggavi and S. Muthukrishnan",
TITLE="An end-to-end reliable transport protocol over wireless data networks",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The next generation wireless networks are posited to support large scale
data applications. Implementing end-to-end TCP in such networks faces two
problems. First, it is well known that TCP can not distinguish packet
losses due to link failures and that due to network congestion. Second,
TCP congestion control mechanism does not deal effectively with large
amount of out-of-order packet retransmissions; this problem has received
less attention in literature. In this paper, we present solutions to both
these problems. In particular, we present a Link Layer Protection (LHP)
protocol which implements Explicit Loss Notification (ELN) in a simple,
scalable manner, addressing the first problem. We also modify the
congestion control mechanism to incorporate knowledge of ELN and packet
loss pattern into retransmission decisions, solving the second problem. We
combine bot these solutions with TCP to present scalable, reliable
end-to-end wireless transport protocol."
}
@INPROCEEDINGS{Gao0305:Qos,
AUTHOR="Xia Gao and Gang Wu and Toshio Miki",
TITLE="QoS Framework for Mobile Heterogeneous Networks",
BOOKTITLE="ICC 2003 - Global Services and Infrastructure for Next Generation Networks",
ADDRESS="Anchorage, Alaska",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The ability to provide seamless and adaptive quality of service (QoS) in
heterogeneous environment is the key to the success of the next generation
wireless communication systems. There has been a considerable amount of QoS
research going on these days but the main portion still occurred in the
context of individual architecture components and much less progress has
been made in addressing the issue of an overall QoS architecture for the
mobile Internet.
In this article the state-of-the-art QoS techniques and standardization
activities are summarized. Important challenges in building a ubiquitous
QoS framework over the heterogeneous environment are examined in detail.
Then the key design principles of QoS framework are discussed. And a
three-plane QoS framework based on QoS signaling architecture and policy
framework is proposed which conforms to these principles and aims to
provide seamless support for future applications."
}
@ARTICLE{Gao0312:Proxy,
AUTHOR="Lixin Gao and Zhi-Li Zhang and Don Towsley",
TITLE="Proxy-Assisted Techniques for Delivering Continuous Multimedia Streams",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=6,
PAGES="884-894",
MONTH=dec,
YEAR=2003,
REFERENCES=23,
KEYWORDS="multimedia communication; multimedia streams; proxy server",
ABSTRACT="We present a proxy-assisted video delivery architecture that can
simultaneously reduce the resources requirements at the central server and
the service latency experienced by clients (i.e., end users). Under the
proposed video delivery architecture, we develop and analyze two novel
proxy-assisted video streaming techniques for on-demand delivery of video
objects to a large number of clients. By taking advantage of the resources
available at the proxy servers, these techniques not only significantly
reduce the central server and network resource requirements, but are also
capable of providing near-instantaneous service to a large number of
clients. We optimize the performance of our video streaming architecture
by carefully selecting video delivery techniques for videos of various
popularity and intelligently allocating resources between proxy servers
and the central server. Through empirical studies, we demonstrate the
efficacy of the proposed proxy-assisted video streaming techniques.",
URL="http://ieeexplore.ieee.org/iel5/90/28078/01255427.pdf?isNumber=28078\&prod=JNL\&arnumber=1255427\&arSt=+884\&ared=+894\&arAuthor=Lixin+Gao\%3B+Zhi-Li+Zhang\%3B+Towsley\%2C+D."
}
@INPROCEEDINGS{Gare0303:Modeling,
AUTHOR="Michele Garetto and Weibo Gong and Don Towsley",
TITLE="Modeling Malware Spreading Dynamics",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT={In this paper we present analytical techniques that can be used to
better understand the behavior of malware, a generic term that
refers to all kinds of malicious software programs propagating on
the Internet, such as e-mail viruses and worms. We develop a
modeling methodology based on Interactive Markov Chains that
is able to capture many aspects of the problem, especially the
impact of the underlying topology on the spreading characteristics
of malware. We propose numerical methods to obtain useful bounds
and approximations in the case of very large systems, validating
our results through simulation. An analytic methodology represents
a fundamentally important step in the development of effective
countermeasures for future malware activity. Furthermore, we
believe our approach can help to understand a wide range of
``dynamic interactions on networks{"}, such as routing protocols and
peer-to-peer applications.}
}
@INPROCEEDINGS{Garg0305:Can,
AUTHOR="Sachin Garg and Martin Kappes",
TITLE="Can I add a VoIP call ?",
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 study the inherent limitations of the 802.11 (a/b)
distributed coordination function (DCF) in supporting VoIP calls over a
wireless LAN. Specifically, we evaluate the upper bound on the number of
simultaneous VoIP calls that can be placed in a single cell of an
802.11(a/b) network. Making one additional VoIP call in that cell would
degrade the quality of all VoIP calls. The upper bound is calculated as a
function of the choice of VoIP codec and the length of the audio payload.
As an example, when a G711 codec with 20 millisecond audio payload is
used, an 802.11b cell can support only 3 to 12 simultaneous VoIP calls.
The actual number depends on the effective transmission rate of the
wireless station, which for 802.11b can be 1Mbps, 2Mbps, 5.5Mbps and
11Mbps. We also study the effect of spatial distribution of the wireless
stations on the upper bound which is the dominant factor in determining
the effective transmission rate of a station."
}
@INPROCEEDINGS{Ge0303:Modeling,
AUTHOR="Zihui Ge and Daniel Figueiredo and Sharad Jaiswal and James F. Kurose and
Don Towsley",
TITLE="Modeling Peer-Peer File Sharing Systems",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Peer-peer networking has recently emerged as a new paradigm for building
distributed networked applications. In this paper we develop simple
mathematical models
to explore and illustrate fundamental performance issues of peer-peer file
sharing
systems. The modeling framework introduced and the corresponding solution
method are flexible
enough to accommodate different characteristics of such systems. Through
the specification of model parameters, we apply our framework to three
different
peer-peer architectures: centralized indexing, distributed indexing with
flooded
queries, and distributed indexing with routed queries. Using our model, we
investigate the effects of system scaling, freeloaders, file popularity
and
availability on system performance. In particular, we observe that a
system with
distributed indexing and flooded queries cannot exploit the full capacity
of peer-peer
systems. We further show that peer-peer file sharing systems can tolerate
a significant
number of freeloaders without suffering much performance degradation. In
many
cases, freeloaders can benefit from the available spare capacity of
peer-peer systems and increase overall system throughput.
Our work shows that simple models coupled with efficient solution methods
can be used to understand and answer questions related to the performance
of peer-peer file sharing systems.
methods keywords: System design, Stochastic processes/Queueing theory"
}
@INPROCEEDINGS{Ge0305:Analytical,
AUTHOR="Ye Ge and Jennifer Hou",
TITLE="An Analytical Model for Service Differentiation in {IEEE} {802.11}",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="With the rapid deployment of wireless LAN technology,
provisioning of QoS differentiation to different traffic
classes in wireless LANs (WLANs) has become a prominent
research issue. In this paper, we analyze the throughput
performance of a p-persistent version of 802.11 MAC
protocol with multiple QoS traffic classes. (It has been
validated in \cite{cali:98,cali:00,cali:00b} that the
transmission probability used in the p-persistent version
of 802.11 can be ``converted'' to the retransmission
backoff timer value in 802.11.) In particular, we derive
the close-form solution of throughput with respect to different
traffic classes. With the derived analytical results, each
station can fine tune its the transmission probabilities
for different traffic classes to achieve the targeted throughput
ratio, while at the same time maximizing the total system
capacity. The correctness of the analytical results is
corroborated by simulation."
}
@INPROCEEDINGS{Gelf0305:Coding,
AUTHOR="Saul Gelfand and Jeongsoon Park and Jong-Han Lim",
TITLE="Coding across multicodes and time in {CDMA} systems",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="When combining a multicode CDMA system with convolutional coding, two
methods have been considered in the literature. In one method, coding is
across time in each multicode channel while in the other the coding is
across both multicodes and time. In this paper, a performance/complexity
analysis of decoding metrics and trellis structures for the two schemes is
carried out. It is shown that the latter scheme can exploit the multicode
diversity inherent in convolutionally coded direct sequence code division
multiple access (DS-CDMA) systems which employ minimum mean squared error
(MMSE) multiuser detectors. In particular, when the MMSE detector provides
sufficiently different signal-to-interference ratios (SIR's) for the
multicode channels, coding across multicodes and time can obtain
significant performance gain over coding across time, with nearly the same
decoding complexity."
}
@INPROCEEDINGS{Gelf0305:Concatenated,
AUTHOR="Saul Gelfand and Krishna kamal Sayana",
TITLE="Concatenated coding, multiplexing and interleaving for multiple access
{OFDM}",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The allocation of available resources in an OFDM multiaccess system is
usually done by alloting a fixed set of subcarriers to each user. Although
adaptive allocation has been suggested to improve performance, it has
several drawbacks associated with the need for robust channel estimates
and computational loading algorithms at the transmitter. In this paper, we
investigate an approach which spreads the data of all users over the
complete set of subcarriers by appropriate combination of coding,
multiplexing and interleaving.We analyze the performance of such a system
and demonstrate the potential for substantial coding, interleaving and
diversity gains relative to fixed subcarrier allocation, but with lower
computational and signaling cost than adaptive schemes."
}
@ARTICLE{Genc0304:Virtual,
AUTHOR="Aysegul Gencata and Biswanath Mukherjee",
TITLE="Virtual-Topology Adaptation for {WDM} Mesh Networks Under Dynamic Traffic",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=2,
PAGES="236-247",
MONTH=apr,
YEAR=2003,
REFERENCES=21,
KEYWORDS="dynamic traffic; mesh network; mixed-integer linear program (MILP); optical
network; virtual-topology reconfiguration; WDM",
ABSTRACT="We present a new approach to the virtual-topology reconfiguration problem
for a wavelength-division-multiplexing- based optical wide-area mesh
network under dynamic traffic demand. By utilizing the measured Internet
backbone traffic characteristics, we propose an adaptation mechanism to
follow the changes in traffic without a priori knowledge of the future
traffic pattern. Our work differs from most previous studies on this
subject which redesign the virtual topology according to an expected (or
known) traffic pattern, and then modify the connectivity to reach the
target topology. The key idea of our approach is to adapt the underlying
optical connectivity by measuring the actual traffic load on lightpaths
continuously (periodically based on a measurement period) and reacting
promptly to the load imbalances caused by fluctuations on the traffic, by
either adding or deleting one or more lightpath at a time. When a load
imbalance is encountered, it is corrected either by tearing down a
lightpath that is lightly loaded or by setting up a new lightpath when
congestion occurs. We introduce high and low watermark parameters on
lightpath loads to detect any over- or underutilized lightpath, and to
trigger an adaptation step. We formulate an optimization problem which
determines whether or not to add or delete lightpaths at the end of a
measurement period, one lightpath at a time, as well as which lightpath to
add or delete. This optimization problem turns out to be a mixed-integer
linear program. Simulation experiments employing the adaptation algorithm
on realistic network scenarios reveal interesting effects of the various
system parameters (high and low watermarks, length of the measurement
period, etc.). Specifically, we find that this method adapts very well to
the changes in the offered traffic.",
URL="http://ieeexplore.ieee.org/iel5/90/26877/01194820.pdf?isNumber=26877\&prod=JNL\&arnumber=1194820\&arSt=+236\&ared=+247\&arAuthor=Gencata\%2C+A.\%3B+Mukherjee\%2C+B."
}
@INPROCEEDINGS{Ghol0305:New,
AUTHOR="Mohammad Reza Gholami and Said Nader-Esfahani and Aliasghar Eftekhar",
TITLE="A New Method of Phase Noise Compensation in {OFDM}",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The local oscillator phase noise can severely affect the performance of
OFDM systems. In this paper a new method is presented for compensation of
this phase noise. The method is based on the fact that the scattered
pilots, which are used for channel estimation, are subject to the same
phase error as the OFDM symbols. Least square approach is used to exploit
the phase noise information that exists in the scattered pilots and
compensate the phase noise on the OFDM symbols. Simulation results show
that the method is very effective, especially in high SNR."
}
@INPROCEEDINGS{Ghor0305:Non,
AUTHOR="Seyed Ali Ghorashi and Lin Wang and Fatin Said and Hamid Aghvami",
TITLE="Non-Real Time Packet Transmission for a Microcell (Hotspot) Embedded in
{CDMA} Macrocell Systems",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Abstract- In a macrocell network, there will remain some geographical areas
within the cell coverage where mobile stations require further services.
These are mainly in terms of downloading data, in particularl in temporary
or permanent hotspot areas, such as exhibitions, conference centres, etc.
The objective of this study is to obtain extra capacity for W-CDMA systems
by adding hotspot base stations (bss) to an already present continuous
macrocell layer. IP-based services are offered to local mobile stations,
using packet switched transmission without additional bandwidth; i.e.
using the same frequency band in both hotspot and macrocell. In order to
maximise the hotspot bs throughput, and at the same time, to minimise the
inter-layer interference from hotspot to macrocell, a new Link Quality
Control scheme is designed. Downlink system level simulations are also
carried out to prove the feasibility of the idea and to show the effect of
required Eb/(Io+No) for macrocell users, on the hotspot data throughput."
}
@INPROCEEDINGS{Ghos0305:Bluetooth,
AUTHOR="Monisha Ghosh and Vasanth Gaddam",
TITLE="Bluetooth Interference Cancellation For 802.11g {WLAN} Receivers.",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="It is well known that one of the main sources of interference in the
2.4 GHz unlicensed band is due to the presence of Bluetooth systems
in this band. Recently, the IEEE 802.11 committee adopted a draft
standard called 802.11g that will provide data rates of upto 54 Mbps
in the 2.4 GHz band using OFDM as the physical layer modulation format.
One of the main barriers to actually achieving the high data rates
will be the presence of interferers like Bluetooth. In this paper we
develop a PHY layer algorithm for simultaneously estimating the
multipath channel and interference characteristics and using these
estimates in the convolutional decoder in order to improve the system
performance in the presence of Bluetooth interference. Simulation
results indicate that substantial improvements in 802.11g performance
can be obtained by this approach."
}
@INPROCEEDINGS{Giac0305:Analytical,
AUTHOR="Paolo Giacomazzi and Luigi Musumeci and Giacomo Verticale",
TITLE="An Analytical Model for User Satisfaction in {WCDMA} Systems",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Most analytical models for the evaluation of coverage and capacity of WCDMA
systems aim at evaluating only the outage probability of a given cellular
deployment scenario. This is not in line with the ETSI guidelines for
performance evaluation, which state that the coverage and the capacity of
the system should be measured in terms of a given percentage of
unsatisfied users. In this paper, we elaborate an analytical model capable
of giving such a figure. In addition, a compari-son between analytical and
simulation results confirms the va-lidity of the proposed model."
}
@INPROCEEDINGS{Gies0305:Space,
AUTHOR="Jochen Giese and Mikael Skoglund",
TITLE="Space-Time Constellations for Unknown Frequency-Selective Channels",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We consider the design of space-time constellations for
communication over frequency-selective fading channels where neither
the transmitter nor the receiver has any channel state
information. The design is based on the asymptotic union
bound on error probability as design criterion and the optimization
is carried out using a gradient search algorithm. Full multi-antenna
multi-path diversity gains are demonstrated to be achieved by the
designed codes. Compared to other constellations proposed by Hochwald
et al., power savings of up to 2 dB are shown to be possible."
}
@ARTICLE{Gilm0310:PEPA,
AUTHOR="Stephen Gilmore and Jane Hillston and Leïla Kloul and Marina Ribaudo",
TITLE="{PEPA} nets: a structured performance modelling formalism",
JOURNAL="Performance Evaluation",
VOLUME=54,
NUMBER=2,
PAGES="79-104",
MONTH=oct,
YEAR=2003,
REFERENCES=31,
KEYWORDS="PEPA; Stochastic process algebra; Cellular network",
ABSTRACT="In this paper we describe a formalism which uses the stochastic process
algebra PEPA as the inscription language for labelled stochastic Petri
nets. Viewed in another way, the net is used to provide a structure for
linking related PEPA systems. The combined modelling language naturally
represents such applications as mobile code systems where the PEPA terms
are used to model the program code which moves between network hosts (the
places in the net). We describe the implementation of a tool to support
this modelling formalism and apply this to model a hierarchical cellular
network.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-48WB998-2-80\&\_cdi=5663\&\_orig=browse\&\_coverDate=10\%2F31\%2F2003\&\_sk=999459997\&view=c\&wchp=dGLbVlz-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=9533fe409a1a0e2ce3fa9e2f95c1f099\&ie=f.pdf"
}
@INPROCEEDINGS{Gior0305:Level,
AUTHOR="Andrea Giorgetti and Marco Chiani and Mansoor Shafi and Peter Smith",
TITLE="Level Crossing Rates and {MIMO} Capacity Fades: Impacts of Spatial/Temporal
Channel Correlation",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="It is well known that MIMO systems offer the promise of achieving
very high spectrum efficiencies (many tens of bit/s/Hz) in a
mobile environment. The gains in MIMO capacity are sensitive to
the presence of spatial and temporal correlation introduced by the
radio environment. In this paper we examine how MIMO capacity is
influenced by a number of factors e.g. a) temporal correlation b)
various combinations of low/high spatial correlations at either
end, c) combined spatial and temporal correlations. In all cases
we compare the channel capacity that would be achievable under
independent fading. We investigate the behaviour of ``capacity
fades'', examine how often the capacity experiences the fades,
develop a method to determine level crossing rates and average
fade durations and relate these to antenna numbers."
}
@INPROCEEDINGS{Giro0303:Increasing,
AUTHOR="Frederic Giroire and Antonio Nucci and Nina Taft and Christophe Diot",
TITLE="Increasing the Robustness of {IP} Backbones in the Absence of Optical Level
Protection",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="There are two fundamental recent changes in IP
backbone design techniques that challenge the robustness of such
networks. First, SONET protection is gradually being removed because
of its high cost (SONET framing is kept for failure detection
purposes). Protection and restoration are provided by the IP layer
that operates directly over a DWDM infrastructure. Second, constraints
on Service Level Agreements force ISPs to systematically use the
shortest distance path between two Points of Presence. In this
context, IP backbones are extremely vulnerable to fiber cuts that can
bring down a significant fraction of the IP links. We propose a
heuristic to optimally map a given IP topology on a fiber
infrastructure. The optimal mapping maximizes the robustness of the
network while simultaneously maintaining the ISP's SLA delay
requirement. In addition, our heuristic takes into consideration
constraints that are faced by backbone administrators, such as a
shortage of wavelengths or priority among links. The heuristic is
evaluated on a real fiber network and IP topology and observations are
discussed."
}
@INPROCEEDINGS{Gkan0303:Spectral,
AUTHOR="Christos Gkantsidis and Milena Mihail and Ellen Zegura",
TITLE="Spectral Analysis of Internet Topologies",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We perform spectral analysis of the Internet topology at the AS level,
by adapting the standard spectral filtering method of examining the
eigenvectors
corresponding to the largest eigenvalues of matrices related to the
adjacency
matrix of the topology. We observe that the method suggests clusters of
ASes
with natural semantic proximity, such as geography or business interests.
We examine how these clustering properties vary in the core and in the
edge of the network,
as well as across geographic areas, over time, and between real and
synthetic data.
We observe that these clustering properties may be suggestive of traffic
patterns
and thus have direct impact on the link stress of the network.
Finally, we use the weight of the eigenvector corresponding to the first
eigenvalue
to obtain an alternative hierarchical ranking of ASes and links between
the ASes."
}
@TECHREPORT{Gokd0305:Semiclassical,
AUTHOR="Burc Gokden",
TITLE="Semiclassical Quantum Computation Solutions to the Count to Infinity
Problem: A Brief Discussion",
TYPE="arXiv technical report",
NUMBER="cs.NI/0305045",
MONTH=may,
YEAR=2003,
KEYWORDS="Networking and Internet Architecture; routing",
ABSTRACT="In this paper we briefly define distance vector routing algorithms, their
advantages and possible drawbacks. On these possible drawbacks, currently
widely used methods split horizon and poisoned reverse are defined and
compared. The count to infinity problem is specified and it is classified
to be
a halting problem and a proposition stating that entangled states used in
quantum computation can be used to handle this problem is examined.
Several
solutions to this problem by using entangled states are proposed and a
very
brief introduction to entangled states is presented.",
URL="http://arXiv.org/abs/cs/0305045"
}
@INPROCEEDINGS{Golm0305:Techniques,
AUTHOR="Nada Golmie",
TITLE="Techniques to Improve the Performance of {TCP} in a mixed Bluetooth and
{WLAN} Environment",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="A major challenge for the WLAN technology stems from having to
share the 2.4 GHz ISM band with other wireless devices such as Bluetooth
radios. The main goal of this paper is to investigate the use of
techniques
to mitigate the effects of interference for Bluetooth and WLAN and discuss
the
resulting performance trade-offs. We compare the performance of
the Bluetooth and WLAN systems and evaluate how each technique
improves or degrades TCP performance.
Simulation results for selected scenarios and configurations of
interest are obtained and the performance of Bluetooth and WLAN is
measured in terms of packet loss, TCP throughput and delay."
}
@INPROCEEDINGS{Gonç0305:Frequency,
AUTHOR="Luis {Gonçalves} and Atilio Gameiro",
TITLE="Frequency Domain Equalizer For {UMTS-TDD} Systems",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Direct Sequence Spread Spectrum (DS-SS) signals exhibit
cyclostationary properties which imply a redundancy between
frequency components separated by multiples of the symbol rate. In
this paper we present a Multiple Access Interference Canceller
that explores this property and applies to UMTS-TDD. This linear
frequency domain canceller operates in the spreaded signal in such
way that the interference and noise at its output is minimized
(Minimum Mean Squared Error Criterium). The performance is
evaluated in two configurations: one including the Frequency Shift
Canceller (FSC) and the other concatenated with Parallel
Interference Canceller (PIC). The results are benchmarked against
the performance of the conventional RAKE detector and the
conventional PIC detector."
}
@INPROCEEDINGS{Gong0305:Uplink,
AUTHOR="Wenbin Gong and Zhongmin Gan",
TITLE="Uplink Power Control with Faster Convergence in {DS-CDMA} System",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In DS-CDMA system, when the power control is ideal and the power assignment
is optimum in a dedicated cell, the relationship between the users'
received powers will have a definite ratio related to their required SIR.
In this paper, we propose a constrained cell-level power control algorithm
that updates the transmission power of users to make the received powers in
the dedicated cell satisfy the definite ratio after iteration. The proposed
iteration method does not need to compensate intra-cell interference
fluctuation while some other iteration algorithm should do. Using the
existing DCPC (distributed constrained power control) and CSOPC
(constrained second-order power control) as reference algorithm. We
compared three algorithms in a feasible DS-CDMA system. The results show
that the convergence speed of the proposed algorithm faster than the two
existing algorithms."
}
@INPROCEEDINGS{Goro0305:Performance,
AUTHOR="Alexei Gorokhov and Dhananjay Gore and Arogyaswami Paulraj",
TITLE="Performance bounds of antenna selection in {MIMO} systems",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper discusses antenna sub-set selection in
multiple-input multiple-output wireless systems. The
antennas are selected so as to maximize the channel
capacity. We present a near-optimal selection
algorithm that enables tractable statistical analysis
of the selection gain. We show that with antenna
selection the capacity is statistically lower bounded
by the capacity of a set of parallel independent SIMO
channels each with selection diversity. We leverage
this result to prove the equivalence in diversity
order between the full system (all receive antennas)
and the system with antenna selection. Simulations
validating analysis and illustrating algorithm
performance are also presented."
}
@INPROCEEDINGS{Gorr0305:Experimental,
AUTHOR="Antonio Gorrasi and Rocco Restaino",
TITLE="Experimental comparison of some scheduling disciplines fed by self-similar
traffic",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Self-similar traffic models have permitted a more realistic description of
the network devices behavior. However, the derivation of analytical
results turns out to be a very demanding task, also in the single-server
case. For the work-conserving switching architectures the characterization
of the Quality of Service (QoS) parameters is even more complicated due to
the correlation among the queues, induced by the scheduling policies. In
this paper we present a detailed study, based on simulations, of some
paradigmatic scheduling disciplines, performed with an aim to furnish some
useful tools for the design
high-speed network devices."
}
@ARTICLE{Goud0301:Secure,
AUTHOR="Mohamed Gouda and Chin Huang",
TITLE="A Secure Address Resolution Protocol",
JOURNAL="Computer Networks",
VOLUME=41,
NUMBER=1,
MONTH=jan,
YEAR=2003,
KEYWORDS="ARP; address resolution; Authentication; Ethernet; Internet; Network
protocol; Security; Subnetwork",
ABSTRACT="We propose an architecture for securely resolving IP addresses into
hardware addresses over an Ethernet. The
proposed architecture consists of a secure server connected to the
Ethernet and two protocols: an inviteaccept protocol
and a requestreply protocol. Each computer connected to the Ethernet can
use the inviteaccept protocol to periodically
record its IP address and its hardware address in the database of the
secure server. Each computer can later use
the requestreply protocol to obtain the hardware address of any other
computer connected to the Ethernet from the
database of the secure server. These two protocols are designed to
overcome the actions of any adversary that can lose
sent messages, arbitrarily modify the \fields of sent messages, and
replay old messages.",
URL="http://www.cs.utexas.edu/users/chuang/comnet0103.pdf"
}
@ARTICLE{Goud0308:Maximizable,
AUTHOR="Mohamed Gouda and Marco Schneider",
TITLE="Maximizable Routing Metrics",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=4,
PAGES="663-675",
MONTH=aug,
YEAR=2003,
REFERENCES=31,
KEYWORDS="communication system routing; communication system signaling; computer
networks; distance vector; distributed algorithms; link state; protocols;
rouiting; routing metrics; trees (graphs)",
ABSTRACT="We present a simple theory for maximizable routing metrics. First, we give
a formal definition of routing metrics and identify two important
properties: boundedness and monotonicity. We show that these two
properties are both necessary and sufficient for a routing metric to be
maximizable in any network. We show how to combine two (or more) routing
metrics into a single composite metric such that if the original metrics
are both bounded and monotonic (and, hence, maximizable), then the
composite metric is also bounded and monotonic (and, hence, maximizable).
We present several applications of our theory. We show that the composite
routing metric used in the inter-gateway routing protocol (IGRP) is not
maximizable and we show that enhanced IGRP (EIGRP) does not behave as
expected for nonmonotonic metrics. We also show that a technique for
scalable link-state routing does not work correctly when applied to
composite metrics. A common theme throughout the paper is that the
intuitions generated by using distance metrics to produce shortest paths
do not carry over to other routing metrics.",
URL="http://ieeexplore.ieee.org/iel5/90/27488/01224464.pdf?isNumber=27488\&prod=JNL\&arnumber=1224464\&arSt=+663\&ared=+675\&arAuthor=Gouda\%2C+M.G.\%3B+Schneider\%2C+M."
}
@INPROCEEDINGS{Gouv0303:MPLS,
AUTHOR="Luis Gouveia and Pedro {Patrício} and Amaro {de Sousa} and Rui Valadas",
TITLE="{MPLS} over {WDM} Network Design with Packet Level QoS Constraints based on
{ILP} Models",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="MPLS (Multi-Protocol Label Switching) over WDM (Wavelength Division
Multiplexing) networks are gaining significant attention due to the
efficiency in resource utilization that can be achieved by jointly
considering the two network layers. This paper addresses the design of
MPLS over WDM networks, where some of the WDM nodes may not have packet
switching capabilities. Given the WDM network topology and the offered
traffic matrix, which includes the location of the edge LSRs (Label
Switched Routers), we jointly determine the location of the core LSRs
(i.e. the core WDM nodes that also need to include packet switching
capabilities) and the lightpath routes (which are terminated on the LSRs)
that minimize the total network cost. We consider constraints both at the
optical and packet layers: an MPLS hop constraint on the maximum number of
LSRs traversed by each LSP (Label Switched Path), which guarantees a given
packet level QoS, and a WDM path constraint on the maximum length of
lightpaths, which accommodates the optical transmission impairments. A
novel Integer Linear Programming (ILP) formulation based on an hop-indexed
approach, which we call the HOP model, is proposed. A two-phase heuristic,
derived from a decomposition of the HOP model in two simpler ILP models
that are solved sequentially, is also developed. The computational results
show that the heuristic is efficient and produces good quality solutions,
as assessed by the lower bounds computed from the HOP model. In some
cases, the optimal solution is obtained with the branch-and-bound method."
}
@INPROCEEDINGS{Gowd0303:Protection,
AUTHOR="Sunil Gowda and Krishna Sivalingam",
TITLE="Protection Mechanisms for Optical {WDM} Networks based on Wavelength
Converter Multiplexing and Backup Path Relocation Techniques",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="This paper studies the problem of designing survivable optical
wavelength division multiplexed (WDM) networks. A wavelength-routed
wide area backbone network supporting circuit-switched traffic is
considered. This paper also considers the use of optical wavelength
conversion technology which has been shown to help improve network
performance. However, wavelength conversion is still an expensive
technology and using optical conversion could potentially result in
signal quality degradation.
In survivable networks, protection against failures is provided using
backup paths that are determined when a session is established. In this
paper, we present three primary and backup route computation
mechanisms that attempt to improve overall network performance
compared to existing solutions. One of the key design goals is to
reduce the number of required converters per node. First, we present a
routing algorithm, termed {\em conversion free primary routing} (CFPR)
that computes primary paths without wavelength conversion, as far as
possible. Next, we present a {\em converter multiplexing technique}
that is used to share wavelength converters among multiple backup
paths. This significantly reduces the number of connections blocked
due to wavelength converter unavailability and reduces the number of
wavelength converters required at each node, thus reducing system
cost. Finally, we propose a {\em backup path relocation scheme} that
migrates existing backup paths, whenever needed, to accommodate more
primary paths and also to obtain primary routes with fewer hops. This
is done to improve network utilization and reduce blocking
probability. The proposed techniques are analyzed in detail using a
discrete-event simulation model. The results show that significant
reduction in blocking probability is possible with the proposed
mechanisms. The number of converters required at each node to achieve
a given blocking probability is also seen to be four times lower,
compared to existing architectures based on static shortest path
routing."
}
@INPROCEEDINGS{Gowd0305:Performance,
AUTHOR="Sunil Gowda and Ramakrishna Shenai and Krishna Sivalingam and Hakki Cankaya",
TITLE="Performance Evaluation of {TCP} over Optical Burst-Switched {(OBS)} {WDM}
Networks",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper studies the performance of TCP, the transmission control
protocol, over an optical burst-switched~(OBS) wide-area network. This
paper attempts to generate a basic understanding of issues encountered
in the implementation of TCP over an OBS wide-area network, using
simulation. Typically, an OBS wide-area network consists of optical
core routers and electronic edge routers connected by wavelength
division multiplexed (WDM) links. IP packets are assembled into bursts
at the network ingress, which are then routed through the optical
burst-switched network and disassembled back into packets at the
network egress. TCP congestion and flow-control mechanisms are
designed to handle problems that arise in traditional IP
networks. This paper aims at addressing the following issues suited to
the implementation of TCP over an burst-switched network (i) Effect of
burstification (burst assembly and disassembly) delays over TCP
performance, (ii) Effect of data-burst scheduling on TCP performance
(iii) Effect of varying burst packet characteristics (i.e. burst size,
burst timeouts, and burst drop probability) on the performance of the
transport protocol."
}
@INPROCEEDINGS{Goya0303:Power,
AUTHOR="Munish Goyal and Anurag Kumar and Vinod Sharma",
TITLE="Power Constrained and Delay Optimal Policies for Scheduling Transmission
over a Fading Channel",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We consider an optimal power and rate scheduling problem for a
single user transmitting to a base station on a fading wireless link
with the objective of providing transmission delay guarantees. The
base station acts as a controller which, depending upon the
transmitter buffer lengths and the signal power to interference ratio
(SIR) on the uplink pilot channel, allocates transmission rate and
power to the user. We provide structural results for an average cost
optimal policy under a long run average transmitter power constraint.
We obtain a closed form expression relating the optimal policy when the
SIR is the best, to the optimal policy for any other SIR value. We
also obtain lower and upper bounds for the optimal policy."
}
@INPROCEEDINGS{Goya0305:Achieving,
AUTHOR="Mukul Goyal and K. Ramakrishnan and Wu-chi Feng",
TITLE="Achieving Faster Failure Detection in {OSPF} Networks",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="With the current default settings of the OSPF parameters, the network takes
several tens of seconds before recovering from a failure. The main
component in this delay is the time required to detect the failure using
Hello protocol. Failure detection time can be speeded up by reducing the
value of Hello interval. However, too small a value of Hello interval will
result in an increased chance of network congestion causing loss of several
consecutive Hellos, thus leading to false breakdown of adjacency between
routers. Such false alarms not only disrupt network traffic by causing
unnecessary routing changes but also increase the processing load on the
routers which may potentially lead to routing instability. In this paper,
we investigate the following question - What is the optimal value for the
Hello interval that will lead to fast failure detection in the network
while keeping the false alarm occurrence within acceptable limits? We
examine the impact of both network congestion and the network topology on
the optimal Hello interval value. Additionally, we investigate the
effectiveness of faster failure detection in achieving faster failure
recovery in OSPF networks."
}
@ARTICLE{Gree0309:Modeling,
AUTHOR="David Green and M. Obaidat",
TITLE="Modeling and simulation of {IEEE} {802.11} {WLAN} mobile ad hoc networks
using topology broadcast reverse-path forwarding {(TBRPF)}",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=15,
PAGES="1741-1746",
MONTH=sep,
YEAR=2003,
REFERENCES=9,
KEYWORDS="Wireless LANs; Mobile ad hoc networking (MANET); Topology broadcast based
on reverse-path forwarding (TBRPF); 802.11; Performance evaluation;
Modeling and simulation",
ABSTRACT="In this paper, we describe a test of Topology Broadcast based on
Reverse-Path Forwarding (TBRPF) [MANET Working Group Draft (2002)] mobile
routing protocol compared to Open Shortest Path First-2 (OSPF2) [IETF
Network Working Group Draft RFC 2328 (1998)] protocol. The test used a new
OPNET model of IEEE 802.11 b wireless LAN (W1LAN) that we designed for
Mobile Ad hoc Networking (MANET) [IETF Network Working Group Draft (1999)]
protocol modeling. Our new model consists of an 802.11 b WLAN with
enhancements to the physical layer, medium access control layer, and
propagation model to facilitate design and study of proposed MANET
protocols. Our results indicate the effects of physical topologies on
different routing protocols and contrast the difference between a
traditional Internet routing protocol (OSPF2) and TBRPF, which was
designed specifically for MANET networks. The results should be
interesting to planners of new 3G wireless services and to organizations
such as military, law enforcement and emergency workers whose missions
require wireless mobile networks.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-480C3K5-1-17\&\_cdi=5624\&\_orig=browse\&\_coverDate=09\%2F22\%2F2003\&\_sk=999739984\&view=c\&wchp=dGLbVlz-zSkWW\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=b9caf44b691e6a88bf9ba4a36c45257e\&ie=f.pdf"
}
@ARTICLE{Gril0311:IP,
AUTHOR="Antonio Grilo and Mario Macedo and Mario Nunes",
TITLE="{IP} QoS support in {IEEE} 802.11b WLANs",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=17,
PAGES="1918-1930",
MONTH=nov,
YEAR=2003,
REFERENCES=21,
KEYWORDS="Wireless LAN; IEEE 802.11; IP; Quality of Service; Scheduling disciplines",
ABSTRACT="This paper addresses the support of IP with Quality of Service (QoS) in
IEEE 802.11b WLANs. Both the Distributed Coordination Function (DCF) and
Point Coordination Function (PCF) modes of operation are analysed and
compared. For DCF, both the original standard and some of the enhancements
proposed for IEEE 802.11e are considered. For PCF, two alternative
scheduling disciplines are considered: Scheduling based on Estimated
Transmission Times (SETT) proposed by the authors and Weighted Deficit
Round Robin (WDRR). It is shown that while WDRR is suitable to perform
fair bandwidth distribution, SETT also takes into account maximum
transmission delay and service priority. Simulation results show that DCF
cannot be used to support IP QoS even if 802.11e enhancements are used. On
the other hand, PCF performs better with SETT than with WDRR. SETT is able
to keep a similar level for network utilisation, while fulfilling the QoS
requirements of real-time services such as packet telephony and
videoconference, even in the presence of lower priority bursty data. The
impact of the high overhead introduced by the IEEE 802.11 PHY and MAC
layers was also evaluated, showing that for small packet traffic such as
Voice over IP traffic, advanced voice compression is of limited
usefulness.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-48S4CP8-2-40\&\_cdi=5624\&\_orig=browse\&\_coverDate=11\%2F01\%2F2003\&\_sk=999739982\&view=c\&wchp=dGLbVlz-zSkzk\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=26ca38ebae78d967e67bed11bf2d9fc4\&ie=f.pdf"
}
@INPROCEEDINGS{Gros0303:Locating,
AUTHOR="Matthias Grossglauser and Martin Vetterli",
TITLE="Locating Nodes with {EASE:} Mobility Diffusion of Last Encounters in Ad Hoc
Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Routing in large-scale mobile ad hoc networks is challenging because
all the nodes are potentially moving. Geographic routing can
partially alleviate this problem, as nodes can make local routing
decisions based solely on the destinations' geographic coordinates.
However, geographic routing still requires an efficient {\em location
service}, i.e., a distributed database recording the location of every
destination node. Devising efficient, scalable, and robust location
services has received considerable attention in recent years.
The main purpose of this paper is to show that {\em node mobility} can
be exploited to disseminate destination location information {\em
without incurring any communication overhead}. We achieve this by
letting each node maintain a local database of the time and location
of its last encounter with every other node in the network. This
database is consulted by packets to obtain estimates of their
destination's current location. As a packet travels towards its
destination, it is able to successively refine an estimate of the
destination's precise location, because node mobility has ``diffused''
estimates of that location.
We define and analyze a very simple algorithm called EASE (Exponential
Age SEarch) and show that in a model where $N$ nodes perform
independent random walks on a square lattice, the length of the routes
computed by EASE are on the same order as the distance between the
source and destination {\em even for very large $N$.} Therefore,
without exchanging any explicit location information, the length of
EASE routes are within a constant factor of routes obtained with
perfect information. We discuss refinements of the EASE algorithm and
evaluate it through extensive simulations. We discuss general
conditions such that the mobility diffusion effect leads to efficient
routes without an explicit location service. In practical settings,
where these conditions may not always be met, we believe that the
mobility diffusion effect can complement existing location services
and enhance their robustness and scalability."
}
@ARTICLE{Gros0308:Time,
AUTHOR="Matthias Grossglauser and David Tse",
TITLE="A Time-Scale Decomposition Approach to Measurement-Based Admission Control",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=4,
PAGES="550-563",
MONTH=aug,
YEAR=2003,
REFERENCES=20,
KEYWORDS="admission control; measurement; resource allocation; time scales",
ABSTRACT="We propose a time-scale decomposition approach to measurement-based
admission control (MBAC). We identify a critical time scale, T/spl
tilde//sub h/, such that: 1) aggregate traffic fluctuations slower than
T/spl tilde//sub h/ can be tracked by the admission controller and
compensated for by flow admissions and departures; 2) fluctuations faster
than T/spl tilde//sub h/ have to be absorbed by reserving spare bandwidth
on the link. The critical time scale is shown to scale as T/sub h///spl
radic/n, where T/sub h/ is the average flow duration and n is the size of
the link in terms of the number of flows it can carry. An MBAC design is
presented which filters aggregate measurements into low- and
high-frequency components separated at the cutoff frequency, 1/T/spl
tilde//sub h/, using the low-frequency component to track slow time-scale
traffic fluctuations and the high-frequency component to estimate the
spare bandwidth needed. Our analysis shows that the scheme achieves high
utilization and is robust to traffic heterogeneity, multiple time-scale
fluctuations and measurement errors. The scheme uses only measurements of
aggregate bandwidth and does not need to keep track of per-flow
information.",
URL="http://ieeexplore.ieee.org/iel5/90/27488/01224455.pdf?isNumber=27488\&prod=JNL\&arnumber=1224455\&arSt=+550\&ared=+563\&arAuthor=Grossglauser\%2C+M.\%3B+Tse\%2C+D.N.C."
}
@INPROCEEDINGS{Grov0305:Extending,
AUTHOR="Wayne Grover and Gangxiang Shen",
TITLE="Extending the p-cycle concept to path-segment protection",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This work introduces a significant extension to the method of p-cycles for
network protection. The main advance is the generalization of the p-cycle
concept to protect multi-span segments of contiguous working flow, not
only spans that lie on the cycle or directly straddle the p-cycle. This
effectively extends the p-cycle technique to include path protection or
protection of any flow segment along a path as well as the original span
protecting use of p-cycles. It also gives an inherent means of transit
flow protection against node loss. We develop a capacity optimization
model for the new scheme and compare it to prior p-cycle designs and other
types of efficient mesh-survivable networks. Results show that
path-segment-protecting p-cycles (flow p-cycles for short) have capacity
efficiency near that of a path-restorable network without stub release. An
immediate practical impact of the work is to suggest the of use flow
p-cycles to protect transparent optical express flows through a regional
network."
}
@INPROCEEDINGS{Gues0305:Outage,
AUTHOR="Tommy Guess and Hao Zhang and Timour Kotchiev",
TITLE="The Outage Capacity of {BLAST} for {MIMO} Channels",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper is concerned with multiple-input multiple-output (MIMO)
channels that experience quasi-static flat fading and Gaussian noise. The
information-theoretic quantity of outage capacity is precisely defined as
it relates to the
successive-decoding approach known as BLAST (or Bell Labs layered space
time) architecture. It is shown that finding the outage capacity of a
BLAST system is equivalent to the solution of a K-parameter optimization
problem, where K is the number of transmit antennas. This optimization is
solved and the resulting outage capacity of BLAST is found to sustain
a loss relative to the unconstrained (\ie optimal) system, though it
still provides for very high-rate data transmission."
}
@ARTICLE{Guha0312:Hierarchical,
AUTHOR="Sudipto Guha and Athina Markopoulou and Fouad Tobagi",
TITLE="Hierarchical Reliable Multicast: Performance Analysis and Optimal Placement
of Proxies",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=18,
PAGES="2070-2081",
MONTH=dec,
YEAR=2003,
REFERENCES=29,
KEYWORDS="Reliable Multicast; Performance Analysis; Hierarchy; Proxies; Location
Problems; Optimization; Dynamic programming; Approximation Algorithm",
ABSTRACT="This paper studies the use of multicast together with proxy nodes for
reliably disseminating data from a single source to a large number of
receivers. In order to achieve reliability, data must be retransmitted in
case of loss either by the source or by special network nodes, called
proxies. Each proxy is responsible for reliably delivering the data to a
subgroup it is assigned. The multicast tree is partitioned into subgroups
that form a hierarchy rooted at the source, hence the term hierarchical
reliable multicast. The performance of this approach strongly depends on
the topology and the loss characteristics of the underlying tree and the
location of proxies. In the first part of the paper, we study the
processing and bandwidth performance of such a reliable multicast
dissemination given the tree and the placement of proxies. In the second
part of the paper, we develop dynamic programming algorithms that give a
placement of a fixed number of proxies on an arbitrary tree that minimizes
the bandwidth used for reliable transfer. The first algorithm provides an
optimal solution to the multicast proxies location problem in polynomial
time, in the number of nodes and proxies. The second is an approximation
algorithm that gives a solution with cost within a chosen precision from
the optimal, in an improved running time. An optimal and an approximate
solution are also provided for the proxies location problem if unicast is
used for transmissions. Applications of this dynamic programming approach
to related problems are discussed.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-49H15H5-2-7M\&\_cdi=5624\&\_orig=browse\&\_coverDate=12\%2F31\%2F2003\&\_sk=999739981\&view=c\&wchp=dGLbVtb-zSkzS\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=cf16a90ea1c28eccda1c6fe9cb1f1046\&ie=f.pdf"
}
@INPROCEEDINGS{Guma0305:Protocol,
AUTHOR="Ashwin Gumaste and Imrich Chlamtac",
TITLE="A Protocol to Implement Ethernet Over {PON}",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper we propose a solution to implement Ethernet over PON using
two unidirectional channels for access networks. The protocol called TUR
is efficient and scalable and easy to implement using conventional mature
technologies. We discuss strategies to deploy both upstream as well as
downstream communication. Possible end-user designs are also discussed in
connection with the protocol. A simulation study evaluates the protocol
for throughput and delay, and compares to contemporary solutions."
}
@ARTICLE{Gumm0302:Efficient,
AUTHOR="Krishna Gummadi and Madhavarapu Pradeep and C. Siva Ram Murthy",
TITLE="An Efficient Primary-Segmented Backup Scheme for Dependable Real-Time
Communication in Multihop Networks",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=1,
PAGES="81-94",
MONTH=feb,
YEAR=2003,
REFERENCES=28,
KEYWORDS="backup channel; backup multiplexing; dependable connection; multihop
network; primary channel; quality-of-service (QoS); real-time
communication; resource reservation protocol (RSVP); segmented backup",
ABSTRACT="Several distributed real-time applications (e.g., medical imaging, air
traffic control, video conferencing) demand hard guarantees on the message
delivery latency and the recovery delay from component failures. As these
demands cannot be met in traditional datagram services, special schemes
have been proposed to provide timely recovery for real-time communications
in multihop networks. These schemes reserve additional network resources
(spare resources) a priori along a backup channel that is disjoint with
the primary. Upon a failure in the primary channel, its backup is
activated, making the real-time connection dependable. We propose a new
backup method, called segmented backups, in which backup paths are
provided for partial segments of the primary path rather than for its
entire length, as is done in the existing schemes. We show that our method
offers: 1) improved network resource utilization; 2) higher average call
acceptance rate; 3) better quality-of-service guarantees on propagation
delays and failure-recovery times; 4) increased flexibility to control the
level of fault tolerance of each connection separately. We provide an
algorithm for routing the segmented backups and prove its optimality with
respect to spare resource reservation. We detail necessary extensions to
resource reservation protocol (RSVP) to support our scheme and argue that
they increase the implementation complexity of RSVP minimally. Our
simulation studies on various network topologies demonstrate that spare
resource aggregation methods, such as backup multiplexing, are more
effective when applied to our scheme than to earlier schemes.",
URL="http://ieeexplore.ieee.org/iel5/90/26510/01180547.pdf?isNumber=26510\&prod=JNL\&arnumber=1180547\&arSt=+81\&ared=+94\&arAuthor=Gummadi\%2C+K.P.\%3B+Pradeep\%2C+M.J.\%3B+Murthy\%2C+C.S.R."
}
@INPROCEEDINGS{Gupt0303:Exploring,
AUTHOR="Anupam Gupta and Amit Kumar and Rajeev Rastogi",
TITLE="Exploring the trade-off between label size and stack depth in {MPLS}
Routing",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Despite the fact that MPLS is becoming widespread on the Internet, we
know essentially very little about the performance
one can achieve with it, and about the intrinsic trade-offs in its use
of resources. In this paper,
we undertake a comprehensive study of the label size versus stack depth
trade-off for MPLS routing protocols on lines and trees.
We show that in addition to LSP
tunneling, label stacks can also be used to dramatically reduce the
number of labels required for setting up MPLS LSPs in a network.
Based on this observation,
we develop routing algorithms and prove lower bounds
for two basic problems:
(1) Fixed Label Routing:
Given a fixed number of labels, we want to minimize the stack depth, and
(2) Fixed Stack Routing:
Given a bound on the stack depth, we want to minimize the number of
labels used. Our simulation results validate our approach, demonstrating
that our novel protocols enable MPLS routing on large trees with few
labels
and small stack sizes. Thus, our MPLS routing algorithms are applicable
to a number of practical scenarios involving the provisioning of VPNs
and multicast trees."
}
@INPROCEEDINGS{Gupt0305:Dom,
AUTHOR="Suhit Gupta and Gail Kaiser and David Neistadt and Peter Grimm",
TITLE="DOM-based Content Extraction of {HTML} Documents",
BOOKTITLE="12th International World Wide Web Conference",
MONTH=may,
YEAR=2003,
ABSTRACT="Web pages often contain clutter (such as pop-up ads,
unnecessary images and extraneous links) around the body of an article
that distract a user from actual content. Extraction of ``useful and
relevant'' content from web pages has many applications, including cell
phone and PDA browsing, speech rendering for the visually impaired, and
text summarization. Most approaches to removing clutter or making
content more readable involve changing font size or removing HTML and
data components such as images, which takes away from a webpage's
inherent look and feel. Unlike ``Content Reformatting'', which aims to
reproduce the entire webpage in a more convenient form, our solution
directly addresses ``Content Extraction''. We have developed a framework
that employs easily extensible set of techniques that incorporate
advantages of previous work on content extraction. Our key insight is
to work with the DOM trees, rather than with raw HTML markup. We have
implemented our approach in a publicly available Web proxy to extract
content from HTML web pages."
}
@INPROCEEDINGS{Gupt0305:Novel,
AUTHOR="Minaxi Gupta and Mostafa Ammar",
TITLE="A Novel Multicast Scheduling Scheme for Multimedia Server with Variable
Access Patterns",
BOOKTITLE="ICC 2003 - Global Services and Infrastructure for Next Generation Networks",
ADDRESS="Anchorage, Alaska",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Analysis of server logs from multimedia servers, a FTP server, and a web
server suggest that irrespective of the
content type and protocol used to retrieve it, the small percentage of
files that account for the most load on the
server exhibit a very dynamic popularity behavior. This observation has
implications for content dissemination
techniques like caching, server replication, content distribution
networks, and multicast. This paper focuses on the
impact of multimedia popularity on multicast scheduling. Guided by the
file dynamics patterns observed in the server
logs, we generate synthetic multimedia server logs with varying number of
server accesses and evaluate existing
multicast scheduling schemes in terms of client latency and reneging of
requests. Since existing scheduling schemes do
not adapt gracefully to changing access conditions, we develop MWT, a new
multicast scheduling scheme. MWT is fair to
all multimedia files and reduces reneging, leading to better utilization
of server resources during heavy access
conditions."
}
@INPROCEEDINGS{Gupt0305:Reliable,
AUTHOR="Sandeep Gupta and Vikram Shankar and Suresh Lalwani",
TITLE="Reliable Multicast {MAC} Protocol for Wireless LANs",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Abstract Reliable multicast in wireless applications is gaining
importance with the development in technology. Applications
like multicast file transfer, distributed computing, chat and whiteboard
applications need reliability. However, due to mobility and
wireless channel characteristics, obtaining reliability in data transfer
is a difficult and challenging task. IEEE 802.11 does not support
reliable multicast due to its inability to exchange RTS/CTS
and ACKS with multiple recepients. However, several MAC layer
protocols have been proposed that provide reliable multicast. For
example, [3] have proposed the Leader-Based, Probability-Based
and Delay-Based Protocols. These protocols work around the
problem of multiple CTSs/ACKs colliding by providing ways to
have only one of the multicast recepient nodes respond with a CTS
or an ACK. These protocols perform well in low mobility wireless
LANs but the performance degenerates as the mobility of nodes increases.
In this paper, we discuss the inherent drawbacks of these
protocols and provide an alternative approach. We present an extension
to the IEEE 802.11 MAC layer protocol to provide link
level reliability to both unicast as well as multicast data
communications.
The extension is NAK based and uses tones, instead of
conventional packets, to signal a NAK. We also incorporate Dual
Tones, proposed by [4], to prevent an incoming mobile node from
interrupting an ongoing transmission. Simulation results suggest
that our MAC performs better than those proposed by [3] in terms
of both data throughput as well as reliability."
}
@INPROCEEDINGS{Gupt0305:Towards,
AUTHOR="Sandeep Gupta and Suresh Lalwani and Yashwanth Praskash and El-Badaway
El-Sharawy and Loren Schwiebert",
TITLE="Towards a Propagation Model for Wireless Biomedical Applications",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Abstract Propagation model plays a very important role in
designing wireless communication systems. Current advances in
semiconductor technology has made it possible to implant a network
of bio-sensors inside the human body for health monitoring
purposes [16], [18], [12]. For wireless communication inside the
human body, the tissue medium acts as a channel through which
the information is sent as electromagnetic (EM) radio frequency
(RF) waves. A propagation model is necessary to determine the
losses involved in the form of absorption of EM wave power by the
tissue. Absorption of EM waves by the tissue body, which consists
of mostly saline water, accounts for a major portion of the propagation
loss. In this paper we present a propagation loss model
(PMBA) for homogeneous tissue bodies. We have verified the
model for the frequency range of our interest (900MHz to 3GHz)
using a 3D EM Simulation Software, HFSSTM, and experimental
measurements using saturated salt water."
}
@INPROCEEDINGS{Gupt0305:Wideband,
AUTHOR="Charu Gupta and Tariq Mumtaz and Moushumi Zaman and Antonia
Papandreou-Suppappola",
TITLE="Wideband Chirp Modulation for {FH-CDMA} Wireless Systems: Coherent and
Non-Coherent Receiver Structures",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we propose a novel signaling scheme
based on wideband time-varying chirp signals for
frequency-hopped code division multiple access (FH-CDMA)
techniques. Our new method has been motivated by the
inherent resistance of chirp signals against channel
imposed distortions as chirps are bandwidth efficient
and robust to fading. Specifically, we combine FH-CDMA
with chirp modulation such that every user is identified
by a unique set of chirp rates as well as a unique pseudo-noise
sequence. Our simulations for additive white Gaussian noise and
Rayleigh fading channels successfully demonstrate
an increase in performance due to a decrease in multiple
access interference. We also propose a signal processing
based, non-coherent receiver structure when the chirp rate
information is corrupted at the receiver."
}
@INPROCEEDINGS{Gupt0306:Reputation,
AUTHOR="Minaxi Gupta and Paul Judge and Mostafa Ammar",
TITLE="A Reputation System for Peer-to-Peer Networks",
BOOKTITLE="ACM NOSSDAV 2003",
ADDRESS="Monterey, California, USC",
DAYS=1,
MONTH=jun,
YEAR=2003,
ABSTRACT="We investigate the design of a reputation system for decentralized
unstructured P2P networks like Gnutella. Having reliable reputation
information about peers can form the basis of an incentive system and can
guide peers in their decision making (e.g., who to download a file from).
The reputation system tracks peer behavior in the past using either of the
two computation schemes, debit-credit reputation computation (DCRC)and
credit-only reputation computation (CORC). Using a reputation computation
agent, we design a public key based
mechanism that updates the peer reputations in a secure, light-weight,
and partially distributed manner. We evaluate using simulations the
performance tradeoffs inherent in the design of our system."
}
@INPROCEEDINGS{Gurb0305:Services,
AUTHOR="Vijay Gurbani and Xian-He Sun",
TITLE="Services spanning heterogeneous networks",
BOOKTITLE="ICC 2003 - Global Services and Infrastructure for Next Generation Networks",
ADDRESS="Anchorage, Alaska",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Computer networks exist to provide services to users. In domains where
more then one network dominates and provides useful services, users will
want to avail themselves of services on either of the networks. This
paper looks at the convergence of two networks in the telecommunication
domain: the Internet and the Public Switched Telephone Network and
discusses techniques to access services between the two networks,
including an architecture for realizing services which would not be
possible if either of the networks was operating in isolation."
}
@INPROCEEDINGS{Gure0305:Improved,
AUTHOR="Assaf Gurevitz",
TITLE="An Improved Pragmatic Turbo Encoding Scheme for High Spectral Efficiency
Using Constellation Shaping",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We propose a new turbo encoding scheme for high spectral efficiency with
performance close to the Gaussian channel
capacity. The scheme combines nonuniform signaling on a Gaussian channel,
and pragmatic turbo coded modulation for simple and flexible
implementation.
A table is used to map equiprobable input symbols
into non equiprobable points in the QAM constellation.
It is shown that the new scheme provides shaping gains of 0.6 dB and 0.93
dB, at rates 2 and 3 bits/dim respectively
compared to the equiprobable pragmatic turbo coded modulation, and reach
about 1 dB from the
Gaussian channel capacity."
}
@INPROCEEDINGS{Gurt0303:Responding,
AUTHOR="Andrei Gurtov and Reiner Ludwig",
TITLE="Responding to Spurious Timeouts in {TCP}",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Delays on Internet paths, especially including wireless links, can be
highly variable. On the other hand, a current trend for modern TCPs is to
deploy a fine-grain retransmission timer with a lower minimum timeout
value than suggested by RFC2988. Spurious TCP timeouts cause unnecessary
retransmissions and congestion control back-off. The Eifel algorithm
detects spurious TCP timeouts and recovers by restoring the connection
state saved before the timeout. This paper presents an enhanced version of
Eifel response and illustrates its performance benefits on paths with a
high delay-bandwidth product. The refinements concern the following issues
(1) an efficient operation in presence of packet losses (2) appropriate
restoring of congestion control (3) adapting the retransmit timer to avoid
further spurious timeouts. In our simulations applying the Eifel algorithm
on paths with a high delay-bandwidth product can increase throughput by up
to 250\% and at the same decrease the load on the network by 3\%. Eifel
also shows adequate performance on heavily congested paths."
}
@ARTICLE{Gusa0306:Iterative,
AUTHOR="Oleg Gusak and Tugrul Dayar and Jean-Michel Fourneau",
TITLE="Iterative disaggregation for a class of lumpable discrete-time stochastic
automata networks",
JOURNAL="Performance Evaluation",
VOLUME=53,
NUMBER=1,
PAGES="43-69",
MONTH=jun,
YEAR=2003,
REFERENCES=38,
KEYWORDS="Discrete-time stochastic automata networks; Ordinary lumpability; Iterative
disaggregation; Wireless asynchronous transfer mode system",
ABSTRACT="Stochastic automata networks (SANs) have been developed and used in the
last 15 years as a modeling formalism for large systems that can be
decomposed into loosely connected components. In this work, we concentrate
on the not so much emphasized discrete-time SANs. First, we remodel and
extend an SAN that arises in wireless communications. Second, for an SAN
with functional transitions, we derive conditions for a special case of
ordinary lumpability in which aggregation is done automaton by automaton.
Finally, for this class of lumpable discrete-time SANs we devise an
efficient aggregationiterative disaggregation algorithm and demonstrate
its performance on the SAN model of interest.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-481MYH2-1-GR\&\_cdi=5663\&\_orig=browse\&\_coverDate=06\%2F30\%2F2003\&\_sk=999469998\&view=c\&wchp=dGLbVlb-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=fc5f926dd24ad412e60914888b49e55c\&ie=f.pdf"
}
@INPROCEEDINGS{Gwal0305:Aodv,
AUTHOR="Sumit Gwalani and Elizabeth Belding-Royer and Charles Perkins",
TITLE="{AODV-PA:} {AODV} with Path Accumulation",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Ad hoc networks meet the demands of spontaneous network setup. They are
characterized by the use of wireless links, dynamically changing topology,
multi-hop connectivity and decentralized routing mechanisms and
decision-making. AODV and DSR are the two most widely studied on-demand ad
hoc routing protocols. Previous studies have shown limitations of these
protocols in certain network scenarios. To improve the performance of
AODV, we modify AODV to include the source route accumulation feature of
DSR. We call this AODV with path accumulation. This protocol optimizes
AODV to perform effectively in terms of routing overhead and delay during
high load. The performance of the protocol is evaluated by a simulation
model under a variety of network conditions. We also compare its
performance with that of unmodified AODV and DSR. We demonstrate how a
small change to the AODV protocol can lead to significantly improved
performance results."
}
@INPROCEEDINGS{Gwon0303:Fast,
AUTHOR="Youngjune Gwon and Guangrui Fu and Ravi Jain",
TITLE="Fast handoffs in wireless {LAN} networks using mobile initiated tunneling
handoff protocol for IPv4 (MITHv4)",
BOOKTITLE="IEEE Wireless Communications and Networking",
ORGANIZATION="IEEE",
PUBLISHER="IEEE",
PAGES="1248-1253",
MONTH=mar,
YEAR=2003,
KEYWORDS="mobile communication mobile computing transport protocols",
ABSTRACT="We investigate fast IP handoffs in wireless LAN networks. As a simple
mobile-controlled approach, we introduce mobile initiated tunneling
handoff protocol for IPv4 (MITHv4). Our experimental results show that
MITHv4 can achieve optimized low latency and low loss IP handoffs in
wireless LAN networks. Furthermore, MITHv4 significantly reduces the link
layer trigger requirements and substantial access network support to
synchronize link layer and IP layer handoffs that fast Mobile IPv4
(FMIPv4) protocols heavily rely on. These benefits of MITHv4 are crucial
for wireless LAN networks where the required link layer triggers for
FMIPv4 are not feasible due to limited access network control.",
URL="http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=1200552"
}
@INPROCEEDINGS{Ha0305:Optimal,
AUTHOR="Jeongseok Ha",
TITLE="Optimal Puncturing of Irregular Low-Density Parity-Check Codes",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper we consider rate compatible puncturing of low density parity
check codes. We present a general density evolution-based procedure which
finds the optimal puncturing of a base code.
We show that puncturing can be performed across a range of rates and
code lengths in a manner that produces punctured codes with good
thresholds. This allows one to implement a single optimal LDPC of low rate
that can be punctured across a wide range of rates without loss of
threshold performance. Simulation results show that the error floors of
the codes do not degrade after puncturing."
}
@ARTICLE{Haar0301:Smart,
AUTHOR="Martin Haardt and Quentin Spencer",
TITLE="Smart antennas for wireless communications beyond the third generation",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=1,
PAGES="41-45",
MONTH=jan,
YEAR=2003,
REFERENCES=21,
KEYWORDS="Smart antennas; Beamforming; Space-time codes;
Multiple-inputmultiple-output systems; Space-time processing; Spatial
channel models; Wireless World Research Forum",
ABSTRACT="Smart antennas are essential to increase the spectral efficiency of
wireless communication systems. They can be realized by an antenna array
at the base station and sophisticated base-band signal processing.
Thereby, adaptive directional reception is achieved on the uplink and
adaptive directional transmission on the downlink if channel knowledge is
available at the transmitter. Hence, an increased antenna gain and an
increased diversity gain are realized towards the desired user. At the
same time, less interference is received from the other directions on the
uplink or transmitted in the other directions on the downlink if channel
knowledge is available at the transmitter. Therefore, more users can be
accommodated by the system and a corresponding increase of the spectral
efficiency is achieved. Even higher spectral efficiencies can be obtained
if antenna arrays are not only used at the base station but also at the
mobile. The theoretical capacity of such multiple-inputmultiple-output
systems has been shown to grow linearly with the size of the antenna
arrays in sufficiently rich multi-path environments. Open problems in this
new area of wireless communications include better and more realistic
propagation models as well as improved algorithms for transmission and
reception which approach the theoretical limits of the channel.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-45W39W6-1-K\&\_cdi=5624\&\_orig=browse\&\_coverDate=01\%2F01\%2F2003\&\_sk=999739998\&view=c\&wchp=dGLbVzb-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=620e3944a0f12d02c9f1381b0854c2fd\&ie=f.pdf"
}
@ARTICLE{Haas0308:Unified,
AUTHOR="Oliver Haase and Kazutaka Murakami and Thomas Porta",
TITLE="Unified mobility manager: Enabling efficient {SIP/UMTS} mobile network
control",
JOURNAL="IEEE Wireless Communications",
VOLUME=10,
NUMBER=4,
PAGES="66-75",
MONTH=aug,
YEAR=2003,
KEYWORDS="sip;umts;pstn;imm;hlr",
ABSTRACT="Internet telephony is viewed as an emerging technology not only for
wireline networks, but also for third-generation wireless networks.
Although IP end to end is considered the ultimate approach to future
wireless voice services, there is still a long way to go before IP voice
packets can be effectively transported over the air. Therefore, Internet
telephony and today s circuit-switched wireless network will coexist for
years to come, and it is essential to effectively perform interworking
between these networks. This article proposes the Unified Mobility Manager
(UMM) that achieves efficient interworking between traditional wireless
networks and Internet telephony networks. The main characteristic of the
UMM is that it combines UMTS HLR and SIP proxy functionality in one
logical entity, which helps eliminate the performance degradation due to
interworking between SIP and UMTS. This article identifies seven potential
network architectures with and without the UMM and with varying degrees of
IP penetration in the wireless core networks, and performs comparative
analysis in terms of their call setup signaling latency. Our performance
results show that for SIP originated calls, the architecture with the UMM
can achieve better performance than existing UMTS networks without the
UMM. Our results further show that when the backbone network is fully
IP-enabled, dramatic performance gains can be accomplished with the UMM
for PSTN originated calls as well as for SIP originated calls. The article
also demonstrates that the UMM allows graceful migration from today s
circuit-switched wireless networks to hybrid SIP/circuit-switched wireless
networks, and toward the IMS architecture for all-IP UMTS networks in the
future."
}
@ARTICLE{Habi0305:Detecting,
AUTHOR="Ahsan Habib and Sonia Fahmy and Srinivas Avasarala and Venkatesh Prabhakar
and Bharat Bhargava",
TITLE="On detecting service violations and bandwidth theft in QoS network domains",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=8,
PAGES="861-871",
MONTH=may,
YEAR=2003,
REFERENCES=32,
KEYWORDS="Service level agreements; Network tomography; Network monitoring; Network
security; Quality of service",
ABSTRACT="We design and evaluate a simple and scalable system to verify quality of
service (QoS) in a differentiated services domain. The system uses a
distributed edge-to-edge monitoring approach with measurement agents
collecting information about delays, losses and throughput, and reporting
to a service level agreement monitor (SLAM). The SLAM detects potential
service violations, bandwidth theft, denial of service attacks, and flags
the need to re-dimension the network domain or limit its users.
Measurements may be performed entirely edge-to-edge, or the core routers
may participate in logging packet drop information. We compare the
core-assisted and edge-to-edge schemes, and we extend network
tomography-based loss inference mechanisms to cope with different drop
precedences in a QoS network. We also develop a load-based service
monitoring scheme which probes the appropriate edge routers for loss and
throughput on demand. Simulation results indicate that the system detects
attacks with reasonable accuracy, and is useful for damage control in both
QoS-enabled and best effort network domains.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-4753K38-3-4B\&\_cdi=5624\&\_orig=browse\&\_coverDate=05\%2F20\%2F2003\&\_sk=999739991\&view=c\&wchp=dGLbVzz-zSkWW\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=b18a6cfbf089582bec8a8aee4e0f8f13\&ie=f.pdf"
}
@INPROCEEDINGS{Hadz0305:Saturation,
AUTHOR="Zoran Hadzi-Velkov",
TITLE="Saturation Throughput - Delay Analysis Of {IEEE} {802.11} {DCF} In Fading
Channel",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we analytically analyzed the impact of an error-prone
channel over all performance measures in a traffic-saturated IEEE 802.11
WLAN. We calculated stations transmission probability by using the
modified Markov chain model of the backoff window size that considers the
frame-error rates and maximal allowable number of retransmission attempts.
The frame error rate has a significant impact over theoretical throughput,
mean frame delay, and discard probability. The peak throughput of a WLAN
is insensitive of the maximal number of retransmissions. Discard
probabilities are insensitive to the station access mode: Basic or RTS/CTS
handshake."
}
@INPROCEEDINGS{Hagh0305:Snr,
AUTHOR="Sasan Haghani and Norman Beaulieu and Moe Win",
TITLE="{SNR} Penalty of Hybrid Diversity Combining in Rayleigh Fading",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In hybrid selection/maximal ratio combining the
receiver selects the L branches with the largest
signal-to-noise ratios from N available diversity
branches and performs maximal ratio combining.
A penalty is incurred with respect to maximal ratio
combining which can be defined as the increase in
signal-to-noise ratio required for hybrid combining
to achieve the same symbol error probability as maximal
ratio combining. In this paper, we derive the
asymptotic signal-to-noise ratio penalties for
small and large values of signal-to-noise ratio
for arbitrary signaling constellations in Rayleigh
fading. We also present new
analytical expressions for the symbol error probabilities of 4-ary
orthogonal signaling and 8-ary biorthogonal signaling with
hybrid diversity combining in Rayleigh fading."
}
@ARTICLE{Hagh0307:Design,
AUTHOR="Afshin Haghighat and K. Faez and S. Khorsandi",
TITLE="Design of new real-time models for tight upper bound approximation of cell
loss ratio in {ATM} networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=12,
PAGES="1225-1239",
MONTH=jul,
YEAR=2003,
REFERENCES=19,
KEYWORDS="ATM; QoS; CLR approximation; Tight upper bound; Real-time; Piece-wise
linear approximation",
ABSTRACT="ATM as a high-speed cell switching technology can support multiple classes
of traffic with different quality of service (QoS) requirements and
diverse traffic characteristics. A main QoS requirement is the cell loss
ratio (CLR). We need a real-time expression for the CLR calculation in ATM
networks where the statistical multiplexing is an important factor. The
existing analytical methods for the CLR estimation are mostly based on
fluid-flow and stationary approximate models. In this paper, we first
evaluate these methods against the results obtained through simulation.
The simulation is done at the cell level that provides very accurate
results with buffer size as a variant. It is shown that the CLR estimation
based on existing analytical models are widely overestimated. We have,
then, proposed three new approaches that yield significant improvement in
the accuracy of the CLR approximation. First, we have found global
correction coefficients to compensate for the error of the current
analytical methods. Second, we have proposed a new upper bound based on
exact modeling of system behavior in the finite buffer case. This is a
novel approach that combines fluid-flow and stationary approximate models
and outperforms all the previous ones. The accuracy of the proposed model
is verified by simulation. Third, we have found a tight piece-wise linear
approximation that can be calculated in real-time. We have studied
application of these bounds in non-homogeneous as well as homogeneous
cases.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47HBWXR-1-77\&\_cdi=5624\&\_orig=browse\&\_coverDate=07\%2F21\%2F2003\&\_sk=999739987\&view=c\&wchp=dGLbVzz-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=9daaacd39406321909e8be6ec6d511a0\&ie=f.pdf"
}
@INPROCEEDINGS{Haje0303:Paging,
AUTHOR="Bruce Hajek and Kevin Mitzel and Sichao Yang",
TITLE="Paging and Registration in Cellular Networks: Jointly Optimal Policies an d
an Iterative Algorithm",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="This paper explores optimization of paging and registration policies
in cellular networks. Motion is modeled as a discrete-time Markov
process, and minimization of the discounted, infinite-horizon average
cost is addressed. The structure of jointly optimal paging and
registration policies is investigated through the use of dynamic
programming for partially observed processes. It is shown that
there exist policies with a certain simple structure that are
jointly optimal, though the dynamic programming approach does
not directly provide an efficient method to find the policies.
An iterative algorithm for policies with the simple form is
proposed and investigated. The algorithm alternates between
paging policy optimization and registration policy optimization.
It finds a pair of individually optimal policies, but an example
is given showing that the policies need not be jointly optimal."
}
@INPROCEEDINGS{Hajj0305:Baselining,
AUTHOR="Hassan Hajji",
TITLE="Baselining Network Traffic and Online Faults Detection",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper addresses the problem of normal operation baselining
for automatic detection of network anomalies. A model of network
traffic is presented in which studied variables are viewed as
sampled from a finite mixture model. Based on the stochastic
approximation of the maximum likelihood function, we propose
baselining network normal operation, using the asymptotic
distribution of the difference between successive estimates of
model parameters. The baseline random variable is shown to be
stationary, with mean zero under normal operation. Anomalous
events are shown to induce an abrupt jump in the mean. Detection
is formulated as an online change point problem, where the task is
to process the baseline random variable realizations,
sequentially, and raise alarms as soon as anomalies occur. An
analytical expression of false alarm rate allows us to choose the
design threshold, automatically. Extensive experimental results on
a real network showed that our monitoring agent is able to detect
unusual changes in the characteristics of network traffic, adapt
to diurnal traffic patterns, while maintaining a low alarm rate.
Despite large fluctuations in network traffic, this work proves
that tailoring traffic modeling to specific gaols can be
efficiently achieved."
}
@INPROCEEDINGS{Hama0305:Bit,
AUTHOR="Jyri Hamalainen and Risto Wichman",
TITLE="Bit Error Probabilities in a Two-Rate Communication System",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We examine a two-rate communication system where the transmission
is suspended if the received SNR falls below a given threshold. We
assume an FDD system and derive novel closed-form bit error
probabilities in the presence of feedback errors in flat Rayleigh
fading environment for single antenna transmission, orthogonal
space-time block coding and transmit antenna selection. A
single-user two--rate system would result in an infrequent use of
the channel and long delays, but combined with a physical layer
multiuser scheduler like in the high speed downlink packet access
scheme included in 3GPP WCDMA Release 5 specification the overall
channel utilization can be improved."
}
@INPROCEEDINGS{Han0305:Iterative,
AUTHOR="Bing Han and Xiqi Gao and Xiaohu You and Elena Costa",
TITLE="An iterative joint channel estimation and symbol detection algorithm
applied in {OFDM} system with high data to pilot power ratio",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="For orthogonal frequency-division multiplexing (OFDM) systems with
pilot-symbol-aided channel estimation, a straightforward way to overcome
system throughput deterioration is by decreasing the power and lessening
the number of pilots, which unfortunately, leads directly to the
degradation of BER performance. For the purpose of improving the BER
performance, an iterative joint channel estimation and symbol detection
algorithm with low complexity and fast convergence is proposed. Both
theoretical analysis and computer simulation show that this algorithm
gives better BER performance and saves the overhead of OFDM system."
}
@INPROCEEDINGS{Han0305:Joint,
AUTHOR="Zhu Han",
TITLE="Joint Power Control and Blind Beamforming in Wireless Networks",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Traditional power control with beamforming achieves targeted
Signal-to-Interference-Noise-Ratio (SINR) in wireless networks assuming
measurement of SINR and direction of arrival (DOA) at the receivers.
Blind beamforming is an emerging technique for DOA measurement without
consuming extra bandwidth. Here we propose a joint power control and
blind beamforming algorithm that reformulates the power control problem
and, importantly, does not need additional measurements or sending
training sequences. In contrast to traditional power control that
achieves a targeted SINR threshold, the scheme achieves a threshold on a
quantity available from blind beamforming, which is directly related to
bit error rate. We have shown in both analysis and simulation that it
converges to the desired solution."
}
@MISC{Hanc0310:Interactions,
AUTHOR="Robert Hancock and Jukka Manner and Charles Shen",
TITLE="Interactions of Routing and Mobility on {NTLP} and {NSLP}",
MONTH=oct,
YEAR=2003,
NOTE="Internet Draft",
KEYWORDS="NSIS; Mobility",
ABSTRACT="IP packet routing and changes in routes can have major influence on
protocols and services that set state in network nodes. Routing may
change, for example, due to node failure within the network, need for load
balancing, multihoming or due to end-host or even network
mobility. This draft is a first step in helping us to decide on how these
problems should be handled and how interactions with other potocols should
be handled and a stimulus to further security work.",
URL="http://www.ietf.org/internet-drafts/draft-hancock-nsis-routing-mobility-00.txt"
}
@INPROCEEDINGS{Hanl0305:Capacity,
AUTHOR="Leif Hanlen and Minyue Fu",
TITLE="Capacity of {MIMO} Channels: A Volumetric Approach",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper deals with the problem of computing channel capacity
for wireless communications systems with multi-antennas. The
system is modelled using a transmit volume, a receive volume and a
set of reflective scatterers. Based on the authors' previous work
on channel modelling of such a system, we give a
multi-input-multi-output model for communications between
arbitrary antenna arrays in two volumes. Together with a novel
noise model for describing interferences, we derive formulas for
channel capacity and capacity bounds. In particular, our results
give conclusions which agree with intuition: In the case where the
transmitter knows the channel, the channel capacity saturates to a
constant when the number of transmit/receive antennas increases
beyond a certain threshold; In the case where the transmitter does
not know the channel, the channel capacity still saturates when
the receive antennas increases but decays when the number of
transmit antennas increases beyond a certain threshold. Moreover,
simulation shows that these thresholds may occur even when the
antennas are much farther apart than half-wavelength."
}
@INPROCEEDINGS{Hanl0305:Wireless,
AUTHOR="Leif Hanlen and Minyue Fu",
TITLE="Wireless Communications Systems with Spatial Diversity: A Volumetric
Approach",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper presents a new physical modelling approach for wireless
systems with multiple antennas. The fundamental problem of
modelling the communications channel if we are given an arbitrary
spatial volume for transmitting, an arbitrary spatial volume for
receiving, and a set of scattering bodies is studied.
We show how to calculate the number of communication modes, both
for direct (point-to-point) and for scattering environments.
Our work explains the physical parameters
which determine the channel model and its channel capacity."
}
@INPROCEEDINGS{Hans0305:Analytical,
AUTHOR="Jan Hansen",
TITLE="Analytical Derivation of the Mean Interference Power in WLANs \& Ad-Hoc
Networks",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Radio interference from adjacent systems or users
is an important limiting quantity for the transmission rate
in wireless communications. Interference studies, however,
often have the drawback that they are obtained from measurements in a
particular
environment. A more generally valid characterization for the
interference power is highly desirable. In this paper,
such an expression is
analytically derived. It is based on a simple,
well-accepted pathloss law; furthermore, on a geometrically motivated
transformation
of the properties of the environment into expressions
that depend only on the volume and surface of the domain in
which transmitter and receiver are randomly located. This strategy
yields a highly flexible and accurate approximation of
the mean interference power as an analytical function
of the key characteristics of wave propagation and the surroundings.
The paper sheds also some light on the question why the
stochastic radio channel is geometrically very robust. To the best
knowledge of the author, this contribution is the first rigorous,
non-empirical
derivation of radio interference."
}
@INPROCEEDINGS{Harf0303:Measuring,
AUTHOR="Khaled Harfoush and Azer Bestavros and John Byers",
TITLE="Measuring Bottleneck Bandwidth of Targeted Path Segments",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Accurate measurement of network bandwidth is crucial for network management
applications as well as flexible Internet applications and protocols which
actively manage and dynamically adapt to changing utilization of network
resources, extensive work has focused on two approaches to measuring
bandwidth: measuring it hop-by-hop, and measuring it end-to-end along a
path. Unfortunately, best-practice tecniques for the former are
inefficient and techniques for the latter are only able to observe
bottlenecks visible at end-to-end scope. In this paper, we develop
end-to-end probing methods which can measure bottleneck nbandwidth along
arbitrary, targeted subpaths of a path in the network, including subpaths
shared by a set of flows. We evaluate our technique through extensive ns
simulations, then provide a comparative Internet performance evaluation
against hop-by-hop and end-to-end techniques. We also describe a number of
applications which we foresee as standing to benefit from solutions to this
problem, ranging from network troubleshooting and capacity provisioning to
optimizing the layout of application-level overlay networks, to optimized
replica placement."
}
@INPROCEEDINGS{Harl0305:Shared,
AUTHOR="David Harle and Florence Kolberg-Touvet",
TITLE="Shared Backup Protection based on Aggregated Information in {WDM} networks",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="A comparison between three schemes for the protection of lightpaths in
wavelength-routed networks under the control of the GMPLS plane is
presented. The protocols used to establish ER-LSP (Explicitly Routed Label
Switched Paths) in GMPLS can be used in the optical domain to provision
virtual lightpaths (sets of links and wavelengths connecting nodes) over
pre-computed paths and for protection mechanisms deployment. The
extensions for Traffic Engineering of the OSPF and RSVP protocols enable
the planning of shared protection mechanisms. The first scheme considered
is a simple dedicated protection scheme, while the last two schemes are
based upon shared protection wavelengths and can be supported by current
protocols. The schemes have been evaluated using models that focus upon
the relative merits of the protection schemes using full or partial fibre
information in terms of admission control for the lightpath requests. Path
selection is of secondary interest. The results obtained show that, for WDM
networks with wavelength conversion, the shared protection mechanism using
partial fibre information performs well and can be an alternative to the
use of a complex shared backup scheme; providing a minimal number of
reserved protection wavelengths and a low rejection probability."
}
@INPROCEEDINGS{Harm0305:Effective,
AUTHOR="Fotios C. Harmantzis and Dimitrios Hatzinakos and Ioannis Lambadaris",
TITLE="Effective Bandwidths and Tail Probabilities for Gaussian and Stable
Self-Similar Traffic",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we consider parsimonious Gaussian and Stable (heavy-tailed)
models,
which best capture the self-similarity of aggregate packet traffic in
broadband networks.
Using the effective bandwidths theory, we extend the recent results on
Stable self-similar-driven queues with
infinite buffer to the finite buffer case that model routers/switches
more accurately.
Large deviations results are extended from the large buffer
regime to the many sources limiting regime. Unfortunately, in the Stable
case, traditional large-deviations formulae degenerate into not
very helpful asymptotic results, unlike the Gaussian case.
This has a negative impact in engineering considerations
(e.g., connection admission control, buffer management, statistical
multiplexing gains), with
respect to those results, and leads to alternative solutions, e.g.,
empirical/numerical and simulation techniques."
}
@ARTICLE{Harr0302:New,
AUTHOR="Peter Harrison and Catalina Lladó",
TITLE="A new blocking problem from Java-based schedulers",
JOURNAL="Performance Evaluation",
VOLUME=51,
NUMBER="2-4",
PAGES="229-246",
MONTH=feb,
YEAR=2003,
REFERENCES=11,
KEYWORDS="Markov chains; Queueing networks; Blocking; Enterprise JavaBeans",
ABSTRACT="We consider a form of blocking, which is typical in clientserver systems
including those implemented under the Enterprise JavaBean (EJB)
specification. The novel feature is that tasks must wait for one of a
number of parallel queues to clear its outstanding work. Thus, blocking
time is the minimum of sojourn times at the parallel queues. Under certain
simplifying assumptions, we solve this model for the probability
distribution of blocking time and obtain a simple formula for its mean
value. We then use this result in an aggregate server model of a larger
queueing network in which further non-standard techniques are included to
represent this form of blocking. We compare our approximate results
against simulation data, obtaining good agreement for both system
throughput and queue length probability distributions at equilibrium.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-46WPNY4-4-60\&\_cdi=5663\&\_orig=browse\&\_coverDate=02\%2F28\%2F2003\&\_sk=999489997\&view=c\&wchp=dGLbVzb-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=fe766a52894827003e25e67ccf35b801\&ie=f.pdf"
}
@TECHREPORT{Harw0302:Analytical,
AUTHOR="Aaron Harwood",
TITLE="Analytical formulations of Peer-to-Peer Connection Efficiency",
INSTITUTION="arXiv",
MONTH=feb,
YEAR=2003,
KEYWORDS="Distributed, Parallel, and Cluster Computing; Architecture; Networking and
Internet Architecture",
ABSTRACT="Use of Peer-to-Peer (P2P) service networks introduces a new communication
paradigm because peers are both clients and servers and so each peer may
provide/request services to/from other peers. Empirical studies of P2P
networks
have been undertaken and reveal useful characteristics. However there is
to
date little analytical work to describe P2P networks with respect to their
communication paradigm and their interconnections. This paper provides an
analytical formulation and optimisation of peer connection efficiency, in
terms
of minimising the fraction of wasted connection time. Peer connection
efficiency is analysed for both a uni- and multi-connected peer. Given
this
fundamental optimisation, the paper optimises the number of connections
that
peers should make use of as a function of network load, in terms of
minimising
the total queue size that requests in the P2P network experience. The
results
of this paper provide a basis for engineering high performance P2P
interconnection networks. The optimisations are useful for reducing
bandwidth
and power consumption, e.g. in the case of peers being mobile devices with
a
limited power supply. Also these results could be used to determine when a
(virtual) circuit should be switched to support a connection.",
URL="http://arXiv.org/abs/cs/0302020"
}
@INPROCEEDINGS{Hass0305:Super,
AUTHOR="Navid Hassanpour and Hamid Jafarkhani",
TITLE="Super-quasi-orthogonal space-time trellis codes",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We introduce a new family of Space-Time Trellis Codes which extends the
powerful characteristics of Super-Orthogonal Space-Time Trellis Codes to
four
transmit antennas. We consider a family of quasi-orthogonal space-time
block
codes as building blocks in our new trellis codes. These codes combine
set-partitioning and a super set of quasi-orthogonal space-time block
codes in
a systematic way to provide full diversity and improved coding gain. The
result
is a very powerful code that provides full rate, full diversity, and high
coding gain.
\%It is also possible to maintain a tradeoff between coding gain and rate.
Simulation results demonstrate the good performance of our new
Super-Quasi-Orthogonal Space-Time Trellis Codes."
}
@ARTICLE{Hass0306:Service,
AUTHOR="Hossam Hassanein and Haiqing Chen and Hussein Mouftah",
TITLE="A service model for guaranteeing packet loss bounds in differentiated
services architectures",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=10,
PAGES="1083-1094",
MONTH=jun,
YEAR=2003,
REFERENCES=17,
KEYWORDS="DiffServ; Premium service; Assured service; Call admission control; Token
bucket; Buffer management; Simulation",
ABSTRACT="Differentiated Services (DiffServ) is a proposed architecture for the
Internet in which various applications are supported using a simple
classification scheme. Packets entering the DiffServ domain are marked
depending on the packets' class. Premium service and Assured service are
the first two types of services proposed within the DiffServ architecture
other than the best effort service. Premium service provides a strict
guarantee on users' peak rates, hence delivering the highest Quality of
Service (QoS). However, it expected to charge at high rates and also to
have low bandwidth utilization. The Assured service provides high priority
packets with preferential treatment over low priority packets but without
any quantitative QoS guarantees. In this paper, we propose a new service,
which we call the Loss bound Guaranteed (LG) service for DiffServ
architectures. This service can provide a quantitative QoS guarantee in
terms of loss rate. A measurement-based admission control scheme and a
signaling protocol are designed to implement the LG service. An extensive
simulation model has been developed to study the performance and viability
of the LG service model. We have tested a variety of traffic conditions and
measurement parameter settings in our simulation. The results show that the
LG service can achieve a high level of utilization while still reliably
keeping the traffic within the maximum loss rate requirement. Indeed, we
show that the DiffServ architecture can provide packet-loss guarantees
without the need for explicit resource reservation.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47CWTY0-3-27\&\_cdi=5624\&\_orig=browse\&\_coverDate=06\%2F20\%2F2003\&\_sk=999739989\&view=c\&wchp=dGLbVlb-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=2d400fcfb2254cdcbd2921a8d5ecbd0e\&ie=f.pdf"
}
@ARTICLE{Hass0309:Load,
AUTHOR="Hossam Hassanein and Audrey Zhou",
TITLE="Load-aware destination-controlled routing for MANETs",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=14,
PAGES="1551-1559",
MONTH=sep,
YEAR=2003,
REFERENCES=17,
KEYWORDS="Wireless ad hoc networks; Routing; Load balancing; Performance evaluation;
Path discovery; Path maintenance",
ABSTRACT="An ad hoc wireless mobile network is an infrastructure-less mobile network
that has no fixed routers; instead, all nodes are capable of movement and
can be connected dynamically in an arbitrary manner. In order to
facilitate communication of mobile nodes that may not be within the
wireless range of each other, an efficient routing protocol is used to
discover routes between nodes so that messages may be delivered in a
timely manner. In this paper, we present a novel Load-Balanced Ad hoc
Routing (LBAR) protocol for communication in wireless ad hoc networks.
LBAR defines a new metric for routing known as the degree of nodal
activity to represent the load on a mobile node. In LBAR routing
information on all paths from source to destination are forwarded through
setup messages to the destination. Setup messages include nodal activity
information of all nodes on the traversed path. After collecting
information on all possible paths, the destination then makes a selection
of the path with the best-cost value and sends an acknowledgement to the
source node. LBAR also provides an alternate path maintenance technique to
patch up broken links by detouring traffic to the destination. A
comprehensive simulation study was conducted to evaluate the performance
of the proposed scheme. Performance results show that LBAR outperforms
existing ad hoc routing protocols in terms of packet delivery and average
end-to-end delay.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47CWTY0-2-T\&\_cdi=5624\&\_orig=browse\&\_coverDate=09\%2F01\%2F2003\&\_sk=999739985\&view=c\&wchp=dGLbVlb-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=e1142f3d8c9e7ff2afac344b545bc947\&ie=f.pdf"
}
@ARTICLE{He0302:Extended,
AUTHOR="Jiafu He and Khosrow Sohraby",
TITLE="An Extended Combinatorial Analysis Framework for Discrete-Time Queueing
Systems With General Sources",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=1,
PAGES="95-110",
MONTH=feb,
YEAR=2003,
REFERENCES=26,
KEYWORDS="ballot theorems; batch arrival and departure models; combinatorial
analysis; multidimentional generating function",
ABSTRACT="The paper considers a general class of discrete time systems with batch
arrivals and departures. Such models appear frequently in the teletraffic
analysis of computer and communications networks. Our arrival models are
assumed to be quite general. They could be independent and identically
distributed (i.i.d.) in successive slots, periodic, Markovian, or
described by the moving average time-series model, etc. Our solution
framework is novel and unifying and it uses a combination of
multidimensional generating functions and combinatorial analysis utilizing
extensions of classical ballot theorems. In general, we provide an explicit
analytical expression as an infinite sum to obtain the system stationary
probability distribution avoiding classical root-finding methods, matrix
analytical methodologies, and spectral decomposition approaches. We
provide a number of analytical and numerical examples including: i.i.d.
models with Poisson and Binomial arrivals; multiserver queueing systems
fed by Markovian sources; queues fed with a discrete moving average source
of the first and second order; an i.i.d. discrete Pareto batch arrival
model. Closed-form analytical expressions are obtained for the stationary
distribution of the system queue lengths and numerical examples are also
provided when appropriate.",
URL="http://ieeexplore.ieee.org/iel5/90/26510/01180548.pdf?isNumber=26510\&prod=JNL\&arnumber=1180548\&arSt=+95\&ared=+110\&arAuthor=Jiafu+He\%3B+Sohraby\%2C+K."
}
@INPROCEEDINGS{He0303:Exploiting,
AUTHOR="Guanghui He and Jennifer Hou",
TITLE="On Exploiting Long Range Dependency of Network Traffic in Measuring Cross
Traffic on an End-to-end Basis",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="In this paper we present three theoretically grounded methods:
prediction, reconstruction and interpolation, for measuring cross
traffic on the bottleneck link of an end-to-end path. The objective
is to infer cross traffic as accurately as possible, while not
injecting a significant amount of probe packets into the network. In
the prediction-based method, we take advantage of the {\em LRD}
characteristic of the cross traffic to predict the future traffic
based on the recent information obtained by probe packets. In the
reconstruction method, we rebuild the entire cross traffic process
with the information obtained by probe packets. In the interpolation
method, we periodically send closely-spaced probe packet pairs to sample
cross traffic of the bottleneck link, and infer cross traffic between two
sampling points using interpolation. The simulation study indicates
that (i) the prediction-based and reconstruction methods can give good
mean measurement of cross traffic, while the interpolation method
usually captures the instantaneous value of cross traffic better; and (ii)
all three methods are adaptive to the dynamic change of
cross traffic and are quite robust in the presence of multiple bottleneck
links on an end-to-end path."
}
@INPROCEEDINGS{He0303:Framework,
AUTHOR="Xinming He and Christos Papadopoulos and Pavlin Radoslavov",
TITLE="A Framework for Incremental Deployment Strategies for Router-Assisted
Services",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Incremental deployment of a new network service or protocol is typically a
hard problem, especially when it has to be deployed in the routers. First,
an incrementally deployable protocol is needed; then, a study of the
performance impact of incremental deployment should be carried out to
evaluate deployment strategies. Choosing the wrong strategy can be
disastrous, as it may inhibit reaping the benefits of an otherwise robust
service, and prevent widespread adoption. Unfortunately, to date there has
been no systematic evaluation of incremental deployment for such services.
In this paper we focus on the second aspect, namely the performance impact
of incremental deployment of router-assisted services. We take a first cut
at defining a framework for evaluating incrementally deployable services,
which consists of three parts: (a) selection and classification of
deployment strategies; (b) definition of performance metrics; and (c)
systematic evaluation of deployment strategies. As a case study for our
framework, we evaluate the performance of router-assisted reliable
multicast protocols. Although our framework is still evolving, our results
clearly demonstrate that the choice of a strategy has a substantial impact
on performance, and thus affirms the need for systematic evaluation of
incremental deployment.
Our case study includes two router-assisted reliable multicast protocols,
namely PGM and LMS. We make several interesting observations: (a) the
performance of different deployment strategies varies widely; for example,
with some strategies, both PGM and LMS approach full deployment performance
with as little as 5\% of the routers deployed, but with other strategies
upwards of 80\% deployment may be needed to approach the same level; (b)
our sensitivity analysis reveals little variation in most cases; and (c)
the penalty associated with partial deployment is different for each of
these protocols: PGM tends to impact the network, whereas LMS impacts the
endpoints."
}
@INPROCEEDINGS{He0304:Simulation,
AUTHOR="Dajiang He and Charles Shen",
TITLE="Simulation Study of {IEEE} 802.11e {EDCF}",
BOOKTITLE="The 57th IEEE Vehicular Technology Conference",
PAGES="685-689",
MONTH=apr,
YEAR=2003,
KEYWORDS="EDCF; 802.11e; Wireless LAN; QoS",
ABSTRACT="This paper presents a simulation study on IEEE
802.11e Enhanced Distributed Coordination Function (EDCF)
mechanism, designed by the IEEE 802.11 group to enhance
the original 802.11 MAC with QoS facility. Based on ns2
platform, simulation study was conducted using various network
congurations and trafc patterns. The results basically prove the
effectiveness of MAC service differentiation provided by EDCF
compared to DCF and also point out the limitation of EDCF to
support real time trafc in Wireless LAN environment.",
URL="http://www.cs.columbia.edu/~charles/publication/vtc2003.pdf"
}
@INPROCEEDINGS{He0305:Impact,
AUTHOR="Jingyi He",
TITLE="Impact of Packet Aggregation and Deflection Routing on {TCP/IP} over
Optical Packet-Switched Networks",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Optical packet-switched (OPS) networks are believed to be a promising
solution to the Optical Internet to achieve large capacity and high
bandwidth efficiency. Given that TCP is the most prevalent end-to-end
transport protocol in the current Internet, how it performs in the future
Optical Internet based on OPS networks is of great interest. In this
paper, we study the impact of deflection routing and packet aggregation as
employed in OPS networks on the overall TCP performance as perceived by the
end users (in terms of throughput and fairness). We show that deflection
routing can significantly improve the TCP fairness. When used with packet
aggregation, deflection routing can also improve the TCP throughput. We
investigate two packet aggregation
schemes, namely, mixed-flow aggregation (aggregating packets from
different flows having the same destination) and per-flow aggregation
(aggregating packets from the same flow). We show that mixed-flow
aggregation performs better than per-flow aggregation in terms of both TCP
throughput and fairness."
}
@INPROCEEDINGS{Heda0305:Concatenated,
AUTHOR="Ahmadreza Hedayat and Aria Nosratinia",
TITLE="Concatenated Error-correcting Entropy Codes and Channel Codes",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We propose a general class of concatenated error-correcting entropy
codes and channel codes. In this way we extend and generalize the
existing body of work on iterative decoding of entropy and channel
codes. Using the structure and properties of serial concatenated codes,
we employ error-correcting entropy codes as the outer code, and a
convolutional code as the inner code. The generalization from entropy
codes to redundant entropy codes allows powerful error correction
similar to turbo codes. Through an experimental setup, we show that the
iterative decoding of the proposed concatenated code outperforms
iterative decoding of previously reported entropy and channel codes that
operate at the same overall rate."
}
@ARTICLE{Hein0302:Decomposition,
AUTHOR="Armin Heindl",
TITLE="Decomposition of general queueing networks with {MMPP} inputs and customer
losses",
JOURNAL="Performance Evaluation",
VOLUME=51,
NUMBER="2-4",
PAGES="117-136",
MONTH=feb,
YEAR=2003,
REFERENCES=29,
KEYWORDS="Data-loss queueing networks; Approximate analysis; Decomposition based on
SMPs and MMPPs; MMPP inputs; Traffic processes",
ABSTRACT="For nontrivial general (open) queueing networks, decomposition often
represents the only feasible solution method besides simulation. The
network is partitioned into individual nodes which are analyzed in
isolation with respect to approximate internal traffic representations.
The quality of the quickly obtained results very much depends on the
descriptors for the traffic processes within the network, which may be
split and merged before traversing the next queue. Recently, one of the
existing decomposition formalisms based on renewal processes as traffic
descriptors has been extended in order to include semi-Markov processes
(SMPs) and Markov-modulated Poisson processes (MMPPs) with two states.
However, due to the restriction to tandem networks, no operations for the
splitting and and merging were provided.
The numerical procedures for the splitting of SMPs and the superposition
of MMPPs proposed in this paper render the extended decomposition
framework available for general queueing networks. The correlations in the
traffic processes, which are known to have a considerable impact on
performance measures, are taken into account to some extent. Moreover, in
addition to renewal processes, MMPP inputsas they frequently arise in
computer communication modelingincrease the range of applications of
general queueing networks.
Numerical experiments on different network configurations illustrate the
capabilities and accuracy of the extended decomposition framework.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-479TM70-2-7K\&\_cdi=5663\&\_orig=browse\&\_coverDate=02\%2F28\%2F2003\&\_sk=999489997\&view=c\&wchp=dGLbVzb-zSkzk\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=397f2b0121b9c9dfe59a3c79ff0cd21f\&ie=f.pdf"
}
@ARTICLE{Heym0305:New,
AUTHOR="D. Heyman and T. v. Lakshman and Arnold Neidhardt",
TITLE="A new method for analyzing feedback-based protocols with applications to
engineering Web traffic over the Internet",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=8,
PAGES="785-803",
MONTH=may,
YEAR=2003,
REFERENCES=23,
KEYWORDS="Engset model; Pareto distribution; Goodputs",
ABSTRACT="With the rapid growth of Internet applications built on TCP/IP such as the
World Wide Web and the standardization of traffic management schemes such
as Available Bit Rate (ABR) in Asynchronous Transfer Mode (ATM) networks,
it is essential to evaluate the performance of feedback-based protocols
using traffic models which are specific to dominant applications. This
paper presents a method for analyzing feedback-based protocols with a
Web-user-like input traffic where the source alternates between transfer
periods followed by think periods. Our key results, which are presented
for the TCP protocol, are as follows: (1) When the round-trip time is the
same for all users, the goodputs and the fraction of time that the system
has some given number of transferring sources are insensitive to the
distributions of transfer (file or page) sizes and think times except
through the ratio of their means. Thus, apart from network round-trip
times, only the ratio of average transfer sizes and think times of users
need be known to size the network for achieving a specific quality of
service. (2) The Engset model can be adapted to accurately compute
goodputs for TCP and TCP over ATM, with different buffer management
schemes. Though only these adaptations are given in the paper, the method
based on the Engset model can be applied to analyze other feedback
systems, such as ATM ABR, by finding a protocol specific adaptation.
Hence, the method we develop is useful not only for analyzing TCP using a
source model significantly different from the commonly used persistent
sources, but also can be useful for analyzing other feedback schemes. (3)
Comparisons of simulated TCP traffic to measured Ethernet traffic shows
qualitatively similar second order autocorrelation when think times follow
a Pareto distribution with infinite variance. Also, the simulated and
measured traffic have long range dependence. In this sense our traffic
model, which purports to be Web-user-like, also agrees with measured data
traffic.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-4772S71-2-91\&\_cdi=5624\&\_orig=browse\&\_coverDate=05\%2F20\%2F2003\&\_sk=999739991\&view=c\&wchp=dGLbVlz-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=51b7e34c501cf851e61597815d1c5bc9\&ie=f.pdf"
}
@ARTICLE{Heym0312:Modeling,
AUTHOR="Daniel Heyman and David Lucantoni",
TITLE="Modeling Multiple {IP} Traffic Streams With Rate Limits",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=6,
PAGES="948-958",
MONTH=dec,
YEAR=2003,
REFERENCES=28,
KEYWORDS="hidden Markov model; Markov-modulated Poisson process (MMPP);
matrix-analytic queueing model; superposition; tandem queues",
ABSTRACT="We start with the premise, and provide evidence that it is valid, that a
Markov-modulated Poisson process (MMPP) is a good model for Internet
traffic at the packet/byte level. We present an algorithm to estimate the
parameters and size of a discrete MMPP (D-MMPP) from a data trace. This
algorithm requires only two passes through the data. In tandem-network
queueing models, the input to a downstream queue is the output from an
upstream queue, so the arrival rate is limited by the rate of the upstream
queue. We show how to modify the MMPP describing the arrivals to the
upstream queue to approximate this effect. To extend this idea to networks
that are not tandem, we show how to approximate the superposition of MMPPs
without encountering the state-space explosion that occurs in exact
computations. Numerical examples that demonstrate the accuracy of these
methods are given. We also present a method to convert our estimated
D-MMPP to a continuous-time MMPP, which is used as the arrival process in
a matrix-analytic queueing model.",
URL="http://ieeexplore.ieee.org/iel5/90/28078/01255432.pdf?isNumber=28078\&prod=JNL\&arnumber=1255432\&arSt=+948\&ared=+958\&arAuthor=Heyman\%2C+D.P.\%3B+Lucantoni\%2C+D."
}
@ARTICLE{Hirt0301:Ultra,
AUTHOR="Walter Hirt",
TITLE="Ultra-wideband radio technology: overview and future research",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=1,
PAGES="46-52",
MONTH=jan,
YEAR=2003,
REFERENCES=17,
KEYWORDS="Ultra-wideband radio technology; Wireless systems; Data communication; UWB;
UWB-RT",
ABSTRACT="The emergence of commercial wireless devices based on ultra-wideband radio
technology (UWB-RT) is widely awaited and anticipated. UWB-RT is not only
applicable to communications, imaging and ranging, it also promises to
alleviate the problem of increasingly scarce spectrum resources while
enabling new wireless applications and business opportunities. These
prospects have caught the early attention of the technology-providing
wireless industry and, more recently, that of the radio regulatory
authorities. Moreover, the technical challenges and problems to be solved
when conceiving and deploying UWB radio systems have spurred a growing
interest within the wireless research community. This paper discusses the
key characteristics and capabilities of UWB-RT and indicates where one
expects to exploit them in applications. A brief overview of the current
status of UWB-RT is provided and directions for future research are
discussed. It is proposed to explore and develop this new technology in
the context of wireless systems beyond 3G and within a forum of sufficient
international breadth to facilitate regulatory and standardization
frameworks with global support.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-461XPFR-9-11\&\_cdi=5624\&\_orig=browse\&\_coverDate=01\%2F01\%2F2003\&\_sk=999739998\&view=c\&wchp=dGLbVtb-zSkzk\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=dff5d7b22f7b583d28884ec59f43e1a0\&ie=f.pdf"
}
@INPROCEEDINGS{Ho0303:Information,
AUTHOR="Tracey Ho and Muriel Medard and Ralf Koetter",
TITLE="An information theoretic view of network management",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We present an information theoretic framework for network
management for non-ergodic link failures. Building on recent work
in the field of network coding, we describe the input-output
relations of network nodes as codes and quantify network
management by the logarithm of the number of different codes needed for
different failure scenarios. We give bounds on network management
requirements for various network connection problems in terms of
basic parameters such as the number of source processes and the
number of links in a minimum source-receiver cut. This is the first paper
to our knowledge that
looks at network management for general connections. Methods keywords:
information theory, graph theory."
}
@INPROCEEDINGS{Ho0305:Allocation,
AUTHOR="Pin-Han Ho and Hussein Mouftah",
TITLE="Allocation of Protection Domains in Dynamic {WDM} Mesh Networks",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Abstract - In this paper, we solve the survivable routing problem in
dynamic WDM mesh networks under the framework of Short Leap Shared
Protection (SLSP). A novel algorithm called Cascaded Diverse Routing (CDR)
is proposed. We also demonstrate a novel approach to solving the diverse
routing problem in networks with dynamic traffic for the purpose of shared
protection, called Iterative Two-Step-Approach (ITSA). Simulation is
conducted using four different networks (22-, 30-, 79-, 100-node) for a
comparison between ordinary shared protection schemes and the SLSP scheme.
Simulation results show that the best performance can be achieved with
well-designed diameter of protection domains for every connection request
according to the size and topology of the network."
}
@INPROCEEDINGS{Ho0305:Low,
AUTHOR="Chin Keong Ho and Sumei Sun and Ping He",
TITLE="Low Complexity Frequency Offset Estimation in the Presence of {DC} Offset",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper describes how to perform a low complexity frequency offset
estimation in the presence of direct current (DC) offset based on a
received periodic preamble. By designing a suitable preamble, we perform
frequency and DC offsets estimation concurrently, followed by a simple
compensator which reduces the frequency offset error induced by the
presence of either a residual or actual DC offset. Its performance is
illustrated based on the preamble of wireless LAN system defined in IEEE
802.11a, as well as another preamble design that offers additional
performance gain. Compared to the case when no compensator is used, the
proposed solution gives superior performance over a wide range of dc
offset power in both AWGN and multipath quasi-static channels."
}
@INPROCEEDINGS{Ho0305:Scalable,
AUTHOR="Pin-Han Ho and Hussein Mouftah and Jing Wu",
TITLE="A Scalable Design of Multi-Granularity Optical Cross-connects for the
Optical Next-Generation Internet",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper proposes a scalable design for the next-generation Optical
Cross-connects (OXCs), where a novel strategy for dimensioning the network
switching capability as a long term planning is presented. When traffic
demand grows, the proposed scheme simply expands the switching capacity of
OXCs in waveband- and fiber-switching tiers. To minimize the number of
extra fibers for waveband- and fiber-switching tiers required to satisfy a
given traffic matrix, we formulate the problem of Routing and Wavelength
Assignment with Tunnel allocation (RWAT) into two Integer Linear
Programming (ILP) processes that are performed sequentially. Experiments
are conducted on two sample networks to compare the throughput and the
number of switch points when the networks adopt different switching
architectures with different traffic load. We conclude that the proposed
optimization scheme can dimension the networks with expandability and
scalability to the growing traffic demand."
}
@INPROCEEDINGS{Hoan0305:Buffer,
AUTHOR="Tuan Hoang and Mehul Motani",
TITLE="Buffer and Channel Adaptive Modulation for Transmission over Fading
Channels",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We consider the problem of adaptive modulation for increasing the
throughput of transmission over fading channels. In the model,
packets arrive at a finite-length buffer according to a Poisson
distribution and are mapped into M-ary quadrature amplitude
modulated (MQAM) symbols for transmission over a correlated
Rayleigh fading channel. We assume that buffer and channel state
information are always available at the transmitter. Our objective
is to vary the transmit power and the signal constellation
size of the modulator according to both the buffer and channel
states so that the system throughput is maximized under some
average transmit power and bit error rate (BER) constraints.
We formulate this optimization problem as a Markov decision
process (MDP) and use dynamic programming techniques to obtain the
solution. More importantly, we show that, under certain
conditions, the optimal transmission rate increases when the
channel gain decreases toward the outage threshold - the point
below which communication is not possible. This is in contrast to
the water-filling structure of the link adaptive policy that
achieves capacity on fading channels."
}
@INPROCEEDINGS{Hoce0305:Ldpc,
AUTHOR="Dale Hocevar",
TITLE="{LDPC} Code Construction with Flexible Hardware Implementation",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper presents a modified LDPC code construction technique for
irregular codes of various block sizes and code rates. The performance
benefit of irregular distributions is thus obtained. More importantly,
an efficient and practical decoder architecture is also presented that
achieves flexibility in block size and code rate for these codes and
other similar codes, a capability not present in other approaches.
This decoder can also achieve a high degree of parallelism, thus
exploiting one of the benefits of belief propagation."
}
@INPROCEEDINGS{Holl0303:Unresponsive,
AUTHOR="C. v. Hollot and Yong Liu and Vishal Misra and Don Towsley",
TITLE="Unresponsive Flows and {AQM} Performance",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Routers handle data packets from sources unresponsive to TCP's congestion
avoidance
feedback. We are interested in the impact these sources have on AQM's
control of
long-lived TCP traffic. In this paper, we combine models of TCP/AQM
dynamics with models
of unresponsive traffic to analyze the effects on AQM performance."
}
@ARTICLE{Holt0307:Confidential,
AUTHOR="Silke Holtmanns and Marcin Toczydlowski",
TITLE="Confidential mobile mail retrieval",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=11,
PAGES="1219-1224",
MONTH=jul,
YEAR=2003,
REFERENCES=23,
KEYWORDS="Mobile mail; Security; Privacy; Confidential mail storage",
ABSTRACT="The method of probalistic searching on encrypted data can be utilized for a
confidential mobile mail retrieval system where the e-mails are stored and
processed in an untrusted domain. We discuss the necessary modification to
the theoretical settings in the procedures and algorithms, but also the
actual used technical means. We show that it is possible to deploy an
adapted version of the system in [Proceedings of the 21st Institute of
Electrical and Electronics Engineers Inc. (IEEE) Symposium on Security and
Privacy, Berkeley, CA (2000) 44] in a secure and user-friendly manner in
the constraint mobile environment.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-479VG0H-1-22\&\_cdi=5624\&\_orig=browse\&\_coverDate=07\%2F01\%2F2003\&\_sk=999739988\&view=c\&wchp=dGLbVlz-zSkzS\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=596e2e5905feeb56f5696c1523b558f8\&ie=f.pdf"
}
@ARTICLE{Homa0304:Impact,
AUTHOR="P. Homan and J. Bester and A. Kos and T. Slivnik",
TITLE="The impact of bursty traffic on {FPCF} packet switch performance",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=6,
PAGES="513-521",
MONTH=apr,
YEAR=2003,
REFERENCES=19,
KEYWORDS="Packet switch; Forward planning conflict-free; Virtual output queuing;
Bursty traffic; Performance analysis",
ABSTRACT="This paper analyses and compares the performance of forward planning
conflict-free (FPCF), virtual output queuing-partitioned (VOQ-P) and
virtual output queuing-shared (VOQ-S) packet switches. The influence of
packet burst size, offered switch load and packet switch size are all
investigated. Packet loss probability, average packet delay and 99.9\%
packet delay values are also derived. In comparison tests, FPCF packet
switches perform better than VOQ-P packet switches and yield similar
results to VOQ-S packet switches. The advantage of VOQ-S switches is
manifested in somewhat lower probability of packet loss, while the
advantage of FPCF switches is revealed in the limited values of their
maximum packet delays.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-46SP11K-1-Y\&\_cdi=5624\&\_orig=browse\&\_coverDate=04\%2F15\%2F2003\&\_sk=999739993\&view=c\&wchp=dGLbVtz-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=f370460798e71d226ad23bab09de79b0\&ie=f.pdf"
}
@INPROCEEDINGS{Hona0305:Blind,
AUTHOR="Patrick Honan and Ufuk Tureli",
TITLE="Blind and Efficient Sub-Space Based Carrier Offset Estimator for
Multi-Antenna {OFDM} Communications in Correlated Noise",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Orthogonal Frequency Division Multiplexing~(OFDM) communications
transform frequency selective channels into multiple low rate
subchannels robust against frequency selective fading. Carrier
frequency offset between transmitter and receiver local oscillators
must be estimated and compensated at the receiver to maintain
orthogonality of these subchannels. In this paper, we derive the
nonlinear least squares (NLS) carrier frequency estimator a
computationally
simple yet asymptotically efficient able to achieve Cramer Rao Bound
(CRB)
even for colored noise. This is demonstrated to be the case
for noise correlated both in time and across the multi-antenna receiver
branches.
Fundamental relationships between estimator performance
and diversity against parameters such as the
signal-to-noise ratio~(SNR), number of data samples, and signal
correlation
sensitivity are derived. The simulation studies are presented to verify
the
results."
}
@INPROCEEDINGS{Hose0303:Data,
AUTHOR="Patrick Hosein",
TITLE="Data Throughput Model for {CDMA2000} Supplemental Channels",
BOOKTITLE="IEEE Wireless Communications and Networking Conference",
ORGANIZATION="IEEE",
ADDRESS="New Orleans, Louisiana",
MONTH=mar,
YEAR=2003,
KEYWORDS="CDMA; Model; TCP",
ABSTRACT="With the proliferation of data services over wireless networks, it has
become increasingly important to understand the user perceived
application performance aspects of such networks. In this paper we
provide simple, yet accurate, models for the physical and MAC layers
of a CDMA2000 Supplemental Channel. We illustrate how these models can
be used to determine TCP performance over such channels."
}
@INPROCEEDINGS{Hose0304:Tcp-friendly,
AUTHOR="Patrick Hosein",
TITLE="A TCP-Friendly Congestion Control Algorithm for {1XEV-DV} Forward Link
Packet Data",
BOOKTITLE="IEEE Semiannual Vehicular Technology Conference",
ORGANIZATION="IEEE",
ADDRESS="Jeju, Korea",
MONTH=apr,
YEAR=2003,
KEYWORDS="1XEV-DV; Congestion Control; TCP; CDMA",
ABSTRACT="The 1XEV-DV 3G Standard is expected to that support high-speed data
services. It is also expected to provided Quality of Service (QoS)
guarantees for these high speed data connections. On the radio
interface, voice and data connections are code multiplexed. However,
it is also possible to time share multiple data users on a single
forward link data channel. An important aspect of this option is the
scheduler used to serve users on this shared, slotted forward link
data channel. If QoS guarantees are provided to these users then the
scheduler must ensure that these are met for all users. An admission
control algorithm is needed to ensure that accepted voice and data
users are served at their guaranteed QoS levels.
In this paper we provide such a congestion control
algorithm for data connections that is aware of the upper layer
layer protocols."
}
@INPROCEEDINGS{Hose0305:Finite-state,
AUTHOR="Patrick Hosein",
TITLE="Finite-State Markov Model for the 1xEV-DV Forward Packet Data Channel",
BOOKTITLE="World Wireless Congress",
ADDRESS="San Francisco, California",
MONTH=may,
YEAR=2003,
KEYWORDS="1xEV-DV; F-PDCH; Simulation; 3G",
ABSTRACT="The cdma2000 1xEV-DV standard is presently being developed for 3G
wireless networks. This standard will allow for efficient high-speed
data transmission to be used by bandwidth intensive
applications. Simulations are necessary to understand the
user-perceived performance of such applications when run over these
high speed wireless networks. This typically involves simulation of
the various protocol stacks from the application layer to
physical link layer. In previous papers, the
physical layer has been decoupled from the upper layers by using
two-state Markov models for the radio channel. These two states
correspond to good and bad radio conditions and provided a good
approximation for the systems studied. In the case of 1xEV-DV systems
we need a more detailed model since Access Terminals periodically
report their radio conditions to the Base Station. In this paper we
provide such a model."
}
@INPROCEEDINGS{Hou0305:Prefetching,
AUTHOR="Thomas Hou and Not Use and Chonggang Wang and Bo Li",
TITLE="On Prefetching in Hierarchical Caching Systems",
BOOKTITLE="ICC 2003 - Global Services and Infrastructure for Next Generation Networks",
ADDRESS="Anchorage, Alaska",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Hierarchical caching is deployed to scale up the explosive Web
growth, and the expiration-based mechanism is adopted as an economic
means to support the weak consistency in this context. However,
given a hierarchy, the user perceived performance heavily depends on
its position. Normally, a user near the hierarchy leaf suffers
higher miss rate and longer response time. Such an intrinsic
property can discourage users from participating in any hierarchical
caching systems. In this paper, we analyze the performance of a
proposed approach, i.e., freshness and retrieval threshold
based cache prefetching, to mitigate the bias against leaf users. We
also use ns-2 to further substantiate our analysis. By
adopting this approach with the appropriate parameters, the fairness
among users within a caching hierarchy can be considerably improved."
}
@INPROCEEDINGS{Hou0305:Qos,
AUTHOR="Edwin Hou and Lei Miao and Nirwan Ansari",
TITLE="A QoS Routing Algorithm with Domain Link-State Information Maintenance",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In recent years, various QoS routing algorithms have been proposed to meet
the QoS requirement of todays multimedia applications. These algorithms
can be divided into two categories: source routing and distributed
routing. In this paper, we propose a novel QoS routing algorithm, which is
an integration of source routing and distributed routing. We introduce the
concept of Domain which is a set of neighboring nodes and links. Each node
has its own Domain and has the accurate link-state information within its
Domain. When a QoS request probe arrives at a node, the node will use the
link-state information within its Domain to calculate where the probe
should be forwarded to and the probe forwarding path. By doing so, the
message overhead induced by probe forwarding can be reduced significantly
but the overhead induced by link-state information update may increase
dramatically. However, if the size of the Domain is chosen properly
according to the network topology, our algorithm can reduce the message
overhead while maintaining high request admission ratio."
}
@INPROCEEDINGS{Hris0305:Optimizing,
AUTHOR="Cristina {Hristea Seibert} and Fouad Tobagi",
TITLE="Optimizing Mobility Support in Large Switched LANs",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="With the recent explosion in wireless mobile communication,
a great deal of work is taking place to solve the problem of
handling mobile users in the Internet. This problem encompasses
the design of schemes for tracking and routing to mobile users
in various networks and subnetworks that make up the Internet
infrastructure.
Switched LANs today employ the transparent learning protocol
which allows switches to learn about the location of users by
promiscously listening to the traffic emitted by the users.
Unfortunately, fast moving users render the transparent learning
protocol inefficient so that high bandwidth consumption and even
packet loss may occur. To prevent packets form being mis-routed
or even lost, one can employ a lightweight control-based mechanisms
for user tracking, based on an existing LAN-protocol known as the
Generic Attribute Registration Protocol (GARP). However, this
solution can lead to large databases at the switches, which can
in turn significantly increase the cost of the Internet infrastructure.
In this paper, we propose to combine and tune the transparent learning
protocol and the GARP protocol in an efficient way as to jointly
minimize packet loss, bandwidth consumption and the size of the
tracking databases in a large switched network. Our optimization
is shown to be effective for a wide range of mobility speeds,
different application characteristics and the state of technology."
}
@INPROCEEDINGS{Hsie0303:S,
AUTHOR="Robert Hsieh and Zhe Guang Zhou and Aruna Seneviratne",
TITLE="{S-MIP:} A Seamless Handoff Architecture for Mobile {IP}",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="As the number of Mobile IP (MIP) users grow, so will the demand for
delay sensitive real-time applications, such as audio streaming, that
require seamless handoff, namely, a packet lossless Quality-of-Service
guarantee during a handoff. Two well-known approaches in reducing the MIP
handoff latency have been proposed in the literature. One aims to
reduce the (home) network registration time through a hierarchical
management structure, while the other tries to minimize the lengthy
address resolution delay by address pre-configuration through what is
known as the fast-handoff mechanism. We present a novel seamless
handoff architecture, S-MIP, that builds on top of the hierarchical
approach and the fast-handoff mechanism, in conjunction with a newly
developed handoff algorithm based on pure software-based movement
tracking techniques. Using a combination of simulation and mathematical
analysis, we argue that our architecture is capable of providing packet
lossless handoff with latency similar to that of L2 handoff delay when
using the 802.11 access technology. More importantly, S-MIP has a
signaling overhead equal to that of the well-known integrated
hierarchical MIP with fast-handoff scheme, within the portion of the
network that uses wireless links. In relation to our S-MIP
architecture, we discuss issues regarding the construction of network
architecture, movement tracking, registration, address resolution,
handoff algorithm and data handling."
}
@INPROCEEDINGS{Hsie0305:Application,
AUTHOR="Ping-Yu Hsieh and Ashutosh Dutta and Henning Schulzrinne",
TITLE="Application Layer Mobility Proxy for Real-time Communication",
BOOKTITLE="World Wireless Congress, 3G Wireless",
ORGANIZATION="Delson",
PUBLISHER="Delson",
ADDRESS="San Francisco",
MONTH=may,
YEAR=2003,
KEYWORDS="Mobility, Iptables, Application Layer, Real-time communication",
ABSTRACT="By configuring some of the application layer tools such as Linux IPCHAINS,
IP Masquerading, RTPtrans and IP Aliasing, we build the mobility proxy,
cooperation with SIP registrar, to forward data from the correspondent
hosts to the new location of the mobile hosts as the mobile keeps on
changing its IP address. It not only provides continuous connectivity of
both TCP/IP and RTP/UDP traffic for the mobile hosts, but also offers the
flexibility to build a mobility proxy in a mobile and wireless networking
environment independent of the underlying networking technology. In this
paper we present some of the mechanisms involved and experiments conducted
to build this mobility proxy in a laboratory environment.",
URL="www.cs.columbia.edu/~dutta/research/mobileproxy-dutta-3gwireless.doc"
}
@INPROCEEDINGS{Hsie0305:Banding,
AUTHOR="Taulee Hsieh and Neil Barakat and Edward H. Sargent",
TITLE="Banding in Optical Add-Drop Multiplexers in {WDM} Networks: Preserving
Agility while Minimizing Cost",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we examine the use of limited tunability in reconfigurable
optical add-drop multiplexers (L-ROADM). L-ROADMS can add or drop from
only a subset of adjacent wavelengths on the network and are less costly
than fully-reconfigurable optical add-drop multiplexers (F-ROADMS). We
quantify the trade-off between tuning range and the number of F-ROADMs
that can be replaced by L-ROADMs without sacrificing the set of
connections that can be established. For the limited-add and drop case,
an analytical solution for the band size is found. For the limited-add or
limited-drop case, a nearly linear relationship was found between the size
of the band and the number of L-ROADMs required, and the number of
additional wavelengths required never exceeded 20\%. For example, if half
of the nodes in the ring were equipped with L-ROADMs that operated on 50\%
of the total spectrum, full connectivity could still be achieved by
employing as few as 7\% extra wavelengths."
}
@INPROCEEDINGS{Hsie0305:Power,
AUTHOR="Yi-Lin Hsieh and Chung-Ju Chang and Yih-Shen Chen",
TITLE="A Power Control Scheme with Link Gain Prediction Using {PRNN/ERLS} for
{DS-CDMA} Cellular Mobile Systems",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, a link gain prediction-based power control scheme is
designed for DS-CDMA cellular mobile systems. The link gain prediction can
help to remove the interference of the power control adjustment itself. The
pipeline recurrent neural network (PRNN) with extended recursive least
square (ERLS) is adopted for the prediction. This PRNN/ERLS predictor
possesses infinite memory of past signals so that it can capture precisely
the signal correlation and improve the delay compensation of power control.
Simulation results show that the link gain prediction-based power control
scheme using PRNN/ERLS has lower outage probability than the received SIR
prediction-based power control scheme using grey prediction method [5] and
improves the system capacity by an amount of 40\%; it further outperforms
the one with conventional received SIR prediction-based scheme."
}
@ARTICLE{Hsin0302:Analytical,
AUTHOR="Wen-Jung Hsin and Appie {van de Liefvoort}",
TITLE="Analytical observations for a multiservice node",
JOURNAL="Performance Evaluation",
VOLUME=51,
NUMBER="2-4",
PAGES="103-116",
MONTH=feb,
YEAR=2003,
REFERENCES=27,
KEYWORDS="Exact analysis; Insensitivity; Finite population; Linear algebraic queueing
theory; Matrix-exponential",
ABSTRACT="Motivated by a desire to understand a GI/INF node in a closed queueing
network environment, we study in this paper a finite population
multiserver model, where the number of processes is equal to the
population in the network. We study its steady-state behavior under
various scenarios, e.g., the first three moments of the arrival and
service distributions. We show that when the arrivals are bursty, an
increase in service time variation can actually decrease congestion.
Furthermore, such a decrease is also observed for an increase in the
skewness in the arrivals. Additionally, several insensitivity properties
in limiting behaviors are observed. In particular, the finite population
GI/GI///s-loop is insensitive to the service time distribution when the
arrival distribution either has an infinite variance (a form of heavy
tail), or is highly skewed. In the latter case, the congestion approaches
that of the all Markovian system M/M///s-loop. We conclude that the
influence of the third moment can be very significant, indicating that the
first two moments do not suffice to characterize the performance measures
under consideration.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-46WPNY4-5-5B\&\_cdi=5663\&\_orig=browse\&\_coverDate=02\%2F28\%2F2003\&\_sk=999489997\&view=c\&wchp=dGLbVtz-zSkzS\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=6c73b23826ec4e0a22427872a235d946\&ie=f.pdf"
}
@INPROCEEDINGS{Hu0303:Packet,
AUTHOR="Yih-Chun Hu and Adrian Perrig and David B. Johnson",
TITLE="Packet Leashes: A Defense against Wormhole Attacks in Wireless Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="As mobile ad hoc network applications are deployed, security
emerges as a central requirement. In this paper, we introduce
the wormhole attack, a severe attack in ad hoc networks that is
particularly challenging to defend against. The wormhole
attack is possible even if the attacker has not compromised any
hosts, and even if all communication provides authenticity and
confidentiality. In the wormhole attack, an attacker records
packets (or bits) at one location in the network, tunnels them
(possibly selectively) to another location, and retransmits
them there into the network. The wormhole attack can form a
serious threat in wireless networks, especially against many ad
hoc network routing protocols and location-based wireless
security systems. For example, most existing ad hoc network
routing protocols, without some mechanism to defend against the
wormhole attack, would be unable to find routes longer than one
or two hops, severely disrupting communication. We present a
new, general mechanism, called packet leashes, for detecting
and thus defending against wormhole attacks, and we present a
specific protocol, called TIK, that implements leashes."
}
@INPROCEEDINGS{Hu0305:Connectivity,
AUTHOR="Rose Qingyang Hu and Jeff Babbitt and Hosame Abu-Amara and Catherine
Rosenberg and Georgios Lazarou",
TITLE="Connectivity Planning and Call Admission Control in an On-board
Cross-connect Based Multimedia {GEO} Satellite Network",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper addresses end-to-end connectivity planning and call admission
control for a high capacity multi-beam satellite network with on-board
cross-connectivity. On-board satellite switching is a technology designed
to offer multi-media services, especially in demographically dispersed
areas. Nevertheless, full on-board switching techniques are far from
maturity. Their implementations have been proven expensive and difficult.
There are also high risks involved in launching satellites for the
stationary orbit surrounding the earth. As a substitute, a satellite
network with on-board cross-connect is devised in this paper. Connectivity
planning and call admission control mechanisms associated with such a
network are also presented. Simulation studies are conducted to show the
effectiveness of the proposed mechanisms."
}
@INPROCEEDINGS{Hu0305:Mitigating,
AUTHOR="Chunyu Hu",
TITLE="On Mitigating the Broadcast Storm Problem with Directional Antennas",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Broadcast has been widely used in mobile ad hoc networks (MANETs) as a
communication means to disseminate information to all reachable nodes.
However, the conventional broadcast scheme that broadcast packets
omnidirectionally suffers from several drawbacks: excessive amount of
redundant traffic, exaggerated interference/contention among neighboring
nodes, and limited coverage (as a result of contention/collision). This
is termed as the broadcast storm problem. In this paper, we address this
problem in MANET with the use of directional antennas. We propose three
schemes: on/off directional broadcast, relay-node-based directional
broadcast and location-based directional broadcast, in the increasing
order of implementation complexity. We implement the proposed schemes in
QualNet and compare their performance against the conventional broadcast
scheme. The simulation results indicate that the proposed schemes
outperform the conventional omnidirectional scheme with respect to
coverage, latency, and redundancy in a wide spectrum of network topology
and node mobility."
}
@INPROCEEDINGS{Hu0305:Oghamgon,
AUTHOR="Chia-Cheng Hu",
TITLE="OGHAMGOn-demand Global Hosts for Ad-hoc Multicast using Minimum Distance
Facility Location",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Multicast plays an important role in ad-hoc networks when hosts work in
groups to carry out a common task. It must meet the following challenges:
robustness versus efficiency, self-configuring, flooding of control
messages. Recent routing protocols and multicast protocols in ad-hoc
networks adopt a two-tier architecture to integrate the effectiveness of
the flooding scheme and the efficiency of the tree-based scheme. They
select some hosts with maximum neighbor degree as RP(rendezvous point) to
forward data. However, these hosts will have higher possibility to be the
traffic concentration and bottleneck of the network, and each RP will
spend more time forwarding data due to maximum neighbor degree. In this
paper, our goals are not only to integrate the flooding effectiveness and
tree-based path efficiency, but also to increases robustness in dynamic
environment. We propose a multicast protocol for Ad-hoc network, called
OGHAM, with shorter relay and less concentration due to selecting RPs from
the hosts with minimum hop distance between them rather than the hosts with
maximum neighbor degree. Our objective to minimize the distance between
RPs contrasts with the facility location problemBK-MEDIAN problem and
K-CENTER problem. Our approach is based on linear program rounding to
solve this problem, and a novel rounding method is used to obtain the
solution. The multicasting topology is constructed on-demand and global
for other multicasting group applications."
}
@INPROCEEDINGS{Hu0305:Space,
AUTHOR="Chia-Chang Hu",
TITLE="Space-Time Joint Truncated Multistage Wiener Filtering for Asynchronous
{DS-CDMA} in Multipath",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="A novel self-synchronizing receiver
with a J-element antenna array is developed
for asynchronous DS-CDMA multipath fading channels in this paper.
The primary requirement is knowledge
of the desired user's signature sequence.
There no training period of signal-free observations is required.
Also no information is presumed about the interfering users.
Multipath diversity is exploited via two combining schemes,
namely the maximal ratio combining (MRC) and the equal gain combining
(EGC).
A computationally efficient version of
the proposed receiver is developed
that utilizes the concept of
the truncated multistage Wiener filter (TMWF)
introduced by Goldstein and Reed.
This technique obviates the necessity
of either a covariance matrix
inversion or an eigen-decomposition.
Moreover, this multistage scheme achieves a
rapid adaptive convergence under limited
observation-data support.
Simulation results indicate that the proposed detector provides
superior performance as an increasing function of
the size of the J-element antenna array and
is nearly independent on the number of signals."
}
@INPROCEEDINGS{Huan0305:Ber,
AUTHOR="Kaizhi Huang",
TITLE="{BER} Performance of {2-D-RAKE} Receivers with Power Control Error in
Nakagami Fading Channels",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="It is well known that power control is critical in CDMA mobile systems and
the power control error (PCE) exists in spite of power control methods
being used. In this paper, the closed-form expressions of
signal-to-interference-plus-noise ratio (SINR) and the average bit error
rate (BER) are derived for a two-dimensional (2-D)-RAKE receiver with
imperfect power control in a frequency-selective Nakagami fading channel.
The combined impact of PCE, multi-path Nakagami fading, spatial and
temporal diversity order, and multiple-access interference on the system
performance has been analyzed for all kinds of fading environments. The
simulation results indicate that the BER performance degrade due to PCE.
But increasing spatial and temporal diversity order can possibly
compensate for the performance loss when PCE is not very serious. And the
exact performance improvement due to space-time processing varies with the
PCE and the fading environment."
}
@INPROCEEDINGS{Huan0305:Detection,
AUTHOR="Yufei Huang and Jianqiu Zhang and Petar Djuric",
TITLE="Detection with particle filtering in {BLAST} systems",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This work demonstrates the use of particle filtering for detection in
BLAST systems. A novel dynamic state-space model (DSSM) is constructed for
BLAST systems that is crucial for development of particle filtering
algorithms. The proposed DSSM is based on QR decomposition and the output
of the feedforward filter, and it evolves in space. The particle filtering
solution does not suffer from error propagation, and our simulations show
that it greatly outperforms the V-BLAST and provides near optimum
performance."
}
@INPROCEEDINGS{Huan0305:Distributed,
AUTHOR="An-Cheng Huang and Peter Steenkiste",
TITLE="Distributed Load-Sensitive Routing for Computationally-Constrained Flows",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="A network that can, besides connectivity, also provide computational
resources to application flows will enable a new array of network
services. For example, applications that require content adaptation can
be deployed more easily in a network that provides integrated
communication and computational resources. In this paper, we study the
problem of finding a path for a flow that has both computational and
bandwidth constraints. We present a distributed load-sensitive routing
algorithm that generates precomputed routing information and optimizes the
routing decisions for both applications and service providers (those who
provide the communication and computational resources). We show through
simulations that our distributed approach performs comparably to a
centralized algorithm and is more resilient to longer routing update
intervals."
}
@INPROCEEDINGS{Huan0305:Double,
AUTHOR="Dijiang Huang and Amit Sinha and Deep Medhi",
TITLE="A Double Authentication Scheme To Detect Impersonation Attack In Link State
Routing Protocols",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we present an authentication scheme to prevent impersonation
attack in link state routing protocol. The existing authentication schemes
are either simple to compute but vulnerable to attacks or too robust
against attacks but has exponential computation cost. We introduce a
Double Authentication (DA) scheme which provides authentication to the
routing information data carried by the link state routing packets. In
this scheme every router needs to sign the routing data twice with two
different keys using a one-way hash function. Based on our performance
assessment, we found that this scheme is simpler to implement,
computationally efficient and provides the degree of robustness desired
with less communication overhead but has higher memory requirement."
}
@INPROCEEDINGS{Huan0305:Hifi,
AUTHOR="Leijun Huang and Yih Huang",
TITLE="{HIFI:} A High-Bandwidth Flow Identification Algorithm and Its Applications",
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 present a High-bandwidth Flow Identification
algorithm, called HIFI, that is designed for use by routers to
identify high-bandwidth flows. Rather than maintaining the bandwidth
usages of all flows, HIFI is able to identify K highest-bandwidth
flows, where K>=1 is a constant, using O(K) space and incurring
only O(1) per sample processing overheads. We show that HIFI can be
used in conjunction with well-established flow testing criteria to
curb improperly behaving flows in the Internet. Applications of HIFI
includes identifying high-bandwidth multimedia streams that do not
respond to congestion and mitigating the effects of flooding
denial-of-service attacks. Our simulation shows that HIFI performs
the above tasks with high accuracy and low overheads."
}
@INPROCEEDINGS{Huan0305:Resource,
AUTHOR="Vincent Huang and Weihua Zhuang",
TITLE="Resource Allocation in Multi-Cell {CDMA} Communication Systems",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In a multimedia code division multiple access (CDMA) system, the
network performance depends on the success and efficiency in
allocating system resources. The system resources in terms of
bandwidth and power should be efficiently distributed to each user
to guarantee its quality of service (QoS) requirements. In this
paper, we combine the fair packet loss sharing (FPLS) scheduling
with a received power limited (RPL) power assignment for resource
allocation in a multi-cell environment. The basic idea of FPLS is to
schedule the transmission of multimedia packets in such a way that
all the users have a fair share of packet loss according to their
QoS requirements, which maximizes the number of the served users
under the QoS constraints. The RPL minimizes the received power for
each packet. With known path loss, it in turn minimizes the
transmitted power as well. The intercell interference caused by the
scheduled packets is also limited in the scheduling to increase the
system capacity."
}
@ARTICLE{Huan0305:Tree,
AUTHOR="Yih Huang and Philip McKinley",
TITLE="Tree-based link-state routing in the presence of routing information
corruption",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=7,
PAGES="691-699",
MONTH=may,
YEAR=2003,
REFERENCES=19,
KEYWORDS="Link-state routing; Protocol; Tree-based LSR",
ABSTRACT="Traditionally, link-state routing (LSR) uses two costly techniques to
achieve its robustness and responsiveness: message forwarding on every
communication link in the broadcast of network status updates, and the
periodic broadcast of local status by every router. In this paper, we
present a novel LSR protocol, called Tree-based LSR (T-LSR), which reduces
the operational overhead of LSR as follows. A leader router is elected to
periodically broadcast network status on behalf of all the other routers
in the network, and a spanning tree is constructed to support these
broadcasts. The spanning tree is used for most flooding operations,
although the protocol reverts to conventional flooding during leader
election and spanning tree construction. The T-LSR protocol distinguishes
itself from previous tree-based, lightweight LSR methods by its
fault-tolerance features: in addition to surviving network partitioning,
the T-LSR protocol is shown to maintain consistent routing information and
leader preferences throughout the network in the presence of undetected
transmission/information corruption problems. The results of a simulation
study demonstrate that the T-LSR protocol imposes a small fraction of the
overhead of conventional LSR.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-473VSDP-5-1N\&\_cdi=5624\&\_orig=browse\&\_coverDate=05\%2F01\%2F2003\&\_sk=999739992\&view=c\&wchp=dGLbVtz-zSkWW\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=317c358d942fcc8c2f1acf2118609af6\&ie=f.pdf"
}
@INPROCEEDINGS{Hube0305:Application,
AUTHOR="Kris Huber",
TITLE="Application of Particle Filters to {MIMO} Wireless Communications",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The implementation of current Space-Time codes is often performed under the
assumption that the additive channel noise is white and Gaussian, and that
the receiver has precise knowledge of the realization of the fading
process. Here we study the application of particle filters to MIMO systems
in order to reduce the uncertainty in the estimation of the channel fading
coefficients. Using known orthogonal training sequences for channel
estimation, an analysis on the estimated fading gains reveals that they
are stochastic in nature with mean equal to the true channel gain, and
variance proportional to the inverse of the transmit power. Further more,
this estimation uncertainty is shown to
incur a penalty in the signal-to-noise ratio, thus reducing overall system
efficiency. In order to mitigate the effects of estimation error suffered
by current MIMO systems, we use particle filters for channel tracking.
Modelling the wireless fading channel as an AR process, the particle
filter is shown to be superior to conventional estimation techniques by
providing a significant decrease in the mean-squared error (MSE) of the
channel estimate. Simulations illustrate the robust nature of this new
scheme."
}
@INPROCEEDINGS{Huds0304:Modeling,
AUTHOR="Scott Hudson and James Fogarty and Christopher Atkeson and Daniel Avrahami
and Jodi Forlizzi and Sara Kiesler and Johnny Lee and Jie Yang",
TITLE="Modeling user behavior: Predicting human interruptibility with sensors: a
Wizard of Oz feasibility study",
BOOKTITLE="SIGCHI conference on Human factors in computing systems",
ORGANIZATION="ACM",
PUBLISHER="ACM",
ADDRESS="Ft. Lauderdale, Florida, USA",
PAGES="257 - 264",
MONTH=apr,
YEAR=2003,
ABSTRACT="A person seeking someone else's attention is normally able to quickly
assess how interruptible they are. This assessment allows for behavior we
perceive as natural, socially appropriate, or simply polite. On the other
hand, today's computer systems are almost entirely oblivious to the human
world they operate in, and typically have no way to take into account the
interruptibility of the user. This paper presents a Wizard of Oz study
exploring whether, and how, robust sensor-based predictions of
interruptibility might be constructed, which sensors might be most useful
to such predictions, and how simple such sensors might be.The study
simulates a range of possible sensors through human coding of audio and
video recordings. Experience sampling is used to simultaneously collect
randomly distributed self-reports of interruptibility. Based on these
simulated sensors, we construct statistical models predicting human
interruptibility and compare their predictions with the collected
self-report data. The results of these models, although covering a
demographically limited sample, are very promising, with the overall
accuracy of several models reaching about 78\%. Additionally, a model
tuned to avoiding unwanted interruptions does so for 90\% of its
predictions, while retaining 75\% overall accuracy.",
URL="http://doi.acm.org/10.1145/642611.642657"
}
@INPROCEEDINGS{Hunt0305:Performance,
AUTHOR="Todd Hunter and Aria Nosratinia",
TITLE="Performance Analysis of Coded Cooperation Diversity",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In a multi-user environment, coded cooperation creates transmit
diversity for small mobiles (e.g. handsets) that cannot support more
than one antenna. Coded cooperation allows these mobiles to share their
antennas via a simple and effective coding method. In this work we
present an analytical methodology for evaluating the performance of
coded cooperation. We develop tight bounds for bit and
block error probabilities, showing in the process that coded cooperation
achieves maximal diversity. We demonstrate the validity of these bounds
via simulations."
}
@ARTICLE{Hunt0307:Reactive,
AUTHOR="Ray Hunt and Theuns Verwoerd",
TITLE="Reactive firewallsa new technique",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=12,
PAGES="1302-1317",
MONTH=jul,
YEAR=2003,
REFERENCES=14,
KEYWORDS="Network security; Packet filter; Application proxy; Stateful packet filter;
Firewall architecture; Conditional firewall rules; Token bucket; Iptables",
ABSTRACT="Firewalls are a well-established and integral part of network security.
However, in most situations firewalls are configured according to a set of
static rules based upon a policy. To date, development in firewall
architectures which can react to attacks such as those demonstrated by the
Nimda virus are very limited. Yet it is essential that firewalls are able
to cope with and react to such attacks. The idea of a firewall changing or
adapting its rules in the face of adverse situations is proposed and
demonstrated by way of a prototype in this paper. This new concept of rule
adaptation permits security management beyond conventional stateful
connection tracking, and incorporates the overall system state as well as
the effects of multiple connections.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-487V365-1-13\&\_cdi=5624\&\_orig=browse\&\_coverDate=07\%2F21\%2F2003\&\_sk=999739987\&view=c\&wchp=dGLbVtz-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=034b0c0bccdc78b495357adf56847310\&ie=f.pdf"
}
@INPROCEEDINGS{Hunz0305:Optimal,
AUTHOR="Thomas Hunziker and Dirk Dahlhaus",
TITLE="Optimal Power Adaptation for {OFDM} Systems with Ideal Bit-Interleaving and
Hard-Decision Decoding",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We derive power adaptation strategies optimizing the error rates of
broadband bit-interleaved coded OFDM systems performing hard-decisions
after the demodulation and ideal interleaving. The adaptive subchannel
power allocation is based on either perfect or outdated channel state
information in a time-division duplex transmission. We find that for an
average bit error rate level of 1e-6 a gain of up to 4 dB can be achieved
by the proposed adaptation in Rayleigh fading channels."
}
@ARTICLE{Hust0303:Measuring,
AUTHOR="Geoff Huston",
TITLE="Measuring {IP} Network Performance",
JOURNAL="Internet Protocol Journal",
VOLUME=6,
NUMBER=1,
MONTH=mar,
YEAR=2003,
REFERENCES=14,
ABSTRACT={If you are involved in the operation of an IP network, a question you may
hear is: {"}How good is your network?{"} Or, to put it another way, how
can you measure and monitor the quality of the service that you are
offering to your customers? And how can your customers monitor the quality
of the service you provide to them?
These questions have been lurking behind many public and enterprise IP
networks for many years now. With the increasing levels of deployment of
various forms of high-speed (or broadband) services within today's
Internet there is new impetus to find some usable answers that allow both
providers and users to place some objective benchmarks against the service
offerings. With the lift in access speed with broadband services, there is
an associated expectation on the part of the end user or service customer
about the performance of the Internet service. It should be {"}better{"}
in some fashion, where {"}better{"} relates to the performance of the
network and the service profile that is offered to network applications.
And not only is there an expectation of {"}better{"} performance, it
should be measurable. This article looks at network performance and
explores its definition and measurement.},
URL="http://www.cisco.com/warp/public/759/ipj\_6-1/ipj\_6-1\_measuring\_ip\_networks.html"
}
@ARTICLE{Hust0312:Ipv4how,
AUTHOR="Geoff Huston",
TITLE="IPv4How long do we have?",
JOURNAL="Internet Protocol Journal",
VOLUME=6,
NUMBER=4,
MONTH=dec,
YEAR=2003,
REFERENCES=5,
ABSTRACT={One of those stories that keeps on appearing from time to time is the claim
that somewhere in the world, or even all over the world, we are {"}running
out of IP addresses,{"} referring to the consumption of unallocated IPv4
addresses [1]. In one sense this is a pretty safe claim, in that the IPv4
address pool is indeed finite, and, as the IPv4 Internet grows it makes
continual demands on previously unallocated address space. So the claim
that the space will be exhausted at some time in the future is a
relatively safe prediction. But the critical question is not {"}if{"} but
{"}when,{"} because this is a question upon which many of our current
technology choices are based.},
URL="http://www.cisco.com/warp/public/759/ipj\_6-4/ipj\_6-4\_ipv4.html"
}
@INPROCEEDINGS{Hwan0305:Fairness,
AUTHOR="Ren-Hung Hwang and Ching-Fang Chi",
TITLE="Fairness in QoS Guaranteed Networks",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The Internet Protocol, based on packet switching technique, provides an
efficient sharing of network bandwidth, which is especially effective for
bursty data sources. However, fairness is always an important issue when
resources are shared among users. For networks with quality of service
guarantee, the fairness criteria will be different from that of best
effort networks. In particular, due to bandwidth reservation and call
admission control, connections blocking probability becomes a more
important fairness measure in networks that provide bandwidth guarantee.
In this paper, we first propose a fairness measure based on the blocking
probability. We then propose three admission control schemes that try to
improve fairness while maintaining high network throughput and revenue.
The proposed schemes are evaluated via simulations as well as analytical
models. Our numerical results show that the proposed schemes yield good
fairness with only slightly degradation in network throughput and revenue."
}
@INPROCEEDINGS{Hwan0305:Random,
AUTHOR="Chan Soo Hwang and Jaehak Chung and Yungsoo Kim and Seunghoon Nam",
TITLE="A random beamforming technique in {MIMO} systems exploiting multiuser
diversity",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We develop a random beamforming technique for MIMO system that
simultaneously obtains the multiuser diversity gain, spatial
multiplexing gain, and array gain by feeding back only the
effective SNR. In slow fading channel, we prove that the
throughput of the proposed method converges to that of eigen
beamforming when many users are in a cell. We observe that the
number of users required to achieve the capacity bound increases
with the number of antennas and SNR. However, the capacity bound
is achieved even with small number of users when the SNR is low
and the number of transmit and receive antenna is small."
}
@TECHREPORT{Iamn0302:Data,
AUTHOR="Adriana Iamnitchi and Matei Ripeanu and Ian Foster",
TITLE="Data-sharing relationships in the Web",
TYPE="Technical Report",
INSTITUTION="arXiv",
MONTH=feb,
YEAR=2003,
KEYWORDS="Networking and Internet Architecture",
ABSTRACT="We propose a novel structure, the data-sharing graph, for characterizing
sharing patterns in large-scale data distribution systems. We analyze this
structure in two such systems and uncover small-world patterns for
data-sharing
relationships. Using the data-sharing graph for system characterization
has
potential both for basic science, because we can identify new structures
emerging in real, dynamic networks; and for system design, because we can
exploit these structures when designing data location and delivery
mechanisms.
We conjecture that similar patterns arise in other large-scale systems and
that
these patterns can be exploited for mechanism design.",
URL="http://arXiv.org/abs/cs/0302016"
}
@TECHREPORT{Iamn0307:Small,
AUTHOR="Adriana Iamnitchi and Matei Ripeanu and Ian Foster",
TITLE="Small-World File-Sharing Communities",
TYPE="arXiv report",
NUMBER="cs.DC/0307036",
MONTH=jul,
YEAR=2003,
KEYWORDS="Distributed, Parallel, and Cluster Computing; Networking and Internet
Architecture",
ABSTRACT="Web caches, content distribution networks, peer-to-peer file sharing
networks, distributed file systems, and data grids all have in common that
they
involve a community of users who generate requests for shared data. In
each
case, overall system performance can be improved significantly if we can
first
identify and then exploit interesting structure within a community's
access
patterns. To this end, we propose a novel perspective on file sharing
based on
the study of the relationships that form among users based on the files in
which they are interested.
We propose a new structure that captures common user interests in
data--the
data-sharing graph-- and justify its utility with studies on three
data-distribution systems: a high-energy physics collaboration, the Web,
and
the Kazaa peer-to-peer network. We find small-world patterns in the
data-sharing graphs of all three communities. We analyze these graphs and
propose some probable causes for these emergent small-world patterns. The
significance of small-world patterns is twofold: it provides a rigorous
support
to intuition and, perhaps most importantly, it suggests ways to design
mechanisms that exploit these naturally emerging patterns.",
URL="http://arXiv.org/abs/cs/0307036"
}
@INPROCEEDINGS{Iera0305:Multimedia,
AUTHOR="Antonio Iera and Antonella Molinaro and Giuseppe Araniti and Ravi Agarwal",
TITLE="Multimedia Traffic QoS Adaptation in {UMTS} Systems Through a Middleware
Functionality",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper the authors attention is on the specification of a middleware
functionality for dynamic QOS control in multimedia cellular environments,
such as UMTS. The functionality implements a soft QOS paradigm, at the
same time optimising the perceptual QOS provided to the end user according
to her/his needs. It will be shown that by exploiting suitable performance
indexes and resource redistribution algorithms both an acceptable grade of
service and a good degree of user satisfaction can be achieved, without an
excessive increase in the network signalling load."
}
@INPROCEEDINGS{Iera0305:Multimedia,
AUTHOR="Antonio Iera and Antonella Molinaro and Pasquale Pace and Salvatore Marano",
TITLE="Multimedia Traffic in Broadband Satellite Networks",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="To design effective traffic and resource management techniques
is a critical issue for the deployment of multimedia satellite
systems. This paper aims at contributing to the dimensioning of
the signalling bandwidth of a broadband geo-satellite system
for multimedia communications. Signalling channels are used by
the satellite terminals for set-up requests and on-demand
resource assignment. The adequate dimensioning of the satellite
bandwidth helps in achieving the target service quality required
by different multimedia traffic classes, and in exploiting
effectively the satellite bandwidth. This is accomplished by
designing a statistical centralised CAC and an intelligent
scheduling of the resource requests on board the satellite."
}
@ARTICLE{Ilia0310:Towards,
AUTHOR="John Iliadis and Stefanos Gritzalis and Diomidis Spinellis and Danny Cock
and Bart Preneel and Dimitris Gritzalis",
TITLE="Towards a framework for evaluating certificate status information
mechanisms",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=16,
PAGES="1839-1850",
MONTH=oct,
YEAR=2003,
REFERENCES=23,
KEYWORDS="Certificate; Certificate revocation; Certificate status; Certificate
revocation list; Certificate revocation status; Certificate revocation
tree; Evaluation framework",
ABSTRACT="A wide spectrum of certificate revocation mechanisms is currently in use. A
number of them have been proposed by standardisation bodies, while some
others have originated from academic or private institutions. What is
still missing is a systematic and robust framework for the sound
evaluation of these mechanisms. We present a mechanism-neutral framework
for the evaluation of certificate status information (CSI) mechanisms.
These mechanisms collect, process and distribute CSI. A detailed
demonstration of its exploitation is also provided. The demonstration is
mainly based on the evaluation of Certificate Revocation Lists, as well as
of the Online Certificate Status Protocol. Other well-known CSI mechanisms
are also mentioned for completeness.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-483442H-4-Y\&\_cdi=5624\&\_orig=browse\&\_coverDate=10\%2F15\%2F2003\&\_sk=999739983\&view=c\&wchp=dGLbVtz-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=abb255be76eb844a4d0d398ed2a371e5\&ie=f.pdf"
}
@INPROCEEDINGS{Inou0305:Mirai,
AUTHOR="Masugi Inoue",
TITLE="{MIRAI:} A Solution to Seamless Access in Heterogeneous Wireless Networks",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The concept of MIRAI (Multimedia Integrated network by Radio Access
Innovation) is introduced. The most significant feature of MIRAI is the
provision of a set of signaling functions: radio-access-network discovery
and selection, heterogeneous paging, and vertical handoff. A medium access
control (MAC) protocol for basic access networks, which are dedicated
wireless systems providing the signaling, is then introduced. A
proof-of-concept demonstration system is also briefly introduced. The
delay performances of the signaling procedures are presented."
}
@ARTICLE{Inta0302:Directed,
AUTHOR="Chalermek Intanagonwiwat and Ramesh Govindan and Deborah Estrin and John
Heidemann and Fabio Silva",
TITLE="Directed Diffusion for Wireless Sensor Networking",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=1,
PAGES="2-16",
MONTH=feb,
YEAR=2003,
REFERENCES=35,
KEYWORDS="data aggregation; data-centric routing; distributed sensing; in-network
processing; wireless sensor networks",
ABSTRACT="Advances in processor, memory, and radio technology enable small and cheap
nodes capable of sensing, communication, and computation. Networks of such
nodes can coordinate to perform distributed sensing of environmental
phenomena. We explore the directed diffusion paradigm for such
coordination. Directed diffusion is data-centric in that all communication
is for named data. All nodes in a directed-diffusion-based network are
application aware. This enables diffusion to achieve energy savings by
selecting empirically good paths and by caching and processing data
in-network (e.g., data aggregation). We explore and evaluate the use of
directed diffusion for a simple remote-surveillance sensor network
analytically and experimentally. Our evaluation indicates that directed
diffusion can achieve significant energy savings and can outperform
idealized traditional schemes (e.g., omniscient multicast) under the
investigated scenarios.",
URL="http://ieeexplore.ieee.org/iel5/90/26510/01180542.pdf?isNumber=26510\&prod=JNL\&arnumber=1180542\&arSt=+2\&ared=+16\&arAuthor=Intanagonwiwat\%2C+C.\%3B+Govindan\%2C+R.\%3B+Estrin\%2C+D.\%3B+Heidemann\%2C+J.\%3B+Silva\%2C+F."
}
@INPROCEEDINGS{Ioan0303:Adaptive,
AUTHOR="Ioannis Ioannidis and Ananth Grama and Mikhail Atallah",
TITLE="Adaptive Data Structures for {IP} Lookups",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="The problem of efficient data structures for IP lookups has been well
studied in literature. Techniques such as LC tries and Extensible Hashing
are commonly used. In this paper, we address the problem of generalizing
LC tries and Extensible Hashing, based on traces of past lookups, to
provide performance guarantees for memory sub-optimal structures. As a
specific example, if a memory-optimal (LC) trie takes 6MB and the total
memory
at the router is 8MB, how should the trie be modified to make best use of
the
2 MB of excess memory? We present a greedy algorithm for
this problem and prove that, if for the optimal data structure there are
$b$ fewer memory accesses on average for each lookup compared with the
original trie, the solution produced by the greedy algorithm will have
$\frac{9 \times b}{22}$ fewer memory accesses on average (compared to the
original trie). An efficient implementation of this algorithm presents
significant additional challenges. We describe an implementation with a
time complexity of $O(\xi(d)n \times\log n)$ and a space complexity of
$O(n)$, where $n$ is the number of nodes of the trie and $d$ its depth.
The depth of a trie is fixed for a given version of the Internet protocol
and is typically $O(\log n)$. In this case, $\xi(d)=O(\log^2n)$. We
demonstrate experimentally the performance and scalability of the
algorithm
on actual routing data. We also show that our algorithm significantly
outperforms Extensible Hashing for the same amount of memory."
}
@ARTICLE{Irni0309:Fluid,
AUTHOR="Tim Irnich and Peter Stuckmann",
TITLE="Fluid-flow modelling of internet traffic in {GSM/GPRS} networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=15,
PAGES="1756-1763",
MONTH=sep,
YEAR=2003,
REFERENCES=14,
KEYWORDS="General packet radio service; Performance analysis; Fluid-flow model;
ON/OFF source model; Radio network dimensioning",
ABSTRACT="In order to find an analytical solution for performance evaluation of
Internet access over the General Packet Radio Service (GPRS), the
packet-switched extension of the GSM mobile radio network, we evaluate the
well-known Fluid-flow modelling (FFM) approach. Mobile Internet users are
modeled by an ON/OFF source with exponentially distributed sojourn times
in the ON and OFF state.
We choose the IP datagram delay at the radio interface as quantity of
interest. As Fluid-flow analysis only delivers the mean equilibrium buffer
content, we present some additional methodology to calculate the sojourn
time in the Fluid-flow model, taking specific characteristics of the GPRS
into account. ON/OFF source parameters are determined representing the
mean offered traffic in typical GPRS load scenarios by stochastic
simulation, using the GPRS emulation system GPRSim. The GPRSim comprises
load generators representing typical GPRS usage and a prototypical
implementation of the GPRS protocols.
Comparison of simulation results and analysis is performed using the same
traffic source model for both simulation and analysis, eliminating
approximation of WWW traffic characteristics as a reason for deviations
between simulation results and analysis. Additionally analytical results
are compared with results of the GPRSim using a detailed WWW model for
traffic generation. The results illustrate the influence of accurate
source modelling and the limitations of the FFM to model the GPRS system
with elastic traffic. It is shown that the FFM is not able to depict the
elastic property of TCP-based Internet traffic, but is capable of
modelling the multiplexing of inelastic traffic like generated by
streaming or real-time applications over the GPRS radio link in sufficient
detail for performance estimations.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47YXW9F-4-2W\&\_cdi=5624\&\_orig=browse\&\_coverDate=09\%2F22\%2F2003\&\_sk=999739984\&view=c\&wchp=dGLbVlz-zSkzk\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=9067541ac2df09c0a73b2ec0f2a0b822\&ie=f.pdf"
}
@INPROCEEDINGS{Ishi0305:Capacity,
AUTHOR="Keisuke Ishibashi and Mika Ishizuka and Masaki Aida and Hiroshi Ishii",
TITLE="Capacity Dimensioning of {VPN} Access Links for Elastic Traffic",
BOOKTITLE="International Conference on Communications",
ADDRESS="Anchorage, Alaska",
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper we are studying the capacity dimensioning
of Virtual Private Network (VPN) access-links for elastic
traffic, such as the Web or ftp. Under the assumption that the
core-VPN network is provisioned with sufficiently large capacity,
the capacity management of the VPN access link is a matter of
bandwidth-sharing for elastic traffic of the two bottleneck links,
the ingress and egress access links. In the case of a single bottleneck
with a limited capacity of access links, the processor-sharing
model gives a simple formulae of mean transfer time, but in our
case, the value may be less than the actual transfer time. In contrast,
max-min fair sharing provides an accurate sharing model
which is similar to the TCP, but it is difficult to obtain a closed
form of performance statistics. We propose a closed form approximation
for a max-min fair sharing model, in a specific but realistic
topology, by investigating the difference between the max-min
and the processor sharing model. Using the approximation, we
are performing the capacity dimensioning of VPN access links."
}
@INPROCEEDINGS{Ishi0305:Group,
AUTHOR="Yutaka Ishibashi and Kiyoshi Tomaru and Shuji Tasaka and Katsunori Inazumi",
TITLE="Group Synchronization in Networked Virtual Environments",
BOOKTITLE="ICC 2003 - Global Services and Infrastructure for Next Generation Networks",
ADDRESS="Anchorage, Alaska",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper proposes two group synchronization schemes, which adjust the
output
timing among destinations, in networked virtual environments where voice
and video streams are output in a 3-D virtual space.
We introduce the concept of the global importance of each media object,
which includes a voice stream and a video one.
The global importance is determined by the positional relations
among media objects, and it represents how strongly
each object attracts observers' attention in the virtual space.
We enhance a centralized group synchronization control scheme
called the synchronization maestro scheme and a distributed control
scheme,
which were previously proposed by the authors,
in order to adjust the output timing of media streams
among destinations according to the global importance.
In addition, we illustrate the effectiveness of the proposed schemes
by experiment."
}
@INPROCEEDINGS{Issa0305:Optimal,
AUTHOR="Teerawat Issariyakul and Ekram Hossain",
TITLE="Optimal Channel Allocation for Fair Queuing in Wireless Data Networks",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, the problem of fair scheduling in a wireless network is
formulated as an assignment problem and an {\em Optimal Channel Allocation
(OCA)} strategy is proposed for fair bandwidth allocation in a centralized
manner. Simulation results show that the performance improvement due to
OCA
can be significant compared to other wireless fair-queuing mechanisms
proposed in the literature such as WPS (Wireless Packet Scheduling)."
}
@INPROCEEDINGS{Iyen0305:Scalable,
AUTHOR="Rajagopal Iyengar and Biplab Sikdar",
TITLE="Scalable and Distributed {GPS} Free Positioning for Sensor Networks",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Accurate positioning mechanisms are important in large scale sensor
networks to achieve a number of functionalities like location aware
routing, efficient coordination of resources and other application
specific
requirements. This paper proposes a distributed and scalable GPS free
positioning algorithm for wireless sensor networks. This approach is an
effort in the direction of finding a solution to the positioning problem
which minimizes the number of messages exchanged and the coordinate setup
time. We use a clustering based approach for the coordinate formation
wherein a small subset of the nodes can successfully establish the
coordinate
system for the whole network. We also compare the performance of this
system
against existing mechanisms and show that our system scales linearly as
the number of nodes in the network increases in contrast to the
exponential
increase in current mechanisms. Additionally, our mechanism takes
considerably
lower convergence times. The proposed mechanism is scalable, distributed
and able to support the ad hoc deployment of large scale sensor networks
quickly and efficiently."
}
@INPROCEEDINGS{Iyer0303:Approach,
AUTHOR="Sundar Iyer and Supratik Bhattacharyya and Nina Taft and Christophe Diot",
TITLE="An approach to alleviate link overload as observed on an {IP} backbone",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Shortest path routing protocols may suffer from congestion due to the use
of a single shortest path between a source and a destination. The goal of
our work is to first understand how links become overloaded in an IP
backbone, and then to explore if the routing protocol, either in its
existing form, or in some enhanced form could be made to respond
immediately to overload and reduce the likelihood of its occurrence. Our
method is to use extensive measurements of Sprints backbone network,
measuring 138 links between September 2000 and June 2001. We find that
since the backbone is designed to be overprovisioned, link overload is
rare, and when it occurs, 80\% of the time it is caused due to link
failures. Furthermore, we find that when a link is overloaded, few (if
any) other links in the network are also overloaded. This suggests that
deflecting packets to less utilized alternate paths could be an effective
method for tackling overload. We analytically derive the condition that a
network, which has multiple equal length shortest paths between every pair
of nodes (as is common in the highly meshed backbone networks) can provide
for loop-free deflection paths if all the link weights are within a ratio
1 + 1/(d-1) of each other; where is the diameter of the network. Based on
our measurements, the nature of the backbone topology and the careful use
of link weights, we propose a deflection routing algorithm to tackle link
overload where each node makes local decisions. Simulations suggest that
this can be a simple and efficient way to overcome link overload, without
requiring any changes to the routing protocol."
}
@INPROCEEDINGS{Iyer0303:Time,
AUTHOR="Mahadevan Iyer and Wei Tsai",
TITLE="Time-Optimal Network Queue Control: The Case of a Single Congested Node",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We solve the problem of time-optimal network queue control: what are the
input data rates that make network queue sizes converge to their ideal
size in the least possible time after a disturbance while still
maintaining maximum link utilization at all times, even in the transient?
This is a fundamental problem that needs to be solved in order to
understand and control convergence speed of all network queue control
schemes. The problem is non-trivial especially because of the vast
possible heterogeneity in packet propagation delays in the network. In
this paper, we derive the time-optimal queue control for a single
congested network node with a single finite queue shared by flows with
arbitrary network delays. We neatly separate the derivation of the optimal
arrival rate sequence from that of the feedback control protocol to achieve
it.
The time-optimal control is robust to bandwidth and queue size estimation
errors. Its complexity is only a function of the size of the network delays
and no per-flow computation is needed. The time-optimality and robustness
properties are proven to hold under all queue operating regimes with no
need for linearizing approximations."
}
@ARTICLE{Iyer0304:Analysis,
AUTHOR="Sundar Iyer and Nick McKeown",
TITLE="Analysis of the Parallel Packet Switch Architecture",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=2,
PAGES="314-324",
MONTH=apr,
YEAR=2003,
REFERENCES=29,
KEYWORDS="Clos network; inverse multiplexing; load balancing; output queueing; packet
switch",
ABSTRACT="Our work is motivated by the desire to design packet switches with large
aggregate capacity and fast line rates. We consider building a packet
switch from multiple lower speed packet switches operating independently
and in parallel. In particular, we consider a (perhaps obvious) parallel
packet switch (PPS) architecture in which arriving traffic is
demultiplexed over k identical lower speed packet switches, switched to
the correct output port, then recombined (multiplexed) before departing
from the system. Essentially, the packet switch performs packet-by-packet
load balancing, or inverse multiplexing, over multiple independent packet
switches. Each lower speed packet switch operates at a fraction of the
line rate R. For example, each packet switch can operate at rate R/k. It
is a goal of our work that all memory buffers in the PPS run slower than
the line rate. Ideally, a PPS would share the benefits of an output-queued
switch, i.e., the delay of individual packets could be precisely
controlled, allowing the provision of guaranteed qualities of service. In
this paper, we ask the question: is it possible for a PPS to precisely
emulate the behavior of an output-queued packet switch with the same
capacity and with the same number of ports? We show that it is
theoretically possible for a PPS to emulate a first-come first-served
(FCFS) output-queued (OQ) packet switch if each lower speed packet switch
operates at a rate of approximately 2R/k. We further show that it is
theoretically possible for a PPS to emulate a wide variety of
quality-of-service queueing disciplines if each lower speed packet switch
operates at a rate of approximately 3R/k. It turns out that these results
are impractical because of high communication complexity, but a practical
high-performance PPS can be designed if we slightly relax our original
goal and allow a small fixed-size coordination buffer running at the line
rate in both the demultiplexer and the multiplexer. We determine the size
of this buffer and show that it can eliminate the need for a centralized
scheduling algorithm, allowing a full distributed implementation with low
computational and communication complexity. Furthermore, we show that if
the lower speed packet switch operates at a rate of R/k (i.e., without
speedup), the r- esulting PPS can emulate an FCFS-OQ switch within a delay
bound.",
URL="http://ieeexplore.ieee.org/iel5/90/26877/01194826.pdf?isNumber=26877\&prod=JNL\&arnumber=1194826\&arSt=+314\&ared=+324\&arAuthor=Iyer\%2C+S.\%3B+McKeown\%2C+N.W."
}
@INPROCEEDINGS{Iyer0305:Qos,
AUTHOR="Ranjit Iyer and Leonard Kleinrock",
TITLE="QoS Control for Sensor Networks",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Sensor Networks are distributed networks made
up of small sensing devices equipped with processors,
memory, and short-range wireless communication. They
differ from conventional computer networks in that they
have severe energy constraints, redundant low-rate data,
and a plethora of information flows. Many aspects of
sensor networks such as routing, preservation of battery
power, adaptive self-configuration, etc., have already
been studied in previous papers [e.g., 1, 2, 3]. However,
to the best knowledge of the authors, the area of sensor
network Quality of Service (QoS) remains largely open.
This is a rich area because sensor deaths and sensor
replenishments make it difficult to specify the optimum
number of sensors that should be sending information at
any given time. In this paper we present an amalgamation
of QoS feedback and sensor networks. We use the idea of
allowing the base station to communicate QoS information
to each of the sensors using a broadcast channel and the
mathematical paradigm of the Gur Game. The result is a
robust sensor station to communicate QoS information to
each of the network that allows the base station to
dynamically adjust the resolution of QoS it is
receiving from the sensors depending on varying
circumstances."
}
@INPROCEEDINGS{Izma0303:Non,
AUTHOR="Rauf Izmailov and Samrat Ganguly and Viktor Kleptsyn and Aikaterini Varsou",
TITLE="Non-Uniform Waveband Hierarchy in Hybrid Optical Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Aggregation of individual wavelengths into wavebands for their
subsequent switching and routing as a single group is an
attractive way for scalable and cost-efficient optical networks.
We analyze the implications of this waveband hierarchy for a
single optical node by analyzing two issues: the proper selection
of waveband sizes and the assignment of wavebands for a limited
set of input-output patterns of traffic. We formulate a general
model and propose optimal algorithmic solutions for both problems.
The performance of resulting sets of non-uniform wavebands is
studied for several representative cases (a single node, an
optical ring network, an optical mesh network). The results
demonstrate improved optical throughput and reduced cost of
switching and routing when using non-uniform waveband hierarchy."
}
@ARTICLE{Jain0308:End,
AUTHOR="Manish Jain and Constantinos Dovrolis",
TITLE="End-to-End Available Bandwidth: Measurement Methodology, Dynamics, and
Relation With {TCP} Throughput",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=4,
PAGES="537-549",
MONTH=aug,
YEAR=2003,
REFERENCES=30,
KEYWORDS="active probing; bottleneck bandwidth; bulk transfer capacity; network
capacity; packet pair dispersion",
ABSTRACT={The available bandwidth (avail-bw) in a network path is of major importance
in congestion control, streaming applications, quality-of-service
verification, server selection, and overlay networks. We describe an
end-to-end methodology, called self-loading periodic streams (SLoPS), for
measuring avail-bw. The basic idea in SLoPS is that the one-way delays of
a periodic packet stream show an increasing trend when the stream's rate
is higher than the avail-bw. We have implemented SLoPS in a tool called
pathload. The accuracy of the tool has been evaluated with both
simulations and experiments over real-world Internet paths. Pathload is
nonintrusive, meaning that it does not cause significant increases in the
network utilization, delays, or losses. We used pathload to evaluate the
variability ({"}dynamics{"}) of the avail-bw in Internet paths. The
avail-bw becomes significantly more variable in heavily utilized paths, as
well as in paths with limited capacity (probably due to a lower degree of
statistical multiplexing). We finally examine the relation between
avail-bw and TCP throughput. A persistent TCP connection can be used to
measure roughly the avail-bw in a path, but TCP saturates the path and
increases significantly the path delays and jitter.},
URL="http://ieeexplore.ieee.org/iel5/90/27488/01224454.pdf?isNumber=27488\&prod=JNL\&arnumber=1224454\&arSt=+537\&ared=+549\&arAuthor=Jain\%2C+M.\%3B+Dovrolis\%2C+C."
}
@INPROCEEDINGS{Jais0303:Measurement,
AUTHOR="Sharad Jaiswal and Gianluca Iannaccone and Christophe Diot and James F.
Kurose and Don Towsley",
TITLE="Measurement and Classification of Out-of-Sequence Packets in a Tier-1 {IP}
Backbone",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We present a measurement study and classification methodology for
out-of-sequence packets in TCP connections observed within the Sprint IP
backbone. Such out-of-sequence packets can result from many causes
including loss, reordering of packets on the end-end path, or duplication
in
the network. It is important to quantify and understand the causes of such
out-of-sequence packets since they are one indication of the ``health'' of
an end-to-end TCP connection.
Our first contribution is methodological. Because we measure
out-of-sequence
packets at a single point in the backbone, a new methodology is
required to infer the causes of a connection's out-of-sequence packets.
We thus describe techniques that classify the causes of observed
out-of-sequence behavior based only on the previously- and
subsequently-observed packets within a connection and knowledge of how
TCP behaves. Using these simple techniques, it is possible to classify
almost
all out-of-sequence packets in our traces and the uncertainty in our
classification can be quantified. Our second contribution is the
characterization of the out-of-sequence behavior itself.
We analyze numerous several-hour packet-level traces from a set of OC-12
and OC-48 links for 14 million connections generated in more than 3,400
unique ASes. Our measurements show a relatively consistent amount of
out-of-sequence packets of approximately 5\%. We find that few
out-of-sequence packets result from pathological problems such as
in-network duplication or reordering.
Method Keywords: Network measurements, Experimentation with real networks
Simulations"
}
@TECHREPORT{Jako0305:Untraceable,
AUTHOR="Markus Jakobsson and Filippo Menczer",
TITLE="Untraceable Email Cluster Bombs: On Agent-Based Distributed Denial of
Service",
TYPE="arXiv technical report",
NUMBER="cs.CY/0305042",
MONTH=may,
YEAR=2003,
KEYWORDS="Computers and Society; Networking and Internet Architecture",
ABSTRACT="We uncover a vulnerability that allows for an attacker to perform an
email-based attack on selected victims, using only standard scripts and
agents.
What differentiates the attack we describe from other, already known forms
of
distributed denial of service (DDoS) attacks is that an attacker does not
need
to infiltrate the network in any manner -- as is normally required to
launch a
DDoS attack. Thus, we see this type of attack as a poor man's DDoS. Not
only is
the attack easy to mount, but it is also almost impossible to trace back
to the
perpetrator. Along with descriptions of our attack, we demonstrate its
destructive potential with (limited and contained) experimental results.
We
illustrate the potential impact of our attack by describing how an
attacker can
disable an email account by flooding its inbox; block competition during
on-line auctions; harm competitors with an on-line presence; disrupt phone
service to a given victim; cheat in SMS-based games; disconnect mobile
corporate leaders from their networks; and disrupt electronic elections.
Finally, we propose a set of countermeasures that are light-weight, do not
require modifications to the infrastructure, and can be deployed in a
gradual
manner.",
URL="http://arXiv.org/abs/cs/0305042"
}
@ARTICLE{Jauk0303:Academic,
AUTHOR="Avgust Jauk and Marko Bonac and Igor Ozimek and Gorazd Kandus",
TITLE="Academic and research network of Slovenia",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=5,
PAGES="444-450",
MONTH=mar,
YEAR=2003,
REFERENCES=10,
KEYWORDS="Research and educational networks; Internet",
ABSTRACT="The Academic and Research Network of Slovenia (ARNES) was founded by the
Government of Slovenia in 1992 as an agency to develop, operate and manage
a computer network for education and research. This article describes the
development of the network, the national backbone, and ways to connect to
the network, as well as services available to the user. Sufficient
international bandwidth capacity is essential for research and educational
institutions. ARNES is part of TEN-155, which is a EU project for high
speed pan-European interconnection between national research networks.
ARNES also participates in a number of international projects dealing with
advanced networking, some of which are briefly described in this article.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-46VTFGG-2-C\&\_cdi=5624\&\_orig=browse\&\_coverDate=03\%2F20\%2F2003\&\_sk=999739994\&view=c\&wchp=dGLbVzz-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=be50c1ef51e1573ce4c655ee417cb80e\&ie=f.pdf"
}
@INPROCEEDINGS{Jaya0305:Gigabit,
AUTHOR="Anura Jayasumana and Chandra V Chandrasekar and Sangeetha Bangolae",
TITLE="Gigabit Networking: Digitized Radar Data Transfer and Beyond",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Gigabit networking makes possible the provision of very high bandwidths to
applications requiring remote access to expensive and specialized
facilities that would otherwise have been restricted due to the current
state of the network. VCHILL project for digitized radar data transfer
over the Next Generation Internet is one such real-time application that
will tap this technology to revolutionize the access to a huge database of
weather radar data. In this paper, we briefly discuss the design and
implementation of the UDP-based virtual radar application. The impending
need for end-to-end congestion control of such non-TCP based applications
is realized and an efficient congestion control algorithm is deployed for
the radar application. The TCP-friendly Rate Adaptation Based On Loss
(TRABOL) algorithm is a source-based rate control mechanism that controls
the transmission rate based on the feedback about losses received from the
client station. The performance evaluation results show that the deployment
of this algorithm makes the application TCP-friendly."
}
@INPROCEEDINGS{Jaya0305:Hybrid,
AUTHOR="Srikant Jayaraman and Ivan Fernandez-Corbaton and John Smee",
TITLE="Hybrid Decision Feedback Equalization",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT={By modelling the effects of slicer errors, we derive an algorithm for
determining Hybrid DFE coefficients which account for the increase in
interference from error propagation. The coefficients of the DFE can be
determined adaptively through the LMS algorithm by including an SINR
dependent {"}leakage factor{"} in the feedback filter update equation.
The hybrid DFE coefficients reduce to those of a linear equalizer (LE) at
low SNR and a DFE at high SNR, which achieving an optimal compromise
between these extremes. In the SNR region of greatest interest for
systems with high spectral efficiency, simulation results show that the
Hybrid DFE offers significant gains compared to a regular DFE or an LE of
comparable complexity.}
}
@ARTICLE{Jæge0312:Prioritized,
AUTHOR="Bjørn {Jæger} and David Tipper",
TITLE="Prioritized traffic restoration in connection oriented QoS based networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=18,
PAGES="2025-2036",
MONTH=dec,
YEAR=2003,
REFERENCES=28,
KEYWORDS="Fault recovery; Survivability; Priority; Restoration",
ABSTRACT="Connection oriented quality-of-service (QoS) based networks offer several
service classes each designed to handle connections supporting various
types of applications. A network failure will typically result in a large
number of disrupted connections in each service class, all of which need
to be restored simultaneously. In this paper we propose a distributed
fault recovery priority scheme for dynamic restoration of connections. The
proposed scheme exploits available network resources immediately after a
failure together with properties of typical applications carried by the
connections in order to give the applications sufficient network
performance. The scheme is formulated within the context of switched
virtual circuit routing in ATM networks, but it is applicable to ATM
virtual path restoration as well and to other class based QoS networks
like DiffServ MPLS based networks. The priority based restoration scheme
is formulated as a centralized path flow integer programming optimization
problem serving as a comparison benchmark for suboptimal distributed
schemes. We propose a distributed heuristic scheme and give numerical
results illustrating the quality of the proposed distributed scheme in
comparison to the centralized optimal approach. Our numerical results show
that the proposed distributed scheme can significantly improve utilization
of network resources and enhance network performance after a failure.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-48V7KCX-1-2F\&\_cdi=5624\&\_orig=browse\&\_coverDate=12\%2F31\%2F2003\&\_sk=999739981\&view=c\&wchp=dGLbVlz-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=f6128de2b3e07bf5d8a480ba79a72a3f\&ie=f.pdf"
}
@INPROCEEDINGS{Jütt0303:Bandwidth,
AUTHOR="Alpár {Jüttner} and István Szabó and Áron Szentesi",
TITLE="On Bandwidth Efficiency of the Hose Resource Management Model in Virtual
Private Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="The hose resource provisioning model promises to provide an
easy-to-use characterization framework for Virtual Private Network
service offerings. Significant research effort has recently been
spent on proposing new algorithms for provisioning cost-optimal
networks specified according to this new model. However, a detailed
comparison of the bandwidth requirement for networks designed based
on the hose model and networks designed based on the traditional
pipe model has not been performed. The first contribution of this
paper is a detailed comparison of the bandwidth needs of the two
models assuming a range of network sizes and network topologies.
This numerical evaluation required efficient calculation methods
for determining resource allocation based on the hose model
parameters, therefore, a linear programming based formulation is
also presented for this purpose. The second contribution is the
calculation of a lower bound for the hose based realization. This
lower bound is very useful in evaluating the two models given that
the problem of provisioning a minimal cost network based on the
hose model specification can only approximately be solved in
polynomial time."
}
@INPROCEEDINGS{Jego0305:Source,
AUTHOR="Herve Jegou and Christine Guillemot",
TITLE="Source multiplexed codes for error-prone channels",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Compression systems of real signals (images, video, audio) generate
sources of information with different levels of priority which are then
encoded with variable length codes (VLC).
This paper addresses the issue of robust transmission
of such VLC encoded heterogeneous sources over error-prone
channels.
VLCs are very sensitive to channel noise: when some bits are altered,
synchronization losses can occur at the receiver.
This paper describes a new family of codes, called multiplexed codes,
that allow to confine the de-synchronization phenomenon to
low priority data while allowing to reach asymptotically the
entropy bound for both (low and high priority) sources.
The idea consists in creating fixed length codes
for high priority information and in using the inherent redundancy
to describe low priority data, hence the name ``multiplexed codes''.
Simulation results reveal a very high error resilience at almost no cost
in compression efficiency."
}
@INPROCEEDINGS{Jele0303:Asymptotic,
AUTHOR="Predrag Jelenkovic and Ana Radovanovic",
TITLE="Asymptotic Insensitivity of Least-Recently-Used Caching to Statistical
Dependency",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We investigate a widely popular Least-Recently-
Used (LRU) cache replacement algorithm with semi-
Markov modulated requests. Semi-Markov processes
provide the flexibility for modeling strong statistical
correlation, including the broadly reported long-range
dependency in theWorldWideWeb page request patterns.
When the frequency of requesting a page n is
equal to the generalized Zipf's law c/n^{\alpha},\alpha>1, our
main result shows that the cache fault probability is
asymptotically, for large cache sizes, the same as in the
corresponding LRU system with i.i.d. requests. This
appears to be the first explicit average case analysis of
LRU caching with statistically dependent request sequences.
The surprising insensitivity of LRU caching
performance demonstrates its robustness to changes
in document popularity. Furthermore, we show that
the derived asymptotic result and the simulation experiments
are in excellent agreement, even for relatively
small cache sizes. The potential of using our results
in predicting the behavior ofWeb caches is tested
using actual, strongly correlated, proxy server access
traces."
}
@MASTERSTHESIS{Ji0305:Enabling,
AUTHOR="Yuan Ji",
TITLE="Enabling Video Conferencing between NetMeeting and Vic",
SCHOOL="Department of Computer Science, University of Kentucky",
ADDRESS="Lexington, Kentucky",
MONTH=may,
YEAR=2003,
KEYWORDS="H.323; vic; video conferencing",
ABSTRACT="Adds H.323 conferencing to vic."
}
@INPROCEEDINGS{Ji0305:Power,
AUTHOR="Zhu Ji and Qian Zhang and Wenwu Zhu and Zihua Guo",
TITLE="Power-Efficient {MPEG-4} {FGS} Video Transmission over {MIMO-OFDM} Systems",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Orthogonal frequency division multiplexing (OFDM) with multiple antennas
makes it possible for efficient transmission of high-speed multimedia over
wireless channels. This paper proposes an approach for power-efficient
video transmission of MPEG-4 fine granularity scalable (FGS) bit-stream
over OFDM systems with multiple antennas at both transmitter and receiver.
Our proposed approach minimizes the total distortion while satisfying the
constraint of transmission power, which is achieved by optimal power
allocation and transmission rate control with power-efficient assignment
of scalable source to spatial subchannels. The performance of our proposed
scheme is compared with the one using fixed transmission rate or power
allocation. Simulation results show significant performance gain of our
approach."
}
@ARTICLE{Jia0306:Optimal,
AUTHOR="Xiao-Hua Jia and Dingzhu Du and Xiao-Dong Hu and He-Jiao Huang and De-Ying
Li",
TITLE="On the optimal placement of wavelength converters in {WDM} networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=9,
PAGES="986-995",
MONTH=jun,
YEAR=2003,
REFERENCES=19,
KEYWORDS="WDM networks; Multihop systems; Wavelength conversion; Converter placement;
Wavelength assignment",
ABSTRACT="An important goal of the design of wavelength division multiplexing (WDM)
networks is to use less wavelengths to serve more communication needs.
According to the wavelength conflict rule, we know that the number of
wavelengths required in a WDM network is at least equal to the maximal
number of channels over a fiber (called maximal link load) in the network.
By placing wavelength converters at some nodes in the network, the number
of wavelengths needed can be made equal to the maximal link load. In this
paper, we study the problem of placing the minimal number of converters in
a network to achieve that the number of wavelengths in use is equal to the
maximal link load. For duplex communication channels, we prove that the
optimal solution can be obtained in polynomial-time. For unidirectional
communication channels, which was proved to be NP-complete, we develop a
set of lemmas which lead to a simple approximation algorithm whose
theoretically guaranteed performance ratio is at most two.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-48DSSWJ-2-30\&\_cdi=5624\&\_orig=browse\&\_coverDate=06\%2F02\%2F2003\&\_sk=999739990\&view=c\&wchp=dGLbVzb-zSkzk\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=af6324808100f77554d583a1be541085\&ie=f.pdf"
}
@INPROCEEDINGS{Jian0305:Assessment,
AUTHOR="Wenyu Jiang and Henning Schulzrinne",
TITLE="Assessment of VoIP Service Availability in the Current Internet",
BOOKTITLE="Passive \& Active Measurement Workshop",
ADDRESS="San Diego, CA",
MONTH=apr,
YEAR=2003,
KEYWORDS="Reliability; QoS; VoIP",
ABSTRACT="We evaluate the availability of voice over IP (VoIP)
service typically achieved in the current Internet. The service
availability is examined using several metrics, including call success
probability, overall packet loss probability, the proportion of time
the network is suitable for VoIP service, and call abortion
probability induced by network outages. Our major findings are:
first, packet losses are not rare events, and it is generally worse on
international paths. Second, network outages make up a non-negligible
portion of packet losses. While most outages are short, some
are extremely long and make up the majority time of all outages. This
implies
when a service becomes unavailable, the Mean Time To Restore (MTTR)
can sometimes be very high. About one third of the outages happen in
symmetry, and outages tend to occur at the edges rather than in the
middle of the network. Third, although research networks such as
Internet2 has much lower delay and loss than the public Internet, the
effect of network outages on both types of networks is almost the
same. Finally, we will show that when considering calls aborted due
to network outages, the overall service availability drops by a
significant margin, from about 99.5\\% to 98\\%.",
URL="http://www.cs.columbia.edu/IRT/papers/Jian0304\_Assessment.pdf"
}
@INPROCEEDINGS{Jian0305:Icard,
AUTHOR="Zhimei Jiang and Hui Luo and Paul Henry and Yu-Ngok Li",
TITLE="iCard - Foundation for A New Ubiquitous Computing Architecture",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We propose a new mobile computing paradigm, in which an intelligent card
(iCard) plugged into a mobile device serves as the centerpiece that
provides enhanced networking and application capabilities to the mobile
host. Placed between a mobile host and traditional network interfaces,
iCard is device independent, easy to program, and offers enhanced
security.
This paper describes the overall concept of iCard, and the key elements
in its hardware and software architecture. The hardware discussions focus
on a particular design that we have put together for an actual prototype
iCard. We share with readers the rationales behind various choices made
in this design. On the software side, we have been developing application
programs to be loaded onto the iCard using a StrongARM reference board.
To demonstrate the strong potential of the new paradigm represented by
iCard, we show how iCard is able to provide Mobile IP based seamless
mobility management to mobile hosts without making any modifications to
the host machines."
}
@INPROCEEDINGS{Jian0305:Qos,
AUTHOR="Wenyu Jiang and Kazuumi Koguchi and Henning Schulzrinne",
TITLE="QoS Evaluation of VoIP End-points",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We evaluate the QoS of a number of VoIP end-points, in terms of
mouth-to-ear (M2E) delay, clock skew, silence suppression behavior and
robustness to packet loss. Our evaluation results show that
mouth-to-ear delay depends mainly on the receiving end-point.
Hardware IP phones, when acting as receivers, usually achieve a low
average M2E delay (45-90\,ms) under low jitter conditions. For
software VoIP clients, this can range from 65\,ms to over 400\,ms,
depending on the actual software. All tested end-points can
compensate for clock skew, although some exhibit the symptom of
occasional playout buffer underflow. Only a few of the tested
end-points support silence suppression. We find that their silence
detectors have a fairly long hangover time ($>$ 1\,sec), and they may
falsely detect music as silence. All the hardware IP phones we tested
support some form of packet loss concealment better than silence
substitution. The concealment generally works well for two to three
consecutive losses at 20\,ms packet intervals, but voice will quickly
fade afterwards."
}
@INPROCEEDINGS{Jian0309:Black,
AUTHOR="Wenyu Jiang and Henning Schulzrinne",
TITLE="A Black-box QoS Measurement Methodology for VoIP End-points",
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 present a black-box based measurement methodology for evaluating
the QoS of VoIP end-points (IP phones and soft-phones). We discuss
how this general methodology can be coupled with novel input stimuli
to measure a number of important end-point QoS metrics, such as
mouth-to-ear (M2E) delay under WAN conditions, the playout delay and
inference of playout algorithm behaviors. We then illustrate its use
and efficacy with real measurement cases and results."
}
@ARTICLE{Jian0309:Performance,
AUTHOR="Lian Jian and Erry Gunawan",
TITLE="Performance analysis of a modified {CDMA/PRMA} {MAC} protocol",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=14,
PAGES="1673-1680",
MONTH=sep,
YEAR=2003,
REFERENCES=17,
KEYWORDS="Code division multiple access; Medium access control; Packet reservation
multiple access; Traditional Markov analysis; Transient fluid analysis",
ABSTRACT="This paper analyzes the performance of a protocol proposed to improve the
performance of Joint CDMA/PRMA protocol under heavy data traffic load
condition. The proposed protocol features a demand-based assignment scheme
for data transmission. Its performance is evaluated using two analysis
methods: a Traditional Markov Analysis and a Transient Fluid Analysis.
Simulation results are also given to validate the assumptions made in the
mathematical models developed. Our work shows that demand-based assignment
scheme is suitable for random data traffic transmission, especially when
there are a large number of active data terminals with short random
messages.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-4805VF7-5-65\&\_cdi=5624\&\_orig=browse\&\_coverDate=09\%2F01\%2F2003\&\_sk=999739985\&view=c\&wchp=dGLbVlb-zSkzk\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=78e38d6404b2290884d2f4ecf5a4e707\&ie=f.pdf"
}
@ARTICLE{Jian0312:Blocking,
AUTHOR="Xiaohong Jiang and Hong Shen and Mamun-ur-Rashid Khandker and Susumu
Horiguchi",
TITLE="Blocking Behaviors of Crosstalk-Free Optical Banyan Networks on Vertical
Stacking",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=6,
PAGES="982-993",
MONTH=dec,
YEAR=2003,
REFERENCES=21,
KEYWORDS="Banyan networks; blocking probability; multistage interconnection networks
(MINs); switching networks; vertical stacking",
ABSTRACT="Banyan networks are attractive for constructing directional coupler
(DC)-based optical switching networks for their small depth and
self-routing capability. Crosstalk between optical signals passing through
the same DC is an intrinsic drawback in DC-based optical networks. Vertical
stacking of multiple copies of an optical banyan network is a novel scheme
for building nonblocking (crosstalk-free) optical switching networks. The
resulting network, namely vertically stacked optical banyan (VSOB)
network, preserves all the properties of the banyan network, but increases
the hardware cost significantly. Though much work has been done for
determining the minimum number of stacked copies (planes) required for a
nonblocking VSOB network, little is known on analyzing the blocking
probabilities of VSOB networks that do not meet the nonblocking condition
(i.e., with fewer stacked copies than required by the nonblocking
condition). In this paper, we analyze the blocking probabilities of VSOB
networks and develop their upper and lower bounds with respect to the
number of planes in the networks. These bounds depict accurately the
overall blocking behaviors of VSOB networks and agree with the conditions
of strictly nonblocking and rearrangeably nonblocking VSOB networks
respectively. Extensive simulation on a network simulator with both random
routing and packing strategy has shown that the blocking probabilities of
both strategies fall nicely within our bounds, and the blocking
probability of packing strategy actually matches the lower bound. The
proposed bounds are significant because they reveal the inherent
relationships between blocking probability and network hardware cost in
terms of the number of planes, and provide network developers a
quantitative guidance to trade blocking probability for hardware cost. In
particular, our bounds provide network designers an effective tool to
estimate the minimum and maximum blocking probabilities of VSOB networks
in which different routing strategies may be applied. An interesting
conclusion drawn from our work that has practical applications is that the
hardware cost of a VSOB network can be reduced dramatically if a
predictable and almost negligible nonzero blocking probability is allowed.",
URL="http://ieeexplore.ieee.org/iel5/90/28078/01255435.pdf?isNumber=28078\&prod=JNL\&arnumber=1255435\&arSt=+982\&ared=+993\&arAuthor=Xiaohong+Jiang\%3B+Hong+Shen\%3B+Khandker\%2C+Md.M.-ur-R.\%3B+Horiguchi\%2C+S."
}
@INPROCEEDINGS{Jin0303:Nash,
AUTHOR="Youngmi Jin and George Kesidis",
TITLE="Nash equilibria of a generic networking game with applications to
circuit-switched networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="A generic mechanism for end-user transmission
rate control into a differentiated services Internet is formulated.
We consider specific
examples of the mechanism including additive increase and
multiplicative decrease inspired by present day TCP congestion control.
For the example of users sharing access to a bandwidth resource
via resizable provisioned label-switched paths (MPLS), we study the
equilibria
and the performance of the generic mechanism and give analytical
results on convergence to equilibria. \%In particular, we study
The fairness of the resulting equilibria when
user demands exceed available network resources is also studied"
}
@INPROCEEDINGS{Jin0305:Construction,
AUTHOR="Jingwen Jin",
TITLE="On Construction of Service Multicast Trees",
BOOKTITLE="ICC 2003 - Global Services and Infrastructure for Next Generation Networks",
ADDRESS="Anchorage, Alaska",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Internet heterogeneity is a major problem, especially for multimedia data
delivery. To solve the problem, overlay proxy networks as well as
distributed and composable services across these overlay networks are
being deployed. This solution, however implies that the overlay networks
must support not only {\em data multicast} for data delivery to a group of
destinations, but also {\em service multicast} to incorporate services for
semantic data transformations in order to deal
with Internet heterogeneity.
This paper presents challenges and solutions for building service
multicast trees. We compare two groups of algorithms, the {\em
shortest-service-path-tree} (SSPT) algorithm and the {\em longest-match}
(LM) algorithm. The simulation results show a clear trade-off between
complexity and overall tree performance, as well as cost differences when
further refinements of the LM approach are considered."
}
@ARTICLE{Jin0306:Spectrum,
AUTHOR="Shudong Jin and Liang Guo and Ibrahim Matta and Azer Bestavros",
TITLE="A Spectrum of TCP-Friendly Window-Based Congestion Control Algorithms",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=3,
PAGES="341-355",
MONTH=jun,
YEAR=2003,
REFERENCES=33,
KEYWORDS="congestion control; fairness; TCP-compatibility; TCP-friendliness;
transient behavior",
ABSTRACT="The increasing diversity of Internet application
requirements has spurred recent interest in transport protocols
with flexible transmission controls. In window-based congestion
control schemes, increase rules determine how to probe available
bandwidth, whereas decrease rules determine how to back off
when losses due to congestion are detected. The control rules
are parameterized so as to ensure that the resulting protocol is
TCP-friendly in terms of the relationship between throughput
and loss rate. This paper presents a comprehensive study of a
new spectrum of window-based congestion controls, which are
TCP-friendly as well as TCP-compatible under RED. Our controls
utilize history information in their control rules. By doing so, they
improve the transient behavior, compared to recently proposed
slowly responsive congestion controls such as general additive-increase
and multiplicative-decrease (AIMD) and binomial controls.
Our controls can achieve better tradeoffs among smoothness,
aggressiveness, and responsiveness, and they can achieve faster
convergence. We demonstrate analytically and through extensive
ns simulations the steady-state and transient behavior of several
instances of this new spectrum.",
URL="http://ieeexplore.ieee.org/iel5/90/27187/01208297.pdf?isNumber=27187\&prod=JNL\&arnumber=1208297\&arSt=+341\&ared=+355\&arAuthor=Shudong+Jin\%3B+Liang+Guo\%3B+Matta\%2C+I.\%3B+Bestavros\%2C+A."
}
@INPROCEEDINGS{Jing0305:Novel,
AUTHOR="Xu Jing and Haifeng Wang and Chen Ming and ShiXin Cheng",
TITLE="A Novel {BLAST} Detection Algorithm Based Instantaneous Error Ordering",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Abstract- space-time transmission techniques, which make full use of the
rich scattering channel with multiple transmit and receive antennas, can
greatly increase the spectral efficiency. The conventional V-BLAST (Bell
Laboratories Layered Space-Time) detection algorithms estimate symbols
with the expected SNRs ordering. In this paper, a novel BLAST detection
algorithm based instantaneous error ordering (IEO-BLAST) is proposed. The
proposed BLAST detection algorithm obtains the additional diversity with
instantaneous error ordering and reduces the effect of the error
propagation. Therefore, the performance of the BLAST architecture is
greatly improved. In addition, the simplified version of IEO-BLAST
detection algorithm (SIEO-BLAST) is derived. And the performance of
simplified algorithm has little degradation. The selection capacity (SC)
is defined to represent the performance of the algorithm with successive
interference cancellation."
}
@INPROCEEDINGS{Jo0305:Evaluation,
AUTHOR="Jinyong Jo and JongWon Kim",
TITLE="Evaluation on the Performance of Adaptive Playout for the Multicast
Streaming of Stored Media",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="A new inter-client synchronization framework employing a
server-client coordinated adaptive playout and error control
toward the multicast streaming of stored media is discussed in
this paper. The proposed adaptive playout mechanism controls the
playout speed of audio and video by adopting the time-scale
modification of audio. Based on the overall synchronization status
as well as the buffer occupancy level, the playout speed of each
client is manipulated within a perceptually tolerable range.
By coordinating the playout speed of each client, the inter-client
synchronization with respect to the target presentation time is
smoothly achieved. The cumulative feedback for retransmission
assisted by both playout speed manipulation at clients and
implicit help of a streaming server is also conducted to increase
the reliability. Simulation results demonstrate the performance of
the proposed multicast streaming framework."
}
@INPROCEEDINGS{Jo0305:Performance,
AUTHOR="Jung-Hyuck Jo and Nikil Jayant",
TITLE="Performance Evaluation of Multiple {IEEE} 802.11b {WLAN} Stations in the
Presence of Bluetooth Radio Interference",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="There are several papers published in the past few years about the
evaluation of IEEE 802.11(b) WLAN performance degradation due to Bluetooth
radio interference. The network topologies used for WLAN in the previous
literature are point-to-point, i.e., one AP and one WLAN station. In this
paper we evaluate a performance of IEEE 802.11(b) systems composed of an
AP and multiple WLAN stations using the same 2.4GHz frequency band in the
presence of Bluetooth radio systems within a BSS. Our results focus on the
impact of Bluetooth interference on IEEE 802.11(b) WLAN systems. The
throughput of IEEE 802.11(b) is estimated as a function of not only WLAN
parameters but also Bluetooth radio system parameters.
Further, we derived theoretical maximum throughputs of IEEE 802.11(b)
systems with perfect channel conditions in order to compare with other
scenarios that considering interferences and competition with other WLAN
stations. As a result, with light and heavy BT usage scenarios, the IEEE
802.11(b) system throughputs are degraded by 25\% and 66\%, respectively."
}
@INPROCEEDINGS{Joha0304:Adaptive,
AUTHOR="Mathias Johanson",
TITLE="Adaptive Forward Error Correction for Real-time {Internet} Video",
BOOKTITLE="Packet Video Workshop",
MONTH=apr,
YEAR=2003,
ABSTRACT="Real-time video communication over packet networks is attracting a lot of
attention for applications such as
distributed collaborative work, teleteaching and telemedicine. Due to its
sensitivity to delay, real-time
communication is usually based on unreliable transport protocols, like
UDP, since retransmission of lost
packets is considered to take too long time. Instead of retransmissions
forward error correction schemes have
been proposed to make the applications more resilient to packet loss.
Since the packet loss rate in the Internet
typically fluctuates depending on the load on the network, the amount of
redundancy applied by the error
correction coding should ideally be adaptive to the amount of loss
experienced on an end-to-end connection. In
this paper an adaptive forward error correction scheme, based on
Reed-Solomon erasure coding and receiver
feedback, is presented. Moreover, an optimal packetization strategy for
error protected video communication is
suggested and an efficient algorithm implementing this packetization
scheme is deduced. The performance gain
of the scheme, in terms of increased network bandwidth utilization, is
analyzed and found to be as high as
around 10\% for some relevant usage situations. The combination of
adaptive forward error correction schemes
with congestion control algorithms is also discussed in the paper.",
URL="http://w2.alkit.se/~mathias/doc/PV2003-paper.pdf"
}
@INPROCEEDINGS{Joha0305:Simultaneous,
AUTHOR="Mikael Johansson and Lin Xiao and Stephen Boyd",
TITLE="Simultaneous Routing and Power Allocation in {CDMA} Wireless Data Networks",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In CDMA wireless networks the optimal routing of data depends on the link
capacities which, in turn, are determined by the allocation of transmit
powers to the links. The optimal performance of the network can only be
achieved by simultaneous optimization of routing and power allocation. In
this paper, we study this joint optimization problem in CDMA data networks
using convex optimization techniques. Although link capacity constraints of
CDMA systems are not jointly convex in rates and powers, we show that by
using coordinate projections or transformations, the simultaneous routing
and power allocation problem can still be formulated as (in systems with
interference cancellation) or approximated by (in systems without
interference cancellation) a
convex optimization problem which can be solved very efficiently. We also
propose a heuristic link-removal procedure based on the convex
approximation to further improve the system performance."
}
@INPROCEEDINGS{John0305:Optimality,
AUTHOR="Leigh Johnston and Vikram Krishnamurthy",
TITLE="Optimality of Threshold Transmission Policies in Gilbert Elliott Fading
Channelssy",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We derive stochastic control algorithms to achieve the optimal
tradeoff between throughput and energy consumption
for transmitting packets across
a time varying wireless channel with memory. The channel state is not
directly observed and hence transmission decisions must be based on
ACK/NAK
information provided over a feedback channel. By reformulating
the problem as a Markovian search problem, we prove a recent conjecture
that the
optimal transmission
control policies are threshold in nature.
Threshold policies are computationally
inexpensive to implement. Numerical simulations
demonstrate the performance improvements that can be
obtained using the optimal threshold policies as compared to
heuristic algorithms."
}
@ARTICLE{Jonk0307:Philosophies,
AUTHOR="Pieter Jonker and Stelian Persa and Jurjen Caarls and Frank {de Jong} and
Inald Lagendijk",
TITLE="Philosophies and technologies for ambient aware devices in wearable
computing grids",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=11,
PAGES="1145-1158",
MONTH=jul,
YEAR=2003,
REFERENCES=29,
KEYWORDS="Ambient aware devices; Personal digital assistants; Differential global
positioning system; UMTS; Ad-hex networking",
ABSTRACT="In this paper we treat design philosophies and enabling technologies for
ambient awareness within grids of future mobile computing/communication
devices. We extensively describe the possible context sensors, their
required accuracies, their use in mobile servicespossibly leading to
background interactions of user devicesas well as a draft of their
integration into an ambient aware device. We elaborate on position sensing
as one of the main aspects of context aware systems. We first describe a
maximum accuracy setup for a mobile user that has the ability of Augmented
Reality for indoor and outdoor applications. We then focus on a set-up for
pose sensing of a mobile user, based on the fusion of several inertia
sensors and DGPS. We describe the anchoring of the position of the user by
using visual tracking, using a camera and image processing. We describe our
experimental set-up with a background process that, once initiated by the
DGPS system, continuously looks in the image for visual clues andwhen
foundtries to track them, to continuously adjust the inertial sensor
system. We present some results of our combined inertia tracking and
visual tracking system; we are able to track device rotation and position
with an update rate of 10 ms with an accuracy for the rotation of about
two degrees, whereas head position accuracy is in the order of a few cm at
a visual clue distance of less than 3 m.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-485PHPY-1-1V\&\_cdi=5624\&\_orig=browse\&\_coverDate=07\%2F01\%2F2003\&\_sk=999739988\&view=c\&wchp=dGLbVtz-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=c136b44d5b1763901a3834a4e780b80e\&ie=f.pdf"
}
@INPROCEEDINGS{Jord0305:Pricing,
AUTHOR="Scott Jordan",
TITLE="Pricing of buffer and bandwidth in a reservation-based QoS architecture",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We consider resource allocation policies to guarantee bounds on
packet loss and end-to-end delay for real-time applications in a
network with a reservation-based QoS architecture. We consider
using pricing to distribute the allocation of buffer and bandwidth
at each node along a set of paths, with the goal of maximizing the
total utility of all users in the network. Each user is modelled
as an aggregate of flows with similar traffic characterizations
and similar utility functions, and utility is assumed to be a
function of loss probability, which in turn depends on the
reserved buffer and bandwidth at each node. We show that this
optimization problem has a unique solution, and that the
corresponding shadow costs associated with each resource and delay
constraint can be related to user's marginal utilities. We propose
distributed pricing implementations to achieve the optimal
resource reservation policy, by assigning individual roles to the
users and to the network, and perhaps to an intervening arbitrager
layer. We prove that an allocation is optimal iff all users,
arbitragers, and the network are in equilibrium."
}
@ARTICLE{Josl0303:Trends,
AUTHOR="Chris Joslin and Igor Pandzic and Nadia Thalmann",
TITLE="Trends in networked collaborative virtual environments",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=5,
PAGES="430-437",
MONTH=mar,
YEAR=2003,
REFERENCES=25,
KEYWORDS="Networked collaborative virtual environments; Collaborative work",
ABSTRACT="Networked Collaborative Virtual Environments (NCVEs) systems allow multiple
geographically distant users to share the same 3D virtual environment using
a network. The paper presents an overview of the developments in the field
of NCVE in the past decade with an introduction of research challenges and
solutions for such systems and a brief presentation of systems that brought
major developments to the NCVE field. As a case study, we present a new
generation NCVE system VPARK.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47S70BB-1-F\&\_cdi=5624\&\_orig=browse\&\_coverDate=03\%2F20\%2F2003\&\_sk=999739994\&view=c\&wchp=dGLbVlz-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=75f6ddb21d3d72c576d30243171a2fc6\&ie=f.pdf"
}
@INPROCEEDINGS{Jout0305:Adaptive,
AUTHOR="Jyrki Joutsensalo and Timo {Hämäläinen} and Mikko Paakkonen",
TITLE="Adaptive Weighted Fair Scheduling Method for Channel Allocation",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Different applications such as Voice over IP and Video-on-Demand need
different Quality of Service parameters (e.g. guaranteed bandwidth, delay,
and latency) from the networks. The customers with different needs pay
different prices to the service provider, who must share resources in a
plausible way.
In a router, packets are queued using a multi-queue system, where
each queue can correspond to one service class.
This paper presents an adaptive Weighted Fair Queue based
algorithm for channel allocation. The weights in gradient type algorithm
are adapted by using revenue as a target function."
}
@INPROCEEDINGS{Jun0305:Two,
AUTHOR="Jong-arm Jun",
TITLE="A Two-Dimensional Scalable Crossbar Matrix Switch Architecture",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Explosive growth of Internet traffic causes a new challenge in the design
of high-speed switches. One of main design issues for high-speed switches
is a scalability problem. This paper proposes a scalable crossbar matrix
(SCM) switch architecture, which is composed of multiple crossbar switch
units(XSU) with virtual output queues (VOQs) at the inputs and single-cell
scheduling decomposition buffers (SDBs) at the outputs. We propose a
distributed scheduling algorithm for the proposed scalable crossbar switch
architecture, which is composed of a credit based SLIP(C-SLIP) scheduling
for crossbar switch units and backlog weighted round robin (BWRR)
scheduling for switching fabric output ports. In this paper, we show that
large-scale switch fabric can be build-up by small-size crossbar switch
units with improved delay performance and enough arbitration time margin.
The simulation results show that the proposed switch architecture and
distributed scheduling algorithm can provide 100\% throughput under i.i.d
uniform traffic with a single iteration arbitration in a time slot."
}
@INPROCEEDINGS{Jung0303:Modelling,
AUTHOR="Jaeyeon Jung and Arthur Berger and Hari Balakrishnan",
TITLE="Modelling TTL-based Internet Caches",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT={This paper models Internet caches that use time-to-live (TTL)-based
caching, the caching mechanism used by Web and DNS caches. In
TTL-based caching the cached version of a data item is deemed valid
until a certain time (the {"}time-to-live{"}) elapses from when the data
item is placed in the cache. This simple mechanism scales well to large
numbers of caches, but the dependence of hit rates on TTL and access
statistics is not clear.
To address this, we develop a closed-form formula for the hit ratio
based on the simplifying assumption that the sequence of inter-arrival
times of the queries for a given data item can be modeled as a
sequence of independent and identically distributed random variables.
Our model provides an analysis for the cache hit rates of TTL-based
Internet caches in terms of the statistics of data accesses and the
TTL value set by the origin site of information. Analyzing extensive
DNS traces, we find that our model predicts observed statistics
remarkably well; in particular, it's able to adequately explain the
somewhat surprising empirical finding that for DNS accesses,
the cache hit ratio for the 15 minute TTL is over 80\% and
increasing the TTL of DNS names from 15 minutes to 24 hours
has only a small (<17\%) improvement in
the cache hit rate. The prediction is best when we use the observed,
empirical distribution of the inter-arrival times of DNS queries. We
also find that if the inter-arrival times are modeled according to an
analytic distribution, then a Pareto distribution with a point mass
yields a better fit than a Weibull distribution, with or without a
point mass, or a log Normal, or other candidate distributions.}
}
@INPROCEEDINGS{Kaba0305:Optimal,
AUTHOR="Pierre Kabamba and Semyon Meerkov and Choon Yik Tang",
TITLE="Optimal, Suboptimal and Adaptive Threshold Policies for Power Efficiency of
Wireless Networks",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we prove that the optimal power-efficient transmission
policy, which ensures a desired throughput in a wireless network, is
necessarily of threshold nature. Although detailed properties of this
policy might be quite complicated, we show that it can be approximated by
a suboptimal one, which is both simple and practical. This suboptimal
policy may lead to substantial improvement in power-efficiency (compared
to the widely used constant SNR policy), but at the expense of
location-fairness. To alleviate this deficiency, we introduce an adaptive
threshold policy and show that it is both relatively power-efficient and
location-fair."
}
@INPROCEEDINGS{Kaj03:Modelling,
AUTHOR="Ingemar Kaj and Ian Marsh",
EDITOR="Marco {Ajmone Marsan} and Giorgio Corazza",
TITLE="Modelling the Arrival Process for Packet Audio",
BOOKTITLE="QoS-IP",
PUBLISHER="Springer",
ADDRESS="Milan, Italy",
PAGES="35-49",
MONTH=feb,
YEAR=2003,
NOTE="LNCS 2601",
ABSTRACT="Packets in an audio stream can be distorted relative to one another during
the traversal of a packet switched network. This distortion can be mainly
attributed to queues in routers between the source and the destination.
The queues can consist of packets either from our own flow, or from other
flows. The contribution of this work is a Markov model for the time delay
variation of packet audio in this scenario. Our model is extensible, and
show this by including sender silence suppression and packet loss into the
model. By comparing the model to wide area traffic traces we show the
possibility to generate an audio arrival process similar to those created
by real conditions. This is done by comparing the probability density
functions of our model to the real captured data.",
URL="http://www.sics.se/~ianm/Publications/audio\_delay\_cr.pdf"
}
@INPROCEEDINGS{Kama0305:Reduction,
AUTHOR="Siddesh Kamat and Srinivas Parimi and Dharma Agrawal",
TITLE="Reduction in Control Overhead for a Secure, Scalable Framework for Mobile
Multicast",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Security in multicast is a necessity for applications that require a group
of members to transmit data among themselves. Non-members should be
precluded from receiving and sending messages to the group. The issue of
efficient and scalable key management in such a multicast environment is
difficult, since multicast usually involves a large number of hosts. A
single change in the group membership often affects many hosts. IOLUS is
one existing framework having a central Group Security Controller (GSC)
with trusted Group Security Intermediaries (GSI) connected to it. GSIs
handle the multicast members. But, IOLUS involves a large overhead
whenever a member connected to the GSI leaves the group, since the GSI has
to update the sub-group key for all the remaining members. Mobility
increases the overhead. In this paper, we introduce Microgrouped IOLUS
(M-IOLUS), a novel concept of dynamic micro-groups maintained by the GSI.
A micro-key is used for the transmission of control information. This
drastically reduces the control overhead incurred. We have performed
extensive simulations varying the different parameters involved and
observed a considerable reduction in overhead."
}
@INPROCEEDINGS{Kamp0305:Measuring,
AUTHOR="Wolfgang Kampichler and Karl Michael Goeschka",
TITLE="On Measuring Quality of Service Limitations in Local Area Networks",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Converging networks destined to handle voice and data traffic have
created a need for novel transmission quality planning. In most
cases, the end-to-end communication path requires measurement for
tuning and continuous maintenance to achieve acceptable quality
for service integration. Several sources of latency within a local
network communication path are beneath notice or remain
undiscovered when doing such measurements, thus biasing the
result.
We discuss such relevant sections and introduce a method that
takes these sources into account to receive a more accurate
measurement. Validation shows that this method has the performance
and accuracy to evaluate Quality of Service limitations from any
point in a network. This enables a more aimed and efficient tuning
of local area networks destined to carry real-time services."
}
@INPROCEEDINGS{Kamv0305:Eigentrust,
AUTHOR="Sepandar Kamvar and Mario Schlosser and Hector Garcia-Molina",
TITLE="The EigenTrust Algorithm for Reputation Management in {P2P} Networks",
BOOKTITLE="International World Wide Web Conference (WWW)",
ORGANIZATION="International World Wide Web Conference Committee",
ADDRESS="Budapest, Hungary",
MONTH=may,
YEAR=2003,
ABSTRACT="Peer-to-peer file-sharing networks are currently receiving
much attention as a means of sharing and distributing
information. However, as recent experience shows, the anonymous, open
nature of these networks offers an almost ideal environment for the
spread of self-replicating inauthentic files. We describe an
algorithm to decrease the number of downloads of inauthentic files in
a peer-to-peer file-sharing network that assigns each peer a unique
global trust value, based on the peer's history of uploads. We present
a distributed and secure method to compute global trust values, based
on Power iteration. By having peers use these global trust values to
choose the peers from whom they download, the network effectively
identifies malicious peers and isolates them from the network.
In simulations, this reputation system, called EigenTrust, has been
shown to significantly decrease the number of inauthentic files on the
network, even under a variety of conditions where malicious peers
cooperate in an attempt to deliberately subvert the system.",
URL="http://www2003.org/cdrom/papers/refereed/p446/p446-kamvar"
}
@INPROCEEDINGS{Kang0305:Comparative,
AUTHOR="Ming Kang and Mohamed-Slim Alouini",
TITLE="A Comparative Study on the Performance of {MIMO} {MRC} Systems with and
without Co-Channel Interference",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper presents exact closed-form expressions for the
performance of multiple-input multiple-output (MIMO) systems
employing maximal ratio combining (MRC) in absence and presence of
co-channel interference (CCI). The results are applicable to
systems operating over Rayleigh fading channels and in which the
minimum number of antenna elements at the transmitter and receiver
is $2$. The mathematical formalism is illustrated by some
numerical examples which study the effects of various parameters
on the system performance."
}
@INPROCEEDINGS{Kang0305:Determining,
AUTHOR="Inhye Kang and Hyogon Kim",
TITLE="Determining embryonic connection timeout in stateful inspection",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Purging embryonic connection states after an appropriate time interval is
essential for connection-level monitoring devices such as stateful
firewalls in order to minimize security holes and improve state lookup
performance. This paper investigates what timeout intervals are adequate,
based on the analysis of real-life Internet traces. It reveals that (R+T)
seconds are useful timeout periods where R=0, 3, 9 and 1 <= T <= 2, and
that wide implementation of RFC 2988 is behind the phenomenon."
}
@INPROCEEDINGS{Kang0305:Impact,
AUTHOR="Ming Kang and Mohamed-Slim Alouini",
TITLE="Impact of Correlation on the Capacity of {MIMO} Channels",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Starting from classical multivariate statistical results due to
Khatri and James and dealing with the distributions of certain
quadratic forms in complex Gaussian matrices, we present exact
determinant representations of (i) the moment generating function
(MGF) of the multiple-input-multiple-output (MIMO) channel
capacity and (ii) the outage probability and the capacity
complementary distribution function (CCDF) of MIMO maximal ratio
combining (MRC) systems, both in the correlated Rayleigh fading
environment. We then deduce from (i) both the mean and the
variance of this capacity as well as the Gaussian-approximated
capacity CCDF. The mathematical formalism is illustrated by some
numerical examples that show the impact of various parameters on
the capacity of correlated MIMO channels."
}
@INPROCEEDINGS{Kang0305:Maximizing,
AUTHOR="Intae Kang and Radha Poovendran",
TITLE="Maximizing Static Network Lifetime of Wireless Broadcast Adhoc Networks",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We investigate the problem of energy-efficient broadcast routing over
wireless static adhoc network where host mobility is not involved. We
define the lifetime of a network as the duration of time until the first
node failure due to battery depletion. We provide a globally optimal
solution to the problem of maximizing a static network lifetime through a
graph theoretic approach. We also provide extensive comparative simulation
studies."
}
@INPROCEEDINGS{Kann0303:Sensor,
AUTHOR="Rajgopal Kannan and Sudipta Sarangi and Sitharama Iyengar and Lydia Ray",
TITLE="Sensor-Centric Quality of Routing in Sensor Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Standard embeded sensor nework models emphasize energy efficiency and
distributed decision-making by considering untethered and unattended
sensors. To this we add two constraints - the possibility of sensor
failure and the fact that each sensor must tradeoff its own resource
consumption with overall network objectives. In this paper, we develop
an analytical model of data-centric information routing in sensor networks
under all the above constraints. Unlike existing techniques, we use game
theory to model \textit{intelligent} sensors thereby making our approach
\textit{sensor-centric}. Sensors behave as rational players in an N-player
routing game, where they tradeoff individual communication and other costs
with network wide benefits. The outcome of the sensor behavior is a
sequence of communication link establishments, resulting in routing paths
from reporting to querying
sensors. We show that the optimal routing architecture is the Nash
equilibrium of the N-player routing game and that computing the optimal
paths (which maximizes payoffs of the individual sensors) is $NP$-Hard
with and without data-aggregation. We then develop a game-theoretic metric
called \textit{path weakness} to measure the qualitative performance of
different routing mechanisms. This sensor-centric concept which is based
on the contribution of individual sensors to the overall routing objective
is used to define the \textit{Quality of Routing }(QoR) paths. Simulation
results are used to compare the QoR of different routing paths derived
using various energy constrained sensor routing algorithms."
}
@TECHREPORT{Kann0309:KR,
AUTHOR="Rajgopal Kannan",
TITLE="The KR-Benes Network: A Control-Optimal Rearrangeable Permutation Network
based on K-bounded Permutations",
TYPE="arXiv Report",
NUMBER="cs.NI/0309006",
MONTH=sep,
YEAR=2003,
NOTE="LSU Computer Science Tech Report LSU-CSC-TR03-01",
ABSTRACT="We show that the O(N logN) control complexity of the well known
rearrangeable
Benes network is not optimal for many permutations. We present a novel
rearrangeable network that is permutation-specific control-optimal; it has
the
lowest control complexity for every input permutation. This network is
based on
another network we label KR-Benes which exploits locality properties of
permutations (called K-boundedness) and is derived by making some small
modifications to the Benes. The KR-Benes network has a depth of 2logK +2
stages
and a control complexity of O(N logK). The KR-Benes is superior to the
Benes
from the hardware point of view for K \leq N/\sqrt{8} and has a lower
control
complexity when K \leq N/\sqrt{2}. In this paper, we show that any optimal
network for rearrangeably routing K-bounded permutations must have depth
at
least 2logK + 1. We also provide arguments for conjecturing that the
optimal
network, in fact has 2 logK + 2 stages, and therefore the KR-Benes is
optimal.
Finally, we use the KR-Benes to derive the permutation-specific
control-optimal
network for routing arbitrary permutations. Its control complexity is
superior
to the Benes in most cases and bounded by the Benes in the worst case.",
URL="http://arxiv.org/abs/cs/0309006"
}
@INPROCEEDINGS{Kant0305:Analytic,
AUTHOR="Krishna Kant",
TITLE="An Analytic Model for Peer to Peer File Sharing Networks",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper we introduce a random-graph based model for studying the
evolution of ad hoc peer-to-peer (P2P) communities such as in Gnutella or
Freenet. The proposed random graph model generates a non-uniform graph
and provides control over the nodal degree distribution. We study basic
properties such as reachability from a given node in the network using an
analytical approach. The model can be used in conjunction with a
simulation model to study detailed performance tradeoffs in a P2P
file-sharing network."
}
@INPROCEEDINGS{Kapo0305:Analysis,
AUTHOR="Rohit Kapoor and M.y. Sanadidi and Mario Gerla",
TITLE="An Analysis of Bluetooth Scatternet Topologies",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Bluetooth technology is intended primarily as a replacement of cables
between electronic devices, as in Personal Area Networks (PANs), or for
connecting the components of a computer system. In addition, larger
topologies of so-called scatternets are targeting wider geographical area
applications in factories, warehouses, shopping malls and various sensor
network applications. Though some earlier work has looked at scatternet
formation and scheduling issues, less attention has been given to
optimizing scatternet topologies. Sizing a scatternet in terms of
minimizing the number of piconets has been addressed. We consider in this
paper topological design of scatternets, taking into consideration
application traffic requirements. We study appropriate topologies, and
size the network in terms of piconets. We develop a scatternet queuing
model and use it to compare the delay-throughput characteristics of
various topologies. We find that the best topology is application
dependent. The analytical model is also used to determine the optimal
point to operate a scatternet, i.e., the traffic load that saturates the
network. We validate all our analytical results by simulation experiments,
and find that all analytic results sufficiently match the simulation
results."
}
@INPROCEEDINGS{Kapu0305:Signal,
AUTHOR="Ateet Kapur and Mahesh Varanasi",
TITLE="Signal Design for Bandwidth Efficient Multiple Access with Guaranteed Bit
Error Rate",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The problem of signal design for bandwidth efficient multiple access
is addressed under quality of service (QoS) constraints specified by
(possibly different) BER. Indeed, BER more accurately measures the
performance than the signal-to-interference ratio (SIR) for uncoded
communication. Furthermore, we argue that the asymptotic effective
energy (AEE) faithfully characterizes BER, and we translate the
BER-specified QoS into AEE-specified ones. We then propose a
recursive, greedy algorithm for joint signal design to minimize the
system bandwidth while ensuring that each user achieves its desired
AEE (and hence BER). This algorithm successfully converts excess
power into bandwidth savings, and significantly improves spectral
efficiency over full-rank (e.g. orthogonal) signaling and SIR-based
approaches."
}
@INPROCEEDINGS{Kar0303:Routing,
AUTHOR="Koushik Kar and M. Kodialam and T. v. Lakshman and Leandros Tassiulas",
TITLE="Routing for Network Capacity Maximization in Energy-constrained Ad-hoc
Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We present a new distributed algorithm for routing of messages in
ad-hoc networks where the nodes are energy-constrained. The routing
objective is to maximize the total number of messages that can be
successfully sent over the network without knowing any information
regarding future message arrivals or message generation rates. From a
theoretical perspective, we show that if admission control of messages
is permitted, then the worst-case performance of our algorithm is
within a factor of $O(\log (network size))$ of the best achievable
solution. In other words, our algorithm achieves a logarithmic
competitive ratio. Our approach provides sound theoretical backing for
several observations that have been made by previous researchers.
From a practical perspective, we show by extensive simulations that
the performance of the algorithm is very good even in the absence of
admission control (the admission control being necessary only to prove
the competitive ratio result), and that it also performs better than
previously proposed algorithms for other suggested metrics such
as network lifetime maximization. Our algorithm uses a single shortest
path computation, and is amenable to efficient implementation.
We also evaluate by simulations the performance impact of inexact
knowledge of residual battery energy, and the impact of energy drain
due to dissemination of residual energy information."
}
@ARTICLE{Kar0310:Routing,
AUTHOR="Koushik Kar and Murali Kodialam and T. v. Lakshman",
TITLE="Routing Restorable Bandwidth Guaranteed Connections Using Maximum 2-Route
Flows",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=5,
PAGES="772-781",
MONTH=oct,
YEAR=2003,
REFERENCES=13,
KEYWORDS="disjoint path; restoration; routing; 2-route flow",
ABSTRACT="Routing with service restorability is of much importance in Multi-Protocol
Label Switched (MPLS) networks, and is a necessity in optical networks.
For restoration, each connection has an active path and a link-disjoint
backup path. The backup path enables service restoration upon active path
failure. For bandwidth efficiency, backups may be shared. This requires
that at least the aggregate backup bandwidth used on each link be
distributed to nodes performing route computations. If this information is
not available, sharing is not possible. Also, one scheme in use for
restorability in optical networks is for the sender to transmit
simultaneously on the two disjoint paths and for the receiver to choose
data from the path with stronger signal. This has the advantage of fast
receiver-initiated recovery upon failure but it does not allow backup
sharing. In this paper, we consider the problem of efficient dynamic
routing of restorable connections when backup sharing is not allowed. Our
objective is to be able to route as many connections as possible for
one-at-a-time arrivals and no knowledge of future arrivals. Since sharing
cannot be used for achieving efficiency, the goal is to achieve efficiency
by improved path selection. We show that by using the minimum-interference
ideas used for nonrestorable routing, we can develop efficient algorithms
that outperform previously proposed algorithms for restorable routing such
as routing with the min-hop like objective of finding two disjoint paths
with minimum total hop-count. We present two new and efficient algorithms
for restorable routing without sharing, and one of them requires only
shortest path computations. We demonstrate that both algorithms perform
very well in comparison to previously proposed algorithms.",
URL="http://ieeexplore.ieee.org/iel5/90/27747/01237455.pdf?isNumber=27747\&prod=JNL\&arnumber=1237455\&arSt=+772\&ared=+781\&arAuthor=Kar\%2C+K.\%3B+Kodialam\%2C+M.\%3B+Lakshman\%2C+T.V."
}
@INPROCEEDINGS{Karb0303:Multipoint,
AUTHOR="Pradnya Karbhari and Ellen Zegura and Mostafa Ammar",
TITLE="Multipoint-to-Point Session Fairness in the Internet",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="In the current Internet, many applications start sessions with multiple
connections to multiple servers in order to expedite the reception of
data. One may argue that such aggressive behavior leads to unfair sharing
of bandwidth using the current per-connection rate allocation methods.
Sessions with more connections get a higher total rate than competing
sessions with fewer connections. In this paper, we explore the issue of
fairness of rate allocation from a session point of view. We define a
multipoint-to-point session as a set of point-to-point connections started
from multiple servers to a client in order to transfer an
application-level object. We present session fairness definitions, propose
algorithms to achieve these definitions, and compare the resulting
allocations with the traditional connection fair algorithm. It is clear
from our evaluations that the session-fair algorithms proposed achieve a
more fair distribution of session rates than the connection fair
algorithm, by redistributing the rates claimed by sessions with more
connections. We present some initial thoughts on the challenges involved
in implementing the session-fair algorithms proposed."
}
@ARTICLE{Karb0304:Comments,
AUTHOR="Andrzej Karbowski",
TITLE="Comments on Optimization Flow Control, {I:} Basic Algorithm and Convergence",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=2,
PAGES="338-339",
MONTH=apr,
YEAR=2003,
REFERENCES=1,
KEYWORDS="asynchronous algorithm; congestion pricing; convergence; optimization flow
control",
ABSTRACT="The author comments on an error in Low and Lapsley's article (see ibid.,
vol.7, p.861-74, Dec. 1999). Because of this error, the proof of the
Theorem 2 presented in the article is incomplete and some assessments are
wrong. The author proposes a correction to this proof.",
URL="http://ieeexplore.ieee.org/iel5/90/26877/01194828.pdf?isNumber=26877\&prod=JNL\&arnumber=1194828\&arSt=+338\&ared=+339\&arAuthor=Karbowski\%2C+A."
}
@ARTICLE{Karo0312:Prevention,
AUTHOR="Mark Karol and S. Jamaloddin Golestani and David Lee",
TITLE="Prevention of Deadlocks and Livelocks in Lossless Backpressured Packet
Networks",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=6,
PAGES="923-934",
MONTH=dec,
YEAR=2003,
REFERENCES=14,
KEYWORDS="backpressure; bounded delay; congestion control; deadlock prevention;
livelock prevention; lossless networks",
ABSTRACT="No packets will be dropped inside a packet network, even when congestion
builds up, if congested nodes send backpressure feedback to neighboring
nodes, informing them of unavailability of buffering capacity-stopping
them from forwarding more packets until enough buffer becomes available.
While there are potential advantages in backpressured networks that do not
allow packet dropping, such networks are susceptible to a condition known
as deadlock in which throughput of the network or part of the network goes
to zero (i.e., no packets are transmitted). In this paper, we describe a
simple, lossless method of preventing deadlocks and livelocks in
backpressured packet networks. In contrast with prior approaches, our
proposed technique does not introduce any packet losses, does not corrupt
packet sequence, and does not require any changes to packet headers. It
represents a new networking paradigm in which internal network losses are
avoided (thereby simplifying the design of other network protocols) and
internal network delays are bounded.",
URL="http://ieeexplore.ieee.org/iel5/90/28078/01255430.pdf?isNumber=28078\&prod=JNL\&arnumber=1255430\&arSt=+923\&ared=+934\&arAuthor=Karol\%2C+M.\%3B+Golestani\%2C+S.J.\%3B+Lee\%2C+D."
}
@INPROCEEDINGS{Karr0305:Design,
AUTHOR="Ramesh Karri and Piyush Mishra",
TITLE="Design of energy efficient secure wireless networks using network
simulators",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Of late the role of network simulators in research and development of
wireless networks has grown considerably due to their increasing size and
complexity. This paper explores the opportunities of extending the use of
network simulators to designing energy-efficient secure wireless networks.
We identify various sources of energy consumption during a secure wireless
session and using a mobile test bed develop and validate accurate WLAN
energy models within the OPNET® network simulator framework. These
models are then extended to study the performance characteristics of
larger networks under varying channel conditions and also to study the
impact of adapting the techniques proposed in [6, 31] for designing
energy-efficient WTLS security protocol on optimizing the energy consumed
by IPSec secure sessions."
}
@INPROCEEDINGS{Karr0305:Multipath,
AUTHOR="Roger Karrer",
TITLE="Multipath streaming in best-effort networks",
BOOKTITLE="ICC 2003 - Global Services and Infrastructure for Next Generation Networks",
ADDRESS="Anchorage, Alaska",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Multipath streaming is used by resource intensive applications to stream
their data over multiple, disjoint paths, thereby cumulating the resources
of the different subpaths.
The trend towards application-layer implementations of communication
protocols allows the deployment of a multipath streaming protocol in the
current Internet. However, because resource availability fluctuates in the
Internet, a multipath streaming protocol must be combined with other
mechanisms to address these fluctuations, e.g., adaptation. This paper
describes two approaches to combine adaptation and multipath streaming.
The first approach separates the two mechanisms and thereby
allows a multipath streaming that is transparent to the application,
whereas the other combines the two mechanisms in the application context.
This paper compares the two approaches along various parameters. It shows
that the first approach is easier to deploy from an engineering
point of view, but the separation of multipath streaming and adaptation
yields significant drawbacks. Especially, synchronization problems due to
different latencies along the paths that form the multipath setup may lead
to a significant drop in the quality of the data."
}
@INPROCEEDINGS{Kary0305:Binary,
AUTHOR="George Karystinos and Dimitris Pados",
TITLE="Binary {CDMA} Signature Sets with Concurrently Minimum
Total-Squared-Correlation and Maximum-Squared-Correlation",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We derive lower bounds on the maximum-squared-correlation (MSC) of
binary antipodal signature sets for any number of signatures $K$ and
any signature length $L$ with $K \leq L$ (underloaded systems). We
establish the tightness of the bounds for all cases except
$K = L \equiv 1 \text{ (mod 4)}$ and we prove that the minimum
total-squared-correlation (TSC) binary antipodal signature sets that
were recently designed are, in fact, doubly optimal for underloaded
systems: both their TSC and MSC are minimum."
}
@INPROCEEDINGS{Kase0303:Congestion,
AUTHOR="Sneha Kasera and Ramachandran Ramjee and Sandra Thuel and Xin Wang",
TITLE="Congestion Control Policies for IP-based {CDMA} Radio Access Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="As CDMA-based cellular networks mature, the current point-to-point links
used in connecting base stations to network controllers will
evolve to an IP-based Radio Access Network (RAN) for reasons of lower
cost due to statistical multiplexing gains, better scalability and
reliability, and the projected growth in data applications. While
statistical multiplexing gains of an IP RAN results in cost savings,
there is a price to be paid, namely, congestion. In this paper we
propose and evaluate three congestion control mechanisms, admission
control, diversity control, and router control, to maximize network
capacity while maintaining good voice quality. We first propose two new
enhancements to CDMA call admission control so that a unified view of both
IP RAN and air interface resources are taken into consideration. We then
introduce a novel technique called diversity control to exploit the
soft-handoff feature of CDMA networks and drop selected legs to degrade
quality gracefully during congestion. Finally, we also study the impact of
router control using active queue management techniques to reduce delay and
minimize bursty and correlated losses. Using simulations of a large mobile
network, we show that the three different control mechanisms can help
gracefully manage congestion overload of between 10-40\% in the IP RAN."
}
@INPROCEEDINGS{Kaur0303:Core,
AUTHOR="Jasleen Kaur and Harrick Vin",
TITLE="Core-stateless Guaranteed Throughput Networks",
BOOKTITLE="IEEE Infocom 2003",
MONTH=mar,
YEAR=2003,
ABSTRACT="End-to-end throughput guarantee is an important service semantics that
network providers would like to offer to their customers. A network
provider can offer such service semantics by deploying a network where
each router employs a fair packet scheduling algorithm to allocate
network bandwidth to competing flows. Unfortunately, these scheduling
algorithms require every router to maintain per-flow state and perform
per-packet flow classification; these requirements limit the
scalability of the routers.
In this paper, we propose the
Core-stateless Guaranteed Throughput (CSGT) network
architecture---the first work-conserving architecture
that, without maintaining per-flow state or performing per-packet flow
classification in core routers, provides to flows throughput guarantees
that are within an additive constant of what is attained by a network of
core-stateful fair routers."
}
@INPROCEEDINGS{Kaur0308:BANANAS,
AUTHOR="Hema Kaur and Shiv Kalyanaraman and Andreas Weiss and Shifalika Kanwar and
Ayesha Gandhi",
TITLE="{BANANAS:} An Evolutionary Framework for Explicit and Multipath Routing in
the Internet",
BOOKTITLE="SIGCOMM FDNA Workshop",
ORGANIZATION="ACM",
ADDRESS="Karlsruhe, Germany",
MONTH=aug,
YEAR=2003,
KEYWORDS="routing; MPLS; source routing",
ABSTRACT="Today the Internet offers a single path between end-systems even though it
intrinsically has a large multiplicity of paths. This paper proposes an
evolutionary architectural framework ``BANANAS'' aimed at simplifying the
introduction of multipath routing in the Internet. The framework starts
with the observation that a path can be encoded as a short hash
(``PathID'') of a sequence of globally known identifiers. The PathID
therefore has global significance (unlike MPLS or ATM labels). This
property allows multipath capable nodes to {\em autonomously} compute
PathIDs in a partially upgraded network without requiring an explicit
signaling protocol for path setup. We show that this framework allows the
introduction of sophisticated explicit routing and multipath capabilities
within the context of widely deployed connectionless routing protocols
(e.g. OSPF, IS-IS, BGP) or overlay networks. We establish these
characteristics through the development of PathID encoding and
route-computation schemes. The BANANAS framework also allows considerable
flexibility in terms of architectural function placement and complexity
management. To illustrate this feature, we develop an efficient
variable-length hashing scheme that moves control-plane complexity and
state overheads to network edges, allowing a very simple interior node
design. All the schemes have been evaluated using both sizable SSFNet
simulations and Linux/Zebra implementation evaluated on Utah's Emulab
testbed facility.",
URL="http://www.ecse.rpi.edu/Homepages/shivkuma/research/papers-rpi.html#mgmt"
}
@INPROCEEDINGS{Kawa0303:Power,
AUTHOR="Vikas Kawadia and P. r. Kumar",
TITLE="Power Control and Clustering in Ad Hoc Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="In this paper, we consider the problem of power control when nodes are
non-homogeneously dispersed in space. In such situations, one seeks to
employ per packet power control depending on the source and destination of
the packet. This gives rise to a joint problem which involves not only
power control but also clustering. We provide three solutions for joint
clustering and power control.
The first protocol, CLUSTERPOW, aims to increase the network capacity by
increasing spatial reuse. We provide a simple and modular architecture to
implement CLUSTERPOW at the network layer.
The second, Tunnelled CLUSTERPOW, allows a finer optimization by using
encapsulation, but we do not know of an efficient way to implement it.
The last, MINPOW, whose basic idea is not new, provides an optimal routing
solution with respect to the total power consumed in communication. Our
contribution includes a clean implementation of MINPOW at the network
layer without any physical layer support.
We establish that all three protocols ensure that packets ultimately reach
their intended destinations. We provide a software architectural framework
for our implementation as a network layer protocol. The architecture works
with any routing protocol, and can also be used to implement other power
control schemes. Details of the implementation in Linux are provided."
}
@INPROCEEDINGS{Köpk0303:Chaotic,
AUTHOR="Andreas {Köpke} and Andreas Willig and Holger Karl",
TITLE="Chaotic Maps as Parsimonious Bit Error Models of Wireless Channels",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="The error patterns of a wireless digital communication channel can
be described by looking at consecutively correct or erroneous bits
(runs and bursts) and by the distribution function of these run and
burst lengths. A number of stochastic models exist that can be used
to describe these distributions for wireless channels, e.g., the
Gilbert-Elliot model.
When attempting to apply these models to actually measured error
sequences, they fail: Measured data gives raise to two essentially
different types of error patterns which can not be described using
simple error models like Gilbert-Elliot. These two types are
distinguished by their run length distribution; one type in
particular is characterized by a heavy-tailed run length
distribution. This paper shows how the chaotic map model can
be used to describe these error types and how to parameterize this
model on the basis of measurement data. We show that the chaotic map
model is a superior stochastic bit error model for such channels by
comparing it with both simple and complex error models. Chaotic maps
achieve a modeling accuracy that is far superior to that of simple
models and competitive with that of much more complex models,
despite needing only six parameters. Furthermore, these parameters
have a clear intuitive meaning and are amenable to direct
manipulation.
In addition, we show how the second type of channels can be well
described by a semi-Markov model using a quantized lognormal state
holding time distribution."
}
@INPROCEEDINGS{Kell0310:Preference,
AUTHOR="Wolfgang Kellerer and Matthias Wagner and Wolf-Tilo Balke",
TITLE="Preference-based Session Management for Personalized Services",
BOOKTITLE="International Workshop on Mobile Multimedia Communications (MoMuC)",
ADDRESS="Munich, Germany",
MONTH=oct,
YEAR=2003,
REFERENCES=13,
KEYWORDS="SIP; caller preferences",
ABSTRACT="The increasing variety of mobile multimedia services raise the need for
mechanisms to select those services that
best match individual user requirements and allow for service
customization. In this paper we describe an advanced
concept for service personalization in next-generation IP-based mobile
systems. Our approach extends
conventional service management by introducing a preference order on the
available service features according to
the specific demands of a user. Furthermore, we exploit the fact that in
current IP-based mobile communication
systems application layer signaling messages traverse several network
functional entities between client and
server application. Our architectural solution based thereon comprises a
stepwise refinement of profiles and preferences
including an early matchmaking to service capabilities.",
URL="http://www.cdtm.de/momuc/"
}
@ARTICLE{Kent0309:Securing,
AUTHOR="Stephen Kent",
TITLE="Securing the Border Gateway Protocol",
JOURNAL="Internet Protocol Journal",
VOLUME=6,
NUMBER=3,
MONTH=sep,
YEAR=2003,
REFERENCES=15,
ABSTRACT="Routing in the public Internet is based on a distributed system composed of
many routers, grouped into management domains called Autonomous Systems
(ASes). ASes are operated by Internet Service Providers (ISPs) and by
multihomed subscribers. (Throughout the remainder of this article, for
brevity, we will talk in terms of ISPs, usually omitting references to
multihomed subscribers.) Routing information is exchanged between ASes
using the Border Gateway Protocol (BGP) [1] , via UPDATE messages.",
URL="http://www.cisco.com/warp/public/759/ipj\_6-3/ipj\_6-3\_bgp1.html"
}
@ARTICLE{Keon0302:Optimal,
AUTHOR="Neil Keon and G. Anandalingam",
TITLE="Optimal Pricing for Multiple Services in Telecommunications Networks
Offering Quality-of-Service Guarantees",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=1,
PAGES="66-80",
MONTH=feb,
YEAR=2003,
REFERENCES=35,
KEYWORDS="economics; network design; pricing; quality of service (QoS)",
ABSTRACT="We consider pricing for multiple services offered over a single
telecommunications network. Each service has quality-of-service (QoS)
requirements that are guaranteed to users. Service classes may be defined
by the type of service, such as voice, video, or data, as well as the
origin and destination of the connection provided to the user. We
formulate the optimal pricing problem as a nonlinear integer expected
revenue optimization problem. We simultaneously solve for prices and the
resource allocations necessary to provide connections with guaranteed QoS.
We derive optimality conditions and a solution method for this class of
problems, and apply to a realistic model of a multiservice communications
network.",
URL="http://ieeexplore.ieee.org/iel5/90/26510/01180546.pdf?isNumber=26510\&prod=JNL\&arnumber=1180546\&arSt=+66\&ared=+80\&arAuthor=Keon\%2C+N.J.\%3B+Anandalingam\%2C+G."
}
@INPROCEEDINGS{Kess0303:Guaranteed,
AUTHOR="Isaac Kesslasy and M. Kodialam and T. v. Lakshman and Dimitrios Stiliadis",
TITLE="On Guaranteed Smooth Scheduling For Input-Queued Switches",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Input-queued switches are used extensively in the design of
high-speed routers. As switch speeds and sizes increase, the
design of the switch scheduler becomes a primary challenge,
because the time interval for the matching computations needed for
determining switch configurations becomes very small. Possible
alternatives in scheduler design include increasing the scheduling
interval by using envelopes \cite{KLS}, and using a frame-based
scheduler that guarantees fixed rates between input-output pairs.
However, both these alternatives have significant jitter
drawbacks: the jitter increases with the envelope size in the
first alternative, and previously-known methods do not guarantee
tight jitter bounds in the second.
In this paper, we propose a hybrid approach to switch scheduling.
Traffic with tight jitter constraints is first scheduled using a
frame-based scheduler that achieves low jitter bounds.
Jitter-insensitive traffic is later scheduled using an
envelope-based scheduler. The main contribution of this paper is a
scheduler design for generating low-jitter schedules. The
scheduler uses a rate matrix decomposition designed for low jitter
and different from the minimum-bandwidth Birkhoff-Von Neumann (BV)
decomposition. In addition to generating low-jitter schedules,
this decomposition yields fewer switch configuration matrices
($O(n)$) than the BV decomposition ($O(n^2)$), and so uses far
less high-speed switch memory. We develop an efficient algorithm
for decomposing the rate matrix and for scheduling the permutation
matrices. We prove that our low-jitter algorithm has an $O(log
n)$ factor bound on its bandwidth consumption in comparison to the
minimum-bandwidth BV decomposition. Experimentally, we find that
the bandwidth increase in practice is much lower than the
theoretical bound. We also prove several related performance
bounds for our scheduler. Finally, we propose a practical
algorithm for bandwidth-guaranteed algorithm, and show how our
findings could even be extended to systems with large tuning time."
}
@INPROCEEDINGS{Key0303:Probing,
AUTHOR="Peter Key and Laurent Massoulie",
TITLE="Probing strategies for distributed admission control in large and small
scale systems",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="The aim of this article is to propose and analyse measurement-based
admission control schemes. We distinguish between large-scale and
small-scale systems, where scale is measured in the number of concurrent
applications that can run simultaneously. For large scale systems, we show
that simple end-user probing strategies, based on ECN-type feedback
provided by the network, achieve a good utilisation/quality trade-off. We
explicitly take account of feedback delay, and use limiting results for
assessing performance. For small-scale systems, the previous strategies
are no longer adapted. We therefore propose alternative probing
strategies, which rely on more sophisticated feedback synthesised by the
bottleneck."
}
@INPROCEEDINGS{Khal0312:Novel,
AUTHOR="Ahmad Khalil and Antonis Hadjiantonis and Georgios Ellinas and Mohamed Ali",
TITLE="A Novel IP-Over-Optical Network Interconnection Model for the
Next-Generation Optical Internet",
BOOKTITLE="Globecom 2003 - General Conference",
PAGES="3984-3989",
MONTH=dec,
YEAR=2003,
KEYWORDS="integrated routing; overlay routing;IP over WDM; unified control plane",
ABSTRACT="This work proposes a novel IP-over-optical network interconnection model
that takes the best features from both the overlay and peer models while
avoiding their limitations. Specifically, the proposed model utilizes an
optical layer-based unified control plane that manages both routers and
optical switches (analogous to the peer model), while still retaining the
complete separation between the optical and IP layers of the overlay
model. This is achieved by shifting the control plane functionalities
previously associated with the IP layer to the IP/MPLS-aware, non-traffic
bearing OXC controller modules located within the optical domain. In this
architecture, better decisions can be made for provisioning and managing
network resources, leading to their more efficient use. Based on the
proposed model, an integrated dynamic routing algorithm that takes into
account the combined topology and resource usage information at both the
IP and optical layers will be developed."
}
@INPROCEEDINGS{Khan0309:Performance,
AUTHOR="Shoaib Khan",
TITLE="Performance of Multiple Description Streaming in Peer-to-Peer and Content
Delivery 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="In this paper we examine the performance of Peer-to-Peer (P2P) media
streaming using Multiple Description Coding (MDC) and compare it with that
of a Content Delivery Network. In both the approaches multiple servers
simultaneously serve one requesting client with complementary
descriptions. This approach improves reliability and decreases the data
rate a server has to provide. If at least one description is received
before the playout deadline, the receiver is capable of displaying the
video sequence. The more descriptions are available for decoding, the
better the video quality. We have implemented both approaches in the ns-2
network simulator. The experimental results indicate that performance
indicators, such as packet loss, response time, and the number of
decodable video frames for MDC-based streaming in a P2P network and CDN
are comparable, despite the high degree of unreliability of the P2P
network."
}
@ARTICLE{Khay0304:Fitting,
AUTHOR="Rachid Khayari and Ramin Sadre and Boudewijn Haverkort",
TITLE="Fitting world-wide web request traces with the EM-algorithm",
JOURNAL="Performance Evaluation",
VOLUME=52,
NUMBER="2-3",
PAGES="175-191",
MONTH=apr,
YEAR=2003,
REFERENCES=22,
KEYWORDS="World wide web; Heavy-tailed distributions; Hyper-exponential
distributions; ML-fitting; EM-fitting; Queuing analysis; Traffic
characterisation",
ABSTRACT="In recent years, various researchers have shown that network traffic that
is due to world-wide web transfers shows characteristics of
self-similarity and it has been argued that this can be explained by the
heavy-tailedness of many of the involved distributions. Considering these
facts, developing methods that are able to handle self-similarity and
heavy-tailedness is of great importance for network capacity planning
purposes.
However, heavy-tailed distributions cannot be used so easily for
analytical or numerical evaluation studies. To overcome this problem, in
this paper, we approximate the empirical distributions by analytically
more tractable, that is, hyper-exponential distributions. For that
purpose, we present a new fitting algorithm based on the
expectation-maximisation and show it to perform well both for pure traffic
statistics as well as in queuing studies.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-47JCTHW-1-7F\&\_cdi=5663\&\_orig=browse\&\_coverDate=04\%2F30\%2F2003\&\_sk=999479997\&view=c\&wchp=dGLbVlb-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=c40499ecc44a5f8724065ef00f8e3348\&ie=f.pdf"
}
@INPROCEEDINGS{Kher0303:Closed,
AUTHOR="Arzad Kherani and Anurag Kumar",
TITLE="Closed Loop Analysis of the Bottleneck Buffer under Adaptive Window
Controlled Transfer of HTTP-Like Traffic",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We consider an Internet link carrying http-like traffic, i.e.,
transfer of finite volume files start at random time instants. These
file transfers are controlled by an adaptive window protocol (AWP); an
example of such a protocol is TCP.
We provide analysis for the auto-covariance function of the AWP
controlled traffic into the link's buffer; this traffic, in general,
is \emph{not} an on-off process. The analysis establishes that, for
Pareto distributed file sizes with infinite second moment, the traffic
into the link buffer is long range dependent (LRD).
We also develop an analysis for obtaining the stationary distribution
of the link buffer occupancy under an AWP controlled transfer of files
sampled from some distribution. The analysis provides a necessary and
a sufficient condition for the finiteness of the mean link buffer
content; these conditions have explicit dependence on the AWP used and
the file size distribution. This establishes the sensitivity of the
buffer occupancy process to the file size distribution.
Combining the results from the above analyses, we provide an example
in which the closed loop control of an AWP results in finite mean link
buffer occupancy even though the file sizes are Pareto distributed
(with infinite second moment), and the traffic into the link buffer is
long range dependent.
The significance of this work is threefold: (i) it provides a
framework for analysing various processes related to the link buffer
under AWP controlled transfer of files with a general file size
distribution; (ii) it indicates that the buffer behaviour in the
Internet may not be as poor as predicted from an open loop analysis of
a queue fed with LRD traffic; and (iii) it shows that the buffer
behaviour (and hence the throughput performance for finite buffers) is
sensitive to the distribution of file sizes ."
}
@INPROCEEDINGS{Kies0305:Performance,
AUTHOR="Mario Kiessling and Joachim Speidel and Norbert Geng",
TITLE="Performance analysis of {MIMO} maximum likelihood receivers with channel
correlation, colored Gaussian noise, and linear prefiltering",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We present an analytical performance evaluation of a Rayleigh fading MIMO
link with matrix transmit prefiltering, channel correlation at transmitter
and receiver, and spatially colored Gaussian noise for arbitrary
two-dimensional signal constellations based on a tight union bound of the
pairwise error probabilities. Asymptotic results for the high SNR region
allow a simple characterization of the correlation effects and a
quantification of the SNR penalty. It is shown that the diversity level of
ML detection is unaffected by fading correlation and demonstrated that the
effects of transmit and receive correlation may be assessed independently
with the standard channel model. Prefiltering algorithms based on
long-term stable channel correlation characteristics are derived using the
framework at hand. Simulation results illustrate the effectiveness of
transmit prefilter designs based on the performance bound."
}
@INPROCEEDINGS{Kim0303:Optimal,
AUTHOR="Taehyun Kim and Mostafa Ammar",
TITLE="Optimal Quality Adaptation for {MPEG-4} Fine-Grained Scalable Video",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="The dynamic behavior of the Internet's transmission resources makes it
difficult to provide perceptually good quality of streaming video. MPEG-4
Fine-Grained Scalable coding has been proposed to deal with this problem by
distributing the data in base and enhancement layers over a wide range of
bit rates. However, video encoded to provide consistent perceptual
quality also exhibits significant data rate variability. We are,
therefore, faced with the problem of trying to accommodate the mismatch
between the available bandwidth variability and the encoded video
variability. In this paper, we investigate quality adaption of layered
VBR video generated by MPEG-4 FGS. Our goal is to develop a layer
adaptation scheme that maximizes perceptual video quality through
minimizing quality variation while at the same time increasing the usage
of available bandwidth. We develop an optimal adaptation scheme and an
online heuristic based on whether the network conditions are known a
priori. Through a set of experiments we consider the performance of our
schemes over variability as may be exhibited by running over TCP or
TFRC/UDP. Our results show that the online heuristic as well as the
optimal adaptation algorithm are capable of providing reasonably
consistent video quality and at the same time maintain high utilization of
available bandwidth."
}
@INPROCEEDINGS{Kim0305:Authentication,
AUTHOR="Hahnsang Kim",
TITLE="Authentication",
BOOKTITLE="International Conference on Communications",
ADDRESS="Anchorage, Alaska",
MONTH=may,
YEAR=2003
}
@INPROCEEDINGS{Kim0305:Bandwidth,
AUTHOR="Minjung Kim and John Copeland",
TITLE="Bandwidth Sensitive Caching for Video Streaming Application",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Popularity of the Internet and the availability of broadband links (e.g.,
xDSL and Cable) to residential consumers have initiated a demand for high
quality video streaming. In video-on-demand-like (VoD) applications, a
server responds to the client's request by streaming a multimedia object.
However, the delivered media quality is usually limited by the
lowest-bandwidth link on the network path to the client. An approach that
stores multi-rate (scalable) video sequence at the proxies can enhance the
video quality and bandwidth efficiency. In this paper, we present a
bandwidth sensitive caching (BSC) strategy where variable-rate streams are
cached into proxies in order to maximize the perceived video signal
quality. The proxies determine the optimum rate at which a video needs to
be stored base on the client capabilities and network link characteristics.
Simulation results show that the proposed BSC algorithm is adaptive and
robust to change in delivery condition, yet it is still simple and
efficient for deployment onto proxies."
}
@INPROCEEDINGS{Kim0305:Difference,
AUTHOR="Young Gil Kim and Sang Wu Kim",
TITLE="Difference Threshold Test for $M$-ary Orthogonal {FSK} Signaling in
Rayleigh Fading Channels",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We present the difference threshold test (DTT)
for $M$-ary orthogonal frequency shift keying (FSK) signaling
in Rayleigh flat fading channels. The
proposed DTT declares an erasure whenever the difference between the
largest and the second largest of the energy detector outputs does
not exceed a fixed threshold. We show that the DTT is
an approximation of the Bayesian erasure test, but provides almost the
same performance as the Bayesian erasure test. For (7,3) and (31,15)
Reed-Solomon (RS)-coded systems, the DTT provides power gains
of 0.8 dB and 0.4 dB over the ratio threshold test (RTT), respectively. We
prove that the limiting performance of the DTT approaches that of the RTT
for
very large $M$."
}
@INPROCEEDINGS{Kim0305:Dynamic,
AUTHOR="Dong Kim and Ekram Hossain and Vijay Bhargava",
TITLE="Dynamic Rate and Power Adaptation Under Multiple {SIR} Constraints in
Cellular {VSF} {WCDMA} Networks",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="A novel dynamic joint rate and power adaptation framework is proposed for
downlink
data transmission in a multi-cell variable spreading factor (VSF) WCDMA
system
where the different classes of users have different signal-to-interference
ratio
(SIR) requirements. Based on a general downlink SIR model, the problem of
optimal
dynamic rate and power adaptation under multiple SIR constraints is also
formulated, for which the rate and power allocation can be found by an
exhaustive
search. Performance of the dynamic joint rate and power adaptation under
the
proposed framework is evaluated under random micro-mobility model with
uncorrelated long-term fading and a directional micro-mobility model with
correlated long-term fading in a cellular WCDMA environment for both the
homogeneous (or uniform) and the non-homogeneous (or non-uniform) traffic
load
scenarios."
}
@INPROCEEDINGS{Kim0305:Generalized,
AUTHOR="Sang Wu Kim and Young Gil Kim and Marvin Simon",
TITLE="Generalized Selection Combining Based on the Log-Likelihood Ratio",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We propose a generalized
selection combining (GSC) in which $M$ diversity branches
providing the largest magnitude of log-likelihood ratio (LLR) are
selected and combined. The bit error probability provided by
LLR-based GSC serves as a lower bound on the bit error probability
provided by {\it any} GSC techniques. We also propose a suboptimal
GSC based on a noncoherent envelope detection. We derive the bit
error probability with LLR-based and envelope-based GSC techniques
and examine their power gains over the conventional SNR-based GSC
technique. We show that the bit error probability with maximum
ratio combining (MRC) of $L$ branches is identical to that with
LLR-based GSC of $L/2$ branches."
}
@INPROCEEDINGS{Kim0305:Performance,
AUTHOR="Yoohwan Kim",
TITLE="Performance of Exhaustive Matching Algorithms for Input-Queued Switches",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Virtual output queue (VOQ) architecture is commonly used for avoiding
head-of-line blocking in input-queued switches. Many algorithms have been
developed for transferring the cells from the VOQs to the output ports.
Traditional iterative algorithms such as iSLIP and DRRM, achieve 100\%
throughput under uniform traffic. But under non-uniform traffic,
throughput drops significantly. Recently, a new paradigm of exhaustive
matching (EM) has been introduced for handling non-uniform traffic while
preserving the complexity of traditional iterative algorithms. In EM, a
VOQ is served continuously until it becomes empty. Only the input ports
that have finished serving a VOQ look for a new match. This strategy
produces very good throughput and delay performance in uniform and
non-uniform traffic. However under some traffic patterns, there is a
starvation problem when a VOQ occupies an output port for an extended
period of time. This problem can be eliminated by providing a priority
service for a VOQ that has waited an excessively long time. The resulting
algorithm, prioritized EM (PEM), eliminates starvation and achieves very
high throughput for many traffic patterns."
}
@INPROCEEDINGS{Kim0305:Reduced,
AUTHOR="Sooyoung Kim",
TITLE="Reduced search {SOVA} for block turbo codes",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we propose an efficient reduced search SOVA (soft output
Viterbi algorithm) for block turbo code. The decoder selects a part of
existing paths using the statistics of the path metrics in order to reduce
the complexity. In addition, we compensate the performance degradation
incurred from too optimistically estimated soft output values at the
parity part of the trellis, so that the performance of the reduced search
decoder almost approximates that of the full search decoder. From the
simulation results investigated in this paper, the proposed reduced search
method can reduce about an order of complexity with just about 0.1dB
performance degradation in coding gain."
}
@INPROCEEDINGS{Kim0306:Dynamic,
AUTHOR="Taehyun Kim and Jack Brassil",
TITLE="Dynamic Program Insertion in High Quality Video over {IP}",
BOOKTITLE="ACM NOSSDAV 2003",
ADDRESS="Monterey, California, USC",
DAYS=1,
MONTH=jun,
YEAR=2003,
ABSTRACT="We introduce an overlay network architecture and signaling mechanism
that permits program insertions in live, high quality video streams
transmitted over IP networks. We describe the implementation of an
application proxy that dynamically inserts pre-recorded video programs
into NTSC D1 quality Motion-JPEG streams with no visible artifacts.
As increases in computing power further enable the modification of
video during transport, new services such as personalized commercial
advertisement insertions promise to make IP distribution an attractive
alternative to conventional broadcast network distribution."
}
@ARTICLE{Kim0306:Performance,
AUTHOR="Hakyong Kim and Kiseon Kim",
TITLE="Performance Analysis of the Multiple Input-Queued Packet Switch With the
Restricted Rule",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=3,
PAGES="478-487",
MONTH=jun,
YEAR=2003,
REFERENCES=56,
KEYWORDS="multiple input queueing (MIQ); restricted rule; free rule",
ABSTRACT="The multiple input-queued (MIQ) switch is the switch which manages multiple
(m) queues in each input port, each of which is dedicated to a group of
output ports. Since each input port can switch up to m cells in a time
slot, one from each queue, it hardly suffers from the head-of-line (HOL)
blocking which is known to be the decisive factor limiting the throughput
of the single input-queued (SIQ) switch. As a result, the MIQ switch
guarantees enhanced performance characteristics as the number of queues m
in an input increases. However, the service of multiple cells from an
input could cause internal speedup or expansion of the switch fabric,
diluting the merit of high-speed operation in the conventional SIQ scheme.
The restricted rule is contrived to circumvent this side effect by
regulating the number of cells switched from an input port. We analyze the
performance of the MIQ switch employing the restricted rule. For the switch
using the restricted rule, the closed formulas for the throughput bound,
the mean cell delay and average queue length, and the cell loss bound of
the switch are derived as functions of m, by generalizing the analysis for
the SIQ switch by J.Y. Hui and E. Arthurs (see IEEE J. Select. Areas
Commun., vol.SAC-5, p.1262-73, 1987).",
URL="http://ieeexplore.ieee.org/iel5/90/27187/01208307.pdf?isNumber=27187\&prod=JNL\&arnumber=1208307\&arSt=+478\&ared=+487\&arAuthor=Hakyong+Kim\%3B+Kiseon+Kim"
}
@ARTICLE{Kim0307:Optimal,
AUTHOR="Jae-Hoon Kim and Yong-Joo Chung and Dong-Wan Tcha",
TITLE="Optimal setup of interference threshold in a multi-cell {WCDMA} environment",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=12,
PAGES="1415-1418",
MONTH=jul,
YEAR=2003,
REFERENCES=6,
KEYWORDS="Admission Control; Multi-cell; WCDMA; Multimedia",
ABSTRACT="The cell capacity of a CDMA system is mainly determined by the sum of
interferences generated by call connections. Focusing on downlink
interferences in a WCDMA system, we address a threshold-type call control
scheme. Finding the characteristic pattern of an expected cell-throughput,
we formulate a mathematical program maximizing the system throughput. The
solution shows the optimal interference threshold value for each cell,
which also demonstrates the effects of allowing differences in thresholds
among cells",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-48643D2-1-26\&\_cdi=5624\&\_orig=browse\&\_coverDate=07\%2F21\%2F2003\&\_sk=999739987\&view=c\&wchp=dGLbVlb-zSkWW\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=4869cd0bd6b79cb48a4a8b6993a495b1\&ie=f.pdf"
}
@INPROCEEDINGS{Kim0309:Comparison,
AUTHOR="Daejoong Kim and Nick Maxemchuk",
TITLE="A Comparison of Flooding and Random Routing in Mobile Ad Hoc Networks",
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="Mobile ad hoc networks usually use various forms of flooding to discover
the location and route of a node or to diffuse a given message. Flooding
is useful because it finds a good path to a destination or quickly
diffuses the message all over the network. With the flooding, however,
also comes the problem of propagating many unnecessary messages throughout
the network. In this paper, first, we propose a flooding on the arms of
hexagon that significantly reduces redundant messages. It is shown that
the efficiency of the hexagon flooding reaches about 68\% of the
upper-bound efficiency of flooding. Secondly, we analyze random routing on
the arms of hexagon that uses fewer messages to locate a destination than
flooding. Assuming that a node has first-order neighbor knowledge, the
average number of messages to locate a destination can be reduced to
one-third of flooding. As the order of neighbor knowledge increases,
random routing can further reduce unnecessary messages."
}
@ARTICLE{Kim0309:Pipelined,
AUTHOR="Byung-yeob Kim and Yoon-Hwa Choi",
TITLE="A pipelined routing lookup scheme with fast updates",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=14,
PAGES="1594-1601",
MONTH=sep,
YEAR=2003,
REFERENCES=12,
KEYWORDS="Forwarding engine; IP route lookup; Fast updates; Bounded update time",
ABSTRACT="Most of the existing IP address lookup schemes emphasize the table lookups
with little attention to table updates. Updating the routing table often
requires a considerable time overhead, especially for gigabit backbone
routers. This paper presents a high-speed lookup scheme with a small
bounded update time for IP forwarding engines in IP routers. It performs
one IP address lookup per memory access by employing memory access
pipelining and updates the table in the time bounded by the IP packet
interarrival time on a gigabit link, regardless of the size of the
database. The resulting design requires manageably small memories to be
implemented using current SRAM technology.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-476TH6K-2-D\&\_cdi=5624\&\_orig=browse\&\_coverDate=09\%2F01\%2F2003\&\_sk=999739985\&view=c\&wchp=dGLbVzb-zSkWW\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=8b879a0f6bae609ab97822a3c2c9cc76\&ie=f.pdf"
}
@ARTICLE{Kim0311:Asymptotic,
AUTHOR="Bara Kim and Jeongsim Kim and In-Suk Wee and Bong Choi",
TITLE="Asymptotic analysis of loss probability in a finite queue where one packet
occupies as many places as its length",
JOURNAL="Performance Evaluation",
VOLUME=54,
NUMBER=3,
PAGES="209-223",
MONTH=nov,
YEAR=2003,
REFERENCES=11,
KEYWORDS="Asymptotic analysis; Packets of variable length; IP packet; IP
switch/router; Discrete-time queue; Loss probability",
ABSTRACT="We consider a discrete-time single server queue which models the input
buffer of an IP switch/router. The packets arrive according to a batch
Bernoulli process and the packet lengths (service times) are independent
and identically distributed with a general distribution. We assume that
the system has a finite buffer of size K. In contrast to ordinary queues
where one packet occupies one place in the buffer, we assume that one
packet occupies as many places as its length. We study an asymptotic
behavior of the loss probability for this queueing system as the buffer
size K tends to infinity, and then use this result to approximate the
exact loss probability. Numerical examples show that the approximation is
very accurate.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-488P12Y-1-81\&\_cdi=5663\&\_orig=browse\&\_coverDate=11\%2F30\%2F2003\&\_sk=999459996\&view=c\&wchp=dGLbVtb-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=c8a4ca6780c8aaf616cab50c7434b091\&ie=f.pdf"
}
@ARTICLE{Kim0312:Asymptotic,
AUTHOR="Bara Kim and Bong Choi",
TITLE="Asymptotic analysis and simple approximation of the loss probability of the
GIX/M/c/K queue",
JOURNAL="Performance Evaluation",
VOLUME=54,
NUMBER=4,
PAGES="331-356",
MONTH=dec,
YEAR=2003,
REFERENCES=11,
KEYWORDS="GIX/M/c/K queue; Partial rejection; Total rejection; Asymptotic loss
probability",
ABSTRACT="We consider the GIX/M/c/K queues with partial rejection or total rejection,
and find an asymptotic behavior of loss probability of the GIX/M/c/K queue
as K tends to infinity. The asymptotic loss probability is expressed only
in terms of the roots of the characteristic equation and the boundary
probabilities of the corresponding GIX/M/c queue. Numerical examples show
that the asymptotic loss probability is a quite accurate approximation for
the loss probability of the GIX/M/c/K queue even when the system capacity K
is moderate.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-4985X85-2-95\&\_cdi=5663\&\_orig=browse\&\_coverDate=12\%2F31\%2F2003\&\_sk=999459995\&view=c\&wchp=dGLbVtz-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=fa69a065c6124c390d7af3a5868b16b1\&ie=f.pdf"
}
@INPROCEEDINGS{Kinn0305:Environmentally,
AUTHOR="Akira Kinno and Yoshifumi Yonemoto and Takehiro Nakayama and Minoru Etoh",
TITLE="Environmentally-adaptive {XML} transformation and its application to
content delivery",
BOOKTITLE="ICC 2003 - Global Services and Infrastructure for Next Generation Networks",
ADDRESS="Anchorage, Alaska",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Environmentally-adaptive XML transformation has been one focus of attention
in content adaptation. It needs a standard and computationally efficient
framework for transformation engine within which input XML data can be
transformed depending on environment descriptions (e.g., terminal
capabilities) and rule descriptions (e.g., access policies). We propose a
method to realize the framework. We adopt XSLT and DOM processors; DOM
processors adaptively compose an XSLT instance from environment
descriptions and rule descriptions, and XSLT processors transform the
input XML data with the XSLT instance. We cache the XSLT instance for
reuse. Since XSLT instances are produced for corresponding environment
descriptions, the number of which is manageable, XSLT instances are not
necessarily created for every input. Caching the XSLT instances and
reducing the number of XSLT instances created yields significant
computational advantage in large-scale multimedia content delivery. We
will use the proposed framework for an AAA system of the multimedia
content delivery and its network control."
}
@ARTICLE{Klem0310:Modeling,
AUTHOR="Alexander Klemm and Christoph Lindemann and Marco Lohmann",
TITLE="Modeling {IP} traffic using the batch Markovian arrival process",
JOURNAL="Performance Evaluation",
VOLUME=54,
NUMBER=2,
PAGES="149-173",
MONTH=oct,
YEAR=2003,
REFERENCES=22,
KEYWORDS="Parameter estimation; Numerical transient analysis of Markov chains;
Analytical/numerical models of aggregated IP traffic; EM algorithm",
ABSTRACT="In this paper, we show how to utilize the expectation-maximization (EM)
algorithm for efficient and numerical stable parameter estimation of the
batch Markovian arrival process (BMAP). In fact, effective computational
formulas for the E-step of the EM algorithm are presented, which utilize
the well-known randomization technique and a stable calculation of Poisson
jump probabilities. Moreover, we identify the BMAP as an analytically
tractable model of choice for aggregated traffic modeling of IP networks.
The key idea of this aggregated traffic model lies in customizing the BMAP
such that different lengths of IP packets are represented by rewards of the
BMAP. Using measured traffic data, a comparative study with the MMPP and
the Poisson process illustrates the effectiveness of the customized BMAP
for IP traffic modeling by visual inspection of sample paths over several
time scales, by presenting important statistical properties as well as by
investigations of queuing behavior.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-48WJSXK-2-1\&\_cdi=5663\&\_orig=browse\&\_coverDate=10\%2F31\%2F2003\&\_sk=999459997\&view=c\&wchp=dGLbVzb-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=f7434de3d50738126aabf562b86f4db7\&ie=f.pdf"
}
@INPROCEEDINGS{Klem0310:Special,
AUTHOR="Alexander Klemm and Christoph Lindemann and Oliver Waldhorst",
TITLE="A Special-Purpose Peer-to-Peer File Sharing System for Mobile Ad Hoc
Networks",
BOOKTITLE="VTC 2003 - Data base management in wireless network environments",
DAYS=4,
MONTH=oct,
YEAR=2003,
ABSTRACT="Establishing peer-to-peer (P2P) file sharing for mobile ad hoc networks
(MANET) requires the construction of a search algorithm for transmitting
queries and search results as well as the development of a transfer
protocol for downloading files matching a query. In this paper, we present
a special-purpose system for searching and file transfer tailored to both
the characteristics of MANET and the requirements of peer-to-peer file
sharing. Our approach is based on an application layer overlay network. As
innovative feature, overlay routes are set up on demand by the search
algorithm, closely matching network topology and transparently aggregating
redundant transfer paths on a per-file basis. The transfer protocol
guarantees high data rates and low transmission overhead by utilizing
overlay routes. In a detailed ns-2 simulation study, we show that both the
search algorithm and the transfer protocol outperform off-the-shelf
approaches based on a P2P file sharing system for the wireline Internet,
TCP and a MANET routing protocol."
}
@TECHREPORT{Knuu0305:Session,
AUTHOR="Sami Knuutinen",
TITLE="Session Initiation Protocol Security Considerations",
TYPE="Seminar report",
INSTITUTION="Helsinki University of Technology, Department of Computer Science and
Engineering",
NUMBER="T-110.551",
ADDRESS="Helsinki, Finland",
MONTH=may,
YEAR=2003,
ABSTRACT="Session Initiation Protocol (SIP) is a protocol for signalling multimedia
sessions
with one or more participants. SIP is an application layer control
protocol to initiate
and control user sessions. It is used in call set-up signalling for IP
telephony, instead
of SS7 for circuit switching network. SIP is becoming popular in IP
networking.
This paper presents and analyses some threats and attacks that SIP is
vulnerable to.
These threats and attacks set the requirements for security mechanisms
that are used
to make SIP more secure. This paper examines some of these security
mechanisms.
In order to present and analyse the security threats and the security
mechanisms they
are divided into different aspects of security. Privacy protection issues
of SIP are also
discussed in this paper.",
URL="http://www.tml.hut.fi/Studies/T-110.551/2003/papers/15.pdf"
}
@INPROCEEDINGS{Ko0305:Performance,
AUTHOR="Kyunbyoung Ko",
TITLE="Performance Evaluation for Asynchronous {MC-CDMA} Systems with an Effect of
Carrier-Frequency Offsets",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, asynchronous multicarrier-code division multiple access
(MC-CDMA) systems with a carrier-frequency offset
for the uplink are analyzed over multi-path fading channels.
Un-coded bit error rate performance of the system with carrier-frequency
offsets is obtained.
Moreover, SNIR degradations caused by a carrier-frequency offset are
evaluated.
Derived and simulation results show that
the performance of asynchronous MC-CDMA systems is sensitive to both the
correlation among sub-carriers and the carrier-frequency offset.
Furthermore, it is verified that a guard period is required for MC-CDMA
systems in order to mitigate inter-symbol interference (ISI)."
}
@INPROCEEDINGS{Kodi0303:Detecting,
AUTHOR="Murari Kodialam and T. v. Lakshman",
TITLE="Detecting Network Intrusions via Sampling: A Game Theoretic Approach",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="In this paper, we consider the problem of detecting an intruding
packet in a communication network. Detection is accomplished by
sampling a portion of the packets transiting selected network links (or
router interfaces). Since sampling entails incurring network costs for
real-time packet sampling and packet examination
hardware, we would like to
develop a network packet sampling strategy to effectively
detect network intrusions while not exceeding a given total sampling
budget. We consider this problem
in a game theoretic framework, where the intruder picks paths (or
the network ingress point if only shortest path routing is possible)
to minimize chances of detection
and where the network operator chooses a sampling strategy to maximize
the chan
ces
of detection. We formulate the game theoretic problem, and
develop sampling schemes that are optimal in this game theoretic setting."
}
@ARTICLE{Kodi0306:Dynamic,
AUTHOR="Murali Kodialam and T. v. Lakshman",
TITLE="Dynamic Routing of Restorable Bandwidth-Guaranteed Tunnels Using Aggregated
Network Resource Usage Information",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=3,
PAGES="399-410",
MONTH=jun,
YEAR=2003,
REFERENCES=29,
KEYWORDS="multiprotocol label switching (MPLS); optical networking; quality of
service (QoS); restoration",
ABSTRACT="The paper presents new algorithms for dynamic routing of restorable
bandwidth-guaranteed paths. We assume that connections are requested
one-by-one and there is no prior knowledge of future arrivals. In order to
guarantee restorability an alternate link (node) disjoint backup
(restoration) path has to be determined, as well as an active path, when
the connection is initiated. This joint on-line routing problem is
particularly important in optical networks and in MPLS networks for
dynamic provisioning of bandwidth-guaranteed or wavelength paths. A simple
solution is to find two disjoint paths, but this results in excessive
resource usage. Backup path bandwidth usage can be reduced by judicious
sharing of backup paths amongst certain active paths while still
maintaining restorability. The best sharing performance is achieved if the
routing of every path in progress in the network is known to the routing
algorithm at the time of a new path setup. We give a new integer
programming formulation for this problem. Complete path routing knowledge
is a reasonable assumption for a centralized routing algorithm, but is not
often desirable, particularly when distributed routing is preferred. We
show that a suitably developed algorithm which uses only aggregated
information, and not per-path information, is able to perform almost as
well as one using complete information. Disseminating this aggregate
information is feasible using proposed traffic engineering extensions to
routing protocols. We formulate the dynamic restorable bandwidth routing
problem in this aggregate information scenario and develop efficient
routing algorithms. The performance of our algorithm is close to the
complete information bound.",
URL="http://ieeexplore.ieee.org/iel5/90/27187/01208301.pdf?isNumber=27187\&prod=JNL\&arnumber=1208301\&arSt=+399\&ared=+410\&arAuthor=Kodialam\%2C+M.\%3B+Lakshman\%2C+T.V."
}
@ARTICLE{Kodi0308:Online,
AUTHOR="Murali Kodialam and T. v. Lakshman and Sudipta Sengupta",
TITLE="Online Multicast Routing With Bandwidth Guarantees: A New Approach Using
Multicast Network Flow",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=4,
PAGES="676-686",
MONTH=aug,
YEAR=2003,
REFERENCES=23,
KEYWORDS="MPLS; multicast; quality-of-service (QoS) routing",
ABSTRACT={We present a new algorithm for online routing of bandwidth-guaranteed
multicasts where routing requests arrive one by one without any prior
knowledge of future requests. A multicast routing request consists of a
source, a set of receivers, and a bandwidth requirement. Two multicast
applications of interest are routing of point-to-multipoint label-switched
paths in multiprotocol label switched (MPLS) networks, and the provision of
bandwidth-guaranteed virtual private network (VPN) services under the
{"}hose{"} service model. Without prior knowledge of multicast requests,
offline multicast routing algorithms cannot be used. Online algorithms are
needed to handle requests arriving one by one and to satisfy as many
potential future demands as possible. Our new online algorithm is based on
the idea that a newly routed multicast must follow a route that does not
interfere too much with network paths that may be critical to satisfy
future demands. We develop a multicast tree selection heuristic based on
the idea of deferred loading of certain critical links. The algorithm
identifies them as links that, if heavily loaded, would make it impossible
to satisfy future demands between certain ingress-egress pairs. The
algorithm uses link-state information and some auxiliary capacity
information for multicast tree selection and is amenable to distributed
implementation. Unlike previous algorithms, our algorithm exploits any
available knowledge of the network ingress-egress points of potential
future demands, even though the demands themselves are unknown. It
performs very well.},
URL="http://ieeexplore.ieee.org/iel5/90/27488/01224465.pdf?isNumber=27488\&prod=JNL\&arnumber=1224465\&arSt=+676\&ared=+686\&arAuthor=Kodialam\%2C+M.\%3B+Lakshman\%2C+T.V.\%3B+Sengupta\%2C+S."
}
@ARTICLE{Koet0310:Algebraic,
AUTHOR="Ralf Koetter and Muriel {Médard}",
TITLE="An Algebraic Approach to Network Coding",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=5,
PAGES="782-795",
MONTH=oct,
YEAR=2003,
REFERENCES=19,
KEYWORDS="algebraic coding; network information theory; network robustness",
ABSTRACT="We take a new look at the issue of network capacity. It is shown that
network coding is an essential ingredient in achieving the capacity of a
network. Building on recent work by Li et al.(see Proc. 2001 IEEE Int.
Symp. Information Theory, p.102), who examined the network capacity of
multicast networks, we extend the network coding framework to arbitrary
networks and robust networking. For networks which are restricted to using
linear network codes, we find necessary and sufficient conditions for the
feasibility of any given set of connections over a given network. We also
consider the problem of network recovery for nonergodic link failures. For
the multicast setup we prove that there exist coding strategies that
provide maximally robust networks and that do not require adaptation of
the network interior to the failure pattern in question. The results are
derived for both delay-free networks and networks with delays.",
URL="http://ieeexplore.ieee.org/iel5/90/27747/01237456.pdf?isNumber=27747\&prod=JNL\&arnumber=1237456\&arSt=+782\&ared=+795\&arAuthor=Koetter\%2C+R.\%3B+Medard\%2C+M."
}
@ARTICLE{Koga0304:Satisfying,
AUTHOR="Yaakov Kogan and Gangaji Maguluri and Gomathi Ramachandran",
TITLE="Satisfying customer bandwidth demand in {IP} data networks",
JOURNAL="Performance Evaluation",
VOLUME=52,
NUMBER="2-3",
PAGES="105-117",
MONTH=apr,
YEAR=2003,
REFERENCES=16,
KEYWORDS="Access fulfillment; Bandwidth utilization; Normal approximation",
ABSTRACT="We introduce the notion of customer access fulfillment in IP data networks
and provide a quantitative characterization of the fulfillment using
measurements of the router uplink (link connecting a router to the
backbone) utilization. The threshold for the uplink utilization is
calculated for a given probability of customer fulfillment based on the
normal approximation. We use three different stochastic models to prove
the normal approximation for the distribution of the uplink utilization.
The convergence to the Gaussian diffusion process is proved in the
framework of the nonstationary exponential Bene buffer model. In a special
case of an alternating renewal process, we show that the fulfillment can be
evaluated based on measurements of the mean uplink utilization. We also
prove that the distribution of utilized uplink capacity is asymptotically
normal in the context of large generalized Erlang and Engset models. We
analyze 5 min measurements of router uplink utilization and show that
their empirical distribution is close to normal.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-47MK9V2-2-82\&\_cdi=5663\&\_orig=browse\&\_coverDate=04\%2F30\%2F2003\&\_sk=999479997\&view=c\&wchp=dGLbVlb-zSkzk\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=66e450d542931dfd01ab058edcac2912\&ie=f.pdf"
}
@INPROCEEDINGS{Kogi0305:Downlink,
AUTHOR="Achilles Kogiantis and Lawrence Ozarow",
TITLE="Downlink Best Effort Packet Data with Multiple Antennas",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Communication through multiple base station antennas with downlink time
division multiplexing, rate control and scheduling is considered for
high-speed packet data delivery. In contrast to transmit diversity
transmission, a new strategy is proposed. The proposed scheme, named
Distributed-Multi-Antenna-Scheduling (DMAS), is a generalized form of
parallel transmission from each and every available co-located antenna
with joint scheduling, that results to simultaneous transmission of
more than one packets to more than one intended users.
The resulting transmission scheme is analyzed in a CDMA framework
for single and dual antenna terminals and is shown, for the case of two
base station antennas in downlink transmission, to achieve substantial
increase in average data throughput compared to known Transmit Diversity
schemes, in the presence of moderate multi-user diversity.
The scheme increases the system throughput through the simultaneous
transmission of multiple packets. It thus multiplies the number of
simultaneously served users, which is a desirable feature in the
current high-speed data wireless solutions."
}
@INPROCEEDINGS{Kok0305:Mmse,
AUTHOR="Chi-Wah Kok and Man-Wai Kwan",
TITLE="{MMSE} {FIR} Zero-Forcing Equalizer for Shorten Length Trailing Zero
Precoder",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="A systematic method for designing minimal mean square error (MMSE) FIR
zero-forcing (ZF) equalizer for shorten length trailing zero (TZ) precoder
is proposed in this paper. The TZ precoder considered here based on
nonmaximally decimated filterbank allows the number of inserted zeros to
be as less as one zero per block of transmitted symbols for an arbitrary
channel order. This overrides the minimal redundancy insertion constraint
in traditional TZ precoding system, such that the proposed equalizer can
maximize the channel throughput by minimizing the inserted redundancy. A
systematic method for parameterizing the solution of ZF equalizer is
derived. The parameterized solution is useful for analysing and computing
the optimal ZF equalizer with a given optimization criteria. Simulation
results are presented to illustrate the advantages of the MMSE equalizers
obtained by the proposed design method."
}
@INPROCEEDINGS{Kok0305:Multimedia,
AUTHOR="Chi-Wah Kok and Siu-Ping Chan and Albert K. Wong",
TITLE="Multimedia Streaming Gateway with Jitter Detection",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper investigates a novel active buffer management scheme, ``Jitter
Detection'' (JD) for
gateway-based congestion control for streaming traffics in packet-switched
networks. The Multimedia
quality of presentation can be greatly degraded due to network delay
variation or jitter when transported over
a packet-switched network. Jitter degrades the timing relationship among
packets in a single media stream or
between packets from different media streams and hence creates multimedia
synchronization problem. Moreover, too much jitter
will also degrade the performance of the streaming buffer in the client.
Packets received by client
will render useless if they have accumulated a large enough jitter. The
proposed active buffer management scheme
will improve the quality of service in multimedia networking by detecting
and discarding packets that
accumulated large enough jitter. Such as to maintain a high bandwidth for
packets within the multimedia stream's
jitter tolerance. Simulation results have shown that the proposed scheme
can effectively lower the average received
packet jitter and increase the goodput of the received packets when
compared to random early detection (RED),
and Droptail used for gateway-based congestion control. Furthermore,
simulation results have also revealed that
the proposed scheme can maintain the same TCP-friendliness when compared
to that of RED and Droptail used for
multimedia streams."
}
@INPROCEEDINGS{Kola0305:Global,
AUTHOR="Aleksandar Kolarov",
TITLE="Global and Dynamic Round-Robin Scheduler for Terabit Routers",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper we propose a new greedy scheduling algorithm for crossbar
terabit
switches with virtual output queuing (VOQ) at input ports. The proposed
global
and dynamic round-robin (GDRR) scheduler is a pipelined scheduler. The
router
supports differentiated services (Diff-Serv) with their own quality of
service
(QoS) guarantees, as defined by the IETF. Our empirical studies show that
the
scheduler provides minimum service rate (MSR) guarantees for high-priority
conforming traffic. Available bandwidth at any output port is fairly
shared
between input ports (the input port fairness), using the global
round-robin
method. Also, available bandwidth at any input port is fairly shared
between
VOQs (the output port fairness), using the dynamic round-robin method. The
scheduler is scalable. Increasing the number of scheduling modules
linearly
increases the latency of the scheduling algorithm, but increasing the
number of
supported classes does not affect the scheduler design. Simulation results
show
that the GDRR scheduler achieves the minimum service rate (MSR) guarantees
for
the conforming traffic and fair treatment of the non-conforming traffic
for the
various traffic patterns and high traffic loads."
}
@INPROCEEDINGS{Kong0305:Dynamic,
AUTHOR="Xiang Kong and Kenichi Mase",
TITLE="Dynamic Routing with Endpoint Admission Control",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we propose dynamic routing with endpoint measurement based
admission control (EMBAC) for VoIP networks with mesh topology. The basic
idea of this admission control is, to use probe flows to measure two
routes, which are direct route and one of the two-link routes between each
VoIP callfs originating-terminating node pair. Based on the probe flowfs
QoS evaluation, the node decides a route for each call. We compare
performance of direct routing, basic dynamic routing and advanced dynamic
routing by using simulation. It is shown that an advanced dynamic routing
with EMBAC works better for minimizing call blocking probability and
packet loss rate than direct routing."
}
@INPROCEEDINGS{Kong0305:Random,
AUTHOR="Jiejun Kong and Mansoor Mirza and James Shu and Christian Yoedhana and
Mario Gerla and Songwu Lu",
TITLE="Random Flow Network Analysis and Simulations for DDoS Attack Mitigation",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Recent events show that distributed denial-of-service (DDoS) attack
imposes great threat to availability of Internet services. In this
paper, we study and evaluate DDoS attacks in a random flow network
model, a novel and general approach to DDoS attack prevention and
tolerance. The model can be used to evaluate the effectiveness of a
DDoS countermeasure framework. Following the random flow network model
and state-of-art Internet topology and traffic models, our simulation
reveals the general relationship among several metrics derived from the
model. Based on the simulation results, we suggest to build a more
complete and effective DDoS countermeasure framework using complementary
solutions to achieve DDoS attack detection, prevention, and tolerance at
same time."
}
@ARTICLE{Kong0312:Novel,
AUTHOR="Peng-Yong Kong and Kee-Chaing Chua and Brahim Bensaou",
TITLE="A Novel Scheduling Scheme to Share Dropping Ratio While Guaranteeing a
Delay Bound in a MultiCode-CDMA Network",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=6,
PAGES="994-1006",
MONTH=dec,
YEAR=2003,
REFERENCES=21,
KEYWORDS="multicode-CDMA; proportional dropping ratio guarantee; upper delay
guarantee; variable capacity",
ABSTRACT="A MultiCode-CDMA network that is capable of providing quality-of-service
guarantees will find widespread application in future wireless multimedia
networks. However, providing delay guarantees to time-sensitive traffic in
such a network is challenging because its transmission capacity is variable
even in the absence of any channel impairment. We propose and evaluate the
performance of a novel transmission scheduling scheme that is capable of
providing such a delay guarantee in a MultiCode-CDMA network. The proposed
scheme drops packets to ensure that delays for all transmitted packets are
within the guaranteed target bounds, but packets are dropped in a
controlled manner such that the average dropping ratios of a set of
time-sensitive flows can be proportionally differentiated according to the
assigned weighting factors or shares. We provide extensive simulation
results to show the effectiveness of the proposed scheme as well as to
study the effects of various parameters on its performance. In particular,
we show that it can simultaneously guarantee a delay upper bound and a
proportionally differentiated dropping ratio in a fading wireless channel
for different traffic loads, peak transmission rates, and weighting
factors of individual flows.",
URL="http://ieeexplore.ieee.org/iel5/90/28078/01255436.pdf?isNumber=28078\&prod=JNL\&arnumber=1255436\&arSt=+994\&ared=+1006\&arAuthor=Peng-Yong+Kong\%3B+Kee-Chaing+Chua\%3B+Bensaou\%2C+B."
}
@INPROCEEDINGS{Koo0305:Cost,
AUTHOR="Sunggy Koo and Gokhan Sahin and Suresh Subramaniam",
TITLE="Cost Efficient {LSP} Protection in IP/MPLS-over-WDM Overlay Networks",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We consider an IP/MPLS-over-WDM overlay network
in which an IP/MPLS service layer exists independently
over a WDM
transport network. In the overlay model, two
adjacent layers communicate with each other only through
a pre-defined
User-Network Interface (UNI) and the WDM topology
information
is not available to the service layer.
In this paper,
we concentrate on network design with a fault
tolerance mechanism provided only in the
IP/MPLS layer in which the
label-switched path (LSP) protection takes into account
both node (i.e., label switched router or LSR)
failures in the IP/MPLS service layer and
failures in the WDM transport layer. In this design
problem, the service layer must decide how
lightpaths or logical links should be provisioned
and how primary and backup
LSPs should be routed in a cost-effective manner,
such that failures do not affect both LSPs simultaneously.
We formulate this survivable IP/MPLS overlay network
design problem
as a mixed integer linear program (MILP).
Since the MILP is computationally intractable for
large networks, we solve it only for a small network
and present the
optimal solution found by CPLEX 7.5, a commercial
MILP solver. In order to find
efficient solutions in larger networks we propose
a heuristic algorithm that
performs near-optimally in the cases studied.
We then compare total costs for LSP protection for
different failure scenarios.
Results indicate that protection from WDM link
failures and LSR failures
may not be much more expensive than protection
from LSR failures only."
}
@INPROCEEDINGS{Koo0305:Performance,
AUTHOR="Hyounhee Koo and Byeong Gi Lee",
TITLE="Performance Analysis for {ST-BICM} System with an Arbitrary Constellation",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we analyze the performance of ST-BICM(Space-Time
Bit-Interleaved Coded Modulation) system employing an arbitrary
constellation in quasi-static fading channels. We derive a new
upper bound of the frame error probability of the system which
depends only on the product measure. In order to get the product
measure, we analyze the type of error sequence, which is defined
as the density spectrum of the constituent symbols that yield a
certain number of bit errors. The analysis is based on the uniform
interleaving, so we average the frame error probability over all
possible interleavers. We also derive the statistical distribution
of the product measure. Finally, we show that the new upper bound
helps to predict the performance of the ST-BICM system with an
arbitrary constellation."
}
@INPROCEEDINGS{Kopp0305:Combined,
AUTHOR="Alois Koppler and Andreas Springer and Robert Weigel",
TITLE="Combined Frequency Domain Feedforward and Turbo Decision Feedback
Equalization for Single Carrier {W-LAN} Systems",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Single carrier transmission with frequency domain equalization (SC/FDE) has
been shown to be an attractive alternative to orthogonal frequency division
multiplexing (OFDM) systems for Wireless LANs.
In this work we add time domain decision feedback performing Turbo
equalization to conventional SC/FDE for block transmission with a cyclic
prefix.
The proposed scheme reaches the potential of ideal decision feedback
equalization, i.e. with correct feedback.
Simulations show an impressive performance increase in terms of bit error
ratio for highly frequency selective radio channels found in W-LAN
environments."
}
@INPROCEEDINGS{Kops0305:Space,
AUTHOR="Klaus Kopsa and Harold Artes and Gerald Matz and Franz Hlawatsch",
TITLE="Space-Time Algorithms for Multiuser Channel Estimation in the Downlink of
{UMTS/TDD}",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We present space-time methods for channel estimation in the downlink of a
UMTS/TDD system. The channels associated to all base stations near the
mobile receiver are estimated by a multiuser, multi-antenna technique. We
develop a minimum mean-square error (MMSE) channel estimator that
incorporates midamble detection/estimation and least-squares channel
estimation as preparatory stages. Combination of this MMSE channel
estimator with a successive interference cancellation scheme allows to
cope with strong co-channel interference. Simulation results indicate the
good performance of our space-time channel estimator for various realistic
propagation scenarios."
}
@ARTICLE{Kork0306:Bandwidth,
AUTHOR="Turgay Korkmaz and Marwan Krunz",
TITLE="Bandwidth-Delay Constrained Path Selection Under Inaccurate State
Information",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=3,
PAGES="384-398",
MONTH=jun,
YEAR=2003,
REFERENCES=41,
KEYWORDS="Lagrange relaxation; multiobjective optimization; quality-of-service (QoS)
routing; stochastic shortest path",
ABSTRACT="A key issue in any QoS routing framework is how to compute a path that
satisfies given QoS constraints. We focus on the path computation problem
subject to bandwidth and delay constraints. This problem can be solved
easily if the exact state information is available to the node computing
the path. In practice, nodes have only imprecise knowledge of the network
state. Reliance on outdated information and treating it as exact can
significantly degrade the effectiveness of the path selection. We adopt a
probabilistic approach in which the state parameters (available bandwidth
and delay) are characterized by random variables. The goal is then to find
the most-probable bandwidth-delay-constrained path (MP-BDCP). We provide
efficient solutions for the MP-BDCP problem by decomposing it into the
most-probable delay-constrained path (MP-DCP) problem and the
most-probable bandwidth-constrained path (MP-BCP) problem. MP-DCP by
itself is known to be NP-hard, necessitating the use of approximate
solutions. We use the central limit theorem and Lagrange relaxation
techniques to provide two complementary solutions for MP-DCP. These
solutions are highly efficient, requiring on average a few iterations of
Dijkstra's shortest path algorithm. As for MP-BCP, it can be easily
transformed into a variant of the shortest path problem. Our MP-DCP and
MP-BCP solutions are then combined to obtain a set of near-nondominated
paths for the MP-BDCP problem. Decision makers can then select one or more
of these paths based on a specific utility function. Extensive simulations
demonstrate the efficiency of the proposed algorithmic solutions and, more
generally, to contrast the probabilistic path selection approach with the
standard threshold-based triggered approach.",
URL="http://ieeexplore.ieee.org/iel5/90/27187/01208300.pdf?isNumber=27187\&prod=JNL\&arnumber=1208300\&arSt=+384\&ared=+398\&arAuthor=Korkmaz\%2C+T.\%3B+Krunz\%2C+M."
}
@INPROCEEDINGS{Kose0305:Serially,
AUTHOR="Cenk Kose and Richard Wesel and Wen-Yen Weng",
TITLE="Serially Concatenated Trellis Coded Modulation for the Compound Periodic
Erasures Channel",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This study aims to robustly extend the near-capacity performance
of serially-concatenated convolutional codes under AWGN
to periodically time-varying channels. In particular,
we propose serially-concatenated trellis-coded modulations (SCTCMs)
that would perform consistently close to channel capacity under
periodic erasures as well as under AWGN, without sacrificing AWGN
channel performance. The proposed 0.5 bits/symbol, 1 bit/symbol and
1.5 bits/symbol SCTCM schemes are robust with respect to
periodic time-variations with period two symbols."
}
@INPROCEEDINGS{Kota0305:Wireless,
AUTHOR="Preeti Kota and Christian Schlegel",
TITLE="A Wireless Packet Multiple Access Method Exploiting Joint Detection",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="A new packet-based, multiple access scheme for connectionless,
uncoordinated random access is proposed using code-division multiple
access (CDMA) as the physical access method. The new method uses a novel
packet format with a common header with identical spreading codes for all
users and packets, and random spreading codes for the data portion. The
receiver operates in two stages: header detection using a conventional
spread spectrum receiver and data detection using a multiuser detector to
allow for decoding of overlapping active
packets. The headers are spread with a large enough processing gain to
allow detection even in severe interference. It is shown that this system
is detector capability limited and that it can significantly outperform
conventional ALOHA systems whose performance is limited by the collision
mechanism. This system also experiences a much smaller packet
retransmission rate than conventional or spread ALOHA, and provides better
spectral efficiencies."
}
@INPROCEEDINGS{Kote0305:Optimal,
AUTHOR="Jayesh Kotecha and Akbar Sayeed",
TITLE="Optimal Signal Design For Estimation Of Correlated {MIMO} Channels",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We address optimal estimation of multi-input multi-output (MIMO) correlated
channels using pilot signals, assuming knowledge of the
second order statistics of the channel at the transmitter. Assuming a
block fading channel model and minimum mean square
error (MMSE) estimation at the receiver, we design the transmitted
signal to optimize two criteria: MMSE and the conditional mutual
information between
the MIMO channel and the received signal.
Our analysis is based on the recently proposed virtual channel
representation, which corresponds to beamforming in fixed virtual
directions
and is a more tractable representation of the physical scattering
environment.
The virtual representation exposes the structure and the true degrees of
freedom in the correlated channel, a feature
that is exploited by our signal design.
We show that optimal signaling is in a block form, where the block
length depends on the signal to noise ratio (SNR)
as well as the channel statistics. The block signal corresponds to beams
transmitted in successive time
intervals along fixed virtual transmit angles, whose powers are determined
by (non-identical) water filling arguments
based on the two optimization criteria. Our analysis shows that the water
filling argument
identifies exactly which transmit angles are {\em important} for channel
estimation.
In particular, at low SNR the block length
reduces to one and all the power is
transmitted on the beam corresponding to the strongest transmit angle,
while at high SNR
the block length has a maximum length equal to the number of transmit
antennae and the power is assigned
equally in all active transmit angles. Consequently, from the channel
estimation viewpoint,
a faster fading rate can be tolerated at low SNRs relative to higher SNRs."
}
@TECHREPORT{Kott0307:Improving,
AUTHOR="Karen Kotturi",
TITLE="Improving the Security and Performance of the BaBar Detector Controls
System",
TYPE="arXiv report",
NUMBER="cs.NI/0307026",
MONTH=jul,
YEAR=2003,
KEYWORDS="Networking and Internet Architecture",
ABSTRACT="It starts out innocently enough - users want to monitor Online data and so
run their own copies of the detector control GUIs in their offices and at
home.
But over time, the number of processes making requests for values to
display on
GUIs, webpages and stripcharts can grow, and affect the performance of an
Input/Output Controller (IOC) such that it is unable to respond to
requests
from requests critical to data-taking. At worst, an IOC can hang, its CPU
having been allocated 100\% to responding to network requests.
For the BaBar Online Detector Control System, we were able to eliminate
this
problem and make great gains in security by moving all of the IOCs to a
non-routed, virtual LAN and by enlisting a workstation with two network
interface cards to act as the interface between the virtual LAN and the
public
BaBar network. On the interface machine, we run the Experimental Physics
Industrial Control System (EPICS) Channel Access (CA) gateway software
(originating from Advanced Photon Source). This software accepts as
inputs, all
the channels which are loaded into the EPICS databases on all the IOCs. It
polls them to update its copy of the values. It answers requests from
applications by sending them the currently cached value.
We adopted the requirement that data-taking would be independent of the
gateway, so that, in the event of a gateway failure, data-taking would be
uninterrupted. In this way, we avoided introducing any new risk elements
to
data-taking. Security rules already in use by the IOC were propagated to
the
gateway's own security rules and the security of the IOCs themselves was
improved by removing them from the public BaBar network.",
URL="http://arXiv.org/abs/cs/0307026"
}
@INPROCEEDINGS{Kouc0305:Top,
AUTHOR="Yevgeni Koucheryavy and Dmitri Moltchanov",
TITLE="A Top-Down Approach to VoD Traffic Transmission Over DiffServ Domain Using
the {AF} {PHB} Class",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Based on the Differentiated Services (DiffServ, [1]) model we develop
implementation-ready transmission service for video-on-demand (VoD)
traffic. In order to satisfy the demands of real-time nature of VoD
traffic we propose to use assured forwarding (AF, [4]) per-hop behavior
(PHB) group. We provide specific traffic profile parameters which
adequately fit to VoD traffic requirements. Using these parameters and AF
PHB class we show how to construct a well-defined transmission service
that is suitable for VoD traffic delivery. Our service is analytically
tractable. It means that using the quality of service (QoS) parameters
which should be provided to VoD traffic we can evaluate the required
capacity not only within the DiffServ ingress node, but within the
interior nodes too. Our transmission service is designed in such way that
it is fully characterized by the parameters of DiffServ ingress node,
bounds the losses and delay along the path of behavior aggregate and
allows us to predict the QoS degradation which can be experienced by both
behavior aggregate and single microflows."
}
@INPROCEEDINGS{Kout0303:Impact,
AUTHOR="Iordanis Koutsopoulos and Tianmin Ren and Leandros Tassiulas",
TITLE="The Impact of Space Division Multiplexing on Resource Allocation: A Unified
Approach",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Recent advances in the area of wireless communications have revealed
the emerging need for efficient wireless channel access in personal,
local, or wide area networks. Space Division Multiple Access (SDMA)
with antenna arrays at the base station is recognized as a promising
means of increasing system capacity and supporting envisioned
services. However, the existence of SDMA in the physical layer
raises significant issues in medium access control (MAC) and higher
layers. In this paper, we attempt to capture the impact of SDMA on
MAC layer channel allocation. This impact obtains diverse forms in
TDMA, CDMA or OFDMA schemes due to the different cochannel and
inter-channel interference scenarios, as well as the different
effect of corresponding channels (time slots, codes or subcarrier
frequencies) on user spatial characteristics. We follow a unified
approach with respect to these multiple access schmes and propose
heuristic algorithms to allocate channels to users and adjust
downlink beamforming vectors and transmission powers, with the
objective to increase total system rate and provide QoS to users in
the form of minimum rate guarantees. We consider the class of greedy
algorithms, with criteria such as minimum induced/received
interference and maximum worst case signal-to-interference ratio
(SIR), as well as the class of SIR balancing algorithms and we
assess their performance for different multiple access schemes. Our
results indicate that this cross-layer approach yields significant
performance benefits."
}
@ARTICLE{Kouv0302:Entropy,
AUTHOR="Demetres Kouvatsos and Irfan Awan",
TITLE="Entropy maximisation and open queueing networks with priorities and
blocking",
JOURNAL="Performance Evaluation",
VOLUME=51,
NUMBER="2-4",
PAGES="191-227",
MONTH=feb,
YEAR=2003,
REFERENCES=39,
KEYWORDS="Queueing network models (QNMs); Maximum entropy (ME) principle; Preemptive
resume (PR) rule; Head-of-line (HOL) rule; Complete buffer sharing (CBS)
scheme; Partial buffer sharing (PBS) scheme; Compound Poisson process
(CPP); Generalised exponential (GE) distribution; Repetitive service
blocking with random (RS-RD) or fixed (RS-RD) destination mechanism;
Blocking-after-service (BAS) mechanism",
ABSTRACT="A review is carried out on the characterisation and algorithmic
implementation of an extended product-form approximation, based on the
principle of maximum entropy (ME), for a wide class of arbitrary finite
capacity open queueing network models (QNMs) with service and space
priorities. A single server finite capacity GE/GE/1/N queue with R (R>1)
distinct priority classes, compound Poisson arrival processes (CPPs) with
geometrically distributed batches and generalised exponential (GE) service
times is analysed via entropy maximisation, subject to suitable GE-type
queueing theoretic constraints, under preemptive resume (PR) and
head-of-line (HOL) scheduling rules combined with complete buffer sharing
(CBS) and partial buffer sharing (PBS) management schemes stipulating a
sequence of buffer thresholds {N=(N1,,NR),0
This paper presents a protocol that is designed to meet a more
practical specification of probabilistic reliability; this
gossip-based multicast protocol, called Route Driven Gossip
(RDG), can be deployed on any basic on-demand routing protocol.
RDG is custom tailored to ad hoc networks, achieving a high level of
reliability without relying on any inherent multicast
primitive. We illustrate our RDG protocol by layering it on top
of the {"}bare{"} DSR protocol. We convey our claims of reliability
and scalability through both analysis and simulation.
Methods Keywords: System design, Simulations, Stochastic processes}
}
@INPROCEEDINGS{Luo0305:Branch,
AUTHOR="Jie Luo and Krishna Pattipati and Peter Willett and Loic Brunel",
TITLE="Branch-and-Bound-Based Fast Optimal Algorithm for Multiuser Detection in
Synchronous {CDMA}",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT={A fast optimal algorithm based on the branch and bound (BBD) method is
proposed for the joint detection of binary symbols of K users in a
synchronous Code-Division Multiple Access (CDMA) channel with Gaussian
noise. Relationships between the proposed algorithms (depth-first BBD and
fast BBD) and both the decorrelating decision feedback (DF) detector and
sphere decoding (SD) algorithm are clearly drawn. It turns out that
decorrelating DF detector corresponds to a ``one-pass{"} depth-first BBD;
sphere decoding is in fact a type of depth-first BBD, but one that can be
improved considerably via tight upper bounds and user ordering as in our
fast BBD.}
}
@INPROCEEDINGS{Luo0305:Split,
AUTHOR="Yuanqiu Luo and Nirwan Ansari",
TITLE="Split Restoration with Wavelength Conversion in {WDM} Networks",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we propose a path restoration algorithm for a single fiber
fault in the WDM network equipped with wavelength conversion. The Integer
Linear Programming (ILP) formulas for minimizing the path recovery cost
can yield the optimum solution but it is NP-complete. Our heuristic
algorithm relaxes the complexity by two steps. In the off-line step, the
node-link topology is replaced by the node-wavelength topology, the
alternate paths for source-destination node pairs are listed, and the
wavelengths in each link are assigned by maximum matching. In the on-line
step, traffics going through the failed link are split into subtraffics
and are restored according to their priorities. The performance analysis
and the simulation results indicate that our heuristic algorithm is
practical for WDM networks restoration."
}
@INPROCEEDINGS{Ma0303:Bandwidth,
AUTHOR="Maode Ma",
TITLE="A Bandwidth Guaranteed Polling {MAC} Protocol for Ethernet Passive Optical
Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="While the backbone networks have experienced great changes in the last
decades, the access networks have been changed little to keep up with the
advance of the backbone networks. Passive optical network (PON) is proved
to be a potential candidate for access networks due to its high bandwidth,
long distance and reduced maintenance. Ethernet PON (EPON) has been
recently regarded as an attractive solution because of its high speed, low
cost, interoperability and low overhead. In this paper, we propose a novel
MAC protocol for the EPON, named as Bandwidth Guarantee Polling (BGP)
scheme, which could be employed to share the upstream link channel in the
EPON system. The proposed scheme incorporates the service level agreement
(SLA) into medium access control (MAC) protocol design with aim to ensure
bandwidth guarantee for high-demand traffics according to the
corresponding SLAs, while providing best-effort service to low-demand
users. The analytical and simulation results prove that our BGP scheme can
provide better performance for high bandwidth requests. Both of the service
provider and subscribers can benefit from it efficiently."
}
@INPROCEEDINGS{Ma0305:Enhanced,
AUTHOR="Changlin Ma and Richard Klukas and Gerard Lachapelle",
TITLE="An Enhanced Two-Step {LS} Approach for {TDOA/AOA} Wireless Location",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="An Enhanced Two-Step LS approach is proposed here for hybrid TDOA/AOA
wireless location. Compared to the original two-step LS algorithm, the
method here can provide better performance, almost the same as that of
Taylor-Series estimator. Compared to the Taylor-Series solution, the
method has many computational advantages, such as, light computational
burden, no linearization, no initial point selection issue, and no
convergence issue."
}
@INPROCEEDINGS{Ma0305:Performance,
AUTHOR="Yao Ma and Subbarayan Pasupathy",
TITLE="Performance of Generalized Selection Combining on general fading channels",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we propose an efficient moment generating function
(MGF)-based
method to evaluate the performance of
generalized selection combining (GSC) over
different fading channels.
Employing a recently proposed method
which is, however, only applicable to GSC diversity with independent
and identically
distributed (i.i.d.) branches,
we derive a general MGF expression of the GSC output signal-to-noise
ratio (SNR)
for generalized fading channels,
where the channel statistics in different diversity branches may be
non-identical,
or even distributed according to different distribution families.
The resulting MGF expression is applicable to the analysis of error
probability,
outage probability, and SNR statistics for GSC in a lot of
wireless communications scenarios with generalized fading.
Numerical examples are presented to illustrate the application of the
new analysis."
}
@INPROCEEDINGS{Ma0305:Performance,
AUTHOR="Yao Ma and Keith Q. T. Zhang and Robert Schober and Subbarayan Pasupathy",
TITLE="Performance Analysis of {DAPSK} over General Fading Channels",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The performance of differential amplitude and phase-shift keying (DAPSK)
with
post-detection diversity combining over general fading channels
is of great theoretical interests and practical importance. Hence a
general and
accurate performance analysis is very desirable.
In this paper, we analyze the distribution of the phase and amplitude
decision
variables at the DAPSK receiver output by using the moment generating
function (MGF) approach. Exact
results for the error probability of DAPSK on general Rician and
Nakagami fading
channels are derived, taking into account the effects of all the
system and
fading channel parameters, including correlated signal branches,
correlated noise, and non-identical Doppler fading rates (for
Rician channels). By using our analytical results,
the effects of the ring ratio and the amplitude decision boundary,
etc.,
on the DAPSK performance are investigated, and
some new findings are presented."
}
@INPROCEEDINGS{Ma0310:New,
AUTHOR="Wenchao Ma and Yuguang Fang",
TITLE="A New Efficient Mobility Management Scheme for Wireless Cellular Networks",
BOOKTITLE="VTC 2003 - Data base management in wireless network environments",
DAYS=4,
MONTH=oct,
YEAR=2003,
ABSTRACT="For wireless mobile cellular networks to effectively deliver services to
the mobile users, the
networks must have an efficient way to keep track of them. The location
management fulfills
this task through location registration and location tracking. To reduce
the signaling traffic,
many schemes such as local anchor, pointer forwarding and two-level
pointer forwarding
schemes have been proposed in the past. In this paper, we present a novel
location
management scheme which intends to mitigate the signaling traffic while
reducing the tracking
delay in wireless cellular systems. In this strategy, one VLR traversed
by a user is selected as
the Mobility Agents (MA) for that user at a time, which forms another
level of management so
that some registration signaling traffic can be localized. The idea is as
follows: instead of always
updating to the HLR, which would become the bottleneck otherwise, many
location updates
are carried out in the mobility agent. Thus, the new scheme is designed to
reduce the
signaling traffic: pointers can be set up between VLRs as the traditional
pointer forwarding
scheme and can also be set up from MA too. The numerical results show
that this strategy can
significantly reduce the network signaling traffic for users without
increasing much of the call
setup delay. Moreover, in our new scheme, the signaling burden is evenly
distributed and
choice of MA is dynamic for every user."
}
@INPROCEEDINGS{Maar0305:Combined,
AUTHOR="Amine Maaref and Sonia Aissa and Sofiene Affes",
TITLE="Combined Flow Control and Interference Cancellation for Packet Data
Transmission in Wideband {CDMA} Systems",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We consider the control of uplink packet flow subject to in-cell and
out-of-cell interference limitations, in the presence of imperfect
Interference
Cancellation (IC). The aim is to combine a location-based packet flow
control
algorithm with multi-user detection for IC. The algorithm assigns packets
to be
transmitted to separate queues, one for each spatial zone within which
packets
generate roughly the same in-cell interference and impose equal
interference on
a neighboring base station. The objective is to maximize data throughput
while
ensuring fairness among users and limiting queuing and transmission
delays.
Throughput and fairness are two conflicting objectives that need to be
optimized.
We show that IC combined with location based scheduling achieves a better
trade-off between throughput and fairness even under stringent resource
limitations. Compared to throughput maximization, simulations suggest that
maximum fairness can be achieved with a loss in throughput of only 13\%,
whereas the loss is 65\% when IC is not combined with scheduling."
}
@INPROCEEDINGS{MacK0303:Stability,
AUTHOR="Allen MacKenzie and Stephen Wicker",
TITLE="Stability of Multipacket Slotted Aloha with Selfish Users and Perfect
Information",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Aloha is perhaps the simplest and most-studied medium access control
protocol in existence. Only in the recent past, however, have researchers
begun to study the performance of Aloha in the presence of selfish users.
In this paper, we present a game-theoretic model of multipacket slotted
Aloha with perfect information. We show that this model must have an
equilibrium and we characterize this equilibrium. Using the tools of
stochastic processes, we then establish the equilibrium stability region
for some well-known channel models.
Method Keywords: System design, Stochastic processes, Economics"
}
@INPROCEEDINGS{Madr0305:Design,
AUTHOR="Guillaume Madre and El-Houssain Baghious and Stephane Azou and Gilles Burel",
TITLE="Design of a variable rate algorithm for {CS-ACELP} coder",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper is about the reduction of the computational complexity of the
CS-ACELP codec, described in ITU recommendation G.729, and used for the
transmission of voice over IP. A Voice Activity Detection module is
proposed to replace the G.729 Annex B algorithm. The new procedure was
developed to allow its implementation with Number Theoretic Transforms.
The use of Fermat Number Transforms can reduce the cost of variable rate
algorithm implantation on Digital Signal Processor (DSP)."
}
@INPROCEEDINGS{Maer0305:Channel,
AUTHOR="Rainer Maerkle and Carl-Erik Sundberg",
TITLE="Channel Codes based on Hidden Puncturing for Partial Band Interference
Channels",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this work, a new approach of designing channel codes for partial band
interference channels based on Hidden Puncturing is introduced that is not
requiring explicit estimation of the interferer. We investigate the
performance of specially designed rate ½ Viterbi decoding of
convolutional codes and rate ½ Turbo codes in an example scenario with
partial band FM interference. We show by means of simulations that for
Gaussian as well as for a variety of multipath fading profiles, a
significant channel coding gain compared to a conventional system can be
achieved. Thereby the performance of optimal combining, that is requiring
optimal estimation of the interferer, can be approached very closely in
various scenarios."
}
@ARTICLE{Maha0304:Scalable,
AUTHOR="Anirban Mahanti and Derek Eager and Mary Vernon and David Sundaram-Stukel",
TITLE="Scalable On-Demand Media Streaming With Packet Loss Recovery",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=2,
PAGES="195-209",
MONTH=apr,
YEAR=2003,
REFERENCES=36,
KEYWORDS="multicast; packet loss recovery; performance evaluation; periodic
broadcast; scalable protocols; streaming media; video-on-demand",
ABSTRACT="Previous scalable on-demand streaming protocols do not allow clients to
recover from packet loss. This paper develops new protocols that: (1) have
a tunably short latency for the client to begin playing the media; (2)
allow heterogeneous clients to recover lost packets without jitter as long
as each client's cumulative loss rate is within a tunable threshold; and
(3) assume a tunable upper bound on the transmission rate to each client
that can be as small as a fraction (e.g., 25\%) greater than the media
play rate. Models are developed to compute the minimum required server
bandwidth for a given loss rate and playback latency. The results of the
models are used to develop the new protocols and assess their performance.
The new protocols, Reliable Periodic Broadcast and Reliable Bandwidth
Skimming, are simple to implement and achieve nearly the best possible
scalability and efficiency for a given set of client characteristics and
desirable/feasible media quality. Furthermore, the results show that the
new reliable protocols that transmit to each client at only twice the
media play rate have similar performance to previous protocols that
require clients to receive at many times the play rate.",
URL="http://ieeexplore.ieee.org/iel5/90/26877/01194817.pdf?isNumber=26877\&prod=JNL\&arnumber=1194817\&arSt=+195\&ared=+209\&arAuthor=Mahanti\%2C+A.\%3B+Eager\%2C+D.L.\%3B+Vernon\%2C+M.K.\%3B+Sundaram-Stukel\%2C+D.J."
}
@INPROCEEDINGS{Maki0305:Hierarchically,
AUTHOR="Ichinoshin Maki",
TITLE="Hierarchically Aggregated Fair Queueing {(HAFQ)} for Per-flow Fair
Bandwidth Allocation in High Speed Networks",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Because of the development of recent broadband access technologies, fair
service among users are becoming more important criteria.
The most promising scheme of router mechanisms for providing fair service
is per-flow traffic management.
However, it is difficult to be implemented in high-speed core routers
because per-flow state management is prohibitive; thus, a large number
of flows are aggregated into a small number of queues.
This is not a preferable situation because the more number of flows
aggregated into a queue increases, the worse fairness tends to become.
In this paper, we propose a new traffic management scheme
called Hierarchically Aggregated Fair Queueing (HAFQ) to provide
per-flow fair service.
Our proposed scheme can adjust flow aggregation levels according to
the queue handling capability of various routers.
That means the proposed scheme is scalably used in high-speed networks.
HAFQ improves the fairness among aggregated flows by estimating the
number of flows aggregated in a queue and allocating bandwidth to the
queue proportionally.
In addition, since HAFQ can identify flows having higher arrival rates
simultaneously in estimating the number of flows, it enhances the
fairness by preferentially dropping their packets.
We show that our proposed scheme can provide per-flow fair service
through extensive simulation and experimental studies using a network
processor.
Since the currently available network processors (Intel IXP1200 in our
case) is not high capacity, we also give extensive discussions on the
applicability of our scheme to the high-speed core routers."
}
@ARTICLE{Makk0305:Mobile,
AUTHOR="S. Makki and Niki Pissinou and Philippe Owezarski",
TITLE="Mobile and wireless Internet access",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=7,
PAGES="734-746",
MONTH=may,
YEAR=2003,
REFERENCES=9,
KEYWORDS="Wireless network; Mobility; Internet",
ABSTRACT="The explosive growth in wireless networks and Internet creates considerable
demand on wireless carriers to provide wireless Internet services. There
are many challenges to overcome in order to realize true wireless Internet
service solution. This paper reviews those challenges in wireless networks
from mobility perspective and identifies important areas that have to be
resolved to create a framework for universal Mobility in wireless
Internet. It will be shown that to obtain a good quality of service on
wireless Internet one of the challenge is to hide user Mobility. However,
in order to improve performance and obtain a reliable point-to-point
communication in wireless networks, some modifications are necessary.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-478YXBY-2-T\&\_cdi=5624\&\_orig=browse\&\_coverDate=05\%2F01\%2F2003\&\_sk=999739992\&view=c\&wchp=dGLbVlb-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=115dfcb98b05dd3a2fce8bef07aec7ee\&ie=f.pdf"
}
@INPROCEEDINGS{Mall0305:Analysis,
AUTHOR="R.K. Mallik and Deepti Singh and Anita Kumari",
TITLE="Analysis of Rake Reception with Multiple Symbol Weight Estimation for
Antipodal Signaling",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In a rake receiver for coherent binary antipodal signaling
with weight estimation by matched filtering
using the reference signal along with
the decisions of the previous M symbol intervals,
and predetection maximal-ratio combining (MRC),
the estimation errors are not independent of the additive noise,
and do not fit into the Gaussian weighting error model for MRC.
Here we analyze the error performance of the receiver by:
(1) obtaining the conditional symbol error probability (SEP),
conditioned on past decisions, from the characteristic
function of the decision variable, (2) getting the
unconditional SEP using a Markov model of the decision
process."
}
@ARTICLE{Malo0311:Connection,
AUTHOR="Szabolcs Malomsoky and Sándor {Rácz} and Szilveszter Nadas",
TITLE="Connection admission control in {UMTS} radio access networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=17,
PAGES="2011-2023",
MONTH=nov,
YEAR=2003,
REFERENCES=17,
KEYWORDS="UTRAN; Connection admission control; queues; Brownian bridge approximation",
ABSTRACT="On transport links of UMTS Terrestrial Radio Access Networks, but
especially on those connecting base stations and radio network controllers
(i.e. on the Iub interface), resource allocation is complex, because packet
delay and loss requirements are strict and the amount of transmission
resources is relatively low. In this paper a novel connection admission
control (CAC) algorithm is provided, which is applicable on the Iub
interface with both ATM/AAL2 and IP transport options. The CAC algorithm
is validated by mathematical analysis and computer simulation.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-48S4CP8-5-BR\&\_cdi=5624\&\_orig=browse\&\_coverDate=11\%2F01\%2F2003\&\_sk=999739982\&view=c\&wchp=dGLbVlb-zSkzS\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=caafd40aa809d19e8bab0c59a9c237b9\&ie=f.pdf"
}
@INPROCEEDINGS{Mand0303:Pricing,
AUTHOR="Michel R.H. Mandjes",
TITLE="Pricing strategies under heterogeneous service requirements",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="This paper analyzes a communication network with
heterogeneous customers. We investigate priority queueing as a way
to differentiate between these users. Customers join the network
as long as their utility (which is a function of the queueing
delay) is larger than the price of the service. We focus on the
specific situation in which two types of users play a role: one
type is delay-sensitive (`voice'), whereas the other is
delay-tolerant (`data'); these preferences are reflected in their
utility curves. Two models are considered: in the first the
network determines the priority class of the users, whereas the
second model leaves this choice to the users. For both models we
determine the prices that maximize the provider's profit.
Importantly, these situations do {\it not} coincide. Our study
uses elements from queueing theory, but also from microeconomics
and game theory (e.g., the concept of a Nash equilibrium). We
conclude the paper by considering a model in which throughput
(rather than delay) is the main performance measure. Again the
pricing strategy exploits the heterogeneity in required service
and willingness-to-pay."
}
@INPROCEEDINGS{Mano0305:Effect,
AUTHOR="Kummini Manoj and Ganesan Thiagarajan",
TITLE="The Effect of Sampling Jitter in {OFDM} Systems",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper we study the effect of random jitter in the sampling
circuit at the receiver in an OFDM communication system. We show
that the effect of jitter can be looked at as interference between
different sub-carriers and derive a lower bound for the variance of
the interference in terms of the eigenvalues of the covariance matrix
of the jitter process. We compare the results with simulation results.
We describe the effect of oversampling on the interference, and provide
an explanation for the way interference varies with sub-carrier index
for different sampling rates."
}
@INPROCEEDINGS{Mano0305:Power,
AUTHOR="Rajit Manohar and Anna Scaglione",
TITLE="Power Optimal Routing in Wireless Networks",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Reducing power consumption and increasing battery life of
nodes in an ad-hoc network requires an integrated power control
and routing strategy. Power optimal routing selects the multi-hop
links that require the minimum total power cost for data
transmission under a constraint on the link quality. This paper
studies optimal power routing under the constraint of a fixed
end-to-end probability of error and compares the power optimal
routes obtained with this criterion with those from the more
commonly used fixed per hop error rate constraint. The comparison
is carried out by looking at the properties of the power optimal
graph, formed by the union of all the power optimal routes. The
paper also provides algorithms to determine the power optimal
routes."
}
@ARTICLE{Mano0307:Use,
AUTHOR="B.s Manoj and C. Siva Ram Murthy",
TITLE="On the use of out-of-band signaling in ad hoc wireless networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=12,
PAGES="1405-1414",
MONTH=jul,
YEAR=2003,
REFERENCES=11,
KEYWORDS="Ad hoc networks; Routing; Out-of-band signaling; In-band signaling",
ABSTRACT="Ad hoc networks consist of a set of uncoordinated nodes which communicate
over wireless links. Many of the existing routing protocols proposed for
ad hoc networks have significant routing overhead, which includes periodic
beacons, flooded RouteRequests, and other path reconfiguration packets. The
overhead depends on the routing protocol, frequency of link breaks, the
number of nodes in the network, and coverage area of the network. In
general, any stability based routing protocol or QoS enhanced routing
protocol needs periodic beacons in order to update stability or QoS
information. The high routing overhead normally consumes a significant
part of total bandwidth available for communication, causing a decrease in
the packet delivery ratio and throughput. In this work, we use out-of-band
signaling in which the bandwidth is partitioned into dedicated data and
control channels and the control channel is used for control traffic
(control packets at the network layer). We study the effects of using the
out-of-band signaling on a simple model routing protocol. We also develop
an analytical model for evaluating the control overhead generated by this
routing protocol. We use out-of-band signaling for a protocol similar to
the model routing protocol and study its impact. The results show that
even though at light load in-band signaling is better than out-of-band
signaling, at high network load out-of-band signaling outperforms in-band
signaling. Packet delivery ratio is improved with out-of-band signaling at
high mobility and high network load.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-4805VF7-2-2W\&\_cdi=5624\&\_orig=browse\&\_coverDate=07\%2F21\%2F2003\&\_sk=999739987\&view=c\&wchp=dGLbVzb-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=152f7ce7f234ef18978de70abe8beb4a\&ie=f.pdf"
}
@TECHREPORT{Mano0312:RDF,
AUTHOR="Frank Manola and Eric Miller and Brian McBride",
TITLE="{RDF} Primer",
TYPE="W3C Proposed Recommendation",
INSTITUTION="World Wide Web Consortium",
MONTH=dec,
YEAR=2003
}
@INPROCEEDINGS{Mao0308:Towards,
AUTHOR="Z. Morley Mao and Jennifer Rexford and Jia Wang and Randy H. Katz",
TITLE="Towards an Accurate AS-Level Traceroute Tool",
BOOKTITLE="SIGCOMM Symposium on Communications Architectures and Protocols",
ORGANIZATION="ACM",
ADDRESS="Karlsruhe, Germany",
MONTH=aug,
YEAR=2003,
REFERENCES=28,
KEYWORDS="Network measurements, AS-level path, Internet topology, Border Gateway
Protocol",
ABSTRACT="Traceroute is widely used to detect routing problems, characterize
end-to-end paths, and discover the Internet topology. Providing an
accurate list of the Autonomous Systems (ASes) along the forwarding
path would make traceroute even more valuable to researchers
and network operators. However, conventional approaches to mapping
traceroute hops to AS numbers are not accurate enough. Address
registries are often incomplete and out-of-date. BGP routing
tables provide a better IP-to-AS mapping, though this approach has
signicant limitations as well. Based on our extensive measurements,
about 10\% of the traceroute paths have one or more hops
that do not map to a unique AS number, and around 15\% of the
traceroute AS paths have an AS loop. In addition, some traceroute
AS paths have extra or missing AS hops due to Internet eXchange
Points, sibling ASes managed by the same institution, and ASes
that do not advertise routes to their infrastructure. Using the BGP
tables as a starting point, we propose techniques for improving the
IP-to-AS mapping as an important step toward an AS-level traceroute
tool. Our algorithms draw on analysis of traceroute probes,
reverse DNS lookups, BGP routing tables, and BGP update messages
collected from multiple locations. We also discuss how the
improved IP-to-AS mapping allows us to home in on cases where
the BGP and traceroute AS paths differ for legitimate reasons.",
URL="http://www.research.att.com/~jrex/papers/sigcomm03.pdf"
}
@INPROCEEDINGS{Marb0305:Game,
AUTHOR="Vladimir Marbukh",
TITLE="A Game Theoretic Framework for Robust Network Provisioning: A
Multicommodity Network Flow Model under Uncertain Demands",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Traditional approaches to network provisioning assume availability of the
reliable estimates for the expected demands. This assumption, however,
oversimplifies many practical situations when some incomplete information
on the expected demands is available, and proper utilization of this
information may improve the network performance. In a case of traffic
engineering the uncertainty in the expected demands may be a result of
sudden changes in the demand pattern when significant statistical
uncertainty in determining the varying demand pattern and possible
undesirable transient effects make continuous adjustment of the routing
algorithm to varying demands difficult. A long-term network provisioning,
e.g., capacity planning, is a subject to uncertainties in overall economic
conditions. Despite the network may be capable of controlling demands
through pricing, the overall economic conditions affect the price-demand
curve. As the recent sharp downturn in the demand for communication
bandwidth demonstrated, making long-term network planning decisions
without assessing reliability of the underlying assumptions on the
expected demands may lead to disastrous results. Assuming that the
expected demand is an unknown mixture of some known scenarios, i.e.,
demand matrices, this paper proposes a framework for robust network
provisioning by guarding against the worst case scenario with respect to
the feasible demand matrices. This framework can be interpreted as a game
between the service provider (network) and the adversarial environment.
The service provider makes the network provisioning decisions in attempt
to minimize losses due to the uncertain demands. The adversarial
environment selects a feasible demand matrix in attempt to maximize these
losses. The solution to this game balances risks of over provisioning and
under provisioning of the network. In a case of traffic engineering over
or under provisioning causes mismatch between the loads and capacities in
the different parts of the network. In a case of long-term network
planning over provisioning results in low or negative return on capital
investment, while under provisioning results in inability to meet demand
and potential lost in the market share. Despite this paper assumes a
multicommodity network flow model, the same approach can be applied to a
flow level network model with random flow arrivals."
}
@ARTICLE{Marb0310:Priority,
AUTHOR="Peter Marbach",
TITLE="Priority Service and Max-Min Fairness",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=5,
PAGES="733-746",
MONTH=oct,
YEAR=2003,
REFERENCES=29,
KEYWORDS="game theory; max-min fairness; pricing; priority service; quality of
service; rate control",
ABSTRACT="We study a priority service where users are free to choose the priority of
their traffic, but are charged accordingly by the network. We assume that
each user chooses priorities to maximize its own net benefit, and model
the resulting interaction among users as a noncooperative game. We show
that there exists an unique equilibrium for this game and that in
equilibrium the bandwidth allocation is weighted max-min fair.",
URL="http://ieeexplore.ieee.org/iel5/90/27747/01237451.pdf?isNumber=27747\&prod=JNL\&arnumber=1237451\&arSt=+733\&ared=+746\&arAuthor=Marbach\%2C+P."
}
@INPROCEEDINGS{Marc0305:Mapping,
AUTHOR="Mario Marchese and Maurizio Mongelli and Alessandro Garibbo",
TITLE="Mapping the Quality of Service over Heterogeneous Networks: a proposal
about architectures and bandwidth allocation",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The paper presents a general framework and some possible architectures to
get a feasible QoS (Quality of Service) mapping among network portions
that use different technologies to provide a fixed service level to the
terminal users. Two important technologies currently used over
telecommunication networks are ATM and IP. The former has been designed to
provide QoS, while the latter, originally designed for a best-effort
service, has been adapted in these last few years to guarantee a specific
QoS by using techniques as Integrated Services and Differentiated
Services. The current situation shows portions of the network implementing
ATM (much used over international backbones) and areas using IP and related
QoS techniques, to list the technologies mainly used. In general, there is
a strong need to have communication among portions implementing different
QoS technologies: a proper architecture, functionalities and protocols
should be defined. The current work, after stating the framework, tries to
propose some architectural solutions and shows a preliminary performance
investigation concerning mapping of a specific QoS parameter as bit loss
among an ATM and an IP portion."
}
@INPROCEEDINGS{Mare0305:Subband,
AUTHOR="Damian Marelli and Minyue Fu",
TITLE="Subband Methods for {OFDM} Equalization",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper we propose two equalization methods for orthogonal
frequency-division multiplexing (OFDM) modulation. These methods are
intended to be alternatives to the known cyclic prefix equalization (CPE)
method, and are derived using ideas from subband identification. The first
proposed method is called subband equalization (SBE) and the second one is
called enhanced cyclic prefix equalization (ECPE). The performance of the
different methods are compared in terms of bit error rate (BER) after
equalization, convergence rate and computational cost in the presence of
noise and fast fading. Both SBE and ECPE outperform the CPE in terms of
BER and convergence rate. The SBE does not require the use of CP, and
therefore saves channel capacity, but needs more computation than CPE.
ECPE requires the use of CP, but its cost is compatible to that of CPE."
}
@ARTICLE{Mark0310:Assessing,
AUTHOR="Athina Markopoulou and Fouad Tobagi and Mansour Karam",
TITLE="Assessing the Quality of Voice Communications Over Internet Backbones",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=5,
PAGES="747-760",
MONTH=oct,
YEAR=2003,
REFERENCES=44,
KEYWORDS="computer networks; Internet; measurements; voice communications; voice over
IP (VoIP); voice quality assessment",
ABSTRACT="As the Internet evolves into a ubiquitous communication infrastructure and
provides various services including telephony, it will be expected to meet
the quality standards achieved in the public switched telephone network.
Our objective in this paper is to assess to what extent today's Internet
meets this expectation. Our assessment is based on delay and loss
measurements taken over wide-area backbone networks and uses subjective
voice quality measures capturing the various impairments incurred. First,
we compile the results of various studies into a single model for
assessing the voice-over-IP (VoIP) quality. Then, we identify different
types of typical Internet paths and study their VoIP performance. For each
type of path, we identify those characteristics that affect the VoIP
perceived quality. Such characteristics include the network loss and the
delay variability that should be appropriately handled by the playout
scheduling at the receiver. Our findings indicate that although voice
services can be adequately provided by some ISPs, a significant number of
Internet backbone paths lead to poor performance.",
URL="http://ieeexplore.ieee.org/iel5/90/27747/01237453.pdf?isNumber=27747\&prod=JNL\&arnumber=1237453\&arSt=+747\&ared=+760\&arAuthor=Markopoulou\%2C+A.P.\%3B+Tobagi\%2C+F.A.\%3B+Karam\%2C+M.J."
}
@ARTICLE{Mark0311:Mobility,
AUTHOR="Jon Mark and Jp Pan and Sherman S.",
TITLE="Mobility support in hybrid wireless/IP networking",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=17,
PAGES="1990-1997",
MONTH=nov,
YEAR=2003,
REFERENCES=30,
KEYWORDS="Mobility; Transmission control protocol; Performance degradation",
ABSTRACT="The ramifications of Transmission Control Protocol (TCP)/Internet Protocol
(IP) networking with mobile hosts and wireless links in a hybrid
wireless/IP environment are examined. Two issues that affect the
performance of TCP/IP are mobility support in the network layer and coping
with packet errors in TCP flow/congestion control in the transport layer.
The operational features of agent-assisted, router-oriented and hybrid
strategies for mobility support are identified and discussed. Packet
errors due to transmission through the wireless channel and handover
induced by user mobility can pose problem for the conventional TCP flow
control in the transport layer. Strategies to cope with errors in packets
that enter the TCP connection are described and discussed.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-48S2S1G-1-K\&\_cdi=5624\&\_orig=browse\&\_coverDate=11\%2F01\%2F2003\&\_sk=999739982\&view=c\&wchp=dGLbVlb-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=af96c992cc47c1a4e8d879e4e7e02886\&ie=f.pdf"
}
@INPROCEEDINGS{Mars0303:Instability,
AUTHOR="Marco {Ajmone Marsan} and Mirko Franceschinis and Emilio Leonardi and Fabio
Neri and Alessandro Tarello",
TITLE="Instability Phenomena in Underloaded Packet Networks with QoS Schedulers",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Instability in packet-switching networks is normally associated with
overload conditions, since queueing network models show that, in simple
configurations, only overload generates instability. However, some results
showing that instability can happen also in underloaded queueing networks
appeared in the recent literature. Underload instabilities can be produced
by complex scheduling algorithms, that bear significant resemblance to the
Quality of Service (QoS) schedulers considered today for packet networks.
In this paper, we study with fluid models and with adversarial queueing
theory possible underload instabilities due to strict-priority schedulers
and to Generalized Processor Sharing (GPS) schedulers."
}
@INPROCEEDINGS{Mars0303:Local,
AUTHOR="Marco {Ajmone Marsan} and Paolo Giaccone and Emilio Leonardi and Fabio Neri",
TITLE="Local Scheduling Policies in Networks of Packet Switches with Input Queues",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="A significant research effort has been devoted in recent years to the
design of simple and efficient scheduling policies for Input Queued (IQ)
and Combined Input Output Queued (CIOQ) packet switches. As a result, a
number of switch control algorithms have been proposed. Among these,
scheduling policies based on Maximum Weight Matching (MWM) were identified
as optimal, in the sense that they were proved to achieve 100\% throughput
under any admissible arrival process satisfying the strong law of large
number.
On the contrary, it has been recently shown that the usual MWM policies
fail to guarantee 100\% throughput in networks of interconnected IQ/CIOQ
switches. Hence, new policies suited for networks of interconnected
switches were proposed and proved to achieve 100\% throughput. All of
these new policies require coordination and cooperation among different
switches.
In this paper we address the open problem of the existence of local
scheduling policies that guarantee 100\% throughput in a network of
IQ/CIOQ switches, providing a positive answer to such question. The only
assumptions on the input traffic are that it satisfies the strong law of
large numbers and that it does not oversubscribe any link in the network."
}
@INPROCEEDINGS{Mars0303:Packet,
AUTHOR="Marco {Ajmone Marsan} and Paola Laface and Michela Meo",
TITLE="Packet Delay Analysis in {GPRS} Systems",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="In this paper we describe an analytical model to compute the packet delay
distribution in a cell of a wireless network operating according to
the GSM/GPRS standard. GSM is the Global System for Mobile communications,
the most widely deployed wireless telephony standard, and GPRS
(Generalized Packet Radio Service) is the technology that is now available
to integrate packet data services into GSM networks.
By comparing the performance estimates produced by the analytical model
against those generated with detailed simulation experiments, we show that
the proposed modeling techniques is quite accurate. In addition,
we show that the results produced by the analytical model are extremely
useful in the design and planning of a wireless voice and data network."
}
@ARTICLE{Mars0305:Evaluating,
AUTHOR="Marik Marshak and Hanoch Levy",
TITLE="Evaluating web user perceived latency using server side measurements",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=8,
PAGES="872-887",
MONTH=may,
YEAR=2003,
REFERENCES=24,
KEYWORDS="Web server; Perceived user latency; HTTP; Local measuring",
ABSTRACT="The central performance problem in the World Wide Web, in recent years, is
user perceived latency. This is the time spent by a user while waiting for
a Web page he/she requested. Impatience with poor performance is the most
common reason visitors terminate their visit at Web sites. For e-commerce
sites, such abandonment translates into lost revenue. For this reason,
measuring the delay experienced by its customers is of high importance to
a Web site. These measurements are critical for analyzing the site
behavior and to size its components. As of today the main tool for
conducting such measurements are external, client-side tools, whereby
agents located on the net request pages from the site and measure its
latency. In this paper we propose a novel solution that conducts the
measurements of the user perceived delay at the Web site. The major
advantage of this measurement approach, as opposed to client side
approach, is that it can evaluate the latency experienced by each and
every client (regardless of its network location). Further, this estimate
can be conducted at real time, thus allowing the server to control its
operation and prioritize the requests based on the actual performance
observed by the clients. The solution does not require any agents to be
placed at the net. Further, it does not sniff low-level protocols (that
is, IP protocols) and is all based on implementation at the HTTP level. As
such, it is very efficient and economical. The solution is based on a novel
technique in which a special tiny HTTP object, which is called the sentry
and which is inserted at the end of the HTTP document, assists in
measuring the user perceived latency. The algorithm is implemented on the
Apache server. The implementation was tested throughout an extensive array
of tests and found to provide very accurate measures (whose relative errors
were in the order of several percents only).",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-4753K38-2-1D\&\_cdi=5624\&\_orig=browse\&\_coverDate=05\%2F20\%2F2003\&\_sk=999739991\&view=c\&wchp=dGLbVtb-zSkzS\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=b410fa0909c932b6ae4f435a08bb6b10\&ie=f.pdf"
}
@ARTICLE{Mars0306:Multicast,
AUTHOR="Marco {Ajmone Marsan} and Andrea Bianco and Paolo Giaccone and Emilio
Leonardi and Fabio Neri",
TITLE="Multicast Traffic in Input-Queued Switches: Optimal Scheduling and Maximum
Throughput",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=3,
PAGES="465-477",
MONTH=jun,
YEAR=2003,
REFERENCES=18,
KEYWORDS="input queued switches; multicast traffic; scheduling; switching",
ABSTRACT="The paper studies input-queued packet switches loaded with both unicast and
multicast traffic. The packet switch architecture is assumed to comprise a
switching fabric with multicast (and broadcast) capabilities, operating in
a synchronous slotted fashion. Fixed-size data units, called cells, are
transferred from each switch input to any set of outputs in one time slot,
according to the decisions of the switch scheduler, that identifies at each
time slot a set of nonconflicting cells, i.e., cells neither coming from
the same input, nor directed to the same output. First, multicast traffic
admissibility conditions are discussed, and a simple counterexample is
presented, showing intrinsic performance losses of input-queued with
respect to output-queued switch architectures. Second, the optimal
scheduling discipline to transfer multicast packets from inputs to outputs
is defined. This discipline is rather complex, requires a queuing
architecture that probably is not implementable, and does not guarantee
in-sequence delivery of data. However, from the definition of the optimal
multicast scheduling discipline, the formal characterization of the
sustainable multicast traffic region naturally follows. Then, several
theorems showing intrinsic performance losses of input-queued with respect
to output-queued switch architectures are proved. In particular, we prove
that, when using per multicast flow FIFO queueing architectures, the
internal speedup that guarantees 100\% throughput under admissible traffic
grows with the number of switch ports.",
URL="http://ieeexplore.ieee.org/iel5/90/27187/01208306.pdf?isNumber=27187\&prod=JNL\&arnumber=1208306\&arSt=+465\&ared=+477\&arAuthor=Marsan\%2C+M.A.\%3B+Bianco\%2C+A.\%3B+Giaccone\%2C+P.\%3B+Leonardi\%2C+E.\%3B+Neri\%2C+F."
}
@INPROCEEDINGS{Mart0305:Comparing,
AUTHOR="Emin Martinian and Gregory Wornell and J. Nicholas Laneman and Susie Wee
and John Apostolopoulos",
TITLE="Comparing Application and Physical Layeer Approaches To Diversity on
Wireless Channels",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Diversity techniques often arise as appealing means for improving
performance (and robustness) of multimedia communication over certain
types of channels with independent parallel components (e.g., multiple
antennas, frequency bands, or time slots). Diversity (and the
accompanying robustness) can be obtained by channel coding across
parallel components at the physical layer. Alternatively, the
physical layer can present an interface to the parallel components as
separate, independent links thus allowing the application layer to
implement diversity in the form of multiple description source
coding. We compare these two approaches in terms of average
end-to-end distortion as a function of channel signal-to-noise ratio
(SNR). When specialized to the case of an independent, identically
distributed Gaussian source over frequency non-selective Rayleigh
fading channels, our results suggest that parallel channel coding at
the physical layer is more efficient than independent channel coding
combined with multiple description source coding. More generally, we
provide intuitive guidelines for allowing system designers to identify
which types of systems are preferable under different scenarios of
practical interest."
}
@ARTICLE{Mart0306:Delay,
AUTHOR="Jim Martin and Arne Nilsson and Injong Rhee",
TITLE="Delay-Based Congestion Avoidance for {TCP}",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=3,
PAGES="356-369",
MONTH=jun,
YEAR=2003,
REFERENCES=41,
KEYWORDS="TCP congestion control; delay-based congestion avoidance (DCA); TCP Vegas;
loss and round-trip time (RTT) correlation patterns",
ABSTRACT="The set of TCP congestion control algorithms associated with TCP-Reno
(e.g., slow-start and congestion avoidance) have been crucial to ensuring
the stability of the Internet. Algorithms such as TCP-NewReno (which has
been deployed) and TCP-Vegas (which has not been deployed) represent
incrementally deployable enhancements to TCP as they have been shown to
improve a TCP connection's throughput without degrading performance to
competing flows. Our research focuses on delay-based congestion avoidance
algorithms (DCA), like TCP-Vegas, which attempt to utilize the congestion
information contained in packet round-trip time (RTT) samples. Through
measurement and simulation, we show evidence suggesting that a single
deployment of DCA (i.e., a TCP connection enhanced with a DCA algorithm)
is not a viable enhancement to TCP over high-speed paths. We define
several performance metrics that quantify the level of correlation between
packet loss and RTT. Based on our measurement analysis, we find that,
although there is useful congestion information contained within RTT
samples, the level of correlation between an increase in RTT and packet
loss is not strong enough to allow a TCP-sender to improve throughput
reliably. While DCA is able to reduce the packet loss rate experienced by
a connection, in its attempts to avoid packet loss, the algorithm reacts
unnecessarily to RTT variation that is not associated with packet loss.
The result is degraded throughput as compared to a similar flow that does
not support DCA.",
URL="http://ieeexplore.ieee.org/iel5/90/27187/01208298.pdf?isNumber=27187\&prod=JNL\&arnumber=1208298\&arSt=+356\&ared=+369\&arAuthor=Martin\%2C+J.\%3B+Nilsson\%2C+A.\%3B+Injong+Rhee"
}
@INPROCEEDINGS{Marz0305:Adding,
AUTHOR="Jose Marzo and Eusebi Ortega and Caterina Scoglio and Tricha Anjali",
TITLE="Adding QoS Protection in Order to Enhance {MPLS} QoS Routing",
BOOKTITLE="International Conference on Communications",
ADDRESS="Anchorage, Alaska",
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, a method for enhancing current QoS routing methods by means
of QoS protection is presented. In an MPLS network, the segments (links)
to be protected are pre-defined and an LSP request involves, apart from
establishing a working path, creating a specific type of backup path
(local, reverse or global). Different QoS parameters, such as network load
balancing, resource optimization and minimization of LSP request rejection
should be considered. QoS protection is defined as a function of QoS
parameters, such as packet loss, restoration time, and resource
optimization. A framework to add QoS protection to many of the current QoS
routing algorithms is introduced. A Backup Decision Module to select the
most suitable protection method is formulated and different case studies
are analyzed.",
URL="http://www.ece.gatech.edu/~tricha/marzo-icc.doc"
}
@ARTICLE{Marz0309:Distributed,
AUTHOR="Jose Marzo and Pere Vila and Lluís {Fàbrega} and Daniel Massaguer",
TITLE="A distributed simulator for network resource management investigation",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=15,
PAGES="1782-1791",
MONTH=sep,
YEAR=2003,
REFERENCES=21,
KEYWORDS="Distributed simulation; Client/server network management and control;
Multi-Protocol Label Switching; Asynchronous Transfer Mode",
ABSTRACT="Network resource management deals with protocols and networks capable of
performing a reservation of the available resources in order to guarantee
a certain Quality of Service (QoS). Examples of these technologies are
Asynchronous Transfer Mode (ATM) and Multi-Protocol Label Switching
(MPLS), which are usually used in core networks. An important objective of
network providers is to obtain the maximum profit from their resources;
hence there is a need for an efficient resource management. Investigation
in this field is difficult, mainly because network research laboratories
do not have a large core network where they can investigate their
approaches and algorithms.
This paper presents a simple but flexible distributed simulator that
supports a wide range of different experiments. It is based on an
event-oriented simulation at a connection level (no packet or cell
granularity). The distributed simulator is oriented to the simulation of
large core networks and support different routing and admission control
algorithms. The simulator must also support the development of different
resource management architectures: centralised, distributed, hybrid, based
on artificial intelligence techniques, etc.
The paper also presents the scenario where this simulator can be used,
mainly in the context of Traffic Engineering, i.e. dynamic bandwidth
management and fast restoration mechanisms. Examples of different
management applications and experiments performed using the simulator are
presented.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-4816WFW-1-14\&\_cdi=5624\&\_orig=browse\&\_coverDate=09\%2F22\%2F2003\&\_sk=999739984\&view=c\&wchp=dGLbVzz-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=984e7077a3c437bd8c90196a3cb72378\&ie=f.pdf"
}
@ARTICLE{Marz0310:Qos,
AUTHOR="Jose Marzo and Eusebi {Calle Ortega} and Caterina Scoglio and Tricha Anjali",
TITLE="QoS Online Routing and {MPLS} Multilevel Protection: A Survey",
JOURNAL="IEEE Communications Magazine",
VOLUME=41,
NUMBER=10,
PAGES="126-132",
MONTH=oct,
YEAR=2003,
REFERENCES=10,
KEYWORDS="QoS routing, MPLS, Protection",
ABSTRACT="A survey of MPLS protection methods and their utilization in combination
with online routing methods is presented in this article. Usually, fault
management methods pre-establish backup paths to recover traffic after a
failure. In addition, MPLS allows the creation of different backup types,
and hence MPLS is a suitable method to support traffic-engineered
networks. In this article, an introduction of several label switch path
backup types and their pros and cons are pointed out. The creation of an
LSP involves a routing phase, which should include QoS aspects. In a
similar way, to achieve a reliable network the LSP backups must also be
routed by a QoS routing method. When LSP creation requests arrive one by
one (a dynamic network scenario), online routing methods are applied. The
relationship between MPLS fault management and QoS online routing methods
is unavoidable, in particular during the creation of LSP backups. Both
aspects are discussed in this article. Several ideas on how these actual
technologies could be applied together are presented and compared.",
URL="http://users.ece.gatech.edu/~tricha/qos-routing.pdf"
}
@INPROCEEDINGS{Masi0305:Qos,
AUTHOR="Xavier Masip-Bruin and Sergio {Sánchez-López} and Josep {Solé-Pareta}
and Jordi Domingo-Pascual",
TITLE="QoS Routing Algorithms under Inaccurate Routing Information for Bandwidth
Constrained Applications",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Multiprotocol Label Switching and Traffic Engineering are proposed by
the IETF to improve the network performance. Moreover, some QoS routing
algorithms must be added in order to optimize the path selection
process. However, in highly dynamic large networks, existing QoS routing
algorithms suffer from a blocking probability, which in part is due to
the existence of inaccuracy in the network state information used to
select the path. This paper deals with the BYPASS based routing (BBR)
mechanism, which was introduced in a previous paper to overcome this
routing inaccuracy effect in IP/MPLS scenarios. We suggest an
enhancement of the BBR mechanism to optimize the bandwidth allocation
by balancing the path length and the re-sidual bandwidth, and its
performance is evaluated by simulation."
}
@INPROCEEDINGS{Matr0305:Real,
AUTHOR="Ashraf Matrawy and Ioannis Lambadaris",
TITLE="Real-time Transport for Assured Forwarding: An Architecture for both
Unicast and Multicast Applications",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper presents a summary of our work on developing an
architecture for transporting real-time
traffic (MPEG4 video in this paper) in IP networks that provide service
differentiation. We target our architecture at Assured Forwarding (AF)
style
services. This architecture assumes loss differentiation in the
network and the network's ability to provide ECN messages to the sender.
We did not consider policing/shaping at the edge routers. Rather we
considered a more general case where marking and flow control are
provided at the senders. For this network model, we developed
a rate adaptation algorithm that can operate in both unicast and
multicast applications with a minor modification.
The simulation results presented in this paper represent the multicast
case. It shows how the rate adaptation algorithm accommodates
different receivers with different networking capabilities and
provides them with different qualities by taking advantage of the
queue management capabilities of the AF
service. We also show the results of testing this architecture with
different AF queuing mechanisms, namely RIO and WRED."
}
@INPROCEEDINGS{Mats0305:Analysis,
AUTHOR="Takao Matsumoto and Hitoshi Otsuki",
TITLE="Analysis of the Effect of Supplementing a Shortcut Link to Ring Networks",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Effect of a shortcut link between two nodes in a ring network is examined.
Two cases of connection between a node pair are considered: a single-path
and a 2-path connection. In both cases, under certain conditions,
supplementing a shortcut link to a ring network proved effective in terms
cost and reliability of the network."
}
@INPROCEEDINGS{Mats0305:End,
AUTHOR="Hosei Matsuoka and Takeshi Yoshimura and Tomoyuki Ohya",
TITLE="End-to-End Robust {IP} Soft Handover",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We describe the design and implementation of a new transport layer
protocol, MMSP (Mobile Multimedia Streaming Protocol), that supports
bicasting in combination with FEC. MMSP duplicates the packets to be sent
through the creation of redundant packets that are Reed-Solomon coded and
sends them through two different paths to avoid data loss during handover.
We call this mechanism End-to-End Robust IP soft handover; it enables
mobile terminals to move without any data loss and also improves error
resiliency against wireless errors. Thus it is well suited to many common
real-time multimedia applications for which retransmission is
inappropriate. Our architecture requires no changes to the existing IP
networks so it allows for easy deployment. Our performance experiments
show that while FEC processing causes some slight delay, such delay is
allowable. Bicasting with FEC can provide high quality MPEG-4 transport
even under high bit error rates."
}
@INPROCEEDINGS{Mats03:Multihoming,
AUTHOR="Arifumi Matsumoto and Masataka Ohta and Fumio Teraoka and Mitsunobu Kunishi
and Masahiro Ishiyama",
TITLE="Multihoming Support Based on Mobile Node Protocol {LIN6}",
BOOKTITLE="Submitted to SAINT2003?",
YEAR=2003,
NOTE="{http://www.lab1.kuis.kyoto-u.ac.jp/\~arifumi/paper/saint2003/lin6api.pdf
accessed November 2002}"
}
@INPROCEEDINGS{Matt0306:Source,
AUTHOR="Johnny Matta and Christine Pepin and Khosrow Lashkari and Ravi Jain",
TITLE="A Source and Channel Rate Adaptation Algorithm for {AMR} in VoIP Using the
Emodel",
BOOKTITLE="ACM NOSSDAV 2003",
ADDRESS="Monterey, California, USC",
DAYS=1,
MONTH=jun,
YEAR=2003,
ABSTRACT="We present a dynamic joint source and channel coding adaptation algorithm
for the AMR speech codec based on the ITU-T Emodel. This model takes both
delay and packet loss into consideration. We address the problem of
finding the optimal choice of source and channel bit rates given QoS
information about the wired and wireless IP network and subject to
constraints on maximum packet loss, maximum delay and maximum allowed
transmission rate. Our results show that an adaptation is necessary to
preserve acceptable levels of quality while making optimal use of allowed
bandwidth. Our technique requires a small number of computations that
allows it to operate in real time and in parallel to voice streams."
}
@INPROCEEDINGS{Matz0305:Characterization,
AUTHOR="Gerald Matz",
TITLE="Characterization of non-WSSUS fading dispersive channels",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We present several novel tools for the statistical characterization
of fading dispersive channels that do not satisfy the usual WSSUS
assumption. A local scattering function, describing the average time-
and frequency-dependent scatterer power, is introduced. Furthermore,
a novel channel correlation function that quantifies the scatterer
correlation is presented. Based on the channel correlation function,
we introduce the practically important class of doubly underspread
channels. Numerical results involving a simulated and a measured
channel illustrate the usefulness of our framework."
}
@TECHREPORT{McGl0302:Voice,
AUTHOR="Scott McGlashan and Daniel Burnett and Jerry Carter and Steph Tryphonas and
Jim Ferrans and Test User and Bruce Lucas and Brad Porter",
TITLE="Voice Extensible Markup Language (VoiceXML) Version {2.0}",
INSTITUTION="World Wide Web Consortium (W3C)",
MONTH=feb,
YEAR=2003,
REFERENCES=31,
NOTE="http://www.w3.org/TR/voicexml20/",
ABSTRACT="This document specifies VoiceXML, the Voice Extensible Markup Language.
VoiceXML is designed for creating audio dialogs that feature synthesized
speech, digitized audio, recognition of spoken and DTMF key input,
recording of spoken input, telephony, and mixed initiative conversations.
Its major goal is to bring the advantages of web-based development and
content delivery to interactive voice response applications.",
URL="http://www.w3.org/TR/voicexml20/"
}
@INPROCEEDINGS{Mehr0303:Receiver,
AUTHOR="Puneet Mehra and Christophe {De Vleeschouwer} and Avideh Zakhor",
TITLE="Receiver-Driven Bandwidth Sharing for {TCP}",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Applications using TCP, such as web-browsers, ftp, and various P2P
programs, dominate most of the Internet traffic today. In many cases
the last-hop access links are a network bottleneck due to their limited
bandwidth capability with users running many simultaneous network
applications. Standard TCP shares bottleneck link capacity according to
connection round-trip time (RTT), and may result in a bandwidth partition
which does not necessarily coincide with the user's desires. We present a
receiver-based control system for allocating bandwidth among TCP flows
according to user preferences. Our system does not require any changes to
network infrastructure, and works
with standard TCP senders. Ns-2 simulations, as well as actual Internet
experiments, show that our system is able to achieve desired bandwidth
allocation in a wide variety of scenarios including interfering
cross-traffic. We also demonstrate the viability of using our system to
perform multimedia streaming over TCP."
}
@INPROCEEDINGS{Meht0305:Optimal,
AUTHOR="Dinesh Mehta and Mario Lopez and Lan Lin",
TITLE="Optimal Coverage Paths in Ad-hoc Sensor Networks",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper discusses the computation of optimal coverage paths in an ad-hoc
network consisting of n sensors. Improved algorithms, with a preprocessing
time of O(n log n), to compute a maximum breach/support path P in optimal
O(|P|) time or the maximum breach/support value in O(1) time are
presented.
Algorithms for computing a shortest path that has maximum breach/support
are
also provided. Experimental results for breach paths show that the
shortest
path length is on the average 30\\% less and is not much worse than the
ideal
straight line path. For applications that require redundancy (i.e.,
detection
by multiple sensors), a generalization of Voronoi diagrams allows us to
compute maximum breach paths where breach is defined as the distance to
the k'th
nearest sensor in the field. Extensive experimental results are provided."
}
@ARTICLE{Mei0311:Sojourn,
AUTHOR="R. {van der Mei} and J.l. {van den Berg} and R. Vranken and B. Gijsen",
TITLE="Sojourn-time approximations for a multi-server processor sharing system
with priorities",
JOURNAL="Performance Evaluation",
VOLUME=54,
NUMBER=3,
PAGES="249-261",
MONTH=nov,
YEAR=2003,
REFERENCES=15,
KEYWORDS="Sojourn-time approximations; Process sharing system; Symmetric queues;
Priorities",
ABSTRACT="We study mean sojourn times in a multi-server processor sharing system with
two priority classes and with general service-time distributions. For
high-priority customers, the mean sojourn time follows directly from
classical results on symmetric queues. For low-priority customers, in the
absence of exact results, we propose a simple and explicit approximation
for the mean sojourn time. Extensive numerical experiments demonstrate
that the approximations are highly accurate for a wide range of parameter
settings.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-493PC4M-1-81\&\_cdi=5663\&\_orig=browse\&\_coverDate=11\%2F30\%2F2003\&\_sk=999459996\&view=c\&wchp=dGLbVzz-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=70a7460d15af8f7cd656a1edb747b860\&ie=f.pdf"
}
@INPROCEEDINGS{Melv0305:Evaluation,
AUTHOR="Hugh Melvin",
TITLE="An evaluation of the potential of synchronized time to improve VoIP quality",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Delivering PSTN-like quality over current best-effort Internet
infrastructure presents many technical challenges. Much research in recent
years has focused on receiver-based approaches which adapt to varying
network conditions in order to optimize playout quality. In this paper, we
describe a new approach that implements a hybrid adaptive-fixed playout
regime by integrating synchronized time via NTP into the receiver playout
algorithm. We suggest that such an approach can deliver significantly
better quality than existing adaptive techniques particularly when the
underlying network is not heavily congested and end-to-end delays are not
excessive. We present some initial results from our testbed system using
the ITU-T E-model to quantify improvements."
}
@ARTICLE{Memo0304:Synchronized,
AUTHOR="Qurban Memon",
TITLE="Synchronized choas for network security",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=6,
PAGES="498-505",
MONTH=apr,
YEAR=2003,
REFERENCES=9,
KEYWORDS="Chaotic signals; Synchronized chaos; Network security; Encryption;
Decryption",
ABSTRACT="The term chaos theory is used widely to describe an emerging scientific
discipline whose boundaries are not clearly defined. In this paper, we
report implementation of encryption of signal in networked environment
using synchronized chaos. We utilize this unpredictable, random phenomenon
called chaos to code our information using superimposition. We applied this
approach to different formats of data and results were positive in the
sense that decoded files were run without error. Specifically, we have
discussed, in detail, the implementation of such system for off-line as
well as on-line applications. We observed that the size of the encrypted
file is proportional to the size of the original file and there, infact,
exists a linear relationship. The testing scenario encourages use of chaos
in information coding across networks. It is shown that, in this
environment, the security breach may not be possible even if
hacker/intruder has compatible encoder/decoder, and the key is also
accessible.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-46SP0HB-1-17\&\_cdi=5624\&\_orig=browse\&\_coverDate=04\%2F15\%2F2003\&\_sk=999739993\&view=c\&wchp=dGLbVlz-zSkWW\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=167189c187e21374e8c163109b0893fd\&ie=f.pdf"
}
@ARTICLE{Mena0309:Hierarchical,
AUTHOR="Daniel Menascé and Virglio Almeida and Rudolf Riedi and F. Ribeiro and
Rodrigo Fonseca and W. Meira,",
TITLE="A hierarchical and multiscale approach to analyze E-business workloads",
JOURNAL="Performance Evaluation",
VOLUME=54,
NUMBER=1,
PAGES="33-57",
MONTH=sep,
YEAR=2003,
REFERENCES=22,
KEYWORDS="E-business; WWW; Workload characterization; Performance modeling;
Heavy-tailed distribution",
ABSTRACT="Understanding the characteristics of electronic business (E-business)
workloads is a crucial step to improve the quality of service offered to
customers in E-business environments. This paper proposes a hierarchical
and multiple time scale approach to characterize E-business workloads. The
three levels of the hierarchy are user, application, and protocol, and are
associated with customer sessions, functions requested, and HTTP requests,
respectively. Within each layer, an analysis across several time scales is
conducted. The approach is illustrated by presenting a detailed
characterization of two actual E-business sites: an online bookstore and
an electronic auction site. Our analysis of the workloads showed that the
session length, measured in number of requests to execute E-business
functions, is heavy-tailed, especially for sites subject to requests
generated by robots. An overwhelming majority of the sessions consist of
only a handful requests, which seems to suggest that most customers are
human (as opposed to robots). A significant fraction of the functions
requested by customers were found to be product selection functions as
opposed to product ordering. An analysis of the popularity of search terms
revealed that it follows a Zipf distribution. However, Zipfs law as applied
to E-business is time scale dependent due to the shift in popularity of
search terms. We also found that requests to execute frequent E-business
functions exhibit a pattern similar to the HTTP request arrival process.
Finally, we demonstrated that there is a strong correlation in the arrival
process at the HTTP request level. These correlations are particularly
stronger at intermediate time scales of a few minutes.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-4817DX4-1-3P\&\_cdi=5663\&\_orig=browse\&\_coverDate=09\%2F30\%2F2003\&\_sk=999459998\&view=c\&wchp=dGLbVzb-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=29cc5100ce8b5b084fcdd739e8594db9\&ie=f.pdf"
}
@INPROCEEDINGS{Mend0309:Context,
AUTHOR="Paulo Mendes and Christian Prehofer and Qing Wei",
TITLE="Context Management with Programmable Mobile Networks",
BOOKTITLE="IEEE Computer Communication Workshop",
MONTH=sep,
YEAR=2003,
KEYWORDS="Context-awareness; Active Networking; Mobile Networks"
}
@TECHREPORT{Ment0302:Impact,
AUTHOR="Michael Menth and Stefan Kopf and Jens Milbrandt",
TITLE="Impact of Network Topology on the Performance of Budget-Based Network
Admission Control Methods",
INSTITUTION="Department of Distributed Systems, University of Wurzburg",
NUMBER=308,
ADDRESS="Wurzburg, Germany",
MONTH=feb,
YEAR=2003,
KEYWORDS="resource reservation",
ABSTRACT="Budget based network admission control (NAC) mechanisms can be categorized
into four basically distinct approaches. Since they have different
complexity and efficiency, we compare their resource utilization in
different networking scenarios. Our results show that the network size,
the connectivity, and the internal structure of the network have a
significant impact on the resource efficiency. Some NAC approaches can
achieve a very high utilization if the offered load is large enough,
while the performance of others is limited by the network topology. This
study does not focus on specific protocols because the presented NAC
schemes classify most existing resource management schemes. It is intended
to optimize the NAC design for future QoS networks.",
URL="http://www3.informatik.uni-wuerzburg.de/TR/tr308.pdf"
}
@INPROCEEDINGS{Ment0303:MEDF,
AUTHOR="Michael Menth and Matthias Schmid and Herbert Heiss and Thomas Reim",
TITLE="{MEDF} - A Simple Scheduling Algorithm for Two Real-Time Transport Service
Classes with Application in the {UTRAN}",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="In this paper, we consider real-time speech traffic, real-time
circuit-switched data (CSD) and non-real-time packet-switched data
(PSD) in the UMTS Terrestrial Radio Access Network (UTRAN). The
focus is on the single low-bandwidth link that interconnects the
Radio Network Controller (RNC) and the base station (Node B). We
show that all traffic on this link has real-time requirements. But
we take advantage of the Radio Link Control (RLC) layer protocol
and formulate suitable quality of service (QoS) criteria that lead
to two different transport service classes (TSC): A stringent TSC
for speech traffic and CSD, and a tolerant TSC for PSD. The RNC
transmits packets from both TSCs via a single low-bandwidth link
to the Node B. Since transmission capacity on this interface is a
serious cost factor in the UTRAN, the link utilization should be
optimized while respecting the QoS requirements of both TSCs. We
propose a modified version (MEDF) of the Earliest Deadline First
(EDF) algorithm for that task. In contrast to EDF, the MEDF is
easy to implement in hardware and in contrast to algorithms like
Weighted Fair Queuing (WFQ), the knowledge of the traffic mix is
not needed for a suitable parameter setting in the MEDF scheduler.
The simulation results show its superiority over
First-In-First-Out (FIFO), Static Priority (SP), and Weighted
Round Robin (WRR) scheduling. The analysis of the waiting time
distribution explains why MEDF performs better than the other
scheduling strategies."
}
@INPROCEEDINGS{Meri0305:New,
AUTHOR="Mahmoud Meribout",
TITLE="A New Dynamic Reconfigurable Hardware Architecture for High-Throughput
networking Applications and its Design Methodology",
BOOKTITLE="ICC 2003 - Global Services and Infrastructure for Next Generation Networks",
ADDRESS="Anchorage, Alaska",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Recent efforts to add new services to the Internet have increased the
interest in designing flexible routers that are easy to extend and evolve.
This paper describes a new hardware architecture based on Dynamic
Reconfigurable Logic (DRL) for high throughput networking applications. It
mainly focuses on content-based router and on how to schedule efficiently
its computation time. This scheduling task is difficult because of the
various features of the underlying hardware such as multicontext,
control-data path architecture and memory interface.
Experimental results show some improvements over most recent network
processors as well as a better hardware synthesis methodology."
}
@INPROCEEDINGS{Mess0305:Estimation,
AUTHOR="Geoffrey Messier and Witold Krzymien",
TITLE="Estimation of In-Cell and Out-of-Cell Interference Levels for Improved
{CDMA} Forward Link Error Correction",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This work uses the second order statistics of the signal received by a CDMA
mobile to determine what proportion of that signal consists of in-cell
interference and what proportion is out-of-cell interference plus thermal
noise. A least-squares estimator is derived and compared to the
Cramer-Rao Lower Bound. The interference estimates are also incorporated
into the CDMA mobile channel decoder in order to improve the performance
of convolutional and turbo codes on the CDMA forward link."
}
@INPROCEEDINGS{Mham0305:Practical,
AUTHOR="Lotfi Mhamdi and Mounir Hamdi",
TITLE="Practical Scheduling Algorithms for High-Performance Packet Switches",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="As we enter the twenty-first century, the Internet continues to experience
extraordinary growth. Any way one measures it, the growth is remarkable on
all fronts - the number of hosts, the number of users, the amount of
traffic, the number of links, the bandwidth of individual links, or the
growth rates of Internet Service provider (ISP) networks. This continued
tremendous growth, coupled with the variety of services that the Internet
is expected to provide, creates two main challenges for the design and
implementation of packet switches (IP Routers, ATM switches, Gigabit
Ethernet switches and Frame Relay switches): queue management and packet
forwarding.
First, to keep pace with the growth in Internet usage, we need higher
capacity packet switches with aggregate data rates of multiple terabits
per second and forwarding rates of billions of packets per second.
Limitations in memory bandwidth and interconnect technology, along with
the challenges of system packaging and managing system power, mean that
new architectures and techniques are needed to keep pace with capacity
requirements. Second, so long as the network capacity is limited, there
will be a desire to provision a variety of service classes for users whose
traffic requires special service, such as guaranteed delay, bounded delay
variation, minimal packet loss or controlled access. While it is generally
well known how to provide these services at low speed, it requires further
research and investigation to determine how they can be delivered in a
very high capacity network.
In this paper, we introduce an efficient switching architecture, along
with the appropriate scheduling algorithms, to achieve the above goals in
a Gigabit/Terabit networking environment. In particular, this switching
architecture, based on the internally buffered crossbar, is able to
sustain the current and expected increases in Internet throughput rates
through distributed scheduling algorithms. As will be shown, the
distributed nature of these algorithms makes them of practical value. That
is, they can be implemented in real-time for high-speed input traffic. In
addition, we will demonstrate that these scheduling algorithms outperform
state-of-the-art related algorithms in this area."
}
@MISC{Micr0308:Active,
AUTHOR=" Microsoft",
TITLE="Active Server Pages",
MONTH=aug,
YEAR=2003,
NOTE="http://msdn.microsoft.com/asp/",
KEYWORDS="asp; active server pages; web services",
ABSTRACT="Microsoft Active Server Pages (ASP) is a server-side scripting environment
that you can use to create and run dynamic, interactive Web server
applications. With ASP, you can combine HTML pages, script commands, and
COM components to create interactive Web pages or powerful Web-based
applications, which are easy to develop and modify.",
URL="http://msdn.microsoft.com/asp/"
}
@ARTICLE{Mieg0303:Complexity,
AUTHOR="Piet {Van Mieghem} and Fernando Kuipers",
TITLE="On the complexity of QoS routing",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=4,
PAGES="376-387",
MONTH=mar,
YEAR=2003,
REFERENCES=23,
KEYWORDS="QoS routing; Traffic engineering; Complexity; Hopcount",
ABSTRACT="We present SAMCRA, an exact QoS routing algorithm that guarantees to find a
feasible path if such a path exists. Because SAMCRA is an exact algorithm,
its complexity also characterizes that of QoS routing in general. The
complexity of SAMCRA is simulated in specific classes of graphs. Since the
complexity of an algorithm involves a scaling of relevant parameters, the
second part of this paper analyses how routing with multiple independent
link weights affects the hopcount distribution. Both the complexity and
the hopcount analysis indicate that for a special class of networks, QoS
routing exhibits features similar to single-parameter routing. These
results suggest that there may exist classes of graphs in which QoS
routing is not NP-complete.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47P22RR-2-81\&\_cdi=5624\&\_orig=browse\&\_coverDate=03\%2F01\%2F2003\&\_sk=999739995\&view=c\&wchp=dGLbVlb-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=95c88e09b99fcd604a3ad3f40a63f2d9\&ie=f.pdf"
}
@INPROCEEDINGS{Miet0305:Compatible,
AUTHOR="Jan Mietzner and Peter Hoeher and Magnus Sandell",
TITLE="Compatible Improvement of the {GSM/GPRS} System by Means of Delay Diversity",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="On basis of the GSM/GPRS system, we investigate the application of the
delay diversity scheme, especially with regard to aspects of
compatibility with current specifications. The delay diversity scheme
is a simple special case of a Space-Time Trellis Code (STTC). The
performance improvements obtainable by means of this technique are
demonstrated both on basis of analytical and simulation results. A
lower bound on the bit error probability is derived and an optimization
of the intrinsic delay parameter is considered. Moreover, the
sensitivity of the delay diversity scheme to a time-variant typical
urban channel is addressed as well as to non-perfect knowledge of the
channel coefficients at the receiver."
}
@ARTICLE{Mili0303:Carnet,
AUTHOR="Miroslav Milinovic and Jasna Tingle and Vesna Vrga",
TITLE="CARNet: educated users for effective utilisation of information technology",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=5,
PAGES="481-486",
MONTH=mar,
YEAR=2003,
REFERENCES=3,
KEYWORDS="Information technology; Training; Education; Courses",
ABSTRACT="Croatian Academic and Research Network CARNet and University of Zagreb,
University Computing Centre have been successfully co-operating in
providing training in information technology for 8 years. Both
institutions see this type of education as an absolute necessity in the
academic and research community in the future, too. Enabling users to
fully utilise both physical network and provided network services is the
only way for them to benefit from the development of the technology. Only
competent users can work with specialists on developing applications of
information technology.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-472JK9W-1-C\&\_cdi=5624\&\_orig=browse\&\_coverDate=03\%2F20\%2F2003\&\_sk=999739994\&view=c\&wchp=dGLbVtz-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=e67ea65c44097c7c907a198cf0b29692\&ie=f.pdf"
}
@INPROCEEDINGS{Mill0305:Adaptive,
AUTHOR="Kevin Mills and Christopher Dabrowski",
TITLE="Adaptive Jitter Control for UPnP M-Search",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Selected service-discovery systems allow clients to issue multicast queries
to locate network devices and services. Qualifying devices and services
respond directly to clients; thus, in a large network, potential exists
for responses to implode on a client, overrunning available resources. To
limit implosion, one service-discovery system, UPnP, permits clients to
include a jitter bound in multicast (M-Search) queries. Qualifying devices
use the jitter bound to randomize timing of their responses. Initially,
clients lack sufficient knowledge to select an appropriate jitter bound,
which varies with network size. In this paper, we characterize the
performance of UPnP M-Search for various combinations of jitter bound and
network size. In addition, we evaluate the performance and costs of four
algorithms that might be used for adaptive jitter control. Finally, we
suggest an alternative to M-Search for large networks."
}
@ARTICLE{Mish03:Empirical,
AUTHOR="Arunesh Mishra and Minho Shin and William Arbaugh",
TITLE="An Empirical Analysis of the {IEEE} {802.11} {MAC} Layer Handoff Process",
JOURNAL="ACM Computer Communication Review",
VOLUME=33,
NUMBER=2,
PAGES="93-102",
YEAR=2003,
KEYWORDS="802.11 handoff, Layer 2 handoff, layer 2 handoff optimization",
ABSTRACT="IEEE 802.11 based wireless networks have seen rapid growth
and deployment in the recent years. Critical to the 802.11
MAC operation, is the handoff function which occurs when
a mobile node moves its association from one access point to
another. In this paper, we present an empirical study of this
handoff process at the link layer, with a detailed breakup of
the latency into various components. In particular, we show
that a MAC layer function - probe is the primary contributor
to the overall handoff latency. In our study, we observe
that the latency is significant enough to affect the quality
of service for many applications (or network connections).
Further we find variations in the latency from one hando
off to another as well as with APs and STAs used from
different vendors. Finally, we discuss optimizations on the
probe phase which can potentially reduce the probe latency
by as much as 98\% (and a minimum of 12\% in our experiments).
Based on the study, we draw some guidelines for
future handoff schemes.",
URL="http://delivery.acm.org/10.1145/960000/956990/p93-mishra.pdf?key1=956990\&key2=1050165511\&coll=GUIDE\&dl=GUIDE\&CFID=3512710\&CFTOKEN=95540107"
}
@ARTICLE{Misr0308:Performance,
AUTHOR="A Misra and Teunis Ott",
TITLE="Performance sensitivity and fairness of ECN-aware 'modified {TCP'}",
JOURNAL="Performance Evaluation",
VOLUME=53,
NUMBER="3-4",
PAGES="255-272",
MONTH=aug,
YEAR=2003,
REFERENCES=17,
KEYWORDS="TCP; ECN; Fairness; Performance; Best-effort; Utilization",
ABSTRACT="The paper discusses how explicit congestion notification (ECN) can be used
to devise an Internet congestion control mechanism that is more rapidly
reactive and allows best-effort flows to rapidly adjust to fluctuations in
available capacity. Our ECN-mod protocol involves simple modifications to
TCP behavior and leverages more aggressive marking-based router feedback.
Simulations show that ECN-mod is better than TCP NewReno for both
persistent sources and Web-style intermittent traffic sources, and makes
the link utilization significantly less sensitive to the variation in the
number of active flows. Simulations also show that, while ECN-mod flows
obtain a larger portion of the available capacity than conventional
best-effort traffic, they do not starve or significantly penalize such
TCP-based flows.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-48V844V-1-44\&\_cdi=5663\&\_orig=browse\&\_coverDate=08\%2F31\%2F2003\&\_sk=999469996\&view=c\&wchp=dGLbVtb-zSkzk\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=6358ef7b946f87b32391cb3f269f07d8\&ie=f.pdf"
}
@ARTICLE{Mitc0302:Approximation,
AUTHOR="K. Mitchell and Appie {van de Liefvoort}",
TITLE="Approximation models of feed-forward {G/G/1/N} queueing networks with
correlated arrivals",
JOURNAL="Performance Evaluation",
VOLUME=51,
NUMBER="2-4",
PAGES="137-152",
MONTH=feb,
YEAR=2003,
REFERENCES=24,
KEYWORDS="Approximation methods; Feed-forward networks; Loss networks; Communications
networks; Autocorrelations; Moment matching; Matrix-exponential; Linear
Algebraic Queueing Theory",
ABSTRACT="In this paper we develop approximation models for feed-forward networks of
G/G/1/N queues. We use Linear Algebra Queueing Theory (LAQT) techniques to
create reduced state space representations for the queue departure
processes. Reduced state space departure processes are presented where the
first three moments and the correlation decay are mapped to a two state
process. A three state process is also presented matching the first five
moments and the first three lag autocorrelations. Numerical examples of
end-to-end performance for high-speed communications networks with
correlated arrival traffic are presented. The results are compared with
simulation models and other approximation methods.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-46WPNY4-7-52\&\_cdi=5663\&\_orig=browse\&\_coverDate=02\%2F28\%2F2003\&\_sk=999489997\&view=c\&wchp=dGLbVzb-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=0ba744276779ec95e2d44bfe9444c9b2\&ie=f.pdf"
}
@INPROCEEDINGS{Mitr0303:Stochastic,
AUTHOR="Debasis Mitra and Qiong Wang",
TITLE="Stochastic Traffic Engineering, with Applications to Network Revenue
Management",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We present a stochastic traffic engineering framework for optimizing
bandwidth provisioning and path selection
in networks.
The objective is to maximize revenue for serving demands, which are
quantified by probabilistic distributions.
We consider a two-tier market structure, where demands in different
markets are associated with different unit
revenues and uncertainties.
Based on mean-risk analysis, the optimization model enables the carrier to
maximize the mean revenue and contai
n the risk that the revenue falls below an acceptable level.
Our framework is intended for off-line traffic engineering design, which
takes a centralized view of network to
pology, link capacity, and demand.
We analyze the complexity of solving the model and property of the optimal
solution.
We also discuss the impact of demand variability on various aspects of
traffic engineering, such as link utiliz
ation, routing, capacity provisioning, and total revenue.
{\it Method Keywords}-
{\bf Mathematical Programming, Economics}"
}
@ARTICLE{Mitt0302:Dynamic,
AUTHOR="Ajay Mittal and G. Manimaran and C. Siva Ram Murthy",
TITLE="Dynamic real-time channel establishment in multiple access bus networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=2,
PAGES="113-127",
MONTH=feb,
YEAR=2003,
REFERENCES=19,
KEYWORDS="Multiple access network; Medium access control protocol; Real-time channel;
Periodic and aperiodic messages; Message scheduling",
ABSTRACT="Real-time communication with performance guarantees is becoming very
important to many applications, like computer integrated manufacturing,
multimedia, and many embedded systems. The timing guarantees required in
these applications are not possible without a network protocol which
supports the timely and predictable delivery of messages. Multiple access
bus networks are being increasingly used in real-time applications because
they are simple, economical, and have small propagation delays. In such
networks, the nodes have to coordinate with one another in order to
transmit data and control messages over the shared channel. Though several
real-time protocols have been proposed for the multiple access bus
networks, there is no guarantee based protocol which addresses the problem
of integrated scheduling of dynamically arriving periodic (i.e. time
triggered) and aperiodic (i.e. event triggered) messages. In this paper,
we propose two guarantee based protocols, earliest deadline first (EDF)
and BUS protocols, which address this problem. The proposed protocols
dynamically establish real-time channels for dynamically arriving periodic
message streams and thus ensure predictable communication. In our
protocols, we employ the concept of aperiodic server for servicing
aperiodic messages. In the simulation studies, the performance metrics,
success ratio (measure of schedulability) and channel utilization are used
to study the performance of the two protocols. It is observed that the EDF
protocol offers higher schedulability as compared to the BUS protocol for
periodic messages, while the BUS protocol offers better channel
utilization for aperiodic messages as compared to the EDF protocol.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-45WGHWB-2-2W\&\_cdi=5624\&\_orig=browse\&\_coverDate=02\%2F01\%2F2003\&\_sk=999739997\&view=c\&wchp=dGLbVzz-zSkWW\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=7c3fa4d1d49dce13bf813d2958279279\&ie=f.pdf"
}
@ARTICLE{Mnei0310:Achieving,
AUTHOR="Saad Mneimneh and Kai-Yeung Siu",
TITLE="On Achieving Throughput in an Input-Queued Switch",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=5,
PAGES="858-867",
MONTH=oct,
YEAR=2003,
REFERENCES=16,
KEYWORDS="lower bounds; priority switching algorithms; speedup; throughput",
ABSTRACT="We establish some lower bounds on the speedup required to achieve
throughput for some classes of switching algorithms in a input-queued
switch with virtual output queues (VOQs). We use a weak notion of
throughput, which will only strengthen the results, since an algorithm
that cannot achieve weak throughput cannot achieve stronger notions of
throughput. We focus on priority switching algorithms, i.e., algorithms
that assign priorities to VOQs and forward packets of high priority first.
We show a lower bound on the speedup for two fairly general classes of
priority switching algorithms: input priority switching algorithms and
output priority switching algorithms. An input priority scheme prioritizes
the VOQs based on the state of the input queues, while an output priority
scheme prioritizes the VOQs based on their output ports. We first show
that, for output priority switching algorithms, a speedup S/spl ges/2 is
required to achieve weak throughput. From this, we deduce that both
maximal and maximum size matching switching algorithms do not imply weak
throughput unless S/spl ges/2. The bound of S/spl ges/2 is tight in all
cases above, based on a result in Dai et al. Finally, we show that a
speedup S/spl ges/3/2 is required for the class of input priority
switching algorithms to achieve weak throughput.",
URL="http://ieeexplore.ieee.org/iel5/90/27747/01237462.pdf?isNumber=27747\&prod=JNL\&arnumber=1237462\&arSt=+858\&ared=+867\&arAuthor=Mneimneh\%2C+S.\%3B+Kai-Yeung+Siu"
}
@ARTICLE{Moes0301:Software,
AUTHOR="Klaus Moessner and Didier Bourse and Dieter Greifendorf and Joerg Stammen",
TITLE="Software radio and reconfiguration management",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=1,
PAGES="26-35",
MONTH=jan,
YEAR=2003,
REFERENCES=24,
KEYWORDS="Reconfigurable communication systems; Heterogeneous networks; Software
Defined Radio; Reconfigurability",
ABSTRACT="The Wireless World Research Forum (WWRF) work area on Emerging Technologies
pursues the identification of technologies furthering the evolution of
future wireless communication systems. Within this exercise, the
progression of telecommunications in the next decade is characterised as
the convergence towards an IP-based core network providing ubiquitous
seamless wireless access in an hierarchical and hybrid self-organising
network environment. Whereby, the various radio access systems and the IP
based core network will handle interworking, mobility management, and
roaming. The key to facilitate this convergence on the access side are
Reconfigurable Software Defined Radio (SDR) equipments. Subscribers and
users will greatly benefit from this federated telecommunication
environment, but only, if they are equipped with a single integrated
reconfigurable multi-mode multi-band terminal. Such terminals have to
operate in either several or even all the different access environments
available and they have to support the whole range of applications that
are usually accessible on devices specific for the single access
technology in the heterogeneous network environment.
This article outlines and describes the SDR Research issues identified in
workarea 3 of WWRF (New Communication Environment and Heterogeneous
Networks), it focuses and describes the three major research directions
followed: High Level System Requirements, SDR Hardware Architecture and
System and Software Architectures for Reconfigurable communication
systems.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-461XPFR-8-R\&\_cdi=5624\&\_orig=browse\&\_coverDate=01\%2F01\%2F2003\&\_sk=999739998\&view=c\&wchp=dGLbVlb-zSkzk\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=e18acbfa7f11b57ffa34529db54d33b5\&ie=f.pdf"
}
@ARTICLE{Moh0305:Qos,
AUTHOR="Melody Moh and Bang Nguyen",
TITLE="QoS-guaranteed one-to-many and many-to-many multicast routing",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=7,
PAGES="652-669",
MONTH=may,
YEAR=2003,
REFERENCES=25,
KEYWORDS="Quality-of-service; Multicast routing; Time complexity",
ABSTRACT="Quality-of-service (QoS) multicast routing with more than one metric has
always been technically challenging, since many of them are NP-hard. Most
existing QoS multicast routing algorithms are heuristic. Furthermore, many
of them considered only the unicast shortest paths, either based on
propagation delay or the number of hops. The first part of this paper
deals with one-to-many multicast routing. We observed that the end-to-end
delay experienced by network packets is determined not only by the
propagation distance, but also (and in many cases largely) by the
hop-by-hop transmission and queuing delay, which in turn depends on the
available bandwidth. Based on this observation, we propose an optimal
multicast routing algorithm (the MBDC algorithm), which maximizes the
reserved bandwidth while satisfying both delay and bandwidth constraints.
Its correctness and time complexity of O(n2 log n) are formally verified,
where n is the number of nodes in the network. We also extend the
algorithm to support dynamic membership, allowing nodes to join or leave
the network, with the cast route updated dynamically. We carefully
evaluate both the static and the dynamic algorithms via simulation. The
second part of the paper focuses on minimizing the number of centers of
multiple-shared multicast trees (MSMT) in many-to-many multicast routing.
We propose three heuristic algorithms to this NP-complete problem and
compare them with an existing one. We prove, theoretically and through
simulation, that our algorithms give the same good results with a
significantly shorter running time. We also apply the MBDC extension to
the MSMT algorithms, so that the resulting solution not only reduces the
number of centers, but also optimizes (maximizes) the bottleneck
bandwidth. Proof of correctness, analysis of run-time, and simulation
results of these extensions are also provided. We believe that the results
report here are significant to the area of QoS-aware multicast routing; the
algorithms may be applied to the Internet intra- and inter-domain multicast
routing with minimal changes.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-473VSDP-3-4P\&\_cdi=5624\&\_orig=browse\&\_coverDate=05\%2F01\%2F2003\&\_sk=999739992\&view=c\&wchp=dGLbVzb-zSkzS\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=88ef59c13f49a442c0eaef6afa5f4d23\&ie=f.pdf"
}
@ARTICLE{Moha0302:Virtual,
AUTHOR="G. Mohan and P. Ernest and Vijay Bharadwaj",
TITLE="Virtual topology reconfiguration in {IP/WDM} optical ring networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=2,
PAGES="91-102",
MONTH=feb,
YEAR=2003,
REFERENCES=15,
KEYWORDS="Wavelength division multiplexing; Ring networks; Virtual topology;
Congestion; Generalized multiprotocol label switching",
ABSTRACT="Wavelength division multiplexing (WDM) has emerged as a promising
technology for use in backbone transport networks. In an IP/WDM network,
the optical layer provides circuit-switched lightpath services to the
client Internet protocol (IP) layer. The set of all the lightpaths in the
optical layer defines the virtual topology. Since the optical switches
(cross-connects) are reconfigurable, the virtual topology can be
reconfigured in accordance with the changing traffic demand pattern at the
client layer in order to optimize the network performance. Although it is
theoretically possible to implement any virtual topology on the physical
topology, changing the virtual topology can be disruptive to the network
since the traffic must be buffered or rerouted while the topology is being
reconfigured. We develop a reconfiguration algorithm which is based on the
concept of splitting and merging existing lightpaths, together with
costbenefit analysis to reduce the network reconfiguration cost. Our
objective is to reduce the number of lightpaths that need to be
reconfigured, while ensuring that the network congestion is low. The
performance of the proposed algorithm for unidirectional and bidirectional
ring networks is verified through simulation experiments. The experimental
results show that the algorithm reduces the number of reconfiguration
changes significantly while keeping the network congestion acceptably low.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-45XRJTH-1-2F\&\_cdi=5624\&\_orig=browse\&\_coverDate=02\%2F01\%2F2003\&\_sk=999739997\&view=c\&wchp=dGLbVzz-zSkWW\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=12834e9a5a862ceed1aa6cfe5a94242a\&ie=f.pdf"
}
@INPROCEEDINGS{Moha0305:Speculative,
AUTHOR="Aditya Mohan",
TITLE="Speculative Routing and Update Propagation: A Kundali Centric Approach",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Peer-to-peer networks have gained much attention due to their attractive
features of self-organization, scalability and decentralized control. The
key challenge in these networks is how to efficiently locate and retrieve
the correct data. Techniques for efficient searching in peer-to-peer
networks have been recently proposed; however, these handle location and
routing as a single problem and impose a structure in the network by
mapping the data to particular nodes. In this paper, we propose
propagation and routing algorithms for a fully decentralized,
self-organizing network. Our goal is to maximize the probability of
finding the data, minimize peer access latencies and balance the workload
among many peers. Central to our approach is the Kundali data structure
that represents the set of data maintained by the peers and drives the
smart routing of the search requests (queries). Kundali, for each peer,
maintains a Bloom Filter based set of synopsis of the data expected to be
present at each routing direction. Requests that cannot be answered
locally, are propagated only to those immediately connect peers whose
synopsis depict the closest match. We have implemented our algorithms in
the context of a fully decentralized Internet caching service in our
internal HP network. Our mechanism is inexpensive, highly scalable,
resilient to node failures and with no administration cost. Experimental
results validate our algorithms and show that they have good performance
results."
}
@MASTERSTHESIS{Moha0306:Implementation,
AUTHOR="Shahid Mohammed",
TITLE="An Implementation of {CASP} - A Technology Independent Lightweight
Signaling Protocol",
SCHOOL="Dept. of Computer Science, University of Kentucky",
ADDRESS="Lexington, Kentucky",
MONTH=jun,
YEAR=2003,
KEYWORDS="signaling; QoS; RSVP; CASP; resource reservation",
ABSTRACT="This document describes a prototype implementation of Cross-Application
signaling protocol (CASP). CASP is a general-purpose protocol for managing
state information in network devices. It can be used for inter-domain and
intra-domain QoS signaling, configuration of middleboxes, for collecting
measurement data and any other application where state management is
required. The framework for CASP is defined as a modular protocol, which
includes a general purpose messaging layer (M-layer), that in turn
supports a number of client layers for particular signaling applications
(e.g., QoS, MIDCOM). There is also a special-purpose client component for
next-peer discovery. My objective in this project was to implement a
secure interface for a CASP implementation using OpenSSL library, to
develop some of the functionality for messaging layer and to integrate
various components of CASP prototype developed by others involved in CASP
development.",
URL="http://www.cs.columbia.edu/IRT/papers/Moha0306\_Implementation.pdf"
}
@ARTICLE{Mohr0301:Wireless,
AUTHOR="Werner Mohr",
TITLE="The Wireless World Research ForumWWRF",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=1,
PAGES="2-10",
MONTH=jan,
YEAR=2003,
REFERENCES=20,
KEYWORDS="Wireless World Research Forum; Future mobile radio systems; Timeline R\&D
programs",
ABSTRACT="Third generation (3G) mobile radio systems are currently being deployed in
different regions of the world. Future systems beyond the 3G are already
under discussion in international bodies and forums such as ITU, the
Wireless World Research Forum (WWRF) and R\&D programs of the European
Union and in other regions. These systems will determine the research and
standardization activities in mobile and wireless communication in the
coming years. Based on the experience of the 3G, future systems will be
developed mainly from the user perspective with respect to potential
services and applications including traffic demands. Therefore, the WWRF
was launched in 2001 as a global and open initiative of manufacturers,
network operators, SMEs, R\&D centers and the academic domain. WWRF is
focused on the vision of such systemsthe Wireless Worldand potential key
technologies. This paper describes the international context of activities
on systems beyond 3G, the goals, objectives and structure of WWRF, the user
perspective as the starting point for a future system design and the key
enabling technologies for the Wireless World.
This paper is the introduction to a series of articles in this special
issue on the achievements of WWRF.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-45XRJTH-2-F\&\_cdi=5624\&\_orig=browse\&\_coverDate=01\%2F01\%2F2003\&\_sk=999739998\&view=c\&wchp=dGLbVtb-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=1190657fe067d64c3f64453f4d1e55b7\&ie=f.pdf"
}
@INPROCEEDINGS{Mohr0309:Cascade,
AUTHOR="Alexander Mohr and Mayank Mishra",
TITLE="Cascade: An Attack-Resistant {DHT}",
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="Motivated by our desire for an attack-resistant distributed
hash table (DHT), we develop an architecture that has minimal
hard state to ensure correct search even when 90 percent of
nodes are malicious. We also employ extensive soft state
and passive caching to increase efficiency when the fraction
of malicious nodes is small. In our threat model, malicious
peers may attempt to prevent a well-behaved node from inserting
a key or querying the DHT for the value of a key, but we assume
for now that the underlying network is well-behaved and make
no attempt to provide anonymity or plausible deniability. Our
primarz goal is to provide for complete and correct searches in
the face of malicious peers. A secondary goal is to enable those
searches to complete with a reasonably small number of
exchanged messages."
}
@INPROCEEDINGS{Moor0303:Internet,
AUTHOR="David Moore and Colleen Shannon and Geoffrey Voelker and Stefan Savage",
TITLE="Internet Quarantine: Requirements for Containing Self-Propagating Code",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="It has been clear since 1988 that self-propagating code can quickly
spread across a network by exploiting homogenous security
vulnerabilities. However, the last few years have seen a dramatic
increase in the frequency and virulence of such ``worm'' outbreaks.
For example, the Code-Red worm epidemics of 2001 infected hundreds of
thousands of Internet hosts in a very short period -- incurring
enormous operational expense to track down, contain, and repair each
infected machine. In response to this threat, there is considerable
effort focused on developing technical means for detecting and
containing worm infections before they can cause such damage.
This paper does not propose a particular technology to address this
problem, but instead focuses on a more basic question: {\em How
well will any such approach contain a worm epidemic on the
Internet?}. We describe the design space of worm containment systemss
using three key parameters -- reaction time, containment strategy and
deployment scenario. Using a combination of analytic modeling
and empirically-based simulation, we describe how each of these
design factors impacts the dynamics of a worm epidemic and, conversely,
the minimum engineering requirements necessary to contain the spread
of a given worm. While our analysis cannot provide definitive guidance for
engineering defenses against all future threats, we demonstrate the lower
bounds that any such system must exceed to be useful today.
Unfortunately, our results suggest that there are significant
technological and administrative gaps to be bridged before
an effective defense can be provided in today's Internet."
}
@INPROCEEDINGS{Moor0305:Implementation,
AUTHOR="Jay Moorman",
TITLE="Implementation of a {3G} {W-CDMA} Software Radio",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The use of a software system to perform wireless radio functions is the
subject of much interest and research in industry and academia. This is
particularly timely for new third generation systems that have an
extensive array of options along with continued refinements in the
standard. In order to address the problem, the paper presents the
development and implementation of a software radio designed for a 3G
system. It expands upon the notion of the physical layer software radio
to also encompass upper layer processing capabilities. The system
definition and architecture are described along with the operational
scenario. In addition, results are presented from initial field tests,
including functional issues and preliminary performance measurements."
}
@INPROCEEDINGS{Morg0305:Reducing,
AUTHOR="Dennis Morgan and Zhengxiang Ma and Lei Ding",
TITLE="Reducing Measurement Noise Effects in Digital Predistortion of {RF} Power
Amplifiers",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT={A technique known as digital predistortion (DPD) is the subject of much
current research and is being contemplated for the next generation of RF
power amplifiers. DPD has the capability of linearizing the overall
amplifier response and is a cost effective technique for applications
requiring wideband operation with low out-of-band spurious emissions, also
known as {"}spectral regrowth{"}. Estimation of the DPD parameters is
hampered by the presence of measurement noise at the output of the
amplifier,
even though this noise is not actually transmitted on air. The end effect
of the noise is to degrade the DPD performance, leading to higher
spectral regrowth. This paper shows that a major cause of this
degradation
can be attributed to coefficient bias induced by measurement noise
in a nonlinear model. Two techniques are proposed for mitigating these
effects. One uses a specially designed periodic training signal with
frame
averaging, and the other uses forward estimation followed by off-line
noiseless
inverse estimation. Simulations show that spectral regrowth reductions in
excess of 10 dB are possible using these techniques.}
}
@INPROCEEDINGS{Mori0305:Scalable,
AUTHOR="Masashi Morioka and Yoshifumi Yonemoto and Takashi Suzuki and Minoru Etoh",
TITLE="Scalable Security Description Framework for Mobile Web Services",
BOOKTITLE="ICC 2003 - Global Services and Infrastructure for Next Generation Networks",
ADDRESS="Anchorage, Alaska",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We propose a scalable security description
framework for mobile web services and present a secure
open interface for multi-level authorization procedures
depending on service context, such as time constraints,
purchase prices, and network connection status. In this
framework, we adopt Web Service Flow Language (WSFL), in addition to Web
Service Description Language (WSDL), to describe AAA service flows and
Security Assertion Markup Language (SAML) to describe a security
certificate. We also extend WSDL to have security attributes that specify
the underlying secure protocols. WSFL, WSDL, SAML and service context
descriptions dynamically defined scalable AAA. Those contribute to
high-speed and effective micropayments in mobile e-commerce."
}
@INPROCEEDINGS{Most0305:Ici,
AUTHOR="Yasamin Mostofi",
TITLE="{ICI} Mitigation for Mobile {OFDM} Receivers",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Orthogonal Frequency Division Multiplexing (OFDM) is
robust against Inter-Symbol-Interference (ISI) due to
the increase of the symbol duration. However, for
mobile applications, channel variations during one OFDM
symbol introduce Inter-Carrier-Interference (ICI), which
degrades the performance. This gets more severe as
mobile speed, carrier frequency or OFDM symbol duration
increases. We introduce two new methods to mitigate ICI
in an OFDM system with coherent channel estimation. Both
methods use a piece-wise linear model to approximate
channel variations.
The first method extracts channel variations information
from the cyclic prefix. The second method estimates
these variations utilizing the next symbol.
Since mathematical analysis of the whole system becomes
intractable in a long delay spread environment, we
provide a mathematical analysis that investigates the
effect of linearization for the case of a time-variant
one path channel. Then our simulation results show how
these methods would improve the performance in a
highly time-variant environment with a long delay spread."
}
@INPROCEEDINGS{Mote0305:Polynomial,
AUTHOR="Idin Motedayen and Achilleas Anastasopoulos",
TITLE="Polynomial Complexity {ML} Sequence and Symbol-by-symbol Detection in
Fading Channels",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The related problems of maximum likelihood sequence detection
(MLSD) and symbol-by-symbol soft-decision metric (SbSSDM)
generation in complex Gaussian flat-fading channels are considered
in this paper. Traditional methods for the exact solution of these
problems have exponential complexity with respect to the sequence
length. In this paper, it is shown that both these problems can
be solved in polynomial complexity with respect to the sequence
length. Furthermore, motivated by the polynomial-complexity exact
algorithm, an approximate fast algorithm is also derived.
Simulation results for a low-density parity-check (LDPC) code
transmitted on the aforementioned channel show that the
performance of the approximate algorithm is very close to the
exact sum-product algorithm."
}
@INPROCEEDINGS{Muqa0303:Power,
AUTHOR="Alaa Muqattash and Marwan Krunz",
TITLE="Power Controlled Dual Channel {(PCDC)} Medium Access Protocol for Wireless
Ad Hoc Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="In this paper, we propose a comprehensive solution for power
control in mobile ad hoc networks (MANETs). Our solution
emphasizes the interplay between the MAC and network layers,
whereby the MAC layer indirectly influences the selection of the
next-hop by properly adjusting the power of route request
packets. This is done while maintaining network connectivity.
Directional and channel-gain information obtained mainly from overheard
RTS and CTS packets is used to dynamically construct the network
topology. By properly estimating the required transmission power
for data packets, our protocol allows for interference-limited
simultaneous transmissions to take place in the neighborhood of a
receiving node. Simulation results indicate that compared
to the IEEE 802.11 approach, the proposed
protocol achieves a significant increase
in the channel utilization and end-to-end network throughput,
and a significant decrease in the total energy consumption."
}
@INPROCEEDINGS{Murp0306:User,
AUTHOR="Liam Murphy and Nicola Cranley and Philip Perry",
TITLE="User-Perceived Quality-Aware Adaptive Delivery of {MPEG-4} Content",
BOOKTITLE="ACM NOSSDAV 2003",
ADDRESS="Monterey, California, USC",
DAYS=1,
MONTH=jun,
YEAR=2003,
ABSTRACT="Abstract: Many adaptive delivery mechanisms have been devised for streaming
multimedia over best-effort IP networks. Most of these adaptive schemes do
not consider the user\’s perception of quality when making
adaptations. We propose that an optimal adaptation trajectory exists which
indicates how encoding quality should be adapted (upgraded/downgraded) with
respect to user perceptual quality in response to network conditions. This
optimum adaptation trajectory can be used with any transmission adaptation
policy. We describe a system architecture that uses knowledge of user
perceptual quality to make adaptation decisions, and give an example of
how this knowledge is used in system operation."
}
@MISC{Murp03:P2P,
AUTHOR="Declan Murphy and Jarlath Kelly and Keith Curley and John Vickery and Dan
O'Keeffe",
TITLE="{P2P} Security",
YEAR=2003,
NOTE="http://ntrg.cs.tcd.ie/undergrad/4ba2.02-03/p10.html",
URL="http://ntrg.cs.tcd.ie/undergrad/4ba2.02-03/p10.html"
}
@ARTICLE{Nabe0304:Adaptive,
AUTHOR="Masayoshi Nabeshima",
TITLE="Adaptive {CSFQ:} determining the packet dropping probability adaptively for
achieving fair bandwidth allocations in {SCORE} networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=6,
PAGES="Adaptive CSFQ: determining the packet dropping probability adaptively for
achiev",
MONTH=apr,
YEAR=2003,
REFERENCES=20,
KEYWORDS="Congestion control; Fair bandwidth allocation; Fair queuing; Packet
dropping probability; Stateless core networks",
ABSTRACT="In stateless core (SCORE) networks, edge routers maintain per-flow state
while core routers do not. Core stateless fair queuing (CSFQ) has been
proposed for approximating the operation of per-flow queuing techniques in
SCORE networks. However, the packet dropping probability offered by CSFQ
suits only UDP flows. Thus, CSFQ cannot achieve fair bandwidth allocation
for TCP flows.
This paper proposes adaptive CSFQ (ACSFQ). The packet dropping probability
in ACSFQ is determined adaptively based on the flow arrival rate, the fair
share rate, and the current queue length. It well supports TCP flows as
well as UDP flows. We compare ACSFQ to CSFQ in terms of fair bandwidth
allocation.
This paper also proposes how to identify and penalize unresponsive flows
without managing their flow state. The method is simple to realize because
only the packet dropping probability is changed.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-46SP11K-2-2S\&\_cdi=5624\&\_orig=browse\&\_coverDate=04\%2F15\%2F2003\&\_sk=999739993\&view=c\&wchp=dGLbVtb-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=364cb52ccf71ad2068a150f88d1fec48\&ie=f.pdf"
}
@INPROCEEDINGS{Nagu0305:Combined,
AUTHOR="Ayman Naguib",
TITLE="Combined Interference Suppression and Frequency Domain Equalization for
Space-Time Block Coded Transmission",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Diversity transmission at the base station is an effective technique to
combat adverse effects of fading. This is suggested as an alternative to
diversity at the terminal, thereby reducing the implementation complexity.
In this paper, we present a transmission scheme that combines space-time
block coding over frequency selective channels with single carrier
frequency
domain interference suppression and equalization. It is shown that this
scheme will provide the diversity benefit of both the frequency selective
channel and the space-time block code while completely suppressing the
interference from another co-channel transmitter that occupies
exactly the same channel (time \& frequency) as the desired transmitter."
}
@INPROCEEDINGS{Naka0305:Handoff,
AUTHOR="Nobuyasu Nakajima and Ashutosh Dutta and Subir Das and Henning Schulzrinne",
TITLE="Handoff Delay Analysis and Measurement for {SIP} based mobility in IPv6",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper describes the Session Initiation Protocol (SIP) based mobility
in IPv6 and its performance in our laboratory testbed. For real-time
mobile multimedia communication, we use SIP for signaling protocol as well
as supporting terminal mobility. While performance study for real-time
mobile communication refers to several factors and their measurements, we
analyze here only the handoff delay due to a node mobility. In particular,
we are interested to examine the delay incurred when a mobile moves to a
new network and perform Duplicate Address Detection (DAD) and router
selection. We also analyze the delay in each cases. We notice that the
IPv6 Linux implementation provides substantial amount of delay during node
movement which severely affects the performance of real-time applications.
However, we modify the Linux kernel and compare with unaltered one.
Finally, we conclude that with intelligent modifications to unaltered
Linux kernel, a faster handoff is achievable."
}
@INPROCEEDINGS{Naka0306:Detecting,
AUTHOR="Masahide Nakamura and Pattara Leelaprute and Ken-ichi Matsumoto and Tohru
Kikuno",
TITLE="Detecting Script-to-Script Interactions in Call Processing Language",
BOOKTITLE="Feature Interactions in Telecommunication Networks",
PUBLISHER="IOS Press",
ADDRESS="Ottawa, Canada",
MONTH=jun,
YEAR=2003,
KEYWORDS="cpl;features;services;automated checking",
ABSTRACT="This paper addresses a problem to detect feature interactions in a CPL
(Call Processing Language) programmable service environment on Internet
telephony. In the CPL environment, the previous works cannot be directly
applied, because of new complications introduced:(a) features created by
non-experts and (b) distributed feature provision. To cope with the
problem (a), we propose eight types of semantic warnings which guarantee
some aspects of semantic correctness in each individual CPL script. Then,
as for (b), we present an alternative definition of feature interactions,
and propose a method to implement run-time feature interaction detection.
The key idea is to define feature interactions as the semantic warnings
over multiple CPL scripts, each of which is semantically safe. We also
demonstrate tools, called CPL checker and FI simulator, to help users to
construct reliable CPL scripts."
}
@INPROCEEDINGS{Namg0305:Channelized,
AUTHOR="Won Namgoong",
TITLE="Channelized Digital Receivers for Impulse Radio",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Critical to the design of a digital impulse radio (IR) receiver is the
ability of the analog-to-digital converter (ADC) to efficiently sample and
digitize the received signal at the signal Nyquist rate of several
gigahertz. Since designing a single ADC to operate at such frequencies is
not practical, channelized receivers that efficiently sample at a fraction
of the signal Nyquist rate are presented. Their performances are compared
in the presence of phase noise/sampling jitter and narrowband
interference. Our analysis suggests that channelizing the received signal
in the frequency domain results in consistently higher performance than
channelizing in the time domain. Furthermore, in the presence of moderate
sampling jitter/phase noise, high resolution ADC's are not needed."
}
@INPROCEEDINGS{Narl0303:Coolcams,
AUTHOR="Girija Narlikar and Anindya Basu and Francis Zane",
TITLE="CoolCAMs: Power-Efficient TCAMs for Forwarding Engines",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Ternary Content-Addressable Memories (TCAMs) are becoming very popular
for designing high-throughput forwarding engines on routers: they are
fast, cost-effective and simple to manage. However, a major drawback
of TCAMs is their high power consumption. This paper presents
architectures and algorithms for making TCAM-based routing tables more
power efficient. The proposed architectures and algorithms are simple
to implement, use commodity TCAMs, and provide worst-case power
consumption guarantees (independent of routing table contents)."
}
@INPROCEEDINGS{Nass0305:Direct,
AUTHOR="Carl Nassar and Fang Zhu and Zhiqiang Wu",
TITLE="Direct sequence spreading {UWB} systems:frequency domain processing for
enhanced performance and throughput",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this work, we propose an innovative high performance, high throughput
direct sequence spreading (DSS) ultra wideband (UWB) system. Our proposed
system employs a novel multi-carrier pulse waveform at the UWB transmit
side: At the receiver side, the received DSS UWB pulse is decomposed into
its subcarriers and recombined to (1) exploit diversity in the frequency
domain and (2) provide resistance to inter symbol interference (ISI)
and/or multi-access interference (MAI). As a direct result, the proposed
frequency-based UWB DSS system is shown to significantly outperform
time-based DSS UWB systems, offering significant gain in throughput (up to
32 fold) without performance degradation, or, alternatively, avoiding error
floors due to MAI that limit the performance of time-based systems."
}
@TECHREPORT{Nati0301:UMLS,
AUTHOR=" {National Library of Medicine}",
TITLE="{UMLS} Knowledge Sources 14th Edition",
ADDRESS="National Library of Medicine",
MONTH=jan,
YEAR=2003,
URL="http://www.nlm.nih.gov/research/umls/UMLSDOC\_2003AA.pdf"
}
@TECHREPORT{Nati0302:Nena,
AUTHOR=" {National Emergency Number Association (N. E. NA) Migration Working Group
of the Network Technical Committee}",
TITLE="{NENA} Technical Information Document on the Interface between the {E9-1-1}
Service Providers Network and the Internet Protocol {(IP)} {PSAP}",
INSTITUTION="National Emergency Number Association (NENA)",
ADDRESS="Coschocton, Ohio",
MONTH=feb,
YEAR=2003,
KEYWORDS="911; emergency calls; SIP; H.323",
ABSTRACT="This NENA Technical Information Document on the Interface between the
E9-1-1 Service Providers Network and the Internet Protocol (IP) PSAP
document provides technical information to guide manufacturers of network
equipment and PSAP CPE in the development of Internet Protocol based
interfaces between the network and PSAP CPE and to assist E9-1-1 Network
Service Providers and PSAPs in implementing such interfaces. It defines a
service description for the capabilities that will need to be supported by
the VoIP signaling on the interface, as well as the necessary network and
CPE elements needed in the supporting architecture. The Appendices to
this TID include specific assumptions/issues for individual candidate
Voice over Internet Protocol (VoIP) signaling protocols, that will need to
be considered in the specification of (separate) technical reference
document(s) that provide signaling requirements for the individual VoIP
protocol alternatives identified."
}
@INPROCEEDINGS{Nawa0305:Stability,
AUTHOR="Vidyut Naware and Lang Tong",
TITLE="Stability of Slotted {ALOHA} with Spatial Diversity",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We consider the problem of stability of slotted ALOHA for a system
consisting of N users communicating with a common receiver,
which employs spatial diversity to receive multiple transmissions
simultaneuosly. We introduce a general packet reception model to
incorporate multiple packet receptions since the collision channel model
is no longer valid in such a scenario. We characterize the stability
region of slotted ALOHA for the two user case explicitly. We
also provide a sufficient condition for stability of slotted ALOHA for
the N > 2 case. Finally, we apply our results to a simple cellular system
in which two users communicate with a base station equipped with a linear
antenna array. Using stability region as a performance measure, we compare
three different receivers/beamformers viz.
Matched Filter, Zero Forcing and MMSE employed by the base station to
receive information from the users."
}
@ARTICLE{Naya0312:Dimensioning,
AUTHOR="Tapan Nayak and Kumar Sivarajan",
TITLE="Dimensioning Optical Networks Under Traffic Growth Models",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=6,
PAGES="935-947",
MONTH=dec,
YEAR=2003,
REFERENCES=14,
KEYWORDS="capacity allocation; capacity exhaustion probability; stochastic modeling;
traffic growth model",
ABSTRACT="In this paper, we consider the problem of dimensioning a large optical
wavelength-division multiplexing (WDM) network assuming the traffic is
growing over time. Traffic between pairs of nodes is carried through
lightpaths which are high-bandwidth end-to-end circuits, occupying a
wavelength on each link of the path between two nodes. We are interested
in dimensioning the WDM links so that the first lightpath request
rejection will occur, with high probability, after a specified period of
time T. Here we introduce the concept of capacity exhaustion probability -
the probability that at least one lightpath request will be rejected in the
time period (0,T) due to lack of bandwidth/capacity on some link. We
propose a network dimensioning method based on a traffic growth model
which eventually results in a nonlinear optimization problem with cost
minimization as the objective and route capacity exhaustion probabilities
as the constraints. Computation of exact capacity exhaustion probabilities
requires large computing resources and is thus feasible only for small
networks. We consider a reduced load approximation for estimating capacity
exhaustion probabilities of a wavelength routed network with arbitrary
topology and traffic patterns. We show that the estimates are quite
accurate and converge to the correct values under a limiting regime in the
desired range of low-capacity exhaustion probabilities.",
URL="http://ieeexplore.ieee.org/iel5/90/28078/01255431.pdf?isNumber=28078\&prod=JNL\&arnumber=1255431\&arSt=+935\&ared=+947\&arAuthor=Nayak\%2C+T.K.\%3B+Sivarajan\%2C+K.N."
}
@ARTICLE{Neel0302:Power,
AUTHOR="Michael Neely and Eytan Modiano and Charles Rohrs",
TITLE="Power Allocation and Routing in Multibeam Satellites With Time-Varying
Channels",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=1,
PAGES="138-152",
MONTH=feb,
YEAR=2003,
REFERENCES=29,
KEYWORDS="delay; dynamic power allocation; power control; queueing analysis;
satellite communication; stability; wireless downlink",
ABSTRACT="We consider power and server allocation in a multibeam satellite downlink
which transmits data to N different ground locations over N time-varying
channels. Packets destined for each ground location are stored in separate
queues and the server rate for each queue, i, depends on the power, p/sub
i/(t), allocated to that server and the channel state, c/sub i/(t),
according to a concave rate-power curve /spl mu//sub i/(p/sub i/,c/sub
i/). We establish the capacity region of all arrival rate vectors (/spl
lambda//sub 1/,...,/spl lambda//sub N/) which admit a stabilizable system.
We then develop a power-allocation policy which stabilizes the system
whenever the rate vector lies within the capacity region. Such stability
is guaranteed even if the channel model and the specific arrival rates are
unknown. Furthermore, the algorithm is shown to be robust to arbitrary
variations in the input rates and a bound on average delay is established.
As a special case, this analysis verifies stability and provides a
performance bound for the choose-the-K-largest-connected-queues policy
when channels can be in one of two states (ON or OFF ) and K servers are
allocated at every timestep (K < N). These results are extended to treat a
joint problem of routing and power allocation in a system with multiple
users and satellites and a throughput maximizing algorithm for this joint
problem is constructed. Finally, we address the issue of interchannel
interference and develop a modified policy when power vectors are
constrained to feasible activation sets. Our analysis and problem
formulation is also applicable to power control for wireless systems.",
URL="http://ieeexplore.ieee.org/iel5/90/26510/01180551.pdf?isNumber=26510\&prod=JNL\&arnumber=1180551\&arSt=+138\&ared=+152\&arAuthor=Neely\%2C+M.J.\%3B+Modiano\%2C+E.\%3B+Rohrs\%2C+C.E."
}
@INPROCEEDINGS{Neel0303:Dynamic,
AUTHOR="Michael Neely and Eytan Modiano and Charles Rohrs",
TITLE="Dynamic Power Allocation and Routing for Time Varying Wireless Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We consider dynamic routing and power allocation
for a wireless network with time varying channels. The network
consists of power constrained nodes which transmit over wireless
links with adaptive transmission rates.
Packets randomly enter the system at each node and wait in
output queues to be transmitted through the network to their
destinations. We establish the capacity region of all rate
matrices $(\lambda\_{ij})$
that the system can stably support---where $(\lambda\_{ij})$
represents the rate of traffic originating at node $i$ and
destined for node $j$. A joint
routing and power allocation policy is developed which stabilizes
the system and provides bounded average delay guarantees whenever
the input rates are within this capacity region. Such performance
holds for general arrival and channel state processes, even if these
processes are unknown to the network controller. We then apply this
control algorithm to an ad-hoc wireless network where channel variations
are due to user mobility, and compare its performance with the
Grossglauser-Tse relay model developed in [13]."
}
@INPROCEEDINGS{Nema0305:Flexible,
AUTHOR="Vivek Nema and Bart Vanpoucke and Miguel Glassee and Serge Vernalde",
TITLE="Flexible System Model and Architectural Exploration for {HIPERLAN} 2 {DLC}
Wireless {LAN} Protocol",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Modern wireless communication protocols like HIPERLAN 2, IEEE 802.11a etc.
support high data rates of the order of 54 Mbps and have strict timing
requirements. Although protocols define the communication rules, they do
not address critical design issues like HardWare/SoftWare (HW/SW)
partitioning and the implementation of different algorithms, which have a
critical impact on the system performance. We have developed a platform
independent flexible system model based on the HIPERLAN 2 Data Link
Control (DLC) protocol that allows easy experimenting with HW/SW
partitioning and different algorithms. Our design methodology allows
performance evaluation at the system level as well as a path to HW/SW
implementation. The simulation results presented give a good information
on the computational complexity of different components and on the HW/SW
partitioning of the HIPERLAN 2 DLC layer. The HW/SW partitioning results
have been verified with a working demonstrator and the object oriented
model can be easily extended for future protocols."
}
@INPROCEEDINGS{Neum0410:Prototype,
AUTHOR="Axel Neumann and Xiaoming Fu and Holger Karl",
TITLE="Prototype Implementation and Performance Evaluation of a
QoS-Conditionalized Handoff Scheme for Mobile IPv6 Networks",
BOOKTITLE="Annual IEEE Computer Communications Workshop (CCW) 2003",
ORGANIZATION="IEEE",
PUBLISHER="IEEE Press",
ADDRESS="California, USA",
PAGES="24-29",
MONTH=oct,
YEAR=2003,
ABSTRACT={Future internetworks will include large numbers of portable devices moving
among small, wireless cells. In order to support real-time applications,
users demand seamless mobility and Quality-of-Service (QoS)provisioning.
One approach towards a more flexible, customizable and scalable mobility
architecture that also reduces signaling load and handoff latency results
from the introduction of micro-mobility. Furthermore, by coupling QoS
signaling and mobility management, QoS requirements can be negotiated
without incurring significant additional signaling latency.
This paper presents the prototype implementation and performance
evaluation of such a QoS-enabled micro-mobility scheme, which is called
{"}QoS-conditionalized handoff{"}. We extended the Mobile IPv6 for Linux
implementation to support the basic mode of Hierarchical Mobile IPv6 as
the underlying micro-mobility mechanism. One problem that appeared during
the implementation was the rather complex event handling in the mobile
node; to enable a simple and generic way of event handling, a
priority-based execution structure has been developed that can be easily
adapted to various policies.
Our experimental results show that by this QoS-conditionalized handoff
scheme, QoS-enabled handoffs can be achieved with a small amount of
introduced latency compared to Hierarchical Mobile IPv6, which is much
less than that of Mobile IPv6. It is further observed that fewer packets
were lost and registration latency could be much more decreased when
mobility management in the mobile node takes advantage of a movement
detection mechanism to expedite the QoS-conditionalized handoff procedure.},
URL="http://user.informatik.uni-goettingen.de/~fu/paper/ccw03.pdf"
}
@INPROCEEDINGS{Neut0303:Waiting,
AUTHOR="Marcel F. Neuts and Jun Guo and Moshe Zukerman and Hai Vu",
TITLE="The Waiting Time Distribution for a {TDMA} Model with a Finite Buffer",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We obtain detailed analytic formulas for the density and probability
distribution of the delay in a TDMA
model with a finite buffer. On successive intervals of length equal to
the duration of a slot, the density is
expressed as (infinite) linear combinations of beta densities with
positive coefficients.
A recursive scheme, obtained by a matrix-analytic derivation, allows for
the highly efficient computations of
the coefficient sequences.
Topics keywords: Queuing/performance evaluation.
Methods keywords: Queueing theory."
}
@INPROCEEDINGS{Neut0305:Delay,
AUTHOR="Marcel F. Neuts and Jun Guo and Moshe Zukerman and Hai Vu",
TITLE="Delay Analysis for a Finite Buffer {TDMA} Model",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We obtain detailed analytic formulas for the density and probability
distribution of the delay in a TDMA
model with a finite buffer. On successive intervals of length equal to
the duration of a slot, the density is
expressed as (infinite) linear combinations of beta densities with
positive coefficients.
A recursive scheme, obtained by a matrix-analytic derivation, allows for
the highly efficient computations of
the coefficient sequences."
}
@INPROCEEDINGS{Neut0305:Performance,
AUTHOR="Marcel F. Neuts and Zvi Rosberg and Hai Vu and Jolyon White and Moshe
Zukerman",
TITLE="Performance Enhancement of Optical Burst Switching using Burst Segmentation",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper we provide an analytical framework for studying the
performance of Optical Burst Switching (OBS) networks using Burst
Segmentation. We first consider a single link model to evaluate
the blocking probability of OBS using Burst Segmentation and
confirm it by simulation. We use this analysis to demonstrate the
benefit of Burst Segmentation over the well-known Just-Enough-Time
(JET) policy for the single link case. We then extend these models
to a network scenario using a reduced load fixed point
approximation to evaluate blocking probabilities and to show the
advantages provided by Burst Segmentation for OBS networks."
}
@TECHREPORT{Newm0306:Global,
AUTHOR="Harvey Newman and Philippe Galvez and Gregory Denis and David Collados and
Kun Wei and David Adamczyk",
TITLE="Global Platform for Rich Media Conferencing and Collaboration",
TYPE="arXiv report",
NUMBER="cs.MM/0306116",
MONTH=jun,
YEAR=2003,
NOTE="CHEP03 Conference",
KEYWORDS="Multimedia; Networking and Internet Architecture",
ABSTRACT={The Virtual Rooms Videoconferencing Service (VRVS) provides a worldwide
videoconferencing service and collaborative environment to the research
and
education communities. This system provides a low cost,
bandwidth-efficient,
extensible means for videoconferencing and remote collaboration over
networks
within the High Energy and Nuclear Physics communities (HENP). VRVS has
become
a standard part of the toolset used daily by a large sector of HENP, and
it is
used increasingly for other DoE/NSF-supported programs. The current
features
included multi-protocol, multi-OS support for all significant video
enabled
clients including: H.323, Mbone, QuickTime, MPEG2, Java Media Framework,
and
other clients. The current architecture makes VRVS a distributed, highly
functional, and efficient software-only system for multipoint audio, video
and
web conferencing and collaboration over global IP networks. VRVS has
developed
the VRVS-AG Reflector and a specialized Web interface that enables end
users to
connect to any Access Grid (AG) session, in any of the AG {"}virtual
venues{"} from
anywhere worldwide. The VRVS system has now been running for the last five
and
half years, offering to the HENP community a working and reliable tool for
collaboration within groups and among physicists dispersed world-wide. The
goal
of this ongoing effort is to develop the next generation collaborative
systems
running over next generation networks. The new developments area integrate
emerging standards, include all security aspects, and will extend the
range of
VRVS video technologies supported to cover the latest high end standards
quality. We will focus the discussion on the new capability provides by
the
latest version V3.0 and its future evolution.},
URL="http://arXiv.org/abs/cs/0306116"
}
@INPROCEEDINGS{Ng0303:Measurement,
AUTHOR="T.S. Eugene Ng and Yang-hua Chu and Sanjay Rao and Kunwadee Sripanidkulchai
and Hui Zhang",
TITLE="Measurement-Based Optimization Techniques for Bandwidth-Demanding
Peer-to-Peer Systems",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Measurement-based optimization is one important strategy to improve
the performance of bandwidth-demanding peer-to-peer systems. However,
to date, we have little quantitative knowledge of how well basic
light-weight measurement-based techniques such as RTT probing, 10KB TCP
probing, and bottleneck bandwidth probing may work in practice in the
peer-to-peer environment. By conducting trace-based analyses, we find
that the basic techniques can help achieve 40 to 50\% optimal
performance. To deepen our understanding, we analyze some of the
intrinsic properties of these techniques. Our analyses reveal the
inherent difficulty of the peer selection problem due to the extreme
heterogeneity in the peer-to-peer environment, and that the basic
techniques are limited because their primary strength lies in
eliminating the low-performance peers rather than reliably identifying
the best-performing one.
However, our analyses also reveal two key insights that can
potentially be exploited by applications. First, for adaptive
applications that can continuously change communication peers, the
basic techniques are highly effective in guiding the adaption
process. In our experiments, typically an 80\% optimal peer can be
found by trying less than 5 candidates.
Secondly, we find that the basic techniques are highly complementary
and can potentially be combined to better identify a high-performance
peer, thus even applications that cannot adapt may benefit. Using
media file sharing and overlay multicast streaming as case studies, we
have systematically experimented with several simple combined peer
selection techniques. Our results show that for the non-adaptive media
file sharing application, a simple combined technique can boost
performance to 60\% optimal. In contrast, for the continuously
adaptive overlay multicast application, we find that a basic technique
with even low-fidelity network information is sufficient to ensure
good performance. We believe our findings will help guide the future
designs of high-performance peer-to-peer systems."
}
@INPROCEEDINGS{Ng0305:Application,
AUTHOR="Wee Teck Ng and V. k. Dubey",
TITLE="Application of Angular Diversity in {OFDM} Systems",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Orthogonal Frequency Division Multiplexing(OFDM) can be
successfully used in mitigating the effect of multipath in a
wireless channel. However, its' performance degrade in the
presence of Doppler spreading. In this paper, multiple beamforming
using Uniform Linear Arrays(ULA), is used for OFDM systems to
reduce Doppler spread and exploit the advantage of diversity. Each
of the beams receive signal with equal Doppler spread, which are
combined using Equal Gain Combining(EGC). We also present a method
of determining the frequency compensating parameters, for beams
pointing in different directions. Finally, our simulation results
show that angular diversity in OFDM systems can provide
significant improvement as compared to using only single
beamforming."
}
@INPROCEEDINGS{Nguy0303:Path,
AUTHOR="Thinh Nguyen",
TITLE="Path Diversity with Forward Error Correction {(PDF)} System for Delay
Sensitive Applications over the Internet",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Packet loss and end-to-end delay limit delay sensitive applications over
the best effort packet switched networks such as the Internet. In our
previous work, we have shown that substantial reduction in packet loss can
be achieved by sending packets at appropriate sending rates to a receiver
from multiple senders, using disjoint paths, and by
protecting packets with forward error correction. In this paper, we
propose a Path Diversity with Forward error correction (PDF)system for
delay sensitive applications over the Internet in which, disjoint paths
from a sender to a receiver arecreated using a collection of relay nodes.
We propose a scalable, heuristic scheme for
selecting a redundant path between a sender and a receiver, and show that
substantial reduction in packet loss can be achieved by dividing packets
between the default path and the redundant path. NS simulations are used
to verify the effectiveness of PDF system."
}
@INPROCEEDINGS{Ni0305:Hierarchical,
AUTHOR="Jian Ni and Danny H. K. Tsang and Siu-Hong Yeung and Xiaojun Hei",
TITLE="Hierarchical Content Routing in Large-Scale Multimedia Content Delivery
Network",
BOOKTITLE="ICC 2003 - Global Services and Infrastructure for Next Generation Networks",
ADDRESS="Anchorage, Alaska",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Content Delivery Network (CDN) is an intermediate layer of
infrastructure (middleware) that helps to efficiently deliver the
ever increasing multimedia content from content providers to a
large community of clients. Content routing is an essential
component of CDN architecture. In this paper we propose a
hierarchical content routing architecture for large-scale CDN, in
which CDN servers perform intra-cluster and inter-cluster content
routing based on a two-level hierarchical overlay network. We
analyze the routing overhead and the corresponding CDN performance
of different intra-cluster content routing schemes. In particular,
we propose a semi-hashing based scheme for intra-cluster content
routing and a content-query based scheme for inter-cluster content
routing."
}
@INPROCEEDINGS{Nicu0303:Ad,
AUTHOR="Dragos Niculescu and Badri Nath",
TITLE="Ad Hoc Positioning System {(APS)} Using {AOA}",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Position information of individual nodes is useful in implementing
functions such as routing and querying in ad-hoc networks. Deriving
position information by using the capability of the nodes to measure time
of arrival (TOA), time difference of arrival (TDOA), angle of arrival
(AOA) and signal strength have been used to localize nodes relative to a
frame of reference. The nodes in an ad-hoc network can have multiple
capabilities and exploiting one or more of the capabilities can improve
the quality of localization. In this paper, we show how AOA capability of
the nodes can be used to derive position information. We propose a method
for all nodes to determine their orientation and position in an ad-hoc
network where only a fraction of the nodes have positioning capabilities,
under the assumption that each node has the AOA capability."
}
@ARTICLE{Nieh0302:Measuring,
AUTHOR="Jason Nieh and Seung Yang and Naomi Novik",
TITLE="Measuring Thin-Client Performance Using Slow-Motion Benchmarking",
JOURNAL="ACM Transactions on Computer Systems (TOCS)",
NUMBER="21(1)",
PAGES="87-115",
MONTH=feb,
YEAR=2003
}
@ARTICLE{Nieh0305:Design,
AUTHOR="Jason Nieh and Monica Lam",
TITLE="The Design, Implementation and Evaluation of {SMART:} A Scheduler for
Multimdedia Applications",
JOURNAL="ACM Transactions on Computer Systems (TOCS)",
NUMBER="21(2)",
MONTH=may,
YEAR=2003
}
@INPROCEEDINGS{Nika0302:Integrating,
AUTHOR="Pekka Nikander and Jukka Ylitalo and Jorma Wall",
TITLE="Integrating Security, Mobility and Multi-Homing in a {HIP} Way",
BOOKTITLE="of Network and Distributed Systems Security Symposium, NDSS '03",
ADDRESS="San Diego, CA",
PAGES="87-99",
MONTH=feb,
YEAR=2003,
URL="AccessedFebruary2003athttp://www.tml.hut.fi/~pnr/publications/NDSS03-Nikander-et-al.pdf"
}
@ARTICLE{Niu0311:Vacation,
AUTHOR="Zhisheng Niu and Tao Shu and Yoshitaka Takahashi",
TITLE="A vacation queue with setup and close-down times and batch Markovian
arrival processes",
JOURNAL="Performance Evaluation",
VOLUME=54,
NUMBER=3,
PAGES="225-248",
MONTH=nov,
YEAR=2003,
REFERENCES=14,
KEYWORDS="Batch Markovian arrival process; Finite-capacity queue; Vacation; Setup
time; Close-down time; Supplementary variable method",
ABSTRACT="We consider a finite-capacity single-server vacation queue with
close-down/setup times and batch Markovian arrival process (BMAP), where
both the service time, the vacation time, the setup time, and the
close-down time are generally distributed. The queueing model has
potential applications in SVC (switched virtual connection)-based
IP-over-ATM networks and multiple protocol label switched (MPLS) networks.
By applying the supplementary variable technique, we develop a unified
solution to both the single-vacation and multiple-vacation models and for
either the PBAS (partial batch acceptance strategy) or the WBAS (whole
batch acceptance strategy) service disciplines. For both models, we obtain
the queue length distribution at batch arrival epochs and that at an
arbitrary time instant, the loss probability of a whole batch or an
arbitrary customer in a batch, server setup rate, server utilization
ratio, and the LST of the waiting time distribution. Through the numerical
examples, we find that: (1) there is a trade-off between the users
quality-of-service (e.g., loss probabilities, wanting times) and the
system performance (e.g., server setup rate, server utilization ratio);
(2) the system performance is closely related not only to the first and
second order moments of the arrival process but also the pattern
(distribution) of the customer arrivals; (3) mean batch size is a much
more critical factor to influence the queueing systems performance than
the type of batch size distribution. These conclusions are of instructive
meanings in the design of IP-over-ATM or more generally MPLS-based
networks.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-48NJ5FF-1-9T\&\_cdi=5663\&\_orig=browse\&\_coverDate=11\%2F30\%2F2003\&\_sk=999459996\&view=c\&wchp=dGLbVtz-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=918736fb5b79bb007ea42e9db15ab3bd\&ie=f.pdf"
}
@INPROCEEDINGS{Noel0305:Impact,
AUTHOR="Nele Noels and Heidi Steendam and Marc Moeneclaey",
TITLE="The impact of the observation model on the Cramer-Rao bound for carrier
phase and frequency synchronization",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This contribution considers the Cramer-Rao bound (CRB) related to the joint
estimation of the carrier phase and frequency of a noisy linearly modulated
signal with random data symbols, using the correct continuous-time model of
the rceived signal. We compare our results with the existing results
obtained from a (commonly used) simplified discrete-time model of the
matched filter output samples [1,2], that ignores useful signal reduction
and ISI cuased by nonzero frequency offset. We show that both observation
models yield the same CRB for phase estimation. As far as frequency
estimation is concerned, we point out that (i) the correct observation
model yields the smaller CRB, and (ii) the difference between the CRBs
resulting from the two models is apparent only at very small SNR. This
indicates that at practical SNR values, the frequency offset affects the
likelihood function mainly through the signal rotation (rather than signal
magnitude) at the matched filter output."
}
@INPROCEEDINGS{Noel0305:Turbo,
AUTHOR="Nele Noels and Cédric Herzet and Antoine Dejonghe and Vincenzo Lottici and
Heidi Steendam and Marc Moeneclaey",
TITLE="Turbo synchronization : an {EM} algorithm interpretation",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper is devoted to turbo synchronization, that is to say the use
of soft information to estimate parameters like carrier phase,
frequency offset or timing within a turbo receiver. It is shown how
maximum-likelihood estimation of those synchronization parameters can
be implemented by means of the iterative expectation-maximization (EM)
algorithm [Dempster]. Then we show that the EM algorithm iterations
can be combined with those of a turbo receiver. This leads to a
general theoretical framework for turbo synchronization. The soft
decision-directed ad-hoc algorithm proposed in [Lottici] for carrier
phase recovery turns out to be a particular instance of this
implementation. The proposed mathematical framework is illustrated
by simulations reported for the particular case of carrier phase
estimation combined with iterative demodulation and decoding [ten Brink].."
}
@INPROCEEDINGS{Nomi0303:Minimizing,
AUTHOR="Christos Nomikos and Aris Pagourtzis and Stathis Zachos",
TITLE="Minimizing Request Blocking in All-Optical Rings",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="In all-optical networks that use WDM technology it is often the case
that several communication requests have to be blocked, due to bandwidth
and technology limitations. Minimizing request blocking is therefore an
important task calling for algorithmic techniques for efficient routing
and wavelength assignment.
Here we study the problem for rings under both the undirected and the
directed settings, corresponding to symmetric and one-way communication
respectively. The problem in graph-theoretic terms can be formulated
as the Maximum Routing and Path Coloring Problem. We present a
Chain-and-Matching technique for routing requests and coloring the
corresponding paths which gives constant approximations for both the
undirected and the directed cases. For the undirected problem we obtain a
(2/3)-approximation algorithm; this corresponds to a considerable increase
in the number of satisfied requests compared to the best known algorithm so
far, due to Wan and Liu (1998), that achieves a (1-{1/e}) ratio using
iteratively a maximum edge-disjoint paths algorithm. For the directed
case, we also introduce a Balanced Matching method which, combined with
the Chain-and-Matching technique, gives a (7/11)-approximation algorithm.
This algorithm also improves
upon the (1-{1/e})-approximation algorithm that can be obtained
by extending the iterative method of Wan and Liu."
}
@ARTICLE{Nybe0312:Exact,
AUTHOR="Eeva Nyberg and Jorma Virtamo and Samuli Aalto",
TITLE="An exact end-to-end blocking probability algorithm for multicast networks",
JOURNAL="Performance Evaluation",
VOLUME=54,
NUMBER=4,
PAGES="311-330",
MONTH=dec,
YEAR=2003,
REFERENCES=13,
KEYWORDS="Multicast; Blocking; Network; OR-convolution; One-to-many; Dynamic
membership",
ABSTRACT="We consider the calculation of blocking probabilities in multicast trees
with dynamic membership. We extend the work by Karvo et al., where an
approximate algorithm based on the reduced load approximation (RLA) was
given to calculate end-to-end blocking for infinite sized user populations
in multicast networks. The new algorithm for calculating end-to-end call
blocking exactly for an arbitrary sized user population is based on the
known blocking probability algorithm in hierarchical multiservice access
networks, where link occupancy distributions are alternately convolved and
truncated. We show that the algorithm can be applied to multicast trees
embedded in a network with an arbitrary topology carrying also
non-multicast traffic. The resource sharing of multicast connections,
however, requires the modification of the algorithm by introducing a new
type of convolution, the OR-convolution. In addition, we discuss several
different user population models for which the algorithm is applicable.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-491J2GN-1-80\&\_cdi=5663\&\_orig=browse\&\_coverDate=12\%2F31\%2F2003\&\_sk=999459995\&view=c\&wchp=dGLbVlb-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=2cfa53e7383be65f7d116b272ef9da64\&ie=f.pdf"
}
@ARTICLE{Obai0305:DRA,
AUTHOR="M. Obaidat and C. Ahmed and Noureddine Boudriga",
TITLE="{DRA:} a new buffer management scheme for wireless atm networks using
aggregative large deviation principle",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=7,
PAGES="708-717",
MONTH=may,
YEAR=2003,
REFERENCES=12,
KEYWORDS="Dynamic resource management; QoS; Wireless ATM; Buffer management; CDMA;
Large deviation principle",
ABSTRACT="In this paper, we present a buffer management scheme called Dynamic
Resource Allocation (DRA) that provides TCP traffic control guarantees to
VCs carrying multiple dynamic discard thresholds (Multiple Dynamic
ThresholdsMDT) over a wireless CDMA ATM network. It is assumed that we
have TCP wireless ATM networks integrating the Code Division Multiple
Access (CDMA). A major task activity related to these systems addresses
the call admission control and resource management The MDT scheme
classifies the traffic into several classes and maintains a separate
dynamic threshold buffer for each class. DRA is used on a FIFO buffer
shared by several VCs. Each VC can carry traffic from one or more TCP
connections. The DRA scheme offers an intelligent, dynamic, policy-based
approach to traffic prioritizing, load balancing, and accounting that
controls the most critical areas of the TCP rate monitoring using the
large deviation principle. Through its advanced traffic control
algorithms, the DRA assures guaranteed traffic flows, minimal packet loss
or retransmissions, optimizes TCP throughput, and assures that the network
is always used to its maximum potential.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-4753K38-1-62\&\_cdi=5624\&\_orig=browse\&\_coverDate=05\%2F01\%2F2003\&\_sk=999739992\&view=c\&wchp=dGLbVtz-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=8200eeca0938ed7370366c2a1162ec2f\&ie=f.pdf"
}
@TECHREPORT{Odly0306:Internet,
AUTHOR="Andrew Odlyzko",
TITLE="Internet traffic growth: Sources and implications",
INSTITUTION="University of Minnesota",
ADDRESS="Minneapolis, Minnesota",
MONTH=jun,
YEAR=2003,
REFERENCES=45,
KEYWORDS="Internet tra±c growth, network economics, telecom industry structure,
QoS",
ABSTRACT="The high tech bubble was in°ated by myths of astronomical Internet
tra±c growth rates. Yet although these
myths were false, Internet tra±c was increasing very rapidly, close to
doubling each year since 1997. Moreover,
it continues growing close to this rate. This rapid growth re°ects a
poorly understood combination of many
feedback loops operating on di®erent time scales. Evidence about past
and current growth rates and their
sources is presented, together with speculations about the future. The
expected rapid but not astronomical
growth of Internet tra±c is likely to have important implications for
networking technologies that are deployed
and for industry structure. Backbone transport is likely to remain a
commodity and be provided as a single high
quality service. It is probable that backbone revenues will stay low, as
the complexity, cost, and revenue and
pro¯t opportunities continue to migrate towards the edges of the
network.",
URL="http://www.dtc.umn.edu/~odlyzko/doc/itcom.internet.growth.pdf"
}
@TECHREPORT{Odly0306:Many,
AUTHOR="Andrew Odlyzko",
TITLE="The Many Paradoxes of Broadband",
TYPE="Preprint",
INSTITUTION="Digital Technology Center, University of Minnesota",
ADDRESS="Minneapolis, Minnesota",
MONTH=jun,
YEAR=2003,
REFERENCES=73,
KEYWORDS="DSL; broadband; history",
ABSTRACT="There is much dismay and even despair over the slow pace
at which broadband is advancing in the United States. This slow pace
is often claimed to be fatally retarding the recovery of the entire IT
industry. As a result there are increasing calls for government action,
through regulation or even through outright subsidies.
A careful examination shows that broadband is full of puzzles and para-
doxes, which suggests caution before taking any drastic action. As one
simple example, the basic meaning of broadband is almost universally
misunderstood, since by the o±cial de¯nition, we all have broadband
courtesy of the postal system. Also, broadband penetration, while gener-
ally regarded as disappointingly slow, is actually extremely fast by most
standards, faster than cell phone di®usion at a comparable state. Fur-
thermore, many of the policies proposed for advancing broadband are
likely to have perverse e®ects. There are many opportunities for
narrow-
band services that are not being exploited, some of which might speed
up broadband adoption.
There are interesting dynamics to the ¯nancial and technological scenes
that suggest broadband access may arrive sooner than generally ex-
pected. It may also arrive through unexpected channels. On the other
hand, ¯ber-to-the-home, widely regarded as the Holy Grail of residen-
tial broadband, might never become widespread. In any case, there is
likely to be considerable turmoil in the telecom industry over the next
few years. Robust growth in demand is likely to be combined with a
restructuring of the industry.",
URL="http://www.dtc.umn.edu/~odlyzko/doc/broadband.paradox.pdf"
}
@INPROCEEDINGS{Odly0310:Case,
AUTHOR="Andrew Odlyzko",
TITLE="The Case Against Micropayments",
BOOKTITLE="Financial Cryptography 2003",
PUBLISHER="Springer Verlag",
ADDRESS="Minneapolis, MN",
MONTH=feb,
YEAR=2003,
REFERENCES=20,
NOTE="Lecture Notes in Computer Science",
KEYWORDS="Micropayments",
ABSTRACT="Micropayments are likely to continue disappointing their advocates.
They are an interesting technology. However, there are many
non-technological reasons why they will take far longer than is generally
expected to be widely used, and most probably will play only a minor
role in the economy.",
URL="http://www.dtc.umn.edu/~odlyzko/doc/case.against.micropayments.pdf"
}
@TECHREPORT{Odly0312:Pricing,
AUTHOR="Andrew Odlyzko",
TITLE="Pricing and Architecture of the Internet: Historical Perspectives from
Telecommunications and Transportation",
INSTITUTION="Digital Technology Center, University of Minnesota",
MONTH=dec,
YEAR=2003,
KEYWORDS="pricing; charging; QoS",
ABSTRACT="With telecommunications in a slump, the search is on for ways to
re-invigorate this key industry. The main problems are clearly economic
much
more than technological, and many of the proposed remedies would lead to
new
architectures for the Internet that would provide for greater control by
carriers.
They would drastically reduce the role of the end-to-end principle, the
main
foundation for the success of the Internet, in which functionality resides
at the
edges of the network. The proposals to restrict voice over Internet (VoIP)
are
just one part of this trend.
Historical precedents from telecommunications for introduction of
differentiated services and sophisticated charging methods on the Internet
are discouraging. The almost universal trend has been towards decreasing
price discrimination and simpler pricing.
The history of transportation presents a different picture, with frequent
movements towards increasing price discrimination and more complicated
pricing (although with many noteworthy reversals). Charging according to
the nature of the goods being transported has been and continues to be the
norm.
Since the incentives to price discriminate are increasing, and the ability
to do
so is also growing, it is conceivable that telecommunications might break
with
its historical record and follow the example of transportation. It is
therefore
of interest to examine the evolution of pricing and quality
differentiation in
transportation.
Some historical sketches on the evolution of pricing in transportation are
presented. Their implications for telecommunications, and especially for
Internet
pricing and architecture, are discussed.",
URL="http://www.dtc.umn.edu/~odlyzko/doc/pricing.architecture.pdf"
}
@TECHREPORT{ODon0301:Open,
AUTHOR="Michael O'Donnell",
TITLE="Open Network Handles Implemented in {DNS}",
TYPE="technical report",
INSTITUTION="arXiv",
NUMBER="cs.NI/0301011",
MONTH=jan,
YEAR=2003,
KEYWORDS="handles; URN",
ABSTRACT="An Open Network Handle System (ONHS) provides an intermediate level of
service between IP numbers and domain names. A handle adheres permanently
to an
owner, who may assign and reassign it to different addresses at will. But
a
handle is a number, carrying no significance in natural language. Any user
desiring a handle may generate one from a public key. This memo describes
a
simple implementation of an Open Network Handle System using the security
extensions to the Domain Name System (DNSSEC).",
URL="http://arXiv.org/abs/cs/0301011"
}
@TECHREPORT{ODon0302:Proposal,
AUTHOR="Michael O'Donnell",
TITLE="A Proposal to Separate Handles from Names on the Internet",
INSTITUTION="arXiv",
MONTH=feb,
YEAR=2003,
KEYWORDS="Networking and Internet Architecture",
ABSTRACT="Networked communications inherently depend on the ability of the sender of
a
message to indicate through some token how the message should be delivered
to a
particular recipient. The tokens that refer messages to recipients are
variously known as routes, addresses, handles, and names) ordered by their
relative nearness to network topology vs. human meaning. All four sorts of
token refer in some way to a recipient, but they are controlled by
different
authorities and their meanings depend on different contextual parameters.
Today''''s global Internet employs dynamically determined routes, IP
addresses,
and domain names. Domain names combine the functions of handles and names.
The
high value of domain names as names leads to substantial social and legal
dispute about their assignment, degrading their value as handles. The time
has
come to provide a distinct open network handle system (ONHS), using
handles
that are not meaningful in natural language and are therefore not subject
to
the disputes surrounding the use of names.
A handle service may be deployed easily as a handle domain within the
current
Domain Name System. In order to minimize the administrative load, and
maximize
their own autonomy, netizens may use public-key cryptography to assign
their
own handles.",
URL="http://arXiv.org/abs/cs/0302017"
}
@ARTICLE{ODon0308:Congestion,
AUTHOR="Adam O'Donnell and Harish Sethu",
TITLE="Congestion control, differentiated services, and efficient capacity
management through a novel pricing strategy",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=13,
PAGES="1457-1469",
MONTH=aug,
YEAR=2003,
REFERENCES=26,
KEYWORDS="Internet economics; Differentiated services; Pricing; Congestion control;
Quality of service; Capacity management",
ABSTRACT="Pricing is an effective tool to control congestion and achieve Quality of
Service (QoS) provisioning for multiple differentiated levels of service.
In this paper, we propose a practical, flexible and computationally simple
pricing strategy that can achieve QoS provisioning in Differentiated
Services networks with multiple priority classes operating in an efficient
economic market, while also maintaining stable transmission rates from
end-users. In contrast to previous work, in which dynamic pricing
strategies are based on the state of congestion alone, our strategy adds a
separate price component for the preferential service received by a packet.
This permits an efficient market for network resources and services, with
the price charged being dependent upon both the cost of the resources and
the dynamically changing demand for it. In addition, this automatically
enforces efficient capacity management in the allocation of resources
among the various service classes, leading to a user-centric approach
where a user is not charged a higher price unless preferential service is
actually delivered. Our analytical and simulation results demonstrate
that, with the combination of user adaptation and our pricing strategy,
differentiated services can be achieved with stable transmission rates.
This paper concludes with a discussion of various operational issues
associated with actual deployment of such a pricing strategy.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47X72N2-3-4B\&\_cdi=5624\&\_orig=browse\&\_coverDate=08\%2F15\%2F2003\&\_sk=999739986\&view=c\&wchp=dGLbVzz-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=5ec1c0533b9ecb1f263c271f08f28d9d\&ie=f.pdf"
}
@INPROCEEDINGS{Ogaw0305:Design,
AUTHOR="Kentaro Ogawa",
TITLE="Design of the Multi-channel Communication System for the {MPEG} Video Data
Streams Using Adaptive QoS Control",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we show a design method for a multi-channel communication
system for MPEG video that is based on adaptive QoS control. The relation
between the SNR degradation and the coded bitrate in each scene of a video
channel is approximated by linear equation. The bitrate is allocated to
each scene based on a linear equation. However, if the number of channels
increases, the bitrate is not allocated appropriately because the scenes
change frequently. In this paper, we divide the video channels into
groups. An optimum number of groups can be obtained by considering the
scene characteristics. Furthermore, we also show the experimental results
of applying the method to a prototype system."
}
@ARTICLE{OHar0307:Gulliver,
AUTHOR="G. O'Hare and M. O'Grady",
TITLE="Gulliver's Genie: a multi-agent system for ubiquitous and intelligent
content delivery",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=11,
PAGES="1177-1187",
MONTH=jul,
YEAR=2003,
REFERENCES=33,
KEYWORDS="Context-aware computing; Multi-agent systems; Wireless communications;
Mobile computing; Tourist information systems",
ABSTRACT="This paper introduces Gulliver's Genie a context-aware tourist guide that
assists roaming tourists. The approach adopted within this system is the
deployment of intelligent agents, which collectively determine the user
context and retrieve and assemble multi-media presentations that are
wirelessly transmitted and displayed on a Personal Digital Assistant
(PDA). As a backdrop, we first consider the state of the art in terms of
context sensitive tourist guides, telecommunications, positioning
technology and agent technologies. Gulliver's Genie considers user context
in terms of position, orientation and user profile. System agents are
strong intentional agents that base deductions on a mental state
comprising of Beliefs, Desires and Intentions (BDI). This paper presents
the design of the system together with a glimpse of the user experience.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47C4CX6-1-9\&\_cdi=5624\&\_orig=browse\&\_coverDate=07\%2F01\%2F2003\&\_sk=999739988\&view=c\&wchp=dGLbVtb-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=9248de91ed3cca349e918cec4417e90c\&ie=f.pdf"
}
@INPROCEEDINGS{Olfa0305:Recursive,
AUTHOR="Masoud Olfat and K.J. Ray Liu",
TITLE="Recursive Construction of {16-QAM} Super-Golay codes for {OFDM} systems",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, the Peak to mean Envelope Power (PMEPR)
of the OFDM codes generated from an 16-QAM constellation is
discussed. Maintaining the same level of error correction
properties, these codes achieve higher information rate. A new set
of 16-QAM Golay sequences having PMEPR bounded up to 3dB is
defined. Many recursive structures are found to generate Super
Golay sequences. The recursive algorithm is started by a
generalized realization of an 16-QAM sequence as sum of two QPSK
sequences. The coding rate and information rate of the generated
codes is compared to similar works."
}
@INPROCEEDINGS{Olsz0309:Network,
AUTHOR="Chris Olszewski and Jean-Francois Labourdette and Frank Huang and Daryl
Chaires and Dimitrios Pendarakis",
TITLE="Network Migration: Evolution from Ring to Mesh",
BOOKTITLE="National Fiber Optic Engineers Conference (NFOEC)",
MONTH=sep,
YEAR=2003,
KEYWORDS="networking; mesh; ring",
ABSTRACT="The evolution of carrier networks will likely proceed by integrating the
functions of multiple traditional network elements (NEs) into single edge
devices and incorporating mesh-like characteristics into the core. NE
consolidation offers carriers the benefits of the latest technology in
decreased operating expenses (fewer and smaller NEs taking up less space
and power with reduced complexity and maintenance costs). The target
architecture proposed in this paper provides both grooming at the edge and
mesh networking in the core network, as well as a network management
approach that makes use of automatic neighbor discovery and fast
provisioning. Evolving current ring-based networks towards this next
generation network (NGN) is clearly a challenge and is the subject of this
paper.",
URL="http://www-ee.engr.ccny.cuny.edu/www/web/ellinas/NetworkMigration\_NFOEC2003.PDF"
}
@INPROCEEDINGS{ONei0305:Adaptive,
AUTHOR="Daniel O'Neill",
TITLE="Adaptive Congestion Control for Wireless Networks Using {TCP}",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper develops an optimal
congestion control algorithm for wireless networks using TCP based
on utility maximization techniques. The algorithm is transparent
to and requires no modifications of TCP. The algorithm, termed
CBW, adaptively responds to changes in network routing and
topology. Several simulations are presented and indicate a
substantial gain in through-put and reduction in aggregate
transmitter power. A simple heuristic is also presented."
}
@INPROCEEDINGS{Ongg0305:Hybrid,
AUTHOR="Eko Onggosanusi and Anand Dabak and Yan Hui and Gibong Jeong",
TITLE="Hybrid {ARQ} Transmission and Combining for {MIMO} Systems",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we investigate several possibilities to increase
the efficiency of hybrid automatic retransmission request (HARQ) for
multi-input multi-output (MIMO) systems. At the receiver side,
two HARQ combining schemes, namely pre-combining and post-combining,
are discussed and analyzed. We show that pre-combining is superior
to post-combining. In addition, we propose a transmission technique,
termed the basis hopping, which improves the HARQ diversity gain
especially
in slow fading channels. We demonstrate that the use of pre-combining
in conjunction with the proposed basis hopping technique provides
dramatic gain over a simplistic application of HARQ scheme for MIMO."
}
@ARTICLE{Orda0308:Precomputation,
AUTHOR="Ariel Orda and Alex Sprintson",
TITLE="Precomputation Schemes for QoS Routing",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=4,
PAGES="578-591",
MONTH=aug,
YEAR=2003,
REFERENCES=28,
KEYWORDS="hierarchical networks; precomputation; quality of service (QoS); routing;
topology aggregation",
ABSTRACT={Precomputation-based methods have recently been proposed as an instrument
to facilitate scalability, improve response time, and reduce computation
load on network elements. The key idea is, in effect, to reduce the time
needed to handle an event by performing some computation in advance, i.e.,
prior to the event's arrival. Such computations are performed as background
processes, enabling a solution to be provided promptly upon a request,
through a simple, fast procedure. We investigate precomputation methods in
the context of quality-of-service (QoS) routing. Precomputation is highly
desirable for QoS routing schemes due to the high computational complexity
of selecting QoS paths, and the need to provide a satisfactory path
promptly upon a request. We consider two major settings of QoS routing.
The first case is where the QoS constraint is of the {"}bottleneck{"}
type, e.g., a bandwidth requirement, and network optimization is sought
through hop minimization. The second is the more general setting of
{"}additive{"} QoS constraints (e.g., delay) and general link costs. The
paper mainly focuses on the first setting. We show that, by exploiting the
typical hierarchical structure of large-scale networks, a substantial
improvement can be achieved in terms of computational complexity. We
consider networks with topology aggregation. We show that precomputation
is a necessary element for any QoS routing scheme and establish a
precomputation scheme appropriate for such settings. We consider the case
of additive QoS constraints (e.g., delay) and general link costs. As the
routing problem becomes NP-hard, we focus on epsilon-optimal
approximations and derive a precomputation scheme that offers a major
improvement over the standard approach.},
URL="http://ieeexplore.ieee.org/iel5/90/27488/01224457.pdf?isNumber=27488\&prod=JNL\&arnumber=1224457\&arSt=+578\&ared=+591\&arAuthor=Orda\%2C+A.\%3B+Sprintson\%2C+A."
}
@INPROCEEDINGS{Orug0305:Analyzing,
AUTHOR="Sai Oruganti and Michael Devetsikiotis",
TITLE="Analyzing Robust Active Queue Management Schemes: A Comparative Study of
Predictors and Controllers",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Active Queue Management (AQM) techniques are designed to detect
incipient network congestion and proactively drop packets so as to
avoid congestion later. Most AQM techniques use the exponentially
weighted moving average (EWMA) of the queue length as a measure
of congestion. More recent efforts, like Adaptive Virtual Queue,
have concentrated on rate-based packet marking. In this paper we
analyze the robustness of a pure rate based packet marking scheme
and compare it with our Predictive AQM (PAQM) scheme. The PAQM
proposed in this paper extends the calculation of the EWMA queue
length by including a term that represents the future traffic
intensity. To simplify the analysis, the AQM techniques were
studied as a combination of a measurement module and a control
module. Robustness, throughput and end-to-end delay jitter were
chosen as performance metrics for various combinations of
predictors and controllers. We have the following observations for
a given network (i) performance of AQM schemes is sensitive to
both the weight and interval of predicted future observations and
prediction need not always perform better, (ii) the
performance of more robust AQM schemes in terms of goodput was
found to be better than less robust ones."
}
@INPROCEEDINGS{Otne0305:Iterative,
AUTHOR="Roald Otnes and Michael Tuechler",
TITLE="On iterative equalization, estimation, and decoding",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We consider the problem of coded data transmission
over an inter-symbol interference (ISI) channel with unknown and
possibly time-varying parameters. We propose a low-complexity
algorithm for joint equalization, estimation, and decoding using
an estimator, which is separate from the equalizer. Based on existing
techniques for analyzing the convergence of iterative decoding
algorithms, we show how to find powerful system configurations.
This includes the use of recursive precoders in the transmitter. We
derive a novel a-posteriori probability equalization algorithm for
imprecise knowledge of the channel parameters. We show that the
performance loss implied by not knowing the parameters of the
ISI channel is entirely a loss in signal-to-noise ratio for which a
suitably designed iterative receiver algorithm converges."
}
@INPROCEEDINGS{Ou0305:Near,
AUTHOR="Canhui Ou and Jing Zhang and Hui Zang and Laxman Sahasrabuddhe and
Biswanath Mukherjee",
TITLE="Near-Optimal Approaches for Shared-Path Protection in {WDM} Mesh Networks",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper investigates the problem of dynamic shared-path-protected
connection provisioning in optical mesh networks employing
wavelength-division multiplexing (WDM). We prove that the problem of
finding an eligible pair of working and backup paths for a new connection
request requiring shared-path protection under the current network state
is NP-complete. We develop a heuristic, called CAFES, to compute a
feasible solution. We also design an algorithm, called OPT, to optimize
resource consumption for a given solution. The merits of our approaches
are that they capture the essence of shared-path protection and approach
to optimal solutions without enumerating paths. We evaluate the
effectiveness of our heuristics and the results are found to be promising."
}
@ARTICLE{Owez0308:Coherent,
AUTHOR="Philippe Owezarski and Nicolas Larrieu",
TITLE="Coherent charging of differentiated services in the internet depending on
congestion control aggressiveness",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=13,
PAGES="1445-1456",
MONTH=aug,
YEAR=2003,
REFERENCES=23,
KEYWORDS="Charging internet services; Internet QoS; Services differentiation;
Congestion control; TCP",
ABSTRACT="This paper deals with both enforcing and charging end-to-end Quality of
Service (QoS) and differentiated services in the Internet. Today, much
work for optimizing QoS and defining charging mechanisms accordingly is
related to low network layer (up to IP), and the current proposals under
the spotlights are VPN, CDN, (over)-provisioning, and of course DiffServ.
However, the service an user can get can be quite different from the one
provided by the network layer (IP in the Internet). Transport protocols
(TCP most of the time) induce oscillations (often seen as self-similarity)
in the traffic, in particular because of their congestion control
mechanisms. Based on this result, it is obvious that it is impossible to
coherently charge such kinds of services at layer 3. QoS has also to be
managed and enforced by transport protocols, that also have to strongly
impact the way pricing is done. As a consequence, a new approach for
services differentiation and charging (in addition to existing layer 3
approaches) at transport level is proposed. This approach relies on the
aggressiveness of congestion control mechanisms because the more
aggressive a protocol, the better the QoS it provides in case of a well
provisioned network. And of course charging has to evolve accordingly.
This idea is demonstrated by taking examples as UDP and several versions
of TCP. In particular it is proved that service differentiation can be
made that way in the Internet. This paper also gives a quantitative study
of the QoS got by users depending on the amount of resources consumed, and
it is observed that this function is linear. The charging of each service
can then be quantified that way.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47X72N2-1-R\&\_cdi=5624\&\_orig=browse\&\_coverDate=08\%2F15\%2F2003\&\_sk=999739986\&view=c\&wchp=dGLbVtz-zSkWW\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=1c14bf8bf1460781cdf0fe914e79d67a\&ie=f.pdf"
}
@ARTICLE{Ozda0304:Routing,
AUTHOR="Asuman Ozdaglar and Dimitri Bertsekas",
TITLE="Routing and Wavelength Assignment in Optical Networks",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=2,
PAGES="259-272",
MONTH=apr,
YEAR=2003,
REFERENCES=22,
KEYWORDS="exact penalty functions; lightpath; linear programming; routing; wavelength
assignment",
ABSTRACT="The problem of routing and wavelength assignment (RWA) is critically
important for increasing the efficiency of wavelength-routed all-optical
networks. Given the physical network structure and the required
connections, the RWA problem is to select a suitable path and wavelength
among the many possible choices for each connection so that no two paths
sharing a link are assigned the same wavelength. In work to date, this
problem has been formulated as a difficult integer programming problem
that does not lend itself to efficient solution or insightful analysis. In
this work, we propose several novel optimization problem formulations that
offer the promise of radical improvements over the existing methods. We
adopt a (quasi-)static view of the problem and propose new integer-linear
programming formulations, which can be addressed with highly efficient
linear (not integer) programming methods and yield optimal or near-optimal
RWA policies. The fact that this is possible is surprising, and is the
starting point for new and greatly improved methods for RWA. Aside from
its intrinsic value, the quasi-static solution method can form the basis
for suboptimal solution methods for the stochastic/dynamic settings.",
URL="http://ieeexplore.ieee.org/iel5/90/26877/01194822.pdf?isNumber=26877\&prod=JNL\&arnumber=1194822\&arSt=+259\&ared=+272\&arAuthor=Ozdaglar\%2C+A.E.\%3B+Bertsekas\%2C+D.P."
}
@INPROCEEDINGS{Ozgu0305:Blind,
AUTHOR="Baris Ozgul and Hakan Delic",
TITLE="Blind Collision Resolution for Mobile Radio Networks in Fast-Fading
Channels",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Network-assisted diversity multiple access (NDMA) is a novel
algorithm that resolves packet collisions deterministically by
means of source separation techniques. The blind version of NDMA
(B-NDMA) relies on the presence of a fading process that induces
constant channel parameters over long slot times, as well as the
transmitter-receiver phase synchronization. In this paper,
independent component analysis (ICA) is integrated into NDMA to
provide blind collision resolution with high throughput/delay
performance in a fast-fading channel environment and without any
phase control. Performance comparisons with B-NDMA are furnished
for single- and double-receive antenna scenarios."
}
@INPROCEEDINGS{Ozug0305:Label,
AUTHOR="Timucin Ozugur and Myung-Ah Park and Jason Jue",
TITLE="Label Prioritization in GMPLS-Centric All-Optical Networks",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="When establishing lightpaths in an all-optical DWDM network, it is
possible that concurrent lightpath requests will block one another if
the lightpaths attempt to reserve the same wavelength on the same link.
In this paper, we propose a novel signaling mechanism, referred to as
label prioritization, which attempts to reduce the backward-link
blocking in GMPLS-centric all-optical networks by assigning different
priorities to the suggested wavelengths (labels) of each connection
request. The prioritization of wavelengths encourages concurrent
lightpath requests to choose different wavelengths, thereby reducing
the possibility that the requests will be blocked. The label
prioritization mechanism consists of a signaling extension to GMPLS to
support the label prioritization and a modification in the optical
switch controller to support the signaling extensions. Simulation
results show that the label prioritization method can effectively
reduce wavelength conflicts."
}
@INPROCEEDINGS{Ozug0305:Novel,
AUTHOR="Timucin Ozugur",
TITLE="A Novel Approach to Deliver Push Data to Dynamic {IP} Addresses in Cellular
Networks",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper details the wireless location-aware and content aware
push application delivery over the packet-switched wireless core
network. The directory server, which is deployed besides the WAP
server in order to support the push applications by storing the
user profile, IMSI and user IP address, requires static IP
addressing to support such 3G applications. In current system,
the incoming IP packets destined for dynamic IP users are discarded
at the GGSN level. This paper introduces a methodology to provide
push services to dynamic IP addressed-mobile users in 2.5G/3G
networks, and minimize the unsuccessful-network-requested PDP Context
Activation for static IP users. The proposed method is based on the
Protection and Mobile User Activity procedures, SMS service, and
a new signaling mechanism to forward the HLR-based flags to the
WAP/Directory server."
}
@INPROCEEDINGS{Pabu0305:Architectural,
AUTHOR="Nitin Pabuwal and Navendu Jain and Bijendra Jain",
TITLE="An Architectural Framework to deploy Scatternet-based Applications over
Bluetooth",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Bluetooth is a promising wireless personal area network technology and is
on the verge of being ubiquitously deployed over a wide range of devices.
The basic unit of a Bluetooth network is a centralized master-slave
topology, namely a piconet, that can be easily extended into a multi-hop
ad-hoc network called a scatternet. Scatternets increase Bluetooth's
usability multi-folds such that numerous applications may be built over
them to unleash the potential of Bluetooth. The main ingredients of a
scatternet-based application include a topology formation and a routing
algorithm, which themselves are of many types.
A standard architectural framework shall prove extremely useful to
integrate all these applications and algorithms in a seamless, modular and
re-usable fashion, hence saving one from re-inventing the wheel most of the
time. In this paper, we present one such novel architectural framework that
constitutes of highly portable and plug-n-play modules to deploy
scatternet-based applications over Bluetooth. These constituent modules
may be developed independently and be easily integrated at run-time. The
algorithm modules may be built in an application-oriented fashion to
deliver better performance to particular type of applications that may
have specific requirements and constraints. To the best of our knowledge,
this is a first attempt to propose a standard architecture to deploy
applications over Bluetooth. We provide details of our proposed set of
APIs and describe a multimedia application that we have built in complete
accordance with our architecture."
}
@TECHREPORT{Pach0306:Reachability,
AUTHOR="Jan Pachl",
TITLE="Reachability problems for communicating finite state machines",
TYPE="arXiv report",
NUMBER="cs.LO/0306121",
MONTH=jun,
YEAR=2003,
NOTE="University of Waterloo, Department of Computer Science Research Report; May
1982; CS-82-12",
KEYWORDS="Logic in Computer Science; Networking and Internet Architecture",
ABSTRACT="The paper deals with the verification of reachability properties in a
commonly used state transition model of communication protocols, which
consists
of finite state machines connected by potentially unbounded FIFO channels.
Although simple reachability problems are undecidable for general
protocols
with unbounded channels, they are decidable for the protocols with the
recognizable channel property. The decidability question is open for the
protocols with the rational channel property.",
URL="http://arXiv.org/abs/cs/0306121"
}
@TECHREPORT{Pack0304:NCS,
AUTHOR=" {CableLabs}",
TITLE="PacketCable Network-Based Call Signaling Protocol Specification",
TYPE="Specification",
INSTITUTION="Cable Television Laboratories",
NUMBER="PKT-SP-EC-MGCP-I07-0",
MONTH=apr,
YEAR=2003,
KEYWORDS="MGCP; packet telephony; packet voice",
ABSTRACT="This specification describes a profile of the Media Gateway Control
Protocol (MGCP) for PacketCable
embedded clients, which we will refer to as the PacketCable Network-based
Call Signaling (NCS) protocol.
MGCP is a call signaling protocol for use in a centralized call control
architecture, and assumes relatively
simple client devices. The call signaling protocol is one layer of the
overall PacketCable suite of
specifications and relies upon companion protocol specifications to
provide complete end-to-end
PacketCable functionality. The scope of NCS is currently only embedded
Voice-Over-IP client devices in a
PacketCable environment and the NCS profile has therefore simplified and
in some cases modified the base
MGCP 1.0 protocol accordingly. Support for video will be added in a later
version of this document.",
URL="http://www.packetcable.com/downloads/specs/PKT-SP-MGCP-I07-030415.pdf"
}
@INPROCEEDINGS{Padm0303:Server,
AUTHOR="Venkata Padmanabhan and Lili Qiu and Helen Wang",
TITLE="Server-based Inference of Internet Link Lossiness",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We investigate the problem of inferring the packet loss characteristics of
Internet links using server-based measurements. Unlike much of existing
work on network tomography that is based on active probing, we make
inferences based on {\em passive} observation of end-to-end client-server
traffic. Our work on passive network tomography focuses on {\em
identifying} lossy links (i.e., the trouble spots in the network). We have
developed three techniques for this purpose based on Random Sampling,
Linear Optimization, and Bayesian Inference using Gibbs Sampling,
respectively. We evaluate the accuracy of these techniques using both
simulations and Internet packet traces. We find that these techniques can
identify most of the lossy links in the network with a manageable false
positive rate. For instance, simulation results indicate that the Gibbs
sampling technique has over 80\\% coverage with a false positive rate
under 5\\%. Furthermore, this technique provides a confidence indicator on
its inference. We also perform inference based on Internet traces gathered
at the busy {\em microsoft.com} Web site. However, validating these
inferences is a challenging problem. We present a method for indirect
validation that suggests that the false positive rate is manageable.
Subject keywords: Network tomography; Network Measurement; Bayesian
Inference
Method keywords: Network measurements; Simulations; Mathematical
programming/optimization; Statistics"
}
@INPROCEEDINGS{Paga0303:New,
AUTHOR="Fernando Paganini and Zhikui Wang and Steven Low and John Doyle",
TITLE="A new {TCP/AQM} for Stable Operation in Fast Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="This paper is aimed at designing a congestion control system that
scales gracefully with network capacity, providing high
utilization, low queueing delay, dynamic stability, and fairness
among users. In earlier work we had developed fluid-level control
laws that achieve the first three objectives for arbitrary
networks and delays, but were forced to constrain the resource
allocation policy. In this paper we extend the theory to include
further dynamics at TCP sources, preserving the earlier features
at fast time-scales, but permitting sources to match their
steady-state preferences at a slower time-scale, provided a bound
on round-trip-times is known.
We develop a packet-level implementation of this protocol, where
the congestion measure is communicated back to sources via marking
of an ECN bit. We discuss parameter choices for the marking and
estimation system, and demonstrate using ns-2 simulations the
stability of the protocol and its equilibrium features in terms of
utilization, queueing and fairness, in comparison with existing
protocols."
}
@ARTICLE{Pagt0311:Proactive,
AUTHOR="Theodoros Pagtzis and P. Kirstein and S. Hailes and Hossam Afifi",
TITLE="Proactive seamless mobility management for future {IP} radio access
networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=17,
PAGES="1975-1989",
MONTH=nov,
YEAR=2003,
REFERENCES=37,
KEYWORDS="Proactive mobility; Seamlessness; Cell bounce effects; Ping-pong effects;
Context transfer; State relocation; Handoff care-of address; Multicast;
Mobility neighbourhood; Routing neighbourhood; PDP roaming state;
Tentative mobility matrix",
ABSTRACT="Cellular communications are aligning rapidly to adopt suitable network
models for supporting packet switched services over IP networks. Pure
third generation (3G) wireless architectures have already adopted IP as
the network layer bearer within their core network component
specification. This article presents an architecture and protocol in
support of proactive mobility management for future IP radio access
networks. It encompasses a novel approach for seamless handoff and
proactive allocation of PDP context with respect to IP roaming state. The
latter establishes a generic substrate for proactive state relocation of
different context classes relating to the state of IP connectivity for a
mobile node (MN).
To address such form of IP mobility, the proposed model identifies a
tentative mobilityrouting matrix (TMM), which represents an accurate
mapping between a mobility neighbourhood vector (MNV), surrounding the
current GPRS-attachment point of an MN and the correct underlying routing
neighbourhood vector (RNV), over arbitrary routing topologies. Sustained
IP connectivity is achieved by introducing a 1-neighbour-lookahead (1-NL)
view of PDP roaming state derived from the established TMM component;
seamlessness is pursued through mapping of the 1-NL component to some
handoff care-of address onto the IP Multicast domain; this allows
abstracting a plurality of candidate care-of address instantiations of the
MN onto a single handoff routing identifier.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-48V7RSK-1-1N\&\_cdi=5624\&\_orig=browse\&\_coverDate=11\%2F01\%2F2003\&\_sk=999739982\&view=c\&wchp=dGLbVzz-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=5122e3e1a1a32ab39155cb2038db77bc\&ie=f.pdf"
}
@ARTICLE{Pall0302:Fluid,
AUTHOR="Esteve {Pallarés-Segarra} and Joan {García-Haro}",
TITLE="Fluid-flow approach to evaluate the information loss probability in a
finite buffering switching node under heterogeneous {ON/OFF} input traffic
sources",
JOURNAL="Performance Evaluation",
VOLUME=51,
NUMBER="2-4",
PAGES="153-169",
MONTH=feb,
YEAR=2003,
REFERENCES=13,
KEYWORDS="Performance evaluation; Heterogeneous ON/OFF sources; Fluid-flow model;
Approximating method; Network planning",
ABSTRACT="This paper proposes an approximation to evaluate the information loss
probability in a finite buffering switch by using a fluid-flow model with
heterogeneous ON/OFF input sources. The approach is based on the dominant
effect of the largest negative eigenvalue of the differential equation
system describing the buffer content. The proposed approximation notably
reduces the computational complexity involved and is useful in evaluating
the resources needed in a switched telecommunications network given a loss
probability requirement constraint.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-46WPNY4-2-5B\&\_cdi=5663\&\_orig=browse\&\_coverDate=02\%2F28\%2F2003\&\_sk=999489997\&view=c\&wchp=dGLbVzb-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=27165a29216febe4167c43fea28158e6\&ie=f.pdf"
}
@INPROCEEDINGS{Palo0305:Convex,
AUTHOR="Daniel Palomar and John Cioffi and Miguel Angel Lagunas and Antonio Pascual",
TITLE="Convex Optimization Theory Applied to Joint Beamforming Design in
Multicarrier {MIMO} Channels",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper addresses the joint design of transmit and receive beamvectors
for
a multicarrier MIMO channel within the general and powerful framework of
convex optimization theory. From this perspective, a great span of design
criteria can be easily accommodated and efficiently solved even though a
closed-form expression may not be available. Among other criteria, we
consider
the minimization of the average bit error rate (BER) and also of the
maximum
BER among all carriers for a given signal constellation. We show how to
include additional constraints to control the Peak-to-Average Ratio (PAR)
in
the system design."
}
@INPROCEEDINGS{Pan0303:Shrink,
AUTHOR="Rong Pan and Balaji Prabhakar and Konstantinos Psounis and Damon Wischik",
TITLE="SHRiNK: A method for scaleable performance prediction and efficient network
simulation",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="In networks and in web-server farms, it is useful to
collect performance measurements, to monitor the state
of the system, and to perform simulations. However,
the sheer volume of traffic in large high-speed network
systems makes it hard to monitor their performance or to
simulate them efficiently. And the heterogeneity of the
Internet means it is time-consuming and difficult to devise
the traffic models and analytic tools which would allow us
to work with summary statistics.
We explore a method to side-step these problems by combining
sampling, modeling and simulation. Our hypothesis is this:
if we take a sample of the input traffic, and feed it into
a suitably scaled version of the system, we can extrapolate
from the performance of the scaled system to that of the
original.
Our main findings are: When we scale an IP network
which is shared by TCP-like, UDP and web flows; and which
is controlled by a variety of active queue management schemes,
then performance measures such as queueing delay and drop
probability are left virtually unchanged. We show this in
theory and in simulations. This makes it possible to capture
the performance of large networks quite faithfully using
smaller scale replicas."
}
@INPROCEEDINGS{Pan0305:Mimo,
AUTHOR="Zhengang Pan and Kai Kit Wong and Tungsang Ng",
TITLE="{MIMO} Antenna System for Multi-User Multi-Stream Orthogonal Space Division
Multiplexing",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The use of multiple-input
multiple-output (MIMO) antennas for achieving diversity and/or
support of multi-stream signaling has recently been demonstrated
to gain lots of benefits including reduction in average error
probability and capacity enhancement. However, studies are limited
to a point-to-point communication. In this paper, we address the
optimization problem of enhancing the performance of a downlink
multi-user system (i.e., point-to-multipoint communication)
through joint use of multiple antennas at the base station (BS)
and mobile stations (MS). The optimization is performed by finding
the antenna weights at the BS and MS, jointly, to orthogonalize
the multi-user multi-stream signals as well as maximizing the
resultant channel gains of the diagonalized system for optimal
performance."
}
@INPROCEEDINGS{Pana0305:Em,
AUTHOR="Erdal Panayirci and Umit Aygolu and Ali Pusane",
TITLE="EM-Based Sequence Estimation for Wireless Systems with Orthogonal Transmit
Diversity",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, an optimum sequence estimation algorithm for wireless
systems with Alamouti's two transmitter diversity in the presence of
multipath fading is proposed. The algorithm is based on a jointly
iterative channel and sequence estimation according to the maximum
likelihood (ML) criterion, using the Expectation-Maximization (EM)
algorithm employing M-PSK modulation scheme with additive Gaussian noise.
The discrete multipath channel is represented in terms of the channel
gains from each transmit antenna to the receive antenna. EM algorithm
derived estimates jointly the complex channel parameters of each channel
and the data sequence transmitted, iteratively, which converges to the
true ML solution. The channel estimation is achieved in a simple way
through the iterative equations by decoupling of the signals transmitted
from different antennas. The algorithm is applied to the trellis coded
modulation systems and efficiency of the algorithm proposed has been shown
by the computer simulations. Simulation results show that the EM algorithm
converges quickly for fast fading channels. The performance of the
EM-based decoder approaches that of the ML receiver which has perfect
knowledge of the channel."
}
@INPROCEEDINGS{Pand0305:Optimum,
AUTHOR="Ashish Pandharipande and Soura Dasgupta",
TITLE="Optimum multiuser {OFDM} systems with unequal subchannel assignment",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper considers the design of multicarrier transceiver systems
like OFDM/DMT supporting multiple users.
The supported users may have differing
quality of service (QoS) requirements, quantified by their respective bit
rate and
symbol error rate specifications.
Different users on
the system can be potentially assigned
different number of subchannels, to reflect
their service priorities.
Our goal is to minimize the transmitted power given the QoS specifications
for the different users, subject to the knowledge of colored interference
at the receiver
input of the OFDM system. In particular
we find an optimum bit loading scheme that distributes the bit rate
transmitted across the
various subchannels belonging
to the different users, and subject to this bit allocation, determine an
optimum transceiver."
}
@ARTICLE{Papa0302:Implications,
AUTHOR="Stamatis Papayiannis and S. Hadjiefthymiades and L. Merakos",
TITLE="Implications of proactive datagram caching on {TCP} performance in
wireless/mobile communications",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=2,
PAGES="79-89",
MONTH=feb,
YEAR=2003,
REFERENCES=27,
KEYWORDS="TCP; Path Prediction Algorithm; Stochastic Datagram Relocation; Datagram
Caching",
ABSTRACT="The operation of TCP in wirelessmobile environments is discussed in this
paper. After briefly presenting previous efforts to ameliorate TCP
performance in the considered environments, we propose a new mechanism for
tackling the slow-down problems caused by handovers. Our mechanism is based
on stochastic datagram relocation. Traffic destined to the mobile terminal
is tunneled to and cached into adjacent cells according to the output of a
path prediction algorithm. To reduce the associated overhead, only
percentages of inbound traffic are copied to the cell's neighborhood on
the basis of estimated probabilities. The time scheduling for datagram
relocation is also taken into account. Simulations of the proposed
architecture show substantial performance improvements for TCP traffic.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-461XPFR-5-11\&\_cdi=5624\&\_orig=browse\&\_coverDate=02\%2F01\%2F2003\&\_sk=999739997\&view=c\&wchp=dGLbVlb-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=7486cd697fba89545650699ecb68941a\&ie=f.pdf"
}
@INPROCEEDINGS{Papa0303:Long,
AUTHOR="Konstantina Papagiannaki and Nina Taft and Zhi-Li Zhang and Christophe Diot",
TITLE="Long-Term Forecasting of Internet Backbone Traffic: Observations and
Initial Models",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We introduce a methodology
to predict {\em when and where} link additions/upgrades
have to take place in an IP backbone network. Using SNMP statistics,
collected continuously since 1999, we compute aggregate demand
between any two adjacent PoPs and look at its evolution at time scales
larger than one hour. We show that IP backbone traffic exhibits visible
long term
trends, strong periodicities, and variability at multiple time scales.
Our methodology relies on the wavelet multiresolution analysis and linear
time series models. Using wavelet multiresolution analysis, we smooth
the collected measurements until we identify the {\em overall long-term
trend}. The fluctuations around the obtained trend are further analyzed at
multiple time scales. We show that the largest amount of variability in
the
original signal is due to its {\em fluctuations at the 12 hour time
scale}.
We model inter-PoP aggregate demand as a multiple linear regression model,
consisting
of the two identified components. We show that this model accounts for
98\\% of the total
energy in the original signal, while explaining 90\\% of its variance.
Weekly approximations of those components can be accurately
modeled with low-order AutoRegressive Integrated Moving Average (ARIMA)
models.
We show that forecasting the long term trend and the fluctuations of the
traffic
at the 12 hour time scale yields accurate estimates for at least six
months in
the future."
}
@INPROCEEDINGS{Papa0305:Iterative,
AUTHOR="John Papandriopoulos and Jamie Evans and Subhrakanti Dey",
TITLE="Iterative Power Control and Multiuser Detection with Outage Probability
Constraints",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper proposes a new scheme coupling power control with a minimum
outage probability multiuser detector. The resultant iterative algorithm
is conceptually simple and finds the minimum sum transmission power of all
users with a set of outage probability constraints. Bounds on the outage
probability expression are found that extend a previous result that did
not include receiver noise. These bounds are used to create a sub-optimal
scheme coupling power control and a MMSE multiuser detector. This new
problem becomes a variant of an existing problem where outage probability
constraints are first mapped to average SIR threshold constraints.
Simulation results are presented showing the closeness of the two schemes
and speed of convergence."
}
@INPROCEEDINGS{Papa0305:Modeling,
AUTHOR="Symeon Papavassiliou and Sheng Xu",
TITLE="Modeling and Analysis of the Position-guided Sliding-Window Routing
Protocol",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The Position-Guided Sliding-Window Routing (PSR) protocol is a scalable
single-tier routing protocol designed for operation in mobile ad hoc
networking environments. In this paper, we provide an analytical model and
framework in order to study the various design issues and trade-offs of PSR
routing mechanism, discuss their impact on the protocol?s operation and
effectiveness, identify optimal values for critical design parameters
under different mobility scenarios, and finally provide guidelines to
optimize the protocol?s performance."
}
@ARTICLE{Papa0309:Performance,
AUTHOR="Georgios Papadimitriou and Georgios Pallas",
TITLE="Performance evaluation of a new multiaccess protocol for local area
networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=15,
PAGES="1800-1803",
MONTH=sep,
YEAR=2003,
REFERENCES=12,
KEYWORDS="Variable packet length; Broadcast communication systems; Bursty traffic;
Learning automata; Time-division multiple access; Idle timeslot",
ABSTRACT="A new self-adaptive protocol for broadcast networks, capable of operating
efficiently under bursty traffic conditions and allowing stations to
transmit packets of variable length, is introduced. Fixed-assignment
protocols such as TDMA have known drawbacks, which are resolved by
learning protocols such as LTDMA. However, the fact that LTDMA uses
fixed-sized timeslots can result in network equipment overloading as well
as wasted timeslots and reduced channel usage. The proposed Variable
Packet Length/LTDMA protocol is tested by using real LAN traffic traces
and it is proved that it successfully resolves the above issues and
achieves a high throughput-delay performance when operating under
realistic traffic conditions.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47YXW9F-1-N\&\_cdi=5624\&\_orig=browse\&\_coverDate=09\%2F22\%2F2003\&\_sk=999739984\&view=c\&wchp=dGLbVlz-zSkWW\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=d926fb1646594a82cb62153dea81ae9f\&ie=f.pdf"
}
@INPROCEEDINGS{Papp0303:Distributed,
AUTHOR="Prashanth Pappu and Jyoti Parwatikar and Jonathan Turner and Kenneth Wong",
TITLE="Distributed Queueing in Scalable High Performance Routers",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="AbstractThis paper presents and evaluates distributed queueing algorithms
for regulating the flow of traffic through large, high performance
routers. Distributed queueing has a similar objective to
crossbar-scheduling mechanisms used in routers with relatively small port
counts, and shares some common high level characteristics. However, the
need to minimize communication overhead rules out the iterative methods
that are typically used for crossbar scheduling, while the ability to
sub-divide the available bandwidth among different ports provides a degree
of freedom that is absent in the crossbar scheduling context, where inputs
must be matched to outputs. Our algorithms are based on four ideas (1)
backlog-proportional-allocation of output bandwidth, (2)
urgency-proportional-allocation of input bandwidth, (3) dynamic
reallocation of bandwidth and (4) deferred underflow. Our algorithms
guarantee congestion-free operation of the switch fabric. Our performance
results show that for uniform random traffic, even a very modest speedup
is sufficient to reduce the loss of output link bandwidth due to
sub-optimal rate allocation to negligible levels, and that even under
extreme conditions, a speedup of two is sufficient to eliminate such
bandwidth loss."
}
@INPROCEEDINGS{Park0303:Static,
AUTHOR="Seung-Taek Park and Alexy Khrabrov and David Pennock and Steve Lawrence and
C. Lee Giles and Lyle H. Ungar",
TITLE="Static and Dynamic Analysis of the Internet's Susceptibility to Faults and
Attacks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We analyze the susceptibility of the Internet to random faults,
malicious attacks, and mixtures of faults and attacks. We analyze
actual Internet data, as well as simulated data created with network
models. The network models generalize previous research, and allow
generation of graphs ranging from uniform to preferential, and from
static to dynamic. We introduce new metrics for analyzing the
connectivity and performance of networks which improve upon metrics
used in earlier research. Previous research has shown that
preferential networks like the Internet are more robust to random
failures compared to uniform networks. We find that preferential
networks, including the Internet, are more robust only when more than
95\% of failures are random faults, and robustness is measured with
the average diameter. The advantage of preferential networks
disappears with alternative metrics, and when a small fraction of
faults are attacks. We also identify dynamic characteristics of the
Internet which can be used to create improved network models, allowing
more accurate analysis for the future Internet, for example
facilitating the design of network protocols with optimal performance
in the future, or predicting future attack and fault tolerance. We
find that the Internet has been becoming more preferential as it
evolves. The average diameter has been stable or even decreasing as
the number of nodes has been increasing. The Internet has been
becoming more robust to random failures over time, but has also become
more vulnerable to attacks."
}
@ARTICLE{Park0307:Verifying,
AUTHOR="Jun-Cheol Park",
TITLE="Verifying liveness properties of multifunction composite protocols",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=12,
PAGES="1318-1329",
MONTH=jul,
YEAR=2003,
REFERENCES=27,
KEYWORDS="Communication protocols; Specification; Protocol composition; Liveness
properties; Verification",
ABSTRACT="In protocol composition techniques, component protocols are combined in
various ways to obtain a complex protocol whose execution sequences
consist of interleaved execution sequences of the component protocols. In
this paper, we investigate the problem of verifying liveness properties of
the composite protocol from the known properties of its components. We
first characterize a class of composite protocols that encompasses almost
every composite protocol appeared in the literature. For verifying
liveness properties of a composite protocol in the class, we then develop
a sufficient condition to ensure that certain liveness properties of the
component protocols carry over to the composite protocol. A verification
technique, based on this sufficient condition, is then used to determine
whether the liveness properties of the component protocols also hold for
the composite protocol. The technique is applicable to any transition
based protocol model as long as the model is susceptible to reachability
analysis for the sake of correctness proofs. To demonstrate the usefulness
of our technique, we apply it to a class of protocols that involves certain
synchronizing constraints. This work shows a promising integration of a
synthesis technique with an analytic method.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-484D1VB-1-KN\&\_cdi=5624\&\_orig=browse\&\_coverDate=07\%2F21\%2F2003\&\_sk=999739987\&view=c\&wchp=dGLbVlz-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=5a3c407b979df3fa36a84e163e8fd6cf\&ie=f.pdf"
}
@ARTICLE{Park0311:Timer,
AUTHOR="Jin Park and Young-Joo Suh",
TITLE="A timer-based mobile multicast routing protocol in mobile networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=17,
PAGES="1965-1974",
MONTH=nov,
YEAR=2003,
REFERENCES=21,
KEYWORDS="Timer-based; Mobile; Multicast; Routing; Protocol; Network",
ABSTRACT="Mobile computing and multimedia application are two emerging trends in
computer systems. Multicasting reduces the amount of multimedia traffics
by delivering a single stream of information to many recipients
simultaneously. Regarding mobile hosts, however, the naïve deployment
of existing multicast routing protocols is not a suitable because they
implicitly assume static hosts and do not consider the dynamic changes in
the location of group members. In this paper, we present a new efficient
mobile multicast routing protocol in terms of tree reconstruction
overhead, data delivery length, etc. The proposed protocol introduces FMA
(Foreign Multicast Agent) for mobile group membership; JOIN, GROUP timer
for mobile multicast routing . The periodic join operation by the two
timers makes it possible to utilize the characteristic that the mobile
multicasting has according to the speed of mobile hosts. Various
performance evaluation results illustrate that the proposed protocol shows
performance enhancements over existing protocols.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-48V7KCX-2-1K\&\_cdi=5624\&\_orig=browse\&\_coverDate=11\%2F01\%2F2003\&\_sk=999739982\&view=c\&wchp=dGLbVlb-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=e009c549b6445c4d60218cb8b5a0b7af\&ie=f.pdf"
}
@INPROCEEDINGS{Pasc0303:Target,
AUTHOR="Ioannis Paschalidis and Chang Su and Michael Caramanis",
TITLE="Target-Pursuing Policies for Open Multiclass Queueing Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We propose a new parametric class of scheduling and routing policies for
open multiclass queuing networks. We establish their stability and show
they are amenable to distributed implementation using localized state
information. We exploit our earlier work in Bertsimas, Paschalidis, and
Tsitsiklis, 1994, to select appropriate parameter values and outline how
optimal parameter values can be computed. We report numerical results
indicating that we obtain near-optimal policies (when the optimal can
be computed) and significantly outperform heuristic alternatives."
}
@INPROCEEDINGS{Pasc0305:Robust,
AUTHOR="Antonio Pascual and Miguel Angel Lagunas and Ana I. {Pérez-Neira}",
TITLE="Robust Power Allocation for Minimum {BER} in a {SISO-OFDM} System",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper we address the problem of the design of a power allocation
strategy for an Orthogonal Frequency Division Multiplexing (OFDM) system.
We assume no spatial diversity at the transmitter and receiver, that is, a
Single-Input-Single-Output (SISO) channel is considered. The goal is to
allocate all the available power at the transmitter among the different
carriers according to a minimum mean Bit Error Rate (BER) criterion. When
designing this strategy, we assume that Channel State Information (CSI) is
available at the transmitter. Two different approaches are taken. The first
one considers that the channel estimates are perfect, whereas the second
approach assumes that there is some estimation error, and therefore, this
approach is robust in nature. Finally, we propose an efficient algorithm
for computing the power allocated to the carriers for both approaches, and
show some simulation results in order to compare them."
}
@INPROCEEDINGS{Paso0305:Bluetooth,
AUTHOR="Gianni Pasolini",
TITLE="Bluetooth Piconets Coexistence: Analytical Investigation on the Optimal
Operating Conditions",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The increasing demand for low cost and efficient short range radio
communication tools led to the development of the Bluetooth
technology, which is aimed at replacing the wires used to connect
electronic devices.
It is foreseen that, in the next future, Bluetooth based services
will be provided in highly populated environments, such as
airports and convention centers. The expected explosive
penetration in the mass market of BT equipped devices operating in
an uncoordinated way, makes the issue of mutual interference a key
aspect to be investigated in order to assess the real performance
of this emerging technology.
In the paper herein, we address the coexistence issue by
analytically deriving a lower bound on the aggregated throughput
offered by BT based WPANs (wireless personal area networks)
deployed in the same region and by evaluating the optimum
operating conditions."
}
@INPROCEEDINGS{Patt0303:Modelling,
AUTHOR="Achille Pattavina and Gino L. Tesei",
TITLE="Modelling the Blocking Behavior of Multicast Clos Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="This paper considers three-stage switching networks able to support
multicast traffic, i.e. connections in which one inlet is connected to
more than one output at the same time. The nonblocking conditions for this
network are studied under the assumption of absence of any optimized
routing of the connections inside the structure (the so-called
strict-sense nonblocking networks). An analytical model is developed here
that provides not only the nonblocking conditions of three-stage multicast
networks, but also the evaluation of the blocking probability when such
conditions are not satisfied. Unlike previous well-known
approaches, our model takes into account the correlation between occupancy
events in links belonging to different interstage patterns. The results
being found also provide a more stringent condition of network nonblocking
for multicast traffic which disproves some of
the claimed results recently published in the technical literature."
}
@INPROCEEDINGS{Paus0305:Intelligent,
AUTHOR="Marco Pausini and Alessandro {La Piana} and Claudio Armani and Sergio Cioci
and Marco Moretti",
TITLE="Intelligent Algorithms for User Allocation and Partial-Adaptive Beamforming
in {WCDMA} Uplink",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper presents a new uplink beamforming technique applied to the WCDMA
system, here called partial-adaptive beamforming. Instead of concentrating
upon the performance of every single user, the radiation pattern aims to
maximize the performance of a group of users and only a limited number of
beams has to be formed. We present two algorithms that group effectively
the users (grouping algorithm) and shape the radiation pattern (shaping
algorithm) in order to enhance the performance of all the users being part
of the same group.
The uplink performance of fixed beam antenna array in a base station
sector of 120° is compared with the combined action of the two proposed
algorithms. Simulation results indicate that the latter solution could
offer an increased capacity and an enlarged coverage. Furthermore the
algorithms exhibit a convergence speed suitable to implement them in order
to follow the dynamic evolution of the traffic within the sector."
}
@ARTICLE{Pave0303:Homer,
AUTHOR="Nikola Pavesic and Jerneja Gros and Simon Dobrisek and France Mihelic",
TITLE="Homer IImanmachine interface to internet for blind and visually impaired
people",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=5,
PAGES="438-443",
MONTH=mar,
YEAR=2003,
REFERENCES=17,
KEYWORDS="Internet interface; Blind and visually impaired users; Text-to-speech;
Speech recognition; Dialogue management",
ABSTRACT="HOMER II is a voice-driven text-to-speech system developed for blind or
visually impaired persons for reading Slovenian texts. Users can obtain
texts from the Internet site of the Association of Slovenian Blind and
Visually Impaired Persons Societies from their Electronic Information
System where they can find daily newspapers, some novels and other
information. The system consists of four main modules. The first module
enables Internet communication, retrieves text to a local disc and
converts it to a standard form. The input interface manages the keyboard
entry and/or speaker independent speech recognition. The output interface
performs speech synthesis of a given text and in addition prints the same
text magnified to the screen. The user dialog is responsible for the user
friendly communication and controls other tasks of the system. Homer II
was ported from Linux to the MS Windows 9x/ME/NT/2000 operating systems.
For the best performance it uses multi-threading and other advantages of
the 32-bit environment. Further versions of the HOMER system with even
more advanced dialogue modules and some basic World Wide Web browsing
functionality will represent an important tool in the distance learning
and teaching process for the impaired persons using academic networks.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-46RDF5H-6-H\&\_cdi=5624\&\_orig=browse\&\_coverDate=03\%2F20\%2F2003\&\_sk=999739994\&view=c\&wchp=dGLbVtz-zSkWW\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=e386f15c1a28ec5aa764b5d96474b2b2\&ie=f.pdf"
}
@INPROCEEDINGS{Peac0305:Asymptotic,
AUTHOR="Matthew Peacock and Iain Collings and Michael Honig",
TITLE="Asymptotic {SINR} Analysis of Multi-User {MC-CDMA} in Rayleigh Fading",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper we derive asymptotic performance measures for multiuser
receivers in multi-carrier CDMA communication systems. We consider both
single-code-per-user and multi-code cases. Specifically, we derive the
Asymptotic average SINR and BER at the output of a multiuser LMMSE
receiver. Simulation studies demonstrate that the asymptotic results
closely predict performance of practical finite systems."
}
@INPROCEEDINGS{Peac0305:Mutual,
AUTHOR="Matthew Peacock and Iain Collings",
TITLE="Mutual Information Analysis of Turbo Equalizers for Fixed and Fading
Channels",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper considers performance and design issues for Turbo Equalizers.
Analytic expressions are derived for the mutual information convergence
point of the turbo equalizer. The BER is then found analytically. Results
are obtained for both fixed and fading channels, and in conditions of both
perfect channel state information as well as unknown estimated channels.
Finally, we introduce design rules for adaptive turbo equalizers based on
our analysis. The rules give optimal combinations of pilot rate and code
puncturing, for a range of fading and SNR conditions."
}
@INPROCEEDINGS{Pear0305:Optimising,
AUTHOR="David Pearce and David Grace",
TITLE="Optimising the Downlink Capacity of Broadband Fixed Wireless Access Systems
for Packet-Based Communications",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper considers the problem of optimising the downlink capacity of
broadband fixed wireless access systems in two representative scenarios: a
non-line-of-sight terrestrial system, and a system operating from a high
altitude platform. In each case a packet-based system is considered, with
the delay through the system of constant-length packets taken as the metric
to evaluate the effectiveness of the resource allocation schemes
considered. The joint optimisation of adaptive modulation, channel
selection scheme and queueing strategies is a complex multidimensional
problem and a simulation approach is taken to evaluate the trade-offs. It
is shown that good performance can be obtained from a simple resource
allocation scheme over a wide range of different operating conditions,
that consideration of queueing strategy is important to minimising packet
delay through the systems, and that the capacity of a broadband system
using a high-altitude platform can be over three times as great as a
terrestrial system of the same bandwidth."
}
@INPROCEEDINGS{Peel0305:Capacity,
AUTHOR="Christian Peel and Lee Swindlehurst",
TITLE="Capacity-Optimal Training for Space-Time Modulation over a Time-Varying
Channel",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Using a model based on the time-autocorrelation function for
time-varying MIMO channels, we find a lower bound on capacity for
trained modulation, and find the training signal, training power,
and length of training signal which maximize this bound. An
approximation for the training frequency which maximizes the bound
at high SNR is given for Jakes' fading model. The capacity for
differential unitary space-time modulation is discussed and compared
with that for trained modulation. We present several numerical
examples to illustrate our results."
}
@INPROCEEDINGS{Peel0305:Pairwise,
AUTHOR="Christian Peel and Lee Swindlehurst",
TITLE="Pairwise Probability of Error for Differential Space-Time Modulation over a
Time-Varying Rician Channel",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The pairwise probability of error for differential unitary
space-time modulation for channels with a constant specular
component and time-varying diffuse fading is derived in this paper.
We consider the case where the channel varies from sample to sample
within a symbol according to a first-order Gauss-innovations model.
Our previous results are reviewed which show that the effect of the
time-varying diffuse channel can be described by an effective SNR
that decreases with time. We derive pairwise probability of error
expressions using these effective SNR values, which are shown by
simulation to accurately describe performance."
}
@ARTICLE{Peki0306:Automatic,
AUTHOR="Barry Pekilis and Rudolph Seviora",
TITLE="Automatic response performance monitoring for real-time software with
nondeterministic behaviors",
JOURNAL="Performance Evaluation",
VOLUME=53,
NUMBER=1,
PAGES="1-21",
MONTH=jun,
YEAR=2003,
REFERENCES=34,
KEYWORDS="Response performance; Response time monitoring; Real-time software
specification",
ABSTRACT="We describe a monitoring approach for evaluation of the response
performance of services delivered by real-time software systems. Our
approach handles certain specification nondeterminism in the behavioral
requirements of these systems and is capable of concurrently measuring
state-dependent response time intervals. We detect impairments to service
performance as response performance failures, i.e., those system response
time intervals that statistically exceed some specified maximum delay.
While monitoring of behavioral correctness may require a full
specification model to detect behavioral failures, our approach detects
response time and response performance failures using a reduced
timepost-model (TPM). We consider those targets whose: (1) behavior is
specified using communicating extended finite state machines; (2) response
time objectives are tabular in format. We present an algorithm for deriving
an interpretable TPM from these software requirements. We report and
comment on an experimental evaluation of the TPM derivation algorithm and
the robustness of the approach in the presence of behavioral failures. The
target in the evaluation was the call processing program for a small
telephone switch.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-481FV37-3-24\&\_cdi=5663\&\_orig=browse\&\_coverDate=06\%2F30\%2F2003\&\_sk=999469998\&view=c\&wchp=dGLbVlz-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=dce9f40ca5b7b95791a3a281908e03f3\&ie=f.pdf"
}
@INPROCEEDINGS{Peng0305:Protection,
AUTHOR="Tao Peng",
TITLE="Protection from Distributed Denial of Service Attack Using History-based
{IP} Filtering",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we introduce a practical scheme to defend against
Distributed Denial of Service (DDoS) attacks based on IP source
address filtering. The edge router keeps a history of all the
legitimate IP addresses which have previously appeared in the
network. When the edge router is overloaded, this history is used
to decide whether to admit an incoming IP packet. Unlike other
proposals to defend against DDoS attacks, our scheme works well
during highly-distributed DDoS attacks, i.e., from a large number
of sources. We present several heuristic methods to make the IP
address database accurate and robust, and we present experimental
results that demonstrate the effectiveness of our scheme in
defending against highly-distributed DDoS attacks."
}
@INPROCEEDINGS{Pere0303:Delay,
AUTHOR="Eugene Perevalov and Rick Blum",
TITLE="Delay Limited Capacity of Ad hoc Networks: Asymptotically Optimal
Transmission and Relaying Strategy",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="The delay limited capacity of an ad hoc wireless network confined
to a finite region is investigated. A transmission and relaying
strategy making use of the nodes' motion to maximize the
throughput is constructed. An approximate expression for the
capacity as a function of the maximum allowable delay is obtained.
It is found that there exists a critical value of the delay such
that: (1) for values of the delay $d$ below critical, the capacity
does not benefit appreciably from the motion, (2) for moderate
values of the delay d above critical, the capacity that can be
achieved by taking advantage of the motion increases as d^{2/3},
(3) the dependence of the critical delay on the number of nodes is
a very slowly increasing function (n^{1/14}) . Finally,
asymptotic optimality of the proposed strategy in a certain class
is shown."
}
@INPROCEEDINGS{Pere0305:Performance,
AUTHOR="Xavier Perez-Costa",
TITLE="A Performance Study of Hierarchical Mobile IPv6 from a System Perspective",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We performed a simulative evaluation of standard Mobile IPv6 in comparison
with
Hierarchical MIPv6 via ns-2 for a
`hot spot deployment' scenario. The simulation scenario comprises four
access
routers and up to 30 mobile nodes that move randomly and communicate
in accordance with the IEEE 802.11 wireless LAN standard.
The study collected the performance metrics of all mobile nodes from the
system.
As data traffic video, VoIP and TCP sources were considered.
The goal of the study was to obtain quantitative results
of the improvements provided by HMIPv6 with respect to handoff latency,
packet loss,
signaling load and bandwidth per station as well as an indication of the
number of users
that could be accommodated depending on the traffic source.
Moreover, we performed a 'stress-test' of the protocol to investigate
the behavior of the protocol in extreme cases, e.g. under channel
saturation conditions.
In addition to the quantitative results provided, the simulations
taught us insights on the protocol performance
not easily gained without performing simulations.
E.g., we learned that i)in our scenario a low HMIPv6 signaling load
reduction outside of the
micro-mobility domain implies a significant increase within it,
ii) under high saturation
conditions we can expect a better performance of HMIPv6 in latency terms
but not in packet losses
or bandwidth and iii) the consideration of network coverage user
unawareness impacts the
performance results."
}
@INPROCEEDINGS{Pete0305:Performance,
AUTHOR="Niklas Andgart and Albin Johansson and Per Odling and Per Ola {Börjesson}",
TITLE="A Performance Bound on PSD-constrained {PAR} Reduction",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Communication systems using multicarrier modulation suffer from a high
Peak-to-Average Ratio, PAR. In this work we use the tone reservation
approach to PAR reduction, where a subset of the tones are used for PAR
reduction instead.
We derive a bound on the achievable performance under a PSD constraint on
the transmit signal. Using this bound, we show that
as long as a moderate reduction performance is needed, this could be
achieved with an almost arbitrary selection of the PAR reduction tones.
This bounding technique also demonstrates that, applied to an ADSL-like
system, the tone reservation approach could be used for PAR reduction down
to about 12 dB, considering critically sampled signals."
}
@TECHREPORT{Petr0311:Improving,
AUTHOR="Milenko Petrovic and Mokhtar Aboelaze",
TITLE="Improving {TCP/IP} Performance over Wireless {IEEE} {802.11} Link",
TYPE="arXiv",
NUMBER="cs.NI/0311035",
MONTH=nov,
YEAR=2003,
KEYWORDS="Networking and Internet Architecture; Performance; 802.11; TCP; UDP",
ABSTRACT="Cellular phones, wireless laptops, personal portable devices that supports
both voice and data access are all examples of communicating devices that
uses
wireless communication. Sine TCP/IP (and UDP) is the dominant technology
in use
in the internet, it is expected that they will be used (and they are
currently)
over wireless connections. In this paper, we investigate the performance
of the
TCP (and UDP) over IEEE802.11 wireless MAC protocol. We investigate the
performance of the TCP and UDP assuming three different traffic patterns.
First
bulk transmission where the main concern is the throughput. Second
real-time
audio (using UDP) in the existence of bulk TCP transmission where the main
concern is the packet loss for audio traffic. Finally web traffic where
the
main concern is the response time. We also investigate the effect of using
forward Error Correction (FEC) technique and the MAC sublayer parameters
on the
throughput and response time.",
URL="http://arxiv.org/abs/cs/0311035"
}
@TECHREPORT{Petr0311:Performance,
AUTHOR="Milenko Petrovic and Mokhtar Aboelaze",
TITLE="Performance of {TCP/UDP} under Ad Hoc {IEEE802.11}",
TYPE="arXiv report",
NUMBER="cs.NI/0311049",
MONTH=nov,
YEAR=2003,
KEYWORDS="wireless; TCP; UDP; 802.11",
ABSTRACT="TCP is the De facto standard for connection oriented transport layer
protocol, while UDP is the De facto standard for transport layer protocol,
which is used with real time traffic for audio and video. Although there
have
been many attempts to measure and analyze the performance of the TCP
protocol
in wireless networks, very few research was done on the UDP or the
interaction
between TCP and UDP traffic over the wireless link. In this paper, we tudy
the
performance of TCP and UDP over IEEE802.11 ad hoc network. We used two
topologies, a string and a mesh topology. Our work indicates that
IEEE802.11 as
a ad-hoc network is not very suitable for bulk transfer using TCP. It also
indicates that it is much better for real-time audio. Although one has to
be
careful here since real-time audio does require much less bandwidth than
the
wireless link bandwidth. Careful and detailed studies are needed to
further
clarify that issue.",
URL="http://arxiv.org/abs/cs/0311049"
}
@INPROCEEDINGS{Pezo0305:Performance,
AUTHOR="Lambros Pezoulas and Mark Joseph Francisco and Ioannis Lambadaris and
Changcheng Huang",
TITLE="Performance Analysis of a Backward Reservation Protocol In Networks with
Sparse Wavelength Conversion",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In sparse wavelength conversion networks only a few nodes support
wavelength conversion. The optical paths in the network consist of a group
of segments where each segment independently must meet the wavelength
continuity constraint when setting up light-paths across them. In this
paper, we propose a distributed control algorithm called First Available
that can efficiently be used to assign wavelengths in networks with sparse
wavelength conversion. The wavelength reservation protocol described is a
backward reservation protocol. In previous research it has been found that
backward reservation algorithms do not offer much improvement in the case
where optical converters are used. First Available was compared to other
backward reservation algorithms such as First-Fit and Random and was shown
to outperform those in the case of sparse wavelength conversion. Also,
compared to the case of no conversion in the network the use of the
First-Available algorithm in combination with using converters gives a
lower average blocking probability. In previous papers, we have outlined a
method called OBGP to support light-path setup and management. We have used
OBGP to implement and simulate the First-Available algorithm in OPNET.
From our simulation results we also collected nodal statistics, and based
on these we studied where should be the optimal placement of the
converters using the First Available algorithm."
}
@INPROCEEDINGS{Pfei0302:Commercial,
AUTHOR="Tom Pfeifer and Dirk Elias",
TITLE="Commercial Hybrid {IR/RF} Local Positioning System",
BOOKTITLE="KiVS 2003, Kommunikation in Verteilten Systemen",
ADDRESS="Leipzig, Germany",
MONTH=feb,
YEAR=2003,
REFERENCES=18,
KEYWORDS="active badge; IR; RF; location services; Location-Awareness; Local
Positioning System; Infrared; RF; Mobility, Smart IP devices, Distributed
Objects",
ABSTRACT="Location-aware applications for supporting the mobile user require
reliable information about their position and the environment. Based on a
critical
review of solutions so far, a very cost effective solution of a local
positioning
system (LPS) is introduced for the need of positioning indoors as well as
on a
constrained outdoor campus with dynamic granularity. The simple and
costeffective
hybrid IR/RF (Infrared / Radio Frequency) technology fits into a suite
of distributed Smart IP devices within a scalable and flexible
architecture. It enables
applications like in-house navigation, user centric home \& building
automation,
or dynamic access control systems.",
URL="http://www.fokus.fhg.de/research/cc/cats/employees/tom.pfeifer/publish/kivs2003final-intern.pdf"
}
@INPROCEEDINGS{Pham0303:Performance,
AUTHOR="Peter Pham",
TITLE="Performance Analysis of Reactive Shortest Single-path and Multi-path
Routing Mechanism With Load Balance",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Research on multi-path routing protocols to provide improved
throughput and route resilience as compared with single-path
routing has been explored in details in the context of wired
networks. However, multi-path routing mechanism has not been
explored thoroughly in the domain of ad hoc networks. In this
paper, we analyze and compare reactive single-path and multi-path
routing with load balance mechanisms in ad hoc networks, in terms
of overhead, traffic distribution and connection throughput. The
results reveals that in comparison with general single-path
routing protocol, multi-path routing mechanism creates more
overheads but provides better performance in congestion and
capacity provided that the route length is within a certain upper
bound which is derivable. The analytical results are further
confirmed by simulation."
}
@INPROCEEDINGS{Pham0305:New,
AUTHOR="Huan Pham",
TITLE="A New Scalable, Hybrid Approach for {IP} Traffic Engineering without Full
Mesh Overlaying",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper introduces a new Hybrid Routing Method (HRM) for IP network
traffic engineering. In this method, the traffic from some
source/destination pairs is routed via MPLS constraint-based routing,
while the remaining traffic is routed via conventional IGP routing. The
method has been used to implement a HRM traffic engineering tool. The tool
enables network operators to visualize and manage traffic to avoid
congestion, as well as to decide where to place MPLS tunnels. Simulation
results indicate that our HRM normally needs just a small number of
tunnels to achieve a network performance that is comparable to that of
fully meshed MPLS model."
}
@ARTICLE{Phan0307:Addressing,
AUTHOR="Kaustubh Phanse and Luiz DaSilva",
TITLE="Addressing the requirements of QoS management for wireless ad hoc networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=12,
PAGES="1263-1273",
MONTH=jul,
YEAR=2003,
REFERENCES=65,
KEYWORDS="Network management; Quality of service; Policy-based networking; Ad hoc
networks",
ABSTRACT="Quality of Service (QoS) provisioning and management in ad hoc networks
remains a challenging task. Existing research focuses either on providing
QoS or on network management, in ad hoc networks. However, a comprehensive
approach to QoS management in ad hoc networks, i.e. network management in
support of service differentiation, QoS robustness, and network
survivability is still lacking. In this paper, we survey the existing
literature on ad hoc network management from a QoS perspective. We
identify policy-based management as a promising approach for QoS
provisioning and management in ad hoc networks, and describe the
components that we believe are crucial for effective functioning of such a
policy-based framework. Our initial experimental results in assessing
signaling overhead and response time for network management in ad hoc
networks support the choice of a hybrid policy architecture that combines
outsourcing and provisioning policy distribution models.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47C94T0-3-C\&\_cdi=5624\&\_orig=browse\&\_coverDate=07\%2F21\%2F2003\&\_sk=999739987\&view=c\&wchp=dGLbVzb-zSkWW\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=c34785e5e047793fd2ff4e0d1cccad87\&ie=f.pdf"
}
@INPROCEEDINGS{Pias0302:Lighthouses,
AUTHOR="Marcelo Pias and Jon Crowcroft and Steve Wilbur and Saleem Bhatti and Tim
Harris",
TITLE="Lighthouses for Scalable Distributed Location",
BOOKTITLE="International Workshop on Peer-to-Peer Systems (IPTPS)",
PUBLISHER="Springer-Verlag",
ADDRESS="Berkeley, CA",
MONTH=feb,
YEAR=2003,
REFERENCES=18,
KEYWORDS="Peer-to-peer; network proximity; vector space; coordinate system; ad-hoc
network; network location; scalability",
ABSTRACT="This paper introduces Lighthouse, a scalable location mechanism for
wide-area networks. Unlike existing vector-based systems such as GNP, we
show how network-location can be established without using a
fixed set of reference points. This lets us avoid the communication
bottlenecks and single-points-of-failure that otherwise limit the
practicality of such systems.",
URL="http://www.cs.ucl.ac.uk/staff/m.pias/reports\_ucl\_phd/lighthouse-final.ps"
}
@INPROCEEDINGS{Piec0305:Joint,
AUTHOR="Robert Piechocki and Andrew Nix and Joe McGeehan",
TITLE="Joint Semi-blind Detection and Channel Estimation in Space-Frequency
Trellis Coded {MIMO-OFDM}",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper considers an OFDM system with a Multiple-Input Multiple-Output
(MIMO) configuration, which uses Space-Frequency Trellis Coding (SFTC). A
novel method of decoding SFTC without a need to transmit separate training
sequences is developed. The technique uses only a single frequency tone to
acquire a complete set of the channels' estimates while performing SFTC
detection. The method is akin to blind trellis search techniques
(per-survivor processing - PSP) and adaptive Viterbi. Our solution
consists of the deployment of a bank of Kalman Filters. The bank of Kalman
Filters is coupled with Viterbi type decoders, which produce tentative
decisions based on Kalman channel predictions. In return, the Kalman
filters use the tentative decisions to update and track the MIMO channels
corresponding to a number of tracked hypotheses."
}
@INPROCEEDINGS{Pilo0303:Understanding,
AUTHOR="Saar Pilosof and Ramachandran Ramjee and Danny Raz and Yuval Shavitt and
Prasun Sinha",
TITLE="Understanding {TCP} fairness over Wireless {LAN}",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="As local area wireless networks based on the IEEE 802.11 standard see
increasing public deployment, it is important to ensure that access to
the network by different users remains fair. While fairness issues in
802.11 networks have been studied before, this paper is the first to
focus on TCP fairness in 802.11 networks in the presence of both
mobile senders and receivers. In this paper, we evaluate extensively
through analysis, simulation, and experimentation the interaction
between the 802.11 MAC protocol and TCP. We identify four different
regions of TCP unfairness that depend on the buffer availability at
the base station, with some regions exhibiting significant unfairness
of over 10 in terms of throughput ratio between upstream and
downstream TCP flows. We also propose a simple solution that can be
implemented at the base station above the MAC layer that ensures that
different TCP flows share the 802.11 bandwidth equitably irrespective
of the buffer availability at the base station."
}
@INPROCEEDINGS{Ping0305:Simple,
AUTHOR="Li Ping and Keying Wu and Wai Kong Leung",
TITLE="A Simple Approach to Near-Optimal Multiple Transmit Antenna Space-Time
Codes",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper presents a family of space-time codes using an interleaver-based
technique to separate signals from different antennas. The proposed scheme
is applicable to any transmit antenna number. Significant performance
improvement has been observed compared with existing schemes. An iterative
detection algorithm is derived. The complexity involved is very low, and
increases only linearly with the transmit antenna number. The proposed
scheme is also applicable to inter symbol interference channels."
}
@ARTICLE{Piss0305:Mobile,
AUTHOR="Niki Pissinou and Kia Makki and Birgitta {König-Ries}",
TITLE="Mobile users in heterogeneous environments with middleware platform",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=7,
PAGES="700-707",
MONTH=may,
YEAR=2003,
REFERENCES=29,
KEYWORDS="Mobile computing; Middleware platform; Heterogeneous environments",
ABSTRACT="Mobile computing is becoming more and more pervasive, liberating users from
the confines of wired networks. At the same time, transparent access to
heterogeneous, distributed information sources has become a reality in
wired computing. Obviously, this kind of access is highly desirable for
mobile users, too. However, current architectures for transparent
information access do not take the specific needs of mobile users into
account, while existing architectures for mobile computing do not support
transparent access well. For the future growth of the usage of mobile
computing it is of utmost importance that instead of individually
developed, isolated extensions to the existing architectures, the research
community agrees on a strong, standardized middleware platform extending
both existing mobile architectures and existing information access
architectures to ensure mobile access in heterogeneous environments. In
this paper we propose such a platform.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-472BCJC-1-5\&\_cdi=5624\&\_orig=browse\&\_coverDate=05\%2F01\%2F2003\&\_sk=999739992\&view=c\&wchp=dGLbVzb-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=b309cb5acd4f7ee8ee9796087479afeb\&ie=f.pdf"
}
@INPROCEEDINGS{Plat0305:Jitter,
AUTHOR="Glenn Platt and Jamil Khan",
TITLE="Jitter Compensation on the Downlink of Future Mobile Multimedia
Communications",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Not only is the amount of packet traffic carried on mobile communications
networks growing, it is also anticipated that such communications networks
will eventually use packet- based backbone and core networks. Considering
this, characteristics of packet (IP) traffic such as delay jitter will be
of growing significance to the performance of these mobile communications
systems. Not only will such characteristics affect the quality of service
these systems can provide, they will also affect the performance of the
multiple access aspect of the mobile networks, influencing system
capacity, utilization and delay profiles. We present a jitter compensation
technique that is designed to cope with the delay jitter introduced when a
mobile communications system is connected to a fixed IP-based network. The
jitter compensation technique is designed to improve system performance
when under the influence of delay jitter, whilst also respecting the
quality of service requirements of the traffic to be carried. We review
the prior work in jitter compensation for fixed networks, and investigate
which techniques are appropriate for compensating delay jitter at the
multiple access component of mobile networks. We present one such jitter
compensation technique, and detail a simulation model and associated
results used to study the performance of this technique."
}
@INPROCEEDINGS{Poll0305:Antenna,
AUTHOR="Tony Pollock and Thushara Abhayapala and Rodney Kennedy",
TITLE="Antenna Saturation Effects on {MIMO} Capacity",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="A theoretically derived antenna saturation point is shown to exist for MIMO
systems, at which the system suffers a capacity growth decrease from linear
to logarithmic with increasing antenna numbers. We show this saturation
point increases linearly with the radius of the region containing the
receiver antennas and is independent of the number of antennas. Using an
alternative formulation of capacity for MIMO systems we derive a closed
form capacity expression which uses the physics of signal propagation
combined with statistics of the scattering environment. This expression
gives the capacity of a MIMO system in terms of antenna placement and
scattering environment and shows that the saturation effect is due to
spatial correlation between receiver antennas."
}
@INPROCEEDINGS{Poon0305:Indoor,
AUTHOR="Ada S Y Poon and Minnie Ho",
TITLE="Indoor Multiple-Antenna Channel Characterization from 2 to 8 GHz",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In multiple-antenna channels, the optimality of a transmission scheme
hinges on a detailed characterization of the channel. In this paper, we
will present measurement results from 2 to 8 GHz in both LOS and NLOS
scenarios, at both office and residential environments. Data processing
methods are briefly outlined and a statistical characterization of the
channel is presented as well."
}
@ARTICLE{Poon0309:First,
AUTHOR="W.-c. Poon and K.-t. Lo and J. Feng",
TITLE="First segment partition for video-on-demand broadcasting protocols",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=14,
PAGES="1698-1708",
MONTH=sep,
YEAR=2003,
REFERENCES=25,
KEYWORDS="VoD service; Client buffer; Protocols",
ABSTRACT="Broadcasting is an efficient transmission scheme to provide on-demand
service for very popular movies in a multicast environment. In this paper,
a comparative study is first performed to evaluate various broadcasting
protocols in terms of maximum waiting time, client buffer requirement and
receiver bandwidth. It is found that some existing broadcasting schemes
are not practical to provide a small delay video-on-demand (VoD) service
if the client buffer size is not large enough. It is shown that the
staggered [1] and skyscraper [3] protocols are the only feasible solutions
to support an insensitive delay VoD system with limited client buffer and
receiver bandwidth. Two first segment partition schemes are then proposed
to further reduce the maximum waiting time of these two broadcasting
schemes. The results show that if 15 min of video data can be stored in
the buffer, Skyscraper with our proposed schemes can serve the customers
within 10 s using 16 video channels. For Staggered broadcasting with our
schemes, the maximum waiting time can also be reduced from 7.5 min to less
than 1 min.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47C94T0-2-2B\&\_cdi=5624\&\_orig=browse\&\_coverDate=09\%2F01\%2F2003\&\_sk=999739985\&view=c\&wchp=dGLbVzz-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=71553d1980a37ea4a0d7d481947c516b\&ie=f.pdf"
}
@ARTICLE{Pope0301:Service,
AUTHOR="Radu Popescu-Zeletin and Stefan Abranowski and Ioannis Fikouras and
Giovanni Gasbarrone and Martin Gebler and Sanneck Henning and Herma {van
Kranenburg} and Hans Portschy",
TITLE="Service architectures for the wireless world",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=1,
PAGES="19-25",
MONTH=jan,
YEAR=2003,
REFERENCES=4,
NOTE="Kimmo Raatikainen is also an author of this article.",
KEYWORDS="Wireless World; Business Models; I-Centric Communication; Service
Architecture; 3GB",
ABSTRACT="In the last years, a variety of concepts for service integration and
corresponding systems have gained momentum. On one hand, they aim at the
inter-working and integration of classical telecommunications and data
communications services. On the other hand, they are focusing on universal
service access from a variety of end user systems. All these systems are
driven by the concept of providing several technologies to users by
keeping the peculiarity of each service. From the service point of view,
the participants of WWRF Working Group 2 (Wireless World Research Forum:
http://www.wireless-world-research.org/) believe that the service
architectures of the Wireless World will be based on service
personalization, service integration, and IP-based reachability. The paper
presents the rationales the framework and the architecture proposed by
WWRF-WG2 based on numerous contributions (WWRF: Book of Visions (2001))
from research and industry world wide.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-461XPFR-6-F\&\_cdi=5624\&\_orig=browse\&\_coverDate=01\%2F01\%2F2003\&\_sk=999739998\&view=c\&wchp=dGLbVlz-zSkzk\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=71a52d3f2960ed3d4b0d80b3d3041490\&ie=f.pdf"
}
@INPROCEEDINGS{Porr0305:Uhf,
AUTHOR="Dana Porrat",
TITLE="{UHF} Propagation in Indoor Hallway",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="A new model for UHF propagation in large buildings is presented. This model
relies on knowledge of the interior arrangement of the building without
requiring much detail. The guiding of radiation along hallways is the most
significant propagation process at distances of more than 10~m from the
transmitter. The waveguide model predicts the power loss rate along the
hallways, which is affected by the coupling among the propagating modes.
The coupling results from the roughness of the surfaces in the building;
it is predicted in an average manner using the average deviation of the
walls from perfect smoothness."
}
@ARTICLE{Port0307:Cost,
AUTHOR="Marius Portmann and Aruna Seneviratne",
TITLE="Cost-effective broadcast for fully decentralized peer-to-peer networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=11,
PAGES="1159-1167",
MONTH=jul,
YEAR=2003,
REFERENCES=12,
KEYWORDS="Peer-to-peer networks; Broadcast; Rumor mongering",
ABSTRACT="Fully unstructured and decentralized peer-to-peer networks such as Gnutella
are appealing for a variety of applications, among which file-sharing is
the most prominent one. The decentralized nature of these systems provides
a high degree of robustness and the ability to cope with a highly dynamic
and transient network environment. However, the lack of centralized
directory nodes makes the task of searching more expensive and difficult.
In completely unstructured peer-to-peer networks, searching can only be
realized via application-layer broadcast, where query messages are routed
to every node in the network. Gnutella implements application-layer
broadcast by using flooding as the underlying message routing mechanism.
Flooding creates a large amount of traffic and can quickly exhaust the
resources of nodes in a large network. In this paper, we explore Rumor
mongering (also known as Gossip) as a more cost-effective and scalable
alternative to flooding for implementing services such as searching in
decentralized peer-to-peer networks. We further present a new variant of
the Rumor mongering protocol, which exploits the power-law characteristics
of typical peer-to-peer networks and achieves a significant further
reduction in cost.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-478YXBY-3-Y\&\_cdi=5624\&\_orig=browse\&\_coverDate=07\%2F01\%2F2003\&\_sk=999739988\&view=c\&wchp=dGLbVzz-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=e8d4b37e7ba8215c1d6ae083f78502ae\&ie=f.pdf"
}
@INPROCEEDINGS{Pote0305:Tunable,
AUTHOR="Jan Potemans and Bart {Van den Broeck} and Johan Theunis and Pieter Leys
and Emmanuel {Van Lil} and Antoine {Van de Capelle}",
TITLE="A Tunable Discrete Traffic Generator based on a Hierarchical Scheme of
Bernoulli Sources",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper we present an efficient method for the generation of a
discrete series of traffic. The method is based on a superposition of
hierarchical Bernoulli sources and generates non-Gaussian distributions.
This way, self-similar traffic can be generated with an arbitrary
combination of the Hurst parameter, the variance and the mean. The method
is fully parameterized before generating the trace, which avoids the need
for post-processing. Contrary to other methods, the method also allows to
calculate the trace point by point. The described hierarchical scheme
offers a generic framework for fitting the variance-time behavior and can
be combined with other stochastic sources."
}
@INPROCEEDINGS{Prad0305:Link,
AUTHOR="Javier {del Prado Pavon} and Sunghyun Choi",
TITLE="Link Adaptation Strategy for {IEEE} {802.11} {WLAN} via Received Signal
Strength Measurement",
BOOKTITLE="International Conference on Communications",
ADDRESS="Anchorage, Alaska",
MONTH=may,
YEAR=2003,
ABSTRACT="IEEE 802.11 Wireless Local Area Network (WLAN) physical layers (PHYs)
support multiple data transmission rates. The data rate to be used for a
particular frame transmission is solely determined by the transmitting
station. The transmission rate should be chosen in an adaptive manner
since the wireless channel condition varies over time due to such factors
as station mobility, time-varying interference, and location-dependent
errors. In this paper, we present a novel link adaptation algorithm, which
aims to improve the system throughput by adapting the transmission rate to
the current link condition. Our algorithm is simply based on the received
signal strength measured from the received frames, and hence it does not
require any change in the current IEEE 802.11 WLAN Medium Access Control
(MAC) protocol. Based on the simulation and its comparison with a
numerical analysis, it is shown that the proposed algorithm closely
approximates the ideal case with the perfect knowledge about the channel
and receiver conditions."
}
@INPROCEEDINGS{Prad0309:Multimedia,
AUTHOR="Javier {del Prado Pavon} and Saishankar Nandagopalan and Sunghyun Choi",
TITLE="Multimedia Clock Synchronization over {IEEE} {802.11} {WLAN}",
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="In this paper, we propose an efficient multimedia synchronization algorithm
for IEEE 802.11 Wireless Local Area Networks (WLAN) and mobile multimedia
systems. We discuss the novel algorithm and provide its formal proof and
correctness. The goal is to achieve synchronization of wireless multimedia
systems with an accuracy in the order of 100 ns. This level of accuracy is
required to enable professional quality audio and video applications over
wireless. Note that the 802.11 Time Synchronization Function defined in
IEEE 802.11 Standard provides an accuracy of ±2 µs. The proposed
algorithm can be adopted with a very few changes of the current 802.11
Medium Access Control (MAC) without modifying the core MAC functions. The
mechanism described in this paper has been already adopted by the IEEE
802.11
working group (WG) in the current IEEE 802.11e D5.0. This mechanism has
been also adopted by the IEEE 1394 wireless working group (WWG) to
synchronize Wireless 1394 nodes connected via 802.11e WLAN."
}
@INPROCEEDINGS{Pras0303:Effect,
AUTHOR="Ravi Prasad and Constantinos Dovrolis and Bruce Mah",
TITLE="The effect of layer-2 store-and-forward devices on per-hop capacity
estimation",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Tools such as pathchar, clink, and pchar attempt to measure
the capacity of every Layer-3 (L3) hop in a network path.
These tools use the same underlying measurement methodology,
which we refer to as Variable Packet Size (VPS) probing.
The key assumption in VPS is that each L3 hop along a path
increases the delay of a packet by a ``serialization latency'',
which is the ratio of the packet size over that hop's capacity.
Unfortunately, the capacity estimates of VPS tools are sometimes wrong.
In this paper, we investigate the source of these errors, and show that
the presence of Layer-2 (L2) store-and-forward devices, such as
Ethernet switches, have a detrimental effect on the accuracy of VPS tools.
Specifically, each L2 store-and-forward device introduces an additional
serialization latency in a packet's delay,
which results in consistent underestimation of that L3 hop's capacity.
We analyze this negative effect, deriving the measured capacity of an L3
hop
as a function of the L2 link capacities at that hop.
Experimental results in local, campus, and ISP networks verify the model,
illustrating that L2 devices should be expected in networks of diverse
type and size.
Finally, we characterize some other sources of error in VPS tools,
such as queueing delays, limited clock resolution, variation in ICMP
generation delays,
and error propagation along the measured path.
Methods keywords: network measurements, experimentation"
}
@ARTICLE{Prek0307:Activities,
AUTHOR="Paul Prekop and Mark Burnett",
TITLE="Activities, context and ubiquitous computing",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=11,
PAGES="1168-1176",
MONTH=jul,
YEAR=2003,
REFERENCES=38,
KEYWORDS="Activity-centric context; Context; Context-awareness; Smart rooms;
Ubiquitous computing",
ABSTRACT="Context and context-awareness provides computing environments with the
ability to usefully adapt the services or information they provide. It is
the ability to implicitly sense and automatically derive the user needs
that separates context-aware applications from traditionally designed
applications, and this makes them more attentive, responsive, and aware of
their user's identity, and their user's environment. This paper argues that
context-aware applications capable of supporting complex, cognitive
activities can be built from a model of context called Activity-Centric
context. A conceptual model of Activity-Centric context is presented. The
model is illustrated via a detailed example.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-479VG0H-2-K\&\_cdi=5624\&\_orig=browse\&\_coverDate=07\%2F01\%2F2003\&\_sk=999739988\&view=c\&wchp=dGLbVzz-zSkWW\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=c35946bc956bdca5f28822b721437cd5\&ie=f.pdf"
}
@ARTICLE{Prih0309:Adaptive,
AUTHOR="F. Prihandoko and M. Habaebi and Borhanuddin Ali",
TITLE="Adaptive call admission control for QoS provisioning in multimedia wireless
networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=14,
PAGES="1560-1569",
MONTH=sep,
YEAR=2003,
REFERENCES=15,
KEYWORDS="Quality of service; Wireless networks; Call admission control; Reservation;
Mobile networks",
ABSTRACT="In this paper, we propose a new framework called adaptive quality of
service (AdQoS) to guarantee the quality of service (QoS) of multimedia
traffic generally classified as real-time and non-real-time. AdQos
supports future generation wireless networks because it implements a
traffic-based admission control, bandwidth reallocation and reservation
schemes to support the different multimedia traffic. The objectives that
AdQoS framework tries to accomplish are minimum new call blocking and
handoff dropping rates. The key feature of this framework is the bandwidth
reallocation scheme. This scheme is developed to control the bandwidth
operation of ongoing connections when the system is overloaded. The
performance of the system is evaluated through simulations of a realistic
cellular environment. Simulation results show that our proposed scheme
reduces the new call blocking probabilities, the handoff dropping
probabilities and reduces significantly the probability of terminated
calls while still maintaining efficient bandwidth utilization compared to
conventional schemes proposed in the literature.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47G3GX2-1-Y\&\_cdi=5624\&\_orig=browse\&\_coverDate=09\%2F01\%2F2003\&\_sk=999739985\&view=c\&wchp=dGLbVzz-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=a4e7483130e7ce5fef5534152afb4b78\&ie=f.pdf"
}
@INPROCEEDINGS{Pucc0309:Overcoming,
AUTHOR="Marc Pucci and Allen McIntosh and James Alberi and Thomas Raleigh",
TITLE="Overcoming Precision Limitations in Adaptive Bandwidth 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="Available-bandwidth measurements determine the amount of spare capacity
across a network connection without requiring access to intervening
network elements, hence their value in supporting multi-provider
service-level agreements and isolating network bottlenecks. However,
examination of the various forms of available-bandwidth measurements
currently being developed reveals areas for improvement in the way these
metrics are measured. To obtain accurate results, existing measurement
methodologies require precision in both the generation and capture of
carefully structured sequences of packets. The Internet Monitoring
Platform (IMP), described herein, addresses these concerns and expedites
our comparisons of various available-bandwidth measurement techniques.
IMP leverages operating system and hardware improvements, and incorporates
a generalized form of packet sequencing that facilitates new measurement
techniques."
}
@INPROCEEDINGS{Purs0305:Decoding,
AUTHOR="Michael Pursley and Jason Skinner",
TITLE="Decoding Strategies for Turbo Product Codes in Frequency-HopWireless
Communications",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Alternative decoding methods are described and evaluated for use with a
commercial turbo product code chip that is employed for error control in
slow-frequency-hop spread-spectrum wireless communications. Parallel
decoding strategies are applied, and the resulting performance is examined
for packet transmission over channels with partial-band interference. When
coupled with the development and use of side information in the
frequency-hop receiver, parallel decoding greatly enhances the performance
of turbo product codes and makes them competitive with
parallel-concatenated turbo convolutional codes."
}
@INPROCEEDINGS{Qin0303:Exploiting,
AUTHOR="Xiangping Qin and Randall Berry",
TITLE="Exploiting Multiuser Diversity for Medium Access Control in Wireless
Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Multiuser diversity refers to a type
of diversity present across different users in a fading environment.
This diversity can be exploited by scheduling transmissions
so that users transmit when their channel conditions are favorable.
Using such an approach leads to a system capacity that increases
with the number of users. However, such scheduling requires
centralized control. In this paper,
we consider a decentralized medium access control (MAC) protocol, where
each user only has
knowledge of its own channel gain. We consider a variation
of the ALOHA protocol, channel-aware ALOHA; using this protocol we
show that users can still exploit multi-user diversity
gains. First we consider a backlogged model, where each user always has
packets to send. In this case we show that the the total system
throughput increases at the same rate as in a system with a
centralized scheduler. Asymptotically, the fraction of throughput
lost due to the random access protocol is shown to be $1/e$.
We also consider a splitting algorithm, where the splitting sequence
depends on the users' channel gains; this algorithm is shown to
approach the throughput of an optimal centralized scheme.
Next we consider a system with an infinite user population and random
arrivals. In this case, it is proved that a variation of
channel-aware ALOHA is stable for any total arrival rate in a
memoryless channel, given that users can estimate the backlog.
Extensions for channels with memory are also discussed."
}
@INPROCEEDINGS{Qin0305:Efficient,
AUTHOR="Zheng Qin and Mohan Gurusamy",
TITLE="An Efficient Dynamic Protection Scheme in Integrated {IP/WDM} Networks",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper presents an efficient protection scheme to dynamically allocate
restorable bandwidth-guaranteed paths in integrated IP-over-WDM networks.
A {\em restorable bandwidth-guaranteed path} implies an active path and
another link-disjoint backup path both with required bandwidth. Dynamic
traffic where connection requests arrive one by one with no knowledge
about future requests is assumed. In this paper, we consider integrated
IP/WDM networks with {\em generalized multi-protocol label switching}
(GMPLS) capabilities. To optimize the network resources, we do the
protection at the {\em multi-protocol label switching} (MPLS) layer and
backup resources are judiciously shared among different requests at the
{\em label switched path} (LSP) level. To allocate the restorable
bandwidth-guaranteed paths, we propose two integrated routing algorithms:
{\em hop-based integrated routing algorithm} (HIRA) and {\em
bandwidth-based integrated routing algorithm} (BIRA). We use {\em
connection blocking probability} and number of {\em
optical-electrical-optical} (o-e-o) conversions as performance metrics to
evaluate these two algorithms. Through extensive experiments, we
demonstrate that our algorithms perform better in terms of the two metrics
above than other existing approaches."
}
@INPROCEEDINGS{Qiu0303:Bandwidth,
AUTHOR="Ying Qiu and Peter Marbach",
TITLE="Bandwidth Allocation in Wireless Ad Hoc Networks: A Price-Based Approach",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We consider pricing as a means to stimulate cooperation in a wireless ad
hoc network: users can charge other users a price for relaying their data
packets. Assuming that users set prices to maximize their own total
utility, we propose an iterative price and rate adaption algorithm. We
show that this
algorithm converges to a socially optimal bandwidth allocation.
We use a numerical case study to illustrate our results.
Method Keywords: Control theory, Mathematical programming/optimization,
Economics"
}
@INPROCEEDINGS{Quan0305:Priority,
AUTHOR="Zhi Quan and Jong-Moon Chung",
TITLE="Priority Queueing Analysis of Self-Similar Traffic in High-Speed Networks",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Differentiated services (DiffServ) networking technologies are
under development with the objective to support diverse classes of
traffic that require different quality of service (QoS)
guarantees. Recent studies have shown that real network traffic
exhibits self-similarity or long-range dependence (LRD) in
high-speed communication networks, which has a deteriorating
impact on the network performance. To assist the development of
admission control mechanisms which can accommodate heterogeneous
traffic including short-range independence and long-range
dependence, this paper proposes a measurement-based approach to
estimate the buffer overflow probability for each priority queue
in a multiplexer deploying the head-of-the-line (HOL) priority
discipline. The accuracy and effectiveness of this model has been
verified by simulations. The results of this paper will provide a
practical insight into the buffer dimensioning and admission
control design of a HOL multiplexer."
}
@ARTICLE{Quin0306:Assigning,
AUTHOR="Alejandro Quintero and Samuel Pierre",
TITLE="Assigning cells to switches in cellular mobile networks: a comparative
study",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=9,
PAGES="950-960",
MONTH=jun,
YEAR=2003,
REFERENCES=36,
KEYWORDS="Cellular networks; Cell assignment; Optimization; Heuristics; Genetic
algorithms; Tabu search; Simulated annealing",
ABSTRACT="Assigning cells to switches in cellular mobile networks is an NP-hard
problem which, for realsize mobile networks, could not be solved by using
exact methods. In this context, heuristic approaches like genetic
algorithms, tabu search and simulated annealing can be used. This paper
proposes a comparative study of three heuristicstabu search, simulated
annealing and Parallel Genetic Algorithms with Migrations (PGAM)used to
solve this problem. The implementation of these algorithms have been
tested in order to measure the quality of solutions. The results obtained
confirm the efficiency of the seheuristics to provide good solutions for
medium- and large-sized cellular mobile networks, in comparison with the
sequential genetic algorithm (SGA) and with other heuristic methods well
known in the literature. The evaluation cost provided by tabu search,
simulated annealing and PGAM are very similar. Those three algorithms
provide better results than standard genetic algorithm and always find
feasible solutions. In terms of CPU times, tabu search is the fastest
method. Finally, the results have been compared with a lower bound on the
global optimum; they confirm the effectiveness of the tabu search,
simulated annealing and PGAM to solve this problem.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47HRBHH-1-2C\&\_cdi=5624\&\_orig=browse\&\_coverDate=06\%2F02\%2F2003\&\_sk=999739990\&view=c\&wchp=dGLbVlb-zSkzS\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=15a94e3a11c033ae62bcb7ed57885bcf\&ie=f.pdf"
}
@ARTICLE{Quin0306:Evolutionary,
AUTHOR="Alejandro Quintero and Samuel Pierre",
TITLE="Evolutionary approach to optimize the assignment of cells to switches in
personal communication networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=9,
PAGES="927-938",
MONTH=jun,
YEAR=2003,
REFERENCES=37,
KEYWORDS="Cellular networks; Cell assignment; Memetic algorithms; Genetic algorithms;
Tabu search; Simulated annealing; Migration; Multi-population algorithm",
ABSTRACT="This paper proposes an evolutionary approach to solve the problem of
assigning cells to switches in the planning phase of mobile cellular
networks. Well-known in the literature as an NP-hard combinatorial
optimization problem, this problem requires the recourse to heuristic
methods, which can practically lead to good feasible solutions, not
necessarily optimal, the objective being rather to reduce the convergence
time toward these solutions. Computational results obtained from extensive
tests confirm the effectiveness of this approach to provide good solutions
to problems of a certain size. This approach can be used to solve NP-hard
problems, like designing and planning, in the next generation networking
systems.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47GJ52M-2-22\&\_cdi=5624\&\_orig=browse\&\_coverDate=06\%2F02\%2F2003\&\_sk=999739990\&view=c\&wchp=dGLbVlb-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=a00e1d74d961347aceabe922766c0c4b\&ie=f.pdf"
}
@ARTICLE{Rach0304:Performance,
AUTHOR="Gopal Racherla and Sridhar Radhakrishnan and Chandra Sekharan",
TITLE="Performance evaluation of wireless {TCP} with rerouting in mobile networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=6,
PAGES="542-551",
MONTH=apr,
YEAR=2003,
REFERENCES=29,
KEYWORDS="Mobile; Rerouting; Transmission control protocol; Wireless",
ABSTRACT="We study the performance of two different classes of wireless Transmission
Control Protocol (TCP) schemesthe split connection TCP and the snoop
protocol TCP under four rerouting schemesfull rerouting, partial
rerouting, cell forwarding and virtual tree rerouting. The wireless TCP
schemes are compared based on the source throughput, average round trip
delay and cumulative source disruption time. We analyze the performance of
these wireless TCP schemes and their interaction with rerouting.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-46C0JT5-1-13\&\_cdi=5624\&\_orig=browse\&\_coverDate=04\%2F15\%2F2003\&\_sk=999739993\&view=c\&wchp=dGLbVzb-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=a97d5f635b32529e6647bc99bc92e3f0\&ie=f.pdf"
}
@INPROCEEDINGS{Radi0310:Tutorial,
AUTHOR="Markus Radimirsch",
TITLE="Tutorial: Game theory and its application in wireless communications",
BOOKTITLE="Vehicular Technology Conference Fall 2003",
ADDRESS="Orlando, Florida",
DAYS=4,
MONTH=oct,
YEAR=2003,
ABSTRACT="Game theory provides mathematical means to deal with situations where two
or more actors compete for a limited resource. This is a common situation
in wireless communications, where frequency is always scarce and therefore
needs to be reused as often as possible.
The tutorial shall give an introduction to the terms and methods of game
theory. It will then present some applications of game theory in wireless
communications, e.g. of transmit power control for CDMA-based data
networks and of combined link adaptation and power control for wireless
LANs.
Duration shall be full day (could be reduced to a half day tutorial)"
}
@INPROCEEDINGS{Ragh0305:Deterministic,
AUTHOR="Balaji Raghothaman",
TITLE="Deterministic Perturbation Gradient Approximation for Transmission Subspace
Tracking in {FDD-CDMA}",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Multiple antenna transmission promises to bring substantial
capacity benefits to wireless communication systems. Knowledge of
the channel can be used to further improve the communication. In
frequency division duplex channels, such knowledge can be obtained
using feedback. The feedback bandwidth is limited, hence efficient
feedback of such channel information to the transmitter is
required. This paper proposes one such method based on subspace
tracking principles. A perturbation approach based on a
deterministic set of perturbation vectors is used to approximate
the gradient of the cost function. Simulation results show good
performance improvement over other feedback techniques."
}
@INPROCEEDINGS{Ragh0305:Mimo,
AUTHOR="Vasanthan Raghavan and Akbar Sayeed",
TITLE="{MIMO} Capacity Scaling and Saturation in Correlated Environments",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The capacity of MIMO systems under ideal (i.i.d.) channel conditions has
been shown to increase linearly with the number of antennas. Capacity
scaling is observed in a correlated channel environment as well but the
constant of scaling is shown in [7] to be less than that of the i.i.d.
scaling factor. Using a channel representation motivated by physical
scattering considerations, the virtual channel representation, we show
this effect does occur provided the number of effective scattering paths
keeps asymptotically increasing with the increase in the number of
antennas. Otherwise we show that saturation of capacity occurs. Using
random banded matrix theory results, we also show that the effect of
correlation is to reduce the effective received SNR according to the
degree of correlation. This also yields a closed form expression for the
asymptotic capacity of correlated MIMO channels."
}
@ARTICLE{Ragh0307:Dynamic,
AUTHOR="Prabhakar Raghavan and Hadas Shachnai and Mira Yaniv",
TITLE="Dynamic schemes for speculative execution of code",
JOURNAL="Performance Evaluation",
VOLUME=53,
NUMBER=2,
PAGES="125-142",
MONTH=jul,
YEAR=2003,
REFERENCES=10,
KEYWORDS="processors; Speculative execution; Branch prediction; On-line algorithms",
ABSTRACT="Speculative execution of code is becoming a key technique for enhancing the
performance of pipeline processors. In this work we study schemes that
predict the execution path of a program based on the history of branch
executions. Building on previous work, we present a model for analyzing
the effective speedup from pipelining, when speculative execution is
employed. We follow this with stochastic analyses of several schemes for
speculative execution.
A main result of our study is that if we can predict branch resolution
with high probability (as in the Pentium Pro processor, e.g.) the Single
Path scheme commonly used on modern processors is within factor of 2 from
the optimal. We conclude with simulations covering several of the settings
that we study.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-481MYH2-3-7J\&\_cdi=5663\&\_orig=browse\&\_coverDate=07\%2F31\%2F2003\&\_sk=999469997\&view=c\&wchp=dGLbVtz-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=25ea9032e16d7e1e9107cab610c976ea\&ie=f.pdf"
}
@INPROCEEDINGS{Raje0305:Rake,
AUTHOR="Arjunan Rajeswaran and Srinivasa Somayazulu and Jeffrey Foerster",
TITLE="Rake Performance for a Pulse Based {UWB} System in a Realistic {UWB} Indoor
Channel Model",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The performance of a RAKE receiver for a pulse based ultra-wideband (UWB)
communications system is studied in a realistic channel model that is
based on an extensive set of indoor channel measurements. The RAKE
receiver is shown to contribute to a mitigation of the ISI. In
particular, at low input SNR values and small number of RAKE taps, it is
shown that employing additional RAKE taps for energy capture is more
important to overall system performance than employing equalization to
combat the ISI. The performance of the RAKE with some realistic channel
estimation errors is also studied."
}
@INPROCEEDINGS{Rajv0303:Analysis,
AUTHOR="Prashant Rajvaidya and Kevin Almeroth",
TITLE="Analysis of Routing Characteristics in the Multicast Infrastructure",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="As the multicast-capable part of the Internet continues to evolve,
important questions to ask are whether the protocols are operating
correctly, the topology is well connected, and the routes are stable.
A critical step in being able to answer these questions is to monitor
the traffic and network operation. In this paper, we analyze
characteristics of the multicast infrastructure over the last three
years using monitoring data collected from several key routers.
Specifically, we focus on analyzing two characteristics of the
infrastructure: size and stability. The size analysis
focuses on counting the number of connected hosts and networks, and
analyzing how the size of the infrastructure has changed over past
three years. Second, the stability analysis focuses on
examining persistence, prevalence, and visibility
of routes across the topology. From our analyses, we identify a
number of problems with multicast routing and their effect on the
connectivity of certain multicast networks. Moreover, we offer insight
into the evolution and future of multicast in the Internet."
}
@INPROCEEDINGS{Rama0303:Limiting,
AUTHOR="Ramu Ramamurthy and Jean-Francois Labourdette and Ahmet Akyamaç and Sid
Chaudhuri",
TITLE="Limiting Sharing on Protection Channels in Mesh Optical Networks",
BOOKTITLE="Optical Fiber Communications (OFC)",
MONTH=mar,
YEAR=2003,
KEYWORDS="mesh network; lightpath",
ABSTRACT="We examine two approaches in shared mesh restoration
to limiting the number of lightpaths protected
by a shared-channel. The goal is to prevent
shared-channels from protecting a large number
of lightpaths without significantly increasing protection
capacity.",
URL="http://www-ee.engr.ccny.cuny.edu/www/web/ellinas/protectionCappingOFC03.pdf"
}
@INPROCEEDINGS{Rama0303:Load,
AUTHOR="Bhaskaran Raman and Randy H. Katz",
TITLE="Load Balancing and Stability Issues in Algorithms for Service Composition",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Service composition enables flexible
creation of new services by assembling
independent service components. We are
focused on the scenario where such
composition takes place across the
wide-area Internet. We envision
independent providers deploying and
managing service instances and portal
providers composing them to quickly
enable new applications in
next-generation networks.
One of the important goals in such
service composition is load balancing
across service instances. While load
balancing has been studied extensively
for web-server selection, the presence
of composition presents new challenges.
First, each client session involving
composition requires a set of service
instances and not just one server.
Second, unlike web-mirror selection, we
also concern ourselves with load
balancing in the presence of failure
recovery during a client session. We
introduce (a) a metric to choose the set
of service instances for composed client
sessions: the
least-inverse-available-capacity (LIAC)
metric, as well as (b) a piggybacking
mechanism to give quick feedback about
server load. We then introduce an
additional factor in the load balancing
metric to avoid choosing far away
service instances. Our experiments,
based on an emulation testbed, show that
our load balancing mechanism works well
under a variety of scenarios including
network path failures.
Methods: System design, Simulations"
}
@INPROCEEDINGS{Rama0303:Pre,
AUTHOR="Ramu Ramamurthy and Ahmet Akyamac and Jean-Francois Labourdette and Sid
Chaudhuri",
TITLE="Pre-Emptive Reprovisioning in Mesh Optical Networks",
BOOKTITLE="Optical Fiber Communications (OFC)",
MONTH=mar,
YEAR=2003,
KEYWORDS="optical network; mesh network; reprovisioning",
ABSTRACT="Pre-emptive reprovisioning is a method to perform reprovisioning of a
backup path in advance of a second failure, to reduce the time to recover
service from seconds (reprovisioning) to milliseconds (restoration). We
evaluate the tradeoff between benefits and operational complexity.",
URL="http://www-ee.engr.ccny.cuny.edu/www/web/ellinas/premptReprovisioningOFC03.pdf"
}
@INPROCEEDINGS{Rama0303:Time,
AUTHOR="Jeyashankher Ramamirtham and Jonathan Turner",
TITLE="Time Sliced Optical Burst Switching",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Time-Sliced Optical Burst Switching is a proposed variant of optical
burst switching, in which switching is done in the time domain, rather
than the wavelength domain. This eliminates the need for wavelength
converters, the largest single cost component of systems, which switch
in the wavelength domain. We examine some of the key design issues for
routers that implement time-sliced optical packet switching. In
particular, we focus on the design of the Optical Time Slot
Interchangers (OTSI) needed to effect the required time domain
switching. We introduce a novel nonblocking OTSI design and also show
how blocking OTSIs can be used to implement the required switching
operations. We study the performance of systems using blocking OTSIs
and demonstrate that near ideal statistical multiplexing performance
can be achieved using even quite inexpensive, blocking OTSI designs.
These results provide what is arguably the first convincing evidence
that optical switching systems may be able to provide a cost-effective
alternative to electronic packet switches."
}
@ARTICLE{Rama0304:Survivable,
AUTHOR="Ramu Ramamurthy and Laxman Sahasrabudhe and Biswanath Mukherjee",
TITLE="Survivable {WDM} mesh networks",
JOURNAL="IEEE Journal of Lightwave Technology",
VOLUME=21,
NUMBER=4,
PAGES="870-883",
MONTH=apr,
YEAR=2003,
ABSTRACT="In a wavelength-division-multiplexing (WDM) optical network, the failure of
network elements (e.g., fiber links and cross connects) may cause the
failure of several optical channels, thereby leading to large data losses.
This study examines different approaches to protect a mesh-based WDM
optical network from such failures. These approaches are based on two
survivability paradigms: 1) path protection/restoration and 2) link
protection/restoration. The study examines the wavelength capacity
requirements, and routing and wavelength assignment of primary and backup
paths for path and link protection and proposes distributed protocols for
path and link restoration. The study also examines the
protection-switching time and the restoration time for each of these
schemes, and the susceptibility of these schemes to multiple link
failures. The numerical results obtained for a representative network
topology with random traffic demands demonstrate that there is a tradeoff
between the capacity utilization and the susceptibility to multiple link
failures. We find that, on one hand, path protection provides significant
capacity savings over link protection, and shared protection provides
significant savings over dedicated protection; while on the other hand,
path protection is more susceptible to multiple link failures than link
protection, and shared protection is more susceptible to multiple link
failures than dedicated protection. We formulate a model of
protection-switching times for the different protection schemes based on a
fully distributed control network. We propose distributed control protocols
for path and link restoration. Numerical results obtained by simulating
these protocols indicate that, for a representative network topology, path
restoration has a better restoration efficiency than link restoration, and
link restoration has a faster restoration time compared with path
restoration."
}
@ARTICLE{Rama0309:Architecture,
AUTHOR="Bhaskaran Raman and Randy Katz",
TITLE="An architecture for highly available wide-area service composition",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=15,
PAGES="1727-1740",
MONTH=sep,
YEAR=2003,
REFERENCES=22,
KEYWORDS="Service composition; Service cluster; Overlay networks; Failure detection;
Session recovery; Network emulation",
ABSTRACT="Service composition provides a flexible way to quickly enable new
application functionalities in next generation networks. We focus on the
scenario where next generation portal providers compose the component
services of other providers. We have developed an architecture based on an
overlay network of service clusters to provide failure-resilient
composition of services across the wide-area Internet: our algorithms
detect and recover quickly from failures in composed client sessions.
In this paper, we present an evaluation of our architecture whose
overarching goal is quick recovery of client sessions. The evaluation of
an Internet-scale system like ours is challenging. Simulations do not
capture true workload conditions and Internet-wide deployments are often
infeasible. We have developed an emulation platform for our evaluationone
that allows a realistic and controlled design study. Our experiments show
that the control overhead involved in implementing our recovery mechanism
is minimal in terms of network as well as processor resources; minimal
additional provisioning is required for this. Failure recovery can be
effected using alternate service replicas within about 1 s after failure
detection on Internet paths. We collect trace data to show that failure
detection itself can be tight on wide-area Internet pathswithin about 1.8
s. Failure detection and recovery within these time bounds represents a
significant improvement over existing Internet path recovery mechanisms
that take several tens of seconds to a few minutes.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-481FWJ7-3-Y\&\_cdi=5624\&\_orig=browse\&\_coverDate=09\%2F22\%2F2003\&\_sk=999739984\&view=c\&wchp=dGLbVtz-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=412c084d2c260981055ac1e7d56bbcd0\&ie=f.pdf"
}
@ARTICLE{Rama0309:Context,
AUTHOR="T. Ramalingom and K. Thulasiraman and A. Das",
TITLE="Context independent unique state identification sequences for testing
communication protocols modelled as extended finite state machines",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=14,
PAGES="1622-1633",
MONTH=sep,
YEAR=2003,
REFERENCES=29,
KEYWORDS="Communication protocol testing; Test case generation; Extended finite state
machine model; State identification sequences; Software testing;
Verification; Validation",
ABSTRACT="A number of test sequence generation methods proposed for communication
protocols represented as Extended Finite State Machines (EFSMs) use state
identification sequences for checking the states. However, neither a
formal definition nor a method of computation of these sequences for an
EFSM state is known. In this paper, we first define a new type of state
identification sequence, called Context Independent Unique Sequence (CIUS)
and present an algorithm for computing it. To demonstrate the usefulness of
these sequences, we then briefly describe a unified method based on CIUSs
for automatically generating executable test cases for both control flow
and data flow aspects of an EFSM. In control flow testing, CIUSs are very
useful in confirming the tail states of the transitions. In data flow
testing, CIUSs improve the observability of the test cases for the def-use
associations of different variables used in the EFSM. Unlike general state
identification sequences, the use of CIUSs does not increase the
complexity of the already intractable feasibility testing problem in test
case generation. Moreover, the feasibility problem encountered in both the
CIUS computation and the test case generation methods is amenable to an
incremental solution. We demonstrate this by presenting a method to solve
a particular case of this problem in which the variables are of only
integer, real or Boolean type and the predicates are linear.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-48J4M43-1-BP\&\_cdi=5624\&\_orig=browse\&\_coverDate=09\%2F01\%2F2003\&\_sk=999739985\&view=c\&wchp=dGLbVlb-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=759717d2911c3ea3c24169cf3f72a313\&ie=f.pdf"
}
@INPROCEEDINGS{Rame0305:Performance,
AUTHOR="Annavajjala Ramesh and A. Chockalingam and Laurence Milstein",
TITLE="Performance Analysis of Generalized Selection Combining of M-ary {NCFSK}
Signals in Rayleigh Fading Channels",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we propose and analyze the bit error performance
of a generalized selection combining (GSC) receiver for M-ary
noncoherent frequency shift keying (NCFSK) signals on i.i.d.
Rayleigh fading channels with L antennas at the receiver.
For each of the M hypotheses, the receiver combines the K
largest outputs among the L available square-law detector
outputs before proceeding to the bit detection process. We
derive a closed-form expression for the bit error probability
of the proposed (K,L) GSC receiver, and present numerical
results to illustrate the bit error performance of this
receiver for different values of M, K, and L. We also
show that our generalized (K,L) GSC scheme and analysis
encompass the previously reported schemes/analyses by
Chyi et al and Hahn as special cases for K=1 and
K=L, respectively."
}
@INPROCEEDINGS{Rams0305:Shuffling,
AUTHOR="Stefan Ramseier",
TITLE="Shuffling Bits in Time and Frequency An Optimum Interleaver for {OFDM}",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper describes a novel combination of OFDM with a standard
convolutional code and an interleaver optimized for channels with
narrowband and impulsive noise. The optimum interleaver efficiently
separates error bursts that occur in the time and in the frequency domain.
It can be characterized as a generalized block interleaver whose operation
can be described intuitively. This design was implemented successfully in
a medium voltage powerline carrier communication system."
}
@INPROCEEDINGS{Rand0305:Integrating,
AUTHOR="Tejinder Randhawa and Louise Lamont and Stephen Hardy",
TITLE="Integrating WLANs \& MANETs to the IPv6 based Internet",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper presents a novel approach to integrate WLANs (Wireless Local
Area Networks) and MANETs (Mobile Ad-hoc Networks) to the IPv6 (Internet
Protocol version 6) based Internet. In the proposed network architecture,
the mobiles, connected as a MANET, employ the OLSR (Optimized Link State
Routing) protocol for routing within the MANET. Gateways are used to
connect MANETs to the Internet. Automatic mode-detection and switching
capability is introduced in each mobile node to facilitate handoffs
between WLANs and MANETs. Mobility management across WLANs and MANETs is
achieved through Mobile IPv6.
A real test-bed is constructed to demonstrate the viability of the
proposed approach. Results from a performance evaluation on this test-bed
are presented. Efficiency of handoffs between WLANs and MANETs is measured
in terms of delay and packet loss. The impact of OLSR based route
discovery and packet propagation, and IPv6 features such as neighbor
discovery and address auto-configuration on the handoff latency and packet
loss are quantified. These performance benchmarks and metrics provide an
assessment of the impact of the aforementioned system features on the QoS
parameters associated with handoffs.
This is, to our knowledge, the first proposal to exploit the salient
features of Mobile IPv6 as well as OLSR in a collective fashion."
}
@ARTICLE{Rang0304:Performance,
AUTHOR="Mohan Ranganathan and Liam Kilmartin",
TITLE="Performance analysis of secure session initiation protocol based VoIP
networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=6,
PAGES="552-565",
MONTH=apr,
YEAR=2003,
REFERENCES=27,
KEYWORDS="Voice over internet protocol; Security; IP Security; Security protocol
performance analysis",
ABSTRACT="The commercial deployment of voice over internet protocol (VoIP) networks
(and associated packet switching technologies) has gathered pace in the
recent years. However, a major concern with such networks is the issue of
the security of networks based on such open standards. Little research has
been carried out into examining the options for securing VoIP networks and,
more specifically, the impact which implementing such security
architectures and protocols will have on the performance of such secure
networks. This paper describes the research, which has been carried out
into the development of a realistic model for carrying out simulations of
the performance of secure session initiation protocol based VoIP networks.
The results of the performance analysis obtained using this model are
presented with a discussion of the implications of these results for
designers considering implementation of real secure VoIP networks.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-46RM33D-1-1F\&\_cdi=5624\&\_orig=browse\&\_coverDate=04\%2F15\%2F2003\&\_sk=999739993\&view=c\&wchp=dGLbVtz-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=4955cd2e95f831f91a685e6b808978ce\&ie=f.pdf"
}
@TECHREPORT{Rant0305:SIP,
AUTHOR="Olli Rantapuska",
TITLE="{SIP} Call Security in an Open {IP} Network",
TYPE="Seminar report",
INSTITUTION="Helsinki University of Technology, Telecommunications Software and
Multimedia Laboratory",
NUMBER="T-110.551",
ADDRESS="Helsinki, Finland",
MONTH=may,
YEAR=2003,
KEYWORDS="SIP; security",
ABSTRACT="This paper examines the security model and features present in the Session
Initiation
Protocol (SIP). Security and privacy issues of SIP are important because
the
protocol is going to be used in many future applications in open IP
networks. SIP
security builds on established solutions. The currently available security
and privacy
features of SIP are presented and analyzed. While not perfect, the
available features
do improve the security of SIP.",
URL="http://www.tml.hut.fi/Studies/T-110.551/2003/papers/19.pdf"
}
@ARTICLE{Rao0305:Netlets,
AUTHOR="Nageswara Rao and Young-Cheol Bang and Sridhar Radhakrishnan and Qishi Wu
and S. Iyengar and Hyunseung Choo",
TITLE="NetLets: measurement-based routing daemons for low end-to-end delays over
networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=8,
PAGES="834-844",
MONTH=may,
YEAR=2003,
REFERENCES=21,
KEYWORDS="End-to-end delays; Network instrumentation and measurements; Quality of
service; Performance evaluation; NetLets",
ABSTRACT="Routing in the Internet is based on the best-effort mechanism, wherein the
routers generally forward packets to minimize the number of hops to the
destination. Furthermore, all packets of a type are treated the same
independent of their size. We propose the framework of NetLets to enable
the applications to send data packets to the destination with certain
guarantees on the end-to-end delay. NetLets employ in situ instruments to
measure the effective bandwidth and propagation delays on the links, and
compute the paths with minimum measured end-to-end delay for data packets
of various sizes. Based on experiments over local area networks, the paths
selected by NetLets indeed achieve the minimum end-to-end delay, and our
method outperformed the best-effort mechanism based on the hop count. We
also describe an implementation of NetLets over the Internet to illustrate
their viability for wide-area networks.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-474GCTK-1-23\&\_cdi=5624\&\_orig=browse\&\_coverDate=05\%2F20\%2F2003\&\_sk=999739991\&view=c\&wchp=dGLbVlz-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=a65ae7601487ba930e75c2ba1c8915ae\&ie=f.pdf"
}
@ARTICLE{Rast0304:Optimal,
AUTHOR="Rajeev Rastogi and Yuri Breitbart and Minos Garofalakis and Amit Kumar",
TITLE="Optimal Configuration of {OSPF} Aggregates",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=2,
PAGES="181-194",
MONTH=apr,
YEAR=2003,
REFERENCES=5,
KEYWORDS="area border routers; dynamic programming; IP address aggregation; optimal
routing; Open Shortest Path First (OSPF); OSPF advertisements; OSPF
weights",
ABSTRACT="Open Shortest Path First (OSPF) is a popular protocol for routing within an
autonomous system (AS) domain. In order to scale for large networks
containing hundreds and thousands of subnets, OSPF supports a two-level
hierarchical routing scheme through the use of OSPF areas. Subnet
addresses within an area are aggregated, and this aggregation is a crucial
requirement for scaling OSPF to large AS domains, as it results in
significant reductions in routing table sizes, smaller link-state
databases, and less network traffic to synchronize the router link-state
databases. On the other hand, address aggregation also implies loss of
information about the length of the shortest path to each subnet, which in
turn, can lead to suboptimal routing. We address the important practical
problem of configuring OSPF aggregates to minimize the error in OSPF
shortest-path computations due to subnet aggregation. We first develop an
optimal dynamic programming algorithm that, given an upper bound k on the
number of aggregates to be advertised and a weight assignment function for
the aggregates, computes the k aggregates that result in the minimum
cumulative error in the shortest-path computations for all
source-destination subnet pairs. Subsequently, we tackle the problem of
assigning weights to OSPF aggregates such that the cumulative error in the
computed shortest paths is minimized. We demonstrate that, while for
certain special cases (e.g., unweighted cumulative error) efficient
optimal algorithms for the weight assignment problem can be devised, the
general problem itself is NP-hard. Consequently, we have to rely on search
heuristics to solve the weight assignment problem. To the best of our
knowledge, our work is the first to address the algorithmic issues
underlying the configuration of OSPF aggregates and to propose efficient
configuration algorithms that are provably optimal for many practical
scenarios.",
URL="http://ieeexplore.ieee.org/iel5/90/26877/01194816.pdf?isNumber=26877\&prod=JNL\&arnumber=1194816\&arSt=+181\&ared=+194\&arAuthor=Rastogi\%2C+R.\%3B+Breitbart\%2C+Y.\%3B+Garofalakis\%2C+M.\%3B+Kumar\%2C+A."
}
@INPROCEEDINGS{Rath0305:Subspace,
AUTHOR="Gagan Rath and Christine Guillemot",
TITLE="A Subspace Based Method for Error Correction with {DFT} Codes",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="A subspace based method for real error correction with DFT codes is
proposed. The common roots of the eigen-polynomials of the syndrome
covariance matrix associated with the zero eigenvalue give the error
locations. When the codevectors are quantized, the localization algorithm
is modified so as to minimize the quantization noise effects. The proposed
method is analogous to the subspace based spectral estimation techniques in
array signal processing, but adapted to
discrete error locations and only one set of syndrome coefficients.
By combining the analytical results for perfect error localization with
the subspace based approach, we obtain superior results than the existing
approach."
}
@INPROCEEDINGS{Ray0303:Robust,
AUTHOR="Saikat Ray and Rachanee Ungrangsi and Francesco {De Pellegrini} and Ari
Trachtenberg and David Starobinski",
TITLE="Robust Location Detection in Emergency Sensor Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We propose a new framework for providing robust location detection
in emergency response systems, based on the theory of identifying
codes. The key to this approach is to allow sensor coverage to
overlap in such a way that each resolvable position is covered by
a unique set of sensors. In this setting, determining an optimal
placement of sensors is equivalent to constructing an optimal
identifying code. Since constructing optimal identifying codes is
generally NP-complete, we instead propose and analyze a new
polynomial-time algorithm for generating irreducible codes for
arbitrary topologies. We also generalize identifying codes to
incorporate robustness properties that are critically needed in
emergency networks. We develop and analyze a polynomial-time
algorithm for computing robust identifying codes and show these
codes to be irreducible. Through analysis and simulation, we show
that our approach typically requires significantly fewer sensors
than existing proximity-based schemes. Alternatively, for a fixed
number of sensors, our scheme can provide much stronger robustness
in the face of sensor failures or physical damage to the system.
methods keywords Information theory, Graph theory, System design"
}
@ARTICLE{Raye0305:Operation,
AUTHOR="Ammar Rayes",
TITLE="Operation management of {IP} broadband access networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=7,
PAGES="679-690",
MONTH=may,
YEAR=2003,
REFERENCES=15,
KEYWORDS="Broadband access technology; Digital subscriber lines; Ethernet;
Traffic-engineering",
ABSTRACT="The last several years have seen significant advances in broadband access
technology, including greater bandwidth, improved quality of service
capabilities, multicast, and better applications availability. Customers
today have several choices of broadband access technologies, namely
Digital Subscriber Lines (DSL), Cable, wireless, and most recently
Ethernet or Fiber to the home or business, as the first/last mile access
is now an emerging technology gaining significant momentum specially
Europe and Asia Pacific.
Ensuring profitability from these services requires a comprehensive
service management architecture that enables service providers to
carefully plan, quickly provision, efficiently operate, and accurately
bill these services. Once the user is connected to the network, service
providers must monitor and ensure the Quality of Service. In this paper,
we first provide an overview several IP broadband access technologies
including Ethernet to the home/business, IP DSL, Wireless, and Cable. We
then define an integrated Operation Support Systems/Network Management
Systems (OSS/NMS) architecture including description of fault,
configuration, accounting, performance, and security management functions.
Several traffic-engineering algorithms are then discussed and simulation
results are compared. Finally, an intelligent capacity allocation
algorithm for IP network is introduced.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-475B5RM-2-11\&\_cdi=5624\&\_orig=browse\&\_coverDate=05\%2F01\%2F2003\&\_sk=999739992\&view=c\&wchp=dGLbVzb-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=83ff2474c91cc2ca578e0173f19d5ec9\&ie=f.pdf"
}
@INPROCEEDINGS{Raza0305:Wireless,
AUTHOR="Mohsen Razavi and Jeffrey H. Shapiro",
TITLE="Wireless Optical Communications via Diversity Reception and Optical
Preamplification",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="AbstractAtmospheric optical communication systems that use optical
preamplifiers and diversity reception to combat the effects of atmospheric
turbulence are addressed. The effects of atmospheric turbulence, background
light, source extinction ratio, amplified spontaneous emission, and
receiver thermal noise are considered in the context of a semiclassical
photon-counting approach. The particular diversity techniques that are
investigated include aperture averaging, linear combining, and adaptive
optics. Numerical results, obtained using a conditional Gaussian
approximation, quantify the link margin improvement due to optical
preamplification and diversity reception."
}
@INPROCEEDINGS{Razz0305:Wireless,
AUTHOR="Giuseppe Razzano",
TITLE="Wireless {LAN:} an adaptive algorithm to reduce power consumption",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="A novel radio modem architecture is proposed for a single-hop ad hoc
network (WLAN) providing wireless access to Internet. The system works at
17 GHz, employs OFDM modulation and provides very high bit rate (up to 160
Mbit/s at physical layer) using TDMA access scheme. Network control is
centralized and handled by a device (Master) which is run-time selected
among all the active devices (Slaves).
The main focus of the paper is to address the power consumption issue,
which is a crucial requirement for portable devices. In particular, the
paper describes the developed MAC procedures and algorithms concerning the
interface with physical layer. Simulation trials show that a considerable
power saving can be attained without decreasing system performance."
}
@ARTICLE{Räis0309:End,
AUTHOR="Vilho {Räisänen}",
TITLE="On end-to-end analysis of packet loss",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=14,
PAGES="1693-1697",
MONTH=sep,
YEAR=2003,
REFERENCES=14,
KEYWORDS="Differentiated services; Ouality of service; Packet loss",
ABSTRACT="End-to-end analysis of packet loss is presented, addressing both overall
packet loss rate and loss correlations. Voice over IP is used as an
application for which packet loss performance is analyzed. In addition to
independent packet losses, concepts of temporal and spatial- or
across-the-domain-correlations are analyzed and their applicability to
end-to-end QoS analysis is discussed.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47S6BTB-1-P\&\_cdi=5624\&\_orig=browse\&\_coverDate=09\%2F01\%2F2003\&\_sk=999739985\&view=c\&wchp=dGLbVtz-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=b8d75317bf8ee1194a5e8c812f152f0f\&ie=f.pdf"
}
@INPROCEEDINGS{Rößl0305:Mmse,
AUTHOR="Jürgen F. {Rößler} and Johannes Huber",
TITLE="MMSE-Based Iterative Equalization with Soft Feedback for Transmission with
General Square {QAM} Constellations",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, an equalization algorithm employing soft-decision
feedback, designed for transmission with general square QAM constellations
is introduced like e.g. 16QAM or 64QAM allowing high data rates. It is
derived from a previous publication of the authors where it was originally
developed for
4QAM transmission. The algorithm employs a minimum mean-squared error
(MMSE)
filter in each iteration in order to refine the data estimates.
The rule for generating soft decisions is adapted continuously to the
current state of the algorithm. It can be shown by simulations for a 16QAM
transmission, that a linear finite length MMSE channel equalizer is
clearly outperformed.
In addition to our previous publication, we compare the new generalized
scheme
for different MMSE filter lengths and show the achievable extra gain."
}
@INPROCEEDINGS{Reck0305:Dimensioning,
AUTHOR="Stephan Recker and Walter Geisselhardt and Ingo Wolff",
TITLE="Dimensioning of Traffic Engineered Trunks for Deterministic Service
Guarantees in Mobile Data Networks",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In light of enormous licensing cost for spectral
resources strict and tight QoS requirements apply in the wired
infrastructure of mobile data networks in order to consume as
much of the end-to-end QoS budget as possible on expensive radio
links. Anticipating almost infinite wired capacity at negligible
cost often the problem of cost effective resource management in
the wired network infrastructure is disregarded. Nevertheless, a
long as the cost gain due to sophisticated resource management
exceeds cost for additional capacity it is worth to address this
issue and therefore our work aims at tackling the aspect of
appropriate dimensioning of traffic engineered paths subject
to minimizing the consumed resources under the constraint
of providing deterministic QoS guarantees. We assume traffic
engineered paths being established between the edges of the
wired infrastructure of a mobile data network and propose a
novel application of fuzzy logic control in order to dynamically
adapt the resources assigned to one path to variations of traffic
traversing that path. In particular, we design the required
fuzzy sets and the according rule base of the controller and
evaluate its asymptotic stability and performance. One crucial
input shall be an indicator of the traffic variation, which shall
be averaged over a variable size window. We design a second
fuzzy logic controller to adapt this averaging window in order
to capture all important traffic variations while reducing the
measurement overhead during periods of nearly time invariant
traffic characteristics. Our work highlights the most important
tuning knobs of the applied fuzzy logic controller and identifies
potential difficulties."
}
@INPROCEEDINGS{Reed0305:Mpls,
AUTHOR="Martin Reed",
TITLE="{MPLS} label space for optical packet switched networks",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Generalised multiprotocol label switching (GMPLS) has been proposed
as a control plane for optical packet switching (OPS). However, the
label stack construct of GMPLS is problematic for envisaged OPS
architectures as it requires an arbitrary length header structure
and (relatively) complex header manipulation. This paper proposes a
new label stack encoding that allows arbitrary depth aggregation but
that maintains a constant header length and removes the need for
complex header processing. Most notably given a requirement of an
L length label space for uniqueness of label switching it
achieves arbitrary depth aggregation through a 2L length
header label."
}
@INPROCEEDINGS{Reja0306:Pals,
AUTHOR="Reza Rejaie and Antonio Ortega",
TITLE="{PALS:} Peer to Peer Adaptive Layered Streaming",
BOOKTITLE="ACM NOSSDAV 2003",
ADDRESS="Monterey, California, USC",
DAYS=1,
MONTH=jun,
YEAR=2003,
ABSTRACT="This paper presents a new mechanism for Peer-to-Peer
Adaptive Layered Streaming, called PALS.
PALS is a receiver-driven approach for
quality adaptive playback of layer encoded streaming
media from a group of congestion controlled sender
peers to a single receiver peer.
Since the effective throughput from each sender
is variable and not known a priori, it is extremely
challenging to coordinate delivery among active senders.
In PALS, the receiver orchestrates coordinated
delivery among active senders by adaptively determining:
1) a subset of senders that maximize overall throughput,
2) overall quality (i.e. number of layers) that can be
delivered from these senders as well as distribution of
overall throughput among active layers, and most importantly
3) required packets tobe delivered by each active sender in
order to effectively cope with any sudden change in throughput
from individual senders."
}
@ARTICLE{Remo0301:Ad,
AUTHOR="David Remondo and Ignas Niemegeers",
TITLE="Ad hoc networking in future wireless communications",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=1,
PAGES="36-40",
MONTH=jan,
YEAR=2003,
REFERENCES=31,
KEYWORDS="Wireless networks; Ubiquitous communications; Pervasive computing",
ABSTRACT="This paper contains an overview of the discussions on future research
directions within the subject of ad hoc networking, held at the Wireless
World Research Forum meetings during 2001. Ad hoc networking is an
emerging research field where ad hoc networks are no longer viewed as
stand-alone groups of wireless terminals. On the contrary, ad hoc networks
are expected to become fundamental in the future development of
infrastructure networks and they will be the basis for enabling ubiquitous
communications. Ad hoc networking involves new research issues at all
layers.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-45XTDT8-2-3\&\_cdi=5624\&\_orig=browse\&\_coverDate=01\%2F01\%2F2003\&\_sk=999739998\&view=c\&wchp=dGLbVlb-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=f68d5d45d20b0512121999a254ca7726\&ie=f.pdf"
}
@ARTICLE{Ren0302:Performance,
AUTHOR="Huan Ren and Kihong Park",
TITLE="Performance evaluation of optimal aggregate-flow scheduling: a simulation
study",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=3,
PAGES="222-236",
MONTH=feb,
YEAR=2003,
REFERENCES=32,
KEYWORDS="Optimal aggregate-flow scheduling; Optimal per-hop control; Performance
evaluation",
ABSTRACT="Providing scalable QoS-sensitive services to applications with varying
degrees of elasticity using aggregate-flow scheduling is a challenging
problem. In a previous paper [Proc. IEEE/IFIP Int. Workshop Quality
Service (2000) 211], we advanced a theoretical framework where an optimal
differentiated services provisioning problem is formulated and solved to
yield solutions for optimal per-hop control. In this paper, we extend our
previous work by investigating performance evaluation and implementation
issues associated with the induced optimal differentiated services
architecture. We design a system that realizes the optimal per-hop control
coupled with end-to-end adaptive QoS control, and implement a practical
enhancement by introducing a scaling function which is applied to the TOS
field label value in the IP header at each router. The scaling function
allows the service provider to configure the per-hop control so as to
export customized QoS separationessential when shaping end-to-end absolute
QoS over per-hop relative QoS-commensurate with the QoS profiles of the
service provider's user base. We use simulation to study the structural
and dynamical properties of differentiated services as affected by optimal
aggregate-flow per-hop control.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47CXYMN-1-7P\&\_cdi=5624\&\_orig=browse\&\_coverDate=02\%2F15\%2F2003\&\_sk=999739996\&view=c\&wchp=dGLbVzb-zSkzS\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=88e6b21b92f678a0820965403498a461\&ie=f.pdf"
}
@INPROCEEDINGS{Rend0305:Bit,
AUTHOR="Deniz Rende and Tan Wong",
TITLE="Bit Interleaved Space-Frequency Coded Modulation for {OFDM} Systems",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We present an orthogonal frequency-division multiplexing (OFDM) system with
bit-interleaved
space-frequency coded modulation for frequency selective fading channels
employing multiple transmit
and receive antennas. OFDM is used to transform a frequency selective
fading channel into multiple flat fading channels, and space-frequency
trellis coding
combined with bit-interleaving is used to exploit space and frequency
diversity.
The performance of such an approach is evaluated by analytical bounds and
simulation.
With the use of space-frequency coding and BICM, we can provide increased
rates
and also improved performance by means of increased diversity."
}
@INPROCEEDINGS{Rey0305:Transmit,
AUTHOR="Francesc Rey and Meritxell Lamarca and Gregori Vazquez",
TITLE="Transmit Filter Optimization based on Partial {CSI} Knowledge for Wireless
Applications",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper deals with closed-loop schemes in OFDM modulation systems. A
Bayesian approach is presented to design minimum BER prefiltering matrices
in the presence of channel uncertainties. This formulation leads to a
robust algorithm that exhibits lower sensitivity to channel estimation
errors than classical schemes. The proposed design encompasses the single
antenna transmission, the beamforming schemes and the frequency flat
fading channels as particular cases."
}
@INPROCEEDINGS{Reyn0304:Promoting,
AUTHOR="Taylor Reynolds and Gary Sacks",
TITLE="Promoting Broadband: Background Paper",
BOOKTITLE="Promoting Broadband",
ORGANIZATION="ITU",
ADDRESS="Geneva, Switzerland",
MONTH=apr,
YEAR=2003,
KEYWORDS="Broadband; ADSL; study",
ABSTRACT="The aim of this background paper is to examine some of the promotion
techniques of broadband networks
and services that have proven to be successful from both a demand and
supply perspective. This should
enable those interested in the promotion of broadband to identify how
those techniques can apply to their
own economies, and to address some of the problems faced.",
URL="http://www.itu.int/osg/spu/ni/promotebroadband/PB03-PromotingBroadband.pdf"
}
@INPROCEEDINGS{Reyn0305:Transmitter,
AUTHOR="Daryl Reynolds and Anders Host-Madsen and Xiaodong Wang",
TITLE="Transmitter Precoding for {CDMA} in Fading Multipath Channels: Strategy and
Analysis",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The desire to reduce complexity at the mobile unit in cellular systems has
led to the investigation of signal processing techniques that move
computational complexity from the mobile unit to the base station. In
this paper we investigate transmitter precoding for downlink time division
duplex (TDD) code-division multiple-access (CDMA) communications. In
particular, we develop a linear MMSE-based precoding strategy using blind
channel estimation for fading multipath channels that allows for simple
matched filtering at the mobile unit and is easy to make adaptive. We
also present a performance analysis using tools developed for the analysis
of conventional (receiver-based) linear blind multiuser detection in
unknown channels. We compare the analytical and simulation results to
traditional receiver-based blind multiuser detection. It is seen that
transmitter precoding offers a reasonable alternative for TDD-mode CDMA
when minimizing computational complexity at the mobile unit is a priority."
}
@INPROCEEDINGS{Rezv0305:Distributed,
AUTHOR="Mohammad Rezvan and Krzysztof Pawlikowski and Harsha Sirisena",
TITLE="A Distributed Cache Architecture for Routing in Hierarchical QoS-Capable
Networks",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The route computing overhead caused by on-demand calculation of QoS
routes, especially in large networks with heavy traffic, is a concern
and can cause scalability problems.
This paper introduces a distributed cache architecture to reduce the
route computing load, caused by execution of QoS routing algorithms.
The distributed nature of the proposed cache architecture facilitates
its deployment in large networks. To maximize the performance of the
distributed cache architecture, cache snooping has been proposed to
alleviate the effects of changes in the network states. In performance
evaluation of the proposed distributed cache architecture, we use a
broad range of realistic network topologies, network traffic conditions,
routing protocols, and aggregation techniques to evaluate different
aspects of the proposed distributed cache architecture under different
conditions. The results confirm that the distributed cache architecture
can significantly reduce the route computing overhead. In addition, our
results suggest that the cache snooping can significantly increase the
overall routing performance, especially in the presence of highly
inaccurate network state information."
}
@INPROCEEDINGS{Rhee0305:Dynamic,
AUTHOR="Woo-Seop Rhee",
TITLE="Dynamic Provisioning Mechanism for Heterogeneous QoS guarantee in
Differentiated Service Networks",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The differentiated service architecture is based on a simple model by
applying a per-class service in the core node of the network. However, due
to the simplified network behavior, the network structure and provisioning
were more complicated. If a service provider wants the dynamic
provisioning or better bandwidth guarantee, signaling protocol with QoS
parameters or admission control method should be deployed in DiffServ
network. However, these methods increase the complexity. Therefore, we
propose the dynamic provisioning mechanism based on the centralized
bandwidth broker and distributed measurement based admission control and
movable boundary bandwidth management to support heterogeneous QoS
requirements in DiffServ networks."
}
@INPROCEEDINGS{Rice0305:Data,
AUTHOR="Michael Rice and William McIntire and Osama Haddadin",
TITLE="Data-Aided Carrier Phase Estimation for {GMSK}",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper examines the bias in data-aided maximum-likelihood carrier phase
estimation for GMSK based on a linear detector structure using only the
first Laurent pulse. The bias in the ML phase estimate increases with
decreasing BTb and decreasing training sequence length. Three methods for
bias compensation are described and their performance examined. Simulation
results show that the performance of the bias compensation techniques can
achieve the Cramer-Rao bound."
}
@INPROCEEDINGS{Ried0305:Optimized,
AUTHOR="Anton Riedl",
TITLE="Optimized Routing Adaptation in {IP} Networks Utilizing {OSPF} and {MPLS}",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper routing adaptation methodologies are investigated, which
utilize conventional routing protocols such as OSPF in combination with
MPLS. While having the majority of traffic routed along optimized shortest
paths, MPSL is only partly introduced to complement the adaptation process.
We present a novel algorithm based on simulated annealing to optimize link
metrics in OSPF networks. The algorithm takes into account the original
routing configuration and allows tradeoff considerations between routing
optimality and adaptation impact. For the setup of complementary MPLS
paths, two mixed-integer programming models are proposed. It can be shown
that already a relatively small number of MPLS paths is sufficient to
greatly improve a networks quality of service."
}
@ARTICLE{Riek0307:Genie,
AUTHOR="Jukka Riekki and Jouni Huhtinen and Pekka Ala-Siuru and Petteri Alahuhta
and Jouni Kaartinen and Juha {Röning}",
TITLE="Genie of the net, an agent platform for managing services on behalf of the
user",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=11,
PAGES="1188-1198",
MONTH=jul,
YEAR=2003,
REFERENCES=50,
KEYWORDS="Context-awareness; Family calendar; Neon digipainting",
ABSTRACT="We will present an agent-based architecture, Genie of the Net, for
context-aware systems that are used as components of an intelligent
environment and manage services on behalf of the user. We will also
discuss the need for knowledge representations. Furthermore, we will
present information management and event scheduling as our primary
application area and discuss the application we are working on: the Home
Notice Board, which presents information and schedules events for family
members. We will discuss the first prototype, the Family Calendar, that we
have already completed and demonstrated. For this prototype, we have
implemented a general agent platform and agents specialized in scheduling
events. Furthermore, we will present an extension to the first prototype,
Neon Digipainting. This prototype will be a combined changing art work and
information channel, which will enhance communication between family
members.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47CJBWT-2-W\&\_cdi=5624\&\_orig=browse\&\_coverDate=07\%2F01\%2F2003\&\_sk=999739988\&view=c\&wchp=dGLbVtz-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=ebbcd30f8a8a34b57f2c22fb11eea942\&ie=f.pdf"
}
@ARTICLE{Rodr0304:Counting,
AUTHOR="Ramon Rodriguez-Dagnino and Hideaki Takagi",
TITLE="Counting handovers in a cellular mobile communication network: equilibrium
renewal process approach",
JOURNAL="Performance Evaluation",
VOLUME=52,
NUMBER="2-3",
PAGES="153-174",
MONTH=apr,
YEAR=2003,
REFERENCES=23,
KEYWORDS="Cellular mobile communication networks; Multimedia service; Handover; Call
holding time; Cell residence time; Renewal theory; Equilibrium renewal
process",
ABSTRACT="Knowing the number of handovers that a user makes during a call session is
particularly important in cellular mobile communication networks in order
to make appropriate dimensioning of virtual circuits for wireless cells.
In this paper, we study the probability distributions and statistical
moments for the number of handovers per call for a variety of combinations
of the call holding time (CHT) and cell residence time (CRT) distributions.
Based on the formulation in terms of equilibrium renewal processes, we
obtain analytical expressions for the probability mass functions and
moments of the handover number distribution. Numerical examples are
provided that show a heavy-tail in the handover number distribution when
the CHT has heavy-tail.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-47K337C-1-87\&\_cdi=5663\&\_orig=browse\&\_coverDate=04\%2F30\%2F2003\&\_sk=999479997\&view=c\&wchp=dGLbVzb-zSkzk\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=371fb0b55a289dc6e49cd6a37cee5c60\&ie=f.pdf"
}
@INPROCEEDINGS{Rodr0305:Rate,
AUTHOR="Virgilio Rodriguez and David Goodman",
TITLE="Rate and Power Control with Priorities for Throughput Maximization in a
{3G} {CDMA} Network",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT={One of the available technologies through which modern wireless
communication systems can accommodate data terminals operating at
dissimilar transmission rates is {"}variable spreading gain{"} (VSG) CDMA,
a scheme in which the {"}chip rate{"} is common to all users, but the
{"}spreading{"} (processing) gains vary. This work is relevant to the
uplink of a single-cell VSG CDMA system, in which each terminal's data
throughput is weighted differently in calculating the network throughput.
We centrally seek for each active user a power level and transmission rate
which will maximize the network's aggregate weighted throughput. This note
focuses on the two-terminal scenario, which provides the core of the
analysis. Some of the reported results have been extended to the n-user
situation. The development is entirely analytical, based on optimization
theory.}
}
@INPROCEEDINGS{Rodr0309:Mechanism,
AUTHOR="Virgilio Rodriguez",
TITLE="Mechanism Design for Efficient Decentralized Network Control: The Case of
Power Allocation in Wireless Networks",
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={A {"}mechanism{"} is a set of rules governing the interaction of selfish
entities, which attempts to lead these entities to a desirable outcome.
This work applies a relatively simple mechanism, available in the
economics literature, to achieve an efficient decentralized allocation of
power among data-transmitting terminals. The resulting operating point is
{"}efficient{"}, because terminals end up {"}fairly{"} compensating each
other for the interference each one causes. The same ideas can be
fruitfully applied in more general networks, and also outside the
engineering context.}
}
@INPROCEEDINGS{Roh0305:Multiple,
AUTHOR="June Chul Roh and Bhaskar Rao",
TITLE="Multiple Antenna Channels with Partial Feedback",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We consider flat-fading multiple antenna channels with t transmit and r
receive
antennas, which is modeled by an r by t complex matrix H. The first n
eigenvectors of H^\dag H, where 0 <= n <= min(t,r), are assumed to be
available at the transmitter as partial spatial information of channel. A
transmission method was proposed which enables better use of the
multiple-input
multiple-output (MIMO) channels [1]. By using the transmission scheme,
the MIMO channel can be decomposed into two parts: n parallel channels and
a new
small coupled MIMO channel. One reasonable coding strategy is to employ
conventional
time-domain only codes for each of the parallel channels and a space-time
code for
the small MIMO channel. This paper focuses on deriving the channel
capacity of the
multiple antenna channels employing such a coding strategy. The results
show that
the proposed methods lead to systems wherein the amount of feedback
information can
be significantly reduced with a minor sacrifice of achievable transmission
rate."
}
@ARTICLE{Roja0308:Concurrent,
AUTHOR="Roberto Rojas-Cessa and Eiji Oki and H. Jonathan Chao",
TITLE="Concurrent Fault Detection for a Multiple-Plane Packet Switch",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=4,
PAGES="616-627",
MONTH=aug,
YEAR=2003,
REFERENCES=28,
KEYWORDS="concurrent testing; fault detection; packet switch; parallel planes; single
fault",
ABSTRACT="In high-speed and high-capacity packet switches, system reliability is
critical to avoid loss of huge amounts of information and retransmission
of traffic. We propose a series of concurrent fault-detection mechanisms
for a multiple-plane crossbar-based packet switch. Our switch model,
called the m+z model, has m active planes and z spare planes. This switch
has distributed arbiters on each plane. The spare planes, used for
substitution of faulty active ones, are also used in the fault-detection
mechanism, thus providing fault detection and fault location for all
switching planes. Our detection schemes are able to detect a single fault
quickly without increasing transmission overhead. The proposed schemes can
be used for switches with different numbers of active planes and a small
number of spare planes.",
URL="http://ieeexplore.ieee.org/iel5/90/27488/01224460.pdf?isNumber=27488\&prod=JNL\&arnumber=1224460\&arSt=+616\&ared=+627\&arAuthor=Rojas-Cessa\%2C+R.\%3B+Oki\%2C+E.\%3B+Chao\%2C+H.J."
}
@INPROCEEDINGS{Roon0305:Reliability,
AUTHOR="Abhinav Roongta and John Shea",
TITLE="Reliability-based Hybrid {ARQ} using Convolutional Codes",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we propose and evaluate the performance of a new hybrid
ARQ scheme using convolutional codes. The proposed scheme can be used
with communication systems that use soft-input , soft-output decoders.
We show that the magnitude of the soft-output of the decoder can be
used to identify the bits that are likely to be in error. The new ARQ
scheme requests additional information for such bits. The high
time-correlation of error events in a convolutional code is utilized to
reduce the amount of redundancy in the proposed ARQ scheme.
Significant improvement in the system performance is achieved by using
the proposed ARQ technique ."
}
@INPROCEEDINGS{Rosb0303:Blocking,
AUTHOR="Zvi Rosberg and Hai Vu and Moshe Zukerman and Jolyon White",
TITLE="Blocking Probabilities of Optical Burst Switching Networks Based on Reduced
Load Fixed Point Approximations",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="This paper provides a framework for analysis and performance
evaluation of Optical Burst Switching (OBS) networks. In
particular, a new reduced load fixed point approximation model to
evaluate blocking probabilities in OBS networks is introduced. The
model is versatile enough to cover known OBS reservation policies
such as Just-Enough-Time (JET), Just-In-Time (JIT), Burst
Segmentation and Route-dependent Priorities. The accuracy of the
model is confirmed by simulation and the various policies are
compared.
Topics keywords: Optical networks , Queuing/performance evaluation.
Methods keywords: System design, Stochastic processes/Queueing theory."
}
@INPROCEEDINGS{Rosi0305:Space,
AUTHOR="Andre {des Rosiers}",
TITLE="Space-Time Code Performance Bounds on Quasistatic Fading Channels",
BOOKTITLE="International Conference on Communications",
ADDRESS="Anchorage, Alaska",
MONTH=may,
YEAR=2003,
ABSTRACT="We evaluate truncated union bounds on the frame error rate performance of
space-time (ST) codes operating over the quasistatic fading channel and
compare them to results of computer simulation. Both ST trellis and block
codes are considered. We calculate these bounds by characterizing the set
of codeword differences from a general expression for the exact pairwise
error probability (PEP). We detail a significantly tighter numerical bound
for quasistatic fading and demonstrate code properties that account for
this tightness. Using this improved bound we show empirical evidence that
for some codes a set of dominant error events characterize the FER
performance. We also compare these performance results to outage capacity."
}
@ARTICLE{Roug0305:Pragmatic,
AUTHOR="Matthew Roughan and Charles Kalmanek",
TITLE="Pragmatic modeling of broadband access traffic",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=8,
PAGES="804-816",
MONTH=may,
YEAR=2003,
REFERENCES=19,
KEYWORDS="Long-range dependence; Traffic modeling; Simple network management
protocol; broadband access",
ABSTRACT="Good traffic modeling is a basic requirement for accurate capacity
planning. The recent discovery of heavy-tails, and long-range dependence
(LRD) in traffic has heralded a new, and more elegant way to model data
traffic, particularly characteristics such as extreme burstiness across
many time scales. However, most of the measurements used to populate such
models have been fine grained packet traces. In reality we are far from
being able to obtain such traces from more than a small subset of the
Internet, and this is likely to remain true at least in the immediate
future. The only source of ubiquitous data is Simple Network Management
Protocol (SNMP), but SNMP has many limitations which make it difficult to
work with for traffic modeling. These limitations make it impossible to
use standard LRD models. However, we show here that for broadband access,
SNMP is capable of capturing the most important features of the data
traffic. We base this analysis on a large volume (more than 2 months) of
SNMP data obtained from a large operating broadband access network. The
model is approximate, but is nonetheless quite useful for capacity
planning. The results validate our intuition about LRD in data traffic,
while allowing the key parameters of the model to be computed solely from
SNMP traffic utilization data.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-473VSDP-4-1W\&\_cdi=5624\&\_orig=browse\&\_coverDate=05\%2F20\%2F2003\&\_sk=999739991\&view=c\&wchp=dGLbVlz-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=b9d82c5b14013a4f7ebc27b02599b656\&ie=f.pdf"
}
@ARTICLE{Roun0307:Study,
AUTHOR="Shad Roundy and Paul Wright and Jan Rabaey",
TITLE="A study of low level vibrations as a power source for wireless sensor nodes",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=11,
PAGES="1131-1144",
MONTH=jul,
YEAR=2003,
REFERENCES=15,
KEYWORDS="Energy scavenging; Vibration to electricity conversion; Self powered
wireless sensing",
ABSTRACT="Advances in low power VLSI design, along with the potentially low duty
cycle of wireless sensor nodes open up the possibility of powering small
wireless computing devices from scavenged ambient power. A broad review of
potential power scavenging technologies and conventional energy sources is
first presented. Low-level vibrations occurring in common household and
office environments as a potential power source are studied in depth. The
goal of this paper is not to suggest that the conversion of vibrations is
the best or most versatile method to scavenge ambient power, but to study
its potential as a viable power source for applications where vibrations
are present. Different conversion mechanisms are investigated and
evaluated leading to specific optimized designs for both capacitive
MicroElectroMechancial Systems (MEMS) and piezoelectric converters.
Simulations show that the potential power density from piezoelectric
conversion is significantly higher. Experiments using an off-the-shelf PZT
piezoelectric bimorph verify the accuracy of the models for piezoelectric
converters. A power density of 70 W/cm3 has been demonstrated with the PZT
bimorph. Simulations show that an optimized design would be capable of 250
W/cm3 from a vibration source with an acceleration amplitude of 2.5 m/s2
at 120 Hz.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47CWTY0-1-2R\&\_cdi=5624\&\_orig=browse\&\_coverDate=07\%2F01\%2F2003\&\_sk=999739988\&view=c\&wchp=dGLbVtb-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=d7982510eb0ee9a2c0cf67055549f658\&ie=f.pdf"
}
@INPROCEEDINGS{Rous0305:Virtual,
AUTHOR="Ioanna Roussaki",
TITLE="The Virtual Home Environment roaming perspective",
BOOKTITLE="ICC 2003 - Global Services and Infrastructure for Next Generation Networks",
ADDRESS="Anchorage, Alaska",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The Virtual Home Environment (VHE) is an important portability concept of
the 3rd generation mobile systems as it promises personalized services for
roaming users across network and terminal boundaries. This paper examines
the roaming issues involved in the provision of VHE services. It aims to
present an overview of the service portability mechanisms proposed and
tested within 3G systems, while it introduces an efficient VHE roaming
approach and exposes the features of the core entities that realize it."
}
@TECHREPORT{Rous0311:2,
AUTHOR="Mema Roussopoulos and Mary Baker and David Rosenthal and T. Giuli and
Petros Maniatis and Jeff Mogul",
TITLE="2 {P2P} or Not 2 {P2P}",
TYPE="arXiv report",
INSTITUTION="arXiv",
NUMBER="cs.NI/0311017",
MONTH=nov,
YEAR=2003,
ABSTRACT="In the hope of stimulating discussion, we present a heuristic decision tree
that designers can use to judge the likely suitability of a P2P
architecture
for their applications. It is based on the characteristics of a wide range
of
P2P systems from the literature, both proposed and deployed.",
URL="http://arxiv.org/abs/cs/0311017"
}
@INPROCEEDINGS{Royc0305:Audio,
AUTHOR="Lopamudra Roychoudhuri and Ehab Al-Shaer and Hazem Hamed and Gregory
Brewster",
TITLE="Audio Transmission over the Internet: Experiments and Observations",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The quality of the audio in IP telephony is significantly influenced by
various factors, such as type of encoder, distance, delay variation, rate
and distribution of packet loss, type of error concealment, and others.
However, it has been realized that the performance of any IP telephony
system is highly dependent on understanding the contribution of these
factors on audio, and their interaction and impact on adaptive mechanisms
such as error and buffer control. We conducted a large-scale audio
transmission experiment over the Internet in a 12-month period in order to
evaluate the effects and the correlation of such parameters on audio
transmission over IP. As a result of studying and analyzing the collected
data, we have made a number of new observations that are very significant
for adaptive audio protocols such as the impact of loss, delay, and jitter
on audio quality of different encoders, correlation of loss and RTT
variation, important mechanisms of RTT measurements for audio
transmission, and others."
}
@INPROCEEDINGS{Rugi0305:Regularized,
AUTHOR="Luca Rugini and Paolo Banelli and Saverio Cacopardi",
TITLE="Regularized {MMSE} Multiuser Detection Using Covariance Matrix Tapering",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The linear minimum mean-squared error (MMSE) detector for direct-sequence
code-division multiple-access (DS-CDMA) systems relies on the inverse of
the covariance matrix of the received signal. In multiuser environments,
when few samples are available for the covariance estimation, the matrix
ill-conditioning may produce large performance degradation. In order to
cope with this effect, we propose a modified MMSE detector based on the
covariance matrix tapering (CMT). This regularization technique modifies
the estimated covariance matrix, thereby reducing its eigenvalue spread.
Two different tapering matrices are introduced. The performance comparison
with other regularization techniques is carried out by simulations, which
show the effectiveness of the proposed technique."
}
@INPROCEEDINGS{Ruiz03:Effective,
AUTHOR="Pedro Ruiz and Antonio Gomez-Skarmeta and Pedro Martinez and Juan A.
Sanchez and Emilio {García}",
TITLE="Effective Multimedia and Multi-party Communications on Multicast {MANET}
Extensions to {IP} Access Networks",
BOOKTITLE="ICOIN",
YEAR=2003
}
@INPROCEEDINGS{Rupp0305:Improving,
AUTHOR="Markus Rupp and Christoph {Mecklenbräuker}",
TITLE="Improving Transmission by {MIMO} Channel Structuring",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, new space-time coding schemes for multiple transmit and
receive antenna systems (MIMO) are proposed.
By applying a specific block coding scheme for transmission the MIMO
channel is being structured in an advantageous manner so that
simultaneously diversity can be gained and complexity at the receiver can
be saved. In a second step, such structured schemes and BLAST schemes are
combined, offering a continuous trade-off between Quality of Service (QoS)
and choice of data rate.
Due to the simplicity of the coding schemes only very moderate
modifications in the existing UMTS standard are required in order to
support them.
The number of antennas at transmitter and receiver alone is sufficient
knowledge to select the most appropriate scheme."
}
@ARTICLE{Russ0310:Virtual,
AUTHOR="Selwyn Russell and Ed Dawson and Eiji Okamoto and Javier Lopez",
TITLE="Virtual certificates and synthetic certificates: new paradigms for
improving public key validation",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=16,
PAGES="1826-1838",
MONTH=oct,
YEAR=2003,
REFERENCES=21,
KEYWORDS="Public Key Infrastructures; e-Commerce; e-Governement; Certificate",
ABSTRACT="The certificate paradigm is applied recursively to obtain the public keys
of a number of Certification Authorities and, accordingly, to obtain the
public keys of a number of final entities. Thus, validation of the
authorized public key of a party in a network transaction is commonly
based on processing the certificate chain descended from a trusted root
issuer, involving non-negligible time and cost. Those chains become long
in communications between large organizations, which is the typical case
of e-commerce and e-government applications. The process of validation of
extensive chains introduces performance problems in two aspects: signature
verification and revocation checking. That is, the repeated processing of
long chains of certificates creates severe efficiency problems. This fact
causes that most of the advantages provided by Public Key Infrastructures
(PKIs) are not conveniently exploited. In this paper we analyze the
scenarios in which large volumes of digitally signed transactions between
commercial entities exist. These cases require of interoperation among
PKIs. We show that solutions available in those scenarios still involve
processing of too long chains of certificates, either at the receiving
computer or by an outsourced entity. For this reason, we propose new
concepts of virtual certificate and synthetic certificate for faster and
less costly processing of certificate chains. In this way, communications
in a certificate-based intercommunity can be highly improved. We also show
how these types of certificates can be applied in practice.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-483442H-5-3K\&\_cdi=5624\&\_orig=browse\&\_coverDate=10\%2F15\%2F2003\&\_sk=999739983\&view=c\&wchp=dGLbVlb-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=491a9890d4165f9ce02e282476a9f15f\&ie=f.pdf"
}
@INPROCEEDINGS{Saad0305:Reconfiguration,
AUTHOR="Mohamed Saad and Zhi-Quan Luo",
TITLE="Reconfiguration with No Service Disruption in Multifiber {WDM} Networks
based on Lagrangean Decomposition",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In a WDM based network, lightpaths are established between router pairs to
form a virtual topology residing on top of the underlying physical
topology. The ability to reconfigure its virtual topology upon dynamically
changing traffic patterns has been identified as one of the most important
features of WDM based networks. Compared to previously reported
reconfiguration studies, we provide contributions along two different
directions. First, we address the problem of finding the new virtual
topology that maximizes the number of successfully established lightpaths,
while guaranteeing absolutely no service disruptions. Second, based on a
Lagrangean decomposition approach, we demonstrate that optimal and
near-optimal virtual topologies can be obtained by considering only one
wavelength in the formulation, leading to a reconfiguration algorithm that
scales to an arbitrarily large number of wavelengths. Computational results
confirm the high efficiency of the proposed algorithm."
}
@INPROCEEDINGS{Sach0305:Generic,
AUTHOR="Joachim Sachs",
TITLE="A Generic Link Layer for Future Generation Wireless Networking",
BOOKTITLE="ICC 2003 - Global Services and Infrastructure for Next Generation Networks",
ADDRESS="Anchorage, Alaska",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In future many radio access networks will be deployed based on
different technologies and standards. Therefore, a paradigm for
future generation wireless networking is to achieve cooperation
between networks, which allows communication via a multitude of
radio access technologies. While some mobility schemes already
enable communication across network boundaries, it is still not
possible to do this in an efficient and seamless way.
In this paper the concept of a generic link layer (GLL) is
presented. It is envisaged that in future the generic link layer
will be generally deployed in all radio access networks, to allow
efficient cooperation between different radio technologies. The
GLL provides a toolbox of link layer functions which can be
configured for any radio access technology. This paper discusses
the functions and interfaces of the generic link layer. It is
explained how the GLL enables lossless and efficient inter-system
handover. In addition, directions are given where further research
is required."
}
@INPROCEEDINGS{Sade0305:Parallel,
AUTHOR="Pouriya Sadeghi and M. Reza Soleymani",
TITLE="Parallel Implementation of Turbo-Decoders for Satellite and Wireless
Communication Systems",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="AbstractIn a turbo coding scheme, different codewords require different
number of iterations for being correctly decoded. If a fixed number of
iterations is allocated to each frame, it is possible that certain frames
remain erroneous while decoder is idle part of the time for other frames.
In this paper the idea of sharing the processing power among different
frames, possibly, belonging to different channels, is presented. This
time-sharing approach can increase the processing throughput and/or the
performance of the turbo decoding scheme. We present two schemes and give
their performance for the 3GPP code. We also investigate the
implementation of these schemes using a Digital Signal Processor (DSP)
chip. At the end, we present an efficient implementation algorithm by
combining those two multi-channel processing schemes."
}
@INPROCEEDINGS{Saen0303:Routing,
AUTHOR="Poompat Saengudomlert and Eytan Modiano and Robert Gallager",
TITLE="On-line routing and wavelength assignment for dynamic traffic in {WDM} ring
and torus networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We develop on-line routing and wavelength assignment (RWA) algorithms
for WDM bidirectional ring and torus networks with $N$ nodes. The
algorithms dynamically support all ${\bf k}$-allowable traffic
matrices, where ${\bf k}$ denotes an arbitrary integer vector $[k\_1,
k\_2, ..., k\_N]$, and node $i$, $1\leq i\leq N$, can transmit at most
$k\_i$ wavelengths and receive at most $k\_i$ wavelengths. Both
algorithms support the changing traffic in a rearrangeably nonblocking
fashion. Our first algorithm, for a bidirectional ring, uses $\lceil
(\sum\_{i=1}^N k\_i) /3 \rceil$ wavelengths in each ring direction and
requires at most three lightpath rearrangements per new session
request regardless of the number of nodes $N$ and the amount of
traffic ${\bf k}$. When all the $k\_i$'s are equal to $k$, the
algorithm uses $\lceil kN/3 \rceil$ wavelengths, which is known to be
the minimum for any off-line rearrangeably nonblocking algorithm for
$N\geq 7$. Our second algorithm, for a torus topology, is designed
for the special case with all the $k\_i$'s equal to $k$. For a square
torus network with $N$ nodes, the algorithm uses $\lceil k\sqrt{N}/2
\rceil$ wavelengths in each fiber, which is shown to be at most two
times a lower bound obtained by assuming full wavelength conversion at
all nodes. In addition, the algorithm requires at most $\sqrt{N}-1$
lightpath rearrangements per new session request regardless of the
amount of traffic $k$.
Method keywords: graph theory"
}
@INPROCEEDINGS{Safa0305:Performance,
AUTHOR="Zoltan Safar and K.J. Ray Liu",
TITLE="Performance Analysis of Space-Time Codes over Correlated Rayleigh Fading
Channels",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The potential for capacity increase in multi-antenna wireless
communication systems has drawn considerable attention to space-time
codes. However, most of the existing space-time code construction methods
have assumed ideal channel models: either quasi-static fading or fast
fading.
In this work, we derive the performance criteria for space-time coded
wireless communication systems taking into account both spatial and
temporal
channel correlation. We show that if the space-time correlation matrix is
of full rank, the space-time code design problem for correlated channels
can be reduced to the code design problem for fast fading channels.
Some simulation results are also presented to support the theory."
}
@INPROCEEDINGS{Safw0305:Optimal,
AUTHOR="Ahmed Safwat and Hussein Mouftah and Hossam Hassanein",
TITLE="Optimal Flows for Energy-Conserving Wireless Ad hoc Networks",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The intricate problem of energy conservation in wireless ad hoc networks is
of great significance due to the limited battery capacity of the
participating mobile devices. In this paper, we propose a novel framework
that would allow the admission of flows without jeopardizing the limited
energy of the wireless stations. A noteworthy feature of our framework is
that the upper bound on the packet rate is computed in the absence of the
energy overheads associated with routing, contention resolution, channel
sensing, etc. Hence, the upper bounds derived herein would always
constitute valid upper bounds on the amount of data transmitted by a
source node per unit time. We derive upper bounds for networks with
disjoint routes and for non-mutually exclusive paths as well. Likewise, we
study the main characteristics of the proposed techniques. Our experiments
reveal that load balancing is achieved amongst the routes and the nodes in
the wireless ad hoc network without violating any of the energy
constraints, and while adhering to a pre-computed minimum system lifetime."
}
@INPROCEEDINGS{Sagd0303:Energy,
AUTHOR="Yalin Sagduyu and Anthony Ephremides",
TITLE="Energy-Efficient Collision Resolution in Wireless Ad-Hoc Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="In this paper, we address the collision resolution (CR) problem from an
energy-efficiency point of view and develop a residual-energy-based
collision resolution algorithm (CRA) for energy-limited terminals. In this
algorithm, which is based on tree-splitting, packets involved in a
collision are partitioned into subsets according to the amount of residual
battery energy left at the corresponding terminals, and retransmissions are
scheduled according to a tree structure. We extend the proposed
energy-based CR approach to cases without hard energy constraints but,
rather, with energy-efficiency objectives. The algorithm then utilizes the
distance from the receiver as the criterion. We evaluate the proposed
algorithm via simulation for communication systems ranging from simple
single-cell classical collision channel models to general multi-hop
wireless ad-hoc networks."
}
@ARTICLE{Sahn0308:Efficient,
AUTHOR="Sartaj Sahni and Kun Kim",
TITLE="Efficient Construction of Multibit Tries for {IP} Lookup",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=4,
PAGES="650-662",
MONTH=aug,
YEAR=2003,
REFERENCES=18,
KEYWORDS="controlled prefix expansion; dynamic programming; longest matching prefix;
multibit trie; packet routing",
ABSTRACT={Srinivasan and Varghese (see ACM Trans. Comput. Syst., p.1-40, 1999) have
proposed the use of multibit tries to represent routing tables used for
Internet (IP) address lookups. They propose dynamic programming algorithms
to determine the strides of optimal multibit fixed-stride and
variable-stride tries. We improve on these algorithms by providing
alternative dynamic programming formulations for both fixed- and
variable-stride tries. While the asymptotic complexities of our algorithms
are the same as those for the corresponding algorithms of Srinivasan and
Varghese, experiments using real IPv4 routing table data indicate that our
algorithms run considerably faster. Our fixed-stride trie algorithm is two
to four times faster on a SUN workstation and 1.5 to three times faster on
a Pentium IV PC. On a SUN workstation, our variable-stride trie algorithm
is between two and 17 times faster than the corresponding algorithm of
Srinivasan and Varghese; on a Pentium IV PC, our algorithm is between
three and 47 times faster. An added feature of our variable-stride trie
algorithm is the ability to insert and delete prefixes taking a fraction
of the time needed to construct an optimal variable-stride trie {"}from
scratch{"}.},
URL="http://ieeexplore.ieee.org/iel5/90/27488/01224463.pdf?isNumber=27488\&prod=JNL\&arnumber=1224463\&arSt=+650\&ared=+662\&arAuthor=Sahni\%2C+S.\%3B+Kun+Suk+Kim"
}
@INPROCEEDINGS{Saka0305:Location,
AUTHOR="Muneyuki Sakata and Yoshihiro Yasumuro and Masataka Imura and Yoshitsugu
Manabe and Kunihiro Chihara",
TITLE="Location System for Indoor Wearable {PC} Users",
BOOKTITLE="CREST (Core Research for Evolutional Science and Technology): 2nd CREST
Workshop for Advanced Computing and Communicating Technologies for
Wearable Information Playing",
ORGANIZATION="CREST",
ADDRESS="Nara, Japan",
MONTH=may,
YEAR=2003,
KEYWORDS="Location-based services; user location",
ABSTRACT="This paper proposes how ALTAIR(Automatic Location
Tracking system using Active IR-tag) is able
to tracking and identify the users position in a buildings
includeing the office. Using priority roll-call and
controlling the emission pattern of the IR-tag, ALTAIR
is able to identify user. Our experiments show
the effective performance in an office environment.",
URL="http://crestserver.aist-nara.ac.jp/crest/workshop/2003/31Sakata.pdf"
}
@INPROCEEDINGS{Saly0312:Improving,
AUTHOR="David Salyers and Haoshu Wang",
TITLE="Improving QoS for Apache Web Servers Running on the Linux {2.4.21} Kernel",
BOOKTITLE="University of Notre Dame CSE542",
MONTH=dec,
YEAR=2003,
ABSTRACT="In this paper we discuss ways to improve the Quality of Service (QoS) and
also provide the differentiated QoS for two web servers installed on the
same system. We measured the performance of the Apache 2.0 Web server
running on the Linux 2.4.21 kernel. Three optimizations, changing process
priorities, Apache Configuration Files modification, and serving the files
from a ram-disk, are implemented to tune the system performance. The
results show that it is possible to improve web server QoS and to provide
differentiated QoS without changing the kernel source."
}
@INPROCEEDINGS{Samr0305:Symbol,
AUTHOR="Harvind Samra and Zhi Ding",
TITLE="Symbol Mapping Diversity in Iterative Decoding/Demodulation of {ARQ}
Systems",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper presents a simple, but effective method of creating
diversity among packet retransmissions in systems that
employ high-order modulations such as M-PSK and M-QAM through
intersymbol interference (ISI) channels. Diversity
is created by uniquely adapting the bit-to-symbol mapping
for each retransmission. Adapting the mapping requires
a marginal increase in receiver complexity,
while providing substantial gains in bit error rates (BER) and
frame error rates (FER)."
}
@INPROCEEDINGS{Sanc0305:Low,
AUTHOR="Victoria Sanchez and Antonio M. Peinado and Jose L. Perez-Cordoba",
TITLE="Low Complexity Channel Error Mitigation for Distributed Speech Recognition
over Wireless Channels",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Distributed Speech Recognition (DSR) has been recently proposed
as an efficient way of translating Automatic Speech Recognition
technologies to mobile and IP network applications. In this paper we
propose a channel error mitigation technique
with a low computational complexity that improves the mitigation technique
proposed in the
ETSI standard for DSR (ETSI-ES-201-108 v1.1.2) for bad channel conditions.
We also study the influence of the vector quantization index
assignment on the proposed mitigation technique and design a new index
assignment that gets some improvement on the proposed technique."
}
@INPROCEEDINGS{Sand0305:Analog,
AUTHOR="Sumeet Sandhu and Minnie Ho",
TITLE="Analog combining of multiple receive antennas with {OFDM}",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Optimal signal processing of Mr receive antennas requires digitization of
each of the Mr RF signals. For example, MRC (maximal ratio combining) of
Mr receive antennas requires Mr ADCs (analog to digital converters). Since
the ADC is a highly power-consumptive component in current receive chain
architectures, we will investigate suboptimal signal processing schemes
that combine Mr analog signals before digitization, thus enabling a much
cheaper implementation with a single ADC.
We focus on IEEE 802.11a like OFDM LAN systems with one transmit and
multiple receive antennas (SIMO - single input multiple output), with
perfect channel knowledge at the receiver. Our scheme uses scalar
weights to combine the receive antennas in the time-domain. These
weights are a function of the spatio-temporal channel matrix. The
results are very promising : 4-antenna linear combining (LC)
outperforms 2-antenna selection diversity by 5-7 dB at an uncoded BER
of 0.01, and this margin is even wider at lower BERs."
}
@INPROCEEDINGS{Sant0303:End,
AUTHOR="Jose Renato Santos and Yoshio Turner and G. John Janakiraman",
TITLE="End-to-End Congestion Control for InfiniBand",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="InfiniBand System Area Networks (SANs) which use link-level
flow control experience congestion spreading, where one
bottleneck link causes traffic to block throughout the network.
In this paper, we propose an end-to-end congestion control scheme
that avoids congestion spreading, delivers high throughput,
and prevents flow starvation. It couples a simple switch-based
ECN packet marking mechanism appropriate for typical SAN switches
with small input buffers, together with a source response
mechanism that uses rate control combined with a window limit.
The classic fairness convergence requirement for source response
functions assumes network feedback is synchronous. We relax the
classic requirement by exploiting the asynchronous behavior of
packet marking. Our experimental results demonstrate that compared
to conventional approaches, our proposed marking mechanism
improves fairness.Moreover, rate increase functions possible
under the relaxed requirement reclaim available bandwidth
aggressively and improve throughput in both static and dynamic
traffic scenarios."
}
@INPROCEEDINGS{Sara0206:New,
AUTHOR="Girish Saraph",
TITLE="New Scheme for {IP} Routing and Traffic Engineering",
BOOKTITLE="2003 Workshop on High Performance Switching and Routing",
MONTH=jun,
YEAR=2003,
ABSTRACT="A novel scheme for routing data packets in high-speed communication
networks is presented here. The detailed scheme is described in the
paper.* Simulations are performed on randomly constructed 25 and 100 node
networks, which demonstrate excellent IP throughput and capability to adapt
to the dynamic network conditions. The most important benefit of this
scheme is to simplify the route look-up tasks and save on resources
required for route processing, routing updates, data storage, memory
access, and information exchange. The scheme can be used as a stand-alone
IP routing protocol or used with the conventional IP, ATM, or MPLS for path
selection, QoS support, and traffic engineering. It can quickly adapt to
the dynamic load conditions of traffic congestion or link breakage to
enable QoS support or priority-based differential services. The scheme
could be implemented in software or hardware to give a simple, fast, and
cheap solution for high-speed networks."
}
@ARTICLE{Sara0304:Design,
AUTHOR="C. Sarantinopoulos and D. Karagiannis and Kostas Peppas and P. Demestichas
and E. Tzifa and V. Demesticha and M. Theologou",
TITLE="Design and control of the interconnecting network of the access segment of
mobile communications systems",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=6,
PAGES="489-497",
MONTH=apr,
YEAR=2003,
REFERENCES=21,
KEYWORDS="Base station; Base station controller; Simulated annealing; Genetic
algorithms",
ABSTRACT="In mobile communication systems, the network segment interconnecting the
Base Station (BS) layout with the Base Station Controllers (BSCs) and the
BSCs with the Fixed Network Switches (FNSs) should be carefully designed
and controlled. This paper presents techniques for the efficient design
and control (reconfiguration) of this network segment. The corresponding
problems are formally defined and mathematically formulated. Two solutions
are presented to the design problem, based on the genetic algorithm and the
simulated annealing paradigms. Additionally, a third solution, based on
neural networks, is proposed for the control (reconfiguration) problem.
Results are provided indicating the efficiency of the proposed algorithms.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-46SWC8F-1-51\&\_cdi=5624\&\_orig=browse\&\_coverDate=04\%2F15\%2F2003\&\_sk=999739993\&view=c\&wchp=dGLbVlz-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=459ad07cd438d419e02fb23090427b6e\&ie=f.pdf"
}
@INPROCEEDINGS{Sari0305:Dormant,
AUTHOR="Behcet Sarikaya and Timucin Ozugur",
TITLE="Dormant Mode Operation Support for Roaming from {WLAN} to {UMTS}",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The paper addresses dormant mode operation support for wireless
local area network (WLAN)-UMTS roaming for dual-mode users.
Dormant mode operation means that the dormant MS stays in its
dormant mode when it roams from WLAN to UMTS or UMTS to WLAN and
keep its sessions open using Mobile IP. Current technology doesn't
support dormant mode operation when users roam between
inter-technologies. User may roam in one of the technologies only.
We propose a methodology to support the dormant mode roaming between
inter-technologies, namely wireless local area networks and UMTS
(or GPRS). The methodology is based on letting the access point
of WLAN or GGSN of UMTS perform necessary registration functions
in lieue of the mobile."
}
@INPROCEEDINGS{Sark0303:Optimum,
AUTHOR="Saswati Sarkar",
TITLE="Optimum Scheduling and Memory Management in Input Queued Switches with
FiniteBuffer Space",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="This paper addresses scheduling and
memory management in input queued switches with finite input
buffers, with the objective of minimizing packet loss. The
framework and algorithms proposed here apply to buffer
constrained wireless networks as well. The
scheduling problem has been extensively addressed under the
assumption of infinite input buffers. We study the finite buffer
case here which arises in practice. The introduction of memory
constraint significantly complicates the problem. The optimal
strategies for infinite buffer case no longer apply and become
strictly suboptimal in presence of memory limitations. We present
closed form optimal strategies which minimize packet loss in $2
\times 2$ switches with equal arrival rates for all streams. We
identify certain characteristics of the optimal strategy for
arbitrary arrival rates, and use these properties to design a near
optimal heuristic. We use the insight obtained from the
investigation for $2 \times 2$ switches to propose a heuristic for
$N \times N$ switches, arbitrary $N$ and show numerically that
this strategy performs close to optimal. The policies presented
here reduce packet loss by about $25\\%$ as compared to the
optimal strategy for the infinite buffer case.
METHOD KEYWORDS: Stochastic processes, queueing theory, Mathematical
programming, Optimization, Graph theory, Combinatorics"
}
@ARTICLE{Sark0308:Modeling,
AUTHOR="Uttam Sarkar and Subramanian Ramakrishnan and Dilip Sarkar",
TITLE="Modeling Full-Length Video Using Markov-Modulated Gamma-Based Framework",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=4,
PAGES="638-649",
MONTH=aug,
YEAR=2003,
REFERENCES=16,
KEYWORDS="frame-size traffic model; gamma-distribution; leaky-bucket simulation;
MPEG; QQ plot; variable bit rate (VBR) video",
ABSTRACT="All traffic models for MPEG-like encoded variable bit rate (VBR) video can
be broadly categorized into (1) data-rate models (DRMs) and (2) frame-size
models (FSMs). Almost all proposed VBR traffic models are DRMs. DRMs
generate only data arrival rate, and are good for estimating average
packet-loss and ATM buffer overflowing probabilities, but fail to identify
such details as percentage of frames affected. FSMs generate sizes of
individual MPEG frames, and are good for studying frame loss rate in
addition to data loss rate. Among three previously proposed FSMs: (1) one
generates frame sizes for full-length movies without preserving
group-of-pictures (GOP) periodicity; (2) one generates VBR video traffic
for news videos from scene content description provided to it; and (3) one
generates frame sizes for full-length movies without preserving size-based
video-segment transitions. We propose two FSMs that generate frame sizes
for full-length VBR videos preserving both GOP periodicity and size-based
video-segment transitions. First, two-pass algorithms for analysis of
full-length VBR videos are presented. After two-pass analysis, these
algorithms identify size-based classes of video shots into which the GOPs
are partitioned. Frames in each class produce three data sets, one each
for I-, B-, and P-type frames. Each of these data sets is modeled with an
axis-shifted gamma distribution. Markov renewal processes model
(size-based) video segment transitions. We have used quartile-quartile
(QQ) plots to show visual similarity of model-generated VBR video data
sets with original data set. Leaky-bucket simulation study has been used
to show similarity of data and frame loss rates between model-generated
VBR videos and original video. Our study of frame-based VBR video revealed
that even a low data-loss rate could affect a large fraction of I frames,
causing a significant degradation of the quality of transmitted video.",
URL="http://ieeexplore.ieee.org/iel5/90/27488/01224462.pdf?isNumber=27488\&prod=JNL\&arnumber=1224462\&arSt=+638\&ared=+649\&arAuthor=Sarkar\%2C+U.K.\%3B+Ramakrishnan\%2C+S.\%3B+Sarkar\%2C+D."
}
@ARTICLE{Savo0303:TCP,
AUTHOR="Michael Savoric and Holger Karl and Adam Wolisz",
TITLE="The {TCP} control block interdependence in fixed networksnew performance
results",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=4,
PAGES="366-375",
MONTH=mar,
YEAR=2003,
REFERENCES=12,
KEYWORDS="Transmission control protocol; Congestion control; Flow control; Network
information reuse",
ABSTRACT="In a today's Internet end system, the congestion and flow control of every
TCP connection is done separately. This means that every TCP sender of the
TCP connections of an end system has to determine current information about
the network for itself and independently from other TCP senders. Due to
TCP's congestion control and timer management, i.e. the slow start
algorithm and timeout timer calculation, this can lead to suboptimal
network utilization. In addition, separate control reduces fairness
between simultaneous TCP connections. Both effects are caused by several
TCP senders' different perception of current network conditions.
Therefore, it might be an interesting idea to reuse network information in
an end system: information collected by existing TCP connections could be
used to initialize control variables of new TCP connections with more
up-to-date values. This can improve the overall network utilization of and
the fairness between the TCP connections of an end system.
One such network information reuse approach is the TCP control block
interdependence (TCBI, RFC 2140). In this paper, the performance of two
different TCBI control algorithms is investigated and compared to standard
TCP by simulations in a fixed network scenario. Since more and more end
systems are connected to the Internet via wireless LANs, also the
influence of packet losses in the last hop of a TCP connection on the
performance of the TCBI control algorithms is considered.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-46V4SWD-1-1K\&\_cdi=5624\&\_orig=browse\&\_coverDate=03\%2F01\%2F2003\&\_sk=999739995\&view=c\&wchp=dGLbVtb-zSkWW\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=4233c6ff207cd5790f8b500561bc29d8\&ie=f.pdf"
}
@ARTICLE{Saxe0302:Delay,
AUTHOR="P. Saxena and D. Choudhury and G. Gabrani",
TITLE="A delay optimal algorithm to locate and migrate data resources in broadband
networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=2,
PAGES="103-112",
MONTH=feb,
YEAR=2003,
REFERENCES=22,
KEYWORDS="Migration; Data resources; Transaction processing; ATM networks",
ABSTRACT="The dynamic migration of data resources such as databases and files has
become more popular with the advent of broadband networks such as ATM,
especially for transaction processing. In a system that uses data resource
migration based methods for transaction processing, the data resources are
migrated to the transaction initiation site before any operations are
performed on them. In such an environment the location of the data
resources therefore keeps on changing. Hence some mechanisms are required
to first identify the exact locations of the data resources and then
migrate them to the transaction initiation site. Such a system operation
is referred to as locate and migrate operation and is to be dealt in a
manner so that the time delay in locating the data resources is reduced.
This in turn reduces the transaction processing time. In this paper, we
propose a new algorithm to locate and migrate data resources that focuses
on reducing the time delay to locate the migratory data resources. We
evaluate the performance of the proposed algorithm and also compare it
with one of the existing algorithms by simulation studies under several
system parameters such as frequency of request generation, frequency of
data resource migration and scale of network.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-461XPFR-7-T\&\_cdi=5624\&\_orig=browse\&\_coverDate=02\%2F01\%2F2003\&\_sk=999739997\&view=c\&wchp=dGLbVlb-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=be82a4af9dc7850d61b053196be7f0e1\&ie=f.pdf"
}
@INPROCEEDINGS{Schi0309:Challenge,
AUTHOR="Bill Schilit and Anthony LaMarca and Gaetano Borriello and William Griswold
and David McDonald and Edward Lazowska and Anand Balachandran and Jason
Hong",
TITLE={Challenge: ubiquitous location-aware computing and the {"}place lab{"}
initiative},
BOOKTITLE="Wireless Mobile Applications And Services On Wlan Hotspots (WMASH)",
ORGANIZATION="ACM",
ADDRESS="San Diego, California",
PAGES="29-35",
MONTH=sep,
YEAR=2003,
REFERENCES=23,
ABSTRACT={To be widely adopted, location-aware computing must be as effortless,
familiar and rewarding as web search tools like Google. We envisage the
global scale Place Lab, consisting of an open software base and a
community building activity as a way to bootstrap the broad adoption of
location-aware computing. The initiative is a laboratory because it will
also be a vehicle for research and instruction, especially in the
formative stages. The authors draw on their experiences with campus and
building-scale location systems to identify the technological and social
barriers to a truly ubiquitous deployment. With a grasp of these
{"}barriers to adoption,{"} we present a usage scenario, the problems in
realizing this scenario, and how these problems will be addressed. We
conclude with a sketch of the multi-organization cooperative being formed
to move this effort forward.},
URL="http://www.placelab.org/papers/WMASH-p407-Schilit.pdf"
}
@ARTICLE{Schm0302:Global,
AUTHOR="Thomas Schmidt and Matthias {Wählisch} and Hans Cycon and Mark Palkow",
TITLE="Global serverless videoconferencing over {IP}",
JOURNAL="Future Generation Computer Systems",
VOLUME=19,
NUMBER=2,
PAGES="219-227",
MONTH=feb,
YEAR=2003,
REFERENCES=17,
NOTE="Elsevier (publisher)",
KEYWORDS="peer-to-peer videoconferencing, user locating, user address resolution,
multicast videoconferencing, wavelet transform",
ABSTRACT="In recent years the capabilities of the common Internet infrastructure have
increased to an extent where data intensive communication services may
mature to become popular, reliable applications. Videoconferencing over IP
can be seen as such a highly prominent candidate. However, heavy
infrastructure and complicated call handling hinder acceptance of standard
solutions.
This paper presents a more lightweight frameworkboth communication scheme
and conferencing softwareto overcome these deficiencies. A simple,
ready-to-use global location scheme for conference users is proposed.
First practical experiences are reported.",
URL="http://www.rz.fhtw-berlin.de/projekte/vcoip/terena-paper.pdf,
http://dx.doi.org/10.1016/S0167-739X(02)00148-6"
}
@INPROCEEDINGS{Scho0305:Df,
AUTHOR="Robert Schober and Lutz Lampe and Yao Ma and Subbarayan Pasupathy",
TITLE="{DF-DD} for Channels with Phase Noise",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we design decision-feedback differential detection (DF-DD)
schemes for channels with phase noise. If the DF-DD feedback filter is
properly optimized, a performance similar to that of more complex,
recently reported schemes based on multiple-symbol detection [1] and
expectation maximization (EM) [2] can be achieved. However, it is also
shown that an error floor is unavoidable. In contrast to previously
proposed receivers for channels with phase noise, the DF-DD receiver can
be made robust against unknown frequency offsets by introducing a simple
linear constraint."
}
@INPROCEEDINGS{Scho0305:Widely,
AUTHOR="Robert Schober and Wolfgang Gerstacker and Lutz Lampe",
TITLE="A Widely Linear {LMS} Algorithm for {MAI} Suppression for {DS-CDMA}",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, a novel data-aided stochastic gradient algorithm for
adjustment of the widely linear (WL) minimum mean-squared error (MMSE)
filter for multiple access interference (MAI) suppression for
direct-sequence code-division multiple access (DS-CDMA) is introduced and
analyzed. We give analytical expressions for the steady-state
signal-to-interference-plus-noise ratio (SINR) of the proposed WL
least-mean-square (LMS) algorithm, and we also investigate its speed of
convergence. Both analytical considerations and simulations show in good
agreement the superiority of the novel WL adaptive algorithm.
Nevertheless, the computational complexity of the proposed algorithm is
lower than that of the linear LMS algorithm."
}
@INPROCEEDINGS{Schu0305:Energy,
AUTHOR="Curt Schurgers and Mani Srivastava",
TITLE="Energy Optimal Scheduling under Average Throughput Constraint",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="By adapting radio settings, such as the modulation or error code, in
response to changes in the wireless channel, the energy consumption of a
communicaton system can be greatly reduced. In this paper, we investigate
the problem of minimizing the energy for a desired average throughput.
When the option of shutting down the radio completely is also considered,
deciding on the optimal setting becomes a complex scheduling problem. In
this case, we have to take the power of both the radio electronics and the
power amplifier into account, the relative importance of which has a
critical impact on the nature of the adaptation strategy, as we show in
this paper. We present a new algorithm that does not require any knowledge
of the channel statistics, but instead quickly learns the desired
adaptation strategy. It is easy to implement, yet is optimal in terms of
energy savings."
}
@INPROCEEDINGS{Schu0305:Tradeoff,
AUTHOR="Dominic Schupke",
TITLE="The Tradeoff Between the Number of Deployed p-Cycles and the Survivability
to Dual Fiber Duct Failures",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Abstract p-Cycles can attain high capacity efficiency and fast protection
switching times when deployed in WDM networks. The number of deployed
p-cycles and the survivability to dual fiber
duct failures are further important characteristics which are considered
in a pan-European network case study. We show the dual failure
restorability and the protection capacity can vary significantly
for cycle-configurations with different numbers of deployed p-cycles."
}
@TECHREPORT{Schu0308:9,
AUTHOR="Henning Schulzrinne",
TITLE="{9-1-1} Calls for Voice-over-IP",
TYPE="Ex-parte filing to the Federal Communications Commission",
INSTITUTION="Department of Computer Science, Columbia University",
NUMBER="cucs-022-03",
ADDRESS="New York, New York",
MONTH=aug,
YEAR=2003,
KEYWORDS="emergency calls; SIP; mobility; 911",
ABSTRACT="This document enumerates some of the major opportunities and challenges for
providing
emergency call (9-1-1) services using IP technology. In particular, all
VoIP devices are effectively
mobile. The same IP telephony device works anywhere in the Internet,
keeping the
same external identifier such as an E.164 number or URL.",
URL="http://www1.cs.columbia.edu/~library/TR-repository/reports/reports-2003/cucs-022-03.pdf"
}
@ARTICLE{Schu0311:Ubiquitous,
AUTHOR="Henning Schulzrinne and Xiaotao Wu and Stylianos Sidiroglou and Stefan
Berger",
TITLE="Ubiquitous Computing in Home Networks",
JOURNAL="IEEE Communications Magazine",
PAGES="128-135",
MONTH=nov,
YEAR=2003,
KEYWORDS="SIP; ubiquitous computing; device control",
ABSTRACT="In the past decade, there have been numerous
efforts in ubiquitous computing. For home
networks, we believe that ubiquitous computing
requires a global-scale system that is securable,
administered by multiple independent nonspecialist
administrators, and integrates off-the-shelf
hardware and software. In this system every
home owner acts as an administrator of the network
in the home. We are developing such a system
based on 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.",
URL="http://www1.cs.columbia.edu/~xiaotaow/rer/Research/Paper/ieeecomm\_inhome.pdf"
}
@INPROCEEDINGS{Scut0305:Generalized,
AUTHOR="Gesualdo Scutari and Sergio Barbarossa",
TITLE="Generalized Water-Filling for Multiple Transmit Antenna Systems",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="It is well known that the optimal coding strategy, maximizing the
mutual information under an average transmit power constraint and
additive Gaussian noise, for single-input/single-output (SISO)
transmission over a time-invariant, dispersive channel is
water-filling. The extension to a multiple-input/single output
(MISO) channel can also be derived in a straightforward manner,
using a numerical approach. The aim of this work is to provide a
closed form expression for the optimal coding and power/bit
allocation for a MISO channel, which has a direct interesting
physical interpretation and it establishes a direct link between
water-filling, beamforming and maximal ratio combining. We test
then our theoretical findings with numerical results."
}
@INPROCEEDINGS{Seka0305:Routing,
AUTHOR="Vyas Sekar and Manoj Bs and Siva Ram Murthy",
TITLE="Routing for a Single Interface {MCN} Architecture and Pricing Schemes for
Data Traffic in Multihop Cellular Networks",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Multihop Cellular Networks (MCNs) have been proposed as a throughput
enhancement alternative for traditional cellular networks. In MCNs,
as opposed to traditional cellular networks, both the Base Station (BS)
and the Mobile Stations (MSs) play a significant role in forwarding
data. In this paper, we propose an efficient routing protocol for
Single interface MCNs and compare it with an existing routing protocol.
The primary motivation for exploring this single interface mechanism is
to provide low cost and low power consumption mobile devices. Since
pricing in packet-based data traffic for MCNs is a key issue which is
not addressed so far, we propose a set of incentive-based pricing
schemes for packet based traffic that are not bound by mobility or load
constraints. We also suggest reimbursement based schemes that take into
account the retransmission attempts made by the intermediate nodes.
We compare our routing protocol Single interface MCN Routing Protocol
(SMRP) with Base driven Multihop Bridging Protocol (BMBP) and study
a set of incentive-based pricing schemes for data traffic in MCNs using
extensive simulation using GloMoSim."
}
@INPROCEEDINGS{Sen0305:Preemptive,
AUTHOR="Arunabha Sen and Bao Hong Shen and Bin Hao and Harishkumar Jayakumar and
Subir Bandyopadhyay",
TITLE="On a Preemptive Multi-Class Routing Scheme with Protection Paths for {WDM}
Networks",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="A large optical network may carry multiple traffic classes with different
priorities and fault-tolerance requirement.
A higher priority traffic may require to have a backup path so that the
traffic can be switched quickly to
this path in case of a failure in the primary path. The lower priority
traffic classes may not have any
such requirement. In the path protection schemes currently in use for the
WDM networks, a backup path
is computed for all traffic, whenever a primary path is established
between a source-destination pair. The resources needed for
communication using
the backup path are reserved (or set aside) for data communication between
a source-destination pair, and are
utilized only when the primary path is unavailable due to a failure in the
network.
The traffic carrying capacity of a network can be
increased, if the resources set aside for the backup paths are utilized
for data communication.
In this paper we propose a path protection scheme for networks with
multiple classes of traffic.
The key features of our scheme are (i) Not all traffic classes have backup
paths - only higher priority
classes have backup paths, (ii) Primary paths of lower priority traffic
share wavelengths with secondary
paths of higher priority traffic, and (iii) Lower priority traffic can be
preempted by higher priority traffic
in case of a failure.
The sharing of a wavelength between the primary path of a lower priority
communication with the secondary path of
a higher priority communication allows the network to satisfy more call
requests, thereby reducing the call blocking
probability. We provide a mathematical programming
formulation for computing the primary and backup paths for call requests
in a dynamic environment.
We also compute the call blocking probability of our scheme and compare it
with the call blocking probability of
the conventional scheme through simulation. Our experimental results show
significant gain by the proposed scheme over
the conventional scheme."
}
@ARTICLE{Seok0311:Modification,
AUTHOR="Seung-Joon Seok and Sung-Kwan Youm and Soo-Won Kim and Chul-Hee Kang",
TITLE="A modification of {TCP} flow control for improving end-to-end {TCP}
performance over networks with wireless links",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=17,
PAGES="1998-2010",
MONTH=nov,
YEAR=2003,
REFERENCES=14,
KEYWORDS="TCP performance; Wireless Internet; Flow control; Soft hand-off",
ABSTRACT="End-to-end Transmission Control Protocol (TCP) performance is one of the
more important issues in wireless Internet services. This paper proposes
the improvement of end-to-end TCP performance via a TCP-aware link layer
protocol called Adaptive TCP (A-TCP). The key idea behind the protocol is
that an A-TCP agent, which is located in each base station, makes a mobile
host look as if it has a wired link with the base station. This concept is
referred to in this paper as the virtual host model. In order to implement
this model, the A-TCP agent performs three functions: local retransmission,
sender freezing and A-TCP flow control. A-TCP flow control is an original
proposal and is also the principal factor for improving end-to-end TCP
performance in a wireless Internet environment. In A-TCP flow control, the
A-TCP agent marks the window field of each acknowledgment segment with a
retransmission buffer size. Therefore, the TCP congestion controls, which
happen in a TCP sender, are not caused by wireless link overflow.
Performance evaluations were conducted via computer simulations and
mathematical analyses. The results of the evaluations show not only that
the A-TCP improves end-to-end TCP performance by at least 20\%, which is
higher compared to other TCP approaches, but also that the A-TCP can
provide near-optimal performance in wireless bottleneck conditions. In
addition, this paper proposes an A-TCP agent architecture, which consists
of virtual host objects and several other functional blocks, and describes
a new hand-off policy for the virtual host model, called transport-level
soft hand-off.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-48TM4CM-1-1V\&\_cdi=5624\&\_orig=browse\&\_coverDate=11\%2F01\%2F2003\&\_sk=999739982\&view=c\&wchp=dGLbVzb-zSkzk\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=d2d792551a466a4e66c01ea43edfd05d\&ie=f.pdf"
}
@ARTICLE{Sere0308:Towards,
AUTHOR="Gergely Seres and Arpad Szlavik and Janos Zatonyi and József {Bíró}",
TITLE="Towards efficient decision rules for admission control based on the many
sources asymptotics",
JOURNAL="Performance Evaluation",
VOLUME=53,
NUMBER="3-4",
PAGES="209-223",
MONTH=aug,
YEAR=2003,
REFERENCES=11,
KEYWORDS="QoS; Admission control; Equivalent capacity; Effective bandwidth; Large
deviations",
ABSTRACT="This paper introduces new admission criteria that enable the use of
algorithms based on the many sources asymptotics in real-life
applications. This is achieved by a significant reduction in the
computational requirements and by moving the computationally intensive
tasks away from the timing-sensitive decision instant. It is shown that
the traditional overflow probability type admission control method can be
reformulated into a bandwidth requirement type and into a buffer
requirement type method and that these methods are equivalent when used
for admission control. The original and the two proposed methods are
compared through the example of fractional Brownian motion (fBm) traffic.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-48V844V-2-84\&\_cdi=5663\&\_orig=browse\&\_coverDate=08\%2F31\%2F2003\&\_sk=999469996\&view=c\&wchp=dGLbVzb-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=9c8d685047904d1b1c93f2798f375a24\&ie=f.pdf"
}
@INPROCEEDINGS{Seye0305:Novel,
AUTHOR="Alireza Seyedi",
TITLE="A Novel Reception Method to Mitigate Frequency Offset in {OFDM} Receivers",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="A novel reception method for OFDM systems, based on the use of
multiple local oscillators at the receiver is proposed. In this
method the received signal is demodulated using multiple
oscillators with slightly different frequencies, the demodulated
data is then combined to produce the decision variable. The
analysis and the simulations show that such a system displays
excellent performance when frequency offset exists between the
local oscillators at the transmitter and the receiver. Also the
simulations show improvement in the bit error rate of the system
when operating over a flat fading channel."
}
@INPROCEEDINGS{Sgra0305:Estimation,
AUTHOR="Christian Sgraja and Juergen Lindner",
TITLE="Estimation of Rapid Time-Variant Channels for {OFDM} using Wiener Filtering",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The performance of orthogonal frequency division multiplexing (OFDM)
deteriorates in a rapidly time-varying environment due to the loss of
orthogonality, resulting in interchannel interference (ICI). Moreover,
the quality of a model-based channel estimation may degrade if the
estimator has been designed for a time-invariant scenario. In this
paper, we consider OFDM and pilot-aided channel estimation via
Wiener filtering and derive the filter for a time-variant WSSUS
model. In addition, the analysis allows to compute the performance
loss for an improper estimation filter which suffers from the problem
of model mismatch."
}
@INPROCEEDINGS{Shaf0305:Calibration,
AUTHOR="Hamid Shafiee and Saeed Fouladifard",
TITLE="Calibration of {IQ} Imbalance in {OFDM} Transceivers",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="High rate wireless communication systems require the design of low-cost
radio transceivers with low power consumption. The design of direct
conversion receivers which convert the radio frequency directly to
baseband has been the subject of active investigation in recent years.
However, such architectures introduce certain design challenges of their
own, namely DC offsets as well as gain and phase mismatches in the
in-phase and quadrature paths. In this paper, we propose novel methods for
calibrating the IQ imbalance in the receiver for OFDM communication
systems. Relations are derived for the estimation of the gain and phase
parameters for AWGN as well as frequency selective fading channels. We
will also investigate the statistical properties of the estimated
parameters. The calibration procedure is verified for an OFDM system
design based on the IEEE 802.11a standard for wireless local area
networks."
}
@INPROCEEDINGS{Shaf0305:Frequency,
AUTHOR="Hamid Shafiee and Saeed Fouladifard",
TITLE="Frequency Offset Estimation in {OFDM} Systems in Presence of {IQ} Imbalance",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The orthogonality between sub-carriers in OFDM systems is disrupted by
offsets between the carrier frequencies in the transmitter and receiver,
as well as by the so-called IQ mismatch in the mixers. When treated
separately, effective algorithms exist for estimation and compensation of
frequency offset as well as IQ imbalance. However, with both effects
present, such algorithms do not lead to useful estimates of the related
parameters. In this paper, we propose a novel technique for the estimation
of the frequency offset in the presence of IQ imbalance. The proposed
algorithm is tested on an OFDM communication system designed based on the
specifications of IEEE 802.11a for wireless local area networks.
Simulation results show that the frequency offset estimation algorithm
works well even with large values of gain and phase imbalances in the
receiver mixer. When an estimate of the frequency offset is obtained, and
the complex baseband samples are corrected accordingly, any effective
technique for the compensation of IQ imbalance can be applied."
}
@TECHREPORT{Shah0301:Data,
AUTHOR="Rahul Shah and Sumit Roy and Sushant Jain and Waylon Brunette",
TITLE="Data MULEs: Modeling a Three-tier Architecture for Sparse Sensor Networks",
TYPE="Intel technical report",
INSTITUTION="Intel",
NUMBER="IRS-TR-03-001",
ADDRESS="Seattle, Washington",
MONTH=jan,
YEAR=2003,
KEYWORDS="data propagation",
ABSTRACT="This paper presents and analyzes an architecture to collect sensor data in
sparse sensor networks. Our approach exploits the presence of mobile
entities (called MULEs) present in the environment. MULEs pick up data
from the sensors when in close range, buffer it, and drop off data to
wired access points. This can lead to substantial power savings at the
sensors as they only have to transmit over a short range. This paper
focuses on a simple analytical for understanding performance as
system parameters are scaled. Our assumes two-dimensional random
walk for mobility and incorporates key system variables such as the number
of MULEs, sensors and access points. The performance metrics observed are
the data success rate (the fraction of generated data that reaches the
access points) and the required buffer capacities on the sensors and the
MULEs. The ing along with simulation results can be used for further
analysis and provide guidelines for deployment of such systems.",
URL="http://www.intel-research.net/Publications/Seattle/012220031206\_114.pdf"
}
@PHDTHESIS{Shah0305:Distributed,
AUTHOR="Gauri Shah",
TITLE="Distributed data structures for peer-to-peer systems",
SCHOOL="Yale University",
ADDRESS="New Haven, CT, USA",
MONTH=may,
YEAR=2003,
ABSTRACT="Peer-to-peer systems are distributed systems of heterogeneous machines with
no central authority, that are used for efficient management and location
of shared resources. Such systems have become very popular for Internet
applications in a short period of time because they provide inherent
scalability by distributing the load of maintaining the system across all
the participants. At the same time, they present new challenges in
designing distributed data structures that can provide the desired
functionality such as data availability, dynamic network maintenance and
support for complex queries using untrusted and unreliable components.
We present two complementary distributed data structures that can be used
to implement efficient peer-to-peer systems. The first data structure is
an abstract model of a distributed hash table, which is used as an overlay
network by many contemporary peer-to-peer systems. This data structure
provides inherent load balancing, and a delivery time which is logarithmic
in the number of resources in the system. We study greedy routing in this
model, and prove lower bounds and upper bounds on routing in the presence
of failures in the system. We present some heuristics for constructing the
network and give experimental results on the performance in practice.
We also present a novel distributed data structure called a skip graph,
which is a trie of skip lists that share lower layers. A skip graph
provides most of the functionality of a distributed hash table. In
addition, it supports spatial locality and complex searches such as near
matches to a key, keys within a range or approximate queries. We give
simple and straightforward algorithms to search and insert a new resource
into a skip graph in logarithmic time. We also give a repair mechanism
that can be combined with the fault-tolerance properties to give a strong
foundation for a highly resilient system.",
URL="http://www.cs.yale.edu/homes/shah/html/pubs/thesis.html"
}
@ARTICLE{Shah0306:Analytical,
AUTHOR="A. Shahrabi and L. Mackenzie and Mohamed Ould-Khaoua",
TITLE="An analytical model of wormhole-routed hypercubes under broadcast traffic",
JOURNAL="Performance Evaluation",
VOLUME=53,
NUMBER=1,
PAGES="23-42",
MONTH=jun,
YEAR=2003,
REFERENCES=26,
KEYWORDS="Multicomputers; Interconnection networks; Wormhole routing; Adaptive
routing; Broadcast operation; Performance modelling",
ABSTRACT="A large number of algorithms have been proposed to support collective
communication operations for scalable parallel systems over the past few
years. When proposing a new algorithm for a collective communication
operation, it is critical to determine its precise scope and evaluate it
with accurate modelling of the underlying routing and communication
mechanism. However, there has been comparatively little activity in the
area of analytical models of these operations. As a result, most existing
studies have relied on simulation to evaluate the performance merits of
collective communication algorithms. This paper presents a new analytical
model for predicting unicast and broadcast latency in the wormhole-routed
hypercube. Results obtained through simulation experiments show that the
model exhibits a good degree of accuracy in predicting message latency
under different working conditions.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-481FV37-2-5H\&\_cdi=5663\&\_orig=browse\&\_coverDate=06\%2F30\%2F2003\&\_sk=999469998\&view=c\&wchp=dGLbVtz-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=795b002d14413a435bad82c8450b7bac\&ie=f.pdf"
}
@INPROCEEDINGS{Shak0303:Unreliable,
AUTHOR="Sanjay Shakkottai and R. Srikant and Ness Shroff",
TITLE="Unreliable Sensor Grids: Coverage, Connectivity and Diameter",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We consider an unreliable wireless sensor grid-network with n
nodes placed in a square of unit area. We are interested in the
coverage of the region and the connectivity of the network. We
first show that the necessary and sufficient conditions for the
random grid network to cover the unit square region as well as
ensure that the active nodes are connected are of the form
p(n)r^2(n) ~ log(n)/n, where r(n) is the transmission
radius of each node and p(n) is the probability that a node is
``active'' (not failed). This result indicates that, when n is
large, even if each node is highly unreliable and the transmission
power is small, we can still maintain connectivity with coverage.
We also show that the diameter of the random grid (i.e., the
maximum number of hops required to travel from any active node to
another) is of the order \sqrt{n/log(n)}.
Finally, we derive a sufficient condition for connectivity of the
active nodes (without necessarily having coverage). If the node
success probability p(n) is small enough, we show that connectivity
does not imply coverage.
methods keywords: Stochastic processes/Queueing theory"
}
@ARTICLE{Shak0312:Bounds,
AUTHOR="Sanjay Shakkottai and R. Srikant and Sean Meyn",
TITLE="Bounds on the Throughput of Congestion Controllers in the Presence of
Feedback Delay",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=6,
PAGES="972-981",
MONTH=dec,
YEAR=2003,
REFERENCES=21,
KEYWORDS="delay-differential equations; fairness; Internet congestion control; TCP",
ABSTRACT="We consider decentralized congestion control algorithms for low-loss
operation of the Internet using the ECN bit. There has been much analysis
of such algorithms, but with a few exceptions, these typically ignore the
effect of feedback delays in the network on stability. We study a single
node with many flows passing through it, with each flow (possibly) having
a different round-trip delay. Using a fluid model for the flows, we show
that even with delays, the total data rate at the router is bounded; and
this bound shows that the (peak) total rate grows linearly with increase
in system size, i.e., the fraction of overprovisioning required is
constant with respect to N, the number of flows in the system. Further,
for typical user data rates and delays seen in the Internet today, the
bound is very close to the data rate at the router without delays. Earlier
results by Johari and Tan have given conditions for a linearized model of
the network to be (locally) stable. We show that even when the linearized
model is not stable, the nonlinear model is upper bounded, i.e., the total
rate at the bottleneck link is upper bounded, and the upper bound is close
to the equilibrium rate for TCP.",
URL="http://ieeexplore.ieee.org/iel5/90/28078/01255434.pdf?isNumber=28078\&prod=JNL\&arnumber=1255434\&arSt=+972\&ared=+981\&arAuthor=Shakkottai\%2C+S.\%3B+Srikant\%2C+R.\%3B+Meyn\%2C+S.P."
}
@INPROCEEDINGS{Sham0305:Strongly,
AUTHOR="Gil Shamir",
TITLE="On Strongly Sequential Compression of Sources with Abrupt Changes in
Statistics",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="An asymptotically optimal low-complexity strongly sequential compression
scheme is proposed for universal lossless coding of memoryless sources
with piecewise stationary abruptly changing statistics. The scheme is
shown to achieve the lower bound for this universal coding problem even in
a strongly sequential regime, where the horizon (i.e., the length of the
data sequence to be encoded) is unknown when the algorithm starts to
compress the data. Simulation results support the analytical results."
}
@INPROCEEDINGS{Shan0305:Scheduling,
AUTHOR="Tong Shan and Oliver Yang and Genzao Zhang",
TITLE="Scheduling Jittered {CBR} Traffic in Broadband Wireless Access Systems",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We present two algorithms for transmitting the jittered constant bit rate
(CBR) traffic on the upstream channel in broadband wireless access (BWA)
systems: a calibration algorithm and a scheduling algorithm. The high
priority CBR service class is used to transmit the voice traffic because
of its stringent QoS requirements. Our design is aimed at supporting
stringent QoS requirements and obtaining high utilization of the upstream
bandwidth. Simulation results are presented to demonstrate the
effectiveness of our algorithms in achieving high bandwidth utilization
and the good traffic performance in terms of both cell loss ratio and mean
queuing delay."
}
@ARTICLE{Shan0309:Traffic,
AUTHOR="Tong Shan and Oliver Yang and Genzao Zhang",
TITLE="A traffic scheduling framework in broadband wireless access systems",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=14,
PAGES="1602-1613",
MONTH=sep,
YEAR=2003,
REFERENCES=27,
KEYWORDS="Broadband wireless access; Traffic scheduling; Traffic prediction",
ABSTRACT="In this paper, we present a traffic scheduling framework for allocating the
upstream channel bandwidth in broadband wireless access systems, where both
voice and data applications are supported. Our traffic scheduling framework
is aimed at supporting diverse QoS requirements and obtaining high
utilization of the upstream bandwidth. It prioritizes traffic streams
according to different classes of service, and provides fair access of
bandwidth to the users. The presented framework consists of three
algorithms: a calibration algorithm for the jittered constant bit rate
(CBR) traffic, a scheduling algorithm for the jittered CBR traffic, and a
scheduling algorithm for the unspecified bit rate traffic. The proposed
algorithms are feasible when either the asynchronous transfer mode or
multi-protocol label switching protocol is deployed at the network edge.
Simulation results are presented to demonstrate the effectiveness of our
algorithms in achieving high bandwidth utilization and the good traffic
performance in terms of both cell loss ratio and mean queuing delay.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-4805VF7-7-25\&\_cdi=5624\&\_orig=browse\&\_coverDate=09\%2F01\%2F2003\&\_sk=999739985\&view=c\&wchp=dGLbVtz-zSkWW\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=0e9f8e14e37e73d4e1b1abe4cbe9b2ce\&ie=f.pdf"
}
@INPROCEEDINGS{Shar0305:Average,
AUTHOR="Masoud Sharif and Babak Hassibi",
TITLE="On the Average Power of Multiple Subcarrier Intensity Modulated Optical
Signals: Nehari's Problem and Coding Bounds",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Multiple subcarrier modulation (MSM) is an attractive technique for
optical wireless communication for high speed applications. The main
disadvantage of this scheme is its low average power efficiency which
is an analogous problem to the high peak to mean envelope power ratio
(PMEPR) of multicarrier signals. In this paper, we consider the
achievable
average power reduction of MSM signals by using optimized
reserved carriers and coding methods. Based on Nehari's result we present
a lower bound for the maximum average power of the signal after adding
the reserved carriers. It is shown that the mean value of the average
required power behaves very close to $\sqrt{2n\log{\log{n}}}$ for a BPSK
conetalltion where $n$ is the number of subcarriers.
We then consider finding the optimum values for the carriers and
the effect of having finite bandwidth for reserved carriers.
In the next section, mainly based on recent coding results for
PMEPR of multicarrier signals, we show the existence of very high
rate codes with average power of $\sqrt{n\log{n}}$ for large values
of $n$ and furthermore the existence of codes with non-vanishing to
zero rate and average power of less than $O(\sqrt{n})$ asymptotically."
}
@INPROCEEDINGS{Shar0305:Covergence,
AUTHOR="Vinod Sharma and Naveen {Raj V}",
TITLE="Covergence and Performance Analysis of Godard Family of Blind Equalization
Algorithms",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We obtain the convergence of the Godard family (including SATO and CM
algorithms) in a unified way. Our assumptions are quite realistic: the
channel input can be asymptotically stationary and ergodic, the channel
impulse response is finite and can be stationary, ergodic (this models
fading
channels) and the equalizer length is finite. The noise is i.i.d. The
channel input can be discrete or continuous. Our approach allows us to
approximate the whole trajectory of the equalizer coefficients. This
provides estimates of the rate of convergence and the system performance
(symbol error rate) can be evaluated under transience and steady state."
}
@INPROCEEDINGS{Shar0305:Leveraging,
AUTHOR="Vishal Sharma and Abhimanyu Das and Charles Chen",
TITLE="Leveraging {IP} Signaling and Routing to Manage UPSR-based Transport
Networks",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Abstract - An important requirement in the IP-based control of TDM optical
transport networks is to utilize the in-built protection capabilities of
SONET Unidirectional Path Switched Rings (UPSRs) and automate UPSR
protected path setup in mixed mesh-ring networks. This requires
modifications to existing IP signaling and routing protocols and new
processing rules at the network nodes. In this paper, we leverage IP
routing and signaling techniques and MPLS fast-reroute to accurately
advertise UPSR ring topologies to remote nodes and dynamically establish
UPSR protected paths across a transport network. Our proposal also makes a
NUT1-like feature possible in UPSRs, which allows for efficient utilization
of UPSR protection bandwidth. We achieve this by encoding UPSR specific
information in the Opens Shortest Path First (OSPF) link state
advertisements and in Resource Reservation Protocol (RSVP) signaling
messages. In addition, we modify the signaling and routing state machines
at the nodes to interpret and process this information to perform UPSR
topology discovery and path computation. The uniqueness of our proposals
is that the algorithms and the rules specified in the paper allow for
existing IP-based protocols (such as those within the GMPLS framework,
which currently applies to mesh networks) to be efficiently adapted for
this context, while still achieving our objective of exploiting UPSR
protection capabilities."
}
@INPROCEEDINGS{Shav0303:Big,
AUTHOR="Yuval Shavitt and Tomer Tankel",
TITLE="Big-Bang Simulation for embedding network distances in Euclidean space",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT={Embedding of a graph metric in Euclidean space efficiently and accurately
is an important problem in general with applications in topology
aggregation, closest mirror selection, and application level routing.
We propose a new graph embedding scheme called Big-Bang Simulation (BBS),
which simulates an explosion of particles under force field derived from
embedding error.
BBS is shown to be significantly more accurate, compared to all other
embedding methods including GNP. We report an extensive simulation study
of BBS compared with several known embedding scheme and show its advantage
for distance estimation(as in the IDMaps project), mirror selection and
topology aggregation.
{"}Simulations{"}}
}
@INPROCEEDINGS{Shel0305:Nanoip,
AUTHOR="Zach Shelby and Petri {Mähönen} and Ossi Raivio and Janne {Riihijärvi}
and Pertti Huuskonen",
TITLE="NanoIP: The Zen of Embedded Networking",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper reports on the development of an embedded networking protocol
stack for pervasive embedded devices. Instead of applying TCP/IP (designed
for routing and end-to-end connectivity) to embedded networking, our
boundary conditions are quite different. Instead, the presented protocol
specifically provides embedded networking within local subnets. No routing
is performed, instead a gateway can make nanoIP devices visible to the
global Internet. This configuration provides better scalability, lower
power consumption, and better RAM/ROM usage. The developed single subnet
architecture of nanoIP and additional protocols for pervasive applications
are presented and shortly analyzed."
}
@INPROCEEDINGS{Shen0303:Effective,
AUTHOR="Dongxu Shen and Zhengang Pan and Kai Kit Wong and Victor Li",
TITLE="Effective Throughput: A Unified Benchmark for Pilot-Aided {OFDM/SDMA}
Wireless Communication Systems",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="In this paper, we study the uplink performance of an orthogonal frequency
division multiplexing (OFDM) wireless system where multiple antennas
are utilized at the base station (BS). In such a system, capacity
can be greatly enhanced through spatial division multiple access (SDMA),
so that several users can transmit packets simultaneously to the BS.
The system performance, in terms of the reception of user packets,
is determined by various factors, including packet error rate (PER),
channel estimation, modulation, as well as channel coding. Therefore,
we are motivated to propose a novel concept called \emph{effective
throughput} to characterize the \emph{}capacity available to users
by incorporating all these factors. The effective throughput for a
user can be viewed as the average number of successfully received
data bits in an OFDM symbol after excluding erroneously received packets
and the overheads due to channel estimation and coding. It also directly
relates to the transmission delay of a user packet. The system effective
throughput is the aggregated effective throughput of all users. Simulation
results demonstrate that effective throughput can serve as a useful
and more meaningful benchmark parameter in optimizing system performance."
}
@INPROCEEDINGS{Shen0305:Spectral,
AUTHOR="Hongsan Harry Sheng and Philip Orlik and Alexander Haimovich and Len Cimini
and Jinyun Zhang",
TITLE="On the Spectral and Power Requirements for Ultra-Wideband Transmission",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="UWB systems based on impulse radio have the potential to provide very high
data rates over short distances. In this paper, a new pulse shape is
presented that satisfies the FCC spectral mask. Using this pulse, the link
budget is calculated to quantify the relationship between data rate and
distance. It is shown that UWB can be a good candidate for high rate
transmission over short ranges, with the capability for reliably
transmitting 100 Mbps over distances at about 10 meters."
}
@INPROCEEDINGS{Sheu0305:Wireless,
AUTHOR="Shiann-Tsong Sheu and Jenhui Chen and Hsueh-Wen Tseng",
TITLE="Wireless Switch Protocol",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In IEEE 802.11 infrastructure wireless local area networks (WLAN), all
mobile stations (STAs) are coordinated by an access point (AP), which is a
static device and plays the role of bridge between wired and wireless
networks. Such coordination is achieved by restricting all STAs to access
the channel listened by AP. Within the 2.4GHz unlicensed industry,
science, and medicine (ISM) band defined in the IEEE 802.11 2.4GHz
physical layer (PHY) specifications, three of fourteen channels, which are
independent and exclusive, can be used to transfer data packets at a same
area concurrently. However, in most small/medium enterprize or home
environment, one AP is sufficient for covering whole service area. This
implies that the other two channels' capacity has being wasted by the
single channel operation defined in standard. In order to overcome the
drawback, we propose a new and simple CSMA based media access control
(MAC) protocol, named wireless switch protocol (WSP), for promoting the
IEEE 802.11 aggregate network throughput. This is simply achieved by
allowing any pair of STAs in WLAN to exchange data packets in another idle
channel after they handshake with each other in the common channel, which
is specified by AP. Simulation results show that the total network
throughput of WSP is obviously depending on the time taken by the changing
frequency channel and the intranet and internet traffic distribution, where
the intranet and internet mean the data exchanged between mobile STAs and
between STA and wired host, respectively. If all data packets are intranet
traffic and the traffic load is heavy, the improving ratio of derived
goodput of
proposed WSP and that of the IEEE 802.11 standard approximates 400\%. In
the worse case that all traffic is internet traffic, the proposed WSP
still obtains the similar throughput as that of IEEE 802.11 standard."
}
@ARTICLE{Sheu0309:Bandwidth,
AUTHOR="Tsang-Ling Sheu and Guan-Ying Pao",
TITLE="A bandwidth allocation model for a two-pass {RSVP} setup mechanism",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=14,
PAGES="1662-1672",
MONTH=sep,
YEAR=2003,
REFERENCES=19,
KEYWORDS="Bandwidth allocation; Two-pass with advertising; RSVP; Quality of services;
Markov chains",
ABSTRACT="Traditional one-pass RSVP may encounter a so-called killer reservation
problem (KRP), when more than two reservation requests from different
receivers are merged. Two-pass with advertising (TPWA) mechanism [RSVP
Killer Reservation, Internet Draft, IETF (1999)] is, therefore, presented
to inherently avoid the KRP. In this paper, we present an analytical model
to reasonably allocate bandwidth in TPWA. TPWA issues pre-engaged bandwidth
request at the first pass before effectively reserving bandwidth at the
second pass. Since the pre-engaged bandwidth may be used to deliver
non-QoS traffic before the second pass is actually enforced, allocation of
adequate amount of pre-engaged bandwidth at a router becomes an important
issue. We build a model to analyze the resource allocation in TPWA based
on recursive law and Markov chains. In the model, we are interested in
determining an optimal resource distribution among the pre-engaged
bandwidth, the free bandwidth and the reserved bandwidth under the
influence of the RSVP parameters, including message request rates, session
lifetime, link-state refresh periods, timeout factor, and message loss
probability.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-48KW7G3-1-58\&\_cdi=5624\&\_orig=browse\&\_coverDate=09\%2F01\%2F2003\&\_sk=999739985\&view=c\&wchp=dGLbVtz-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=2b320fccf8eb85c4df50b0bfde3ba524\&ie=f.pdf"
}
@INPROCEEDINGS{Shi0305:Further,
AUTHOR="Jun Shi and Richard Wesel",
TITLE="Further Error Event Diagram Reduction Using Algorithmic Techniques",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Biglieri showed that a diagram with N^2 states can be used to compute the
generating function for any trellis code with N states. Rouanne \&
Costello and Zehavi \& Wolf showed that for quasi-regular trellis codes,
an N-state diagram produces the correct generating function. Schlegel
showed that application of a standard FSM (finite-state-machine)
minimization algorithm reduces quasi-regular trellis code diagram to at
most N states and often reduces the number of states for non-quasi-regular
trellis codes as well. In this paper we show that performing iteratively
both a forward and a backward application of Schlegel's state reduction
operation can further reduce the diagram produced by Schlegel's algorithm.
We also upper bound the maximum required diagram size to be
$\frac{N^2-N}{2}+1$."
}
@INPROCEEDINGS{Shi0310:Proactive,
AUTHOR="Wenzhong Shi and Kawai Kwan and Jiannong Cao",
TITLE="A Proactive Approach for Mobile {GIS}",
BOOKTITLE="VTC 2003 - Data base management in wireless network environments",
DAYS=4,
MONTH=oct,
YEAR=2003,
ABSTRACT="Mobile Geographic Information System is the integrated technology combining
mobile Internet, GIS, and location-based services. However, the immature in
database design is one of the major obstacles for the development. For this
consideration, a new mobile data model is proposed, which is based on a
mobile view of spatio-temporal and attribute model. Correspondingly, a
temporal database is designed in physicality for the implementation on
conceptual model. It is a proactive approach continuously updating the
related spatio-temporal and attribute data according to the real location
of the subscriber and the current time as well. At the end, performance of
the dynamic database is evaluated for wireless GIS web application and
on-line query. The result demonstrates that response speed has been
increased from a quarter to three-quarter using the proactive approach.
The design of this study increases the availability of GIS to the mobile
services from fine-tune the existing database providing the latest
accurate information to subscribers in a limited communication bandwidth
and to improve the response time."
}
@INPROCEEDINGS{Shin0305:Closed,
AUTHOR="Hyundong Shin",
TITLE="Closed-Form Formulas for Ergodic Capacity of {MIMO} Rayleigh Fading
Channels",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We present a new closed-form formula for the ergodic capacity of
multiple-input multi-ple-output (MIMO) wireless channels. Assuming
independent and identically distributed (i.i.d.) Rayleigh flat-fading
between antenna pairs and equal power allocation to each of the transmit
antenna, the channel capacity is expressed in closed form as finite sums
of the exponential integrals which are the special cases of the
complementary incomplete gamma function. Using the well-known asymptotic
behavior of the MIMO capacity, we also give a simple approximate
expression for the channel capacity. Numerical results show that the
approximation is quite accurate for the entire range of average
signal-to-noise ratios."
}
@INPROCEEDINGS{Shon0305:Performance,
AUTHOR="Takashi Shono and Hiroyuki Shiba and Yushi Shirato and Kazuhiro Uehara and
Katsuhiko Araki and Masahiro Umehira",
TITLE="Performance of {IEEE} {802.11} Wireless {LAN} Implemented on Software
Defined Radio with Hybrid Programmable Architecture",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We have successfully fabricated a prototype software defined radio (SDR)
transceiver that supports both Japanese PHS and IEEE 802.11 wireless LAN
(WLAN). In this paper, we design an IEEE 802.11 WLAN around the SDR with
its distributed and heterogeneous hybrid programmable architecture. The
most difficult problem in implementing the WLAN in this way is how to meet
the SIFS requirement in the IEEE 802.11 standard. This paper shows the
hardware and software architecture of the prototype and how it can support
the protocol processing of the IEEE 802.11 WLAN. The hybrid programmable
architecture described in this paper is a sophisticated combination of a
general-purpose microprocessor (CPU), digital signal processors (DSPs),
and programmable hardware (FPGAs). In brief, the MAC layer functions are
executed on the CPU and the PHY layer functions such as MODEM are
processed by the DSP; higher-speed digital signal processes are run on the
FPGA. This paper also describes an experimental evaluation of the prototype
for IEEE 802.11 WLAN use."
}
@INPROCEEDINGS{Shu0303:Pricing,
AUTHOR="Jun Shu and Pravin Varaiya",
TITLE="Pricing Network Services",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We propose a game theoretic pricing mechanism for statistically guaranteed
service in packet-switched networks. The mechanism provides congestion
control, differentiated qualities of service, and efficient resource
allocation. For users, the mechanism offers better quality and lower
price. Service providers can base new service and revenue models within
the mechanism. We apply this mechanism to the Internet."
}
@INPROCEEDINGS{Shu0305:Call,
AUTHOR="Tao Shu and Zhisheng Niu",
TITLE="Call Admission Control for Imperfectly-Power-Controlled Multimedia {CDMA}
Networks Based on Differentiated Outage Probabilities",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="A key problem under imperfect power control in multimedia DS-CDMA networks
is how to guarantee the differentiated outage probabilities of different
traffic classes resulted from the uncertainty of received powers. In
addition, in order to utilize the scarce wireless resource efficiently, as
many users as possible should be admitted into the network while providing
guaranteed quality-of-service support for them. In this work, a call
admission control scheme, Differentiated Outage Probabilities CAC or
DOP-CAC, is proposed to achieve the above goals for imperfectly power
controlled multimedia CDMA networks. Two important features of CDMA system
are considered in our scheme: one is the power multiplexing among bursty
traffics and the other is the power allocation scheme employed at the
physical layer. The validation and efficiency of DOP-CAC are verified by
numerical examples."
}
@INPROCEEDINGS{Shu0305:Capacity,
AUTHOR="Tao Shu and Zhisheng Niu",
TITLE="Capacity Optimization by Using Cancellation-Error-Ascending Decoding Order
in Multimedia {CDMA} Networks with Imperfect Successive Interference
Cancellation",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we study the influence of decoding order on the capacity of
multimedia DS-CDMA systems with imperfect successive interference
cancellation. In contrast to previous studies, cancellation errors are
assumed to be different for different users in this work. For any given
decoding order, we derive the necessary power allocation that guarantee
the QoS of the multimedia traffic. Based on this result, we prove that
instead of by the descending order of data rate as suggested in some
literature, the system capacity is maximized by decoding users according
to the ascending order of cancellation errors. We also prove that this
capacity-optimal decoding order makes total residual interference minimum
at the same time. Our results are verified by numerical example."
}
@INPROCEEDINGS{Shu0305:Channel,
AUTHOR="Tao Shu and Zhisheng Niu",
TITLE="A Channel-Adaptive and Throughput-Efficient Scheduling Scheme in Voice/Data
{DS-CDMA} Networks with Constrained Transmission Power",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we study the throughput optimization of data traffic for a
power-constrained voice/data CDMA system by the scheduling of data users.
It is found that under a given received power budget and the constraints
of transmission powers, the throughput of data traffic is maximized by
selecting simultaneous data users and allocating powers according to the
descending order of their received power capabilities, which is defined as
the product between the transmission power limit and the channel gain.
Based on this principle, a novel dynamic and channel-adaptive scheduling
scheme is proposed to enhance the throughput performance of data traffic.
The validity of the proposed scheme and its robustness to channel
estimation error is verified by comparing with the conventional
fair-sharing scheme and round-robin scheme via computer simulation."
}
@INPROCEEDINGS{Shu0305:Wireless,
AUTHOR="Yantai Shu and Oliver Yang and Minfang Yu and Jiakun Liu",
TITLE="Wireless Traffic Modeling and Prediction Using Seasonal {ARIMA} Models",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Seasonal ARIMA model is a good traffic model capable of capturing the
behavior of a network traffic stream. In this paper, we give a general
expression of seasonal ARIMA models with two periodicities and provide
procedures to model and to predict traffic using seasonal ARIMA models.
Our feasibility-study experiments showed that seasonal ARIMA models could
be used to model and to predict actual wireless traffic such as GSM
traffic in China."
}
@INPROCEEDINGS{Siac0303:Efficient,
AUTHOR="Stavroula Siachalou and Leonidas Georgiadis",
TITLE="Efficient QoS Routing",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We consider the problem of routing in a network where QoS constraints are
placed on network traffic. We provide two optimal algorithms that are
based on determining the discontinuities of functions related to the
optimization at hand. The proposed algorithms have pseudopolynomial worst
case running time and for a wide variety of tested networks they have
fairly satisfactory running times. They perform significantly better than
the algorithm based on the direct application of the Dynamic Programming
equations and can also be used in conjunction with known polynomial-time
approximation algorithms to provide good average case behavior, in
addition to guaranteeing polymonial worst-case running time."
}
@INPROCEEDINGS{Sich0305:Novel,
AUTHOR="Atousa Sichani and Hussein Mouftah",
TITLE="A Novel Distributed Progressive Reservation Protocol for {WDM} All-optical
Networks",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we propose and describe a new distributed reservation
protocol for establishing lightpaths in WDM all-optical networks.
Distributed control mechanisms are preferred and employed because of their
advantages over centralized ones to set up virtual channels. The new
protocol is a combination of the conservative and aggressive backward
reservation protocols, which attempts to improve performance by adapting a
reservation to network conditions and characters. On the one hand, the new
protocol uses network circumstances and decides and applies a more
conservative or aggressive approach. In other words, the protocol
progressively fluctuates between those reservation protocols in order to
capture their respective advantages. As a result, in extreme cases it acts
exactly like either the conservative or the aggressive reservation
protocol. On the other hand, it considers the characteristics of a network
to set a retry-list size. As a result, a retry-list size is not determined
by a fixed number but modified based on the multiplexing degree of a
network, which prevents imposing ineffective retries on a network with a
small number of wavelengths and instead encourages more retries for a
network with numerous channels. Therefore, the proposed protocol
transforms the static nature of existing reservation protocols into a more
adaptive one in order to enhance network performance."
}
@ARTICLE{Sich0308:Effect,
AUTHOR="Mihail Sichitiu and Peter Bauer and Kamal Premaratne",
TITLE="The Effect of Uncertain Time-Variant Delays in {ATM} Networks With Explicit
Rate Feedback: A Control Theoretic Approach",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=4,
PAGES="628-637",
MONTH=aug,
YEAR=2003,
REFERENCES=27,
ABSTRACT={A new, more realistic model for the available bit rate traffic class in ATM
network congestion control with explicit rate feedback is introduced and
analyzed. This model is based on recent results by M.M. Ekanayake
({"}Robust stability of discrete time nonlinear systems{"}, Ph.D.
dissertation, Univ. Miami, Coral Gables, FL, 1999) regarding discrete time
models for time-variant delays. The discrete time model takes into account
the effect of time-variant buffer occupancy levels of ATM switches, thus
treating the case of time-variant delays between a single congested node
and the connected sources. For highly dynamic situations, such a model is
crucial for a valid analysis of the resulting feedback system. The new
model also handles the effects of the mismatch between the resource
management cell rates and the variable bit rate controller sampling rate
as well as buffer and rate nonlinearities. A brief stability study shows
that an equilibrium in the buffer occupancy is impossible to achieve in
the presence of time-variant forward path delays. Stability conditions for
the case of time-variant delays in the return path are presented. Finally,
illustrative examples are provided.},
URL="http://ieeexplore.ieee.org/iel5/90/27488/01224461.pdf?isNumber=27488\&prod=JNL\&arnumber=1224461\&arSt=+628\&ared=+637\&arAuthor=Sichitiu\%2C+M.L.\%3B+Bauer\%2C+P.H.\%3B+Premaratne\%2C+K."
}
@ARTICLE{Siga0308:Power,
AUTHOR="Georgos Siganos and Michalis Faloutsos and Petros Faloutsos and Christos
Faloutsos",
TITLE="Power Laws and the AS-Level Internet Topology",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=4,
PAGES="514-524",
MONTH=aug,
YEAR=2003,
REFERENCES=61,
KEYWORDS="network modeling; power laws",
ABSTRACT="We study and characterize the topology of the Internet at the autonomous
system (AS) level. First, we show that the topology can be described
efficiently with power laws. The elegance and simplicity of the power laws
provide a novel perspective into the seemingly uncontrolled Internet
structure. Second, we show that power laws have appeared consistently over
the last five years. We also observe that the power laws hold even in the
most recent and more complete topology with correlation coefficient above
99\% for the degree-based power law. In addition, we study the evolution
of the power-law exponents over the five-year interval and observe a
variation for the degree-based power law of less than 10\%. Thirdly, we
provide relationships between the exponents and other topological metrics.",
URL="http://ieeexplore.ieee.org/iel5/90/27488/01224452.pdf?isNumber=27488\&prod=JNL\&arnumber=1224452\&arSt=+514\&ared=+524\&arAuthor=Siganos\%2C+G.\%3B+Faloutsos\%2C+M.\%3B+Faloutsos\%2C+P.\%3B+Faloutsos\%2C+C."
}
@ARTICLE{Sikd0312:Analytic,
AUTHOR="Biplab Sikdar and Shivkumar Kalyanaraman and Kenneth Vastola",
TITLE="Analytic Models for the Latency and Steady-State Throughput of {TCP} Tahoe,
Reno, and {SACK}",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=6,
PAGES="959-971",
MONTH=dec,
YEAR=2003,
REFERENCES=20,
KEYWORDS="modeling; performance evaluation; retransmission timeouts; TCP",
ABSTRACT="Continuing the process of improvements made to TCP through the addition of
new algorithms in Tahoe and Reno, TCP SACK aims to provide robustness to
TCP in the presence of multiple losses from the same window. In this paper
we present analytic models to estimate the latency and steady-state
throughput of TCP Tahoe, Reno, and SACK and validate our models using both
simulations and TCP traces collected from the Internet. In addition to
being the first models for the latency of finite Tahoe and SACK flows, our
model for the latency of TCP Reno gives a more accurate estimation of the
transfer times than existing models. The improved accuracy is partly due
to a more accurate modeling of the timeouts, evolution of cwnd during slow
start and the delayed ACK timer. Our models also show that, under the
losses introduced by the droptail queues which dominate most routers in
the Internet, current implementations of SACK can fail to provide adequate
protection against timeouts and a loss of roughly more than half the
packets in a round will lead to timeouts. We also show that with
independent losses SACK performs better than Tahoe and Reno and, as losses
become correlated, Tahoe can outperform both Reno and SACK.",
URL="http://ieeexplore.ieee.org/iel5/90/28078/01255433.pdf?isNumber=28078\&prod=JNL\&arnumber=1255433\&arSt=+959\&ared=+971\&arAuthor=Sikdar\%2C+B.\%3B+Kalyanaraman\%2C+S.\%3B+Vastola\%2C+K.S."
}
@ARTICLE{Simm0302:Towards,
AUTHOR="Rob Simmonds and Brian Unger",
TITLE="Towards scalable network emulation",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=3,
PAGES="264-277",
MONTH=feb,
YEAR=2003,
REFERENCES=34,
KEYWORDS="Network Emulation; Parallel computing; Scalability",
ABSTRACT="The Internet protocol traffic and network emulator (IP-TNE) enables real
hosts and a real network to interact with a virtual network. It combines a
real-time network simulator with a mechanism to capture packets from and
write packets to a real network. Packets generated by external hosts
interact with synthetic traffic within the virtual network, providing a
controlled environment for testing real Internet applications. IP-TNE can
also generate simulated traffic internally enabling its use as a
sophisticated workload generator for stress testing real Web servers.
This paper focuses on two issues related to the scalability of network
emulators, such as IP-TNE. The scalability of the virtual network within
the emulator and the scalability of the real-time I/O interface used to
interoperate with the physical network. For the scalability of the virtual
network, parallel discrete event simulation techniques are employed. The
scalability of the real-time interfaces requires handling varying amounts
of network I/O and mapping packets into the simulator efficiently.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-469GTRG-1-K\&\_cdi=5624\&\_orig=browse\&\_coverDate=02\%2F15\%2F2003\&\_sk=999739996\&view=c\&wchp=dGLbVlb-zSkzS\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=fae6c9bb6411f007dd1d2cf87327349f\&ie=f.pdf"
}
@INPROCEEDINGS{Simo0305:Average,
AUTHOR="Marvin Simon and Mohamed-Slim Alouini",
TITLE="Average Bit Error Probability for Optimum Diversity Combining of
Noncoherent {FSK} over Rayleigh Fading Channels",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We derive the performance of the optimum noncoherent FSK diversity
combining receiver and compare it with that which implements the
more traditional noncoherent postdetection equal gain combining
scheme to reveal the degree of suboptimality of the latter."
}
@INPROCEEDINGS{Simo0305:Multiple,
AUTHOR="Marvin Simon",
TITLE="Multiple Bit Differential Detection of Offset Quadrature Phase-Shift-Keying",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Analogous to multiple symbol differential detection of quadrature
phase-shift-keying (QPSK), a multiple bit differential detection scheme is
described for offset QPSK that also exhibits continuous improvement in
performance with increasing observation interval. Being derived from
maximum-likelihood (ML) considerations, the proposed scheme is purported
to be the most power efficient scheme for such a modulation and detection
method. Extension of the results to shaped offset QPSK is also possible."
}
@INPROCEEDINGS{Sing0305:Integrating,
AUTHOR="Kundan Singh and Ajay Nambi and Henning Schulzrinne",
TITLE="Integrating VoiceXML with {SIP} services.",
BOOKTITLE="ICC 2003 - Global Services and Infrastructure for Next Generation Networks",
ADDRESS="Anchorage, Alaska",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We describe our Session Initiation Protocol (SIP)-based VoiceXML browser,
sipvxml, that allows programming inter active voice response applications
that are accessible from telephones as well as IP phones. We also describe
how we have used sipvxml in our multi-party multimedia conferencing server.
We propose other applications and extensions
that can benefit from this technology in our IP telephony test bed."
}
@INPROCEEDINGS{Sing0305:Protecting,
AUTHOR="Narendra Singhal",
TITLE="Protecting a Multicast Session Against Single Link Failures in a Mesh
Network",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this report, we investigate approaches and algorithms for establishing a
multicast session in a mesh network
while protecting the session against any single link failure, e.g., a
fiber cut in an optical network. We propose two new and
efficient approaches for protecting a multicast session: 1) segment
protection
in which we protect each segment in the primary tree separately (rather
than the entire tree) and allow these backup
segments to share arcs with the other existing primary and backup
segments; and 2) path-pair protection in which we protect
a path between each source-destination pair by finding a disjoint backup
path. Unlike previous
schemes such as finding link-disjoint trees and arc-disjoint trees, our
new schemes 1) guarantee a solution
where previous schemes fail and 2) find efficient solution requiring less
network resources. Our algorithm,
based on the path-pair protection scheme, called optimal path-pair-based
shared disjoint paths (OPP\_SDP) algorithm,
finds a solution if such a solution exists and outperforms all the other
schemes in terms of network cost.
We also show that OPP\_SDP performs close to the optimal solution obtained
by solving a mathematical formulation
of the problem expressed as an Integer Linear Program (ILP)."
}
@TECHREPORT{Sing0312:Comprehensive,
AUTHOR="Kundan Singh and Xiaotao Wu and Jonathan Lennox and Henning Schulzrinne",
TITLE="Comprehensive Multi-platform Collaboration",
INSTITUTION="Dept. of Computer Science, Columbia University",
NUMBER="CUCS-027-03",
ADDRESS="New York, New York",
MONTH=dec,
YEAR=2003,
KEYWORDS="CINEMA; packet audio; packet video; multimedia conferencing; collaboration
tools; SIP",
ABSTRACT="We describe the architecture and implementation of our comprehensive
multi-platform collaboration
framework known as Columbia InterNet Extensible Multimedia Architecture
(CINEMA). It provides a
distributed architecture for collaboration using synchronous
communications like multimedia conferenc-
ing, instant messaging, shared web-browsing, and asynchronous
communications like discussion forums,
shared les, voice and video mails. It allows seamless integration with
various communication means
like telephones, IP phones, web and electronic mail. In addition, it
provides value-added services such as
call handling based on location information and presence status. The paper
discusses the media services
needed for collaborative environment, the components provided by CINEMA
and the interaction among
those components.",
URL="http://www1.cs.columbia.edu/~library/TR-repository/reports/reports-2003/cucs-027-03.pdf"
}
@INPROCEEDINGS{Sinh0306:Loss,
AUTHOR="Rishi Sinha and Christos Papadopoulos and Chris Kyriakakis",
TITLE="Loss Concealment for Multi-Channel Streaming Audio",
BOOKTITLE="ACM NOSSDAV 2003",
ADDRESS="Monterey, California, USC",
DAYS=1,
MONTH=jun,
YEAR=2003,
ABSTRACT="With the advent of high-speed networks such as Internet II, high quality
uncompressed multichannel transmission of audio streams has become
possible. For interactive applications, such as a distributed musical
performace, minimizing latency is of paramount importance. Given the
strict latency requirements, error recovery (via either retransmission
or FEC) may not always be successful, and thus concealment is frequently
required.
In this paper we investigate several concealment algorithms
for multi-channel, CD-quality, uncompressed audio streams, with
particular emphasis on an experimental 10.2 audio standard, which
provides an immersive experience for the audience and the players in a
performance. We focus on interactive applications, thus we investigate
concealment techniques that can be performed in real time. We identify
the main problems and investigate variants of stitching, interpolation
and substitution using fast approximation to preserve the spectral
characteristics and volume of the missing audio segments. Our algorithms
are implemented in a protocol over UDP in a testbed capable of streaming
up to 26 uncompressed audio channels with end to end latency of less
than 6ms. Initial results show great improvement even with burst loss,
without any sacrifice in latency. We expect that our protocol will become
an important part of a distributed immersive musical performance system
currently being developed at our university."
}
@ARTICLE{Siri0303:Service,
AUTHOR="Vasilios Siris and Costas Courcoubetis and George Margetis",
TITLE="Service differentiation and performance of weighted window-based congestion
control and packet marking algorithms in {ECN} networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=4,
PAGES="314-326",
MONTH=mar,
YEAR=2003,
REFERENCES=28,
KEYWORDS="Service differentiation; Congestion control; Active queue management;
Explicit congestion notification",
ABSTRACT="We investigate the service differentiation, in terms of average throughput,
and the performance achieved using weighted window-based congestion control
in networks supporting Explicit Congestion Notification (ECN). Our results
show how service differentiation, queueing delay, and average throughput
are affected by the increase and decrease rules of the end-system
congestion control algorithms, and how they depend on the marking
algorithms operating in the routers. The end-system algorithms we
investigate include Willingness-To-Pay (willingness-to-pay) and MulTCP
congestion control, and the packet marking algorithms include RED, virtual
queue marking, and load-based marking. Our investigations consider both
single and multiple link topologies, and connections with different round
trip times.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-46RMXYC-1-69\&\_cdi=5624\&\_orig=browse\&\_coverDate=03\%2F01\%2F2003\&\_sk=999739995\&view=c\&wchp=dGLbVtz-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=1be9e473f1aa9bb860130e489de09aa8\&ie=f.pdf"
}
@INPROCEEDINGS{Siso0305:Preferred,
AUTHOR="Rajendra Sisodia and Karthigeyan Illancheran and Manoj Bs and Siva Ram
Murthy",
TITLE="A Preferred Link Based Multicast Protocol for Wireless Mobile Ad hoc
Networks",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Existing multicast routing protocols for Mobile Ad hoc Networks can be
broadly classified into two categories, tree based protocols and mesh
based protocols. Mesh based protocols have high packet delivery ratio
compared to tree based protocols, but incur more control overhead. The
packet delivery ratio of tree based protocols decreases with increasing
mobility. This is due to the occurence of frequent tree breaks and lack of
proper tree maintenance mechanisms. These tree breaks result in frequent
flooding of JoinQuery packets by the multicast group member nodes which
try to get re-connected to the tree. These broadcast packets collide with
data packets and reduce the efficiency of the protocol. We propose an
efficient protocol which we call as Preferred Link Based Multicast
protocol (PLBM). PLBM uses a preferred link approach for forwarding
JoinQuery packets. A subset of neighbors of a node are selected using a
preferred link based algorithm. These nodes, termed as preferred nodes,
are only eligible for further forwarding of JoinQuery packets. We also
propose a quick link break detection mechanism that locally repairs broken
links. Simulation results show that our protocol performs better than other
existing multicast protocols in terms of packet delivery ratio and control
overhead."
}
@ARTICLE{Skli0309:Framework,
AUTHOR="M. Sklira and A. Pomportsis and M. Obaidat",
TITLE="A framework for the design of bank communications systems",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=15,
PAGES="1775-1781",
MONTH=sep,
YEAR=2003,
REFERENCES=11,
KEYWORDS="Electronic banking; Bank communications systems; High availability; Traffic
prioritization; Security",
ABSTRACT="The development of electronic financial markets is moving rapidly. Banks
are moving towards electronic banking in order to gain a prominent place
in the emerging electronic world. The development of a robust and secure
communications infrastructure is a key factor to building up an electronic
banking system. In this paper, a framework is provided for the design of
bank communications systems. The key issues of high availability, traffic
prioritization and security are discussed and a framework is presented for
the design of bank communications systems that focuses on these issues.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47YXW9F-3-7\&\_cdi=5624\&\_orig=browse\&\_coverDate=09\%2F22\%2F2003\&\_sk=999739984\&view=c\&wchp=dGLbVtb-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=48684d02962462369412fa0bf6b31ad0\&ie=f.pdf"
}
@ARTICLE{Smar0307:EELRU,
AUTHOR="Yannis Smaragdakis and Scott Kaplan and Paul Wilson",
TITLE="The {EELRU} adaptive replacement algorithm",
JOURNAL="Performance Evaluation",
VOLUME=53,
NUMBER=2,
PAGES="93-123",
MONTH=jul,
YEAR=2003,
REFERENCES=22,
KEYWORDS="Replacement algorithms; LRU; Memory management; Virtual memory",
ABSTRACT="The wide performance gap between processors and disks ensures that
effective page replacement remains an important consideration in modern
systems. This paper presents early eviction LRU (EELRU), an adaptive
replacement algorithm. EELRU uses aggregate recency information to
recognize the reference behavior of a workload and to adjust its speed of
adaptation. An on-line cost/benefit analysis guides replacement decisions.
This analysis is based on the LRU stack model (LRUSM) of program behavior.
Essentially, EELRU is an on-line approximation of an optimal algorithm for
the LRUSM. We prove that EELRU offers strong theoretical guarantees of
performance relative to the LRU replacement algorithm. EELRU can never be
more than a factor of 3 worse than LRU, while in a common best case it can
be better than LRU by a large factor (proportional to the number of pages
in memory).
The goal of EELRU is to provide a simple replacement algorithm that adapts
to reference patterns at all scales. Thus, EELRU should perform well for a
wider range of programs and memory sizes than other algorithms. Practical
experiments validate this claim. For a large number of programs and wide
ranges of memory sizes, we show that EELRU outperforms LRU, typically
reducing misses by 1030\%, and occasionally by much moresometimes by a
factor of 210. It rarely performs worse than LRU, and then only by a small
amount.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-481MYH2-2-59\&\_cdi=5663\&\_orig=browse\&\_coverDate=07\%2F31\%2F2003\&\_sk=999469997\&view=c\&wchp=dGLbVtz-zSkzS\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=7411fc2419b2d62f4e1f0c71a55b19b3\&ie=f.pdf"
}
@TECHREPORT{Smit0303:Complex,
AUTHOR="Jeffrey Smith",
TITLE="Complex Systems",
TYPE="arXiv",
MONTH=mar,
YEAR=2003,
ABSTRACT="The study of Complex Systems is considered by many to be a new scientific
field, and is distinguished by being a discipline that has applications
within
many separate areas of scientific study. The study of Neural Networks,
Traffic
Patterns, Artificial Intelligence, Social Systems, and many other
scientific
areas can all be considered to fall within the realm of Complex Systems,
and
can be studied from this new perspective. The advent of more capable
computer
systems has allowed these systems to be simulated and modeled with far
greater
ease, and new understanding of computer modeling approaches has allowed
the
fledgling science to be studied as never before.
The preliminary focus of this paper will be to provide a general
overview of
the science of Complex Systems, including terminology, definitions,
history,
and examples. I will attempt to look at some of the most important trends
in
different areas of research, and give a general overview of research
methods
that have been used in parallel with computer modeling. Also, I will
further
define the areas of the science that concern themselves with computer
modeling
and simulation, and I will attempt to make it clear why the science only
came
into its own when the proper modeling and simulation tools were finally
available. In addition, although there seems to be general agreement
between
different authors and institutes regarding the generalities of the study,
there
are some differences in terminology and methodology. I have attempted in
this
paper to bring as many elements together as possible, as far as the scope
of
the subject is concerned, without losing focus by studying Complex System
techniques that are bound to one particular area of scientific study,
unless
that area is that of computer modeling.",
URL="http://arXiv.org/abs/cs/0303020"
}
@INPROCEEDINGS{Smit0305:Generalised,
AUTHOR="David Smith",
TITLE="Generalised Space-Time Modelling of the {MIMO} channel applied to analysing
and optimising transmit antenna configurations",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="For the purposes of macroscopic system design a space-time Rayleigh fading
multiple-input multiple-output (MIMO) radio Channel
is modelled for an arbitrary transmit antenna configuration of three to
six transmit antennas. A traditional ring of scatterers
model is used to generate the space-time cross correlations and thence
flat fading channel distortions. A general trend is demonstrated
for a specific non-coherent modulation scheme where the optimality of
different transmission frame lengths can be related to the well known
autocorrelation function; based on this trend two frame lengths are chosen
for MIMO channel model analysis. Several beneficial arbitrary transmit
antenna configurations are obtained from this analysis using some typical
arbitrary configurations, and some initial optimisation using a genetic
algorithm, from which further possible optimisation is proposed."
}
@ARTICLE{Smit0305:M,
AUTHOR="James T. Smith",
TITLE="M/G/c/K blocking probability models and system performance",
JOURNAL="Performance Evaluation",
VOLUME=52,
NUMBER=4,
PAGES="237-267",
MONTH=may,
YEAR=2003,
REFERENCES=28,
KEYWORDS="M/G/c/K; Blocking probability; Approximations",
ABSTRACT="An exact solution for the M/G/c/K model is only possible for special cases,
such as exponential service, a single server, or no waiting room at all.
Instead of basing the approximation on an infinite capacity queue as is
often the case, an approximation based on a closed-form expression
derivable from the finite capacity exponential queue is presented.
Properties of the closed-form expression along with its use in
approximating the blocking probability of M/G/c/K systems are discussed.
Extensive experiments are provided to test and verify the efficacy of our
approximate results.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-47MSP9N-1-7S\&\_cdi=5663\&\_orig=browse\&\_coverDate=05\%2F31\%2F2003\&\_sk=999479995\&view=c\&wchp=dGLbVlz-zSkzk\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=f1ad1775210527acdbc9d0e60d266398\&ie=f.pdf"
}
@INPROCEEDINGS{Smit0305:Tandem,
AUTHOR="Paxton Smith and Peter Kabal and Maier Blostein and Rafi Rabipour",
TITLE="Tandem-Free Operation for VoIP Conference Bridges",
BOOKTITLE="ICC 2003 - Global Services and Infrastructure for Next Generation Networks",
ADDRESS="Anchorage, Alaska",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Traditional telephone conferencing has been accomplished by
way of a centralized conference bridge. The tandem arrangement
of high compression speech codecs in conventional VoIP conference
bridges lead to speech distortions and require a substantial
number of computations. Decentralized architectures avoid the
speech degradations and delay, but lack strong control and depend
on silence suppression to make the endpoint bandwidth and
processing requirements scalable. One solution is to use centralized
speaker selection and forwarding, and decentralized decoding
and mixing. This approach eliminates the problem of tandem
encodings but maintains centralized control, thereby improving
the speech quality and scalability of the conference. This paper
considers design options and solutions for this model in the context
of modern IP telephony networks. Performance was evalu-ated
with real conferees over live conferences using a PC-based
conferencing test bed, built using a custom software-based bridge
and a third-party endpoint. Conferees strongly preferred the
speech quality of the new arrangement to that of a conventional
VoIP conference bridge."
}
@INPROCEEDINGS{Song0305:Adaptive,
AUTHOR="Jeonghwa Song",
TITLE="Adaptive Load Distribution over Multipath in {MPLS} Networks",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The emergence of MultiProtocol Label Switching (MPLS) with its efficient
support of explicit routing provides basic mechanisms for facilitating
traffic engineering. Exploiting this capability of MPLS, we propose an
adaptive multipath traffic engineering mechanism named LDM(Load
Distribution over Multipath). The main goal of LDM is to enhance the
network utilization as well as the network performance by adaptively
splitting traffic load among multiple paths. LDM takes a pure dynamic
approach not requiring any a priori traffic load statistics. Routing
decisions are made at the flow level, and traffic proportioning reflects
both the length and the load of a path. LDM also dynamically selects a few
good Label Switched Paths (LSPs) according to the state of the entire
network. We use simulation to compare the performance of LDM with the
performance of several representative dynamic load distribution approaches
as well as the traditional static shortest path only routing. The numerical
results show that LDM outperforms the compared approaches in both the
blocking ratio as well as the performance of the accepted traffic flows."
}
@INPROCEEDINGS{Song0305:Decision,
AUTHOR="Aijun Song and Xiang-Gen Xia",
TITLE="Decision Feedback Differential Detection for Differential Orthogonal
Space-Time Modulation with {APSK} Signals over Frequency-non-Selective
Fading Channels",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Differential orthogonal space-time modulation (DOSTM)
with amplitude/phase shift keying (APSK) signals
has been recently proposed to improve the throughput
of the DOSTM with phase shift keying (PSK) signals over quasi-static
channels. In this paper,
decision feedback differential detection (DF-DD) based on linear
prediction is presented for the DOSTM with APSK Signals (DOSTM-APSK)
over frequency-non-selective fading channels.
The proposed DF-DD offers better performance than
the DD when the channel experiences fast fading.
The coefficients of the linear prediction based DF-DD
can be obtained by an adaptive RLS algorithm,
where the channel statistics is not needed.
The proposed DF-DD is also applicable to the general
unitary differential space-time modulation (DSTM)."
}
@INPROCEEDINGS{Song0305:New,
AUTHOR="Liang Song and Bo Hu and Rueywen Liu and Xie-Ting Ling",
TITLE="A New Multiplex-Access Scheme based on the Diversity of Autocorrelation",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Based on a new diversity, the diversity of autocorrelation, a new
multiplex-access scheme, called A-CDMA, is presented here. Like WCDMA, it
packs high-density information into transmitted signals. Unlike WCDMA, it
can block all the ISI and MAI completely under all noise level! The
simulation supports the theory and shows that the total interference due
to ISI and MAI is reduced to 1\% when SNR varies from 1 to 11. By
comparison, it outperforms WCDMA by a factor of 9 in the reduction of ISI
and MAI. Its overall performance, as measured by BER, is better than
WCDMA in general, and by 10-20 db when SNR ranges from 9dB to 11dB."
}
@INPROCEEDINGS{Soui0305:Achievable,
AUTHOR="Younes Souilmi and Raymond Knopp",
TITLE="On the Achievable Rates of Ultra-Wideband {PPM} with Non-Coherent Detection
in Multipath Environments",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this work we investigate the achievable rates of an ultra-wideband
system using a general M-ary pulse position modulation (PPM) with
non-coherent receiver over a fading channel consisting of finite number
of time-varying paths. We will show that the achieved information rates,
in the ultra-wideband regime, are close to the wideband capacity for
bandwidths below 2GHz and short delay spread values. We will also show
that lower order orthogonal modulation suffers significant loss in
information rate compared to the general non-orthogonal M-ary modulation,
and that the use of hard decisions prior to decoding leads to
excessively large performance losses."
}
@INPROCEEDINGS{Sowd0305:Impact,
AUTHOR="Brad Sowden and Kevin Sowerby",
TITLE="The Impact of Traffic Type on the Propagation Dependent Performance of a
{CDMA} System",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper examines the impact of a traffic stream's statistical
properties
on the propagation dependent performance of a CDMA system. Traffic in a
CDMA
system directly affects the amount of interference in the wireless channel
and therefore the level of traffic corruption. We evaluate a typical
outdoor
3G CDMA cellular deployment. System performance is compared using three
diverse traffic types with a variety of propagation conditions and system
configurations. It is shown that propagation dependent performance is
generally insensitive to the statistical properties of the traffic stream.
Only with non-hostile propagation conditions and low traffic loads is
there a
significant performance difference, in which case the more variable
traffic
results in inferior performance. This suggests that accurate traffic
modelling is generally not necessary when dimensioning the propagation
aspects of a CDMA system. A simplistic and convenient traffic model will
usually be sufficient."
}
@INPROCEEDINGS{Spag0305:Tcp,
AUTHOR="Phil Spagnolo and Thomas Henderson and Jae Kim and Gerald Michael",
TITLE="{TCP} Gateway Design Considerations for Satellite Link Blockage Mitigation",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We study the performance of TCP over a satellite link, in which the
satellite link is subject to intermittent blockages. Our simulation-based
study characterizes the performance degradation of transferring files
ranging from small web objects to large files over satellite channels with
various blockage statistics. Using a split connection gateway, we
investigate the impact of trying to preserve TCP end-to-end semantics upon
connection close and find that such an approach significantly reduces the
ability of small TCP transfers to survive a long duration blockage. We
show that by tying the satellite gateways offered window to the space in
the send buffer on the satellite side, and by quickly responding when the
satellite link becomes available, the split-connection gateway can
essentially eliminate the delay incurred waiting for the TCP persist timer
to expire. Lastly, we contrasted four satellite network configurations
that led to key design considerations for satellite gateways operating
over intermittently blocked channels."
}
@INPROCEEDINGS{Spen0305:Power,
AUTHOR="Jason Spencer and Lionel Sacks",
TITLE="On Power-Laws in {SDH} Transport Networks",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="It is has been previously demonstrated [4] that Internet topologies which
were once considered unstructured networks with no global design processes
actually follow power-laws, both at the router level and the AS (Autonomous
System) domain level. This discovery has very wide implications on network
research as well as network and protocol design. The Internet is not the
only network instance to exhibit power laws however; in this paper we
present evidence for similar power laws also existing in transport layer
topologies; in this case a real world deployed SDH (Synchronous Digital
Hierarchy) network. The existence of such traits is unexpected as
transport technologies are planned and engineered, in contrast to the
rather looser planning and dynamic routing of the Internet. SDH networks
are globally designed with multiple hierarchical levels and a specific
structure, whereas the Internet is a growing collection of networks under
independent control. Data is presented to demonstrate the conformance to
power laws of the SDH network, the possible effects of the physical layer
and the extent to which the topology remains scale-free throughout the
network?s hierarchy. The possible sources of the traits are discussed and
contrasted to those hypothesised for the Internet."
}
@INPROCEEDINGS{Spit0303:Integrating,
AUTHOR="Stephen Spitler and Daniel Lee",
TITLE="Integrating effective-bandwidth-based QoS routing and best effort routing",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="A methodology is presented for integrating effective-bandwidth-based
routing for QoS-sensitive traffic and datagram routing of the
best-effort traffic. To prevent excessive delays of best-effort
traffic in a network domain, we develop (1) a constraint, stated in
the form of a residual link bandwidth, and (2) a cost function for
application to routing of QoS connections. Link-based and path-based
problem formulations and algorithms are presented. For the case that
a cost quantization condition holds, we develop an efficient
implementation of a link-based routing strategy that first minimizes
a QoS cost, then secondarily minimizes a best-effort cost. The
performance of this approach is further enhanced by explicitly
accounting for the difference between the effective bandwidth and the
average bandwidth of traffic. Simulation results illustrate the
application of our BE-friendly method to an algorithm for path
routing with restoration."
}
@INPROCEEDINGS{Spyr0305:Capacity,
AUTHOR="Thrasyvoulos Spyropoulos and Cauligi Raghavendra",
TITLE="Capacity Bounds for Ad hoc Networks Using Directional Antennas",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Directional antennas can be useful in significantly increasing the capacity
of wireless ad hoc networks. With directional antennas, independent
communications between nodes can occur in parallel, even if the nodes are
within range of each other. However, mutual interference by simultaneous
transmissions limits the maximum number of such concurrent communications.
Furthermore, it poses bounds on the amount of capacity gain one can achieve
by using directional antennas instead of omni-directional ones. These
bounds depend on the specific antenna type and its parameters, as well as
higher layer protocol requirements. In this paper we calculate
interference-based capacity bounds for a generic antenna model as well as
a real-world antenna model and analyze how these bounds are affected by
important antenna parameters like gain and beam-width."
}
@INPROCEEDINGS{Srid0303:Achieving,
AUTHOR="Ashwin Sridharan and Roch Guerin and Christophe Diot",
TITLE="Achieving Near-Optimal Traffic Engineering Solutions for Current
{OSPF/IS-IS} Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Traffic engineering is aimed at distributing traffic so as to
``optimize'' a given performance criterion. The ability to carry out
such an optimal distribution depends on both the routing protocol and
the forwarding mechanisms in use in the network. In IP networks
running the OSPF or IS-IS protocols, routing is over shortest paths,
and forwarding mechanisms are constrained to distributing traffic
uniformly over equal cost shortest paths. These constraints
often make achieving an optimal distribution of traffic impossible.
In this paper, we propose and evaluate an approach, based on
manipulating the set of next hops for routing prefixes, that is capable of
realizing near optimal traffic distribution without any change to
existing routing protocols and forwarding mechanisms. In addition, we
explore the trade-off that exists between performance and the overhead
associated with the additional configuration steps that our solution
requires. The paper's contributions are in formulating and evaluating
an approach to traffic engineering for existing IP networks that
achieves performance levels comparable to that offered when deploying
other forwarding technologies such as MPLS.
Method Keywords: Mathematical Programming/Optimization"
}
@ARTICLE{Srin0302:Achieving,
AUTHOR="R. Srinivasan and Arun Somani",
TITLE="On achieving fairness and efficiency in high-speed shared medium access",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=1,
PAGES="111-124",
MONTH=feb,
YEAR=2003,
REFERENCES=23,
KEYWORDS="broadcast networks; collision resolution; multiple access; tree splitting",
ABSTRACT="Channel access has been an active research area for the past two decades.
Several protocols have been proposed in the literature to utilize channel
bandwidth efficiently. Some of the recently proposed protocols achieve a
near-ideal channel utilization. However, the efficiency in utilization
comes at the expense of certain unfairness in delay characteristics. A new
channel-access protocol, called access mechanism for efficient sharing in
broadcast medium networks (AMES-BM), is developed based on a deterministic
binary tree-splitting technique to achieve efficient sharing of bandwidth.
In AMES-BM, the stations are dynamically mapped to leaf nodes of a binary
tree. The stations are then divided into smaller groups that mimic the
behavior of an ideal transmission queue. Collisions are allowed to occur
within these groups and are resolved using a variation of the conventional
binary tree-splitting technique. The performance of AMES-BM is similar to
that of a collision-based protocol under low loads and to that of a
collision-free protocol under high loads. Besides achieving a near-optimal
channel utilization, the proposed protocol also guarantees fairness with
respect to delay for messages of varying lengths. The deterministic nature
of the protocol makes it more attractive for real-time applications.",
URL="http://ieeexplore.ieee.org/iel5/90/26510/01180549.pdf?isNumber=26510\&prod=JNL\&arnumber=1180549\&arSt=+111\&ared=+124\&arAuthor=Srinivasan\%2C+R.\%3B+Somani\%2C+A.K."
}
@INPROCEEDINGS{Srin0303:Cooperation,
AUTHOR="Vikram Srinivasan and Pavan Nuggehalli and Carla-Fabiana Chiasserini and
Ramesh Rao",
TITLE="Cooperation in Wireless Ad Hoc Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="In wireless ad hoc networks, nodes communicate with far off
destinations using intermediate nodes as relays. Since wireless
nodes are energy constrained, it may not be in the best interest of
a node to always accept relay requests. On the other hand, if all nodes
decide not to expend energy in relaying, then network throughput will
drop dramatically. Both these extreme scenarios (complete cooperation
and complete non-cooperation) are inimical to the interests of a user.
In this paper we address the issue of user cooperation in ad hoc
networks. We assume that nodes are rational, i.e., their actions are
strictly determined by self interest, and that each node is associated
with a minimum lifetime constraint. Given these lifetime constraints
and the assumption of rational behavior, we are able to determine the
optimal throughput for each node. We then propose a distributed and
scalable acceptance algorithm called Generous TIT-FOR-TAT (GTFT). The
acceptance algorithm is used by the nodes to decide whether to accept
or reject a relay request. We show that GTFT results in a Nash
equilibrium and prove that the system converges to the rational and
optimal operating point."
}
@INPROCEEDINGS{Srip0303:Efficient,
AUTHOR="Kunwadee Sripanidkulchai and Bruce Maggs and Hui Zhang",
TITLE="Efficient Content Location Using Interest-Based Locality in Peer-to-Peer
Systems",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Locating content in decentralized peer-to-peer systems is a
challenging problem. Gnutella, a popular file-sharing application,
relies on flooding queries to all peers. Although flooding is simple
and robust, it is not scalable. In this paper, we explore how to
retain the simplicity of Gnutella, while addressing its inherent
weakness: scalability. We propose a content location solution in
which peers loosely organize themselves into an interest-based
structure on top of the existing Gnutella network. Our approach
exploits a simple, yet powerful principle called interest-based
locality, which posits that if a peer has a particular piece of
content that one is interested in, it is very likely that it will have
other items that one is interested in as well. When using our
algorithm, called interest-based shortcuts, a significant amount
of flooding can be avoided, making Gnutella a more competitive
solution. In addition, shortcuts are modular and can be used to
improve the performance of other content location mechanisms including
distributed hash table schemes.
We demonstrate the existence of interest-based locality in five
diverse traces of content distribution applications, two of which are
traces of popular peer-to-peer file-sharing applications. Simulation
results show that interest-based shortcuts often resolve queries
quickly in one peer-to-peer hop, while reducing the total load in the
system by a factor of 3 to 7."
}
@ARTICLE{Stal0303:Session,
AUTHOR="William Stallings",
TITLE="The Session Initiation Protocol",
JOURNAL="Internet Protocol Journal",
VOLUME=6,
NUMBER=1,
MONTH=mar,
YEAR=2003,
REFERENCES=9,
ABSTRACT="The Session Initiation Protocol (SIP), defined in RFC 3261[6], is an
application level signaling protocol for setting up, modifying, and
terminating real-time sessions between participants over an IP data
network. SIP can support any type of single-media or multimedia session,
including teleconferencing.",
URL="http://www.cisco.com/warp/public/759/ipj\_6-1/ipj\_6-1\_session\_initiation\_protocol.html"
}
@INPROCEEDINGS{Stan0305:Dynamic,
AUTHOR="Vladica Stanisic and Michael Devetsikiotis",
TITLE="A Dynamic Study of Providing Quality of Service Using Preemption Policies
with Random Selection",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Bandwidth allocation is a fundamental problem in communication
networks, especially where bandwidth is reserved for requests to
guarantee a certain quality of service (QoS). Connection
preemption, coupled with the capability to reroute
connections, provides available and reliable services to
high-priority connections when a network is heavily loaded and
connection request arrival patterns are unknown, or when the
network experiences transient overloads or faults that reduce the
available capacity or routes. Connection preemption allows a high
quality of service to be provided to network connections and
bandwidth to be used more efficiently. Preemption becomes a more
attractive strategy in a differentiated services scenario,
especially when using the DiffServ-aware Traffic Engineering
approach. However, the complexity of such connection preemption
algorithms is a very important performance criterion for
implementation in real networks. In this paper, we analyze two
simple and efficient preemption policies with random selection and
examine their performance in a dynamic setting. To compare
the dynamic performance of the new algorithms to the existing
ones, we conduct complexity analysis and simulation studies."
}
@INPROCEEDINGS{Stan0305:Fast,
AUTHOR="Vladimir Stankovic and Raouf Hamzaoui and Zixiang Xiong",
TITLE="Fast Forward Error Protection of Packetized Multimedia Bitstreams for
Transmission over Varying Channels",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We propose a real-time optimization algorithm
that selects an appropriate channel code for hybrid systems that
combine packetization of an embedded wavelet bitstream into
independently decodable packets
and forward error correction using a family of channel codes
with error detection and error correction capability.
Such systems are very powerful for the transmission of audio,
images, and video over fading and erasure channels with varying
statistics. We also give an implementation that uses an optimal
packetization technique and a concatenated cyclic
redundancy-check/rate-compatible punctured convolutional coder.
Experimental results show that the peak signal-to-noise ratio of
the average mean square error of
our system is up to 1.74 dB higher than that of the previous best
hybrid system for a Rayleigh fading channel and a transmission
rate of 0.25 bits per pixel. Finally, we compare the hybrid approach to
a state-of-the-art approach that uses a product code to protect
the information bitstream."
}
@TECHREPORT{Stan0305:Use,
AUTHOR="Stefan Stancu",
TITLE="The use of Ethernet in the DataFlow of the {ATLAS} Trigger \& {DAQ}",
TYPE="arXiv",
NUMBER="cs.NI/0305064",
MONTH=may,
YEAR=2003,
KEYWORDS="Networking and Internet Architecture",
ABSTRACT="The article analyzes a proposed network topology for the ATLAS DAQ
DataFlow,
and identifies the Ethernet features required for a proper operation of
the
network: MAC address table size, switch performance in terms of throughput
and
latency, the use of Flow Control, Virtual LANs and Quality of Service. We
investigate these features on some Ethernet switches, and conclude on
their
usefulness for the ATLAS DataFlow network.",
URL="http://arXiv.org/abs/cs/0305064"
}
@ARTICLE{Star0306:Application,
AUTHOR="David Starobinski and Mark Karpovsky and Lev Zakrevski",
TITLE="Application of Network Calculus to General Topologies Using
Turn-Prohibition",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=3,
PAGES="411-421",
MONTH=jun,
YEAR=2003,
REFERENCES=31,
KEYWORDS="acyclic networks; network calculus; network stability; quality of service",
ABSTRACT="Network calculus is known to apply in general only to feedforward routing
networks, i.e., networks where routes do not create cycles of
interdependent packet flows. We address the problem of using network
calculus in networks of arbitrary topology. For this purpose, we introduce
a novel graph-theoretic algorithm, called turn-prohibition (TP), that
breaks all the cycles in a network and, thus, prevents any interdependence
between flows. We prove that the TP-algorithm prohibits the use of at most
1/3 of the total number of turns in a network, for any network topology.
Using analysis and simulation, we show that the TP-algorithm significantly
outperforms other approaches for breaking cycles, such as the spanning tree
and up/down routing algorithms, in terms of network utilization and delay
bounds. Our simulation results also show that the network utilization
achieved with the TP-algorithm is within a factor of two of the maximum
theoretical network utilization, for networks of up to 50 nodes of degree
four. Thus, in many practical cases, the restriction of network calculus
to feedforward routing networks may not represent a too significant
limitation.",
URL="http://ieeexplore.ieee.org/iel5/90/27187/01208302.pdf?isNumber=27187\&prod=JNL\&arnumber=1208302\&arSt=+411\&ared=+421\&arAuthor=Starobinski\%2C+D.\%3B+Karpovsky\%2C+M.\%3B+Zakrevski\%2C+L.A."
}
@ARTICLE{Stat03:Management,
AUTHOR="Radu State and Alexandru Petrescu",
TITLE="Management of Extended Mobility",
JOURNAL="Submitted to IEEE Network Magazine Special Issue on Network Management of
Multi-service, Multimedia, IP-based Networks",
YEAR=2003
}
@INPROCEEDINGS{Stee0305:Iterative,
AUTHOR="Heidi Steendam and Nele Noels and Marc Moeneclaey",
TITLE="Iterative Carrier Phase Synchronization for Low-Density Parity-Check Coded
Systems",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we consider the effect of a carrier phase offset on
the performance of a low-density parity-check (LDPC) coded QAM
modulated system. We investigate an ML-based carrier phase
synchronization algorithm, that makes use of the posterior
probabilities of the data symbols, provided by the iterative
decoder. The resulting carrier phase synchronizer is an extension,
to LDPC coded systems, of the iterative phase estimator for turbo
coded systems, presented in \cite{Lottici02}, and has negligible
BER performance degradation as compared to the ideally
synchronized system."
}
@INPROCEEDINGS{Stei0305:Soft,
AUTHOR="Baldur Steingrimsson",
TITLE="Soft Quasi-Maximum-Likelihood Detection for Multiple-Antenna Channels",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The paper addresses soft maximum-likelihood (ML) detection for
multiple-antenna wireless channels. We propose a soft quasi-ML
detector which maximizes the log-likelihood function by deploying
a semi-definite relaxation (SDR). Given perfect channel state
information at the receiver, the quasi-ML SDR detector achieves
the performance of the optimal ML detector in both coded and
uncoded multiple-input, multiple-output (MIMO) channels with
quadrature phase-shift keying modulation and frequency-flat
Rayleigh fading. The complexity of the quasi-ML SDR detector is
much less than that of the optimal ML detector, and, thus, the
quasi-ML detector offers more favorable performance/complexity
trade-off. Compared to the existing sphere decoder the quasi-ML
detector enjoys low polynomial worst-case complexity, as well as
guaranteed near capacity performance."
}
@ARTICLE{Stoi0302:Chord,
AUTHOR="Ion Stoica and Robert Morris and David Liben-Nowell and David Karger and M.
Kaashoek and Frank Dabek and Hari Balakrishnan",
TITLE="Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=1,
PAGES="17-32",
MONTH=feb,
YEAR=2003,
REFERENCES=26,
KEYWORDS="distributed scalable algorithms; lookup protocols; peer-to-peer networks",
ABSTRACT="A fundamental problem that confronts peer-to-peer applications is the
efficient location of the node that stores a desired data item. This paper
presents Chord, a distributed lookup protocol that addresses this problem.
Chord provides support for just one operation: given a key, it maps the
key onto a node. Data location can be easily implemented on top of Chord
by associating a key with each data item, and storing the key/data pair at
the node to which the key maps. Chord adapts efficiently as nodes join and
leave the system, and can answer queries even if the system is
continuously changing. Results from theoretical analysis and simulations
show that Chord is scalable: Communication cost and the state maintained
by each node scale logarithmically with the number of Chord nodes.",
URL="http://ieeexplore.ieee.org/iel5/90/26510/01180543.pdf?isNumber=26510\&prod=JNL\&arnumber=1180543\&arSt=+17\&ared=+32\&arAuthor=Stoica\%2C+I.\%3B+Morris\%2C+R.\%3B+Liben-Nowell\%2C+D.\%3B+Karger\%2C+D.R.\%3B+Kaashoek\%2C+M.F.\%3B+Dabek\%2C+F.\%3B+Balakrishnan\%2C+H."
}
@ARTICLE{Stoi0302:Core,
AUTHOR="Ion Stoica and Scott Shenker and Hui Zhang",
TITLE="Core-Stateless Fair Queueing: A Scalable Architecture to Approximate Fair
Bandwidth Allocations in High-Speed Networks",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=1,
PAGES="33-46",
MONTH=feb,
YEAR=2003,
REFERENCES=36,
KEYWORDS="binary linear codes; covering radius; least covering radius",
ABSTRACT="Router mechanisms designed to achieve fair bandwidth allocations, such as
fair queueing, have many desirable properties for congestion control in
the Internet. However, such mechanisms usually need to maintain state,
manage buffers, and/or perform packet scheduling on a per-flow basis, and
this complexity may prevent them from being cost-effectively implemented
and widely deployed. We propose an architecture that significantly reduces
this implementation complexity yet still achieves approximately fair
bandwidth allocations. We apply this approach to an island of routers -
that is, a contiguous region of the network - and we distinguish between
edge routers and core routers. Edge routers maintain per-flow state; they
estimate the incoming rate of each flow and insert a label into each
packet based on this estimate. Core routers maintain no per-flow state;
they use first-in-first-out packet scheduling augmented by a probabilistic
dropping algorithm that uses the packet labels and an estimate of the
aggregate traffic at the router. We call the scheme core-stateless fair
queueing. We present simulations and analysis on the performance of this
approach.",
URL="http://ieeexplore.ieee.org/iel5/90/26510/01180544.pdf?isNumber=26510\&prod=JNL\&arnumber=1180544\&arSt=+33\&ared=+46\&arAuthor=Stoica\%2C+I.\%3B+Shenker\%2C+S.\%3B+Hui+Zhang"
}
@INPROCEEDINGS{Stok0305:Comparison,
AUTHOR="Andrew Stok and Edward H. Sargent",
TITLE="Comparison of Utilization in Optical {CDMA} and {WDMA} Broadcast Local-Area
Networks with Physical Noise",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The utilization, defined as the throughput normalized to the time-domain
processing gain, is used as metric to compare the performance of optical
code-division multiple-access (O-CDMA) and wavelength-division
multiple-access (WDMA) local-area networks. The impact of shot and
thermal noise, as well as multiple-access interference (MAI) for the
O-CDMA system, are taken into account. We find that at low offered loads
or low received power levels, the WDMA system outperforms the O-CDMA
system by a wide margin; however, at higher offered loads and when
sufficient optical power is available at the receiver, the O-CDMA scheme
offers a performance advantage. The results suggest that an adaptive
system, able to switch between WDMA and O-CDMA, would make best use of the
fiber-optic channel."
}
@INPROCEEDINGS{Su0305:Space,
AUTHOR="Weifeng Su and Zoltan Safar and K.J. Ray Liu",
TITLE="Space-Time Signal Design for Time-Correlated Rayleigh Fading Channels",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The existing constructions of space-time codes or modulation
have mainly focused on two ideal situations: either quasi-static
or rapid fading channels. In this paper, we consider the design
of robust space-time modulation for time-correlated Rayleigh
fading channels. We show that the space-time signals of square
size achieving full diversity in quasi-static fading channels
can also achieve full diversity in time-correlated fading
channels irrespectively of the time correlation matrix.
Moreover, we propose a space-time signal construction method by
combining orthogonal designs with sphere packings. The
simulation results demonstrate the superior performance of our
scheme over the existing methods. For example, we observe a
coding gain of about 4 dB over the parametric code and about
9 dB over the cyclic code under certain fading conditions."
}
@ARTICLE{Su0306:Itswtcm,
AUTHOR="Hongjun Su and Mohammed Atiquzzaman",
TITLE="ItswTCM: a new aggregate marker to improve fairness in DiffServ",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=9,
PAGES="1018-1027",
MONTH=jun,
YEAR=2003,
REFERENCES=22,
KEYWORDS="TCP protocol; Quality of service; Differentiated services; Traffic Marker",
ABSTRACT="Recent demands for real time applications have given rise to a need for
Quality of Service (QoS) in the Internet. Differentiated Services
(DiffServ) is one of such efforts currently pursued by IETF. Previous
researchers found unfairness in the DiffServ network. To solve the
unfairness problem, we propose a new TSW based three-color marker
(ItswTCM), which achieves proportional fair share of excess bandwidth
among aggregates in a DiffServ network. We have compared the fairness of
our proposed ItswTCM marker with srTCM, trTCM, and tswTCM. Results show
that our proposed marker performs better than the other three schemes for
low to medium network provision level (2070\%); we believe that all well
provisioned network will operate in this region. Results also show that
our proposed marker is not as sensitive to the number of flows in an
aggregate as the previous marking schemes. We point out that yellow
packets play a significant role in achieving proportional fair share of
excess bandwidth among aggregates. We conclude that in order to achieve
proportional fair sharing of excess bandwidth, it is important to inject
right amount of yellow packets into the network.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47603MJ-1-X\&\_cdi=5624\&\_orig=browse\&\_coverDate=06\%2F02\%2F2003\&\_sk=999739990\&view=c\&wchp=dGLbVzz-zSkWW\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=af1d16e3f97407fb4694ec5b4d7bea70\&ie=f.pdf"
}
@INPROCEEDINGS{Sud0305:Joint,
AUTHOR="Seema Sud and Wilbur Myrick and Scott Goldstein",
TITLE="Joint Space-Time Adaptive Filtering for {DS-CDMA} Systems with Antenna
Arrays Based on the Multistage Wiener Filter",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="An innovative, joint space-time pre-processor employing a rake
structure and spatial diversity is proposed. The pre-processor
allows for the amplitudes and phases of the signal components that
have been distorted by multipath and fading to be combined to
allow improved interference suppression. The multistage Wiener
filter (MWF) then provides interference suppression (IS) on the
reconstructed pre-processed output that exceeds MMSE performance
at greatly reduced complexity. The MWF has been shown to operate
at much lower rank and at greatly reduced sample support compared
to any other reduced rank method. It provides the additional
advantage of rapid adaptation to time-varying channel conditions
and does not depend on covariance matrix estimation or eigenvector
decomposition. It is demonstrated that the proposed algorithm is
capable of suppressing co-channel interference and providing both
multipath delay and fading compensation while maintaining low
computational complexity versus existing techniques."
}
@INPROCEEDINGS{Suh0305:Multicast,
AUTHOR="Young-Joo Suh and Dong-Hee Kwon and Woo-Jae Kim",
TITLE="Multicast Routing by Mobility Prediction for Mobile Hosts",
BOOKTITLE="ICC 2003 - Global Services and Infrastructure for Next Generation Networks",
ADDRESS="Anchorage, Alaska",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Providing multicast service to mobile hosts in wireless mobile networking
environments is difficult due to frequent changes of mobile host location
and group membership. If a conventional multicast routing protocol is used
in wireless mobile networks, several problems may be experienced since
existing multicast routing protocols assume static hosts when they
construct the multicast delivery tree. To overcome the problems, several
multicast routing protocols for mobile hosts have been proposed. Although
the protocols solve several problems inherent in multicast routing
proposals for static hosts, they still have problems such as non-optimal
delivery path, datagram duplication, overheads resulting from frequent
reconstruction of a multicast tree, etc. In this paper, we summarize these
problems of multicast routing protocols and propose an efficient multicast
routing protocol based on mobile IP standard in wireless mobile networks.
A mobile host that is located in a foreign network receives a tunneled
multicast datagram from a multicast agent, which is located in a remote
network or local network. While receiving a tunneled multicast datagram
from a remote multicast agent, the local multicast agent starts a
multicast tree join operation if the mobile host is expected to remain the
network relatively long period of time, while it does not start multicast
tree join operation if the mobile host is expected to remain the network
relatively short period of time. The proposed protocol tries to minimize
the number of unnecessary multicast tree join operations. We examined
performance of the proposed protocol by simulation under various
environments and we got good performance results."
}
@INPROCEEDINGS{Suh0305:Performance,
AUTHOR="Young-Joo Suh and Dong-Hee Kwon and Woo-Jae Kim",
TITLE="Performance Comparisons of Two On-demand Ad Hoc Routing Protocols in
Dynamic Rate Shifting WLANs",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Recently, many on-demand routing protocols for ad-hoc networks have been
proposed and studied, but most of these works has been done on the basis
of the IEEE 802.11 standard that support single transmission rate. In ad
hoc networks supporting multi-rate transmission scheme, which is referred
to as dynamic rate shifting in the IEEE 802.11b standard, little
performance study on ad-hoc routing protocols has been performed. In this
paper, we extensively study the impact of the dynamic rate shifting on the
performance of ad-hoc routing protocols in various situations in multi-rate
WLANs environments. Our question is whether the dynamic rate shifting
scheme supported by the IEEE 802.11b standard affects the relative
performance of the routing protocols being studied. We have extended the
ns-2 network simulator to accurately model the IEEE 802.11b wireless LAN
standard, and simulated the performance of two ad hoc routing protocols
over each network supporting single rate and multi-rate transmission."
}
@INPROCEEDINGS{Sui0305:Analysis,
AUTHOR="HongFei Sui and Jianxin Wang and Jianer Chen and SongQiao Chen",
TITLE="An analysis of forwarding mechanism in Crowds",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The mechanism of forwarding request plays the most important role
in Crowds anonymous communication protocol. On one hand, it hides
the identity of the request initiator against the responder, the
participants in protocol and other eavesdroppers. On the other
hand, it causes additional latency on communication and payload on
participants in the protocol.
In this paper, we investigate thoroughly the influence of the
forwarding mechanism with respect to the performance and the
security in Crowds protocol. Being different from the previous
analysis, our analysis focuses on the influence of the length of
forwarding path independent of specific $length$ $control$
$strategy$ which is adopted to control the length of forwarding
path on constructing the forwarding path. This leads to more
accurate analysis results. On the performance, we study the
payload on each participant in Crowds and prove that its
expectation is equal to the expected length of forwarding path
whatever $length$ $control$ $strategy$ is adopted. Furthermore,
the expected payload on each member in Crowds is
$\frac{1}{1-P\_f}+1$ when the present fixed probability of
forwarding $P\_{f}$ based $length$ $control$ $strategy$ is adopted.
This improves Reiter and Rubin's original result and demonstrates
that the payload on each member in Crowds protocol is uniquely
determined by the forward probability $P\_f$, while independent of
the size of Crowds protocol. Thus, Crowds protocols have very nice
scalability property. On the security, we investigate that to what
extent the length of forwarding path can affect the complexity to
attack. The result shows that the number of rounds to attack does
not vary significantly while adjusting length of forwarding path.
Therefore, the length of forwarding path in Crowds protocol can be
decreased to gain better performance without reducing the security
of Crowds protocol remarkably."
}
@INPROCEEDINGS{Sun0305:Application,
AUTHOR="Yuan Sun and Elizabeth Belding-Royer",
TITLE="Application-Oriented Routing in Hybrid Wireless Networks",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Hybrid wireless networks are a viable networking solution to combat the
limitations infrastructured wireless networks and provide
Internet connectivity to it ad hoc networks. This paper first analyzes the
requirements for deployment of hybrid networks under different application
scenarios. Then two routing schemes designed for different traffic
patterns in hybrid networks are proposed to achieve optimal performance.
Simulation results show that with a large percentage of short web-based
traffic sessions, using a gateway as a default router
results in better performance with lower latency, fewer routing
table entries, and manageable control overhead. When traffic locality is
high and Internet traffic is only an occasional occurrence, the reactive
routing scheme results in better performance, yielding low
control overhead and higher throughput."
}
@INPROCEEDINGS{Sun0305:Mmse,
AUTHOR="Wei Sun and Hongbin Li and Moeness Amin",
TITLE="{MMSE} Detection for Space-Time Coded {MC-CDMA}",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper considers applying the minimum mean square error (MMSE)
criterion on the detection for space-time coded multicarrier CDMA
(STC-MC-CDMA) systems in frequency selective environments. In
particular, we consider the Alamouti's space-time coding scheme that
involves two transmit antennas. To acquire the channel information
needed by the MMSE detector, a subspace-based blind channel
identification algorithm, which utilizes only the second-order
statistics of the received signal to perform the channel estimation,
is proposed. The performances of the MMSE detector and the channel
identification algorithm are evaluated with computer simulations."
}
@INPROCEEDINGS{Sun0305:Performance,
AUTHOR="Zhenyu Sun and Tjeng Thiang Tjhung",
TITLE="On Performance Analysis and Design Criteria for Trellis Coded Differential
Unitary Space-Time Modulation",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Formulas of the pairwise error-event probability (PEP) and the bit error
probability (BEP) for a trellis coded differential unitary space-time
modulation (TC-D-USTM), generated by combining trellis coding and
differential unitary space-time modulation, are derived in closed forms.
It is found that in a multi-input multi-output (MIMO) system with M
transmit and N receive antennas, besides the diversity gain of MN from the
space-time signal design, a trellis-coding gain of l is also obtained for
the TC-D-USTM, where l is the length of the shortest error event.
Additional coding gain comes from the product of the dissimilarities along
the path of the shortest error event. These performance analyses suggest
design criteria for the TC-D-USTM to obtain a best BEP performance.
Simulations demonstrate that these analyses are accurate, especially at
high signal-to-noise ratio (SNR)."
}
@INPROCEEDINGS{Sun0305:Prediction,
AUTHOR="Lingfen Sun and Emmanuel Ifeachor",
TITLE="Prediction of Perceived Conversational Speech Quality and Effects of
Playout Buffer Algorithms",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Perceived conversational speech quality is a key QoS metric for VoIP
applications. Speech quality is mainly affected by network impairments,
such as delay, jitter and packet loss. Playout buffer algorithms are used
to compensate for jitter, based on a tradeoff between delay and loss, but
can have a significant effect on perceived speech quality. The main aim
in this paper is to assess how buffer algorithms affect perceived speech
quality and how to choose the best algorithm and its parameters to
obtain optimum perceived speech quality (in terms of an objective Mean
Opinion Score). The contributions of the paper are three-fold. First, we
introduce a new methodology for predicting conversational speech quality
(conversational Mean Opinion Score or MOSc) which combines the latest
ITU-T PESQ algorithm and the concepts of the E-model. Second, we assess
different playout buffer algorithms using the new MOSc metric on Internet
trace data. Our findings indicate that, in general, end-to-end delay has a
major effect on the selection of a buffer algorithm and its parameters. For
small end-to-end delays, an algorithm that seeks to minimise loss is
preferred, whereas for large end-to-end delays, an algorithm that aims at
a minimum buffer delay is better. Third, we propose a modified playout
buffer algorithm together with an adaptive parameter adjustment scheme.
Preliminary results show that this can achieve an optimum perceived speech
quality for all the traces considered. The results are based on Internet
trace data measurements between UK and USA, UK and China, and UK and
Germany."
}
@INPROCEEDINGS{Sun0305:Superposition,
AUTHOR="Thomas Sun and Richard Wesel and Mark Shane and Keith Jarett",
TITLE="Superposition Turbo {TCM} for Multi-Rate Broadcast",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Bergmans and Cover identified the capacity region of the Gaussian
degraded broadcast channel, where different receivers observe the
transmitted signal with different signal to noise ratios. This paper
presents a superposition turbo coding scheme that performs within 1 dB of
the capacity region boundary of the degraded broadcast channel at BER of
$10^{-5}$. Performance is consistent over the entire useful range of the
power allocation parameter $\alpha$.
Coding for the degraded broadcast channel is equivalent to coding for
unequal error protection. Adjusting $\alpha$ changes the transmitter
constellation of our encoder, and changes the degree to which error
protection is unequal. When $\alpha$ is selected to provide equal error
protection, the code is essentially a multilevel code (MLC).
This multilevel code performs as well as single level turbo
trellis-coded-modulation (TCM) schemes with the advantage of the
potential for flexible unequal error protection as $\alpha$ is varied."
}
@INPROCEEDINGS{Sun0305:Synchronization,
AUTHOR="Jian Sun and Matthew Valenti",
TITLE="Synchronization of Turbo Codes Based on Online Statistics",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Turbo codes are sensitive to both (timing) synchronization errors and
signal-to-noise ratio (SNR) mismatch. Since turbo codes are intended to
be deployed in environments with very low SNR, conventional
synchronization methods often fail. This paper introduces a solution for
jointly estimating the SNR and achieving timing synchronization based on
the statistics of the received signal. Simulation results show only a
small loss in coding gain relative to perfect timing and SNR estimation
while requiring only slightly more complexity and latency."
}
@ARTICLE{Sun0306:Prioritized,
AUTHOR="Hairong Sun and James Han and Haim Levendel",
TITLE="Prioritized failure recovery in communication networks and its transient
analysis",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=9,
PAGES="939-949",
MONTH=jun,
YEAR=2003,
REFERENCES=28,
KEYWORDS="Recovery; Priority; Performance recovery; Transient behavior; Stochastic
Petri net",
ABSTRACT="Prioritized recovery can provide differentiated recovery services to the
users in communication networks. This paper studies the transient behavior
of communication networks under prioritized recovery. Stochastic Petri net
models are constructed to capture the behaviors of a queueing system at
four different phases during the recovery process, i.e. failure-free
phase, failure is detected, higher priority service is recovered, and
lower priority service is recovered. The final state of the stochastic
Petri net model in one phase is used as the initial state of the model in
the next phase. Both the traffics for the higher and lower priority queue
are modeled as Markov Modulated Poisson Processes. Two queues are served
with round-robin fashion. With the help of Stochastic Petri Net Package
(SPNP), the transient performances of the queueing system during each
phase are numerically studied. The queue with the higher recovery priority
significantly outperforms the queue with the lower recovery priority during
the recovery process. A new concept about performance recovery is
introduced. Performance recovery time, which is defined as the time
required for a performance index to reach a desired and acceptable value,
if it is deteriorated by the service disruption, is distinct from and more
important than the failure recovery time. The models and analytical methods
presented in this paper can be used to quantify the performance recovery
time.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-473J07R-1-4H\&\_cdi=5624\&\_orig=browse\&\_coverDate=06\%2F02\%2F2003\&\_sk=999739990\&view=c\&wchp=dGLbVlb-zSkzS\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=f0cf61a74349bf851ba5261368b41667\&ie=f.pdf"
}
@INPROCEEDINGS{Sund0305:Interleaved,
AUTHOR="Jagadeesan Sundaresan and Manoj Bs and Siva Ram Murthy",
TITLE="Interleaved Carrier Sense Multiple Access: An Efficient {MAC} Protocol for
Ad hoc Wireless Networks",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Wireless networks are inherently limited by the bandwidth
constraint. MAC protocols for Wireless Local Area Networks
(WLANs) play the important role of arbitrating and
statistically multiplexing the transmission requests of
various stations contending to access the channel. The
performance of IEEE 802.11 degrades in Ad hoc networks
because of the presence of hidden and exposed terminals.
To counter these problems, we propose a new MAC protocol
called Interleaved Carrier Sense Multiple Access (ICSMA)
Protocol for Ad~hoc wireless networks. The performance of
ICSMA was compared with single channel 802.11 MAC protocol
and with 802.11 MAC protocol over two channels with half
the bandwidth through extensive simulation studies. Results
show that ICSMA performs better with respect to throughput,
access delay, throughput fairness, and delay fairness when
compared with IEEE 802.11."
}
@INPROCEEDINGS{Sung0305:Semiblind,
AUTHOR="Youngchul Sung and Lang Tong and Ananthram Swami",
TITLE="Semiblind Channel Estimation for Space-time Coded {WCDMA}",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="A new semiblind channel estimation technique is proposed for
space-time coded wideband CDMA systems using aperiodic and possibly
multirate spreading codes. Using a decorrelating matched filter,
the received signal is projected into subspaces from which channel
parameters and data symbols can be estimated jointly. Exploiting the
subspace structure of the WCDMA signaling and the orthogonality of
the space-time code, the proposed algorithm provides the least squares
channel estimate in closed form.
A new identifiability condition is established.
The mean square error of
the estimated channel is compared with the Cramer-Rao
bound, and a bit error rate (BER) expression for
the proposed algorithm is presented."
}
@ARTICLE{Suri0303:Profile,
AUTHOR="Subhash Suri and Marcel Waldvogel and Daniel Bauer and Priyank Warkhede",
TITLE="Profile-based routing and traffic engineering",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=4,
PAGES="351-365",
MONTH=mar,
YEAR=2003,
REFERENCES=21,
KEYWORDS="Routing; Flow routing; Profile; Label switching; Multi-protocol
label-switched; Traffic engineering",
ABSTRACT="We present a new algorithm and framework for dynamic routing of
bandwidth-guaranteed flows. The problem is motivated by the need to set up
bandwidth-guaranteed paths in carrier and ISP networks dynamically.
Traditional routing algorithms such as minimum-hop or widest-path routing
do not take advantage of any knowledge about the traffic distribution or
ingressegress pairs, and therefore can often lead to severe network
underutilization. Our work is inspired by the recently proposed Minimum
Interference Routing Algorithm (MIRA) of Kodialam and Lakshman, but it
improves on their approach in several ways. Our main idea is to use a
traffic profile of the network, obtained by measurements or service-level
agreements as a rough predictor of the future traffic distribution. We use
this profile to solve a multi-commodity network flow problem, whose output
is used both to guide our online path-selection algorithm as well as to
impose admission control. The offline multi-commodity solution seems very
effective at distributing the routes and avoiding bottlenecks around hot
spots. In particular, our algorithm can anticipate a flow's blocking
effect on groups of ingressegress pairs, whereas, MIRA only considers one
ingressegress pair at a time. Our simulation results show that the new
algorithm outperforms shortest-path, widest-path, and minimum interference
routing algorithms on several metrics, including the fraction of requests
routed and the fraction of requested bandwidth routed. Finally, the
framework is quite general and can be extended in numerous ways to
accommodate a variety of traffic management priorities in the network.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-46V4SWD-2-3C\&\_cdi=5624\&\_orig=browse\&\_coverDate=03\%2F01\%2F2003\&\_sk=999739995\&view=c\&wchp=dGLbVzz-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=962a00dcea270cb7286b837607169e4d\&ie=f.pdf"
}
@INPROCEEDINGS{Svan0305:Signal,
AUTHOR="Thomas Svantesson",
TITLE="On Signal Strength and Multipath Richness in Multi-Input Multi-Output
Systems",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="A common practice when analyzing systems using multiple antennas at
both ends is to focus on the multipath properties and normalize the
SNR out of the channel matrix. This paper studies the relationship
between the signal strength and multipath richness using indoor
measurements taken at the Brigham Young University campus. It is
found that the SNR and the multipath richness can be strongly
correlated. Hence, some caution is needed when normalizing out the
SNR in system performance studies. Furthermore, for an unnormalized
channel, the channel capacity usually rises when moving from NLOS
into LOS since the loss in multipath is more than compensated for
by an increase in SNR. A theoretical study also reveals that for
moderate sized systems, the required SNR increase for a LOS channel
to yield the same channel capacity as a NLOS channel is not very
large."
}
@INPROCEEDINGS{Swam0305:Technique,
AUTHOR="Arvind Swaminathan and Daniel Noneaker",
TITLE="A Technique to Improve the Performance of Serial, Matched-Filter
Acquisition in Direct-Sequence Spread-Spectrum Packet Radio Communications",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper we examine a simple method to improve the performance of
serial, matched-filter acquisition in direct-sequence spread-spectrum
packet radio communications. Each packet transmission includes an
acquisition preamble, and the preamble sequence is changed at the
boundaries of predefined time epochs based on a pseudorandom sequence
generator. It is shown in previous work that the presence of an IF filter
and the characteristics of the AGC subsystem lead to a probability of not
acquiring that is a non-monotonic function of the signal-to-noise ratio if
the acquisition algorithm uses a threshold-crossing detector with a fixed
threshold. The acquisition algorithm presented in this paper employs an
estimator to adaptively select the acquisition threshold. It is shown
that this technique reduces the severity of the non-monotonicity and
substantially improves the acquisition performance.
Index Terms - Synchronization, packet radio communications, pseudonoise
coded communications, radio receivers."
}
@ARTICLE{Sysa0312:Low,
AUTHOR="Locum Sysadmin",
TITLE="Low-Tech Network Maintenance",
JOURNAL="Internet Protocol Journal",
VOLUME=6,
NUMBER=4,
MONTH=dec,
YEAR=2003,
REFERENCES=7,
ABSTRACT="In an ideal world, we all maintain networks composed of shiny, high-end
equipment. Server rooms are stacked to the brim with racks of blinking
lights. Neat bundles of cable wend their way through cable loops to
orderly, labeled patch bays. When the occasional piece of equipment fails,
a hot replacement is slotted in by trained technicians, often before users
even notice the outage. Sleek, modern servers hum contentedly, offering
their services all day, every day. All is well.",
URL="http://www.cisco.com/warp/public/759/ipj\_6-4/ipj\_6-4\_network\_maintenance.html"
}
@ARTICLE{Szab0303:Call,
AUTHOR="István Szabó",
TITLE="On call admission control for {IP} telephony in best effort networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=4,
PAGES="304-313",
MONTH=mar,
YEAR=2003,
REFERENCES=14,
KEYWORDS="End-to-end measurements; TCP friendliness; IP telephony; Core-stateless
resource provisioning",
ABSTRACT="This paper contributes to answer the fundamental question of what sort of
QoS guarantee can be provided by a core-stateless QoS provisioning
architecture, and it also investigates the effect of flows subjected to
the admission control on legacy TCP traffic. The approach relies on an
enhanced version of passive end-to-end measurement-based call admission
control in IP telephony gateways which eliminates the signalling load and
the associated flow states in the core routers. The admission control
method collects packet loss and delay statistics experienced by ongoing
sessions. Detailed characterisation of the solution is provided using
simulation.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-46SWC8F-2-11\&\_cdi=5624\&\_orig=browse\&\_coverDate=03\%2F01\%2F2003\&\_sk=999739995\&view=c\&wchp=dGLbVzz-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=aba7f42a49461926b5de4fff25eb2074\&ie=f.pdf"
}
@INPROCEEDINGS{Szla0305:Applicability,
AUTHOR="Arpad Szlavik and Gergely Seres and Janos Zatonyi and Jozsef Biro",
TITLE="On the Applicability of the On-Off Type Approximation of the Effective
Bandwidth Function",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper reviews the applicability of simplified bandwidth
requirement estimators that need only the mean and the peak
rates of traffic flows as input, instead of the full statistical
description of the traffic required by their original form.
The estimators approximate the effective bandwidth function,
the key component of the bandwidth requirement estimate, with
the logarithmic moment generating function of an on-off source.
It is demonstrated that this on-off type approximation has to be used with
care as it results in a loss of information about the traffic
streams. This is manifested in the reduction of the advanced
bandwidth estimator method of the many sources asymptotics into
the basic Chernoff-type technique. As a consequence bandwidth
requirement estimators built on the on-off type approximation overlook the
multiplexing gain occurring in the buffers, which results in
overly conservative estimates close or equal to the peak rate
when applied to traffic aggregates."
}
@INPROCEEDINGS{Taba0303:MNCM,
AUTHOR="Vahid Tabatabaee and Leandros Tassiulas",
TITLE="{MNCM} a new class of efficient scheduling algorithms for input-buffered
switches with no speedup",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="In this paper, we use fluid model techniques to establish some new
results for the throughput of input-buffered switches. In
particular, we introduce a new class of deterministic maximal size
matching algorithms that achieves 100\\% throughput. Dai and
Prabhakar \cite{Dai} has shown that any maximal size matching
algorithm with speedup of 2 achieves 100\\% throughput. We
introduce a class of maximal size matching algorithms that we call
them maximum node containing matching (MNCM) algorithms, and prove
that they have 100\\% throughput with no speedup. We also introduce
a new weighted matching algorithm, maximum first matching (MFM)
with complexity $O(N^{2.5})$ that belongs to MNCM. MFM, to the
best of our knowledge, is the lowest complexity deterministic
algorithm that delivers 100\\% throughput. The only assumption on
the input traffics is that they satisfy the strong law of large
numbers. Besides throughput, average delay is the other key
performance metric for the input-buffered schedulers. We use
simulation results to compare and study the delay performance of
MFM. The simulation results demonstrate promising delay
performance for MFM.
Method keywords: Stochastic processes/Queueing theory,
Graph theory."
}
@INPROCEEDINGS{Taka0304:Promoting,
AUTHOR="Yoshihisa Takada and Takeshi Shinohara",
TITLE="Promoting Broadband: The Case of Japan",
BOOKTITLE="Promoting Broadband",
ORGANIZATION="ITU",
ADDRESS="Geneva, Switzerland",
MONTH=apr,
YEAR=2003,
KEYWORDS="SIP; IP telephony; ADSL; FTTH",
ABSTRACT="The technological innovation and commercial development of
telecommunications have gone hand in
handparticularly during recent decadesand the combined influence of
economic, communications and
technological developments are fast leading towards what is now known as
the information society.
Broadband telecommunications are beginning to feature highly among these
technologies, and their growing
prevalence is testifying to their future potential for users, businesses
and governments alike. As a country
that has been a world leader in the field of telecommunications, Japan
presents a richly informative example
for study. This case study attempts to examine developments and to analyse
the situation in respect of
broadband telecommunications in Japan, which, for many, represents the
cutting edge of telecommunications
development and policy.",
URL="http://www.itu.int/osg/spu/ni/promotebroadband/casestudies/japan.pdf"
}
@ARTICLE{Taka0311:Bounds,
AUTHOR="Toshiomi Takahashi and Toshihisa Ozawa and Yukio Takahashi",
TITLE="Bounds of performance measures in large-scale mobile communication networks",
JOURNAL="Performance Evaluation",
VOLUME=54,
NUMBER=3,
PAGES="263-283",
MONTH=nov,
YEAR=2003,
REFERENCES=12,
KEYWORDS="Mobile communication networks; Markov chain; Weak D-Markov chain; Markov
decision process; Traffic theory",
ABSTRACT="In this paper, we propose a new method for evaluating performance measures
in a mobile communication network having a large number of base stations.
Each base station has its own zone where its radio wave reaches. These
zones are overlapping with neighboring zones, and handovers become
possible. However, the existence of overlapping zones makes the analysis
of a network difficult. To overcome this difficulty, we introduce an
aggregated process on a smaller state space. For each of the important
performance measures, using this aggregated process, we can construct a
Markov decision problem that derives an exact upper (or lower) bound.
Further, under some condition, we can specify a situation at which the
upper (lower) bound is attained. This situation is analyzed with a far
smaller model, and we can get the upper (lower) bound numerically or even
by simulation.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-4985X85-1-DM\&\_cdi=5663\&\_orig=browse\&\_coverDate=11\%2F30\%2F2003\&\_sk=999459996\&view=c\&wchp=dGLbVzb-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=bf4c2f235a31a0a8f88e31fb7479d319\&ie=f.pdf"
}
@INPROCEEDINGS{Taky0305:Frequency,
AUTHOR="Osamu Takyu and Tomoaki Ohtsuki and Masao Nakagawa",
TITLE="Frequency Offset Compensation with {MMSE-MUD} for Multi-Carrier {CDMA} in
Quasi-Synchronous Uplink",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Multi-Carrier Code Division Multiple Access (MC-CDMA) has been one of the
candidates for the next generation wireless communication system. In
uplink, the MC-CDMA system suffers from the different access timing
(asynchronous transmission), the different fading, and the different
frequency offsets of each active user. In this paper we analyze the
effects of frequency offset compensation with MMSE-MUD (minimum mean
square error based multi-user detection) for MC-CDMA in quasi-synchronous
uplink. We consider two subcarrier mapping schemes in MC-CDMA, continuous
mapping and discrete mapping. From our theoretical analysis and computer
simulation, we show that the MMSE-MUD can compensate the different
frequency offsets between the desired user and the others users. We also
show that the MMSE-MUD significantly improves the bit error rate (BER) for
the MC-CDMA system in the continuous mapping scheme."
}
@INPROCEEDINGS{Tan0305:Anti,
AUTHOR="Jun Tan and Gordon Stuber",
TITLE="Anti-Jamming Performance of Multi-Carrier Spread Spectrum with Constant
Envelope",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="A special complex sequence, called a complex quadratic
sequence, is proposed as the frequency-spreading sequence for
multicarrier spread spectrum (MC-SS) modulation scheme. The
resulting MC-SS signal has constant envelope in both time domain
and frequency domains. This feature allows the MC-SS system to
mitigate the effects of both partial-band jamming and pulse
jamming. For partial-band jamming, the MC-SS system with frequency
domain detection and combining can outperform DS/SS. For pulse
jamming, the MC-SS system with time-domain detection and combining
can outperform other MC-SS systems. The proposed MC-SS signal has
a constant envelope thus reducing linearity requirements on the
power amplifier. A simple jammer state estimation scheme for both
partial-band and pulse jamming channel is also proposed and
analyzed. Simulation results are provided to verify our analysis."
}
@INPROCEEDINGS{Tan0305:Burst,
AUTHOR="Siok Kheng Tan and Mohan Gurusamy and Kee Chaing Chua",
TITLE="Burst Rescheduling with Wavelength and Last-hop {FDL} Reassignment in {WDM}
Optical Burst Switching Networks",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we consider the problem of fast and efficient dynamic
scheduling of bursts that belong to different classes of
priority in wavelength-division multiplexing (WDM)-based optical burst
switching (OBS) networks with limited optical buffers.
In OBS networks, control and data components of a burst are sent
separately with a time gap to ensure that resources such as wavelengths
and fiber delay lines (FDLs) are reserved at various nodes before the data
burst arrives. A scheduling algorithm with attractive features such as
computational simplicity and efficient resource utilization is mandatory
to quickly handle dynamic burst traffic and reduce burst dropping
probability. While void filling algorithms achieve good burst dropping
performance they are computationally complex. We propose burst
rescheduling as an alternative to void filling which can do fast
scheduling without requiring to examine and fill voids and at the same
time can achieve good performance.Burst rescheduling uses two mechanisms
known as wavelength reassignment and last-hop FDL reassignment. We develop
a scheduling algorithm using the above rescheduling mechanisms called Burst
Rescheduling with Wavelength and Last-hop FDL Reassignment (BR-WFR) which
is computationally simpler than a void filling algorithm. We then discuss
the signaling overhead and feasibility of implementing burst rescheduling.
Through simulation experiments we demonstrate the effectiveness of the
proposed burst rescheduling algorithm."
}
@ARTICLE{Tang0302:Congestion,
AUTHOR="Ken Tang and Mario Gerla",
TITLE="Congestion control multicast in wireless ad hoc networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=3,
PAGES="278-288",
MONTH=feb,
YEAR=2003,
REFERENCES=26,
KEYWORDS="Multicast; On-demand routing; Congestion control; Ad hoc network; Broadcast
medium window",
ABSTRACT="In this paper, the interaction of the Medium Access Control (MAC) and
routing layer is used to address the congestion control multicast routing
problem in wireless ad hoc networks. We first introduce the Broadcast
Medium Window (BMW) MAC protocol, which provides robust delivery to
broadcast packets at the MAC layer. In doing so, we show that although BMW
is able to provide high reliability under low to medium network load,
reliability dramatically degrades under high network load. We then extend
the wireless On-Demand Multicast Routing Protocol (ODMRP) to facilitate
congestion control in ad hoc networks using BMW to combat the poor
performance under highly congested network conditions. Through simulation,
we show that ODMRP with congestion control adapts well to multicast sources
that are aggressive in data transmissions.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-469GTRG-2-13\&\_cdi=5624\&\_orig=browse\&\_coverDate=02\%2F15\%2F2003\&\_sk=999739996\&view=c\&wchp=dGLbVtb-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=ed543bd41d9fc170dff1a587dd4aa29a\&ie=f.pdf"
}
@INPROCEEDINGS{Tang0303:Understanding,
AUTHOR="Ao Tang and Jiantao Wang and Steven Low",
TITLE="Understanding CHOKe",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="A recently proposed active queue management, CHOKe, is stateless,
simple to implement, yet surprisingly effective in
protecting TCP from UDP flows. As UDP rate increases, even though
the number of UDP packets in the queue rises, its bandwidth share
eventually drops to zero, in stark contrast to the behavior of a
regular FIFO buffer. We derive a detailed model of CHOKe that
accurately predicts this, and other behaviors of CHOKe, and
validate the model with simulations. Its key features are the
incorporation of the feedback equilibrium of TCP with dropping
probability and the spatial characteristics of the queueing
process. CHOKe produces a ``leaky buffer'' where packets can be
dropped as they move towards the head of the queue. This leads to
a spatially non-uniform distribution of packets and their
velocity, and makes it possible for a flow to simultaneously
maintain a large number of packets in the queue and receive a
vanishingly small bandwidth share. This is the main mechanism
through which CHOKe protects TCP from UDP flows."
}
@INPROCEEDINGS{Tang0305:Energy,
AUTHOR="Caimu Tang and Cauligi Raghavendra and Viktor Prasanna",
TITLE="An Energy Efficient Adaptive Distributed Source Coding Scheme in Wireless
Sensor Networks",
BOOKTITLE="International Conference on Communications",
ADDRESS="Anchorage, Alaska",
MONTH=may,
YEAR=2003,
ABSTRACT="Sensor networks are used in a variety of applications for event
monitoring, environmental sensing and outer space exploration.
An important application is detecting a target in the field using sensors
gathering acoustic data. In this target detection application (ATR), a
cluster of wireless sensors collect acoustic data and perform signal
processing. In the algorithm used for signal processing, acoustic data
collected by the sensors need to be communicated to a designated head node
for determining the direction of bearing of target. The data collected by
geometrically closely distributed sensors show high spatial correlation
and this correlation is higher as the object moving away from the center
of the sensor cluster. In this paper, our focus is on energy efficient
coding schemes for wireless sensor networks. First we give an analysis to
show why conventional compression schemes give poor performance when
energy consumption for encoding and decoding processing overheads are
considered.
We then describe a new coding scheme called EEADSC which minimizes
the Lagrangrian cost function, i.e. $R + \lambda\_{D} D + \lambda\_{E} E$
(R is the bitrate, D is the distortion, E is the energy and
$\lambda\_{D}$, $\lambda\_{R}$ are the Lagrangrian coefficients).
Our scheme fully exploits spatial
correlation in wireless sensor network and is adaptive according to
tracking signal strength.
We evaluated our scheme using datasets from an ATR application
quantizationup to a factor of 8 data compression. EEADSC uses TCQ and
trellis encoding to represent a 16 bit data value by as few as 2 bits.
With our
scheme, we reduce the overall energy cost for communication in this
application by a factor of 2.53, including the overhead processing cost in
encoding/decoding. The scheme also fits well for general sensor network
applications in which some data collection and aggragation are performed."
}
@INPROCEEDINGS{Tang0305:Reliable,
AUTHOR="Ken Tang and Katia Obraczka and Sung-Ju Lee and Mario Gerla",
TITLE="Reliable Adaptive Lightweight Multicast Protocol",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Typical applications of mobile ad hoc networks (MANET) require
group-oriented services. Digital battlefields and disaster relief
operations make data dissemination and teleconferences a key
application domain. Network-supported multicast is hence critical for
efficient any-to-many communications. However, very little work has
been done on ``reliable'' transport multicast. We propose and evaluate
Reliable Adaptive Lightweight Multicast (RALM). The design choices of
RALM are motivated by lessons we learned from evaluating the
performance of traditional wired reliable multicast transport
protocols (in particular, SRM) in ad hoc networks. We argue that two
components, reliability and congestion control, are essential in
designing a reliable multicast transport protocol for MANETs. RALM
addresses both reliability and congestion control. It achieves
reliability by guaranteeing data delivery to troubled receivers
in a round-robin fashion. RALM's send-and-wait congestion control uses
NACK feedback to adjust to congestion experienced by receivers. We show
through simulations that RALM achieves perfect reliability while
exhibiting low end-to-end delay and minimal control overhead compared
against other protocols."
}
@INPROCEEDINGS{Tang0305:Synchronization,
AUTHOR="Haiyun Tang",
TITLE="Synchronization Schemes for Packet {OFDM} System",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="A complete OFDM synchronization chain is proposed based on practical
synchronization schemes. The synchronization is accomplished in three
steps: frame detection (or timing), frequency offset estimation, and phase
tracking. For frame detection, time-domain differential PN sequence is
used. For frequency offset estimation, time-domain correlation of adjacent
pilot symbols estimates the fractional part of the frequency offset and
frequency-domain differential PN sequence is used to find the integer
part. The phase offset due to frequency offset estimation error as well as
the phase noise is tracked using a digital phase lock loop."
}
@INPROCEEDINGS{Tang0306:Medisyn,
AUTHOR="Wenting Tang and Yun Fu and Lucy Cherkasova and Amin Vahdat",
TITLE="MediSyn: A Synthetic Streaming Media Service Workload Generator",
BOOKTITLE="ACM NOSSDAV 2003",
ADDRESS="Monterey, California, USC",
DAYS=1,
MONTH=jun,
YEAR=2003,
ABSTRACT="Streaming media services are becoming increasingly popular, presenting
new challenges for designers of shared hosting services. These new
challenges result from fundamentally new characteristics of streaming
media relative to traditional web objects, principally different
client access patterns and significantly larger computational and
bandwidth overhead associated with a streaming request.
To understand the characteristics of these new workloads we use two
long-term traces of streaming media services to develop MediSyn, a
publicly available streaming media workload generator. In summary,
this paper makes the following contributions: i) we model the LONG-TERM
behavior of network services capturing the process of file
introduction and changing file popularity, ii) we present a novel
GENERALIZED Zipf-like distribution that captures recently-observed
popularity of both web objects and streaming media not captured by
existing Zipf-like distributions, and iii) we capture a number of
characteristics unique to streaming media services, including file
duration, encoding bit rate, session duration and non-stationary
popularity of media accesses."
}
@ARTICLE{Tang0307:Optical,
AUTHOR="Junhua Tang and Chee Siew and Liren Zhang",
TITLE="Optical nonlinear effects on the performance of {IP} traffic over
GMPLS-based {DWDM} networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=12,
PAGES="1330-1340",
MONTH=jul,
YEAR=2003,
REFERENCES=23,
KEYWORDS="Wavelength division multiplexing; IP; Generalized multiprotocol label
switching; Four-wave mixing; Stimulated Raman scattering",
ABSTRACT="With the introduction of Generalized multiprotocol label switching in the
common control plane for optical crossconnects and electrical switching
devices, the integration of IP and dense wavelength division multiplexing
can be efficiently achieved. When IP traffic flows are directly mapped to
optical channels without SDH inter-layer, the bursty nature of IP traffic
may have significant effect on the performance of the optical channel. On
the other hand, the nonlinear effects of the optical channel may also have
significant effect on the performance at IP level. This paper focuses on
the effect of fiber nonlinearities on the performance of IP traffic.
Numerical results including IP packet error probability and high-order
distribution functions of IP packet error are presented in terms of IP
traffic load, input light signal power and the frequency space between the
optical wavelengths. It is demonstrated that when IP traffic load is light
in such systems, the effect of either four-wave mixing (FWM) or stimulated
Raman scattering (SRS) is much less serious than the worst-case assumption,
and the limitation on allowable power of input light is also relaxed. The
obtained numerical results demonstrated that FWM and SRS are both
sensitive to power level of input light and frequency spacing, but each in
a unique way. Effort must be taken in system design to avoid improving the
performance of one effect at the expense of deteriorating the other.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-4805VF7-3-5M\&\_cdi=5624\&\_orig=browse\&\_coverDate=07\%2F21\%2F2003\&\_sk=999739987\&view=c\&wchp=dGLbVtb-zSkzS\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=2384fbc88f947dd9c058b1a67917be2d\&ie=f.pdf"
}
@INPROCEEDINGS{Tant0305:Performance,
AUTHOR="Weerakhan Tantiphaiboontana and Scott Miller",
TITLE="Performance Analysis of Partial Parallel Interference Cancellation in
Synchronous {DS-CDMA} Systems over Frequency Selective Fading Channels",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we investigate the performance of partial interference
cancellers in forward
link DS-CDMA over time-invariant frequency selective fading channels. An
analytical tool to find the bit error probability is presented. We
also compare the analysis with computer simulations. The results
show that the presented approximation can predict the performance at
low to moderate signal to noise ratios."
}
@INPROCEEDINGS{Tao0103,
AUTHOR="Tao Lin and Scott Midkiff",
TITLE="Mobility versus Link Stability in the Simulation of Mobile Ad Hoc Networks",
BOOKTITLE="Communication Networks and Distributed Systems Modeling and Simulation
Conference (CNDS''03)",
ORGANIZATION="The Society for Modeling and Simulation International (SCS)",
ADDRESS="Virginia Tech.",
MONTH=jan,
YEAR=2003,
REFERENCES=17,
KEYWORDS="MANET; mobility model; link stability; link connectivity; random waypoint
model; two-state Markov model",
ABSTRACT="Because of the significant affect of node mobility on the performance of a
mobile ad hoc network (MANET), simulation studies of MANET routing
protocols must consider node mobility. Further, variations in mobility
model parameters can significantly affect measured results.
Traditionally, mobility is explicitly modeled using a mobility model or
trace data. In this paper, we investigate an alternative approach where a
link connectivity model implicitly represents mobility and the physical
layer. We propose a relatively simple link connectivity model and compare
it to the widely used random waypoint node mobility model. Each potential
link for all pairs of nodes is modeled as a separate two-state Markov
chain to derive a node connectivity matrix. We show that the link
connectivity model offers three advantages over a typical node mobility
model for most studies. First, link connectivity more directly affects
MANET performance, so there is a more direct relation between model
parameters and the network environment seen by a routing protocol. The
end results of different parameter values in a node mobility model are
often difficult to predict. Secondly, our results show that simulations
using the random waypoint model require a long warm-up period for average
link stability statistics to reach steady state. Indeed, link stability
statistics do not reach steady state within the simulation run time of
many reported studies. Finally, a link connectivity model should require
fewer computations and run faster than a node mobility model. While there
is a potential loss of fidelity when compared to a node mobility model, the
practical affect of this is minimal since there is little empirical data to
suggest a benchmark for fidelity."
}
@INPROCEEDINGS{Tao0303,
AUTHOR="Tao Lin and Scott Midkiff and Jahng Park",
TITLE="A Framework for Wireless Ad Hoc Routing Protocols",
BOOKTITLE="IEEE Wireless Communications and Networking Conference (WCNC) 2003",
ORGANIZATION="IEEE",
ADDRESS="Virginia Tech.",
MONTH=mar,
YEAR=2003,
REFERENCES=15,
KEYWORDS="Ad hoc networks; framework; overhead; relay node set; wireless routing
protocols",
ABSTRACT="Many wireless ad hoc routing protocols have been proposed in the
literature. Researchers are comparing and improving these protocols
before standard routing protocols are defined. In this paper, we present
a framework for wireless ad hoc routing protocols based on the concept of
a relay node set (RNS). This framework facilitates the comparison,
design, and improvement of wireless ad hoc routing protocols. We briefly
present an analytical model for comparing protocols using this framework
with packet overhead as the metric. We also apply the framework to show
how to improve a routing protocol. Future work using the framework is
also discussed."
}
@INPROCEEDINGS{Tao0403,
AUTHOR="Tao Lin and Scott Midkiff and Jahng Park",
TITLE="Minimal Connected Dominating Set Algorithms and Application for a {MANET}
Routing Protocol",
BOOKTITLE="IEEE International Performance Computing and Communications Conference
(IPCCC) 2003",
ORGANIZATION="IEEE",
ADDRESS="Virginia Tech.",
MONTH=apr,
YEAR=2003,
REFERENCES=10,
KEYWORDS="wireless ad hoc networks; mobile ad hoc networks; connected dominating set;
broadcast",
ABSTRACT="Blind broadcast in a wireless ad hoc network means any mobile node will
rebroadcast all received broadcast messages. One node may receive the
same copy of a message from more than one neighbor, so unnecessary
overhead is introduced. A connected dominating set (CDS) can be used to
reduce broadcast overhead. We propose a proactive link state routing
protocol, integrated with CDS discovery algorithms, as a promising
approach for routing in wireless ad hoc networks. This paper presents
approximation algorithms to find a minimal CDS for a given network. A
prototype of a proactive link state routing protocol integrated with CDS
algorithms is introduced. Both simulation and analytical results indicate
better performance than other algorithms."
}
@INPROCEEDINGS{Tara0305:Multistage,
AUTHOR="Poramate Tarasak and Hlaing Minn and Vijay Bhargava",
TITLE="Multistage Receiver for Differential Space-Time Block Codes",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Tarokh's differential space-time block codes (DSTBC) can provide full
spatial diversity and can be decoded without channel state information.
The bit error rate performance of a conventional differential detection
has 3-dB degradation compared to a coherent detection in a quasi-static
fading channel. Differential detection experiences more degradation in a
fast fading channel and error floor appears at high SNR. In [5], an
approximate maximum likelihood detector was derived and it reduced the
error floor significantly. In this paper, we modify the detector in [5]
and apply the concept of multistage decision-directed estimator with
self-interference cancellation to obtain further improvement. The proposed
detector works efficiently at moderate to high SNR and at the fading rate
between fdT=0.02 and fdT=0.07."
}
@INPROCEEDINGS{Tasa0305:Psychometric,
AUTHOR="Shuji Tasaka and Yoshihiro Ito",
TITLE="Psychometric Analysis of the Mutually Compensatory Property of Multimedia
QoS",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper quantitatively evaluates the mutually compensatory property
in audio-video transmission over the Internet by the psychometric method.
In our previous study, we used MOS (Mean Opinion Score) as the user-level
QoS parameter; however, MOS is an ordinal scale, and therefore, its value
does not necessarily represent exact difference between the observer's
sensory magnitude. In order to solve this problem, we construct an
interval scale from the MOS values, utilizing the law of categorical
judgment. We then examine how closely MOS approximates an interval scale.
Furthermore, we obtain QoS mapping relations between application-level and
user-level by the principal component analysis and multiple regression
analysis. The regression formula thus derived can demonstrate how much one
medium compensates for the other in a quantitative way with the interval
scale."
}
@TECHREPORT{Tate0306:Worldwide,
AUTHOR="Osamu Tatebe and Satoshi Sekiguchi and Youhei Morita and Satoshi Matsuoka
and Noriyuki Soda",
TITLE="Worldwide Fast File Replication on Grid Datafarm",
TYPE="arXiv report",
NUMBER="cs.PF/0306090",
MONTH=jun,
YEAR=2003,
NOTE="Talk from the 2003 Computing in High Energy and Nuclear Physics (CHEP03),
La Jolla, Ca, USA, March 2003",
ABSTRACT="The Grid Datafarm architecture is designed for global petascale
data-intensive computing. It provides a global parallel filesystem with
online
petascale storage, scalable I/O bandwidth, and scalable parallel
processing,
and it can exploit local I/O in a grid of clusters with tens of thousands
of
nodes. One of features is that it manages file replicas in filesystem
metadata
for fault tolerance and load balancing.
This paper discusses and evaluates several techniques to support
long-distance fast file replication. The Grid Datafarm manages a ranked
group
of files as a Gfarm file, each file, called a Gfarm file fragment, being
stored
on a filesystem node, or replicated on several filesystem nodes. Each
Gfarm
file fragment is replicated independently and in parallel using
rate-controlled
HighSpeed TCP with network striping. On a US-Japan testbed with 10,000 km
distance, we achieve 419 Mbps using 2 nodes on each side, and 741 Mbps
using 4
nodes out of 893 Mbps with two transpacific networks.",
URL="http://arXiv.org/abs/cs/0306090"
}
@INPROCEEDINGS{Teer0305:Power,
AUTHOR="Wiklom Teerapabkajorndet and Prashant Krishnamurthy",
TITLE="Power Control in Multi-rate Mobile Data Networks",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Power control has been extensively studied in cellular networks with
primarily voice traffic. Next generation wireless networks are evolving
towards all-data systems. In particular, transmissions from mobile
stations (MSs) will tend to be bursty and there will be a variety of
transmission rates (multi-rate transmission). Recently, non-cooperative
game theory has been applied to study power control in wireless data
networks. In these studies, MSs are assumed to be transmitting
continuously and all of them at the same rate. We apply non-cooperative
game theory to bursty transmissions and multi-rate systems in this paper.
This results in a power control game of incomplete information. The issues
arising from this change are investigated and numerical results are
provided."
}
@ARTICLE{Thia0306:Optimal,
AUTHOR="Sashisekaran Thiagarajan and Arun Somani",
TITLE="Optimal wavelength converter placement in arbitrary topology
wavelength-routed networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=9,
PAGES="975-985",
MONTH=jun,
YEAR=2003,
REFERENCES=19,
KEYWORDS="Wavelength-routing; Wavelength converters; Blocking probability; Converter
placement",
ABSTRACT="This paper describes an algorithm for optimally placing a given number of
wavelength converters in all-optical networks with arbitrary topologies.
We first introduce the simple network model upon which the algorithm is
based. We provide a formulation of the overall network blocking
probability when a given number of nodes in the network, is provided with
full wavelength conversion capability. We then present our optimal
converter placement algorithm and illustrate its working using a simple
example. The savings offered by our algorithm in the calculation of
blocking performance are analyzed. The benefits of our optimal converter
placement algorithm are studied through network examples such as the path,
NSFnet and the mesh-torus. Finally, some heuristics for converter placement
are presented.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47012K9-1-2P\&\_cdi=5624\&\_orig=browse\&\_coverDate=06\%2F02\%2F2003\&\_sk=999739990\&view=c\&wchp=dGLbVzb-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=c74f2a72cd5fc0c85c1acfb896a93687\&ie=f.pdf"
}
@INPROCEEDINGS{Thir0305:Construction,
AUTHOR="Durai Thirupathi and Keith Chugg",
TITLE="Construction of coset-based low rate convolutional codes and their
application to low rate turbo-like code design",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we propose a novel method to construct low rate
recursive convolutional codes. The `overall' convolutional code
has a block code and a simple recursive convolutional code as
building blocks. The novelty of this type of convolutional code is
that it uses coset leaders in order to distinguish the signals
that originate from different states. Several of these codes are
then used to construct low rate turbo-like codes. Apart from being
bandwidth efficient, simulation results show that these codes
outperform the best known low rate turbo-like codes, the
turbo-Hadamard codes (THC), in additive white Gaussian
noise (AWGN) channel for interleaver sizes of practical interest."
}
@INPROCEEDINGS{Thir0305:Tabbycat,
AUTHOR="Karthik Thirumalai and Jehan-Francois Paris and Darrell Long",
TITLE="Tabbycat: an Inexpensive Scalable Server for Video-on-Demand",
BOOKTITLE="ICC 2003 - Global Services and Infrastructure for Next Generation Networks",
ADDRESS="Anchorage, Alaska",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Tabbycat is a video server prototype demonstrating the benefits of a
proactive approach for distributing popular videos on demand to a large
customer base. Rather than react-ing to individual customer requests,
Tabbycat broadcasts the contents of the most popular videos according to a
fixed schedule. As a result, the number of custom-ers watching a given
video does not affect the cost of distributing it. We found that one
workstation with a single ATA disk drive and a Fast Ethernet interface
could distribute three two-hour videos while achieving a maximum customer
waiting time of less than four minutes."
}
@INPROCEEDINGS{Thom0305:Modulation,
AUTHOR="Timothy Thomas",
TITLE="Modulation and Coding Rate Selection to Improve Successive Cancellation
Reception in {OFDM} and Spread {OFDM} {MIMO} Systems",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper presents a method to determine a different Modulation and Coding
Rate (MCR) to be applied by the transmitter to each MIMO data stream in
frequency-selective communications to improve the performance of a
successive cancellation receiver. In addition, the MCR selection method
assumes a predetermined successive cancellation decoding order thus
simplifying the receiver. Comparisons are made to BLAST with the same MCR
level on each stream with both equal power on each stream and different
power on each stream. The MCR selection BLAST is tested for both OFDM and
spread OFDM in a simulated 18.75 MHz channel. Simulation results for a
spread OFDM system show up to a 4.0 dB improvement in frequency-selective
channels over V-BLAST with equal power and the same MCR level on each
stream. The results also show that in spread OFDM MCR selection with
equal power is a viable alternative to allocating different power on each
stream, but in OFDM the MCR selection with equal power performed worse
than allocating a different power on each stream."
}
@INPROCEEDINGS{Tian0305:Construction,
AUTHOR="Tao Tian and Christopher Jones and John Villasenor and Richard Wesel",
TITLE="Construction of Irregular {LDPC} Codes with Low Error Floors",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This work explains the relationship between cycles, stopping sets,
and dependent columns of the parity check matrix of low-density
parity-check (LDPC) codes. Furthermore, it discusses how these
structures limit LDPC code performance under belief propagation
decoding. A new metric called extrinsic message degree (EMD)
measures cycle connectivity in bipartite graphs. Using an easily
computed estimate of EMD, we propose a Viterbi-like algorithm that
selectively avoids cycles and increases stopping set size. This
algorithm yields codes with error floors that are orders of
magnitude below those of girth-conditioned codes."
}
@INPROCEEDINGS{Tich0305:Finite,
AUTHOR="Petr Tichavsky and Kainam Thomas Wong",
TITLE={Finite-Data-Record Performance/Breakdown Analysis of the ``Blind{"}
Space-Time {DS-CDMA} Rake-Receiver of Wong-Lok-Lehnert-Zoltowski},
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT={Herein presented is a finite-data-record performance analysis
of a ``blind{"} space-time rake-receiver
algorithm previously proposed by Wong, Lok, Lehnert \\& Zoltowski (WLLZ)
[4] for uplink DS-CDMA cellular radiowave wireless communications using
only
single-user-type ``conventional{"} detectors. Derived are two
approximations of the detector's finite-sample mean output-SINR.
This analysis reveals how the output-SINR depends on the multi-user
access cellular system's various system parameters, and the
fading-channel's delay spread and temporal variability.
Simulations confirm this analysis' validity, except when the detector
breaks down in certain small-sample-support situations.
Such breakdown is further shown to be alleviated by overlapping
time-segments in the estimation of the covariance matrix of the
interference-plus-noise delay-segments of the despread signal.}
}
@INPROCEEDINGS{Ting0305:Fast,
AUTHOR="Pau-Chuan Ting",
TITLE="Fast Tuple Space Based Packet Classification Algorithm for Two-Field
Conflict Free Filters",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Packet classification is an important component of new Internet routers to
support various services such as quality of service guarantee and virtual
private network. Basically, packet classification can be considered as a
process looking for the best matching filter in a filter set for several
fields selected from packet header. Various data structures and search
algorithms have been proposed for such multi-field packet classification.
In particular, the nested binary tuple space search algorithm presented in
[18] was designed for two-field conflict free filter sets. The time
complexity of the nested binary search algorithm is (logW)^2, where W is
the length of the fields. In this paper, we first investigate the impact
of built-in markers and associated pre-computation mechanisms on such an
algorithm. We found that, if the nested binary search algorithm employs
unified markers and identical pre-computation manner for them, the search
process may result in a no match while there exist matching filters. The
incorrect decision is caused by conflicts between some markers and
filters. This problem can be resolved by adding resolution filters. We
present in this paper a necessary and sufficient condition to determine
whether or not markers generated by a filter conflict with another filter.
Besides, we further propose a novel search algorithm which can find the
best matching filter in 2(logW) probes. Although more resolution filters
are added, empirical results for random filter sets show that our scheme
requires less memory than the nested binary search algorithm because no
primary markers (and the secondary markers of primary markers) are needed."
}
@INPROCEEDINGS{Tinn0303:Limit,
AUTHOR="Peerapol Tinnakornsrisuphap and Armand Makowski",
TITLE="Limit Behavior of {ECN/RED} Gateways Under a Large Number of {TCP} Flows",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We consider a stochastic model of an ECN/RED gateway under competing TCP
sources sharing the capacity. As the number of the competing flows becomes
large, the queue behavior at
the gateway can be described by a two-dimensional
recursion and the throughput behavior of individual TCP flows becomes
asymptotically independent. The steady-state regime of the
limiting behavior can be calculated from a well-known TCP throughput
model with fixed loss probability. In addition,
a Central Limit Theorem is established, yielding
insight into the relationship between the queue fluctuation and
the marking probability function. We confirm the results
by simulations and discuss their implications for network dimensioning.
Methods keywords:
Stochastic processes/Queueing theory"
}
@INPROCEEDINGS{Tokg0305:Outage,
AUTHOR="Yeliz Tokgoz and Bhaskar Rao",
TITLE="Outage Capacity in {CDMA} Systems Using Receive Antenna Diversity and Fast
Power Control",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we analyze the outage capacity improvements in
multi-cellular code-division multiple access (CDMA) systems using
receive antenna diversity and fast power control schemes that can
track multipath fading. The channel is modelled as slowly-varying
Rayleigh fading with lognormal shadowing and path loss. Closed
from expressions are obtained for the outage capacity of the
system by approximating the total intracell and intercell
interference distributions. We show that by controlling the power
level of a user at the output of the diversity combiner and
imposing the condition that the user denies tranmission when in a
deep fade, the average intercell interference level of the system
is significantly reduced. As a result of this reduction, we
demonstrate both analytically and through simulations that the
outage capacity of the system is improved more than linearly with
increasing number of antenna elements."
}
@INPROCEEDINGS{Toum0305:Byte,
AUTHOR="Dimitris Toumpakaris and Wei Yu and John Cioffi and Daniel Gardan and
Meryem Ouzzif",
TITLE="A Byte-Erasure Method for Improved Impulse Immunity in {DSL} Systems using
Soft Information from an InnerCode",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="A significant portion of the end-to-end delay in high-rate DSL systems is
due to the impulse noise protection scheme
employed in order to shield those systems against random, non-static noise
bursts of high energy that appear on the
copper lines. Systems are protected from impulse noise using a combination
of interleaving and Reed-Solomon
codes. In order to lower the end-to-end delay without reducing the data
rate that is available to the user, one
needs to decrease the interleaver depth.
This paper presents a way to achieve this reduction without compromising
neither the robustness
to noise bursts nor the data rate of the system. The proposed algorithm
relies on the inner code used by many DSL
systems and uses the metric provided by the inner code decoder at the
receiver. A DMT-VDSL system is used as a
particular example of the achieved reduction of the end-to-end delay."
}
@INPROCEEDINGS{Toum0305:Performance,
AUTHOR="Stavros Toumpis and Andrea Goldsmith",
TITLE="Performance, Optimization, and Cross-Layer Design of Media Access Protocols
for Wireless Ad Hoc Networks",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We introduce a methodology for studying wireless ad hoc networks in a
multihop traffic environment. Our approach is to use theoretical upper
bounds on network performance for evaluating the effects of various design
choices: we focus on power control, the queuing discipline, the choice of
routing and media access protocols, and their interactions.
Using this framework, we then concentrate on the problem of medium access
for wireless multihop networks. We first study CSMA/CA, and find that its
performance strongly depends on the choice of the accompanying routing
protocol. We then introduce two protocols that outperform CSMA/CA, both in
terms of energy efficiency and achievable throughput. The \emph{Progressive
Back Off Algorithm (PBOA)} performs medium access jointly with power
control. The \emph{Progressive Ramp Up Algorithm (PRUA)} sacrifices energy
efficiency in favor of higher throughput. Both protocols slot time, and are
integrated with queuing disciplines that are more relaxed than the First In
First Out (FIFO) rule. They are totally distributed and the overhead they
require does not increase with the size and node density of the network."
}
@INPROCEEDINGS{Toum0305:Simple,
AUTHOR="Dimitris Toumpakaris and Wei Yu and John Cioffi and Daniel Gardan and
Meryem Ouzzif",
TITLE="A Simple Byte-Erasure Method for Improved Impulse Immunity in {DSL}",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The data that is transmitted in DSL systems is subject to corruption by
impulse noise, i.e., noise
bursts of high energy that interfere with the transmitted symbols. As DSL
data rates increase and crosstalk mitigation
techniques become more sophisticated, impulse noise limits service in
terms of rate or delay. Because of the highly non-static
nature of impulse noise, a combination of interleaving and Reed-Solomon
coding is currently used to shield systems from noise bursts.
This paper presents a modified impulse noise protection algorithm that
takes advantage of the improved performance of Reed-Solomon
codes when the location of the impaired bytes is known. Without changing
the structure of the encoder or the interleaver,
it is shown that the delay, or equivalently the overhead due to forward
error correction coding, can be reduced without compromising the immunity
of the system to impulses.
A DMT-VDSL system is used as a particular example of the improvement
achieved using byte-erasure."
}
@ARTICLE{Towl0310:Guaranteed,
AUTHOR="Brian Towles and William Dally",
TITLE="Guaranteed Scheduling for Switches With Configuration Overhead",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=5,
PAGES="835-847",
MONTH=oct,
YEAR=2003,
REFERENCES=23,
KEYWORDS="optical switches; packet switching",
ABSTRACT="We present three algorithms that provide performance guarantees for
scheduling switches, such as optical switches, with configuration
overhead. Each algorithm emulates an unconstrained (zero overhead) switch
by accumulating a batch of configuration requests and generating a
corresponding schedule for a constrained switch. Speedup is required both
to cover the configuration overhead of the switch and to compensate for
empty slots left by the scheduling algorithm. Scheduling algorithms are
characterized by the number of configurations N/sub s/ they require to
cover a batch of requests and the speedup required to compensate for empty
slots S/sub min/. Initially, all switch reconfiguration is assumed to occur
simultaneously. We show that a well-known exact matching algorithm, EXACT,
leaves no empty slots (i.e., S/sub min/=1), but requires N/sub s//spl
ap/N/sup 2/ configurations for an N-port switch leading to high
configuration overhead or large batches and, hence, high delay. We present
two new algorithms that reduce the number of configurations required
substantially. MIN covers a batch of requests in the minimum possible
number of configurations, N/sub s/=N, but at the expense of many empty
slots, S/sub min//spl ap/4log/sub 2/N. DOUBLE strikes a balance, requiring
twice as many configurations, N/sub s/=2N, while reducing the number of
empty slots so that S/sub min/=2. Loosening the restriction on
reconfiguration times, the scheduling problem is cast as an open shop. The
best known practical scheduling algorithm for open shops, list scheduling
(LIST), gives the same emulation requirements as DOUBLE. Therefore, we
conclude that our architecture gains no advantages from allowing arbitrary
switch reconfiguration. Finally, we show that DOUBLE and LIST offer the
lowest required speedup to emulate an unconstrained switch across a wide
range of port count and delay.",
URL="http://ieeexplore.ieee.org/iel5/90/27747/01237460.pdf?isNumber=27747\&prod=JNL\&arnumber=1237460\&arSt=+835\&ared=+847\&arAuthor=Towles\%2C+B.\%3B+Dally\%2C+W.J."
}
@INPROCEEDINGS{Tran0303:ZIGZAG,
AUTHOR="Duc Tran and Kien Hua and Tai Do",
TITLE="{ZIGZAG:} An Efficient Peer-to-Peer Scheme for Media Streaming",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We design a peer-to-peer technique called ZIGZAG for single-source
media streaming. ZIGZAG allows the media server to distribute content
to many clients by organizing them into an appropriate tree rooted at
the server. This application-layer multicast tree has a height O(logN)
where N is the number of clients, and a node degree bounded by a
constant. This helps reduce the number of processing hops on the
delivery path to a client while avoiding network bottleneck.
Consequently, the end-to-end delay is kept small. Although one could
build a tree satisfying such properties easily, an efficient control
protocol between the nodes must be in place to maintain the tree under
the effects of network dynamics and unpredictable client behaviors.
ZIGZAG handles such situations gracefully requiring a constant
amortized control overhead. Especially, failure recovery can be done
regionally with little impact on the existing clients and mostly no
burden on the server.
Method keyword: System Design"
}
@ARTICLE{Trim0305:Quality,
AUTHOR="Panos Trimintzios and Timothy Bauge and George Pavlou and Paris Flegkas and
Richard Egan",
TITLE="Quality of service provisioning through traffic engineering with
applicability to IP-based production networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=8,
PAGES="845-860",
MONTH=may,
YEAR=2003,
REFERENCES=31,
KEYWORDS="Quality of service; Traffic engineering; Differentiated services;
Production networks",
ABSTRACT="Production networks require the transport of high-quality multimedia
traffic between outside broadcast vans and the main studio. This is
typically done through dedicated terrestrial or satellite links, with
bandwidth purchased from third party network providers, which is expensive
and lacks flexibility. Given the emergence of IP networks and the Internet
as the multi-service network of choice, it is plausible to consider their
use for transporting production network traffic with high bandwidth and
low delay and packet loss requirements. Emerging technologies for quality
of service such as Differentiated Services and MPLS can be used for
premium quality traffic. In this paper we try to use the emerging IP
technologies to support services like production network traffic. We
present a Traffic Engineering and Control System that starts from agreed
services with customers and provisions the network according to the
expected traffic demand so as to meet the requirements of contracted
services while optimising the use of network resources. We devise a
non-linear programming formulation of the problem and show through
extensive simulations that we can achieve the objectives and meet the
requirements of demanding production network traffic. Our solution is
generic enough and not only tuned to production networks, so it can be
used in other contexts for supporting services with stringent quality of
service requirements.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-474GCTK-2-2G\&\_cdi=5624\&\_orig=browse\&\_coverDate=05\%2F20\%2F2003\&\_sk=999739991\&view=c\&wchp=dGLbVzz-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=cfc5f4f3f0ca5fdee1d90ba899433d3e\&ie=f.pdf"
}
@INPROCEEDINGS{Trip0305:Reliability,
AUTHOR="Vinayak Tripathi and Eugene Visotsky and Roger Peterson and Michael Honig",
TITLE="Reliability-Based Type-II Hybrid {ARQ} Schemes",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Abstract- Hybrid ARQ (HARQ) schemes use a combination of forward error
correction and retransmissions to guarantee reli-able packet data
communications. In this work, we propose a HARQ scheme that exploits
channel state information and received packet quality to improve
system performance. Specifically, the receiver uses the average
magnitude of the log-likelihood ratios corresponding to the received
information bits, in order to determine the sizes of subsequent
retransmissions. The proposed retransmission strategy attempts to
maximize user throughput while satisfying a maximum packet delay
constraint. The performance of our reliability-based type II HARQ
(RBHARQ) scheme is evaluated in static and time-varying channels
through simulations."
}
@INPROCEEDINGS{Tros0305:Seamless,
AUTHOR="Dirk Trossen and Hemant Chaskar",
TITLE="Seamless Mobile Applications across Heterogeneous Internet Access",
BOOKTITLE="ICC 2003 - Global Services and Infrastructure for Next Generation Networks",
ADDRESS="Anchorage, Alaska",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="With the growing popularity of the Mobile Internet, end users would demand
seamless continuation of their Internet applications as they hop across
different access technologies and administrative domains, during an
ongoing session. An important technology to enable this is Mobile IP and
its companion seamless handoff protocols, which are currently under
development in the IETF. These protocols can potentially provide the
mobile end user with a seamless IP connectivity. However, additional
techniques may be required to ensure seamless continuation of the users
Internet applications after an IP-level handoff. In this paper, we focus
on the handoff scenarios in which there is a need to relocate (or
provision) certain application-specific functionality to ensure the
seamless continuation of the users application after handoff. We provide a
solution framework called the Application Context Transfer (ACT) framework
to address this need and describe its application to such handoff
scenarios."
}
@ARTICLE{Tsao0302:Exploiting,
AUTHOR="V. Tsaoussidis and Adrian Lahanas",
TITLE="Exploiting the adaptive properties of a probing device for {TCP} in
heterogenous networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=2,
PAGES="177-192",
MONTH=feb,
YEAR=2003,
REFERENCES=25,
KEYWORDS="Heterogeneous networks; TCP-probing; Adaptive properties; Wired/wireless
networks; energy savings; Transmission Control Protocol",
ABSTRACT="End-to-end protocols lack the functionality to efficiently adjust their
error control strategies to the distinct characteristics of network
environments and to specific constraints of communicating devices. In the
context of heterogeneous networks, error control needs to be responsive to
the nature of the errors spanning a conservative-through-to-aggressive
behavioral spectrum. In the context of mobile, battery-powered devices,
the recovery strategy should yield good performance with a minimal
transmission effort. We exploit the potential of a probing device to
implement an adaptive error control strategy efficiently by shaping data
transmission to be assorted with the distinctive characteristics of the
underlying wired or wireless network components. We graft our mechanism
onto standard TCP; we present encouraging experimental results with wired,
wireless and mobile networks.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-46B792Y-1-1Y\&\_cdi=5624\&\_orig=browse\&\_coverDate=02\%2F01\%2F2003\&\_sk=999739997\&view=c\&wchp=dGLbVtb-zSkzS\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=0ad90607f63dd17af3f8d14029737a1d\&ie=f.pdf"
}
@INPROCEEDINGS{Tsen0305:Direct,
AUTHOR="Ching-Hsiang Tseng",
TITLE="Direct Downconversion of Multiple {RF} Signals Using Bandpass Sampling",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The center idea behind the software radio architecture
is to place analog-to-digital and digital-to-analog converters
as near the antenna as possible, leaving the implementation of the
most radio functionality to a programmable micro or signal processor.
One way to accomplish this in a radio receiver front end
is by direct downconverting the desired radio frequency (RF) signal
to a target intermediate frequency (IF) using bandpass sampling.
Although the bandpass sampling theory for a single RF signal
is well developed, its counterpart for two or more RF signals is
relatively immature. For direct downconverting multiple distinct
RF signals, determining valid bandpass sampling frequencies using
the conventional approach could be a computationally exhaustive
process. In this paper, we propose an efficient method to find
the ranges of valid bandpass sampling frequency for direct downconverting
multiple distinct RF signals. Simple formulas for the
ranges of valid bandpass sampling frequency in terms of bandwidths
and frequency locations of the RF signals are derived. The
result can be used to efficiently choose an appropriate bandpass
sampling frequency for multiple RF signals."
}
@ARTICLE{Tsen0307:Exploiting,
AUTHOR="Chau-Wen Tseng and C. Chen",
TITLE="Exploiting the temporal dimension in QoS-aware multicast routing",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=12,
PAGES="1274-1287",
MONTH=jul,
YEAR=2003,
REFERENCES=20,
KEYWORDS="Multicast; Dynamic routing; QoS routing; Path caching; Ticket-based probing",
ABSTRACT="In this paper, we propose to exploit the temporal dimension in dynamic
QoS-based multicast routing to significantly improve the performance of
previous spatial-oriented protocols while using less control overhead. We
describe the design of a new protocol named T-TBP (temporally correlated
ticket-based probing), which is extended from a previous proposal TBP
(ticket-based probing) protocol [IEEE J. Sel. Areas Commun. 17 (1999)]
that uses a spatial-oriented directed search framework. T-TBP exploits the
temporal dimension based on path caching and tree adjustment mechanisms to
improve the quality of constructed multicast tree and probability of
successful tree construction for member joins in a highly dynamic
environment. The cached path information and tree adjustment mechanisms
circumvent the major difficulties facing current greedy spatial-oriented
approaches, and involve minimal additional overhead. Through extensive
simulation, our proposal is demonstrated to achieve superior performance
than the original protocol. Notably, it is able to construct lower-cost
trees when network load is light, and to achieve higher probability of
success for finding feasible path when network load is heavy.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-48S3WMK-2-4Y\&\_cdi=5624\&\_orig=browse\&\_coverDate=07\%2F21\%2F2003\&\_sk=999739987\&view=c\&wchp=dGLbVzb-zSkzk\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=8578e5ba1ac5ac28e8ff7ce0dbc44e39\&ie=f.pdf"
}
@ARTICLE{Tsen0307:Stop,
AUTHOR="Yu-Chee Tseng and Lien-Wu Chen and Ming-Hour Yang and Jan-Jan Wu",
TITLE="A Stop-or-Move Mobility model for {PCS} networks and its location-tracking
strategies",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=12,
PAGES="1288-1301",
MONTH=jul,
YEAR=2003,
REFERENCES=21,
KEYWORDS="Location management; Location update; Mobile computing; Paging; Personal
communication service; Wireless communication",
ABSTRACT="This paper considers the location-tracking problem in PCS networks.
Solutions to this problem in fact highly depend on the mobility patterns
of mobile subscribers [ACM DIAL-M (1999) 72]. In the literature, many
works have assumed a simple random walk model, where mobile subscribers
always stay in a roaming state and can move in any direction with equal
probability. In this paper, we propose a new Stop-or-Move Mobility (SMM)
model, which is characterized by the following features: transition
between stop and move, infrequent transition, memory of roaming direction,
and oblivious in different moves. Based on this mobility model, a static
and an adaptive location-tracking Scheme are developed. The schemes only
need to keep very little information for each user. Analyses and
simulations are provided, which show that the proposed schemes are quite
prospective.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-48DXJ4S-1-70\&\_cdi=5624\&\_orig=browse\&\_coverDate=07\%2F21\%2F2003\&\_sk=999739987\&view=c\&wchp=dGLbVtb-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=31205c7c31ca8a482b97d9d843c90a9c\&ie=f.pdf"
}
@INPROCEEDINGS{Tsib0303:Exploiting,
AUTHOR="Vagelis Tsibonis and Leonidas Georgiadis and Leandros Tassiulas",
TITLE="Exploiting Wireless Channel State Information for Throughput Maximization",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We consider the problem of scheduling packets over a number of channels
with time varying connectivity. Policies proposed for this problem either
stabilize the system when the arrival rates are within the stability
region, or optimize an objective function under the assumption that all
channel queues are saturated. We address the realistic situation where it
is not known apriori whether the channel queues are saturated or not, and
provide a scheduling policy that maximizes the weighted sum of channel
throughputs. We employ a burstiness-constrained channel model that allows
us to dispense of statistical assumptions and simplifies the proofs.
Methods Keywords: Scheduling, Deterministic Network Calculus, Queueing
Theory, Mathematical programming/Optimization."
}
@INPROCEEDINGS{Tubb0305:Compensation,
AUTHOR="Jan Tubbax and Boris Come and Liesbet {Van der Perre} and Luc Deneire and
Stephane Donnay and Marc Engels",
TITLE="Compensation of {IQ} imbalance in {OFDM} systems",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Today a lot of attention is spent on developing inexpensive OFDM receivers.
Especially, zero-IF receivers are very appealing, because they avoid
costly IF
filters. However, this implies IQ demodulation at RF, which therefore
cannot
be done digitally and thus introduces IQ mismatch. Unfortunately, OFDM is
very
sensitive to receiver IQ imbalance. Therefore, we developed a new
compensation scheme to combat the IQ imbalance at baseband. In this paper,
we
describe the algorithm and present the performance results. Our
compensation
scheme eliminates the IQ imbalance almost perfectly. This leads to
tremendous
improvements, especially in multi-path channels (up to 10 dB performance
gain), and enables low-cost zero-IF receivers."
}
@INPROCEEDINGS{Tubb0305:Mimo,
AUTHOR="Jan Tubbax and Liesbet {Van der Perre} and Stephane Donnay and Marc Engels",
TITLE="{MIMO} Communications for Single-Carrier using Decision-Feedback
Equalization",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="There is an ongoing discussion in the broadband wireless world between OFDM
and
Single-Carrier. Single-Carrier allows for more relaxed front-end
requirements. OFDM, on the other hand, can yield better performance at low
complexity. Recently, a new Single-Carrier scheme with frequency domain
equalization and decision-feedback has been proposed for a SISO channel.
This
Single-Carrier scheme can reach the OFDM performance. We extend this new
scheme for multiple antennas and multiple users. We show that this MIMO
scheme
with decision-feedback has a 3 dB gain over conventional linear Single
Carrier MIMO
schemes and still maintains a low complexity. We illustrate that our
scheme is equivalent with the Generalized Decision-Feedback Equalizer, but
has a lower
complexity."
}
@INPROCEEDINGS{Tuec0305:Design,
AUTHOR="Michael Tuechler",
TITLE="Design of serially concatenated systems for long or short block lengths",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We study the convergence behavior of iterative decoding of
a serially concatenated system for a number of different
constellations such as a concatenated code, coded transmission over a
channel
introducing inter-symbol interference, bit-interleaved coded modulation,
trellis-coded modulation, a.s.o.
We use an analysis technique called EXIT chart to construct simple
irregular codes,
which can be used to improve the convergence of the iterative decoding
algorithm
significantly. An efficient and optimal optimization algorithm is
presented yielding
systems which approach information theoretic limits very closely.
However, these systems exhibit a satisfactory performance only for very
long block lengths.
To overcome this problem, we also show how to optimize a concatenated
system
such that the decoding performance is optimal after a fixed finite amount
of iterations.
It turns out that these systems perform very well for short block lengths,
too.
As an example, optimal system configurations for data transmission over an
AWGN channel are presented."
}
@INPROCEEDINGS{Tuli0305:Design,
AUTHOR="Antonia Maria Tulino and Linbo Li and Sergio Verdu",
TITLE="Design of {MMSE} Multiuser Detectors using Random Matrix Techniques",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Reduced-rank MMSE receivers using asymptotic weights
reduce receiver complexity while maintaining
good performance in long-sequence DS-CDMA systems. In this paper,
we analyze such receivers in multipath fading
channels and extend their design to multicarrier CDMA (both uplink and
downlink ).
An explicit expression is obtained for the asymptotic
eigenvalue moments of the interference autocorrelation matrix and for
the asymptotic weights derived therefrom and used in the reduced-rank
receiver.
The full-rank MMSE receiver is also considered for
multicarrier CDMA and a fixed point equation of the asymptotic
maximum output SINR is derived which particularizes to the
Tse-Hanly fixed point equation for the special case of DS-CDMA."
}
@INPROCEEDINGS{Tung0305:Iterative,
AUTHOR="Eakapong Tungsrisaguan and Nandana Rajatheva and Kazi Ahmed",
TITLE="Iterative Sequential Multiuser Receiver for Asynchronous Coded {CDMA}
Systems over Frequency-Selective Fading Channels",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper investigates a reduced complexity iterative multiuser detector
based on sequential sequence estimation technique for joint detection and
decoding of asynchronous code division multiple access (CDMA) signals over
frequency-selective fading channels. The soft-input soft-output (SISO)
multiuser detector is realized by the soft-output sequential algorithm
(SOSA), previously introduced for turbo equalization systems. The
advantage of this scheme comes from the low complexity of the sequential
algorithm, which is only linearly dependent on the number of users.
Simulation results show that the iterative sequential multiuser detector
can achieve a significant performance gain over the conventional
single-user detector as well as the multistage interference cancellation
(MIC) receiver, and that it suffers a small amount of degradation compared
with the single user performance."
}
@INPROCEEDINGS{Turn0306:Representing,
AUTHOR="Kenneth Turner",
TITLE="Representing New Voice Services and Their Features",
BOOKTITLE="Feature Interactions in Telecommunication Networks",
PUBLISHER="IOS Press",
ADDRESS="Ottawa, Canada",
MONTH=jun,
YEAR=2003,
KEYWORDS="sip;cpl;voicexml;formal methods;services",
ABSTRACT="New voice services are investigated in the fields of Internet telephony
(SIP -- Session Initiation Protocol) and interactive voice systems
(VoiceXML -- Voice Extended Markup Language). It is explained how CRESS
(Chisel Representation Employing Systematic Specification) can graphically
represent services and features in these domains. CRESS is a front-end for
detecting feature interactions and for implementing features. The nature
of service architecture and feature composition are presented. CRESS
descriptions are automatically compiled into LOTOS (Language Of Temporal
Ordering Specification) and SDL (Specification and Description Language),
allowing automated analysis of service behaviour and feature interaction.
For implementation, CRESS diagrams can be compiled into Perl (for SIP) and
VoiceXML. The approach combines the benefits of an accessible graphical
notation, underlying formalisms, and practical realisation.",
URL="ftp://ftp.cs.stir.ac.uk/pub/staff/kjt/research/pubs/serv-sdl.pdf"
}
@INPROCEEDINGS{Tzen0305:Guided,
AUTHOR="Nian-Feng Tzeng",
TITLE="Guided Shared Trees for Efficient Multicast in Large Networks",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Data delivery to multiple recipients in networks can be achieved
effectively via multicast based on a shared tree structure. This paper
deals with a network-layer framework for efficient multicast through
shared trees which are developed with an aid of guided information for
finding nearest known on-tree nodes to connect upon receiving group join
requests. Such information helps to shorten end-to-end delay over a
multicast shared tree so developed, called a guided shared tree (GST). A
designated node, known as a guided information node (GIN), is employed to
provide guidance for a group, and the GIN is found by joining nodes
through the group ID indexing into a list of candidate GINs, in a way
similar to automatic core discovery for CBT. In addition to provide
guidance, GINs may also serve to realize aggregated QoS multicast proposed
in [20]. Multiple GINs can be easily employed for each group to lower
traffic and run-time overhead, since information about on-tree nodes kept
at GINs need not be always current or complete to make our GSTs function
properly. The proposed multicast framework is evaluated by simulation and
is shown to be efficient, readily suitable for large networks where group
members account for a fraction of total nodes and are sparsely located."
}
@ARTICLE{Val0307:Study,
AUTHOR="Thierry Val and Fabrice Peyrard and Michel Misson",
TITLE="Study and simulation of the infrared {WLAN} IrDA: an alternative to the
radio",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=11,
PAGES="1210-1218",
MONTH=jul,
YEAR=2003,
REFERENCES=29,
KEYWORDS="Infrared; IrDA; Protocols; Wireless; WLAN; WPAN; OPNET; Modelisation;
Simulation",
ABSTRACT="The dramatic development of radio solutions for wireless communications
tends to blur the wider use that can be made of infrared transmissions in
a room, a workshop or even a building. For some local applications for
which a wireless part often constitutes the end point of global networks,
the infrared medium can be a real alternative to the radio medium.
Infrareds offer undeniable advantages, and are a technological niche in
the field of in-house wireless LAN. Here the characteristics of this
technology are illustrated and compared with better known radio solutions.
As the world of communications is constantly readjusting to new standards,
the essential characteristics of IrDA, the most significant standard are
presented. The IrDA standard keeps changing to include new aspects. It now
features a set of layers for a complete infrared local network providing
the usual functionality of the different OSI layers. Thus, baud rates of
IrDA products have increased from 115200 bps to 4 Mbps, (even 30 Mbps)
paving the way for future multimedia applications demanding high baud
rates. Many new modelisations and simulations with OPNET have facilitated
the study and the analysis of this IR standard.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-478YXBY-1-11\&\_cdi=5624\&\_orig=browse\&\_coverDate=07\%2F01\%2F2003\&\_sk=999739988\&view=c\&wchp=dGLbVzz-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=d37ff3eb68ad24660e064ee00a2ac11e\&ie=f.pdf"
}
@INPROCEEDINGS{Vale0303:Cooperative,
AUTHOR="Alvin Valera and Winston Seah and S.v. Rao",
TITLE="Cooperative Packet Caching and Shortest Multipath Routing in Mobile Ad hoc
Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="A mobile ad hoc network is an autonomous system of infrastructureless,
multihop wireless mobile nodes. Reactive routing protocols perform well in
such an environment due to their ability to cope quickly against
topological changes. In this paper, we propose a new routing protocol
called Caching and Multipath (CHAMP) Routing Protocol. CHAMP uses
cooperative packet caching and shortest multipath routing to reduce packet
loss due to frequent route breakdowns. Simulation results reveal that by
using a five-packet data cache, CHAMP exhibits excellent improvement in
packet delivery, outperforming AODV and DSR by at most 30\% in stressful
scenarios. Furthermore, end-to-end delay is significantly reduced while
routing overhead is lower at high mobility rates."
}
@INPROCEEDINGS{Vale0305:Using,
AUTHOR="Giuseppe Valetto and Gail Kaiser",
TITLE="Using Process Technology to Control and Coordinate Software Adaptation",
BOOKTITLE="International Conference on Software Engineering",
MONTH=may,
YEAR=2003
}
@INPROCEEDINGS{Vanb0305:Bitrate,
AUTHOR="Koen Vanbleu and Geert Ysebaert and Gert Cuypers and Marc Moonen and
Katleen {Van Acker}",
TITLE="Bitrate Maximizing Time-Domain Equalizer Design for DMT-based Systems",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT={A time-domain equalizer (TEQ) is inserted in discrete multitone (DMT)
receivers to impose channel shortening and hence overcome the need for a
too long cyclic prefix. Many algorithms have been developed to initialize
this TEQ, but none of them really optimizes the bitrate. In this paper, we
present a new bitrate maximizing TEQ (BM-TEQ) cost function that results in
a TEQ design/initialization that outperforms any other TEQ design. In the
derivation, we exploit the fact that the frequency-domain equalizers (FEQ)
do not alter the SNR on the individual tones. The performance of this
BM-TEQ comes close to the performance of the per-tone equalizer (PTEQ), an
alternative DMT equalization structure that ensures consistently better
performance than a TEQ. Finally, the presented BM-TEQ design is also used
in a {"}per group{"} equalization scheme (PGEQ), which is intermediate (in
terms of memory requirement and performance) between TEQ and PTEQ. The PGEQ
design then encompasses BM-TEQ and PTEQ design procedures as extreme cases.}
}
@INPROCEEDINGS{Vanc0312:Optimizations,
AUTHOR="Megan Vance and Christine Bexley",
TITLE="Optimizations made to the FreeBSD Operating System",
BOOKTITLE="University of Notre Dame CSE542",
MONTH=dec,
YEAR=2003,
ABSTRACT="the main purpose of this work is for us to begin learning about the
internals of an operating system by choosing and installing two instances
of a web server, configuring the web server to run two instances on two
different ports, generating content for the web space, and installing,
configuring, and operating appropriate benchmarks, so that we can tweak
some kernel parameters and measure the performance difference between the
two web servers. We chose to use the FreeBSD operating system version 5.1,
with apache server version 1.3.28, which was benchmarked with siege, an
open source stress tester. The web server and the benchmark were both run
on 1.8 GHz Pentium processor machines with 256 MB of main memory,
connected by dual Network Interface Cards with a dedicated Gigabit link.
The parameters that we tweaked were runtime controls and priority
scheduling parameters. Overall, the effects of these optimizations was
very small as would be expected since they are not large changes and the
system is already running very well."
}
@INPROCEEDINGS{Vane0305:Realising,
AUTHOR="Erik Vanem",
TITLE="Realising Service Portability with the Device Unifying Service using Parlay
{API}",
BOOKTITLE="ICC 2003 - Global Services and Infrastructure for Next Generation Networks",
ADDRESS="Anchorage, Alaska",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The Device Unifying Service presented in this paper is a powerful concept
that realises service portability between different devices. It extends
the VHE concept by allowing the usage of multiple devices simultaneously
and the possibility of adding, removing or changing devices both on the
fly or ac-cording to predefined profiles. The Device Unifying Service
addresses both service portability for communication services and data
services. Communication services like a normal phone call can for example
easily be transferred from a fixed phone to a mobile phone or an IP phone
with the Device Unifying Service. Additionally, a data service like a WEB
browsing session can be transferred from a PC to a laptop or PDA including
cached information like history and bookmarks. Providing an easy way of
moving services between devices, the Device Unifying Service thus fulfils
the vision of service portability in an elegant way.
This paper presents the concept of the Device Unifying Service, a novel
service that will take care of the management, coordination and
configuration of all the devices that the user has at his disposal and
provide service portability and adaptation of services to devices with
different characteristics. Furthermore, this paper will reveal how the
first version of the Device Unifying Service has been implemented using
Parlay APIs and H.323 technologies."
}
@INPROCEEDINGS{Varb0303:Resource,
AUTHOR="Peter Varbrand and Di Yuan and Patrik Bjorklund",
TITLE="Resource Optimization of Spatial {TDMA} in Ad Hoc Radio Networks: A Column
Generation Approach",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Wireless communications using ad hoc networks are receiving an increasing
interest. The most attractive feature of ad hoc networks is the
flexibility. The network is set up by a set of units in an ad hoc manner,
without the need of any fixed infrastructure. Communication links are
established between two units whenever the signal strength is sufficiently
high. As not all pairs of nodes can establish direct links, the traffic
between two units may have to be relayed through other units. This is
known as the multi-hop functionality.
Design and development of ad hoc networks is a challenging task. In this
paper we study the problem of resource allocation with spatial TDMA
(STDMA) as the access control scheme. Previous work for this problem has
mainly focused on heuristics, whose performance is difficult to analyze
when optimal solutions are not known. We develop, for both node-oriented
and link-oriented allocation strategies, both direct and set covering
formulations for resource optimization. We further present a column
generation approach which, in our numerical experiments, constantly yields
optimal or near-optimal solutions. Our results provide important benchmarks
when evaluating heuristic on-line algorithms for resource optimization
using STDMA."
}
@INPROCEEDINGS{Varm0305:Mobility,
AUTHOR="Vijay Varma and Daniel Wong",
TITLE="Mobility Management in Integrated {UMTS/WLAN} Networks",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The complementary characteristics of Universal Mobile Telecommunications
System (UMTS) and 802.11 Wireless Local Area Network (WLAN) networks make
them attractive for integration to offer the best of both technologies.
However to make their integration really effective, seamless mobility
between the two networks is necessary. In this paper we address mobility
management procedures within and between UMTS and 802.11 WLAN for various
integration scenarios. For each integration option we consider, we give
the interaction between various networks elements and new procedures
required to ensure seamless mobility."
}
@INPROCEEDINGS{Vasi0305:Runlength,
AUTHOR="Bane Vasic and Karunakar Pedagani",
TITLE="A Runlength Limited Low-Density Parity-Check Coding Scheme",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper we propose a novel approach to modulation and error control
coding. The idea is to completely eliminate a constrained code and,
instead, impose the constraint by the deliberate introduction of bit
errors before transmission. The redundancy that would have been used for
imposing the constraint is used in our scheme to strengthen the error
control code (ECC), in such a way that the ECC becomes capable of
correcting both deliberate errors as well as channel errors that occurs
during the detection. The proposed ECC-modulation scheme is based on
iterative decoding of low-density parity-check codes (LDPC) and a
runlength constraint."
}
@INPROCEEDINGS{Vass0305:M,
AUTHOR="Vasos Vassiliou and Henry Owen and David Barlow",
TITLE="{M-MPLS:} Micromobility-enabled Multiprotocol Label Switching",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper presents the integration of multiprotocol label switching with
hierarchical mobile IPv6. The resulting micromobility-based MPLS (M-MPLS)
is defined in two modes of operation: overlay and integrated. In an
overlay framework MPLS and HMIP operate on their respective layers without
having common processes, tables, or signaling. In an integrated framework,
related functions are merged. The overall goal of an integrated framework
is to facilitate efficient and reliable network operations while
simultaneously optimizing network utilization and system performance."
}
@INPROCEEDINGS{Velt0305:Access,
AUTHOR="Luca Veltri and Andrea Floris",
TITLE="Access Control in IPv6-based Roaming Scenarios",
BOOKTITLE="ICC 2003 - Global Services and Infrastructure for Next Generation Networks",
ADDRESS="Anchorage, Alaska",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This work deals with the problem of roaming among heterogeneous networks
for IPv6-based terminals. When an IPv6 terminal accesses to a foreign
domain it should perform two main actions: it should authenticate with the
new domain (user or terminal authentication), and it should configure the
interface according to the current point of attachment to the network
(dynamic terminal configuration). In this paper, we investigate how the
autoconfiguration procedures provided by IPv6 (both stateless and
stateful) can be integrated with the access control functionality supplied
by a general AAA framework. The aim is providing a general framework that
allows roaming terminals to efficiently accede to IP services from foreign
subnets."
}
@INPROCEEDINGS{Velt0305:Solutions,
AUTHOR="Luca Veltri and Andrea Floris and Lorenzo Tosetti",
TITLE="Solutions for Mobility Support in DHCP-based Environments",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In a wireless mobile scenario it is very important for IP terminals to
automatically reconfigure themselves when moving amongst different access
networks. Each time that a terminal changes its point of attachment it
should rapidly detect the new access network, acquire a new IP
configuration according to the new network, and opportunely reconfigure
itself. During this operation crucial aspects are the latency of the
overall procedure, the processor and packet load, the scalability, the
independence from the access technique (WLAN, GPRS, others), and the
compatibility with the current implementations of terminal
mobility/nomadicity. In this work the problem of roaming amongst IP-based
access network is considered and the issues of subnet detection and
terminal configuration are focused. Particularly, we propose and describe
in detail some solutions that are based on a simple extension of the
largely implemented DHCP protocol. The proposed mechanisms are very light,
scalable, and could be compatible with the current implementations."
}
@ARTICLE{Vend0308:Analysis,
AUTHOR="Andrea Vendictis and Andrea Baiocchi and Michela Bonacci",
TITLE="Analysis and enhancement of {TCP} Vegas congestion control in a mixed {TCP}
Vegas and {TCP} Reno network scenario",
JOURNAL="Performance Evaluation",
VOLUME=53,
NUMBER="3-4",
PAGES="225-253",
MONTH=aug,
YEAR=2003,
REFERENCES=23,
KEYWORDS="TCP Vegas; TCP Reno; Performance modeling",
ABSTRACT="Its more refined congestion control mechanisms, also based on the
estimation of round trip delays, allow TCP Vegas to outperform the more
widespread TCP Reno congestion control, based only on the packet loss
detection, in a number of network environments. However, these mechanisms
make TCP Vegas less aggressive with respect to TCP Reno; thereby TCP Vegas
sources show high weakness in taking the available bandwidth when competing
with other TCP Reno sources. This is a major reason that hinders the spread
of TCP Vegas among Internet users. In this work, after a preliminary
analytic study about the limits of TCP Vegas in mixed network
environments, we describe a new adaptive mechanism for TCP Vegas, called
TCP NewVegas, designed in order to improve its performance even in
heterogeneous network scenarios. The large number of simulations,
presented in this paper, show that TCP NewVegas guarantees good
performance even in mixed network environments, without canceling the
desirable features (e.g. fairness) that TCP Vegas exhibits in homogeneous
environments.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-48NC1S3-1-88\&\_cdi=5663\&\_orig=browse\&\_coverDate=08\%2F31\%2F2003\&\_sk=999469996\&view=c\&wchp=dGLbVlz-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=44e5e565e776e09abfb0c42342a61503\&ie=f.pdf"
}
@ARTICLE{Vere0305:TCP,
AUTHOR="Andras Veres and Zs. Kenesi and Sándor {Molnár} and G. Vattay",
TITLE="TCP's role in the propagation of self-similarity in the Internet",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=8,
PAGES="899-913",
MONTH=may,
YEAR=2003,
REFERENCES=33,
KEYWORDS="TCP congestion control; Self-similarity; Long-range dependence; TCP
adaptivity",
ABSTRACT="This paper analyzes how TCP congestion control can propagate
self-similarity between distant areas of the Internet. This property of
TCP is due to its congestion control algorithm, which adapts to
self-similar fluctuations on several timescales. The mechanisms and
limitations of this propagation are investigated. It is demonstrated that
if a TCP connection shares a bottleneck link with a self-similar
background traffic flow, it propagates the correlation structure of the
background traffic flow asymptotically, above a characteristic timescale.
The cut-off timescale depends on the end-to-end path properties, e.g.
round-trip time and average window size, and the receiver window size in
case of high-speed connections. It is also shown that even short TCP
connections can propagate long-range correlations effectively. In case
when TCP encounters several bottleneck hops, the end-user perceived
end-to-end traffic is also long-range dependent and it is characterized by
the largest Hurst exponent. Through simple examples, it is shown that
self-similarity of one TCP stream can be passed on to other TCP streams
that it is multiplexed with. The limitations of propagation depend on
network conditions. Propagation complements the widespread scaling
phenomena reported in the literature. Our arguments are supported with a
combination of analytic techniques, simulations and statistical analyzes
of a number of wide area Internet traffic measurements.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-473N429-5-5P\&\_cdi=5624\&\_orig=browse\&\_coverDate=05\%2F20\%2F2003\&\_sk=999739991\&view=c\&wchp=dGLbVlz-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=c5d6bc6814f6255979344983bf1bc2ca\&ie=f.pdf"
}
@INPROCEEDINGS{Verm0305:Subscriber,
AUTHOR="Tim Vermeiren",
TITLE="Subscriber Loop Topology Classification by means of Time-Domain
Reflectometry",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Qualifying a subscriber loop for xDSL transmission can be done in many
ways.
Amongst all ways, methods that don't require an expensive truck-roll
to the customer are preferred.
In this paper we provide a method for an intelligent automated
interpretation
of reflectometric 1-port measurements at the central office.
First we will focus on how reflectograms can be characterised. Next we
will
build up intelligence in the system to deal with the uncertainty on the
characteristics and to infer the topology by means of a belief network.
Eventually we will combine in an artificial intelligent way, by means of a
rule-based expert system all
available knowledge and derive the basic loop properties i.e. the topology
and
the delays of the individual line sections."
}
@ARTICLE{Vitt0306:DP,
AUTHOR="S. Vitturi",
TITLE="DP-Ethernet: the Profibus {DP} protocol implemented on Ethernet",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=10,
PAGES="1095-1104",
MONTH=jun,
YEAR=2003,
REFERENCES=24,
KEYWORDS="Ethernet; Profibus DP; Real time; Protocol",
ABSTRACT="The use of Ethernet networks at the low level of factory automation
systems, which is even more frequent, requires the adoption of real time
protocols to implement the typical functions of this level.
This paper investigates the possibility of using of a very popular
fieldbus protocol, Profibus DP, as a real time protocol for Ethernet. The
proposal, named DP-Ethernet, makes use of the IEEE 802.2 Logical Link
Control to implement the Profibus DP functions on Ethernet.
The paper shows how DP-Ethernet could be implemented maintaining the
compatibility with already existing Profibus DP applications. Moreover,
some DP-Ethernet performance figures, obtained with a software simulation
package, are given.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-4772S71-3-W\&\_cdi=5624\&\_orig=browse\&\_coverDate=06\%2F20\%2F2003\&\_sk=999739989\&view=c\&wchp=dGLbVlb-zSkWW\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=9fc3a0966f38cd0b3a21b037559d9ab1\&ie=f.pdf"
}
@INPROCEEDINGS{Vlaj0305:Wireless,
AUTHOR="Natalija Vlajic and Charalambos Charalambous and Dimitrios Makrakis",
TITLE="Wireless Data Broadcast in Systems of Hierarchical Cellular Organization",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In recent years, both wireless data broadcast (WDB) and hierarchical cell
structure (HCS) have attracted the attention of the scientific community,
yet they have been treated as entirely separate research topics. This
paper presents one of the first attempts to bring the two subjects
together. In particular, the paper deals with the issue of optimized data
broadcast in systems of hierarchical cellular organization. We see the
following as the main contributions of the paper: 1) considerably superior
performance of HCS- over single-layer- WDB systems is proven; 2) an
algorithm for fast identification of the optimal broadcast schedule in
HCS-WDB systems is proposed. As we are moving in the era of pervasive
computing, where millions of devices many of them of mobile and nomadic
nature will be requesting network support for retrieval of information,
development of efficient wireless based transfer systems becomes immensely
important."
}
@INPROCEEDINGS{Vokk0305:Channel,
AUTHOR="Vinod Vokkarane and Guru Thodime and Venkata Challagulla and Jason Jue",
TITLE="Channel Scheduling Algorithms using Burst Segmentation and FDLs for Optical
Burst-Switched Networks",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Optical burst switching is a promising solution for terabit
transmission of IP data bursts over WDM networks. One of the key
components in the design of optical burst-switched nodes
is the development of channel scheduling algorithms that can
efficiently handle data burst contentions. Currently, traditional
scheduling techniques use wavelength conversion and buffering to
resolve burst contention. In this paper, we reduce packet losses
by proposing a number of data channel scheduling algorithms that
use burst segmentation and fiber delay lines (FDLs). The proposed
scheduling algorithms are classified based on the placement
of the FDL buffers in the optical burst-switched node and are
referred to as delay-first or segment-first schemes. Simulation
results show that these algorithms can effectively
reduce the packet loss probability compared to existing
scheduling techniques."
}
@INPROCEEDINGS{Wada0305:Study,
AUTHOR="Tadahiro Wada",
TITLE="A Study on the Performance of Turbo Coding for Noise Environments in Power
Lines",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Power Line Communications (PLC) is a very attractive method for in-home
networks. To achieve high transmission rates, effective measures need to
be taken against the peculiar noise in power lines.
Turbo codes are candidates to limit the effect of the noise.
The noise in power lines is modeled as a cyclostational zero mean Gaussian
process. Since the noise is time variant,
accurate estimates of SNR are required to iterative decoding of turbo
codes.
This paper discusses the effect of turbo codes on the
noise in power lines. By evaluating bit error rate,
it can be found that performance depends on the relation between the
period of the AC source and the size of the interleaver. It is also shown
that accurate SNR estimates are required for the turbo codes to improve
the performance of PLC."
}
@INPROCEEDINGS{Wagn0305:Pairwise,
AUTHOR="Aaron Wagner and Venkat Anantharam",
TITLE="A Pairwise Error Probability Bound for the Exponential-Server Timing
Channel",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We exhibit upper and lower bounds on the pairwise error probability
of the exponential-server timing channel in terms of an
appropriately-defined distance between codewords.
We show that this distance plays a crucial role in determining the
reliability function at low rates. In particular, by lower bounding
the minimum distance of good low-rate codes, we provide
an improved lower bound on the reliability function of the
channel at rate zero. This improved bound proves that at low rates,
the exponential-server
timing channel is strictly more reliable than is the related Poisson
channel with zero dark current, answering an open question
posed by Arikan. Some remarks are also made about using the results of
this
paper to prove an improved upper bound on the reliability function at rate
zero."
}
@INPROCEEDINGS{Waki03:ORC,
AUTHOR="Ryuji Wakikawa and Susumu Koshiba and Keisuke Uehara and Jun Murai",
TITLE="{ORC:} Optimized Route Cache Management Protocol for Network Mobility",
BOOKTITLE="10th IEEE International Conference on Telecommunications, ICT 2003",
ADDRESS="Papeete, Tahiti",
YEAR=2003
}
@INPROCEEDINGS{Wald0305:Colorwave,
AUTHOR="James Waldrop and Daniel Engels and Sanjay Sarma",
TITLE="Colorwave: An Anticollision Algorithm for the Reader Collision Problem",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We present the Colorwave algorithm, a simple, distributed,
on-line algorithm for the {\em Reader Collision Problem} in
Radio Frequency Identification (RFID) systems. RFID systems are
increasingly being used in applications, such as those experienced in
supply chain management, which require RFID readers to operate in close
proximity to one another. Readers physically located near one another
may interfere with one another's operation. Such {\em reader
collisions} must be minimized to ensure the correct operation of the
RFID system. The Colorwave algorithm yields on-line solutions that are
near the optimal static solutions. The dynamic nature of the
algorithm enables the RFID system to automatically adapt to changes in
the system and in the operating environment of the system."
}
@ARTICLE{Walk0301:Spectrum,
AUTHOR="Bernhard Walke and Vinod Kumar",
TITLE="Spectrum issues and new air interfaces",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=1,
PAGES="53-63",
MONTH=jan,
YEAR=2003,
REFERENCES=11,
KEYWORDS="WWRF; Air interfaces; Spectrum issues; Ultra wideband; Smart antenna",
ABSTRACT="This is a Summary version of the propositions and ideas contained in the
Draft 2001 Book of Visions (BoV) from the Wireless World Research Forum
(WWRF). The findings of Working Group 4 entitled Spectrum, New Air
Interfaces and Ad Hoc Networking related to the two domainsSpectrum Issues
and New Air Interfacesare covered in this article. The material presented
contains excerpts from the many contributions received as submissions to
the five WWRF meetings in 2000 and 2001. Moreover, the views reflected
here may or may not be approved by the organizations of affiliation of the
authors above. It appears impracticable to name the many contributors to
the work of WG4 here, since this text is a compressed version of the
respective chapters of the BoV and the contributors are named there. The
work related to three other domains in WG4, namely Smart Antennas, Ad Hoc
Networking and Ultra Wideband systems are presented in separate articles
in this journal.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-45W39W6-3-K\&\_cdi=5624\&\_orig=browse\&\_coverDate=01\%2F01\%2F2003\&\_sk=999739998\&view=c\&wchp=dGLbVtz-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=d7587172605ca7a9713be27d43e66308\&ie=f.pdf"
}
@ARTICLE{Wan0305:Optimal,
AUTHOR="Peng-Jun Wan and Ophir Frieder and Liwu Liu",
TITLE="Optimal placement of wavelength converters in trees, tree-connected rings,
and tree of rings",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=7,
PAGES="718-722",
MONTH=may,
YEAR=2003,
REFERENCES=16,
KEYWORDS="Wavelength routed optical network; Wavelength converter; Minimum vertex
cover; Tree; Tree-connected rings; Tree of rings",
ABSTRACT="In wavelength routed optical networks, wavelength converters can
potentially reduce the requirement on the number of wavelengths. A recent
study [Proceedings of 9th ACM-SIAM Symposium on Discrete Algorithms
(1998)] raised the following problem: choose a minimum number of nodes in
a WDM network to place wavelength converters so that any set of paths
requires the same number of wavelengths as if wavelength converters were
placed at all node. This problem is referred to as minimum sufficient set
problem. It was shown to be NP-complete in general WDM networks
[Proceedings of 9th ACM-SIAM Symposium on Discrete Algorithms (1998)], and
be as hard as the well-known minimum vertex cover problem [Proceedings of
10th ACM-SIAM Symposium on Discrete Algorithms (1999)]. In this paper, we
extend their study in trees, tree-connected rings, and tree of rings which
are widely used topologies in the telecommunications industry. We show that
the optimal wavelength converter placement problem in these two practical
topologies are tractable. Efficient polynomial-time algorithms are
presented.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-473N429-4-1C\&\_cdi=5624\&\_orig=browse\&\_coverDate=05\%2F01\%2F2003\&\_sk=999739992\&view=c\&wchp=dGLbVtb-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=a983ef464fb0855315716da728c631ac\&ie=f.pdf"
}
@ARTICLE{Wan0305:Wavelength,
AUTHOR="Peng-Jun Wan and Liwu Liu and Ophir Frieder",
TITLE="Wavelength assignment to minimize requirement on tunable range of optical
transceivers in {WDM} networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=7,
PAGES="774-779",
MONTH=may,
YEAR=2003,
REFERENCES=10,
KEYWORDS="WDM; Free spectral range; Tunable range; Minimum bandwidth; Wavelength
assignment",
ABSTRACT="In this paper we consider WDM networks with a tunable transmitter and a
fixed-wavelength receiver at each station (similar results hold when the
transmitter is fixed and the receiver is tunable). Traditionally, each
station is required to be able to access all wavelength channels used in
the network. Such requirement limits the number of wavelengths that can be
exploited in a WDM network up to the size of the resolvable wavelength set
of optical transceivers, which is very limited with current technology. In
this paper we observe that this requirement is actually an overkill. To
realize a communication topology, physical or logical, it is sufficient
that the tunable range of the transmitter at each station covers all the
wavelengths of the receivers at its neighboring stations. This observation
leads to the study of optimal wavelength assignment to minimize the
tunability requirement while still guaranteeing that each receiver has a
unique wavelength channel. This optimization problem is shown to
NP-complete in general and approximation algorithms with provable
performance guarantees are presented. When the communication topologies
are complete graphs, de Bruijin digraphs, Kautz digraphs, shuffle or
rings, the optimal solutions are provided. Finally, we present tight lower
bounds when the communication topology is a hypercube.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47603MJ-2-5J\&\_cdi=5624\&\_orig=browse\&\_coverDate=05\%2F01\%2F2003\&\_sk=999739992\&view=c\&wchp=dGLbVzb-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=bd699090875a73bcd62fafe611c13b32\&ie=f.pdf"
}
@ARTICLE{Wan0309:Fast,
AUTHOR="Chiang-Shiang Wan and Wei-Kuan Shih and Ruei-Chuan Chang",
TITLE="Fast dynamic code assignment in next generation wireless access networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=14,
PAGES="1634-1643",
MONTH=sep,
YEAR=2003,
REFERENCES=13,
KEYWORDS="Channelization code; Spreading factor; Code-tree; Dynamic code assignment",
ABSTRACT="In this paper, a fast dynamic code assignment (FDCA) algorithm is proposed
to assign a single Orthogonal Variable Spreading Factor (OVSF)-code for a
data rate requirement in next generation wireless access networks. Our
algorithm uses the code assignment operation to evaluate the cost for an
OVSF-code allocation. The cost is determined by maintaining the data
structure that keeps track the number of available and occupied descendant
codes of the code. Based on the cost assignment operation, FDCA algorithm
can assign an OVSF-code by reassigning occupied descendant codes for a
requested data rate. The OVSF-codes assigned by our algorithm is
unrestricted with decreasing spreading factor. Moreover, two types of
simulations and experimental measurements are presented. First, the
proposed algorithm is applied on the OVSF-code assignment of restricted
spreading vector. Our experimental results show that the number of
reassigned OVSF-codes within FDCA algorithm is reduced comparing to other
scheme proposed in the literature. Then, for serving higher data rate
requirements, our scheme also shows significant improvement on the
spectral efficiency over fixed code assignment scheme.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-48KDGBC-1-7G\&\_cdi=5624\&\_orig=browse\&\_coverDate=09\%2F01\%2F2003\&\_sk=999739985\&view=c\&wchp=dGLbVlb-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=c04fd0dc253586bdd195e273fb6a5c95\&ie=f.pdf"
}
@ARTICLE{Wan0311:Real,
AUTHOR="Chiang-Shiang Wan and Wei-Kuan Shih and Ruei-Chuan Chang",
TITLE="Real-time packet scheduling in next generation radio access system",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=17,
PAGES="1931-1943",
MONTH=nov,
YEAR=2003,
REFERENCES=18,
KEYWORDS="Real-time scheduling; Radio access network; Quality of service;
Channelization code; Early-deadline-first; Dynamic code assignment",
ABSTRACT="All IP-based radio access network enable packet-oriented connections to
offer real-time applications. Radio access networks must provide efficient
radio management for data session establishments because of scarce radio
resources. In this paper, we present three real-time scheduling algorithms
to support quality-of-service at IP-based radio access networks. The
real-time generic scheduling (RTGS) algorithm applies the functionalities
of the radio management framework to establish new data sessions for
real-time service requests. The real-time bandwidth scheduling (RTBS)
algorithm implements the early-deadline-first scheme to do the
schedulability analysis and to schedule the data sessions to reduce power
consumption. The RTBS algorithm can decrease the power consumption more
than can RTGS. Based on the RTBS mechanism, we design the real-time code
scheduling (RTCS) algorithm. In this algorithm, we apply the dynamic code
assignment scheme to increase the probability of schedulable sessions and
improve the radio resource utilization. Experimental results show that
RTCS outperforms RTBS and, in turn, RTBS outperforms RTGS.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-48S4CP8-4-6J\&\_cdi=5624\&\_orig=browse\&\_coverDate=11\%2F01\%2F2003\&\_sk=999739982\&view=c\&wchp=dGLbVtb-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=19c680d5197128994f6c4b5553b14f7b\&ie=f.pdf"
}
@INPROCEEDINGS{Wang0303:Can,
AUTHOR="Jiantao Wang and Lun Li and Steven Low and John Doyle",
TITLE="Can Shortest-path Routing and {TCP} Maximize Utility",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="TCP-AQM protocol can be interpreted as distributed primal-dual
algorithms over the Internet to maximize aggregate utility. In
this paper we study whether TCP-AQM together with shortest-path
routing can maximize utility with appropriate choice of link cost,
on a slower timescale, over both source rates and routes. We show
that this is generally impossible because the addition of route
maximization makes the problem NP-hard. We exhibit an inevitable
tradeoff between routing instability and utility maximization. For
the special case of ring network, we prove rigorously that
shortest-path routing based purely on congestion prices is
unstable. Adding a sufficiently large static component to link
cost, stabilizes it, but the maximum utility achievable by
shortest-path routing decreases with the weight on the static
component. We present simulation results to illustrate that these
conclusions generalize to general network topology, and that
routing instability can reduce utility to less than that
achievable by the necessarily stable static routing."
}
@INPROCEEDINGS{Wang0303:FDD,
AUTHOR="Xudong Wang",
TITLE="An {FDD} Wideband {CDMA} {MAC} Protocol for Wireless Multimedia Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="In this paper a medium access control (MAC) protocol is developed for
wireless multimedia networks based on frequency division duplex (FDD)
wideband code division multiple access (CDMA). In order to guarantee
the heterogeneous bit error rates (BERs) of multimedia traffic, a
minimum-power allocation algorithm is first derived to control the
received power levels of simultaneously transmitting users. In such
an algorithm, both multi-code (MC) and
orthogonal-variable-spreading-factor (OVSF) transmissions are
considered for multimedia traffic. Based on the minimum-power
allocation algorithm, a multimedia wideband CDMA generalized processor
sharing (GPS) scheduling scheme is proposed. It provides fair queueing
to multimedia traffic with different QoS constraints. It also takes
into account the limited number of code channels for each user and the
variable system capacity due to interference experienced by users in a
CDMA network. In order to admit real-time connections, an
effective-bandwidth connection admission control (CAC) algorithm is
derived based on minimum-power allocation. With the effective-bandwidth
CAC algorithm and the wideband CDMA GPS scheduling scheme, the new MAC
protocol is capable of guaranteeing QoS of both real-time and
non-real-time services in an FDD wideband CDMA network. Its performance
is evaluated through simulation.
METHODS KEYWORDS: System Design, Simulation, Queueing Theory"
}
@ARTICLE{Wang0304:Comparing,
AUTHOR="S. y. Wang",
TITLE="On comparing the real and probed packet drop rates of a bottleneck router:
the {TCP} traffic case",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=6,
PAGES="591-602",
MONTH=apr,
YEAR=2003,
REFERENCES=14,
KEYWORDS="Network measurement; Traffic measurement; Performance evaluation",
ABSTRACT="In this paper, we address the question of whether the packet drop rate of a
bottleneck router measured (experienced) by probe packets can accurately
reflect the bottleneck router's real packet drop rate. To answer this
question, we built a testbed network and conducted several real
experiments on it. In these experiments, using various traffic types and
loads, we compared the probed and the real packet drop rates of the
bottleneck router. We also collected the internal queue length variation
process of the bottleneck router and used it to do several post analyses
to answer some what-if questions. This paper presents some interesting
findings derived from this study.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-46SP11K-3-23\&\_cdi=5624\&\_orig=browse\&\_coverDate=04\%2F15\%2F2003\&\_sk=999739993\&view=c\&wchp=dGLbVlz-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=7cc5ec304f17041b6edafd1e7cdf57d7\&ie=f.pdf"
}
@ARTICLE{Wang0304:Optimal,
AUTHOR="Wei-Hua Wang and Marimuthu Palaniswami and Steven Low",
TITLE="Optimal flow control and routing in multi-path networks",
JOURNAL="Performance Evaluation",
VOLUME=52,
NUMBER="2-3",
PAGES="119-132",
MONTH=apr,
YEAR=2003,
REFERENCES=23,
KEYWORDS="Optimal flow control; Multiple paths network; Optimization; Minimum first
derivative path",
ABSTRACT="We propose two flow control algorithms for networks with multiple paths
between each sourcedestination pair. Both are distributed algorithms over
the network to maximize aggregate source utility. Algorithm 1 is a first
order Lagrangian method applied to a modified objective function that has
the same optimal solution as the original objective function but has a
better convergence property. Algorithm 2 is based on the idea that, at
optimality, only paths with the minimum price carry positive flows, and
naturally decomposes the overall decision into flow control (determines
total transmission rate based on minimum path price) and routing
(determines how to split the flow among available paths). Both algorithms
can be implemented as simply a source-based mechanism in which no link
algorithm nor feedback is needed. We present numerical examples to
illustrate their behavior.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-47MJ3M7-1-79\&\_cdi=5663\&\_orig=browse\&\_coverDate=04\%2F30\%2F2003\&\_sk=999479997\&view=c\&wchp=dGLbVtb-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=1e63d7cda643e9eafdcf41715d919411\&ie=f.pdf"
}
@INPROCEEDINGS{Wang0305:Bandwidth,
AUTHOR="Jun Wang and Li Xiao and King-Shan Lui and Klara Nahrstedt",
TITLE="Bandwidth Sensitive Routing in DiffServ Networks with Heterogeneous
Bandwidth Requirements",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper studies the problem of finding optimal routes for premium
class traffic in a DiffServ network such that (1) loop-freedom is
guaranteed in the entire network under hop-by-hop routing assumption;
and (2) the {\em maximum relative congestion} among all links is
minimized.
This problem is called the {\em Extended Optimal Premium Routing}
($e$OPR) problem, which is proven to be NP-hard.
We use the {\em integer programming method} to mathematically
formulate the $e$OPR problem and find the optimal solutions
for small scale networks. We also study heuristic algorithms
in order to handle large scale networks. Simulation results are
compared with the optimal solutions obtained by solving the integer
programming models. The results show that the Bandwidth-inversion
Shortest Path (BSP) algorithm can be a good candidate to route
premium traffic in DiffServ networks."
}
@INPROCEEDINGS{Wang0305:Code,
AUTHOR="Rensheng Wang and Hongbin Li",
TITLE="Code-Timing Estimation for {CDMA} Systems with Bandlimited Chip Waveforms",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we present a multiple-access resistant code-timing estimator
for
asynchronous code-division multiple-access (CDMA) systems that utilize
bandlimited chip waveforms. The proposed scheme first converts
the received signal to the frequency domain, then followed by a frequency
deconvolution to remove
the convolving chip waveform, a weighting process to pre-whiten the
colored overall interference, including
the MAI (multiple-access interference), ISI (inter-symbol interference)
and
additive noise, and finally to obtain the code-timing estimation via an
iterative quadratic maximum likelihood approach. When this algorithm is
extended
with receiver diversity, it achieves robust performance with both time
and
frequency selective channel fading.
Also derived is a
conditional Cram\'er-Rao bound (CRB) for the code-timing estimation
problem based in the frequency domain.
Finally, numerical examples are presented to evaluate and compare the
proposed and a recent presented code-timing estimator for bandlimited CDMA
systems."
}
@INPROCEEDINGS{Wang0305:Distributed,
AUTHOR="Kang Wang and Carla-Fabiana Chiasserini and Ramesh Rao and John Proakis",
TITLE="A Distributed Joint Scheduling and Power Control Algorithm for Multicasting
in Wireless Ad Hoc Networks.",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper addresses the problem of power control in ad hoc networks
supporting multicast traffic. First, we present a distributed
algorithm which, given the set of multicast transmitters and their
corresponding receivers, provides an optimal solution to the power control
problem, if there is any. The transmit power levels obtained by solving the
optimization problem minimize the network power expenditure while meeting
the requirements on the SINR at the receivers. Whenever no optimal
solution can be found for the given set of multicast transmitters, we
introduce a joint scheduling and power control algorithm, which eliminates
the strong interferers thus allowing the other transmitters to solve the
power control problem. The algorithm can be implemented in a distributed
manner; however, it provides a sub-optimal solution since it is based on
`local' information. Simulation results show that the obtained solution
is close to the global optimum, when it exists. When there is not an
optimal solution, the proposed algorithm enables us to maximize the number
of successful multicast transmissions."
}
@INPROCEEDINGS{Wang0305:Minimum,
AUTHOR="Cheng-Kang Wang and Yumin Lee",
TITLE="Minimum Relevant Error {MIMO} Decision-Feedback Equalizer for High-Speed
Wireless Data Communications",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="A new criterion for optimizing the coefficients of
multi-input multi-output (MIMO) decision feedback equalizers
(DFE) is proposed for asymmetric signal constellations. It is
shown that the new criterion is a generalization of the minimum
mean-square error (MMSE) criterion. The proposed MIMO
DFE can be applied to the equalization of Gaussian minimum
shift keying (GMSK) signals. Simulation results indicate that
the proposed method achieves a performance gain of as much as
2dB without increasing equalization complexity."
}
@INPROCEEDINGS{Wang0305:Using,
AUTHOR="Shie-Yuan Wang",
TITLE="Using {TCP} Congestion Control to Improve the Performances of Optical Burst
Switched Networks",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We propose using a modified TCP decoupling approach as a congestion control
mechanism for optical burst switched networks. The TCP decoupling approach
[1] is a novel way that can apply TCP congestion control to any traffic
flow (which can be an aggregate) in a network. Since this approach is
generic, it has found applications in several areas [2, 3]. In the optical
burst switching (OBS) area, because the basic mechanism of the TCP
decoupling approach matches the mechanism of the OBS very well, we propose
using a modified TCP decoupling approach to congestion-control the traffic
load offered to an OBS switch and regulate the timing of sending bursts.
Our simulation results show that this approach enables an OBS switch to
have a high link utilization while having a low packet drop rate."
}
@INPROCEEDINGS{Wang0309:Denial,
AUTHOR="Bao-Tung Wang and Henning Schulzrinne",
TITLE="A Denial-of-Service-Resistant {IP} Traceback Approach",
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="Identifying the origins of a Distributed Denial-of-Service (DDoS) attack is
among the hardest research topics in the Internet security area, due to the
stateless nature of IP networks as well as the confusing and diffusing
effect of DDoS attacks. In this paper, we propose a DoS-resistant ICMP
message scheme by employing newly designed ICMP Caddie Messages. Our
approach is effective, secure, and immune to Denial-of-Service (DoS)
attacks. This straightforward method allows victims not only to identify
the sources of a DDoS attack but also to authenticate the ICMP Caddie
messages received."
}
@ARTICLE{Wang0309:Optimizing,
AUTHOR="S. y. Wang",
TITLE="Optimizing the packet forwarding throughput of multi-hop wireless chain
networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=14,
PAGES="1515-1532",
MONTH=sep,
YEAR=2003,
REFERENCES=14,
KEYWORDS="Wireless network; Medium access control; Ad hoc network",
ABSTRACT="In the literature, it has been shown that due to signal interferences
between neighboring stations, the maximum packet forwarding throughput of
a N-hop wireless chain network decreases as N increases and is only 1/N of
the wireless bandwidth. This 1/N trend continues until the throughput
finally stabilizes at only 1/5 or even less when N becomes large. To solve
this problem, this paper proposes an approach that optimizes the forwarding
throughput of a wireless chain network. In this approach, which we call the
two-frequency scheme, the wireless interface cards of some nodes in the
wireless chain network will swap their operating frequency channels
between two different channels to avoid interferences. Using this
approach, even when N is large, the forwarding throughput can be
cost-effectively improved to 1/2, which is the optimal forwarding
throughput that can be achieved by a half-duplex wireless interface.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47XWCSM-1-2V\&\_cdi=5624\&\_orig=browse\&\_coverDate=09\%2F01\%2F2003\&\_sk=999739985\&view=c\&wchp=dGLbVtz-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=53f5d3b015cc3734a00ed0ff09785264\&ie=f.pdf"
}
@INPROCEEDINGS{Wang0310:Based,
AUTHOR="Jianxin Wang and Yuan Zheng and Weijia Jia",
TITLE="{A-DSR:} A Based-DSR Anycast Protocol for IPv6 Flow in Mobile Ad Hoc
Networks",
BOOKTITLE="VTC 2003 - Data base management in wireless network environments",
DAYS=4,
MONTH=oct,
YEAR=2003,
ABSTRACT="Anycast is a communication model for IP and is more important for an ad-hoc
network in terms of resource, robustness and efficiency. DSR is a simple
and efficient routing protocol designed specifically for use in multi-hop
wireless ad hoc networks of mobile nodes. This paper proposes a novel
anycast protocol for Ipv6 flow in mobile ad hoc networks, which is based
on the DSR protocol. We also test its performance with different network
parameters and the simulation results show that the anycast protocol can
balance the network load efficiently and reduce the delay of packet and
improve the network throughput. Anycast service can also improve
performance of ad hoc network when mobility is high and a link may get
disconnected frequently without the servers of repair/re-discovery due to
ad-hoc network environment."
}
@INPROCEEDINGS{Wang0310:Detecting,
AUTHOR="Bao-Tung Wang and Henning Schulzrinne",
TITLE="Detecting Offensive Routers: A Straightforward Approach",
BOOKTITLE="IEEE International Carnahan Conference on Security Technology (ICCST)",
ORGANIZATION="IEEE",
PUBLISHER="IEEE",
ADDRESS="Grand Hotel, Taipei, Taiwan",
PAGES="460-467",
MONTH=oct,
YEAR=2003,
REFERENCES=14,
KEYWORDS="Packet Dropping Attack",
ABSTRACT="Packet Dropping Attack (PDA) is a network attack that utilizes compromised
network elements to degrade network performance or quality by
intentionally dropping a certain amount of IP packets. The major
distinction of the PDA from traditional Denial-of Service (DoS) attack is
that some victims do not even discern that they are under attack.
Offensive Router Detection (ORD) is a mechanism capable of detecting
offensive routers that are performing the PDA. The ORD mechanism is based
on the principle of conservation of flow in the network, and employs a new
proposed ICMP message, Caddie message, which records packet forwarding
information in the Caddie messages. Therefore, after analyzing the
information, we can identify routers that are abnormally dropping packets.
The paper shows the advantages of the ORD mechanism over other existing
network monitoring mechanisms and discusses storage and bandwidth overhead
issues. The paper also demonstrates the advantages and the effectiveness of
the approach by simulating the functionality of the ORD mechanism to detect
four different packet-dropping patterns.",
URL="http://www1.cs.columbia.edu/~bowang/PublishedPapers/DetectingOffensiveRouters-AStraightforwardApproach.pdf"
}
@INPROCEEDINGS{Wang0311:ICMP,
AUTHOR="Bao-Tung Wang and Henning Schulzrinne",
TITLE="{ICMP} Caddie Messages: A DoS-Resistant Solution For Various DoS Attacks",
BOOKTITLE="IEEE International Conference on Network Protocols (ICNP)",
ORGANIZATION="IEEE",
ADDRESS="Atlanta, Georgia",
MONTH=nov,
YEAR=2003,
REFERENCES=2,
KEYWORDS="Denial of service attack; IP traceback",
ABSTRACT="Caddie Messages Scheme (iCaddie) is designed to simultaneously resolve
several essential network security issues. Besides IP traceback, potential
applications of the iCaddie include Packet-dropping Detection,
Feedback-based Routing, Secure Traceroute, packet authentication and
authorization, as well as confirmed anonymous communication.",
URL="http://www1.cs.columbia.edu/~bowang/PublishedPapers/ICNP2003Poster.pdf"
}
@TECHREPORT{Wang0311:Make,
AUTHOR="Liang Wang and Yiping Guo and Ming Fang",
TITLE="Make search become the internal function of Internet",
TYPE="arXiv report",
NUMBER="cs.IR/0311015",
MONTH=nov,
YEAR=2003,
KEYWORDS="Information Retrieval; Digital Libraries; Networking and Internet",
ABSTRACT="Domain Resource Integrated System (DRIS) is introduced in this paper. DRIS
is
a distributed information retrieval system, which will solve problems like
poor
coverage, long update interval in current web search system. The most
distinct
character of DRIS is that it's a public opening system, and acts as an
internal
component of Internet, but not the production of a company. The
implementation
of DRIS is also represented.",
URL="http://arxiv.org/abs/cs/0311015"
}
@INPROCEEDINGS{Wang0312:Analysis,
AUTHOR="Bao-Tung Wang and Henning Schulzrinne",
TITLE="Analysis of Denial-of-Service Attacks on Denial-of-Service Defensive
Measures",
BOOKTITLE="Globecom 2003 - General Conference",
ORGANIZATION="IEEE",
PUBLISHER="IEEE",
ADDRESS="San Francisco Marriott, CA",
PAGES="1339-1343",
MONTH=dec,
YEAR=2003,
REFERENCES=16,
KEYWORDS="Denial of service attack",
ABSTRACT="Currently, denial-of-service (DoS) attacks remain among the most critical
threats on the Internet. Ironically, although a major objective of
Internet protocol design was to prevent DoS attacks and to maintain
network connections in order to provide essential services to the masses
uninterruptedly, the Internet is suffering significantly from distributed
DoS (DDoS) attacks at present. In recent years, numerous research studies
have focused on this topic. However, after deliberately analyzing the
proposed defensive measures and supposedly secure systems, we figure that
most are themselves extremely vulnerable to DoS/DDoS attacks. This paper
contributes a detailed analysis of various existing and proposed defensive
measures, as well as their vulnerabilities.",
URL="http://www1.cs.columbia.edu/~bowang/PublishedPapers/AnalysisOfDoSonDoSDefensiveMeasures.pdf"
}
@INPROCEEDINGS{Wang0312:Tracing,
AUTHOR="Bao-Tung Wang and Henning Schulzrinne",
TITLE="Tracing High Bandwidth Aggregates",
BOOKTITLE="IASTED International Conference on Communication, Network, and Information
Security (CNIS)",
ORGANIZATION="IASTED",
PUBLISHER="ACTA Press",
ADDRESS="New York City, NY, USA",
PAGES="165-170",
MONTH=dec,
YEAR=2003,
REFERENCES=15,
KEYWORDS="Denial of service attack, IP traceback",
ABSTRACT="Defending of Distributed Denial-of-Service (DDoS) attacks or even
identifying their sources are among the hardest research topics in the
Internet security area. There are various potential solutions proposed,
such as packet filtering and IP traceback. Pushback is currently
considered to be one of the most well designed methods for controlling
high bandwidth aggregates at their sources and protecting legitimate
traffic within the aggregate. However, potential bandwidth and storage
overheads added at routers make the method vulnerable to DoS attacks. I
therefore propose a simple enhancement called Aggregate Initiation
Detection (AID), which significantly reduces those overheads at routers to
prevent routers from being targeted in DoS attacks.",
URL="http://www1.cs.columbia.edu/~bowang/PublishedPapers/TracingHighBandwidthAggregates.pdf"
}
@INPROCEEDINGS{Wang03:Vulnerability,
AUTHOR="Weichao Wang and Yi Lu and Bharat Bhargava",
TITLE="On Vulnerability and Protection of Ad Hoc On-demand Distance Vector
Protocol",
BOOKTITLE="10th IEEE International Conference on Telecommunications, ICT 2003",
ADDRESS="Papeete, Tahiti",
YEAR=2003
}
@INPROCEEDINGS{Wübb0305:Successive,
AUTHOR="Dirk {Wübben} and Volker Kuehn and Karl-Dirk Kammeyer",
TITLE="Successive Detection Algorithm for Frequency Selective Layered Space-Time
Receiver",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The use of multiple antenna systems provides a great performance advantage
in Rayleigh fading environments. To exploit this advantage several schemes
like the layered space-time architecture have been proposed, but mostly
restricted to narrowband transmission. Recently, a generalization of the
well known V-BLAST detection algorithm for frequency-selective fading
channels has been presented by Lozano and Papadias. In order to improve
the performance of this receiver, we propose an iterative detection
algorithm in this paper."
}
@INPROCEEDINGS{Webe0303:Network,
AUTHOR="Steven Weber and Gustavo {de Veciana}",
TITLE="Network Design For Rate Adaptive Media Streams",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Rate adaptive multimedia streams offer significant system and client
benefits over non-adaptive streams. These benefits come at the price of
increased complexity in providing adequate network support and difficulty
in understanding how rate adaptation protocols affect client perceived
QoS. In this paper we define quality of service in terms of the mean rate
seen by the client and the number of rate adaptations experienced. We
identify an intuitive optimal adaptation policy that maximizes QoS. We
suggest an appropriate scaling regime for rate adaptive streams and
identify asymptotic QoS for large capacity networks under the optimal
adaptation policy. Implementation of the optimal adaptation policy
presents several obstacles that render it infeasible. We define a
multi-class admission control policy that achieves asymptotically
equivalent QoS to that achieved under the optimal adaptation policy, but
without the need for dynamic adaptation. Our
work carries implications for network designers and content providers.
Methods/Keywords: System design, Stochastic processes/Queueing theory,
Mathematical programming/optimization."
}
@INPROCEEDINGS{Wehr0305:Alternative,
AUTHOR="Klaus Wehrle and Uwe Walter and Martina Zitterbart",
TITLE="Alternative Traffic Conditioning Mechanisms for the Virtual Wire Per-Domain
Behavior",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT={Interactive networked multimedia applications are sensitive to delay and
jitter affecting the transmission of their data packets. Without the
support for quality of service, the nature of the Internet makes it
difficult to deliver data streams in the demanded constant and steady way
these applications need for an acceptable performance. Because of this
limitation, value-added services like the {"}Virtual
Wire{"}-Per-Domain-Behavior (VW-PDB) impose the obligation of traffic
conditioning mechanisms in the transmission path to assure a continuous
data stream to an end user. However, each traffic conditioning action is a
potential source for additional delays experienced by the processed data
packets.
In this paper we will show, that the configuration suggested by the VW-PDB
for traffic conditioners in a last hop router, can quickly lead to unwanted
significant additional delays. Although applications will then be served
with a constant data stream with minimal jitter, the traffic conditioning
might exceed their delay limitiations. Since modern multimedia
applications normally use their own playback buffers for jitter
compensation, they do not depend on a complete jitter-free transmission,
like the VW-PDB tries to establish by emulating a dedicated
switched-circuit. Hence, two suggestions with more flexible traffic
conditioning mechanisms in the last-hop-router will be presented. Both
approaches will be compared to the strict rules prescribed by the VW-PDB
in terms of jitter compensation and additional delay.}
}
@INPROCEEDINGS{Wei0305:Asymptotic,
AUTHOR="Shuangqing Wei and Dennis Goeckel and Ramakrishna Janaswamy",
TITLE="On the Asymptotic Capacity of {MIMO} Systems with Fixed Length Linear
Antenna Arrays",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Recently, there has been significant interest in the capacity
of multiple element antenna (MEA) wireless systems. Previous
authors have shown that the asymptotic capacity of a system with N
transmit and N receive antennas (termed an (N,N) MEA) grows linearly
with N if, for all k, the correlation of the fading for two antenna
elements whose indices differ by k remains fixed as antennas are added
to the array. However, in practice, the total size of the array is
often fixed, and thus the correlation of the fading for two elements
separated in index by some value k will change as the number of antenna
elements is increased. In this paper, under the condition that the
length
of a linear array of antennas is fixed and the spatial
correlation function
of the fading process is bandlimited, the
asymptotic properties of the
instantaneous mutual information of an
(N,N) MEA wireless
system are derived analytically and tested for
accuracy for finite N
through simulations. Two different cases are
considered: (1) when the
fixed array size constraint is imposed at
the mobile unit, and (2) when
the fixed array size constraint is
imposed at both the base station
and the mobile unit. For the
first case, simulation results indicate
that the analytical
approximations are very accurate for moderate
values of N,
especially at high signal-to-noise-ratios (SNR).
For the second
case, the predicted non-convergence is observed in simulations,
as well."
}
@INPROCEEDINGS{Wei0312:Context,
AUTHOR="Qing Wei and Paulo Mendes and Christian Prehofer and Nima Nafisi and Karoly
Farkas and Bernhard Plattner",
TITLE="Context-aware Handover Based on Active Network Technology",
BOOKTITLE="International Working Conference on Active Networks",
MONTH=dec,
YEAR=2003,
KEYWORDS="Context-awareness; Active Networking; Mobile Networks; Service Deployment"
}
@INPROCEEDINGS{Weil0305:Rate,
AUTHOR="Xie Weiliang",
TITLE="Rate compatible punctured turbo code scheme over optical wireless channel",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Atmospheric optical wireless channel is a time-varying optical channel
because of the effect of scintillation, the paper introduces rate
compatible punctured turbo code (RCPTC) scheme to provide unequal error
protection (UEP) for optical wireless communication. In order to use RCPTC
over optical wireless channel, the paper firstly proposed a turbo decoder
with iterative optical channel estimation for optical wireless channel.
Simulations show that the proposed turbo decoder significantly improves
the performance of system. Based on the proposed turbo decoder, the paper
compares several RCPTC schemes via simulations. In these RCPTC schemes,
the non-uniformly punctured code schemes are compared with uniformly
punctured code scheme. Moreover, the systematic puncturing scheme and
non-systematic puncturing scheme are both discussed."
}
@INPROCEEDINGS{Weis0305:Performance,
AUTHOR="Martin Weisenhorn and Walter Hirt",
TITLE="Performance of Binary Antipodal Signaling Over the Indoor {UWB} {MIMO}
Channel",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We generalize a suitable, known indoor UWB SISO channel model to obtain a
new discrete-time model for the indoor UWB MIMO radio channel. The
properties and potential benefits arising from the channel's specific
correlation features are investigated by means of simulations. We show
that the indoor UWB channel can offer inherent ISI mitigation and confirm
that systems operating on this channel require a small-scale fading margin
of only a view dB. It is further demonstrated that a V-BLAST-like scheme
applied to the UWB MIMO channel can offer superior performance compared to
its use on the Rayleigh flat fading channel. Moreover, while this scheme
cannot work on the latter channel with less receiving than transmitting
antennas, it was found to work for the UWB channel even with only a single
receiving antenna."
}
@TECHREPORT{Wen-0311:Situation,
AUTHOR="Dong Wen-Yu and Xu Ke and Lin Meng-Xiang",
TITLE="A Situation Calculus-based Approach To Ubiquitous Applications",
TYPE="arXiv report",
NUMBER="cs.NI/0311052",
MONTH=nov,
YEAR=2003,
ABSTRACT="This paper presents a revised situation calculus to describe the paradigm
of
network information services in ubiquitous environment. In this paradigm,
service systems are required to remain active continuously, regardless of
whether the user is online or not, and to operate in an extremely highly
autonomous style to minimize the frequency of human-system intervention.
While inheriting description capability of dynamic changes, we replace
traditional situations, i.e. action sequences in Reiter's calculus, with
value
tuples of decisive fluents, since Reiter's situations will cause
ever-increasing computing complexity during running time while ours will
not.
Besides, to ensure autonomous computing will not produce any
in-reasonable
result, we introduce validity theory to axiomize application-specific
validity
requirements, and to maintain them during running time by enabling the
service
system to accept, partially accept, supplement with adjustments or reject
the
original intentions and to do so automatically.
Our situation calculus can be used to ubiquitous network
information
services that achieve satisfactory trade-offs between rigid validity
requirements and persistent, autonomous computing style, as demonstrated
by
ACS, an exemplar ubiquitous service throughout the paper.",
URL="http://arxiv.org/abs/cs/0311052"
}
@INPROCEEDINGS{Wen0303:Unifying,
AUTHOR="John Wen and Murat Arcak",
TITLE="A Unifying Passivity Framework for Network Flow Control",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Network flow control regulates the traffic between sources and links
based on congestion, and plays a critical role in ensuring
satisfactory performance. In recent studies, global stability has
been shown for several flow control schemes. By using a passivity
approach, this paper presents a unifying framework which encompasses
these stability results as special cases. In addition, the new
approach significantly expands the current classes of stable flow
controllers by augmenting the source and link update laws with
passive dynamic systems. This generality offers the possibility of
optimizing the controllers, for example, to improve robustness and
performance with respect to time delay, unmodeled flows, and
capacity variation."
}
@ARTICLE{Whit0309:Securing,
AUTHOR="Russ White",
TITLE="Securing {BGP} Through Secure Origin {BGP}",
JOURNAL="Internet Protocol Journal",
VOLUME=6,
NUMBER=3,
MONTH=sep,
YEAR=2003,
ABSTRACT="Networks have come under increasing scrutiny in the area of security.
Routing, the part of the network that provides information on how to reach
destinations within the network, has been gaining attention from a security
perspective as well. The Internet Engineering Task Force (IETF) has, in
fact, formed a new working group, the Routing Protocols Security
Requirements Working Group (http://www.rpsec.org), to analyze security in
routing systems.",
URL="http://www.cisco.com/warp/public/759/ipj\_6-3/ipj\_6-3\_bgp2.html"
}
@INPROCEEDINGS{Widj0303:Exploiting,
AUTHOR="Indra Widjaja and Anwar Elwalid",
TITLE="Exploiting Parallelism to Boost Data-Path Rate in High-Speed {IP/MPLS}
Networking",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Link bundling is a way to
increase routing scalability whenever a pair of
Label Switching Routers in MPLS are connected by multiple
parallel links.
However, link bundling can be inefficient as a Label Switched Path
(LSP) has to be associated with a particular link.
In this paper, we show that the efficiency of link bundling
can be significantly
improved if traffic can be effectively distributed across
the parallel links.
We propose an IP switch architecture
\%, called TurboPath,
that is capable of distributing
flows inside the switch and among the parallel links
based on operations that are relatively simple to implement.
The switch requires no speedup,
guarantees in-sequence packet delivery for a given flow,
avoids complex co-ordination algorithms,
and can achieve LSP throughput higher than the line rate.
By means of simulation using IP traces, we investigate the
performance of the proposed switch, and show that
the switch achieves good load-balancing performance.
We describe extensions to the basic architecture which
allows for very large bundle size,
handles incremental upgrade strategy,
improves reliability, and
accommodates non-IP traffic."
}
@ARTICLE{Widj0305:Light,
AUTHOR="Indra Widjaja and Iraj Saniee and Randy Giles and Debasis Mitra",
TITLE="Light Core and Intelligent Edge for a Flexible, Thin-Layered, and
Cost-Effective Optical Transport Network",
JOURNAL="IEEE Communications Magazine",
VOLUME=41,
NUMBER=5,
PAGES="S30-S36",
MONTH=may,
YEAR=2003,
REFERENCES=15,
KEYWORDS="Network architectures;optical networking;scheduling;protection;control
plane",
ABSTRACT="We present a new optics-based transport architecture
that emulates fast switching in the network core via
emerging fast tunable lasers at
the network edge, and bypasses the need for fast
optical switching and buffering.
The new architecture is capable
of handling both asynchronous and synchronous traffic,
for dealing with various bandwidth granularities,
and for responding to dynamic changes in
end-to-end traffic demands.
The architecture also reduces the amount of
layering in the transport network by
eliminating packet and TDM switching,
keeps the network core light (lightweight and transparent),
and pushes intelligence to the network edge.
We discuss technical challenges that arise in
the new architecture
and describe possible approaches to address them."
}
@INPROCEEDINGS{Widj0305:New,
AUTHOR="Indra Widjaja",
TITLE="A New Approach for Automatic Grooming of {SONET} Circuits To Optical
Express Links",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We consider meshed optical transport networks having multiple
levels of hierarchy whereby cross-connects in different
levels perform multiplexing and demultiplexing
functions at different granularities.
We present a traffic grooming approach
that can be implemented in a centralized or
distributed fashion, based on the novel
design that takes advantage of
algorithm efficiency and a simple threshold mechanism to
decide when grooming is economical.
Our approach allows nodes to perform grooming
and degrooming automatically, which is desired in
the next-generation optical network where circuits
are setup and torn-down dynamically through signaling.
We present several experiments using different
network topologies.
The results indicate that the flow pattern influences
the port requirement behavior, and that
the flow thickness influences the optimal value of
the threshold."
}
@INPROCEEDINGS{Widj0309:New,
AUTHOR="Indra Widjaja and Iraj Saniee",
TITLE="A New Transport Network Architecture with Joint Time and Wavelength
Multiplexing",
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="Current transport network architectures are complex and
expensive to manage as they typically consist of multiple layers
(packet, TDM and WDM layers).
We propose a cost-effective transport network architecture that
relies on a single data-plane layer by exploiting joint time
and wavelength multiplexing at the WDM layer.
We describe the architecture that emulates fast switching in the
network core with fast tunable lasers at the network edge,
and enables self-routing of optical signals through
passive wavelength-selective cross-connects.
We present some results on distributed scheduling
that arbitrates the transfers of optical signals
from various sources to various destinations so
that conflicts are avoided."
}
@INPROCEEDINGS{Wieg0305:High,
AUTHOR="David Wiegandt and Zhiqiang Wu and Carl Nassar",
TITLE="High-Performance Carrier Interferometry WLANs: {RF} Testing",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In the authors earlier work, we demonstrated how performance degradation
and PAPR concerns in OFDM can be overcome by application of Carrier
Interferometry (CI) spreading codes. In this work, the authors employ RF
test equipment and analyze the practical performance of OFDM (Orthogonal
Frequency Division Multiplexing) based IEEE 802.11a WLAN vs. their
proposed Carrier Interferometry (CI) OFDM based WLAN. Specifically, RF
test results (in a typical indoor office environment) are used to analyze
the proposed CI/OFDM and CI/COFDM technologies and compare these to
traditional OFDM and COFDM technologies. It is shown that in a typical
office environment, at a bit error rate of 10-3, the CI technology gains
5-7 dB over current OFDM."
}
@INPROCEEDINGS{Wies0305:Turbo,
AUTHOR="Ami Wiesel",
TITLE="Turbo equalization and demodulation of multicode space time codes",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This work considers a high rate, multiple input multiple output (MIMO)
system using multiple codes, as well as channel coding and space time (ST)
coding. The transmitter consists of a channel encoder followed by parallel
Linear Dispersion Codes (LDC) ST encoders using different spreading codes.
The iterative receiver consists of a soft input and soft output (SISO)
demodulator, followed by a SISO decoder. The demodulator is based on the
well known linear multiuser detector. Simulation results in realistic
frequency selective Third Generation Partnership Project test cases reveal
good performance even for high rate HSDPA services."
}
@TECHREPORT{Wies0308:Security,
AUTHOR="Christian Wieser and Marko Laakso and Henning Schulzrinne",
TITLE="Security testing of {SIP} implementations",
TYPE="Technical Report",
INSTITUTION="Department of Computer Science, Columbia University",
NUMBER="CUCS-024-03",
ADDRESS="New York",
MONTH=aug,
YEAR=2003,
KEYWORDS="SIP; vulnerability; VoIP; signaling; protocol testing",
ABSTRACT="The Session Initiation Protocol (SIP) is a signaling protocol for
Internet telephony, multimedia conferencing and instant messaging.
Although
SIP implementations have not yet been widely deployed, the product
portfolio is expanding rapidly. We describe a method to assess the
robustness of SIP implementation by describing a tool to find
vulnerabilities. We prepared the test material and carried out tests
against a sample set of existing implementations. Results were reported to
the vendors and the test suite was made publicly available. Many of the
implementations available for evaluation failed to perform in a robust
manner under the test. Some failures had information security
implications,
and should be considered vulnerabilities.",
URL="http://www1.cs.columbia.edu/~library/TR-repository/reports/reports-2003/cucs-024-03.pdf"
}
@INPROCEEDINGS{Wind0305:Precoding,
AUTHOR="Christoph Windpassinger and Tomas Vencel and Robert Fischer",
TITLE="Precoding and Loading for BLAST-like Systems",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper we consider transmission over MIMO channels with channel
state information available at the transmitter. This enables the use of
precoding as well as an optimization of rate and power distribution
over the parallel subchannels in the transmission system (loading). We
show that spatial loading provides substantial gains and give a
revised version of the V-BLAST algorithm to calculate the matrix
filters required for precoding or decision feedback equalization in
systems with loading."
}
@INPROCEEDINGS{Wolf0302:Access,
AUTHOR="Michael Wolf and Alexandru Petrescu and Hong-Yon Lach and Huamin Xu and
Markus Pilz",
TITLE="Access Control in Vehicular Environments: Challenges and Approaches",
BOOKTITLE="Submitted to MMC 2003",
ADDRESS="Dortmund, Germany",
MONTH=feb,
YEAR=2003
}
@INPROCEEDINGS{Wolf0302:In,
AUTHOR="Michael Wolf and Alexandru Petrescu and Hong-Yon Lach and Huamin Xu and
Markus Pilz and Miklos Ronai",
TITLE="In-Vehicular Mobile Router: Challenges and Approaches",
BOOKTITLE="Submitted to MMC 2003",
ADDRESS="Dortmund, Germany",
MONTH=feb,
YEAR=2003
}
@INPROCEEDINGS{Wolf03:Evaluation,
AUTHOR="Michael Wolf and Michael Scharf",
TITLE="Evaluation of Mobility Management Approaches for IPv6 based Mobile Car
Networks",
BOOKTITLE="Submitted to KIVS 2003",
YEAR=2003
}
@INPROCEEDINGS{Wong0305:Performance,
AUTHOR="David Tung Chong Wong and Jon Mark and Kee Chaing Chua and Balakrishnan
Kannan",
TITLE="Performance Analysis of Variable Bit Rate Multiclass Services in the Uplink
of Wideband {CDMA}",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="An analytical formulation of the outage probability in terms of bit error
rate specification for variable bit rate (VBR) multiclass services in the
uplink of a wideband CDMA-based cellular system is presented. The
analytical framework is formulated for the general case in which different
traffic classes have different spreading gains. The analytical work leads
to the determination of the capacity region of a WCDMA system with VBR
traffic. Numerical results of the capacity region corresponding to typical
parameter values are also presented."
}
@ARTICLE{Wong0309:Novel,
AUTHOR="Allan Wong and May Ip and Richard Wu",
TITLE="A novel dynamic cache size adjustment approach for better data retrieval
performance over the internet",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=14,
PAGES="1709-1720",
MONTH=sep,
YEAR=2003,
REFERENCES=32,
KEYWORDS="Internet; Cache size adjustment; Popularity ratio; Optimal; Adaptive;
Relative data object popularity; Popularity distribution",
ABSTRACT="A novel model for adaptive cache size control (MACSC) at runtime is
proposed in this paper. It automatically maintains the prescribed hit
ratio to guarantee the minimum expected caching performance. With this
capability the system delivers better client/server communication and
service response. The fringe benefit is better availability of the
backbone bandwidth because caching reduces the traffic for long-haul data
transfer over the Internet. The MACSC adjusts the cache size quickly,
optimally and without the deleterious effect of remedying a past event
spuriously regarded as a present one. The MACSC is a form of adaptive
cache control within the area of cache adaptivity. It is unique and
differs from other previous methods because it leverages the relative data
object popularity as the only parameter in the control process, in the form
of the popularity ratio. For the present MACSC research scope, the relative
data object popularity profile, namely, the popularity distribution, is
assumed to be bell-shaped and unimodel, but allows for a gentle mode skew.
The MACSC computes the cache size adjustment from the sampled life data
with the help of the point-estimate approach represented by the
N-equation. The preliminary results from the verification and validation
experiments unanimously confirm that the MACSC is indeed effective for
automatic adaptive cache size control and economizing Internet backbone
bandwidth.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47CJBWT-1-3C\&\_cdi=5624\&\_orig=browse\&\_coverDate=09\%2F01\%2F2003\&\_sk=999739985\&view=c\&wchp=dGLbVzz-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=ac19b92959875dd3b8ce56b4aaeb99c3\&ie=f.pdf"
}
@INPROCEEDINGS{Wong0310:Managing,
AUTHOR="Daniel Wong and Ashutosh Dutta and Henning Schulzrinne and Kenneth Young",
TITLE="Managing Simultaneous Mobility of {IP} hosts",
BOOKTITLE="IEEE International Military Communications Conference (MILCOM)",
ORGANIZATION="IEEE",
PUBLISHER="IEEE",
ADDRESS="Boston, MA, USA",
MONTH=oct,
YEAR=2003,
KEYWORDS="Mobility, Peer Movement, Adhoc Networks",
ABSTRACT="Since triangular routing in Mobile IP (MIP) is undesirable, MIP with Route
Optimization (MIP-RO) and MIP with Location Registers (MIP-LR), all use
binding updates that are sent directly to a Correspondent Host. Session
Initiation Protocol (SIP) based mobility management also uses direct
binding updates between a Mobile Host and a Correspondent Host. However,
this makes these protocols (except the basic MIP) vulnerable to the
simultaneous mobility problem, i.e. the special case when both end hosts
are mobile and move at about the same time. In this paper, we analyze the
simultaneous mobility problem and propose new ways for MIP-LR and SIP to
handle simultaneous mobility using a common approach stemming from a
generalized solution.",
URL="www.cs.columbia.edu/~dutta/papers.html/milcom3.pdf"
}
@ARTICLE{Wong0310:Multilayered,
AUTHOR="Daniel Wong and Ashutosh Dutta and Jim Burns and Ken Young and Henning
Schulzrinne",
TITLE="A multilayered mobility management scheme for auto-configured wireless {IP}
networks",
JOURNAL="IEEE Wireless Magazine",
MONTH=oct,
YEAR=2003,
KEYWORDS="SIP, MIP-LR, MMP, Mobility, Autoconfiguration",
ABSTRACT="The convergence of wireless and IP has led to the need for IP to handle
mobility. The Mobile IP protocol was developed to facilitate IP mobility.
However it has a number of shortcomings for dynamically auto-configured
networks. Mobility protocols like Mobile IP with Location registers
(MIP-LR) and Session Initiation Protocol (SIP) have been developed to
address some of its shortcomings. Micro-mobility protcols like Cellular IP
have been developed to address other shortcomings of Mobile IP. In this
article we present a new integrated mobility management scheme that
advantageously combines the strengths of SIP and MIP-LR with the benefits
of a micromobility management protcol similar to Cellular IP. A prototype
implementation of our schele is explained, and lessons learnt in the
prototyping process are presented.",
URL="http://www1.cs.columbia.edu/~dutta/research/IMM-wireless.pdf"
}
@INPROCEEDINGS{Wu0303:Broadcasting,
AUTHOR="Jie Wu and Fei Dai",
TITLE="Broadcasting in Ad Hoc Networks Based on Self-Pruning",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT={We propose a general framework for broadcasting in ad hoc networks
through self-pruning. The approach is based on selecting a small
subset of hosts (also called nodes) to form a forward node set to
carry out a broadcast process. Each node, upon receiving a
broadcast package, determines whether to forward the package or
not based on two neighborhood coverage conditions proposed in this
paper . These coverage conditions depend on neighbor connectivity
and history of visited nodes, and in general, resort to global
network information. Using local information such as k-hop
neighborhood information, the forward node set is selected through
a distributed and local pruning process. The forward node set can
be constructed and maintained through either a proactive process
(i.e., ``up-to-date'') or a reactive process (i.e.,
``on-the-fly{"}). Several existing broadcasting algorithms can be
viewed as special cases of the coverage conditions with $k$-hop
approximation. Simulation results show that more efficient
algorithms can be derived from the coverage conditions, and
self-pruning based on 2 or 3-hop neighborhood information is most
cost-effective and resilient to network mobility.}
}
@INPROCEEDINGS{Wu0305:Accuracy,
AUTHOR="Yujing Wu",
TITLE="Accuracy Study of Time-Stepped Simulation of High Speed Networks",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We first study the impact of traffic burstiness on the accuracy of
Time-Stepped-Simulation (TSS). Then we propose a compensation scheme to
expand TSS's working ranges."
}
@INPROCEEDINGS{Wu0305:Bayesian,
AUTHOR="Lili Wu",
TITLE="Bayesian Multiuser Detection for {CDMA} System with Unknown Interference",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Gibbs sampler, a typical Markov chain Monte Carlo (MCMC) method that
approximately solves the Bayesian problem by simple numerical computation
in a completely different paradigm, was previously employed for the
Bayesian detection in synchronous CDMA system. To perform the Bayesian
detection for the asynchronous uplink CDMA system with unknown multiuser
interference and multipath fading, the Gibbs sampler combined with the
linear group-blind decorrelator is proposed as a novel Bayesian multiuser
detection technique in this paper. Furthermore, in the study of the effect
of channel estimation error on the performance of the proposed detector, we
also present an iterative Bayesian multiuser detector where more accurate
parameter estimation is achieved to improve the detection performance.
Simulation results verify the effectiveness of the proposed detectors. The
proposed detection techniques have the advantages of low complexity, high
performance and wide applications."
}
@INPROCEEDINGS{Wu0305:Capacity,
AUTHOR="Kehang Wu",
TITLE="Capacity Planning of DiffServ Networks with Best-Effort and Expedited
Forwarding Traffic",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="For networks providing a specific level of service guarantees, capacity
planning is an imperative part of network management. Accurate
dimensioning is especially important in DiffServ networks, where no
per-flow signaling or control exists.
In this paper, we address the problem of capacity planning for DiffServ
networks with only Expedited Forwarding (EF) and best effort (BE) traffic
classes. The problem is formulated as an optimization problem, where the
total link cost is minimized, subject to the performance constraints of
both EF and BE classes. The variables to be determined are the routing of
EF traffic, and the discrete capacities of the links.
We show that Lagrangean Relaxation and subgradient optimization methods
can be used to solve the problem. Computational results show that the
solution quality is verifiably good while the running time remains
reasonable on practical-sized networks. This represents the first work for
capacity planning of multi-class IP networks with non-linear performance
constraints."
}
@INPROCEEDINGS{Wu0305:Combining,
AUTHOR="Zhiqiang Wu and Carl Nassar",
TITLE="Combining Techniques for {DS-CDMA} {RAKE} Receiver",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Tapped delay line RAKE receivers are commonly used to achieve path
diversity gain in DS-CDMA systems: Here, a bank of correlators are used to
separate the multipath components and a combiner coherently recombines the
multipath energies. In this paper, the optimal combining techniques for
DS-CDMA RAKE receivers (under different criteria) are introduced.
Specifically, based on the maximum likelihood criteria, optimal combining
techniques are derived and discussed for the following scenarios: (1)
channel-fade-information is not available at the receiver; (2) a
statistical characterization of the channel fades is available at the
receiver, but the actual, instantaneous fade information is not; and (3)
the instantaneous channel fade information is available at the receiver.
This paper shows that Maximum Ratio Combining (MRC), typically considered
the optimal combining scheme when fade parameters are perfectly tracked,
is sub-optimal. We present the optimal alterative to traditional MRC."
}
@INPROCEEDINGS{Wu0305:Design,
AUTHOR="Haitao Wu and Qian Zhang and Wenwu Zhu",
TITLE="Design Study for Multimedia Transport Protocol in Heterogeneous Networks",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Design the multimedia transport protocol in heterogeneous
wired-cum-wireless environment faces great challenges because of two
contradictory objectives. On the one hand, the multimedia application
requires smooth transfer rate, i.e., stability objective; on the other
hand, vertical handoff in heterogeneous networks requires fast response at
transfer rate, i.e., flexibility objective. To address this problem, this
paper proposes to use passive bandwidth measurement at the receiver in the
design of rate control algorithm for multimedia transport protocol.
Moreover, a window based exponentially weighted moving average (EWMA)
filter with two weights is introduced to achieve stability and flexibility
at the same time. Based on these considerations, a multimedia transport
protocol (MMTP) is proposed. Its stability and flexibility as well as its
fairness are verified by simulations."
}
@INPROCEEDINGS{Wu0305:Joint,
AUTHOR="Sau-Hsuan Wu and Urbashi Mitra and C.C. Jay Kuo",
TITLE="Joint Channel Estimation and Multiuser Detection for Multipath Fading
Channels in {DS-CDMA} Systems",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The problem of joint blind channel estimation and multiple access
interference (MAI) suppression for an asynchronous code-division
multiple-access (CDMA) system is studied. A low-complexity
sliding-window scheme based on the expectation maximization (EM)
algorithm is developed for joint blind maximum \textit{a
posteriori} probability (MAP) multi-user detection (MUD) and
stochastic maximum likelihood (ML) channel estimation in a
dispersive fading channel. Employing multi-stage soft interference
cancellation, the receiver can efficiently suppress and, more
importantly, diminish the effects of temporally correlated MAI.
Together with an initial value prediction method for algorithm
initialization at each window, the proposed scheme can track
on-line fading channels with no phase ambiguities even when
channel gains attenuate close to zero magnitude."
}
@INPROCEEDINGS{Wu0305:Ofdm,
AUTHOR="Songping Wu",
TITLE="{OFDM} Channel Estimation in the Presence of Frequency Offset and Phase
Noise",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we consider OFDM channel estimation in the presence of
frequency offset and phase noise. In the literatures, most channel
estimation methods assume perfect frequency synchronization and the
knowledge of channel statistics. Phase noise and residual frequency offset
cause inter-carrier interference (ICI), which consequently impairs the
accuracy of channel estimation. The lack of knowledge of channel
statistics can make channel estimation much harder. To resolve these
problems, we propose with the aid of cyclic prefix (CP) based frequency
offset estimation statistics-independent channel estimation. We
iteratively search for the most likely channel impulse response (CIR)
length, and use it not only for the optimum compensation of frequency
offset, but also for finding the optimum window to filter the least square
(LS) channel estimate which further suppress the effects of ICI and noise.
The proposed scheme is compared with conventional methods for both
non-interpolation and interpolation cases2. Numerical results are
presented to illustrate the effectiveness of the proposed scheme."
}
@INPROCEEDINGS{Wu0305:Performance,
AUTHOR="Sau-Hsuan Wu and Urbashi Mitra and C.C. Jay Kuo",
TITLE="Performance analysis of Multistage {BLUE/MMSE} Receivers for {DS-CDMA} in
Frequency Selective Fading Channels",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Interference suppression for multiuser DS-CDMA signals in
multipath channels is investigated in this research by developing
a multistage (MS) filterbank based on the best linear unbiased
estimator (BLUE) criterion. This MS BLUE structure is shown to
share the structure of MS minimum-mean squared error/minimum
output energy filter bank proposed in our previous work for
multipath channels modulo a scaling matrix. The performance limit
and the relationship between the output SINRs for the MS-BLUE,
MS-MMSE and MS-MOE multiuser receivers in multi-path fading
channels are studied and connected to the resultant bit error rate
(BER). Further analysis of the BER for equal gain combining and
differential BPSK modulation characterizes the BER floor. The
proposed scheme and its attendant analysis are verified via
computer simulation."
}
@INPROCEEDINGS{Wu0305:Programmable,
AUTHOR="Xiaotao Wu and Henning Schulzrinne",
TITLE="Programmable End System Services Using {SIP}",
BOOKTITLE="International Conference on Communications",
ADDRESS="Anchorage, Alaska",
PAGES="789-793",
MONTH=may,
YEAR=2003,
ABSTRACT="In Internet telephony, end systems can take a much larger role in
providing services than in traditional telephone systems. We analyze
the importance of end system services and describe the services and the
Service Logic Execution Environment (SLEE) implemented in our SIP user
agent, {\sipc}. Since we believe that end system services differ in their
requirements from network services, we define a new service creation
scripting language called Language for End System Services (LESS).
Compared with other service creation languages, LESS is extensible, can be
easily understood by non-programmers and contains commands and events for
direct user interaction and the control of media applications.",
URL="http://www.cs.columbia.edu/~xiaotaow/rer/Research/Paper/sipie.pdf"
}
@INPROCEEDINGS{Wu0305:Queuing,
AUTHOR="Hongyi Wu and Swades De and Chunming Qiao and Evsen Yanmaz and Ozan Tonguz",
TITLE="Queuing Delay Performance of the Integrated Cellular and Ad hoc Relaying
System",
BOOKTITLE="ICC 2003 - Global Services and Infrastructure for Next Generation Networks",
ADDRESS="Anchorage, Alaska",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The Integrated Cellular and Ad hoc Relaying (iCAR) system is
a representative heterogeneous wireless system,
proposed to address the congestion problem in the wireless
networks. In this paper, we present an analytic model based on
Markov chains for the queuing delay performance of iCAR. Our
results show that the new call requests in iCAR have a
significantly lower queuing delay than that of the conventional
cellular system. The analytic model developed in this paper may
serve as the guideline for the delay performance evaluation of the
next generation heterogeneous wireless systems."
}
@INPROCEEDINGS{Wu0305:Recovery,
AUTHOR="Jing Wu and J. Michel Savoie and Delfin Montuno and Hussein Mouftah",
TITLE="Recovery from Control Plane Failures",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="When the control and data planes of optical networks are physically
separate, it is important to maintain the user communications already
established in the data plane even if the control plane fails. Since the
status of wavelength channels is recorded by the entities of the
signalling protocol, without recoverability of the signalling protocol,
Constraint-based Routing Label Distribution Protocol (CR-LDP), a failure
in the control plane will cause permanent loss of such status information.
A mechanism to recover the status information of wavelength channels is
proposed. A downstream node stores a label information database (LID)
about assignable (free) labels in each incoming link. A copy of the LID is
redundantly stored in the upstream node as a label information mirror
(LIM). By keeping each LIM and the corresponding LID synchronised, the
revival of the status information of wavelength channels for any LDP
session initialised with this enhanced recovery is guaranteed."
}
@INPROCEEDINGS{Wu0305:Restoration,
AUTHOR="Kai Wu and Luca Valcarenghi and Andrea Fumagalli",
TITLE="Restoration Schemes with Differentiated Reliability",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Reliability of data exchange is becoming increasingly important. In
addition, applications may require multiple degrees of reliability.
The concept of Differentiated Reliability (DiR) was recently
introduced to provide multiple degrees of
reliability in protection schemes that provision spare resources.
With this paper, the authors extend the DiR concept to restoration
schemes in which network resources for a disrupted connection along
secondary paths are sought upon failure occurrence, i.e., they are not
provisioned before the fault. The DiR concept is applied in two
dimensions: restoration blocking probability --- i.e., the probability
that the disrupted connection is not recovered due to lack of network
resources --- and restoration time --- i.e., the time necessary to
complete the connection recovery procedure. Differentiation in the
two dimensions is accomplished by proposing three preemption policies
that allow high priority connections to preempt resources allocated to
low priority connections. The three policies trade complexity, i.e.,
number of preempted connections, for better reliability
differentiation.
Obtained results indicate that by using the proposed preemption
policies, it is possible to guarantee a significant differentiation of
both restoration blocking probability and restoration time of the
disrupted connections. By carefully choosing the preemption policy,
the desired reliability degree can be obtained, while minimizing the
number of preempted connections."
}
@INPROCEEDINGS{Wu0305:Use,
AUTHOR="Ping Wu and Jiangchuan Liu and Bo Li",
TITLE="On The Use of Sender Assistance to Improve Stability and Fairness",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Layered multicast is a promising technique for distributing video to a set
of heterogeneous receivers. While several layered multicast approaches
have been proposed, prior work usually perform adaptation on the receivers
side and use static rate allocation techniques at the senders side. In this
paper, we show an adaptation framework that improves stability and fairness
of receivers by employing dynamic layer rate allocation on the senders
side. We first propose a novel metric, called Stability-aware Fairness
Index (SFI), which can represent the system stability as well as fairness.
We then formulate the optimal layer rate allocation problem with the
objective of minimizing the expected SFI for all the receivers in a
multicast session, and derive an efficient algorithm to solve the problem.
Simulation results demonstrate that our scheme can significant improve the
degree of stability and fairness compared to static allocation based
schemes."
}
@INPROCEEDINGS{Wu0305:Utilizing,
AUTHOR="Dapeng Oliver Wu and Rohit Negi",
TITLE="Utilizing Multiuser Diversity for Efficient Support of Quality of Service
over a Fading Channel",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We consider the problem of quality of service (QoS) provisioning for $K$
users
sharing a downlink time-slotted Rayleigh fading channel.
We develop simple and efficient schemes for admission control, resource
allocation, and scheduling, which can yield substantial capacity gain.
The efficiency is achieved by virtue of multiuser diversity.
A unique feature of our work is explicit provisioning of statistical QoS,
which is characterized by a data rate, delay bound, and delay-bound
violation probability triplet.
The results show that compared with a fixed-slot assignment scheme,
our approach can substantially increase the statistical delay-constrained
capacity
of a fading channel (i.e., the maximum data rate achievable with
the delay-bound violation probability satisfied), when delay requirements
are not very tight, while yet guaranteeing QoS at any delay requirement."
}
@INPROCEEDINGS{Wu0306:Adjusting,
AUTHOR="Huahui Wu",
TITLE="Adjusting Forward Error Correction for TCP-Friendly Streaming {MPEG}",
BOOKTITLE="ACM NOSSDAV 2003",
ADDRESS="Monterey, California, USC",
DAYS=1,
MONTH=jun,
YEAR=2003,
ABSTRACT="The growing requirement of TCP-Friendly bandwidth use by streaming
video plus the proven advantages of Forward Error Correction (FEC) to
combat packet loss presents the opportunity to optimize the amount of
FEC in a TCP-Friendly video stream. In this paper, we derive an
analytical model for predicting the playable frame rate in a
TCP-Friendly MPEG stream with FEC. Our model characterizes the Group
Of Pictures (GOP) and Forward Error Correction (FEC) that are part of
the MPEG video transmission. Assuming a network estimate for the
packet loss probability, our model incorporates TCP-Friendly
throughput constraints to calculate a total playable frame rate. For
a given packet loss probability, we use our model to search the
variable space to find the MPEG configuration that yields the optimal
playable frame rate. Analysis over a range of network conditions
indicates that adjusting FEC can provide a significant performance
improvement, while adjusting a well-chosen GOP will contribute little
improvement. Further analysis shows that a poor choice for a GOP can
result in a large degradation of the playable frame rate. Overall, by
introducing moderate amounts of FEC overhead, frame rates can be
improved 10 to 50 times under network conditions of moderate to high
loss rates."
}
@ARTICLE{Wu0307:Issue,
AUTHOR="Jim Wu and Mahbub Hassan",
TITLE="The Issue of Useless Packet Transmission for Multimedia over the Internet",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=12,
PAGES="1240-1254",
MONTH=jul,
YEAR=2003,
REFERENCES=26,
KEYWORDS="TCP, multimedia over IP;MPEG-2;Internet;Fair Packet Queueing Algorithm",
ABSTRACT="When packet loss rate exceeds a given threshold, received audio and video
become unintelligible. A congested router transmitting multimedia packets,
while
inflicting a packet loss rate beyond a given threshold, effectively
transmits
useless packets. Useless packet transmission wastes router bandwidth when
it is needed
most. We propose an algorithm to avoid transmission of useless multimedia
packets, and
allocate the recovered bandwidth to competing TCP flows. We show that the
proposed
algorithm can be easily implemented in well-known WFQ and CSFQ fair packet
queueing and
discarding algorithms. Simulation of a 15-second MPEG-2 video clip over a
congested
network shows that the proposed algorithm effectively eliminates useless
packet transmission,
and as a result of that significantly improve throughput and file download
times of
concurrent TCP connections. For the simulated network, file download time
is reduced by 55\\%
for typical HTML files, 36\\% for typical image files, and up to 30\\% for
typical video
files. A peak-signal-to-noise-ratio (PSNR) based analysis shows that the
overall
intelligibility of the received video is no worse than that received
without the
incorporation of the proposed useless packet transmission avoidance
algorithm.
Our fairness analysis confirms that implementation of our algorithm into
the fair
algorithms (WFQ and CSFQ) does not have any adverse effect on the fairness
performance
of the algorithms.",
URL="http://www.cit.uws.edu.au/~jimwu/publications/upta\_cc.pdf"
}
@INPROCEEDINGS{Wu0310:Enhanced,
AUTHOR="Jie Wu",
TITLE="An Enhanced Approach to Determine A Small Forward Node Set Based on
Multipoint Relay",
BOOKTITLE="VTC 2003 - Data base management in wireless network environments",
DAYS=4,
MONTH=oct,
YEAR=2003,
ABSTRACT="Multipoint relays (MPR) provides a localized and optimized way of
determining a small forward node set in ad ad hoc network. Using 2-hop
neighborhood information, each node determines a small set of forward
neighbors to replay messages. Selected forward nodes form a connected
dominating set (CDS) to ensure full coverage. Recently, Adjih, Jacquet,
and Viennot proposed a novel localized algorithm to construct a small
forward node set based on MPR. In this paper, we provide a further
extension to generate a smaller forward node set without additional
cost. The effectiveness of our approach is confirmed through a simulation
study."
}
@ARTICLE{Wu0311:Fast,
AUTHOR="Yiwen Wu and Joseph Hui and Hongxia Sun",
TITLE="Fast restoring gigabit wireless networks using a directional mesh
architecture",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=17,
PAGES="1957-1964",
MONTH=nov,
YEAR=2003,
REFERENCES=20,
NOTE="No keywords available.",
ABSTRACT="Fourth Generation (4G) wireless networking may involve gigabit per second
transmission based on a mesh network architecture. These networks may use
Extremely High frequency or optical bands. The network is formed in an ad
hoc manner.
For this directional mesh network, we present a new restoration algorithm
for broadband wireless optical networks. A special restoration strategy,
called local recovery for local failure is applied in the proposed
algorithm. Specifically, each node initializes the recovery process
independently of other nodes in the network when the failed link is local
to the node. This algorithm is a hybrid restoration scheme, consisting of
a route pre-planning phase and a real-time rerouting phase. Transient
link/node failure, lasting only a short duration is typical in wireless
communications and specially handled in our algorithm. We explore the
response times of the proposed restoration algorithm. Simulation results
over typical network structures show that we could achieve a full recovery
of single-link failure, nearly 100\% recovery of single-node failure, as
well as around 99.5\% recovery of double-link failure.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-48S2S1G-3-W\&\_cdi=5624\&\_orig=browse\&\_coverDate=11\%2F01\%2F2003\&\_sk=999739982\&view=c\&wchp=dGLbVzb-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=98004d98bff0fc51fe6b7c8573ed249a\&ie=f.pdf"
}
@INPROCEEDINGS{Wydr0305:Implementation,
AUTHOR="Bartek Wydrowski and Moshe Zukerman",
TITLE="Implementation of Active Queue Management in a Combined Input and Output
Queued Switch",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Abstract- This paper investigates the implementation of a class of active
queue management algorithms (AQM) whose measure of congestion includes
packet arrival rate, such as REM and GREEN, in a combined input and output
queued (CIOQ) switch. We propose a structure with one AQM per output port
and we analyze the constraints on the switch fabric speed that this
imposes. A two queue model of a CIOQ switch is developed and simulated to
validate our design and compare its performance with a droptail queue
switch."
}
@INPROCEEDINGS{Wydr0305:Maxnet,
AUTHOR="Bartek Wydrowski and Moshe Zukerman",
TITLE="{MAXNET:} A New Network Congestion Control Architecture for MaxMin Fairness",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Abstract- We introduce a congestion control architecture called MaxNet
which can achieve MaxMin fairness with no global information or per-flow
state or processing in the link. MaxNet is an Internet like architecture,
where the network is stateless, and sources transmit information according
to their utility function. We prove that MaxNet results in MaxMin fairness
for sources with general homogenous utility functions and the current
Internet architecture may not. Simulations are performed to study the
transient behaviour of MaxNet."
}
@INPROCEEDINGS{Xia0303:Analysis,
AUTHOR="Ye Xia and David Tse",
TITLE="Analysis on Packet Resequencing for Reliable Network Protocols",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Protocols such as TCP requires packets to be accepted (i.e.,
delivered to the receiving application) in the order they are
transmitted at the sender. Packets are sometimes mis-ordered in
the network. In order to deliver the arrived packets to the
application in sequence, the receiver's transport layer needs to
temporarily buffer out-of-order packets and re-sequence them as
more packets arrive. Even when the application can consume the
packets infinitely fast, the packets may still be delayed for
resequencing. In this paper, we model packet mis-ordering by
adding an IID random propagation delay to each packet and analyze
the required buffer size for packet resequencing and the
resequencing delay for an average packet. We demonstrate that
these two quantities can be significant and show how they scale
with the network bandwidth."
}
@INPROCEEDINGS{Xia0305:Accumulation,
AUTHOR="Yong Xia and David Harrison and Shivkumar Kalyanaram and Kishore
Ramachandran and Arvind Venkatesan",
TITLE="An Accumulation-based Congestion Control Model",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper generalizes the TCP Vegas congestion avoidance mechanism
and proposes a model to use accumulation, buffered packets
of a flow inside network routers, as a congestion measure on which
a family of congestion control schemes can be derived. We
call this model accumulation-based congestion control (ACC). We
use a bit-by-bit fluid model to define the accumulation concept
and develop a general control algorithm which includes a set
of control policies. Then we prove its proportional fairness and
global stability. The ACC model serves as a reference for packet
network implementations. We show that TCP Vegas is one possible
scheme which fits into the ACC model. It is well known that Vegas
suffers from round trip propagation delay estimation error and
reverse path queuing delay. We therefore design a new scheme
called Monaco which solves these problems by employing an out-of-band
receiver-based accumulation estimator, with minimal
support from network routers. Analysis and simulation comparisons
between Vegas and Monaco demonstrate the effectiveness of the
Monaco accumulation estimator. We use ns-2 simulations to show
that the static and dynamic performance of Monaco matches the
theoretic results. One key issue regarding the ACC model in
general, i.e., the scalability of router buffer requirement, is
discussed."
}
@INPROCEEDINGS{Xia0305:Importance,
AUTHOR="Bo Xia and William Ryan",
TITLE="On Importance Sampling for Linear Block Codes",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we introduce an importance sampling (IS)
scheme for linear block codes with maximum a posteriori
(MAP) or message-passing decoding. Unlike previous work
in this area which either employed only maximum
likelihood (ML) decoding or required codebook
information, this scheme can be immediately applied to
MAP or message-passing decoding without the help of
codebook information. Experiments show large IS gains
for single-parity check (SPC) codes and short SPC
product codes. For low-density parity-check (LDPC)
codes, no IS gain is observed at low signal-to-noise
ratios (SNRs), but large IS gains can be predicted for
LDPC codes at high SNR."
}
@INPROCEEDINGS{Xia0305:Soft,
AUTHOR="Haitao Xia and J. Cruz",
TITLE="Soft-Decision Decoding of Reed-Solomon Codes on Magnetic Recording Channels
with Erasures",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="A soft-decision Reed-Solomon decoding algorithm has been recently proposed
by Koetter and Vardy, which provides significant coding gains by fully
utilizing channel output reliability information. The algorithm converts
this reliability information into a set of interpolation points and their
multiplicities, and consists of three key steps: multiplicity matrix
calculation, soft interpolation, and polynomial factorization. Large
coding gains have been observed only for low-rate codes in additive white
Gaussian noise channels, and with very high decoding complexity. Here we
present a new lower complexity suboptimal algorithm for computing the
multiplicity matrix, discuss architectures for soft-decision decoders and
evaluate the performance of the soft-decision algorithm on magnetic
recording channels in the presence of erasures."
}
@INPROCEEDINGS{Xian0305:Capacity,
AUTHOR="Wei Xiang and Steven Pietrobon",
TITLE="On the Capacity and Normalisation of {ISI} Channels",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We investigate the capacity of various ISI channels with additive
white Gaussian noise. Previous papers showed a minimum E\_b/N\_0
of -4.6 dB, 3 dB below the capacity of a flat channel, is obtained
using water pouring capacity formulas for the 1+D channel.
However, these papers did not take into account that the channel
power gain can be greater than one when water pouring is used. We
present a generic power normalisation method of the channel
frequency response, namely peak bandwidth normalisation, to
facilitate the fair capacity comparison of various ISI channels.
Three types of ISI channel, i.e., adder channels, RC
channels and magnetic recording channels, are examined. By using
our channel power gain normalisation, the capacity curves of these
ISI channels are shown."
}
@ARTICLE{Xiao0304:Utility,
AUTHOR="Mingbo Xiao and Ness Shroff and Edwin Chong",
TITLE="A Utility-Based Power-Control Scheme in Wireless Cellular Systems",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=2,
PAGES="210-221",
MONTH=apr,
YEAR=2003,
REFERENCES=24,
KEYWORDS="admission control; cellular system; distributed algorithm; fairness; Nash
equilibrium; Pareto optimal; power control; robustness;
signal-to-interference ratio (SIR); stability; utility function; wireless",
ABSTRACT="Distributed power-control algorithms for systems with hard
signal-to-interference ratio (SIR) constraints may diverge when
infeasibility arises. We present a power-control framework called
utility-based power control (UBPC) by reformulating the problem using a
softened SIR requirement (utility) and adding a penalty on power
consumption (cost). Under this framework, the goal is to maximize the net
utility, defined as utility minus cost. Although UBPC is still
noncooperative and distributed in nature, some degree of cooperation
emerges: a user will automatically decrease its target SIR (and may even
turn off transmission) when it senses that traffic congestion is building
up. This framework enables us to improve system convergence and to satisfy
heterogeneous service requirements (such as delay and bit error rate) for
integrated networks with both voice users and data users. Fairness,
adaptiveness, and a high degree of flexibility can be achieved by properly
tuning parameters in UBPC.",
URL="http://ieeexplore.ieee.org/iel5/90/26877/01194818.pdf?isNumber=26877\&prod=JNL\&arnumber=1194818\&arSt=+210\&ared=+221\&arAuthor=Mingbo+Xiao\%3B+Shroff\%2C+N.B.\%3B+Chong\%2C+E.K.P."
}
@INPROCEEDINGS{Xiao0305:Backoff,
AUTHOR="Yang Xiao",
TITLE="Backoff-based Priority Schemes for {IEEE} {802.11}",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, backoff-based priority schemes for IEEE 802.11 are achieved
by differentiating the minimum backoff window size, the backoff
window-increasing factor, and the maximum backoff stage. An analytical
model is proposed to study performance of backoff-based priority schemes
in terms of saturation throughput and saturation delay. Simulations are
conduced to validate the analytical results."
}
@INPROCEEDINGS{Xiao0305:Implicit,
AUTHOR="Yang Xiao and Yuguang Fang and Yi-Bing Lin",
TITLE="Implicit Deregistration in {3G} Cellular Networks",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In a 3G cellular network, the visitor location registers (VLRs), the
gateway location registers (GLRs), and the home location registers (HLRs)
form a three-level mobility database structure. When users leave a GLR/VLR
service area, deregistration with a GLR/VLR is required. Deregistration may
create significant traffic in the network, especially the traffic between a
GLR and a HLR, which is the remote/international traffic. In this paper, we
propose a hierarchical implicit deregistration scheme with a
first/subsequent registration in 3G cellular networks to effectively
eliminate deregistration traffic. An analytic model is proposed to carry
out the performance of the proposed scheme. Our study shows that the
proposed scheme not only reduces the local deregistration traffic between
the GLR and the VLR, but also reduces the remote/international
deregistration traffic between the HLR and the GLR. This is especially
true when the ratio of the cost of the remote/international traffic
between the GLR and the HLR to the cost of local traffic between the VLR
and the GLR is high."
}
@INPROCEEDINGS{Xiao0305:Optimal,
AUTHOR="Weimin Xiao",
TITLE="Optimal Detection of {M-QAM} Signal with Channel Estimation Error",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we study the optimal detection of QAM signaling
with channel estimation error. Optimal detectors, Maximum Likelihood
(MaxLike) detector and a Modified Minimum Distance (ModDist) detector,
are derived for the case of a known Gaussian channel distribution
and unknown channel distribution, respectively. These detectors
differ from the traditional minimum distance detector which ignores
the effect of channel estimation error. Soft decision metrics
for coded performance are also generated using the soft output of
these detectors based on Generalized Likelihood Ratio (GLLR). Numerical
results are given to compare the performance of these detectors.
Although only marginal improvement is observed when using the proposed
detectors without coding, significant gains are obtained when used
together with coding."
}
@INPROCEEDINGS{Xiao0305:Optimizing,
AUTHOR="Li Xiao and Jun Wang and Klara Nahrstedt",
TITLE="Optimizing the {IBGP} Route Reflection Network",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In the conventional Internal Border Gateway Protocol (IBGP), the BGP
sessions between all BGP speakers in a single Autonomous System (AS) form
a full mesh.
For scalability reasons, route reflection is proposed as an alternative to
the full mesh inside an AS. The selection of route reflectors and their
clients determines the paths used by IBGP route advertising.
Thus, the design of the route reflection graph is an important issue for
improving IBGP operating efficiency and reliability.
This paper focuses on the topology optimization for the route reflection
graph, i.e., the selection of the reflectors and the interconnections
between reflectors and clients. We propose the Optimum Reflection Graph
(ORG) problem to find the best topology for IBGP reflection according to
the efficiency or reliability metrics.
We give the solvability conditions for the problem and present a solution
based on the Integer Programming model. Our approach is also highly
flexible. Human decisions or constraints can be easily incorporated to
find a topology which satisfies AS administrators' manual configurations."
}
@INPROCEEDINGS{Xiao0305:Statistical,
AUTHOR="Chengshan Xiao and Yahong Zheng and Norman Beaulieu",
TITLE="Statistical Simulation Models for Rayleigh and Rician Fading Channels",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, an improved Clarke's model is proposed for the simulation of
Rayleigh fading channels. Based on this improved Rayleigh fading model, a
new simulation model is further proposed for Rician fading channels. The
new Rician fading model employs a zero-mean stochastic sinusoid as the
specular (line-of-sight) component, which is different from all the
existing Rician fading simulators that have non-zero mean deterministic
specular component. The statistical properties of the proposed Rician
fading model are analyzed in detail. It is shown that the probability
density function of the Rician fading phase is not
only independent from time but also uniformly distributed over $[-\pi,
\pi)$. This property is different from that of all the existing Rician
fading models. Moreover, an explicit formula for level crossing rate is
derived for general Rician fading, whose specular component has non-zero
Doppler frequency. The statistical properties of the new simulators are
evaluated by extensive simulation results, finding good agreement with
theoretical analysis in all cases."
}
@ARTICLE{Xiao0306:Optimal,
AUTHOR="Yang Xiao",
TITLE="Optimal location management for two-tier {PCS} networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=10,
PAGES="1047-1055",
MONTH=jun,
YEAR=2003,
REFERENCES=9,
KEYWORDS="Location management; Home Location Register; Visitor Location Register;
Analytical model",
ABSTRACT="One of the most important issues in Personal Communication Service (PCS)
networks is location management, which keeps track of the Mobile Terminals
(MTs) moving from place to place. In this paper, we analytically derive
cost functions of location updates and paging for a dynamic movement-based
location management scheme for PCS networks with two-tier mobility
databases. We prove analytically that there is a unique optimal movement
threshold that minimizes the total cost of Home Location Register location
updates, Visitor Location Register location updates, and paging, per call
arrival. An effective algorithm is proposed to find the optimal movement
threshold. Furthermore, we propose a hybrid location management scheme, in
which when the call-to-mobility ratio is larger than a threshold, the
optimal dynamic movement-based scheme is adopted. Otherwise, the static
location update is adopted. The Newton approximation method is adopted to
find this threshold. Our study shows that the proposed hybrid scheme
outperforms both the dynamic movement-based scheme and the static location
update scheme.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-4805VF7-6-6C\&\_cdi=5624\&\_orig=browse\&\_coverDate=06\%2F20\%2F2003\&\_sk=999739989\&view=c\&wchp=dGLbVtb-zSkzS\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=356ca3794de9759c75f7437e11145138\&ie=f.pdf"
}
@INPROCEEDINGS{Xiao0310:Intra,
AUTHOR="Yang Xiao",
TITLE="An Intra-Location Area Location Update Scheme for {PCS} Networks",
BOOKTITLE="VTC 2003 - Data base management in wireless network environments",
DAYS=4,
MONTH=oct,
YEAR=2003,
ABSTRACT="In this paper, we propose a dynamic anchor-cell intra-location area
location update scheme with an optimal timer to assist the paging process
and to increase paging accuracy. In the proposed scheme, each mobile
terminal has a valid/invalid anchor-cell, and such information is stored
in both Mobile Switching Center and the handset. An anchor-cell is defined
as the cell that the mobile terminal stays longer than a time period. A
mobile terminals anchor-cell may be dynamically changed, and can be either
valid or invalid. The mobile terminal updates its anchor-cell information
to Mobile Switching Center only when the status is changed, i.e. from the
valid to the invalid or vice versa. Therefore, the intra-location area
location update cost is minimized."
}
@INPROCEEDINGS{Xie0305:Modeling,
AUTHOR="Wei Xie and Hairong Sun and Yonghuan Cao and Kishor Trivedi",
TITLE="Modeling of User Perceived Webserver Availability",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="While the Internet and the World-Wide-Web (WWW)-based online services
expand at an unprecedented pace, the Web users are still experiencing a
high level of unavailability. Paralleling the effort of identifying the
failure-recovery behaviors of the underlying supporting infrastructure,
attention has also been paid to Web users' behaviors. However, a link
between the two research directions seems to be missing.
In this paper, we propose to use Markov regenerative process (MRGP) models
to study the availability of Internet-based services perceived by a Web
user, which capture the interactions between the service facility and the
user. The use of sophisticated MRGP models rather than traditional
continuous-time Markov chain (CTMC) models is due to the fact that the
model of Web user behavior involves non-exponential distributions. The
necessity of MRGP modeling is also evidenced by the comparisons with the
corresponding CTMC models, which show that the popular convenient CTMC
models tend to overestimate user-perceived service unavailabilities by
26\% to 125\%.
We study two different online service scenarios: (1)
single-user-single-host and (2) single-user-multiple-host. Results from
the models provide useful implications to both service providers and
online end-users. It is found that user-perceived service unavailability
depends not only on the infrastructure's failure-recovery characteristics
but also, more importantly, on the user's behavior. Also, for a service
provider, to improve users' satisfaction, inventing a fast recovery
mechanism is more effective than striving for a more reliable platform
given the platform availability is the same. Future work includes
extensive testbed experiments and trace-driven simulations."
}
@INPROCEEDINGS{Xie0305:Paging,
AUTHOR="Linda Jiang Xie",
TITLE="Paging-Aided Connection Setup for Real-time Communication in Mobile
Internet",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Mobile IP is a solution for mobility on the global Internet.
However, the basic Mobile IP does not support paging.
The main benefit of providing paging services is to save
the battery power consumption at mobile terminals.
Next generation Internet is expected to support multimedia
communications. For real-time data traffic, Quality of Service
(QoS) provision must be guaranteed. The Resource Reservation
Protocol (RSVP) was proposed to support the signaling of
end-to-end IP QoS. When both IP paging and RSVP are supported
in the network, the signaling delay for connection setup is
the sum of the paging delay and the time for RSVP path setup.
This paper introduces a new scheme for fast connection setup
of real-time communication. The connection is set up with the
help of Mobile IP location registration and paging. Performance
analysis shows that the proposed scheme reduces the overall
signaling delay and the total number of signaling messages."
}
@INPROCEEDINGS{Xie0310:Adapting,
AUTHOR="Wanxia Xie and Sham Navathe",
TITLE="Adapting Transactions in a System on Mobile Devices (SyD)",
BOOKTITLE="VTC 2003 - Data base management in wireless network environments",
DAYS=4,
MONTH=oct,
YEAR=2003,
ABSTRACT="Resource constraints in wireless environment pose a great challenge to
conventional transaction processing techniques. Current transaction
processing schemes have limited flexibility, and cannot easily respond and
adapt to the changes of runtime environment. In previous work, we propose a
QoS-aware transaction processing framework which supports graceful
adaptation to the changes in mobile devices. In this paper, we address the
following questions. How does QoS specification support adaptiveness in the
transaction model? How can QoS specification be associated with relaxed
ACID properties? We use a distributed calendar application to show the
adaptation process and performance measurement. This work is done in the
context of an ongoing research project called SyD, System on Mobile
devices."
}
@INPROCEEDINGS{Xin0305:Empirical,
AUTHOR="Xin Yuan and Guang Yang",
TITLE="Empirical Probability Based QoS Routing",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We study Quality-of-Service (QoS) routing schemes that make
routing decisions based on empirical resource availability probability
distribution information. These empirical probability based routing
schemes offer better performance than traditional
schemes that make routing decisions based on
resource availability information when the global network state
information
is imprecise. We investigate a number of schemes to explicitly maintain
the resource availability probability distribution information
and to perform QoS routing
using both the probability information and the resource availability
information, evaluate variations of empirical probability based QoS
routing,
and identify their strengths and weaknesses.
The results of our performance study
indicate that the performance of
empirical probability based routing schemes is
insensitive to the frequency of probability information updates.
Thus, although explicitly maintaining the resource availability
probability information requires more data to be exchanged
than maintaining the resource availability information,
empirical probability based QoS routing is feasible since the
probability information can be updated infrequently without
significantly affecting the routing performance."
}
@INPROCEEDINGS{Xin0305:Lambda,
AUTHOR="Li Xin and Mounir Hamdi",
TITLE="lambda-ADJUST Algorithm for Optical Switches with Reconfiguration Delay",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Using optical technology brings in the advantages such as
scalability, high bandwidth, power consumption for the design of
switches/routers. However, reconfiguring the optical fabric of
these switches requires significant time under current technology.
Conventional slot-by-slot scheduling may severely cripple the
performance of these switches due to its frequent request of
fabric reconfiguration. A more appropriate way is to use a Time
Slot Assignment (TSA) scheduling approach. The switch gathers the
incoming traffic periodically and schedules them in batches, while
trying to minimize the transmission time. This Optical Switch
Scheduling (OSS) problem is defined in this paper and it is
NP-complete. Earlier TSA algorithms normally assume the
reconfiguration delay to be either zero or infinity for
simplicity. To this end, we propose a lambda-ADJUST algorithm,
which breaks this limitation and self-adjusts with different
reconfiguration delay values. The algorithm runs at O(sqr(N)logN) time
complexity, guarantees 100\% throughput and bounded
worst case delay. In addition, it outperforms existing TSA
algorithms across a large spectrum of reconfiguration values."
}
@INPROCEEDINGS{Xu0303:Efficient,
AUTHOR="Jinhui Xu and Chunming Qiao and Jikai Li and Guang Xu",
TITLE="Efficient Channel Scheduling Algorithms in Optical Burst Switching Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Optical Burst Switching(OBS) is a promising paradigm for the
next-generation Internet. In OBS, a key problem is to schedule bursts on
wavelength channels whose bandwidth may become fragmented with the
so-called void (or idle) intervals with both fast and bandwidth efficient
algorithms so as to reduce burst loss. To date, only two scheduling
algorithms, called Horizon and LAUC-VF, have been proposed, which trade
off bandwidth efficiency for fast running time and vice versa,
respectively.
In this paper, we propose several novel algorithms for scheduling bursts
in OBS networks with and without Fiber Delay Lines (FDLs). In networks
without FDLs, our proposed Min-SV algorithm can schedule a burst
successfully in O(log m) time, where m is the total number of void
intervals, as long as there is a suitable void interval. Simulation
results suggest that our algorithm achieves a loss rate which is at least
as low as the best previously known algorithm LAUC-VF, but can run much
faster. In fact, its speed can be almost the same as Horizon (which has a
much higher loss rate). In networks with FDLs, our proposed Batching FDL
algorithm considers a batch of FDLs simultaneously to find a suitable FDL
to delay a burst which would otherwise be discarded due to contention,
instead of considering the FDLs one by one. The average search time of
this algorithm is therefore significantly reduced from that of the
existing sequential search algorithms."
}
@INPROCEEDINGS{Xu0303:Fundamental,
AUTHOR="Jun Xu",
TITLE="On the Fundamental Tradeoffs between Routing Table Size andNetwork Diameter
in Peer-to-Peer Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="In this work, we study a fundamental tradeoff issue in designing
dynamic hash table (DHT) in peer-to-peer networks: the size of the
routing table v.s. the network diameter. It was observed in Ratnasamy
et al. that existing DHT schemes either (a) have a routing table of
size $O(log\_2 n)$ and network diameter of $O(log\_2 n)$, or (b) have a
routing table of size $d$ and network diameter of $O(n^{1/d})$. They
asked whether this represents the best asymptotic ``state-efficiency''
tradeoffs. Our first major result is to show that there are routing
algorithms which achieve better asymptotic tradeoffs. However, such
algorithms all cause severe congestion on certain network nodes, which
is undesirable in a P2P network. We then define the notion of
``congestion-free'' and conjecture that the above tradeoffs are
asymptotically optimal for a congestion-free network. Though we are
not able to prove (or disprove) this conjecture in full generality,
our rigorous formulation of the problem and techniques introduced in
proving slightly weaker results serve as the basis for further
exploration of this problem. Our second major result is to prove
that, if the routing algorithms are symmetric, the aforementioned
tradeoffs are asymptotically optimal. Furthermore, for symmetric
algorithms, we find that $O(log\_2 n)$ is a magic threshold point for
routing table size as follows. The ``congestion'' factor dominates
the ``reachability'' factor in determining the minimum network
diameter when the routing table size is asymptotically smaller than or
equal to $O(log\_2 n)$, and it is the other way around when the routing
table size is asymptotically larger than $O(log\_2 n)$. Our third and
final major result is to study the exact (instead of asymptotic)
optimal tradeoffs. We propose a new routing algorithm that reduces
the routing table size and the network diameter of Chord both by
21.4\\% without introducing any other overhead, based on
a novel number-theoretical technique."
}
@INPROCEEDINGS{Xu0303:Queueing,
AUTHOR="Lisong Xu and Harry Perros and George Rouskas",
TITLE="A Queueing Network Model of an Edge Optical Burst Switching Node",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We consider an edge optical burst switching (OBS) node with or without
converters, and with no buffering.
The OBS node serves a number of users, each connected to the switch
over a fiber link that supports multiple wavelengths.
Each wavelength is associated with a 3-state Markovian burst arrival
process.
The arrival process permits short and long bursts to be modeled.
We model the edge OBS node as a closed non-product-form queueing
network, with multiple heterogeneous classes, and we develop a suite of
approximate decomposition algorithms to analyze it.
Our approximate algorithms have a good accuracy, and they provide
insight into the effect of various system parameters on the performance
of the edge OBS node."
}
@INPROCEEDINGS{Xu0303:Turning,
AUTHOR="Zhichen Xu and Mallik Mahalingam and Magnus Karlsson",
TITLE="Turning Heterogeneity into an Advantage in Overlay Routing",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Recent P2P overlay systems, represented by Pastry, CAN, and Chord, offer an
administration-free and fault-tolerant application-level overlay network.
While elegant from a theoretical perspective, these systems have some
serious disadvantages. First, these systems rely on application-level
routing, which may be inefficient with respect to network delays and
bandwidth consumption. Second, they typically construct a homogeneously
structured overlay and do not make discriminative use of nodes, since
nodes in these networks usually have varying physical connectivity and
packet-forwarding capacities.
In this paper, we propose two approaches for constructing an auxiliary
network called an expressway to take advantage of the different
connectivity and forwarding capacities of the nodes. As a result, we are
able to reconcile the conflict of presenting the applications with a
homogeneous structured overlay to simplify management, while at the same
time taking advantage of the inherent heterogeneity of the underlying
physical network. Our simulation results show that our expressway can
achieve close to default IP routing performance (on average, 1.06 times
default IP routing) in overlay networks."
}
@INPROCEEDINGS{Xu0305:Local,
AUTHOR="Yi Xu and Henry C.J. Lee and Vrizlynn L. L. Thing",
TITLE="A Local Mobility Agent Selection Algorithm for Mobile Networks",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The Mobile IP protocol has been designed to address the problem of roaming
between IP networks. However, as mobile nodes move between networks, the
signaling overhead causes significant disruption to real time data
traffic. The Localized Mobility Management (LMM) has been proposed to
enhance the handoff performance between networks within the same domain.
By introducing the concept of Local Mobility Agent (LMA), mobile node
visiting a foreign domain is exempted from sending frequent address update
to home agent and correspondent nodes, when its movement is limited to the
visited domain. As multiple LMAs are configured in a domain for
redundancy, scalability and load sharing concerns, LMA selection becomes
an issue. This paper proposes a new LMA selection algorithm, Mobile
Controlled Movement Tracking (MCMT). The objective of this new algorithm
is to discover the optimal LMA in terms of selection stability and load
balancing, by taking into consideration the mobility characteristics of
mobile node. Our analysis shows that this proposal can provide good
support for low latency handoff and load sharing among LMAs."
}
@INPROCEEDINGS{Xu0305:Multi,
AUTHOR="Bin Xu and Chenyang Yang and Shiyi Mao",
TITLE="A Multi-Carrier Detection Algorithm for {OFDM} Systems Without Guard Time",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="A new demodulation algorithm is proposed for orthogonal frequency division
multiplexing (OFDM) systems without guard time (GT) to mitigate the
inter-symbol interference (ISI) and inter-carrier interference (ICI)
caused by dispersive channels. Since the proposed algorithm is analogous
to the multiuser detection (MUD) method, successive interference
cancellation based on decision feedback and MMSE criterion (SIC-DF), for
synchronous DS-CDMA systems, it is named SIC-DF multi-carrier detection
(MCD). Theoretical analysis and simulation results indicate that it can
efficiently combat the ISI and ICI for OFDM systems without GT by using
joint multi-carrier time domain equalization and detection instead of
one-tap frequency domain equalization at the cost of reasonable
computational complexity. It can even offer lower uncoded bit error rate
(BER) than the conventional OFDM systems with GT."
}
@INPROCEEDINGS{Xu0306:Receiver,
AUTHOR="Zhichen Xu and Chunqiang Tang and Sujata Banerjee and Sung-Ju Lee",
TITLE="Receiver Initiated Just-in-Time Tree Adaptation for Rich Media Distribution",
BOOKTITLE="ACM NOSSDAV 2003",
ADDRESS="Monterey, California, USC",
DAYS=1,
MONTH=jun,
YEAR=2003,
ABSTRACT="Application-level multicast networks overlaid over unicast IP networks are
increasingly gaining in importance. While there have been several
proposals for overlay multicast networks, very few of them focus on the
stringent requirements of real-time applications such as streaming
media. We propose an efficient overlay application layer
multicast infrastructure for multimedia real-time applications based
on a combination of landmark clustering and RTT measurements. Our goal
is to balance the network-oriented goals of building an efficient
multicast tree with the application-oriented goals of providing good QoS
with minimal disruptions. Using accurate global soft state information
tables, our approach promptly constructs and reconfigures high quality
trees. A distinguished feature of our approach is that the tree
reconfiguration is initiated just-in-time by the application client at
the receiver when the media quality falls below a specific threshold.
The goal is to achieve dynamic tree reconfiguration with very low
switching delay such that end users do not perceive any application
performance degradation."
}
@ARTICLE{Xue0305:Optimal,
AUTHOR="Guoliang Xue",
TITLE="Optimal multichannel data transmission in computer networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=7,
PAGES="759-765",
MONTH=may,
YEAR=2003,
REFERENCES=29,
KEYWORDS="Communication systems; Computer communications; End-to-end delay;
Multichannel routing; Polynomial time algorithms; Quality of service",
ABSTRACT="We study end-to-end routing in a communication system where there is a
bandwidth and a propagation delay associated with each link, as well as a
queuing delay associated with each intermediate node. We present a
polynomial time algorithm for computing an optimal multichannel routing to
transmit a given message. Examples are also given to show that several
previously published path-based algorithms for this problem are
suboptimal. We then generalize the multichannel routing problem to
delay-constrained multichannel routing problem and show that this
generalized problem can also be solved in polynomial time.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-472BCJC-2-5Y\&\_cdi=5624\&\_orig=browse\&\_coverDate=05\%2F01\%2F2003\&\_sk=999739992\&view=c\&wchp=dGLbVlb-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=c411f0261ef1c562fd9e7e03c30b1581\&ie=f.pdf"
}
@INPROCEEDINGS{Xue0305:Routing,
AUTHOR="Guoliang Xue and Arunabha Sen and Rakesh Banka",
TITLE="Routing with Many Additive QoS Constraints",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="A fundamental problem in QoS routing is to find a path between a specified
source-destination node pair that satisfies a set of end-to-end
quality-of-service constraints.
We study this problem in a communication system where there are multiple
additive quality of service parameters associated with each link.
It is well-known that the multi-constrained path selection problem
(MCPS) is NP-complete.
In this paper, we present a fully polynomial time approximation scheme for
an
optimization version of the MCPS problem.
This means that for any given epsilon > 0, we can compute, in time bounded
by a polynomial of the input size of the problem and in 1/epsilon,
a solution whose cost is at most (1+epsilon) of that of the optimal
solution.
To the best of our knowledge, this is the first polynomial time
approximation
algorithm for the MCPS problem with three or more additive quality of
service
parameters."
}
@ARTICLE{Yaco0303:Pricing,
AUTHOR="Mohamed Yacoubi and Maria Emelianenko and Natarajan Gautam",
TITLE="Pricing in next generation networks: a queuing model to guarantee QoS",
JOURNAL="Performance Evaluation",
VOLUME=52,
NUMBER=1,
PAGES="59-84",
MONTH=mar,
YEAR=2003,
REFERENCES=18,
KEYWORDS="Bandwidth allocation; Multi-class traffic; Queuing model; Quality of
service; Access providers",
ABSTRACT="We consider the scenario where users access Next Generation Networks via
Network Access Providers (NAP). We assume that users belong to N different
classes and the bandwidth received by each class is determined by a
User-Share Differentiation (USD) scheme. According to USD, each class is
guaranteed a minimum bandwidth and all users accepted into the NAP are
allocated the minimum bandwidth corresponding to their class and any
remaining bandwidth is shared according to the ratio of the minimum
bandwidths of each class. We develop a queuing-based model and solve an
optimization problem to determine the minimum bandwidth (defined in USD)
for each of the N classes that maximizes the revenue of the NAP, subject
to satisfying a request blocking performance guarantee.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-47FDJKR-1-85\&\_cdi=5663\&\_orig=browse\&\_coverDate=03\%2F31\%2F2003\&\_sk=999479998\&view=c\&wchp=dGLbVlz-zSkWb\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=a4b0a658d61e17cd3560127235f92454\&ie=f.pdf"
}
@INPROCEEDINGS{Yama0305:Adaptive,
AUTHOR="Naotake Yamamoto and Tomoaki Ohtsuki",
TITLE="Adaptive Internally Turbo-Coded Ultra Wideband-Impulse Radio
{(AITC-UWB-IR)} System",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="As a new spread spectrum system, an Ultra Wideband-Impulse Radio (UWB-IR)
has attracted much attention in high speed indoor multiple access radio
communications.
Since the UWB-IR system repeats and transmits pulses for each bit, the
UWB-IR system is considered as a coded scheme with a simple repetition
block code.
As an error correcting code, Turbo-codes proposed by C. Berrou et al. in
1993 have attracted much attention beyond the field of coding theory,
because the performance is very close to the Shannon limit with practical
decoding complexity.
In this paper, we propose an adaptive internally Turbo-coded UWB-IR
(AITC-UWB-IR) system.
The proposed system employs a Turbo code in addition to a repetition block
code and shares the transmission bandwidth adaptively between them.
We evaluate the performance of AITC-UWB-IR by theoretical analysis and
computer simulation.
From our numerical and simulation results, we show that the BER of the
AITC-UWB-IR is superior to that of the SOC-UWB-IR when the bit rate is
high."
}
@INPROCEEDINGS{Yama0305:Bit,
AUTHOR="Toshiyuki Yamane and Yasunao Katayama",
TITLE="Bit Error Rate Analysis on Iterative Two-Stage Decoding of Two Dimensional
Codes by Importance Sampling",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We present a bit error rate analysis for iterative two-stage hard decision
decoding of product codes and proposed concatenated codes suitable for
optical communication.
Our method is based on an importance sampling technique characterized by
recursive calculation of cumulative binomial probabilities and direct
biasing of error patterns.
We can accelerate the Monte Carlo simulations by several orders of
magnitude as much as $10^8$ by the method and obtain the coding gains at
the BERs as low as $10^{-15}$ required in optical communications.
We apply the method to comparative BER analysis of product codes and
proposed concatenated codes and show that product codes of small minimum
distance have troublesome error floors at low BERs below $10^{-12}$ while
proposed concatenated codes of large minimum distance do not."
}
@INPROCEEDINGS{Yama0305:Red,
AUTHOR="Norio Yamagaki and Hideki Tode and Koso Murakami",
TITLE="{RED} Method with Dual-fairness Metrics Cooperating with {TCP} Congestion
Control",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In future IP networks, the main technical challenge will be to
guarantee QoS for each flow. However, it has been reported that the
typical congestion control scheme, Random Early Detection (RED),
causes an unfairness per flow, and this is especially so for TCP
flows. The Differentiated Services (DiffServ) mechanism has also been
studied, but as it is a class-based control mechanism, the unfairness
per flow still remains within the class. Moreover, to guarantee a
flexible QoS, routers require a flow-based control scheme. In this
paper, we propose a flow-based congestion control scheme, called RED
with Dual-fairness metrics (DRED), to dissolve the unfairness per flow
and so provide a feasible QoS. DRED enables to consider backlogged
packets in the buffer, and a flow succession time by simple flow
management per router. In addition, DRED is a suitable scheme for TCP
transmission, cooperating with TCP congestion control mechanisms."
}
@INPROCEEDINGS{Yan0305:Multicast,
AUTHOR="Shuguang Yan and Jitender Deogun",
TITLE="Multicast Wavelength Routing and Assignment under Multi-drop Path Model",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We investigate the problem of Wavelength Minimization for Multicast Traffic
under Multi-drop Path Model (WMMT-MPM) in all-optical networks. Under a
multi-drop path model, multiple paths are employed to establish a
multicast session and each path can drop signals at no more than a
predefined number of destination nodes. Given a network topology and a set
of multicast sessions, the WMMT-MPM problem is to find a valid routing for
each of the multicast sessions and assign a wavelength to each path in
each of the routings, with the objective of minimizing the total number of
wavelengths used to establish all the multicast sessions. To effectively
solve the WMMT-MPM problem, we develop two heuristics for routing and
wavelength assignment: MFBH-SL and TSH. Through experiments, we show that
the TSH outperforms MFBH-SL in more than 80\% of instances for real-life
and randomly generated networks. Furthermore, the percentage of wavelength
saving is at least 18\% when session size is no more than 40\% of network
nodes."
}
@INPROCEEDINGS{Yan0305:Multiuser,
AUTHOR="Hongbo Yan",
TITLE="A Multiuser Detection Method For Overlay {CDMA} Systems",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="To provide new and/or higher rate wireless services with limited
bandwidth resources, frequency overlay has been
proposed to host heterogeneous traffic in common band, where
ONE CDMA system is involved due to its noise-like nature.
In the paper, we address multiuser detection problem for overlay
scenarios where there exist MULTIPLE CDMA systems.
We propose a linear parallel interference cancellation (PIC) structure
where interference due to overlaid systems is captured and subtracted
by means of its subspace. Simulation results validate
our solution and show that the proposed receiver has better
performance in various aspects than the conventional MMSE reciever."
}
@INPROCEEDINGS{Yang0303:Efficient,
AUTHOR="Mei Yang and Si-Qing Zheng",
TITLE="An Efficient Scheduling Algorithm for {CIOQ} Switches with Space-Division
Multiplexing Expansion",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Recently, CIOQ switches have attracted interest from both academic
and industrial communities due to their ability of achieving
100\% throughput and perfectly emulating OQ switch performance
with a small speedup factor S. To achieve a speedup factor S,
a conventional CIOQ switch requires the switch matrix and the
memory to operate S times faster than the line rate. In this
paper, we propose to use a CIOQ switch with space-division
multiplexing expansion and grouped inputs/outputs (SDMG CIOQ
switch for short) to achieve speedup while only requiring the
switch matrix and the memory to operate at the line rate. The cell
scheduling problem for the SDMG CIOQ switch is abstracted as a
maximum bipartite k-matching problem. Using fluid model, we
prove that any maximal size k-matching algorithm on an SDMG CIOQ
switch with an expansion factor 2 can achieve 100\% throughput
assuming input arrivals satisfy the strong law of large numbers
and no inputs/outpus are oversubscribed. We further propose an
efficient and starvation-free maximal size k-matching scheduling
algorithm, kFRR, for the SDMG CIOQ switch. Simulation results
show that kFRR achieves 100\% throughput with an expansion
factor 2 under two SLLN traffic models, uniform traffic and
polarized traffic, confirming our analysis."
}
@INPROCEEDINGS{Yang0305:2d,
AUTHOR="Chia-Ming Yang and Pei-Hsuan Lin and Guu-Chang Yang and Wing Kwong",
TITLE="{2D} Orthogonal Spreading Codes for Multicarrier {DS-CDMA} Systems",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper presents two new constructions of two-dimensional
(2D) spreading codes, here designated as 2D orthogonal variable
spreading factor (OVSF) codes, for multicarrier direct-sequence
code-division multiple-access (MC-DS/CDMA) systems. Orthogonalities
of the spreading codes are employed to improve the bandwidth
efficiency and interference-rejection capability of the DS-CDMA
systems. The 2D OVSF codes are constructed by generalizing
one-dimensional (1D) OVSF codes and they possess ideal
auto- and cross-correlation properties. Furthermore, these
2D OVSF codes preserve the orthogonality between different
spreading factors in an OVSF code tree, as illustrated.
Hence, they can be employed to support multimedia services
with a variety of data rates."
}
@INPROCEEDINGS{Yang0305:Model,
AUTHOR="Mengkun Yang and Zongming Fei",
TITLE="A Model for Replica Placement in Content Distribution Networks for
Multimedia Applications",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The distribution of multimedia files brings new challenges to the problem
of replica placement in content distribution networks (CDN) and
invalidates
several assumptions underlying the existing solutions. In this paper
we formulate a new model for the problem of replica placement to
accommodate
these new characteristics. We perform a theoretical analysis of the cost
of distributing multimedia files over CDNs and find out that, contrary
to the intuition, deploying as many replicas as possible is not always
a good strategy. We then propose several replica placement algorithms that
can determine the optimal number of replicas we should select from a given
set of potential sites. By simulation we demonstrate that the performance
of clients may degrade if we choose too many sites for replica placement."
}
@INPROCEEDINGS{Yang0305:Performance,
AUTHOR="Hong-Chuan Yang",
TITLE="Performance Analysis of Generalized Switch and Examine Combining",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In diversity-rich environments, there is a tradeoff between
performance and complexity. While combining a high number of paths
improves the performance, it also increases the receiver
complexity. With this in mind, we look into the performance of
generalized switch and examine combining (GSEC):
a low-complexity scheme suitable for diversity-rich environments.
More specifically, after deriving the statistics of
the combiner output, including the moment generating function and
probability density function,
we analyze the performance of GSEC
in independent and identically distributed
Rayleigh fading environment in terms of average
combiner signal-to-noise ratio, outage probability,
and average error probability.
As an illustration of the mathematical formalism,
selected numerical examples
are provided together with some related discussions
and result interpretations."
}
@INPROCEEDINGS{Yang0305:Performance,
AUTHOR="Guang Yang and Ren Wang and M.y. Sanadidi and Mario Gerla",
TITLE="Performance of {TCPW} {BR} in Next Generation Wireless and Satellite
Networks",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Both ground radio and satellite links are error-prone. In the Next
Generation Internet (NGI) link capacities and propagation delays will
grow, leading to very large TCP pipes. It is well known that in such long
delay and error-prone environments the performance of current TCP variants
degrades severely. We have previously developed an extension of TCP
Westwood (TCPW) called TCPW with Bulk Repeat (TCPW BR). TCPW BR has three
sender-side-only modifications, namely Bulk Repeat, Fixed Retransmission
Timeout and Intelligent Window Adjustment, to help a sender recover from
multiple losses in the same congestion window and keep window size
reasonably large when there is no congestion along the path. A Loss
Differentiation Algorithm (LDA), based on two schemes: Spike and Rate Gap
Threshold, is used to indicate whether losses are due to congestion or
errors. In this paper, we present simulation results of an enhanced TCPW
BR in next generation ground wireless and satellite scenarios. We show
that TCPW BR improves throughput performance up to an order of magnitude
over TCPW BE and NewReno when the error rate is relatively high (e.g.
5\%). The results also show satisfactory fairness and friendliness to TCP
NewReno."
}
@ARTICLE{Yang0312:Reduction,
AUTHOR="Chun-Chuan Yang and Chao-Yu Chen",
TITLE="Reduction of the broadcast redundancy by location awareness in mobile ad
hoc networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=18,
PAGES="2082-2089",
MONTH=dec,
YEAR=2003,
REFERENCES=12,
KEYWORDS="Broadcast; Mobile ad hoc network; Location awareness",
ABSTRACT="In this paper, a reachability-guaranteed approach for reducing broadcast
storms in MANET is proposed. The approach is based on location awareness
of each node, which means each node in the network needs to equip the
positioning device like GPS and exchanges location information in the
HELLO message with its neighbors. Three mechanisms are included in the
proposed approach: Relay Set (RS), Neighbor Coverage (NC), and
Transmission Order (TO). RS is a sender-based mechanism in which the
sending node of the broadcast message determines the relay set of its
neighbors for rebroadcast according to the radio coverage of the
neighbors. The idea of the received-based NC is: a node receiving a
broadcast message does not have to rebroadcast the message if all its
neighbors have received the same message. TO mechanism requires a farther
neighbor node away from the sending node to rebroadcast the message
earlier than closer nodes so that a closer node may have more chances to
save the rebroadcast. Simulation results have shown that the proposed
approach RS+NC+TO has a better performance than existing solutions like
threshold-based schemes and angle-based scheme in terms of 100\%
reachability, more saved rebroadcast, and shorter average latency.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-48CX361-1-1B\&\_cdi=5624\&\_orig=browse\&\_coverDate=12\%2F31\%2F2003\&\_sk=999739981\&view=c\&wchp=dGLbVtz-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=87e44713c8960e7b17c1306ffa491a57\&ie=f.pdf"
}
@INPROCEEDINGS{Yanm0305:Performance,
AUTHOR="Evsen Yanmaz and Ozan Tonguz and Hongyi Wu and Chunming Qiao",
TITLE="Performance of iCAR Systems: A Simplified Analysis Technique",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, a simplified analysis technique for the Integrated Cellular
and Ad hoc Relay (iCAR) systems is provided. First, a simple two-cell
system is analyzed using a multi-dimensional Markov-chain. The performance
metric employed is the call blocking probability of each cell in the
system. To this end, first a closed-form expression for the call blocking
probability in the two-cell system is provided. Then, it is shown that
these closed-form expressions could be used to analyze more practical
systems. The accuracy of the developed simple analytical expressions is
checked and verified by comparing the results predicted by these
analytical expressions with simulation results. It is shown that there is
an excellent match between analytical and simulation results."
}
@INPROCEEDINGS{Yao0303:Topology,
AUTHOR="Bin Yao and Ramesh Viswanathan and Fangzhe Chang and Daniel Waddington",
TITLE="Topology Inference in the Presence of Anonymous Routers",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Many topology discovery systems use traceroute to retrieve path
information from public networks. However, some routers do not
respond to traceroute or do not impart their interface addresses; they
are called anonymous routers. This paper considers the problem of
inferring topology in the presence of anonymous routers. We show that
existing solutions to this problem lead to incomplete, inflated, and
inaccurate topologies. By formalizing the topology inference problem, we
show that producing exact or approximate solutions is intractable. Our
own solution to the inference problem, which include two heuristics, is
presented. We evaluate the heuristics through simulation and apply them
to path information collected from the 6Bone, a large public IPv6 network."
}
@INPROCEEDINGS{Yao0305:Long,
AUTHOR="Lei Yao and Mircea Agapie and Jambi Ganbar and Milos Doroslovacki",
TITLE="Long Range Dependence in Internet Backbone Traffic",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We report the first statistical analysis of Internet backbone traffic,
based on traces with levels of aggregation 10 times larger and timestamp
accuracy 1000 times better than in previous studies. We analyze the first
three moments, marginal distributions and correlation structures of packet
size, packet inter-arrival time, byte count and packet count, and find that
the highly aggregated Internet backbone traffic is still long-range
dependent and self-similar. In fact, all time series examined (packet
size, inter-arrival time, byte count, packet count) exhibit long-range
dependency and self-similarity. In addition to the now-classical analysis
at large time-scales (> 100ms), we report the first statistically relevant
results on the short-term correlation ([50ms, 10ms]) of byte and packet
count processes. We also study the fitness of various analytical models to
the traffic traces. The empirical queuing analysis confirms the long-range
dependence detected through direct analysis by showing that the queue
behavior at high level of aggregation still diverges greatly from that
predicted by Poisson model. As expected, statistical multiplexing gains
improve the queuing performance, leading to economy of scale."
}
@INPROCEEDINGS{Yao0305:Serial,
AUTHOR="Yi Yao",
TITLE="Serial Concatenated Single Differential Space-Time Coded {OFDM} System",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this article, we propose serial concatenated single differential
space-time (SDST) coded OFDM systems, in which blind SDST coding is
serially concatenated with convolutional coding. The OFDM is incorporated
for maintaining satisfactory performance in both time and frequency
selective fading channels at low SNR. The encoding and iterative decoding
process are thoroughly studied and the improved performance is demonstrated
via simulations."
}
@INPROCEEDINGS{Ye0303:Framework,
AUTHOR="Zhenqiang Ye and Srikanth Krishnamurthy and Satish Tripathi",
TITLE="A Framework for Reliable Routing in Mobile Ad Hoc Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Mobile ad hoc networks consist of nodes that are often vulnerable to
failure. As such, it is important to provide redundancy in terms of
providing multiple node-disjoint paths from a source to a destination.
We first propose a modified version of the popular AODV protocol that
allows us to discover multiple node-disjoint paths from a source to a
destination. We find that very few of such paths can be found.
Furthermore,
as distances between sources and destinations increase, bottlenecks
inevitably occur and
thus, the possibility of finding multiple paths is considerably reduced.
We
conclude that it is necessary to place what we call reliable nodes
(in terms of both being robust to failure and being secure) in the network
for
efficient operations. We propose a deployment strategy that determines the
positions
and the trajectories of these reliable nodes such that we can
achieve a framework for reliably routing information. We define a notion
of a
reliable path which is made up of multiple segments, each of which either
entirely consists of reliable nodes, or contains a preset number of
multiple
paths between the end points of the segment.
We show that the probability of establishing a reliable
path between a random source and destination pair increases considerably
even
with a low percentage of reliable nodes when we control their positions
and trajectories
in accordance with our algorithm. Keywords: System design, Simulations."
}
@INPROCEEDINGS{Ye0305:Channel,
AUTHOR="Zhong Ye and Edgar Satorius",
TITLE="Channel Modeling and Simulation for Mobile User Objective System {(MUOS)}
--Part {II:} Selective Scintillation and Terrestrial Multipath fading",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Performance of the Mobile User Objective System is dominated by the
channel conditions characterized by ionospheric scintillation and
multipath fading. Detail analytical modeling for flat channel is
provided in Part I of this paper, while the emphasis of Part II of
this paper is on wideband waveforms. Efficient computer simulation
techniques for the selective scintillation and terrestrial multipath
fading channel impairment have been presented."
}
@INPROCEEDINGS{Ye0305:Channel,
AUTHOR="Zhong Ye and Edgar Satorius",
TITLE="Channel Modeling and Simulation for Mobile User Objective System {(MUOS)}
--Part {I:} Flat Scintillation and Fading",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Performance of the Mobile User Objective System is dominated by the
channel conditions characterized by ionospheric scintillation and
multipath fading. Detail analytical channel modeling is provided,
with the emphasis on narrowband waveforms in Part I of this paper.
Efficient computer simulation techniques for these flat fading channel
impairment have also been presented."
}
@INPROCEEDINGS{Yen0305:Ovsf,
AUTHOR="Li-Hsing Yen",
TITLE="An {OVSF} Code Assignment Scheme Utilizing Multiple Rake Combiners for
{W-CDMA}",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Orthogonal variable spreading factor (OVSF) codes have been proposed
as the channelization codes used in the wideband CDMA access technology
of IMT-2000. OVSF codes have the advantages of supporting variable
bit rate services, which is important to emerging multimedia applications.
The objective of OVSF code assignment algorithm is to minimize the
probability of code request denial due to inappropriate resource
allocation. In this paper, we propose an efficient OVSF code assignment
scheme that utilizes multiple Rake combiners in user equipments. Our
approach finds in constant time all feasible codewords for any particular
request, trying to minimize both rate wastage and
code fragments. The simulation result shows that our scheme outperforms
previous work in the probability of request denial. The code management
overhead is also minimal in our scheme."
}
@INPROCEEDINGS{Yi0305:Efficient,
AUTHOR="Yunjung Yi and Mario Gerla and Taek Jin Kwon",
TITLE="Efficient Flooding in Ad hoc Networks: a Comparative Performance Study",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Many ad hoc network protocols (e.g., routing, service discovery, etc.) use
{\em flooding} as the basic mechanism to propagate control messages. In
flooding, a node transmits a message to all of its neighbors. The
neighbors in turn transmit to their neighbors and so on until the message
has been propagated to the entire network. Typically, only a subset of the
neighbors is required to forward the message in order to guarantee complete
flooding to the entire network.
If the node geographic density (i.e., the number of neighbors within a
node's radio reach) is too high, one can easily see that flooding can
become very inefficient because of redundant, ``superfluous'' forwarding.
In fact, superfluous flooding increases link overhead and wireless medium
congestion. In a large network, with heavy load, this extra overhead can
have severe impact on performance and should be eliminated.
Many efficient flooding schemes have been recently proposed in ad hoc
networks. In this paper, we compare the performance of a set of
representative schemes via simulation using as criteria the flooding
efficiency and the delivery ratio."
}
@ARTICLE{Yoo0309:Predictive,
AUTHOR="Sang-jo Yoo and Kyung-Sup Kwak and Myungchul Kim",
TITLE="Predictive and measurement-based dynamic resource management and QoS
control for videos",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=14,
PAGES="1651-1661",
MONTH=sep,
YEAR=2003,
REFERENCES=16,
KEYWORDS="Dynamic; Bandwidth allocation; Call admission control; Traffic prediction;
QoS control; Real-time video; Variable bit rate",
ABSTRACT="In this paper, we propose a new dynamic resource allocation and call
admission control method for the VBR video sources to meet the user's
quality of service requirements and at the same time to achieve an
efficient resource management in networks. Without any prior knowledge of
the user's traffic statistics, the proposed mechanism dynamically adjusts
the necessary bandwidth by the networks based on the provided quality of
service satisfaction degree of each connection in respect to the user's
requirements in terms of loss ratio and average delay. Using traffic
prediction and simple QoS measurements, the next required bandwidth for
each video connection is computed. To avoid quality decreasing by new
incoming calls, we present a call admission control based on the provided
QoS for existing connections. Simulation results show that our proposed
dynamic method is able to provide the desired level of quality of service
and high network utilization.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47RYK7M-1-35\&\_cdi=5624\&\_orig=browse\&\_coverDate=09\%2F01\%2F2003\&\_sk=999739985\&view=c\&wchp=dGLbVzz-zSkzS\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=dff8130b22ca69f677bf4e4418794310\&ie=f.pdf"
}
@INPROCEEDINGS{Yoon0303:Random,
AUTHOR="Jungkeun Yoon and Mingyan Liu and Brian Noble",
TITLE="Random Waypoint Considered Harmful",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="This study examines the random waypoint model widely used in the simulation
studies of mobile ad hoc networks. Our findings show that this model fails
to provide a steady state in that the average nodal speed consistently
decreases over time, and therefore should not be directly used for
simulation. We show how unreliable results can be obtained by using this
model. In particular, certain ad hoc routing metrics can drop by as much
as 40\% over the course of a 900-second simulation using the random
waypoint model. We give both an intuitive and a formal explanation for
this phenomenon. We also propose a simple fix of the problem and discuss a
few alternatives. Our modified random
waypoint model is able to reach a steady state and simulation results are
presented."
}
@INPROCEEDINGS{Yosh0305:Theoretical,
AUTHOR="Hideki Yoshikawa",
TITLE="Theoretical analysis for bit error probability of Viterbi decoding over
binary symmetric channel",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, the exact analysis of bit error probability of 2- and
4-states Viterbi decoding over binary symmetric channel are demonstrated.
It is shown that the results are effective for low signal-to-noise power
ratio where bounds are useless.
Furthermore, the extension to 2-states soft decision decoding is
investigated."
}
@ARTICLE{Yosh0307:Shine,
AUTHOR="Sen Yoshida and Koji Kamei and Takeshi Ohguro and Kazuhiro Kuwabara",
TITLE="Shine: a peer-to-peer based framework of network community support systems",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=11,
PAGES="1199-1209",
MONTH=jul,
YEAR=2003,
REFERENCES=21,
KEYWORDS="Peer-to-peer; Personal agents; Network community; Software architecture;
Ubiquitous computing",
ABSTRACT="A discussion is presented on Shine, a framework of communication systems
that support network communities. Shine provides a unified structural
design approach to various network community support systems and enables
them to share software components and cooperate with each other.
Furthermore, Shine has a peer-to-peer architecture, which enables personal
agents to form communities suitable for each user by exchanging data in a
peer-to-peer style. These features of Shine are described and its
effectiveness as a framework is verified by applying it to several
systems.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-479VG0H-4-23\&\_cdi=5624\&\_orig=browse\&\_coverDate=07\%2F01\%2F2003\&\_sk=999739988\&view=c\&wchp=dGLbVtb-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=18136279057b3a26990093f77d93a472\&ie=f.pdf"
}
@INPROCEEDINGS{You0305:New,
AUTHOR="Tiantong You and Chi-Hsiang Yeh and Hossam Hassanein",
TITLE="A New Class of Collision - Prevention {MAC} Protocols for Ad Hoc Wireless
Networks",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we present a new class of collision free MAC protocol ¨C
CSMA/CP for ad hoc wireless networks, in which we use multi-channel
Binary-countdown-carrier-sense / Request-to-send (RTS) / Object-to-send
(OTS) / Agree-to-send (ATS) / Disagree-to-send (DTS) / Ensure-to-send
(ETS) / Neaten-to-send (NTS) (BROADEN) to achieve 100\% collision free
operation for both the control channel and the data channel. Furthermore,
this new protocol could solve °exposed terminal±, °hidden
terminal±, and °moving terminal± problems totally. It will also
decrease the bandwidth consumed per data packet sent and thus improve the
network's performance in decreasing the average delay of packet sending,
and increase the network's throughput significantly. It can enable
different packets with different priority to access the media and thus
gain the QoS."
}
@INPROCEEDINGS{Youn0305:Adaptive,
AUTHOR="Waleed Younis and Ali Sayed and Naofal Al-Dhahir",
TITLE="Adaptive Frequency-Domain Joint Equalization and Interference Cancellation
for Multi-User Space-Time Block-Coded Systems",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We develop an efficient adaptive receiver for joint equalization and
interference cancellation for multi-user space-time block-coded
transmissions. The receiver exploits the rich code structure and
allows multiple user transmissions over frequency-selective fading
channels
with reduced complexity and lower system overhead.
The adaptation scheme is based on a recursive least-squares
implementation
for faster convergence; nevertheless, it exploits the
code structure attain RLS performance at LMS complexity."
}
@INPROCEEDINGS{Youn0305:Load,
AUTHOR="Mohamed Younis and Gaurav Gupta",
TITLE="Load-Balanced Clustering in Wireless Sensor Networks",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Wireless sensor networks have potential to monitor environments for both
military and civil applications. Due to inhospitable conditions these
sensors are not always deployed uniformly in the area of interest. Since
sensors are generally constrained in on-board energy supply, efficient
management of the network is crucial to extend the life of the sensors.
Sensors energy cannot support long haul communication to reach a remote
command site and thus requires many levels of hops or a gateway to forward
the data on behalf of the sensor. In this paper we propose an algorithm to
network these sensors in to well define clusters with
less-energy-constrained gateway nodes acting as clusterheads, and balance
load among these gateways. Simulation results show how our approach can
balance the load and improve the lifetime of the system."
}
@INPROCEEDINGS{Yous0305:Real,
AUTHOR="Homayoun Yousefi'zadeh and Hamid Jafarkhani",
TITLE="Real-Time Error Recovery Utilizing Layered Media Multicast Control {(LMMC)}",
BOOKTITLE="ICC 2003 - Global Services and Infrastructure for Next Generation Networks",
ADDRESS="Anchorage, Alaska",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In the recent years layering techniques of distributing multimedia
traffic over multicast IP networks have received a growing attention.
The objective of such techniques is to effectively cope with the
challenges in continuous media applications such as heterogeneity,
fairness, real-time constraints, error control, and quality of service.
In this paper, we present an optimal solution to the problem of error
control in layered and replicated media systems satisfying real-time
constrains. In doing so, we rely on an apriori estimate of loss along
with a hybrid proactive FEC-ARQ scheme to statistically guarantee
the quality of service for receivers. Our optimal Layered Media Multicast
Control (LMMC) solution to a formulation of the error control problem
analytically determines the redundancy assignment of individual groups
associated with a layered media system minimizing a cost metric defined
over wasted bandwidth of redundancy."
}
@INPROCEEDINGS{Yous0305:Utilizing,
AUTHOR="Homayoun Yousefi'zadeh and Edmond Jonckheere and John Silvester",
TITLE="Utilizing Neural Networks to Reduce Packet Loss in Self-Similar Teletraffic
Patterns",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Reducing packet loss and increasing overall efficiency in multiple source
queuing systems is one of the most important issues in the design of
traffic control algorithms. On the contrary, the other important issue in
such systems is to provide every individual source with the ability to
take advantage of a fair portion of the shared available resources such as
buffer space or server bandwidth.
In this paper a novel technique for reducing packet loss in a class of
queuing systems with self-similar traffic patterns is introduced. The
technique takes advantage of the modeling power of neural networks to
offer a dynamic buffer management scheme capable of efficiently solving
the trade off between packet loss and fairness issues."
}
@INPROCEEDINGS{Yseb0305:Echo,
AUTHOR="Geert Ysebaert and Koen Vanbleu and Gert Cuypers and Marc Moonen and Jan
Verlinden",
TITLE="Echo cancellation for Discrete Multitone Frame-Asynchronous {ADSL}
Transceivers",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In the past, several papers have reported on echo canceler (EC) structures
developed for discrete multitone transmission (DMT) based asymmetric
digital subscriber lines (ADSL) transmission. The most commonly known
scheme, developed by Ho, Cioffi and Bingham, is based on canceling the
received echo noise efficiently in time as well as in the frequency
domain. The time domain processing part, which is commonly called Cyclic
Echo Synthesis (CES), can be minimized by choosing the optimal temporal
alignment between the echo transmitter and the EC in the modem. This
paper improves previously published work by minimizing the CES-complexity
without choosing a specific temporal alignment. Moreover, the obtained
structure is highly suitable for making the update process of the echo
canceler coefficients independent of the far end signal, leading to
improved convergence behavior."
}
@INPROCEEDINGS{Yu0305:Blind,
AUTHOR="Qian Yu and Gaonan Zhang and Guoan Bi",
TITLE="Blind Multipath Estimation with Toeplitz Displacement for Long Code
{DS-CDMA}",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper proposes a blind channel estimation scheme for
long code DS-CDMA systems with multipath fading channel. The Toeplitz
displacement method is used to remove the contribution of channel noise
and interferences before the correlation matching approach is adopted
to estimate the channel parameters. Simulation results show that the
proposed method has better MSE performance and more robust against
the near-far problem."
}
@INPROCEEDINGS{Yu0305:Progressive,
AUTHOR="Hong Yu and Xiaolong Yu",
TITLE="Progressive and scalable encryption for multimedia content access control",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Encryption is one of the most important security tools for secure message
communication. There is increasing need for secure digital multimedia
communication technologies to restrict unauthorized access. Prior to the
availability of variable bit rate (VBR) communication services, systems
typically treat every portion of a message equally and encrypt each and
every bit of a message that is decrypted at the same rate as encrypted.
Hence, encryption/decryption processes at both ends of the network were
required to operate at the same rate. The advent of VBR multimedia
communication services require new cryptography system implementations
that can operate at different data rates, i.e., be scaled to different
speed, different network bandwidth, and diverse receiver device
capabilities. In this paper, we describe a progressive and scalable
encryption scheme that supports scalability. One desirable feature of the
proposed scheme is its simplicity and flexibility in supporting scalable
multimedia communication and multimedia content access control."
}
@INPROCEEDINGS{Yue0305:Design,
AUTHOR="Guosen Yue and Xiaodong Wang and Krishna Narayanan",
TITLE="Design of Low Density Parity Check Codes for Turbo Multiuser Detection",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We consider the analysis and design of low density parity check (LDPC)
codes for multipath code-division multiple-access (CDMA) channels
with iterative soft interference cancellation (SIC) multiuser receiver. We
discuss techniques to compute the probability density function (pdf) of
the extrinsic information at the output of the multiuser
detector. We show that the output pdf can be modeled as symmetric
Gaussian for synchronous
CDMA in additive white Gaussian noise (AWGN) channel and as a mixture of
symmetric Gaussian densities for asynchronous CDMA system in fading
channel. The expectation-maximization (EM) algorithm can be used to
compute the parameters of this mixture. Using these
techniques, we are able to accurately compute the thresholds for
LDPC codes and design good irregular LDPC codes. Simulation results
are in good agreement with the computed thresholds and the
designed irregular LDPC codes outperform regular ones significantly"
}
@INPROCEEDINGS{Yuen0303:Exploiting,
AUTHOR="Wing Yuen and Roy Yates and Siun Mau",
TITLE="Exploiting Data Diversity and Multiuser Diversity in Noncooperative Mobile
Infostation Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="In wireless networks, it is often assumed that all
nodes cooperate to relay packets for each other. Although this is a
plausible model for military or mission based networks, it is
unrealistic for commercial networks and future pervasive computing
environments. We address the issue of noncooperation between nodes in
the context of content distribution in mobile infostation networks.
We assume all nodes have common interest in all files cached in the fixed
infostations. In addition to downloading files from the fixed
infostations, nodes act as mobile infostations and exchange files when
they are in proximity. We stipulate a social contract such that an
exchange occurs only when each node can obtain something it wants from
the exchange. Our social contract enables much higher system
efficiency compared to downloading from fixed infostations only while
not requiring true cooperation among nodes. We show by analysis and
simulations that network performance depends on the node density,
mobility and the number of files that are being disseminated. Our
results point to the existence of data diversity for mobile
infostation networks. The achievable throughput increases as the
number of files of interest to all users increases.
We have also extended the common interest model to the case
where nodes have dissimilar interests.
Our simulation results show that as mobile nodes change from having
identical interests to mutually exclusive interests, the network
performance degrades dramatically.
We propose an alternative user strategy when nodes have partially
overlapping interests and show that the network capacity can be
significantly improved by exploiting multiuser diversity inherent in
mobile
infostation networks.
We conclude that data diversity and multiuser diversity exist
in noncooperative mobile infostation networks and can be exploited."
}
@INPROCEEDINGS{Yuen0303:Noncooperative,
AUTHOR="Wing Yuen and Roy Yates and Siun-Chuon Mau",
TITLE="Noncooperative Content Distribution for Mobile Ad Hoc Networks",
BOOKTITLE="IEEE WCNC",
MONTH=mar,
YEAR=2003,
REFERENCES=9,
KEYWORDS="mobile infostation, ad hoc networks, content distribution, non-cooperative
nodes",
ABSTRACT="In wireless networks, it is often assumed that all
nodes cooperate to relay packets for each other. Although this is a
plausible model for military or mission based networks, it is
unrealistic for commercial networks and future pervasive computing
environments. We address the issue of noncooperation between nodes in
the context of content distribution in mobile infostation networks.
All nodes have common interest in all files cached in the fixed
infostations. In addition to downloading files from the fixed
infostations, nodes act as mobile infostations and exchange files when
they are in proximity. We stipulate a social contract such that an
exchange occurs only when each node can obtain something it wants from
the exchange.
We show by analysis and simulations that network performance depends
on node density, mobility and the number of files that are being
disseminated. Our results point to the existence of data diversity
for mobile infostation networks.
As the number of files of interest to all users increases,
the achievable throughput increases.
Moreover, each user has a more fair share of the total network
throughput.
In particular, when the number of files of shared interest is large,
the transmission of each channel is only limited by contention,
indicating the noncooperation strategy achieves near optimum resource
utilization."
}
@INPROCEEDINGS{Yuen03:Cross,
AUTHOR="Wing Yuen and Heung-No Lee and Timothy Andersen",
TITLE="A Cross Layer Networking System for Mobile Ad Hoc Networks",
BOOKTITLE="IEEE PIMRC",
YEAR=2003,
ABSTRACT="We propose a novel cross layer design concept that could
improve the network throughput significantly for mobile ad hoc networks.
The channel reservation control packets employed at the MAC
layer can be utilized at the physical layer in exchanging timely channel
estimation
information to enable an adaptive selection of a spectrally efficient
transmission rate.
In particular, the size of a digital constellation can be varied
dynamically based on the channel condition estimated at the receiver which
can be relayed
to the transmitter via the control packets.
In addition, this channel adaptive information gathered at the MAC layer
can be
communicated to the routing layer via different routing metrics for
optimal route selection.
We have examined the performance improvement at the network layer
due to cross layer communications.
For this, we present a simple cross layer design implemented with minor
modifications
on the IEEE 802.11 standard and the dynamic source routing (DSR) protocol.
We demonstrate that the network throughput is significantly increased, as
much as 50\\% to
100\\%, in low mobility scenarios simulated using {\it ns-2}."
}
@INPROCEEDINGS{Yuen03:Effect,
AUTHOR="Wing Yuen and Roy Yates and Chi Sung",
TITLE="Effect of Node Mobility on Highway Mobile Infostation Networks",
BOOKTITLE="ACM MSWIM",
YEAR=2003,
KEYWORDS="mobile infostation, ad hoc networks, mobility, highway networks",
ABSTRACT="In a mobile infostation network, any two nodes communicate when they
are in proximity. Under this transmission constraint, any pair
of nodes is intermittently connected as mobility shuffles the node
locations.
In this paper, we evaluate the effect of node mobility on highway mobile
infostation networks.
Each node enters a highway segment at a Poisson rate with a random speed
drawn from a known but arbitrary distribution.
Moreover, each node changes speed at each highway segment.
Since nodes have different speed, a node may overtake other nodes or
be overtaken as time evolves.
Using arguments from renewal reward theory, the long run fraction of
time an observer node is connected, and the long run average data rate
can be derived.
In this paper, however, we consider the special case of no speed change
in each highway segment.
In this case, the performance metrics are functions of the observer node
speed.
We consider both forward traffic scenarios, in which two
nodes moving in the same direction have a transient connection
when they are within range from each other, and
reverse traffic scenarios in which two nodes travelling in opposite
directions are connected transiently when they are in range.
For node speed that is uniformly distributed,
we reveal that the expected fraction of connection time, or expected
number of
connections in queuing terminology, is independent of the observer
node speed in reverse traffic.
In forward traffic, on the other hand, the fraction of connection time
increases with observer speed.
That is, the network performance improves with node mobility, which is
unique to the mobile infostation networking paradigm."
}
@INPROCEEDINGS{Yuen03:Inter,
AUTHOR="Wing Yuen and Roy Yates",
TITLE="Inter-relationships of Performance Metrics and System Parameters for Mobile
Ad Hoc Networks",
BOOKTITLE="IEEE International Military Communications Conference (MILCOM)",
ADDRESS="Boston, MA, USA",
YEAR=2003,
ABSTRACT="In this paper, the network behavior of a routing algorithm for
mobile ad hoc networks is investigated.
Extensive simulations are performed using {\em ns-2} in a variety of
mobility scenarios and offered load regimes.
In the literature, performance metrics (goodput, delay and path length)
are
often obtained through ensemble averaging of many flows.
Here we advocate an alternate graphical interpretation
of simulation results similar to that used by Holland and Vaidya.
Performance metrics of individual monitored flows are plotted
instead.
\%
By identifying the correlations between performance metrics and
system parameters, inter-relationships between them are revealed.
For example, we have shown that path length is dependent on system
parameters such as mobility, offered load and even the node
distribution.
These observations often give us insights to the mechanisms that underline
the network behavior.
In particular we have resolved a conjecture that goodput improvement
under high mobility is due to the load balancing effect.
We show that at high mobility, goodput improvement for heavy offered
load regimes is a consequence of the reduction of path length in the
flows.
Furthermore, we have introduced the concept of fraction of
congested flows as a new performance metric.
This and some other metrics such as fairness can be visualized from our
graphs and are important in characterizing network performance."
}
@INPROCEEDINGS{Yuen03:Network,
AUTHOR="Wing Yuen and Chi Sung",
TITLE="On Network Connectivity and Energy Efficiency of Mobile Ad Hoc Networks",
BOOKTITLE="IEEE ICDCS",
YEAR=2003,
KEYWORDS="Power control, transmit range, energy efficiency, ad hoc networks, multihop
networks, optimal range",
ABSTRACT="In mobile ad hoc networks, it is often more important to optimize for
energy efficiency than throughput.
In this paper, we investigate the effect of transmit range on
energy efficiency of packet transmissions.
We determine a common range for all nodes such that the average
energy expenditure per received packet is minimized.
In the first part of this paper, we consider stationary networks.
We show that energy efficiency depends on various system
parameters that includes path loss exponent of the channel,
energy dissipation model and network offered load.
In particular, when the path loss exponent is large, energy efficiency
decreases when the transmit range increases. Hence, the network should
be operated at the critical range that just maintains network
connectivity.
However, when the path loss exponent is small, operating at the critical
range yields inferior throughput and energy efficiency.
Our results show that energy efficiency is intimately connected to
network connectivity.
Three network connectivity regimes are identified as the transmit range of
all nodes increases.
In the second part, we examine the effect of node mobility on
energy efficiency. We show that at normal offered load, an optimal
transmit range exists such that energy efficiency is maximized.
The optimal range turns out to be insensitive to node mobility, and is
much larger than the critical range.
We show that the energy expenditure can be reduced by 15\% to 73\% in
different
mobility scenarios, if the network is operated at the optimal range."
}
@INPROCEEDINGS{Yuen03:Optimum,
AUTHOR="Wing Yuen and Roy Yates",
TITLE="Optimum Transmit Range and Capacity of Mobile Infostation Networks",
BOOKTITLE="Globecom 2003 - General Conference",
YEAR=2003,
ABSTRACT="A mobile infostation network
stipulates all transmissions to occur when nodes are in proximity.
In this paper, the effect of transmit range on the capacity
of four transmission strategies is studied.
We show that a stipulated transmit range improves the capacity compared
to the Grossglauser-Tse strategy with an unconstrained transmit range by
25\\%, and outperforms the non rate-adaptive strategy by 68\\%.
This indicates an optimal trade-off exists between spatial transmission
concurrency and spectral efficiency on individual links.
The optimal number of neighbors is invariant to node density, and is
between 0.6 to 1.2 for our transmission strategies.
This should be contrasted to a magic number of 6 to 8 neighbors
for multihop networks, where the expected forward progress per hop is
maximized.
This reflects the different optimization criteria of mobile infostation
and
multihop ad hoc networks.
In addition, the capacity per unit area increases
linearly with node density. This is counter-intuitive but
can be explained using a rescaling argument drawn from percolation theory."
}
@INPROCEEDINGS{Yuen03:Performance,
AUTHOR="Wing Yuen and Roy Yates and Chi Sung",
TITLE="Performance Evaluation of Highway Mobile Infostation Networks",
BOOKTITLE="Globecom 2003 - General Conference",
YEAR=2003,
KEYWORDS="mobile infostation, ad hoc networks, mobility, highway networks",
ABSTRACT="A mobile infostation network stipulates all transmissions to occur
when nodes are in proximity.
In this paper, we evaluate the effect of mobility on highway mobile
infostation networks.
Each node enters a highway segment at a Poisson rate with a constant speed
drawn from a known but arbitrary distribution.
Both forward and reverse traffic are considered.
For node speed that is uniformly distributed,
the expected fraction of connection time, or expected number of
connections in queueing terminology, is independent of observer node speed
for reverse traffic, while it increases with observer node speed
for forward traffic.
We also extend our mobility model such that each node changes speed
at each highway segment.
The long run fraction of connection time of an observer node is dependent
on the ratio
of transmit range and connection time limit.
Forward traffic connection yields better performance when the ratio is
small and vice versa.
We also compute the optimal transmit range and the corresponding
data rate for both traffic types.
We conclude that forward traffic connections yield much higher data
rate in most scenarios."
}
@ARTICLE{Yuen03:Summaries,
AUTHOR="Wing Yuen and Roy Yates",
TITLE="Summaries of MobiHoc 2003 posters: Optimum transmit range and capacity of
mobile infostation networks",
JOURNAL="Mobile Computing and Communications Review (MC2R)",
YEAR=2003,
ABSTRACT="A mobile infostation network
stipulates all transmissions to occur when nodes are in proximity.
In this paper, the effect of transmit range on the capacity
of four transmission strategies is studied.
We show that a stipulated transmit range improves the capacity relative
to the reference strategy with an unconstrained transmit range.
This indicates an optimal trade-off exists between spatial transmission
concurrency and spectral efficiency on individual links.
The optimal number of neighbors is invariant to node density, and is
between 0.6 to 1.2 for our transmission strategies.
This result should be contrasted to a magic number of 6 to 8 neighbors
for multihop networks, where the expected forward progress per hop is
maximized.
This reflects the different optimization criteria of mobile infostation
and
multihop ad hoc networks.
In addition, the capacity per unit area increases
linearly with node density. This is counter-intuitive but
can be explained using a rescaling argument drawn from percolation theory."
}
@INPROCEEDINGS{Yuks0305:Congestion,
AUTHOR="Murat Yuksel and Shivkumar Kalyanaram and Anuj Goel",
TITLE="Congestion Pricing Overlaid on Edge-to-Edge Congestion Control",
BOOKTITLE="ICC 2003 - Global Services and Infrastructure for Next Generation Networks",
ADDRESS="Anchorage, Alaska",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="One of the biggest obstacles for implementing congestion pricing is
the pricing time-scale. The Internet traffic is highly variant and
hard to control without a mechanism that operates on very low
time-scales, i.e. on the order of round-trip-times (RTTs). However,
pricing naturally operates on very large time-scales because of human
involvement. So, in order to put tight control on congestion through
pricing, new implementation methods and architectures are needed for
congestion pricing. In order to solve this problem, we propose a novel
approach Pricing over Congestion Control (POCC). The essence of POCC
is to overlay congestion pricing on top of an underlying congestion
control scheme which enforces a much tighter control than pricing.
This way congestion in the interior network is controlled very tightly,
while pricing is done at time-scales large enough to incorporate human
involvement. We investigate the problems raised within such an overlay
architecture and provide solutions to them. We particularly focus on
diff-serv and use edge-to-edge congestion control and edge-to-edge
pricing techniques to illustrate POCC ideas in simulation."
}
@ARTICLE{Yuks0308:Distributed,
AUTHOR="Murat Yuksel and Shivkumar Kalyanaraman",
TITLE="Distributed dynamic capacity contracting: an overlay congestion pricing
framework",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=13,
PAGES="1484-1503",
MONTH=aug,
YEAR=2003,
REFERENCES=30,
KEYWORDS="Congestion pricing; Differentiated-services; Distributed Dynamic Capacity
Contracting",
ABSTRACT="Several congestion pricing proposals have been made in the last decade.
Usually, however, those proposals studied optimal strategies and did not
focus on implementation issues. Our main contribution in this paper is to
address implementation issues for congestion-sensitive pricing over a
single differentiated-services (diff-serv) domain. We propose a new
congestion-sensitive pricing framework Distributed Dynamic Capacity
Contracting (Distributed-DCC), which is able to provide a range of
fairness (e.g. maxmin, proportional) in rate allocation by using pricing
as a tool. We develop a pricing scheme within the Distributed-DCC
framework and investigate several issues such as optimality of prices,
fairness of rate allocation.
We also introduce two pricing architectures based on the manner of using
pricing to control congestion: Pricing for Congestion Control (PFCC) and
Pricing over Congestion Control (POCC). PFCC uses pricing directly for
controlling congestion, whilst POCC uses an underlying edge-to-edge
congestion control mechanism by overlaying pricing on top of it. We, then,
adapt Distributed-DCC framework to these architectures, and evaluate the
two architectures by extensive simulation.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47X72N2-4-BC\&\_cdi=5624\&\_orig=browse\&\_coverDate=08\%2F15\%2F2003\&\_sk=999739986\&view=c\&wchp=dGLbVtz-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=cd22d8c770ef9d244416869f26ae2478\&ie=f.pdf"
}
@INPROCEEDINGS{Zahr0305:Analytical,
AUTHOR="Pavel Zahradnik and Miroslav Vlcek",
TITLE="Analytical Design of Optimal {FIR} Comb Filters",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Novel analytical design method for digital optimal equiripple FIR
comb filters is presented. The filters are optimal in Chebyshev
sense. The number of notch bands, the width of the notch bands and
the attenuation in the passbands can be specified. The degree
formula is presented. One example demonstrates the effectivity of
the filter design."
}
@ARTICLE{Zang0304:Path,
AUTHOR="Hui Zang and Canhui Ou and Biswanath Mukherjee",
TITLE="Path-Protection Routing and Wavelength Assignment {(RWA)} in {WDM} Mesh
Networks Under Duct-Layer Constraints",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=2,
PAGES="248-258",
MONTH=apr,
YEAR=2003,
REFERENCES=25,
KEYWORDS="integer linear program (ILP); lightpath; optical network; protection;
shared risk link group; wavelength routing; wavelength-division
multiplexing (WDM)",
ABSTRACT="This study investigates the problem of fault management in a
wavelength-division multiplexing (WDM)-based optical mesh network in which
failures occur due to fiber cuts. In reality, bundles of fibers often get
cut at the same time due to construction or destructive natural events,
such as earthquakes. Fibers laid down in the same duct have a significant
probability to fail at the same time. When path protection is employed, we
require the primary path and the backup path to be duct-disjoint, so that
the network is survivable under single-duct failures. Moreover, if two
primary paths go through any common duct, their backup paths cannot share
wavelengths on common links. This study addresses the routing and
wavelength-assignment problem in a network with path protection under
duct-layer constraints. Off-line algorithms for static traffic is
developed to combat single-duct failures. The objective is to minimize
total number of wavelengths used on all the links in the network. Both
integer linear programs and a heuristic algorithm are presented and their
performance is compared through numerical examples.",
URL="http://ieeexplore.ieee.org/iel5/90/26877/01194821.pdf?isNumber=26877\&prod=JNL\&arnumber=1194821\&arSt=+248\&ared=+258\&arAuthor=Hui+Zang\%3B+Ou\%2C+C.\%3B+Mukherjee\%2C+B."
}
@INPROCEEDINGS{Zeka0305:Spectral,
AUTHOR="Seyed Zekavat and Carl Nassar",
TITLE="Spectral Sharing in Multi-System Environments via Multi-Carrier {CDMA}",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this work, the authors introduce the concept of spectral sharing in
multi-system environments by application of MC-CDMA technology. The
proposed MC-CDMA system supports spectral sharing via dynamic carrier
allocation: the orthogonal carriers that make up a transmit signal are
borrowed/shared between multiple systems. The resulting system not
only supports increased spectral efficiency, but simulations indicate
improved BER performance as well. It is hoped that this exploration
(of how today's emerging multi-carrier multi-access technology enable
spectral exchange) will serve as a useful beginning in the emergence of
a highly efficient spectral exchange."
}
@INPROCEEDINGS{Zels0305:Per,
AUTHOR="Allert {van Zelst}",
TITLE="Per-Antenna-Coded Schemes for {MIMO} {OFDM}",
BOOKTITLE="International Conference on Communications",
ADDRESS="Anchorage, Alaska",
MONTH=may,
YEAR=2003,
ABSTRACT="Two Per-Antenna-Coding (PAC) receiver schemes for Multiple-Input
Multiple-Output (MIMO) Orthogonal Frequency Division Multiplexing (OFDM)
are described and compared in this paper. In MIMO, the data to transmit
are multiplexed onto different antennas. With PAC (sometimes called
horizontal coding), these different data streams are encoded separately.
For the receiver, two schemes are proposed to detect and decode the PAC
transmission. One is based on Soft-decision Output Maximum Likelihood
Detection (SOMLD), the other on V-BLAST. When forward error correcting
decoding is included in the Successive Interference Cancellation loops of
V-BLAST, its performance is shown to be comparable with that of SOMLD."
}
@INPROCEEDINGS{Zeme0305:Iterative,
AUTHOR="Thomas Zemen and Joachim Wehinger and Christoph {Mecklenbräuker} and Ralf
Mueller",
TITLE="Iterative Detection and Channel Estimation for {MC-CDMA}",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Multi-carrier code division multiple access (MC-CDMA) systems are under
intense investigation for high bit rate wireless communication systems.
Their equalization is based on the fast Fourier transform, allowing for an
efficient implementation. Iterative receivers with joint detection and
decoding have been shown to achieve very good performance for direct
sequence (DS)-CDMA systems. We apply this concept to MC-CDMA, the
multiuser detector is implemented as parallel interference canceller with
post-minimum mean squared error filtering. In this contribution a new
pilot based channel estimation scheme based on random time domain
sequences is developed. The presented simulation results for a multi path
scenario show, that in a fully loaded system with 64 users the single user
bound can be approached up to 1 dB. A bit error rate (BER) of 10^-3 is
reached already at an E\_b/N\_0 of 12 dB with a 4 state, rate 1/2
convolutional code."
}
@INPROCEEDINGS{Zeng0305:Enhanced,
AUTHOR="Jingdi Zeng and Nirwan Ansari",
TITLE="An Enhanced Dropping Scheme for Proportional Differentiated Services",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT={As the DiffServ architecture is gaining ground, traffic engineering
requires major adjustments. In addition, the measurement-based strategy
shows the advantages of flexibility and easy adaptation. This article
reviews measurement-based dropping schemes. Based on the definition and
investigation of a {"}packet shortage{"} phenomenon, an enhanced dropping
scheme for proportional differentiated packet loss, referred to as
{"}debt-aware,{"} is proposed. Simulation results show that the scheme
partially curbs negative effects of {"}packet shortage{"} and closely
approximates loss differentiation parameters, as compared to a typical
proportional dropping mechanism. More simulations have been applied to
demonstrate the merits of this improved method.}
}
@INPROCEEDINGS{Zhan0303:Small,
AUTHOR="Zhi-Li Zhang and Vinay Ribeiro and Sue Moon and Christophe Diot",
TITLE="Small-Time Scaling Beahviors of Internet Backbone Traffic: An Empirical
Study",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="We study the {\em small-time} (sub-seconds) scaling behaviors of Internet
backbone traffic, based on traces collected from OC3/12/48 links in a
tier-1 ISP.
We observe that for a majority of these traces, the (second-order)
scaling exponents at small time scales (1ms - 100ms) are fairly
close to 0.5, indicating that {\em traffic fluctuations} at
these time scales are (nearly) uncorrelated.
In addition, the traces manifest mostly {\em monofractal} behaviors
at small time scales. The objective of the paper is to understand the
potential
causes or factors that influence the small-time scalings of Internet
backbone traffic
via empirical data analysis. We analyze the traffic composition of the
traces along two dimensions -- flow size and flow density.
Our study uncovers {\em dense} flows (i.e., flows
with bursts of densely clustered packets) as the correlation-causing
factor in
small time scales, and reveals that the traffic composition in terms of
proportions
of {\em dense vs. sparse} flows plays a major role in influencing the
small-time
scalings of aggregate traffic."
}
@ARTICLE{Zhan0305:Analysis,
AUTHOR="Zhe Zhang and Naishuo Tian",
TITLE="Analysis on queueing systems with synchronous vacations of partial servers",
JOURNAL="Performance Evaluation",
VOLUME=52,
NUMBER=4,
PAGES="269-282",
MONTH=may,
YEAR=2003,
REFERENCES=13,
KEYWORDS="M/M/c queue; Vacation model; Quasi-birth and death process; Matrix
geometric solutions; Stochastic decomposition",
ABSTRACT="We study an M/M/c queue with server vacations. In this queueing system, d
(\≤c) of c servers take synchronous vacations when these d servers
become idle at a service completion instant. This type of queueing model
captures the major characteristics of a stochastic service system which
processes both random arriving jobs and constantly available jobs. In this
paper, the multi-server vacation queueing system has been analyzed as a
quasi-birth and death process. Using matrix geometric method, we obtain
the stationary distributions of queue length and waiting time and
demonstrate the conditional stochastic decomposition property of the queue
length and waiting time in this system.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-47PPDSM-1-67\&\_cdi=5663\&\_orig=browse\&\_coverDate=05\%2F31\%2F2003\&\_sk=999479995\&view=c\&wchp=dGLbVlz-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=2fb6c735466fb91d2bf4bc3337e560bc\&ie=f.pdf"
}
@INPROCEEDINGS{Zhan0305:Blind,
AUTHOR="Yongpeng Zhang and Ruifeng Zhang",
TITLE="Blind {MMSE} Combining for {RAKE} Receivers",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="A blind MMSE multipath combining method for RAKE receiver
in long-code CDMA systems is proposed. The method uses the
data before and after the onset of the desired user's
transmission. It shows that the generalized eigendecomposition
of the autocorrelation matrices of the post-RAKE signals in
these two interval gives an MMSE combiner for the desired
user signal, without the need of the channel state information.
The method does not require precise models of the interference
but still offers similar performance as that of the optimal
RAKE combiner or even better under certain circumstances.
An adaptive algorithm is also developed."
}
@INPROCEEDINGS{Zhan0305:Bluetooth,
AUTHOR="Honghai Zhang and Jennifer Hou and Lui Sha",
TITLE="A Bluetooth Loop Scatternet Formation Algorithm",
BOOKTITLE="ICC 2003 - Personal Communication Systems and Wireless LANs",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Bluetooth is a promising new wireless technology that enables portable
devices to form short-range wireless ad hoc networks. In this paper, we
present a new, distributed Bluetooth scatternet formation algorithm,
called {\em loop scatternet formation}, that forms scatternets^M
with slave/slave bridges only. In addition to meeting the criteria of
maintaining connectivity, minimizing the number of piconets
and the maximum degree of devices, the proposed algorithm
formalizes the notion of network diameter and node contention. The
loop scatternet thus formed incurs a much smaller network diameter and the
number of node pairs for which a device has to serve as a relay node is
significantly smaller than that in the other types of scatternets. To
validate the design, we derive the bounds of the number of
piconets, the network diameter, and the maximum node contention. We also
conduct ns-2 simulation to evaluate the performance of loop scatternets.
Both analytical and simulation results validate the desirable features of
loop scatternets."
}
@INPROCEEDINGS{Zhan0305:Clustered,
AUTHOR="Hua Zhang",
TITLE="Clustered {OFDM} with Adaptive Antenna for Interference Suppression",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we investigate clustered OFDM with adaptive
antenna arrays for interference suppression. To calculate weights
for interference suppression, instantaneous correlation of the
received signals and channel response corresponding to the desired
signals have to be estimated. However, due to smaller size of each
cluster for clustered OFDM than for classical OFDM, the DFT-based
estimation has large leakage and therefore results in severe
performance degradation. In this paper, polynomial-based
parameters estimator is proposed to combat the severe leakage of
the DFT-based estimator. We study impact of the polynomial order
and window size on the estimation error. The approximately optimal
window size for polynomial estimator is obtained and an adaptive
algorithm for local optimal window size is developed. With the
adaptive algorithm, the polynomial-based estimator has no leakage
and does not require the statistics of the channel, hence it has
much better performance than the DFT-based estimator. Simulation
results show the developed algorithm improves the performance
significantly. For moderate SNR and SIR under practical channel
conditions, there is about 3-10 dB improvement in NMSE."
}
@INPROCEEDINGS{Zhan0305:Effective,
AUTHOR="Yiming Zhang and Oliver Yang",
TITLE="An effective approach to the connection routing problem of all-optical
wavelength routing {DWDM} networks with wavelength conversion capability",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The emergence of DWDM (Dense Wavelength-Division Multiplexing) technology
has provided the network designer great convenience in constructing a
wavelength routing optical network. In this paper, we study the problem
of routing and wavelength assignment (RWA) in an all-optical DWDM network.
We formulated the problem into a constrained integer linear problem (ILP)
and the objective is to minimize the overall cost of the routing scheme
over the DWDM network. Considering the complexity of the RWA problem, a
decomposition approach using Lagrangean relaxation is proposed to simplify
the solution procedure. The overall problem is decomposed into
semi-lightpath level subproblems for the wavelength and rout selection
from source to destination. The multipliers are then updated at the high
level. To optimize the dual function, subgradient approach is used. Also,
a heuristic algorithm is proposed to generate a feasible RWA scheme based
on the dual solution. The performance evaluation for the optimization
result of one network example indicates that the algorithm we used can
achieve very good (near-optimum) solution, and the influence from the
changing of the number of resources is also studied."
}
@INPROCEEDINGS{Zhan0305:Efficient,
AUTHOR="Jihui Zhang and Bo Li and Jiangchuan Liu and Qian Zhang and Wenwu Zhu and
Ya-Qin Zhang",
TITLE="An Efficient Algorithm for Adaptive Cell Sectoring in {CDMA} Systems",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Abstract - Cell Sectorization is a promising method to improve the capacity
in code division multiple access (CDMA) systems. It has been shown that the
use of adaptive antenna arrays with dynamic cell sectoring is particularly
suitable for non-uniformly distributed users. In this paper, we present a
novel Cluster-based Sectoring algorithm for adaptive cell sectorization.
The complexity of our algorithm is much lower than conventional optimal
sectoring algorithms, and more important, in high-density case, it does
not depend on the number of users in a cell. Extensive simulations show
that the performance of our solution is comparable to the optimal
solutions."
}
@INPROCEEDINGS{Zhan0305:Group,
AUTHOR="Xincheng Zhang and Simon Lam and Dong-Young Lee",
TITLE="Group Rekeying with Limited Unicast Recovery",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In secure group communications, a key server can deliver a
``group-oriented'' rekey message[WGL98] to a large number of users
efficiently using IP multicast. For reliable delivery, Keystone[WL00]
proposed the use of forward error correction (FEC) in an initial
multicast, followed by the use of unicast delivery for users that cannot
recover their new keys from the multicast. In this paper, we investigate
how to limit unicast recovery to a small fraction r of the user
population. By specifying a very small r, almost all users in the group
will receive their new keys within a single multicast round.
We present analytic models for deriving r as a function of the amount of
FEC redundant information (denoted by h) and the rekeying interval
duration (denoted by T) for both Bernoulli and two-state Markov Chain loss
models. From our analyses, we conclude that r decreases exponentially as h
increases. We then present a protocol designed to adaptively adjust (h, T)
to achieve a specified r. In particular, our protocol chooses from among
all feasible (h, T) pairs one with h and T values close to their feasible
minima. Our protocol also adapts to an increase in network traffic.
Simulation results using ns-2 show that with network congestion our
adaptive FEC protocol can still achieve a specified r by adjusting values
of h and T."
}
@INPROCEEDINGS{Zhan0305:Methods,
AUTHOR="Qinqing Zhang",
TITLE="Methods for Preventing Protocol Stalling in {UMTS} Radio Link Control",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The Radio Link Control (RLC) for Universal Mobile Telecommunication Systems
(UMTS) is an acknowledgement based retransmission protocol. Protocol
stalling and deadlock might happen under certain circumstances and thus
reduce the system efficiency. In this paper, we propose and investigate
three alternative mechanisms with spontaneous retransmissions to prevent
protocol stalling. We compare the performance of the three approaches with
simulation results. Our results indicate that all three methods can
prevent protocol stalling quite effectively. In addition, the combined
retransmission of the last or the earliest transmitted packet has the best
throughput and delay performance and outperforms the other two methods."
}
@INPROCEEDINGS{Zhan0305:Multicast,
AUTHOR="Zhenghao Zhang and Yuanyuan Yang",
TITLE="Multicast Scheduling in {WDM} Switching Networks",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Optical WDM networks are attracting more and more attentions because
of its huge bandwidth to meet the ever increasing demand of modern
networking applications. In this paper we study supporting multicast
in WDM switching networks. Multicast is the operation to send
information from one source to multiple destinations. In WDM switching
networks, contention occurs when one output fiber is the destinations
of more than $k$ inputs, where $k$ is the number of wavelengths on each
fiber. In this paper, we study scheduling algorithms which can select
a group of multicast connection requests that are contention-free. We
first prove that the problem of scheduling the maximum number of such
connection requests through the network simultaneously is NP-hard. On
the other hand, lack of optical buffers in WDM switching
networks requires a very fast scheduling algorithm. We then turn to
develop approximationscheduling algorithms that can provide sub-optimal
solutions. We present four polynomial approximation scheduling
algorithms and study their performance through simulations. We also
discuss their performance ratio to the optimal algorithm. Our results
demonstrate that one of the simple algorithms (the fastest one) yields
throughput close to other three more complex algorithms, thus could be
a good candidate for multicast scheduling in WDM switching networks."
}
@INPROCEEDINGS{Zhan0305:New,
AUTHOR="Jing Zhang and Keyao Zhu and Hui Zang and Biswanath Mukherjee",
TITLE="A New Provisioning Framework to Provide Availability-Guaranteed Service in
{WDM} Mesh Networks",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="It is well known that WDM mesh networks are more scalable and more resource
efficient than ring networks because they can provide differentiated
protection services. However, service reliability is one of the customers'
main concerns and should be carefully considered in WDM mesh networks.
Service reliability is defined in the Service Level Agreement (SLA)
between the service provider and the customer, and is typically
represented by connection availability. In this paper, we present a
connection-provisioning framework to satisfy customers' availability
requirements using appropriate protection schemes. The framework contains
two parts: (a) WDM mesh network service availability analysis; and (b) a
connection-provisioning approach using the analysis. We present the
availability analysis for connections with different protection schemes
(i.e., unprotected, dedicated, or shared
protected) and propose an integer linear program (LIP) based provisioning
approach for static traffic. Our approach can provide appropriate level of
protection to each connection if needed. We verify the theoretical
availability analysis through simulations, and demonstrate the
effectiveness of our provisioning approach using numerical examples."
}
@INPROCEEDINGS{Zhan0305:New,
AUTHOR="Jian Zhang",
TITLE="New results on the Capacity of M-ary {PPM} Ultra- WideBand Systems",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT={In this paper, some new results on the capacity of a typical
M-ary pulse position modulation (M-PPM) time hopping (TH)
Ultra- Wideband (UWB) system are presented. Previous results using
a {"}pure PPM model{"} are proven to exaggerate the real capacity of
a UWB system. Based on an extended model containing correlator and
soft decision decoding, the capacity is evaluated in the
single-user case and in the case of a system with asynchronous
multiple user interference (MUI) when the inputs are equiprobable.
It is found that only when bit- signal-to-noise ratio (bit-SNR) is
high enough, larger M leads to higher capacity; and for a
specific M, the optimal values of PPM time offset parameter
T\_d, which maximize the capacity, are independent of bit-SNR.
The influence of MUI on capacity is detrimental, especially in the
case of high bit-SNR.}
}
@INPROCEEDINGS{Zhan0305:Optimum,
AUTHOR="Hua Zhang",
TITLE="Optimum Frequency-Domain Partial Response Encoding",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Time-variance of wireless channels destroys the orthogonality among
subchannels in OFDM system and causes the inter-channel interference
(ICI), which results in an error floor. In this paper, we study
frequency-domain partial response coding (PRC) for reducing the effect of
the ICI. Based on the general expression of the ICI power for OFDM with
PRC, the optimum weights for PRC that minimize the ICI power is derived.
From numerical and simulation results, optimum PRC for OFDM can reduce the
ICI effectively by 4.0 dB for 2-tap PRC and 6.2 dB for 3-tap PRC,
respectively"
}
@INPROCEEDINGS{Zhan0305:Performance,
AUTHOR="Jian Zhang",
TITLE="Performance of Ultra- Wideband Correlator Receiver Using Gaussian
Monocycles",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper investigates the performance of Ultra- Wideband (UWB) correlator
receivers for Gaussian monocycles in the condition of equal mean power and
provides constructive reference to the selection of
pulses. Several channel situations are examined including ideal
single user AWGN channel, non-ideal synchronous, multipath fading
and multiple access interference. Both numerical and analytical
techniques show that the shape of pulses have notable impact on
the performance of correlator receivers, especially on the
interference resistance ability and signal-to-noise ratio (SNR) of
the output. The results are also extended to the field of
fractional bandwidth to comprehend possible relationship between
fractional bandwidth and correlator receivers."
}
@INPROCEEDINGS{Zhan0305:Performance,
AUTHOR="Xinyan Zhang and Gang Song and Qian Zhang and Wenwu Zhu and Zhensheng Zhang",
TITLE="Performance Analysis in Unstructured Overlays",
BOOKTITLE="ICC 2003 - Next Generation Internet",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we propose a performance analysis model to study the
reachibility in unstructured overlay networks. Given a node¯s degree
distribution and a network size, n, the model describes the flooding query
pattern in a P2P network accurately. Also, we prove that, in such an
overlay network, the average distance between any two hosts is limited by
O(log n). This model is simple and accrute, and therefore is a very useful
tool in exploring many properties of massive overlay networks. It can be
applied to P2P based content distribution networks and ad hoc wireless
networks, for example."
}
@INPROCEEDINGS{Zhan0305:Practical,
AUTHOR="Zhao-yang Zhang and Lai Lifeng",
TITLE="A Practical Slotted Quasi-Synchronous {CDMA} Access System for {LEO}
Micro-Satellite Short Message Transmission",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="A system to provide non-realtime short message transmission service to a
wide-area of users via Low Earth Orbit (LEO) micro-satellite is developed
. To increase the system capacity, a novel and efficient slotted
quasi-synchronous CDMA access protocol is specially designed for the LEO
satellite channel in which exists serious Doppler shift and propagation
delay variation. Before each message burst transmission, the user will
randomly choose an access slot to send a short request to satellite and
listen to the echo from the satellite. The channel delay and Doppler shift
are then estimated from the echo and compensated in the immediate following
message transmission slot to achieve quasi- synchronization between all
user message bursts. The short request also acts as a reservation
indicator, which prevents other users to use the immediate following
message slot as access slots. The system throughput is analyzed by
exploring the capture effects of the quasi-synchronous message bursts and
the asynchronous request bursts, respectively, which shows a better
performance in comparison with conventional slotted spectrum-spread
multiple access systems. Transceiver requirements and implementation
considerations are discussed, and the prototype is also described."
}
@INPROCEEDINGS{Zhan0305:Stateless,
AUTHOR="Baoxian Zhang and Hussein Mouftah",
TITLE="A Stateless QoS Routing Algorithm Subject to Multiple Constraints",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="One of the key issues in QoS provisioning in high-speed networks is how to
determine a feasible route that satisfies the given QoS requirements while
efficiently utilizing network resources. In this paper, we study the
NP-Complete problem of path selection subject to multiple constraints and
propose a heuristic solution, which essentially divides an entire QoS-path
into at most two °superedges?that is connected by a °relay node? This
property makes the heuristic be able to support stateless forwarding, i.e.,
no flow-specific state information is required to be maintained at
intermediate nodes on a QoS-path, which can significantly improve the
scalability of a QoS routing protocol. Its computational complexity is
deduced to be O(m|V|**2), where m, a very small integer, is the number of
the concerned QoS metrics and |V| is the number of nodes in a network. In
particular, if the heuristic is executed online, its computational
complexity can be further reduced to O(|V|m**2), which makes it scale well
with the number of requests. To the best of our knowledge, this is the
fastest heuristic ever reported to cope with the NP-Complete problem of
route selection subjects to multi-constraints. Simulation results show
that the heuristic can achieve near optimal performance."
}
@INPROCEEDINGS{Zhan0305:Symmetric,
AUTHOR="Xiaoxia Zhang and Michael Fitz",
TITLE="Symmetric Information Rate for Continuous Phase Channel and {BLAST}
Architecture with {CPM} {MIMO} System",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="How to calculate the symmetric information rate (SIR) for continuous phase
channels is given. This problem has traditionally been viewed highly
complicated due to nonlinearity of the modulation. Through the simulated
SIR it can be observed that using continuous phase modulation (CPM) in a
multiple antenna (MIMO) system will likely produce both high performance
and high throughput. As the optimum CPM MIMO demodulation has a
significant complexity, the BLAST architecture is applied and simulation
results are provided."
}
@INPROCEEDINGS{Zhan0306:Borg,
AUTHOR="Rongmei Zhang and Y. Charlie Hu",
TITLE="Borg: a Hybrid Protocol for Scalable Application-level Multicast in
Peer-to-Peer Networks",
BOOKTITLE="ACM NOSSDAV 2003",
ADDRESS="Monterey, California, USC",
DAYS=1,
MONTH=jun,
YEAR=2003,
ABSTRACT="Multicast avoids sending repeated packets over the same network links
and thus offers the promise of supporting multimedia streaming over
wide-area networks. Previously, two opposite multicast schemes --
forward-path forwarding and reverse-path forwarding -- have been
proposed on top of structured peer-to-peer (p2p) overlay networks.
This paper presents Borg, a new scalable application-level multicast
system built on top of p2p overlay networks. Borg is a hybrid protocol
that exploits the asymmetry in p2p routing and leverages the
reverse-path multicast scheme for its low link stress on the physical
networks. Borg has been implemented on top of Pastry, a generic,
structured p2p routing substrate. Simulation results based on a
realistic network topology model shows that Borg induces significantly
lower routing delay penalty than both forward-path and reverse-path
multicast schemes while retaining the low link stress of the
reverse-path multicast scheme."
}
@ARTICLE{Zhan0306:Delay,
AUTHOR="Xi Zhang and Kang Shin",
TITLE="Delay Analysis of Feedback-Synchronization Signaling for Multicast Flow
Control",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=3,
PAGES="436-450",
MONTH=jun,
YEAR=2003,
REFERENCES=19,
KEYWORDS="feedback roundtrip time (RTT); feedback-synchronization signaling;
multicast flow control; soft-synchronization protocol (SSP)",
ABSTRACT="Feedback signaling plays a key role in flow control because the traffic
source relies on the signaling information to make correct and timely
flow-control decisions. Design of an efficient signaling algorithm is a
challenging task since the signaling messages can tolerate neither error
nor latency. Multicast flow-control signaling imposes two additional
challenges: scalability and feedback synchronization. Previous research on
multicast feedback-synchronization signaling has mainly focused on
algorithm design and implementation. However, the delay properties of
these algorithms are, despite their vital importance, neither well
understood nor thoroughly studied. We develop both deterministic and
statistical binary-tree models to study the delay performance of the
multicast signaling algorithms. The deterministic model is used to derive
the expressions of each path's feedback roundtrip time in a multicast
tree, while the statistical model is employed to derive the general
probability distributions of each path becoming the multicast-tree
bottleneck. Using these models, we analyze and contrast the signaling
delay scalability of two representative multicast signaling protocols -
the soft-synchronization protocol (SSP) and the hop-by-hop (HBH) scheme -
by deriving the first and second moments of multicast signaling delays.
Also derived is the optimal flow-control update interval for SSP to
minimize the multicast signaling delay.",
URL="http://ieeexplore.ieee.org/iel5/90/27187/01208304.pdf?isNumber=27187\&prod=JNL\&arnumber=1208304\&arSt=+436\&ared=+450\&arAuthor=Xi+Zhang\%3B+Shin\%2C+K.G."
}
@INPROCEEDINGS{Zhan0306:Improving,
AUTHOR="Chi Zhang",
TITLE="Improving {TCP} Smoothness by Synchronized and Measurement-based Congestion
Avoidance",
BOOKTITLE="ACM NOSSDAV 2003",
ADDRESS="Monterey, California, USC",
DAYS=1,
MONTH=jun,
YEAR=2003,
ABSTRACT="In this paper, we observe that although multiplicative decrease is
necessary to accomplish fairness, it does not necessarily sacrifice system
throughput, as long as the system operates between the knee and the cliff
according to an equation. However, even when the system throughput is
relatively stable, end users do not experience a smooth traffic, mainly
due to the unsynchronized window adjustments. Therefore, we propose an
experimental congestion avoidance mechanism to improve the TCP smoothness
for real-time applications. The mechanism relies on a fine-grained RTT
estimation to measure the network condition, and coordinates the upward
and backward window adjustments to abolish the damage of unsynchronized
window adjustments. Congestive packet drops can also be reduced by the new
control parameter g. Our results verify that the new mechanism enhance
significantly the smoothness and fairness, without a cost of
responsiveness. In fact, by enabling on a new parameter Delta, the
responsiveness can be even enhanced when the bandwidth is under-utilized."
}
@ARTICLE{Zhan0309:Algorithms,
AUTHOR="Baoxian Zhang and Marwan Krunz",
TITLE="Algorithms and protocols for stateless constrained-based routing",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=14,
PAGES="1570-1580",
MONTH=sep,
YEAR=2003,
REFERENCES=39,
KEYWORDS="QoS routing; Delay-constrained path selection; Stateless routing",
ABSTRACT="Quality of service (QoS) routing has generally been addressed in the
context of reservation-based network services (e.g. ATM, IntServ), which
require explicit (out of band) signaling of reservation requests and
maintenance of per-flow state information. It has been recognized that the
processing of per-flow state information poses scalability problems,
especially at core routers. To remedy this situation, in this paper we
introduce an approach for stateless QoS routing in IP networks that
assumes no support for signaling or reservation from the network. Instead,
our approach makes use of the currently unused two bits in the DiffServ
(DS) byte of the IP packet header. Simple heuristics are used to identify
a low-cost delay-constrained path. These heuristics essentially divide the
end-to-end path into at most two superedges that are connected by a relay
node. Routers that lie on the same superedge use either the cost metric or
the delay metric (but not both) to forward the packet. Standard hop-by-hop
forwarding is performed with respect to either metric. Two different
approaches are presented for implementing the relay-based forwarding. In
the first approach, a probing protocol is used to identify the relay node
and the routing metrics of the superedges. Tunneling and packet
encapsulation are then used to forward packets from the source node to the
relay node and then from the relay node to the destination node. The second
approach does not require probing, but instead relies on the time-to-live
(TTL) field in the header of the IP packet. Simulations are presented to
evaluate the cost performance of the various approaches.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-47C3S2K-1-3V\&\_cdi=5624\&\_orig=browse\&\_coverDate=09\%2F01\%2F2003\&\_sk=999739985\&view=c\&wchp=dGLbVtz-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=e4484f4bc9bdb0619f56efad909bd767\&ie=f.pdf"
}
@INPROCEEDINGS{Zhan0309:Cross,
AUTHOR="Yuecheng Zhang and Liang Cheng",
TITLE="Cross-Layer Optimization for Sensor Networks",
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="AbstractªIn this paper, we study the application oriented cross-layer
protocol design and optimization. The goal of the study is to provide a
feasible and flexible approach to solve the conflicts between the
requirements of large scale, long life-time, and multi-purpose wireless
sensor networks and the constraints of small bandwidth, low battery
capacity, and limited node resources. We justify that the cross-layer
optimization is a promising solution and sometime is critical to enable
wireless sensor network applications."
}
@ARTICLE{Zhan0312:Protocol,
AUTHOR="X. Zhang and Simon Lam and Dong-Young Lee and Y. Yang",
TITLE="Protocol Design for Scalable and Reliable Group Rekeying",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=6,
PAGES="908-922",
MONTH=dec,
YEAR=2003,
REFERENCES=30,
KEYWORDS="adaptive FEC; group key management; proactive FEC; reliable multicast;
secure multicast",
ABSTRACT="We present the design and specification of a protocol for scalable and
reliable group rekeying together with performance evaluation results. The
protocol is based upon the use of key trees for secure groups and periodic
batch rekeying. At the beginning of each rekey interval, the key server
sends a rekey message to all users consisting of encrypted new keys
(encryptions, in short) carried in a sequence of packets. We present a
scheme for identifying keys, encryptions, and users, and a key assignment
algorithm that ensures that the encryptions needed by a user are in the
same packet. Our protocol provides reliable delivery of new keys to all
users eventually. It also attempts to deliver new keys to all users with a
high probability by the end of the rekey interval. For each rekey message,
the protocol runs in two steps: a multicast step followed by a unicast
step. Proactive forward error correction (FEC) multicast is used to reduce
delivery latency. Our experiments show that a small FEC block size can be
used to reduce encoding time at the server without increasing server
bandwidth overhead. Early transition to unicast, after at most two
multicast rounds, further reduces the worst-case delivery latency as well
as user bandwidth requirement. The key server adaptively adjusts the
proactivity factor based upon past feedback information; our experiments
show that the number of NACKs after a multicast round can be effectively
controlled around a target number. Throughout the protocol design, we
strive to minimize processing and bandwidth requirements for both the key
server and users.",
URL="http://ieeexplore.ieee.org/iel5/90/28078/01255429.pdf?isNumber=28078\&prod=JNL\&arnumber=1255429\&arSt=+908\&ared=+922\&arAuthor=Zhang\%2C+X.B.\%3B+Lam\%2C+S.S.\%3B+Dong-Young+Lee\%3B+Yang\%2C+Y.R."
}
@ARTICLE{Zhan03:Fuzzy,
AUTHOR="Runtong Zhang and Yannis Phillis and Jian Ma",
TITLE="A fuzzy approach to the balance of drops and delay priorities in
differentiated services networks",
JOURNAL="IEEE Transaction on Fuzzy Systems",
YEAR=2003,
ABSTRACT="Two of the objectives of Internet are to increase network capacity and
offer high quality of differentiated services for traffic with real-time
and non-real-time requirements. Differentiated services (Diff-Serv) were
established to fulfill such objectives. Up until now several Diff-Serv
schemes have been proposed which, among others, handle drop and delay
priorities. These two priorities raise important optimization issues for
the Internet but their relationship remains an open problem. This paper
presents a fuzzy control algorithm to select packets in a fair and
efficient manner. Simulation shows that the fuzzy controller is better
than a crisp one when the fairness issue is raised."
}
@ARTICLE{Zhao0302:Multiqueue,
AUTHOR="Qing Zhao and Lang Tong",
TITLE="A Multiqueue Service Room {MAC} Protocol for Wireless Networks With
Multipacket Reception",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=1,
PAGES="125-137",
MONTH=feb,
YEAR=2003,
REFERENCES=28,
KEYWORDS="medium-access control (MAC); multipacket reception (MPR); random-access
network",
ABSTRACT="An adaptive medium-access control (MAC) protocol for heterogeneous networks
with finite populations is proposed. Referred to as the multiqueue service
room (MQSR) protocol, this scheme is capable of handling users with
different quality-of-service (QoS) constraints. By exploiting the
multipacket reception (MPR) capability, the MQSR protocol adaptively
grants access to the MPR channel to a number of users such that the
expected number of successfully received packets is maximized in each
slot. The optimal access protocol avoids unnecessary empty slots for light
traffic and excessive collisions for heavy traffic. It has superior
throughput and delay performance as compared to, for example, the slotted
ALOHA with optimal retransmission probability. This protocol can be
applied to random-access networks with multimedia traffic.",
URL="http://ieeexplore.ieee.org/iel5/90/26510/01180550.pdf?isNumber=26510\&prod=JNL\&arnumber=1180550\&arSt=+125\&ared=+137\&arAuthor=Qing+Zhao\%3B+Tong\%2C+L."
}
@ARTICLE{Zhao0304:End,
AUTHOR="Jian Zhao and Hossam Hassanein and Jieyi Wu and Guanqun Gu",
TITLE="End-to-end QoS routing framework for differentiated services networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=6,
PAGES="566-578",
MONTH=apr,
YEAR=2003,
REFERENCES=23,
KEYWORDS="Differentiated services; QoS routing; SiMO routing framework; Bandwidth
coupling delay computation; Leaky bucket; Weighted fair queuing;
End-to-end path delay",
ABSTRACT="Differentiated services (DiffServ) is the latest model proposed by Internet
engineering task force (IETF) to support quality of service (QoS) in the
Internet. It has flexibility and scalability advantages over the earlier
model, namely, integrated services (IntServ). Currently, the DiffServ
model is the preferred architecture widely accepted by Internet providers
and the networking research community. The goal of the DiffServ model is
to avoid maintaining large amount of state information in core routers,
and carry out aggregate resource reservation at edge routers. Therefore,
DiffServ calls for a very different routing framework from IntServ. In
this paper, we propose two new QoS-based routing algorithms under the
single service, multiple options (SiMO) framework for DiffServ
architectures. These are kth-shortest QoS routing (kthQoSR) and maximum
energy value QoS routing (EVQoSR). We also introduce QoS extensions to
OSPF and compare it to our SiMO routing protocols. Our core routing
strategy in SiMO, kthQoSR, is executed at the path level and selects one
or more routes from a set of computed routes according to defined
selection metrics. On the other hand, EVQoSR is a link level, online
distributed routing algorithm. Through extensive simulations, we
demonstrate that our proposed SiMO routing framework can achieve better
route qualities in terms of load balancing, and network throughput.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-46FPWPP-1-37\&\_cdi=5624\&\_orig=browse\&\_coverDate=04\%2F15\%2F2003\&\_sk=999739993\&view=c\&wchp=dGLbVlb-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=7b036d7bbe0aee13ab19eb4dd1ef5fcb\&ie=f.pdf"
}
@INPROCEEDINGS{Zhao0305:Algebraic,
AUTHOR="Wanlun Zhao and Geert Leus and Georgios B. Giannakis",
TITLE="Algebraic Design of Unitary Space-Time Constellations",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="We design constellations for non-coherent space-time systems.
Given in algebraic form, the constructed constellations are easy
to design, enjoy full diversity, allow for a simplified maximum
likelihood detector, and achieve performance comparable to
existing designs that rely on computer search."
}
@INPROCEEDINGS{Zhao0305:Joint,
AUTHOR="Fang Zhao and George Mathew and Behrouz Farhang-Boroujeny",
TITLE="Joint Turbo Channel Detection and {RLL} Decoding for {(1,7)} Coded Partial
Response Magnetic Recording Channels",
BOOKTITLE="ICC 2003 - Communication Theory",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Runlength limited (RLL) codes are essential in recording systems for
minimizing distortions and maintaining bit synchronization. In this paper,
we investigate the application of turbo codes on RLL (1,7) coded partial
response equalized longitudinal magnetic recording channels. We propose a
`combined trellis' approach for doing `soft-in soft-out' (SISO) channel
detection and RLL decoding jointly. This approach makes the implementation
of turbo equalization easier since it eliminates the need for a `SISO RLL
encoder' in the feedback path fom turbo decoder to channel detector.
Existing approaches do channel detection and RLL decoding separately,
resulting in a non-optimal receiver structure.
Simulation results show that our approach provides a coding gain of about
4dB compared to Viterbi detection at 10^{-6} bit error rate."
}
@INPROCEEDINGS{Zhao0305:Power,
AUTHOR="Jun Zhao",
TITLE="Power Efficiency in {IEEE} 802.11a {WLAN} with Cross-Layer Adaptation",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Power consumption is one of the most stringent bottlenecks in mobile
devices. Increasing power efficiency is essential for the deployment of
wireless system and boosting wireless/mobile applications. In this paper,
we investigate the joint effect of MAC and PHY layers on power efficiency
in IEEE 802.11a WLAN. Specifically, we study the link adaptation for a
power efficient transmission by selecting a proper transmission mode and
power level with the aid of our derived power efficiency model. This study
addresses the fundamental impact of the CSMA MAC protocol on the power
efficiency of IEEE 802.11a WLANs. Some implications for system design are
also discussed. In particular, we show that the non-radio-transmission
power plays an important role in the power optimization of IEEE 802.11a
WLAN."
}
@INPROCEEDINGS{Zhao0305:Predicting,
AUTHOR="Weibin Zhao and Henning Schulzrinne",
TITLE="Predicting the Upper Bound of Web Traffic Volume Using a Multiple Time
Scale Approach",
BOOKTITLE="International World Wide Web Conference (WWW) (poster session)",
ADDRESS="Budapest, Hungary",
PAGES=243,
MONTH=may,
YEAR=2003,
REFERENCES=4,
KEYWORDS="web traffic; traffic prediction; overload",
ABSTRACT="This paper presents a prediction algorithm for estimating the upper bound
of future Web traffic volume. Unlike traditional
traffic predictions that are performed at a single time scale using curve
fitting, we employ a multiple time scale approach and
utilize traffic statistical properties to do forecasting. We have applied
our prediction algorithm to the 1998World Cup data set.
Experiments show that it is effective for short term traffic bound
predictions, applicable to bursty traffic, and useful for Web
server overload prevention.",
URL="http://www.cs.columbia.edu/IRT/papers/Zhao0305\_Predicting.pdf"
}
@INPROCEEDINGS{Zhen0303:EMPOWER,
AUTHOR="Pei Zheng and Lionel Ni",
TITLE="{EMPOWER:} A Network Emulator for Wireless and Wireline Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="The increasing need of protocol development environment and network
performance evaluation tools gives rise to the research of flexible,
scalable, and accurate network emulators. The desired network emulator
should be able to facilitate the emulation of either wired or wireless
networks. In the case network topology is critical to the underlying
network protocol, the emulator should provide specific mechanism to
emulate network topology. In this paper, we present a distributed network
emulation system EMPOWER, which not only can fulfill those requirements,
but also can generate user-defined network conditions and traffic dynamics
in packet level. EMPOWER is highly scalable in that each emulator node
could be configured to emulate multiple network nodes. Related research
issues such as topology mapping scheme and virtual-router routing are
discussed and addressed. Preliminary emulation results show that EMPOWER
is capable to assist the study of both wireless and wireline network
protocols and applications."
}
@INPROCEEDINGS{Zhen0303:Power,
AUTHOR="Rong Zheng and Robin Kravets",
TITLE="On-demand Power Management for Ad Hoc Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="attery power is an important resource in ad hoc networks. It has been
observed that in ad hoc networks, energy consumption does not reflect the
communication activities in the network. Many existing energy conservation
protocols based on electing a routing backbone for global connectivity are
oblivious to traffic characteristics. In this paper, we propose an
extensible on-demand power management framework for ad hoc networks that
adapts to traffic load. Nodes maintain soft-state timers that determine
power management transitions. By monitoring routing control messages and
data transmission, these timers are set and refreshed on-demand. Nodes
that are not involved in data delivery may go to sleep as supported by the
MAC protocol. This soft- state is aggregated across multiple flows and its
maintenance requires no additional out-of-band messages. We implement a
prototype of our framework in the ns-2 simulator that uses the IEEE 802.11
MAC protocol. Simulation studies using our scheme with the Dynamic Source
Routing protocol show a reduction in energy consumption near 50\% when
compared to a network without power management under both long-lived CBR
traffic and on-off traffic loads, with comparable throughput and latency.
Preliminary results also show that it outperforms existing routing
backbone election approaches."
}
@INPROCEEDINGS{Zhen0305:Feedback,
AUTHOR="Xing Zheng",
TITLE="Feedback-Free Packet Loss Recovery for Video Multicast",
BOOKTITLE="ICC 2003 - Global Services and Infrastructure for Next Generation Networks",
ADDRESS="Anchorage, Alaska",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT={In video streaming over multicast networks, error recovery is
essential to alleviate the effect of packet loss. In this paper,
we study a feedback-free recovery scheme which combines the
strength of FEC (namely, a parity packet can repair any lost
packet) and pseudo-ARQ (namely, incremental recovery). To account
for the receiver heterogeneity, the server multicasts layered
video streams for the receivers to join. For each layer, the
receivers may join dynamically additional multicast channels of
FEC and pseudo-ARQ packets to recover local losses. In order to
offer quality video, we address the following two issues: 1)``Menu
creation{"}: Given a certain maximum error rate after correction
(i.e., residual error rate), what is the combination of FEC and
pseudo-ARQ packets for the server to send so as to minimize a
target receiver's bandwidth; and 2)``Menu selection{"}: Given the
server's menu, what's the combination of FEC and pseudo-ARQ
packets for the receiver to join so as to minimize its residual
error rate given its local loss probability, bandwidth and loss
pattern. We present the analysis of the scheme and show that our
scheme can substantially reduce a receiver's residual error rate
as compared with pure FEC or pure pseudo-ARQ alone (by cutting it
as much as half). Given that network loss may fluctuate with time
and in order to reduce the computation complexity, we also present
a fast approximation for a receiver to compute the optimal mix of
FEC and pseudo-ARQ packets. Our fast approach is shown to achieve
similar residual error rates as the optimal one while
substantially reducing the complexity from O(n^4) to O(1),
where n is the total number of packets a receiver receives
within the system delay.}
}
@ARTICLE{Zhen0305:Interactive,
AUTHOR="Bing Zheng and Mohammed Atiquzzaman",
TITLE="Interactive video over {ATM:} state of the art",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=7,
PAGES="747-758",
MONTH=may,
YEAR=2003,
REFERENCES=41,
KEYWORDS="Video on demand; Asynchronous transfer mode; Quality of service",
ABSTRACT="Multimedia is an emerging service which integrates voice, video and data in
the same service. With the progress made in high speed large capacity
multimedia servers, high speed networks, QoS, service guarantees and set
top boxes, it is currently possible to cost effectively and efficiently
carry multimedia over high speed networks. This paper surveys the progress
made, and the future of efficiently carrying multimedia over the emerging
Asynchronous Transfer Mode networks.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-473N429-1-1C\&\_cdi=5624\&\_orig=browse\&\_coverDate=05\%2F01\%2F2003\&\_sk=999739992\&view=c\&wchp=dGLbVzb-zSkzV\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=4b5ff44927d53051aba432e8cbef17d9\&ie=f.pdf"
}
@INPROCEEDINGS{Zhen0305:Stochastic,
AUTHOR="Dong Zheng and Georgios Lazarou and Rose Hu",
TITLE="A Stochastic Model for Short-lived {TCP} Flows",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we propose a new model for the slow-start phase based
on the discrete evolutions of congestion window, and we use this
slow-start model together with our improved TCP steady-state model
to develop an extensive stochastic model which can more accurately
predict the throughput and latency of short-lived TCP connections
as functions of loss rate, round-trip time (RTT), and file size.
The results from simulation experiments show that our model's
performance predictions are up to $20\\%$ more accurate than the
predictions obtained from the models proposed in [1] and [2]."
}
@INPROCEEDINGS{Zhen0305:Test,
AUTHOR="Pei Zheng",
TITLE="Test and Evaluation of Wide Area Networks Using Emulator Cluster",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Network emulation is real-time simulation that enables test and evaluation
of real network systems, protocols, and applications in a reconfigurable
and controllable hardware and software environment. Real network traffic
is processed by the protocol stacks of physical systems across the entire
emulation environment. Standalone emulators can only be used to test
end-to-end protocols and applications; simple emulator testbeds are hard
to scale due to the one-to-one mapping scheme. We present a distributed
emulator cluster that can faithfully emulate large-scale wide area
networks with only a considerably smaller number of workstations. In the
emulator cluster, a network topology is accurately mapped to a virtual
topology in which certain number of virtual nodes are properly configured
and emulated. We have developed an algorithm to partition a target
network such that each portion can be accurately emulated by a physical
node. The emulator cluster can emulate a variety of network conditions
and traffic dynamics, as well as incorporating new protocols and models.
Preliminary test results show the high scalability of emulator cluster in
terms of emulation validity and accuracy in a single physical node and in
the entire environment."
}
@INPROCEEDINGS{Zhon0303:Sprite,
AUTHOR="Sheng Zhong and Jiang Chen and Yang Richard Yang",
TITLE="Sprite: A Simple, Cheat-Proof, Credit-Based System for Mobile Ad-Hoc
Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="Mobile ad hoc networking has been an active research area for several
years. How to stimulate cooperation among selfish mobile nodes, however,
is not well addressed yet. In this paper, we propose Sprite, a simple,
cheat-proof, credit-based system for stimulating cooperation among
selfish nodes in mobile ad hoc networks. Our system provides incentive
for mobile nodes to cooperate and report actions honestly. Compared with
previous approaches, our system does not require any tamper-proof
hardware at any node. Furthermore, we present a formal model of our
system and prove its properties. Evaluations of a prototype
implementation show that the overhead of our system is
small. Simulations show that mobile nodes will cooperate and forward each
other's messages, unless the resource of each node is extremely
low."
}
@TECHREPORT{Zhou0303:Missing,
AUTHOR="Shi Zhou and Raul Mondragon",
TITLE="The missing links in the BGP-based {AS} connectivity maps",
TYPE="arXiv",
MONTH=mar,
YEAR=2003,
NOTE="PAM2003 - The Passive and Active Measurement",
KEYWORDS="Networking and Internet Architecture",
ABSTRACT="A number of recent studies of the Internet topology at the autonomous
systems
level (AS graph) are based on the BGP-based AS connectivity maps (original
maps). The so-called extended maps use additional data sources and contain
more
complete pictures of the AS graph. In this paper, we compare an original
map,
an extended map and a synthetic map generated by the Barabasi-Albert
model. We
examine the recently reported rich-club phenomenon, alternative routing
paths
and attack tolerance. We point out that the majority of the missing links
of
the original maps are the connecting links between rich nodes (nodes with
large
numbers of links) of the extended maps. We show that the missing links are
relevant because links between rich nodes can be crucial for the network
structure.",
URL="http://arXiv.org/abs/cs/0303028"
}
@INPROCEEDINGS{Zhou0303:Prophet,
AUTHOR="Hongbo Zhou and Lionel Ni and Matt Mutka",
TITLE="Prophet Address Allocation for Large Scale MANETs",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="A mobile device in an MANET must be assigned with a free IP address before
it can participate in unicast communication. This is a fundamental and
difficult problem in the practical use of any MANET. Several solutions
have been proposed. However, these approaches have different drawbacks. A
new IP address allocation algorithm, namely prophet allocation, is
proposed in the paper. The proposed scheme can be applied to large scale
MANETs with low complexity, low communication overhead, even address
distribution, and low latency. Both theoretical analysis and simulation
experiments are conducted to demonstrate the superiority of the proposed
algorithm over other know algorithms. Moreover, the proposed prophet
allocation is able to solve the problem of network partition and merger
efficiently."
}
@TECHREPORT{Zhou0303:Towards,
AUTHOR="Shi Zhou and Raul Mondragon",
TITLE="Towards Modelling The Internet Topology - The Interactive Growth Model",
TYPE="arXiv",
MONTH=mar,
YEAR=2003,
NOTE="Submitted to the 18th International Teletraffic Congress",
ABSTRACT="The Internet topology at the autonomous systems level (AS graph) has a
power-law degree distribution. Recently it was reported that the AS graph
shows
a rich-club phenomenon, in which rich nodes (a small number of nodes with
large
numbers of links) are very well connected to each other and rich nodes are
connected preferentially to the other rich nodes. The rich-club phenomenon
precisely describes and quantifies the topological structure of the AS
graph.
In this paper we introduce the Interactive Growth (IG) model. We show that
the
simple and dynamic IG model compares favourably with other Internet
power-law
topology generators in terms of the degree distribution and the rich-club
phenomenon.",
URL="http://arXiv.org/abs/cs/0303029"
}
@INPROCEEDINGS{Zhou0305:Adaptive,
AUTHOR="Shengli Zhou and Georgios B. Giannakis",
TITLE="Adaptive Modulation for Multi-Antenna Transmissions with Channel Mean
Feedback",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Adaptive modulation has the potential to increase
the system throughput significantly by matching
transmitter parameters to time-varying channel conditions.
However, adaptive modulation assuming perfect channel
state information (CSI) is sensitive to CSI imperfections
induced by estimation errors and feedback delays.
In this paper, we design adaptive modulation schemes
for multi-antenna transmissions based on partial CSI,
that models the spatial fading channels as Gaussian
random variables with non-zero mean and white covariance,
conditioned on feedback information. Based on a
two-directional beamformer, our proposed transmitter
optimally adapts the beam directions, the power allocation
between two beams, and the signal constellation, to
maximize the transmission rate while maintaining
a target bit error rate (BER). Numerical results demonstrate
the rate improvement, and illustrate an interesting tradeoff
that emerges between feedback quality and hardware complexity."
}
@INPROCEEDINGS{Zhou0305:Concatenation,
AUTHOR="Guangcai Zhou and Tung-Sheng Lin and Weizheng Wang and William Lindsey and
Ernest Chen",
TITLE="On the concatenation of turbo code and Reed-Solomon code",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper studies the concatenation of turbo code and
Reed-Solomon (RS) code. The error patterns of turbo code are first
analyzed. Since the error patterns of turbo code are much
different from those of convolutional code, the design rules for a
matched interleaver between turbo code and RS code are provided.
As an application to digital video broadcasting by satellite
(DVB-S), the performance of Forney interleavers with different
spreading ability is simulated for a fixed turbo code. For a (34,
6) Forney interleaver, the performance of turbo codes with
different block sizes is also simulated. A delay and performance
tradeoff can be made via simulation results."
}
@INPROCEEDINGS{Zhou0305:Optimum,
AUTHOR="Yiqing Zhou and Jiangzhou Wang",
TITLE="Optimum Sub-packet Transmission for Turbo-coded Hybrid {ARQ} Systems",
BOOKTITLE="ICC 2003 General Conference - Communication",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Turbo codes are popular for their near-shannon capacity of bit-error-rate
(BER) at low signal-to-noise ratio (SNR) with long packet lengths. They
have been proposed in automatic-repeat-request (ARQ) systems as the
forward-error correction (FEC) codes. Although sub-packet schemes were
proposed in ARQ systems, optimum sub-packet transmission is more effective
to maximize throughput in a dynamic channel. Sub-packet schemes can provide
additional error correction capability with iterative turbo decoding
algorithms. An efficient method is proposed to estimate the optimum number
of sub-packets, and adaptive sub-packet schemes, i.e., schemes that enable
a system to employ different optimum numbers of sub-packets under variable
conditions, are suggested to achieve the maximum throughput of the system.
Simulations show that the adaptive sub-packet scheme is effective at
moderate SNR, e.g. from 2.6dB to 5.0dB, and can provide higher throughput
than conventional packet schemes."
}
@INPROCEEDINGS{Zhou0305:Slotted,
AUTHOR="Lei Zhou and Yu-Dong Yao and Harry Heffess and Ruifeng Zhang",
TITLE="Slotted {ALOHA} in Multicell and Nakagami Fading Environment",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="The slotted Aloha (S-ALOHA) scheme in Nakagami fading
channels with the presence of in-cell and cochannel-cell
interference is studied. The cases of asynchronous
cochannel-cells are especially considered. The analysis
is based on the signal capture model and gives closed-form
expressions for the system throughput. Additional channel
conditions and system parameters are examined in the study,
including a minimal signal power requirement, lognormal
shadowing and the cellular cluster size."
}
@ARTICLE{Zhu0302:Using,
AUTHOR="Weiping Zhu",
TITLE="Using Bayesian network on network tomography",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=2,
PAGES="155-163",
MONTH=feb,
YEAR=2003,
REFERENCES=19,
KEYWORDS="Bayesian networks; Network tomography; Statistical inference",
ABSTRACT="Network tomography aims to obtain link-level performance characteristics,
such as loss rate and average delay on each link, by end-to-end
measurement. The obtained information can help us to understand the
dynamic nature of networks. A number of methods have been proposed in
recent years, which can be divided into two classes: multicast-based and
unicast-based. In this paper, we propose an approach in the multicast
class that uses the Bayesian network to carry out statistical inference.
Simulations based on the network simulator 2 (ns2) were conducted, which
shows our approach produced almost identical result as that produced by
the maximum likelihood estimator previous proposed.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-462BR6W-4-28\&\_cdi=5624\&\_orig=browse\&\_coverDate=02\%2F01\%2F2003\&\_sk=999739997\&view=c\&wchp=dGLbVlz-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=a801a6306be09bb40c007a676fe517a9\&ie=f.pdf"
}
@ARTICLE{Zhu0304:Novel,
AUTHOR="Hongyue Zhu and Hui Zang and Keyao Zhu and Biswanath Mukherjee",
TITLE="A Novel Generic Graph Model for Traffic Grooming in Heterogeneous {WDM}
Mesh Networks",
JOURNAL="IEEE/ACM Transactions on Networking",
VOLUME=11,
NUMBER=2,
PAGES="285-299",
MONTH=apr,
YEAR=2003,
REFERENCES=36,
KEYWORDS="graph model; mesh network; optical network; traffic grooming;
wavelength-division multiplexing (WDM)",
ABSTRACT="As the operation of our fiber-optic backbone networks migrates from
interconnected SONET rings to arbitrary mesh topology, traffic grooming on
wavelength-division multiplexing (WDM) mesh networks becomes an extremely
important research problem. To address this problem, we propose a new
generic graph model for traffic grooming in heterogeneous WDM mesh
networks. The novelty of our model is that, by only manipulating the edges
of the auxiliary graph created by our model and the weights of these edges,
our model can achieve various objectives using different grooming policies,
while taking into account various constraints such as transceivers,
wavelengths, wavelength-conversion capabilities, and grooming
capabilities. Based on the auxiliary graph, we develop an integrated
traffic-grooming algorithm (IGABAG) and an integrated grooming procedure
(INGPROC) which jointly solve several traffic-grooming subproblems by
simply applying the shortest-path computation method. Different grooming
policies can be represented by different weight-assignment functions, and
the performance of these grooming policies are compared under both
nonblocking scenario and blocking scenario. The IGABAG can be applied to
both static and dynamic traffic grooming. In static grooming, the
traffic-selection scheme is key to achieving good network performance. We
propose several traffic-selection schemes based on this model and we
evaluate their performance for different network topologies.",
URL="http://ieeexplore.ieee.org/iel5/90/26877/01194824.pdf?isNumber=26877\&prod=JNL\&arnumber=1194824\&arSt=+285\&ared=+299\&arAuthor=Hongyue+Zhu\%3B+Hui+Zang\%3B+Keyao+Zhu\%3B+Mukherjee\%2C+B."
}
@INPROCEEDINGS{Zhu0305:Control,
AUTHOR="Hua Zhu and Guoping Zeng and Imrich Chlamtac",
TITLE="Control Scheme Analysis for Multimedia Inter- and Intra-Stream
Synchronization",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper we study the inter- and intra-stream synchronization control
schemes in networks with large end-to-end delays. We analyze pros and cons
of different types of control schemes, focusing on the performance
criterion of minimizing the jitter variance with the media stream for
intra-stream synchronization, considered the most important objective. The
minimum variance controller model is introduced to analyze the feasibility
of feedback control schemes to achieve this objective. Due to the
constraints of the distributed multimedia system model, especially when
the average end-to-end network delay davg is large (compared to the
duration of the playback of the full buffer, 2D), we show that within a
single stream (at least the master stream), the playback performance of
any kind of feedback control scheme cannot be better than the uncontrolled
system. Therefore, we can remove the feedback loop to reduce communication
overheads and computation complexity. Given the increasing size of the
global networks and the integration of wireless services the delays are
gradually increasing, making this result of increased importance in the
emerging networking paradigms."
}
@INPROCEEDINGS{Zhu0305:Improving,
AUTHOR="Jing Zhu",
TITLE="Improving {TCP} Performance in TDMA-based Satellite Access Networks",
BOOKTITLE="ICC 2003 - Broadband Wireless and Satellite Communication Systems",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, two TDMA-based MAC
(media access control) protocols are evaluated with respect to
TCP traffic in a satellite access network. One is slotted ALOHA
using pure random access, which has been widely deployed in Very
Small Aperture Terminal (VSAT) systems. The other is Generalized
Retransmission Announcement Protocol (GRAP) proposed recently in
\cite{KT00}, which regroups the immediate access by contention at
low loads and the reservation access at higher loads to achieve a
better efficiency. Inspired by GRAP, we propose a new MAC protocol
(CA-GRAP) using \textsl{cumulative acknowledgment} (CA) technique
to further improve the success probability of reservation request.
Our proposal does not work on collision or error detection but
only correctly received packets, dramatically simplifying the
procedure. Unlike previous work with traffic modeled by Poisson
process, we focus on TCP traffic. An upper bound of TCP
throughput is derived for CA-GRAP at high loads. Simulation is
performed to validate the bound. Moreover, simulation results
show that CA-GRAP has stronger ability to resist insufficient
number of mini slot and achieves higher throughput than GRAP in
most cases."
}
@INPROCEEDINGS{Zhu0305:Modeling,
AUTHOR="Jing Zhu",
TITLE="Modeling {TCP} over Selective Repeat {ARQ} in Wireless Networks with
Non-Neglectable Propagation Delay",
BOOKTITLE="ICC 2003 - Communication QoS, Reliability, and Performance Modeling",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we propose an
analytical model for TCP over selective repeat ARQ for wireless
networks, in which random loss is the primary impediment to
reliable, high-speed data services. We focus on the problem of
modeling RTT (round trip time) variation due to ARQ
retransmission at the link layer with non-neglectable propagation
delay. With the proposed model, we present upper and lower bounds
for TCP end-to-end throughput in a wireless network with ARQ
support."
}
@INPROCEEDINGS{Zhu0305:Multi,
AUTHOR="Yong Zhu and Admela Jukan and Mostafa Ammar",
TITLE="Multi-Segment Wavelength Routing in Large-Scale Optical Networks",
BOOKTITLE="ICC 2003 - Optical Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="In this paper, we study the performance of wavelength routing in
large-scale optical networks where optical paths traverse a number of
networking segments interconnected by gateways. We use the notion of
networking segments to refer to any portion of an optical path that
requires particular consideration for wavelength routing, such as separate
administrative domains, sub-networks characterized by different levels of
traffic aggregation (e.g. access and regional networks), or different
optical technol-ogy networks. Using the concept of a network segment
al-lows us to consider three dimensions of the routing and wavelength
allocation problem: (i) heterogeneous and segment-specific topology and
resources, (ii) traffic, global (segment crossing) and local (segment
internal), and (iii) gateway location and adaptation capabilities. Based
on this characterization of optical network interconnections, we present
three wavelength routing algorithms, End-to-End, Concatenated Shortest
Path and Hierarchical Routing. For each of them, we analyze the benefits
with respect to the type of traffic, i.e. global vs. local. We then
consider different requirements on wavelength routing based on gateway
adaptation capabilities (wavelength merging, shifting or waveband
interchange). Finally, for examples of regional all-optical networks
interconnected over an all-optical WDM backbone under a variety of
traf-fic conditions, we present and compare numerical results of blocking
performances of different routing algorithms and gateway selection
strategies."
}
@INPROCEEDINGS{Zhu0305:Solution,
AUTHOR="Weiping Zhu",
TITLE="Solution Space of Loss Tomography",
BOOKTITLE="ICC 2003 General Conference - Networking",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="Loss tomography is a key component of network tomography, which
aims to obtain
loss rate for each link in a network by end-to-end measurement.
The loss rates can help us to understand the traffic flows in
a network and identify
bottlenecks in the network. All methods proposed in the past relies
on statistical inference to obtain
loss rates from observations conducted at end nodes,
and most of them are based on the maximum likelihood estimate to find
a solution.
However, there is a lack of studying the
solution space of statistical inference, which creates uncertainty
for the loss rates identified by a method
since the solution could trap to a local maximum, instead of the global
one.
In this paper, we reformulate the inference into a non-linear programming
proble
m
and study its solution space.
We find when losses occurred on a link is modelled as Bernoulli process,
the sol
ution
space is concave.
This finding will
lead to new and effective algorithm for network tomography."
}
@INPROCEEDINGS{Zhua0305:Transmit,
AUTHOR="Xiangyang Zhuang",
TITLE="Transmit Diversity and Spatial Multiplexing in Four-Transmit-Antenna {OFDM}",
BOOKTITLE="ICC 2003 - Advanced Signal Processing for Communications",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="This paper studies the trade-off between spatial diversity and spatial
multiplexing in an OFDM system with four transmit antennas. A hybrid
Space-Time Block Coding / Multiple-Input Multiple-Output (STBC/MIMO)
design with a proposed simple receive algorithm is found to be a good
design choice in terms of performance, compared with MIMO-only or
diversity-only designs. We show that the capacity gain of the hybrid
design is achieved at the expense of a loss in spatial diversity.
Simulation results show that the MIMO-only, diversity-only, and hybrid
designs also have different robustness to channels that lack spa-tial
diversity."
}
@ARTICLE{Ziou0302:Dynamically,
AUTHOR="Eustathia Ziouva and Theodore Antonakopoulos",
TITLE="A dynamically adaptable polling scheme for voice support in {IEEE802.11}
networks",
JOURNAL="Computer Communications",
VOLUME=26,
NUMBER=2,
PAGES="129-142",
MONTH=feb,
YEAR=2003,
REFERENCES=20,
KEYWORDS="IEEE802.11; Wireless LAN; Centralized control; Speech communication",
ABSTRACT="This paper presents a new dynamically adaptable polling scheme for
efficient support of voice communications over an IEEE802.11 network. The
proposed Cyclic Shift and Station Removal polling scheme is implemented
only on the Access Point of each Basic Service Set without requiring any
modification on the existing access protocol. This polling scheme
increases the number of conversations in case of silence detection, while
maintains high voice quality. By considering constant bit rate digitized
voice traffic, the paper presents a discrete-time Markov chain model, that
is, used to analyze the performance of the IEEE802.11 Point Coordination
Function in terms of maximum number of supported conversations, when
silence detection is used at the mobile terminals. The paper also
determines how the parameters of the proposed polling scheme have to be
related to the silence detector hangover.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-462BR6W-2-6F\&\_cdi=5624\&\_orig=browse\&\_coverDate=02\%2F01\%2F2003\&\_sk=999739997\&view=c\&wchp=dGLbVzb-zSkzS\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=f337166c2f487c9b745e5fb93bd72157\&ie=f.pdf"
}
@INPROCEEDINGS{Zou0303:Sensor,
AUTHOR="Yi Zou and Krishnendu Chakrabarty",
TITLE="Sensor Deployment and Target Localization Based on Virtual Forces",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="The effectiveness of cluster-based distributed sensor networks depends to a
large extent on
the coverage provided by the sensor deployment. We propose a virtual force
algorithm (VFA)
as a sensor deployment strategy to enhance the coverage after an initial
random placement of sensors. For a given number of sensors, the VFA
algorithm attempts to maximize the sensor field coverage. A judicious
combination of attractive and repulsive forces is used to determine
virtual motion paths and the rate of movement for the randomly-placed
sensors. Once the effective sensor positions are identified, a one-time
movement with energy consideration incorporated is carried out, i.e. the
sensors are redeployed, to these positions. We also propose a novel
probabilistic target localization algorithm that is executed by the
cluster head. The localization results are used by the cluster head to
query only a few sensors (out of those that report the presence of a
target) for more detailed information. Simulation results are presented to
demonstrate the effectiveness of the proposed approach."
}
@INPROCEEDINGS{Zoua0305:Novel,
AUTHOR="Bachar Zouari",
TITLE="A Novel Authentication Model Based on Secured {IP} Smart Cards",
BOOKTITLE="ICC 2003 - Global Services and Infrastructure for Next Generation Networks",
ADDRESS="Anchorage, Alaska",
DAYS=11,
MONTH=may,
YEAR=2003,
ABSTRACT="An authentication model using powerful secured Smart Cards implementing IP
services is presented. In this model, some authentication functions
usually found in the access network are moved inside the smart card.
This innovative architecture simplifies current authentication schemes and
helps to design new services.
Keywords. Authentication, IP Smart Card SIM-IP, AAA, Kerberos, 3GPP"
}
@INPROCEEDINGS{Zuke0303:Internet,
AUTHOR="Moshe Zukerman and Timothy Neame and Ronald Addie",
TITLE="Internet Traffic Modeling and Future Technology Implications",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="This paper presents the Poisson Pareto burst process (PPBP) as a simple
but accurate model for Internet traffic. It presents formulae
relating the parameters of the PPBP to measurable traffic
statistics, and describes a technique for fitting the PPBP to a
given traffic stream. The PPBP is shown to accurately predict
the queueing performance of a sample trace of aggregated
Internet traffic. Using the traffic model, we predict
that in few years, efficient statistical multiplexing will
lead to efficient optical Internet.
Methods Keywords:
Simulations, Stochastic processes/Queueing theory"
}
@INPROCEEDINGS{Zuss0303:Energy,
AUTHOR="Gil Zussman and Adrian Segall",
TITLE="Energy Efficient Routing in Ad Hoc Disaster Recovery Networks",
BOOKTITLE="IEEE Infocom 2003",
DAYS=30,
MONTH=mar,
YEAR=2003,
ABSTRACT="The terrorist attacks on September 11, 2001 have drawn attention to the use
of
wireless technology in order to locate survivors of structural collapse.
We
propose to construct an ad hoc network of wireless smart badges in order
to
acquire information from trapped survivors. We investigate the energy
efficient routing problem that arises in such a network and show that
since
smart badges have very limited power sources and very low data rates,
which
may be inadequate in an emergency situation, the solution of the routing
problem requires new protocols. The problem is formulated as an anycast
routing problem in which the objective is to maximize the time until the
first
battery drains-out. We present iterative approximation algorithms for the
solution of the problem. Then, we derive an upper bound on the network
lifetime for specific topologies. Finally, a polynomial algorithm for
obtaining the optimal solution in such topologies is described."
}