@TECHREPORT{CERT02:Overview,
AUTHOR="C. E. RT Coordination Center",
TITLE="Overview of Attack Trends",
TYPE="Technical Report",
INSTITUTION="CERT, Carnegie Mellon University",
ADDRESS="Pittsburgh, Pennsylvania",
YEAR=2002,
KEYWORDS="denial of service; Internet security",
ABSTRACT="The CERT Coordination Center has been observing intruder
activity since 1988.  Much has changed since then, from our technology
to the makeup of the Internet user community, to attack techniques.  In
this paper, we give a brief overview of recent trends that affect the
ability of organizations (and individuals) to use the Internet safely.",
URL="http://www.cert.org/archive/pdf/attack\_trends.pdf",
}

@TECHREPORT{Bhan02:Delayed,
AUTHOR="Sumitha Bhandarkar and A. Reddy",
TITLE="Delayed Congestion Response Protocols",
INSTITUTION="Dept. of Electrical Engineering, Texas A\\&M University",
YEAR=2002,
KEYWORDS="Delayed Congestion Response; smooth sending rates; fairness;
active buffer management; timescales; TCP-friendliness",
ABSTRACT="In this paper, we propose a new class of protocols called the
``Delayed Congestion Response Protocols'' where response to congestion
in the network is deliberately delayed for some time interval, allowing
applications to make necessary adjustments for impending loss in
bandwidth.  We provide the general framework for this class of protocols
and examine three cases in particular.  For these three cases we develop
the analytical models and derive the conditions under which they can be
fair to TCP.  We confirm the analysis through ns-2 based simulations. By
showing that delayed congestion response is possible, we lay the ground
work for the development of a new class of transport protocols which are
capable of providing early warning to the application regarding an
impending reduction in the sending rate.  In addition, these protocols
can be designed to have a smooth congestion response for multimedia
applications.",
URL="http://ee.tamu.edu/~reddy/sumitha.pdf",
}

@ARTICLE{Acam0201:Tolerating,
AUTHOR="Anthony Acampora and Ralph Gholmieh and Srikanth V.
Krishnamurthy",
TITLE="On tolerating single link, double link, and nodal failures in
symmetric grid networks",
JOURNAL=jhsn,
VOLUME=11,
NUMBER=1,
YEAR=2002,
ABSTRACT="${1/\sqrt{(N)}}$ is reserved for failure recovery, provides
totally failsafe operation in the presence of such failure events.",
}

@ARTICLE{Wang0201:Dynamically,
AUTHOR="Bin Wang and Jennifer Hou and Ching-Chih Han",
TITLE="On dynamically establishing and terminating isochronous message
streams in {WDM} star-based lightwave networks",
JOURNAL=jhsn,
VOLUME=11,
NUMBER=1,
YEAR=2002,
ABSTRACT="Complement to our prior work in[21], we address in this paper
the problem of dynamically establishing/terminating real-time message
streams in response to call setup/clear requests in single-hop
star-coupled WDM optical networks. We consider a network architecture in
which N stations are connected to a star coupler with W data
channels(W\≤N)and one control channel. Each of the W data channels is
slotted and shared by the N stations by means of time division
multiplexing. The control channel is used for stations to coordinate the
call establishment and termination operations. We propose a distributed,
dynamic slot allocation scheme to allocate/de-allocate time slots on the
W data channels to message streams, with the objective of meeting
message deadlines. To facilitate slot assignment, the proposed scheme
first decomposes each message stream into a set of message sub-streams,
and groups the time slots on each wavelength channel into sub-channels.
In response to a call setup request, the proposed scheme then allocates
one or more empty sub-channels available over the W data channels to a
message stream to fulfill its temporal requirement, subject to the
source/destination constraints and that the temporal guarantees to
existing message streams should not be violated. On the other hand, in
response to a call clear request, the proposed scheme releases the slots
allocated to the terminated message stream, and merges, if appropriate,
empty sub-channels to facilitate future message stream establishment. We
formally prove the properties, and the correctness of, the proposed
dynamic slot allocation scheme.",
}

@ARTICLE{Petr0202:Scalable,
AUTHOR="Slobodan S. Petrovic and Subrata K. De and Bin Wang and Jennifer
Hou and Ching-Chih Han",
TITLE="A scalable logical topology for optical networks",
JOURNAL=jhsn,
VOLUME=11,
NUMBER=2,
PAGES="79-87",
YEAR=2002,
LANGUAGE="English",
KEYWORDS="ATM; ABR; rate control; feedback; Dynamic channel setup and
tear-down; time constrained communications; quality of service(QoS); WDM
star-based lightwave networks; Optical networks; SONET/WDM; Routing and
wavelength assignment; Optical networks; multihop networks; scalable
topology; logical topology; low diameter",
ABSTRACT="One of the approaches investigated for multihop lightwave
networks is to consider regular graphs as the logical topology for a
multihop network. Standard regular topologies are defined only for
networks with the number of nodes satisfying some rigid criteria and are
not directly usable for multihop networks. Only a few recent
proposals(e.g., GEMNET)are regular and yet allow the number of nodes to
have any arbitrary value. These networks have one major problem---node
addition requires a major redefinition of the network. For example, in a
multistar implementation, a large number of retuning of transmitters and
receivers and/or renumbering nodes are needed for GEMNET. In this paper
we present a new logical topology which has a low diameter but is not
strictly regular. The interesting aspect of this topology is that it
allows the network to be expanded incrementally involving a relatively
small number of edge definitions/redefinitions. In this paper we have
described our new topology and its properties. We have also implemented
a routing scheme that ensures a low diameter and an algorithm for adding
nodes to the network.",
URL="http://www.iospress.nl/site/html/09266801.html",
}

@ARTICLE{Li0202:Practical,
AUTHOR="Xiang-Yang Li and Liwu Liu and Peng-Jun Wan and Ophir Frieder",
TITLE="Practical traffic grooming scheme for single-hub {SONET/WDM}
rings",
JOURNAL=jhsn,
VOLUME=11,
NUMBER=2,
PAGES="103-119",
YEAR=2002,
KEYWORDS="Traffic grooming; SONET/WDM ring; UPSR; BLSR/2; single-hub;
bin packing",
ABSTRACT="In SONET/WDM networks, one fiber supports multiple wavelengths
and each wavelength supports several low rate tributary streams.'Traffic
grooming'then is defined as properly using SONET Add/Drop Multiplexer to
electronically multiplex and demultiplex required tributary traffic
patterns with minimal resource cost(wavelengths and ADMs). This paper
studies traffic grooming problem in single hub SONET/WDM networks and
extends existing results. We analyze the real deployments, generalize
their results, and study the practical special cases. We prove that
BLSR/2 would never be more expensive than UPSR under any traffic
pattern. We also present the exact minimum costs of uniform traffic in
both UPSR and BLSR/2. We give approximation algorithms for optimal
grooming of non-uniform traffic. Finally, we consider how to select the
line speeds if there are two different line speeds available.",
URL="http://www.iospress.nl/site/html/09266801.html",
}

@ARTICLE{Fahm0202:Determining,
AUTHOR="Sonia Fahmy and Raj Jain and Shivkumar Kalyanaraman and Rohit
Goyal and Bobby Vandalore",
TITLE="On determining the fair bandwidth share for {ABR} connections in
{ATM} networks",
JOURNAL=jhsn,
VOLUME=11,
NUMBER=2,
PAGES="121-135",
YEAR=2002,
KEYWORDS="Congestion control; fair bandwidth allocation; traffic
management; ATM networks; ABR service; ERICA",
ABSTRACT="In a multi-service network such as ATM, adaptive data services
(such as ABR) share the bandwidth left unused by higher priority
services. The network indicates to the ABR sources the fair and
efficient rates at which they should transmit to minimize their cell
loss. Switches must constantly measure the demand and available
capacity, and divide the capacity fairly among the contending
connections. In this paper, we propose a new method for determining
the\“effective\”number of active connections, and the fair
bandwidth share for each connection. We prove the efficiency and
fairness of the proposed method analytically, and use several
simulations to illustrate its fairness dynamics and transient response
properties.",
URL="http://www.iospress.nl/site/html/09266801.html",
}

@ARTICLE{Sado0202:Generation,
AUTHOR="Dan Sadot and Y. Nachmani and Amotz Bar-Noy and Shay Kutten",
TITLE="Next generation Tbit/sec routers and switches: traffic modeling,
scheduling algorithms, and simulations",
JOURNAL=jhsn,
VOLUME=11,
NUMBER=2,
PAGES="89-102",
YEAR=2002,
ABSTRACT="Scheduling algorithms for next generation multi Tbit/sec
routers and switches are evaluated. Concurrently, available packet
interconnections do not exceed a few hundreds Gbit/sec of aggregate
throughput, making traffic modeling and computer simulations an
extremely important tool. Here, traffic modeling is investigated in
terms of arrival process and destination distribution.'Real
world'traffic models are proposed, and extensive simulations are carried
out and compared to theoretical predictions. It is shown that
conventional scheduling algorithms, such as round robin, perform very
well under'convenient'simulation assumptions, e.g., heavy load and
uniform distribution assumptions. However, when traffic modeling is
oriented towards modern applications such as bursty arrival process as
in compressed video, or non-uniform destination distribution as in
Internet sites popularity, detailed and quantitative simulation results
prove that algorithm performances are significantly degraded from over
95\%to less than 60\%of maximum throughput. A modified'adaptive'round
robin algorithm is proposed, yielding significant improvement of 20\%in
the router's maximum throughput.",
URL="http://www.iospress.nl/site/html/09266801.html",
}

@TECHREPORT{Broi02:Heartbeat,
AUTHOR="Andre Broido and kc claffy",
TITLE="The Heartbeat of {DNS:} Private nets' updates at a root server",
TYPE="Technical note",
INSTITUTION="CAIDA",
ADDRESS="La Jolla, California",
YEAR=2002,
KEYWORDS="DNS; NAT",
ABSTRACT="The story of private net blocks begins with RFC1918 [1]
published in 1996.  Private nets or RFC1918 blocks are segments of IP
address space reserved by IANA for use in private networks.  These
addresses can be used by anyone without being officially assigned to a
network by a registry or an ISP.  Three most popular blocks among
RFC1918 addresses are 192.168/16, 10/8 and 172.16/12.  The addresses in
these blocks are called ``private IP addresses'' in the Internet
vernacular.  We will use this term sparingly in the rest of the paper,
since the addresses in question are public in the strictest sense, and
since the expression ``private internet'' from the title of RFC1918 is
in itself sort of an oxymoron.  RFC1918 says:  ``An enterprise that
decides to use IP addresses out of the address space defined in this
document can do so without any coordination with IANA or an Internet
registry.'' and continues:  ``Indirect references to such addresses
should be contained within the enterprise.  Prominent examples of such
references are DNS Resource Records and other information referring to
internal private addresses.  In particular, Internet service providers
should take measures to prevent such leakage.'' In this paper, we
examine how the above statement is implemented in today's common
practice.  It turns out to be a routine fact of matter that millions of
DNS packets are sent daily to nameservers outside private nets with the
information on RFC1918 addresses.",
URL="http://www.caida.org/~broido/dns/rfc1918.html",
}

@INCOLLECTION{Wong02:IP,
AUTHOR="K. Wong and Hung-Yu Wei and Ashutosh Dutta and Kenneth Young and
Henning Schulzrinne",
TITLE="{IP} micro-mobility management using host-based routing",
BOOKTITLE="Wireless IP and building the Mobile Internet",
EDITOR="Sudhir Dixit and Ramjee - Prasad",
PUBLISHER="Artech House",
YEAR=2002,
REFERENCES=16,
KEYWORDS="micro-mobility; mobile IP; SIP; HMIP",
ABSTRACT="Global IP mobility solutions using mobile IP or SIP are not
optimized to handle micro-mobility management. For micro-mobility
situations, low-latency handoffs are essential to reduce performance
degradation. Host-based routing (HBR) schemes such as HAWAII, Cellular
IP, and Micro-Mobility Protocol (MMP) are one of the two main classes of
IP micro-mobility management schemes; the other is hierarchical mobile
IP-derived schemes. This chapter discusses HBR schemes and examines
their performance. Various simulation results and prototype system
measurement demonstrate the superiority of HBR schemes over both MIP and
hierarchical MIP-derived micro-mobility schemes in terms of fewer
packets dropped per handoff for UDP traffic and better TCP throughput in
various scenarios.",
}

@BOOK{CSTB02:Internet,
AUTHOR="Computer Science and Telecommunications Board (C. S. TB)",
TITLE="The {Internet} Under Crisis Conditions: Learning from September
11",
PUBLISHER="National Academies Press",
ADDRESS="Washington, DC",
YEAR=2002,
URL="http://www.nap.edu/books/0309087023/html/",
}

@TECHREPORT{APCO02:Model,
AUTHOR="Association of Public Safety Communications Officials",
TITLE="Model Legislation Enhanced 9-1-1 for Multi-line Telephone
Systems",
TYPE="Model Legislation",
INSTITUTION="{Association of Public Safety Communications Officials}",
ADDRESS="Daytona Beach, Florida",
YEAR=2002,
KEYWORDS="911; emergency calling",
ABSTRACT="The digits 9-1-1 are designated as the emergency telephone
number.  Enhancements to the 9-1-1 system typically enables the caller's
telephone number and billing number to be displayed to the Public Safety
Answering Point (PSAP).  As a result, when the caller is calling from a
single-line telephone or a Multi-line Telephone System (MLTS) serving a
compact area, the address associated with the caller's telephone number
can be retrieved and usually provides a reasonably precise
identification of the caller's location.  Public safety agencies
increasingly rely on the Enhanced 9-1-1 system to provide dependable and
precise information about the caller's location and a reliable number to
call back in order to reach the caller.  However, in some cases 9-1-1
calls made from telephones connected to Multi-line Telephone Systems may
not be precisely located by the 9-1-1 system, eliminating some of the
benefit of Enhanced 9-1-1.  This lack of adequate location information
can be life threatening if the caller cannot supply the correct
location.  The nature of 9-1-1 calls is such that the likelihood for the
need to respond directly to the caller with minimal delay increases with
the type of calls where the caller for some reason cannot provide
information to the PSAP.  Related problems occur when the caller is
remote from the location supplied to the 9-1-1 system.  In this instance
not only is response delayed but limited public safety resources are
dispatched where they are not needed.  There may also be considerable
disruption in business operations as the response units attempt to
locate the caller.  The purpose of this model legislation is to require
Multi-line Telephone Systems to provide a sufficiently precise
indication of the caller's location, while avoiding the imposition of
undue burdens on system manufacturers, providers and operators.",
URL="http://www.apcointl.org/about/pbx/worddocs/modelleg.doc",
}

@MASTERSTHESIS{Caly02:Performance,
AUTHOR="Anjaneya Prasad Calyam",
TITLE="Performance measurement and analysis of {H.323} videoconference
traffic",
SCHOOL="Ohio State",
YEAR=2002,
LANGUAGE="English",
KEYWORDS="H.323; video conferencing; traffic measurement; QOS",
ABSTRACT="Among the recent multimedia applications seen on the Internet,
H.323 Videoconferencing has  been  significantly  popular.  H.323  is 
an  umbrella  standard  that  defines  how  real-time, multimedia 
communications  such  as  Videoconferencing  can  be  exchanged  on 
packet- switched  networks  (Internet).  Several  vendors  have 
successfully  implemented  the  various H.323  related  standards. 
Individuals  both  in  the  industry  and  academia  have  started 
using H.323  Videoconferencing  systems  extensively.    As  the 
expectation  levels  for  better audio/video performance have risen, it
has become essential to understand the factors that affect the
performance and behavior of the H.323 audio/video with the goal to
determine better  ways  of  servicing  H.323  audio/video  traffic  in 
the  network.  The  development  of appropriate tools to support large
H.323 Videoconferences has also become necessary. This thesis aims to
address these needs. Performance evaluation tests were conducted on the
H.323 traffic in an isolated LAN. The first set of tests was conducted
to understand the behavior of an H.323 videoconferencing system with the
variations in the network parameters such as latency, jitter and packet
loss. In  the  second  set  of  tests,  the  effect  of  the  various 
devices  on  the  end-to-end  delay  was determined since end-to-end
delay requirement is stringent for H.323 performance.  Suitable
recommendations  were  made  for  improving  the  Quality  of  Service 
(QoS)  of  a  large-scale multipoint  H.323  Videoconferencing  system. 
Lastly,  the  H.323  Beacon:  Videoconference session monitoring tool,
which uses client/server architecture was developed as a part of the
thesis study. It is a low cost, easy to use, debugging and continuity
test tool, which can be used by an end-user or an ISP to identify and
troubleshoot performance problems associated with H.323
Videoconferencing. The  studies  conducted  in this thesis can serve as
trouble-shooting information during periods of suspected network trouble
affecting H.323 Videoconferences and can help design networks to better
support large-scale multipoint H.323 Videoconferencing. The results can
also serve as pointers for developing a framework for seeking cost
effective solutions with relevant tradeoffs to achieve high quality
large-scale multipoint H.323 videoconferencing.",
URL="http://www.adec.edu/nsf/PrasadCalyam\_MS\_Thesis.pdf",
}

@TECHREPORT{Scho02:Summary,
AUTHOR="Paul Schopis",
TITLE="Summary Test {H.323} Bounds Test Report",
INSTITUTION="ADEC (The American Distance Education Consortium)",
ADDRESS="Lincoln, Nebraska",
YEAR=2002,
LANGUAGE="English",
KEYWORDS="H.323; video; performance; delay measurement",
ABSTRACT="This report contains the results of H.323 traffic bounds
testing conducted by ITEC-Ohio. Sniffed packet data by ITEC-NC will be
presented in another report. These are experiments to quantify which
network metrics are relevant for good H.323 video performance. Our
overall objective is to use this information to develop a meaningful QoS
strategy that supports H.323. Please refer to the document H.323 Traffic
Characterization Test Plan Draft for specific test plan details.",
URL="http://www.adec.edu/nsf/Summary\%20Test\%20H.323.v7.pdf",
}

@PROCEEDINGS{Tao02:Extended,
AUTHOR="Ying Tao and Dong Wang and Edward H. Shortliffe and Yves A.
Lussier",
TITLE="Extended attributes of event monitor systems for criteria-based
notification modalities.",
ORGANIZATION="Proc AMIA Symp",
YEAR=2002,
LANGUAGE="English",
ABSTRACT="The efficacy of event monitors (EMs) at reducing morbidity and
mortality of certain clinical conditions (CCs) is well established. In
addition, studies have shown that user inverted exclamation mark s
preferences on the modality of notification are correlated to the type
of reminder or alert. Nonetheless, few institutions have implemented
large scale automated monitoring of a considerable number of distinct
CCs, and to our knowledge, none of these sizable projects also offer
user-customizable communication modalities (CMs) over all monitored
conditions. As both the numbers of CMs and CCs increase, the complexity
of customizing user preferences amplifies following a geometric
progression. This paper demonstrates an automated approach, based on
generic notification attributes (NAs) and notification criteria (NC),
which significantly simplifies the management and personalization of the
CMs for institutions where the manual assignment of a CM for every alert
is forbidding. The methods by which these NAs were developed, their
significance for existing CCs and their implementation using the Arden
Syntax and Guideline interchange format (GLIF) are described. The
proposed Criteria-Based Notification is shown to improve two facets of
the management of event monitors: 1) the assignment of CMs becomes
independent from clinical conditions, de-facto removing
institution-specific CMs from the knowledge bases of the event monitors
and inserting CC-specific and institution-independent NAs, thus
increasing their reusability and sharability; 2) knowledge-based
independent NAs facilitate both institution-level management and
user-level preference configuration.",
URL="http://www.dmi.columbia.edu/homepages/wandong/papers/Ying-tao-24.pdf",
}

@ARTICLE{Cao02:Proactive,
AUTHOR="Guohong Cao",
TITLE="Proactive Power-Aware Cache Management for Mobile Computing
Systems",
JOURNAL=ieeetc,
VOLUME=51,
NUMBER=6,
PAGES="608-621",
YEAR=2002,
LANGUAGE="English",
KEYWORDS="Invalidation report; power conservation; query latency; cache;
mobile computing",
ABSTRACT="Recent work has shown that {\em invalidation report (IR)}
based cache management is an attractive approach for mobile
environments. However, the IR-based cache invalidation solution has some
limitations such as long query delay, low bandwidth utilization, and it
is not suitable for applications where data change frequently. In this
paper, we propose a proactive cache management scheme to address these
issues.  Instead of passively waiting, the clients intelligently
prefetch the data that are most likely used in the future. Based on a
novel {\em prefetch-access ratio} concept, the proposed scheme can
dynamically optimize performance or power based on the available
resources and the performance requirements. To deal with frequently
updated data, different techniques (indexing and caching) are applied to
handle different components of the data based on their update frequency.
Detailed simulation experiments are carried out to evaluate the proposed
methodology. Compared to previous schemes, our solution not only
improves the cache hit ratio, the throughput, and the bandwidth
utilization, but also reduces the query delay and the power
consumption.",
}

@PROCEEDINGS{Bush02:Active,
AUTHOR="Stephen Francis Bush",
TITLE="Active Virtual Network Management Prediction: Complexity as a
Framework for Prediction, Optimization, and Assurance",
ORGANIZATION="IEEE Computer Society",
PUBLISHER="IEEE",
YEAR=2002,
LANGUAGE="English",
KEYWORDS="active network, complexity theory",
ABSTRACT="Research into active networking has provided the incentive to
re-visit what has traditionally been classified as distinct properties
and characteristics of information transfer such as protocol versus
service; at a more fundamental level this paper considers the blending
of computation and communication by means of complexity. The specific
service examined in this paper is network self-prediction enabled by
Active Virtual Network Management Prediction. Computation/ communication
is analyzed via Kolmogorov Complexity. The result is a mechanism to
understand and improve the performance of active networking and Active
Virtual Network Management Prediction in particular. The Active Virtual
Network Management Prediction mechanism allows information, in various
states of algorithmic and static form, to be transported in the service
of prediction for network management. The results are generally
applicable to algorithmic transmission of information. Kolmogorov
Complexity is used and experimentally validated as a theory describing
the relationship among algorithmic compression, complexity, and
prediction accuracy within an active network. Finally, the paper
concludes with a complexitybased framework for Information Assurance
that attempts to take a holistic view of vulnerability analysis.",
URL="http://www.research.ge.com/~bushsf/ftn",
}

@MISC{Web:GIPS,
AUTHOR="{Global I. P. Sound}",
TITLE="{{GIPS}} Enhanced {{G.711}}",
YEAR=2002,
LANGUAGE="English",
ANNOTE="available at http://www.globalipsound.com/technology.html",
URL="http://www.globalipsound.com/technology.html",
}

@MISC{Corp02:Ibutton,
AUTHOR="{Dallas Semiconductor Corp.}",
TITLE="iButton",
NOTE="http://www.ibutton.com",
YEAR=2002,
LANGUAGE="English",
ABSTRACT="The iButton is a computer chip enclosed in a 16mm stainless
steel can. Because of this unique and durable stainless steel can,
up-to-date information can travel with a person or object anywhere they
go. The steel button can be mounted virtually anywhere because it is
rugged enough to withstand harsh environments, indoors or outdoors. It
is durable enough to attach to a key fob, ring, watch, or other personal
items and used daily for applications such as access control to
buildings and computers.",
URL="http://www.ibutton.com",
}

@TECHREPORT{Triv02:Overcoming,
AUTHOR="Jagruti Trivedi",
TITLE="Overcoming the Limit of Thread Creation",
TYPE="{ACCESS1.SUN.COM} Technical Article",
INSTITUTION="Sun Microsystems",
NOTE="http://access1.sun.com/techarticles/limit.html",
YEAR=2002,
LANGUAGE="English",
KEYWORDS="threads; posix; pthreads; lwp; limit",
ABSTRACT="This Technical Article discusses the limit of thread creation
and the ways to overcome this limit. It will also provide an in-depth
explanation of the internals of thread creation.",
URL="http://access1.sun.com/techarticles/limit.html",
}

@ARTICLE{Zhan02:Fuzzy,
AUTHOR="Runtong Zhang and Yannis A. Phillis",
TITLE="Fuzzy assignment of customers for a parallel queuing system with
two heterogeneous servers",
JOURNAL="Journal of Intelligent and Fuzzy Systems",
YEAR=2002,
ABSTRACT="We consider a queueing network with two parallel heterogeneous
servers. Each server has its own queue and customers arrive at each
queue according to independent Poisson processes. Service times are
independent and exponentially distributed. When a customer arrives at
queue 1, the customer can be transferred to queue 2 by paying an
assignment cost. Each customer in queue pays a holding cost per unit
time. The objective is to dynamically determine the optimal assignment
policy, based on the state of the system, so as to minimize the average
cost. This model has policy implications for computer or communication
networks. In this paper, a novel approach is presented using fuzzy
control to solve the problem. Simulation shows that the approach is
efficient and promising.",
}

@INPROCEEDINGS{Zhan02:Fuzzy,
AUTHOR="Runtong Zhang and Keping Long",
TITLE="A fuzzy approach to the admission control in DiffServ Networks",
BOOKTITLE="2002 International Conference on Fuzzy Systems and Knowledge
Discovery (FSKD'02)",
EDITOR="Saman Halgamuge Lipo Wang and Xin Yao",
ADDRESS="Singapore",
VOLUME=1,
PAGES="305-309",
MONTH="DEC",
YEAR=2002,
ABSTRACT="QoS (Quality of Service) routing is a key network function for
the transmission and distribution of digitized audio/video across
next-generation high-speed networks. It has two objectives: finding
routes that satisfy the QoS constraints and making efficient use of
network resources. The complexity involved in the networks may require
the consideration of multiple constraints to make the routing decision.
In this paper, we propose a novel approach using fuzzy logic technique
to QoS routing that allows multiple constraints to be considered in a
simple and intuitive way. Simulation shows that this fuzzy routing
algorithm is efficient and promising.",
}

@INPROCEEDINGS{Zhan02:Fuzzy,
AUTHOR="Runtong Zhang and Keping Long",
TITLE="A Fuzzy Routing Mechanism in Next-Generation Networks",
BOOKTITLE="IASTED International Conference on Intelligent Systems and
Control (ISC 2002)",
EDITOR="M. H. Hamza",
ADDRESS="Tsukuba City, Japan",
PAGES="86-91",
MONTH="OCT",
YEAR=2002,
ABSTRACT="The basic objectives of future Internet are to increase the
network capacity, to offer practically differentiated services for
traffic with different requirements. These objectives introduce very
strict requirements for traffic control systems and lead to the
establishment of DS concept. However, the new features of DS networks,
where several classes of precedence are allowed, lead the inefficiency
of the congestion control approaches for the existed best-effort
Internet. In this paper, a new admission control approach using fuzzy
logic in the DS domain is presented. Simulation shows that the approach
is efficient and promising.",
URL="http://www.sics.se/~runtong/camera\_ready\_366-26.pdf",
}

@INPROCEEDINGS{Zhan02:Qos,
AUTHOR="Runtong Zhang and Keping Long",
TITLE="{QoS} Issues in Mobile {IP:} Challenges, Requirements and
Solutions",
BOOKTITLE="International Conference on Computer Communications (ICCC
2002)",
EDITOR="Srivatsan Raghavan and S. P. Mudur",
ADDRESS="Mumbai, India",
VOLUME=2,
PAGES="802-812",
MONTH="AUG",
YEAR=2002,
ABSTRACT="Guaranteeing Quality of Service (QoS) in the Internet is a
topic of active research. The technologies that have drawn the most
attention are several different models. IntServ uses the per-flow
approach to provide guarantees to individual streams, DiffServ provides
aggregate assurances for a group of applications, while MPLS tries to
provide the efficiency and simplicity of IP routing together with the
high speed switching of ATM by integrating the label-swapping paradigm
with network layer routing. However, all these models have been designed
to work for fixed Internet so for. There exists an urgent and important
requirement today to study and identify the possible modifications that
need to be made to make them suitable for the coming mobile Internet. In
this paper, we aim to develop a thorough understanding of the unique
opportunities and challenges, problems, requirements and candidate
solutions, that arise in modifying the existing QoS models in order to
enable them to efficiently work in mobile Internet. Some existing work
is outlined as a survey, while some new ideas and proposals are
presented from the research viewpoint.",
URL="http://www.sics.se/~runtong/wr1.pdf",
}

@INPROCEEDINGS{Mars02:Wide,
AUTHOR="Ian Robin Marsh and Fengyi Li",
TITLE="Wide Area Measurements of Voice Over {IP} Quality Revisited",
BOOKTITLE="National Conf. Radio Science (RVK)",
ADDRESS="Stockholm, Sweden",
MONTH="JUN",
YEAR=2002,
ABSTRACT="Time, day, location and instantaneous network conditions
largely dictate the quality of Voice over IP calls. In this paper we
present results of VoIP quality mainly in terms of packet jitter and
loss. This work revisits our objective of measuring VoIP quality in 1999
enabling us to make comparisons with the results we obtained three years
ago. We improved the measurement infra-structure we used previously
through adding new functionality plus using more test sites.
Furthermore, we present findings on the influence of parameters such as
packet size, asymmetry, silence suppression and location as well as much
more comprehensive loss and jitter results. Our results conclude that
the quality of Voice over IP sessions have improved over the last three
years. In spite of this fact however, achieving acceptable
\textsl{global} Voice over IP quality still remains a challenge",
URL="http://www.sics.se/~ianm/Publications/rvk02.pdf",
}

@INPROCEEDINGS{Abra02:TCP,
AUTHOR="Henrik Abrahamsson and Olof Hagsand and Ian Robin Marsh",
TITLE="{TCP} over High Speed Variable Capacity Links: A Simulation Study
for Bandwidth Allocation",
BOOKTITLE="Protocols for High Speed Networks Workshop",
PUBLISHER="Springer",
ADDRESS="Berlin, Germany",
MONTH="APR",
YEAR=2002,
ABSTRACT="New optical network technologies provide opportunities for
fast, controllable bandwidth management. These technologies can now
explicitly provide resources to data paths, creating demand driven
bandwidth reservation across networks where an applications bandwidth
needs can be meet almost \textsl{exactly}. Dynamic synchronous Transfer
Mode (DTM) is a gigabit network technology that provides channels with
dynamically adjustable capacity. TCP is a reliable end-to-end transport
protocol that adapts its rate to the available capacity. Both TCP and
the DTM bandwidth can react to changes in the network load, creating a
complex system with inter-dependent feedback mechanisms. The
contribution of this work is an assessment of a bandwidth allocation
scheme for TCP flows on variable capacity technologies. We have created
a simulation environment using ns-2 and our results indicate that the
allocation of bandwidth maximises TCP throughput for most flows, thus
saving valuable capacity when compared to a scheme such as link
over-provisioning. We highlight one situation where the allocation
scheme might have some deficiencies against the static reservation of
resources, and describe its causes. This type of situation warrants
further investigation to understand how the algorithm can be modified to
achieve performance similar to that of the fixed bandwidth case",
URL="http://www.sics.se/~ianm/Publications/tcpdtm.pdf",
}

@INPROCEEDINGS{Abra02:Multi,
AUTHOR="Henrik Abrahamsson and J. Alonso and Bengt Ahlgren and Anders
Andersson and P. Kreuger",
TITLE="A Multi Path Routing Algorithm for {IP} Networks Based on Flow
Optimisation",
BOOKTITLE="From QoS Provisioning to QoS Charging -- Third COST 263
International Workshop on Quality of Future Internet Services, QofIS
2002 and Second Interntational Workshop on Internet Charging and QoS
Technologies, ICQT 2002",
EDITOR="Burkhard Stiller and Michael Smirnow and Martin Karsten",
PUBLISHER="Springer",
ADDRESS={Z{\"u}rich, Switzerlan},
PAGES="135-144",
NOTE="LNCS 2511",
MONTH="OCT",
YEAR=2002,
ABSTRACT="Intra-domain routing in the Internet normally uses a single
shortest path to forward packets towards a specific destination with no
knowledge of traffic demand. We present an intra-domain routing
algorithm based on multi-commodity flow optimisation which enable load
sensitive forwarding over multiple paths. It is neither constrained by
weight-tuning of legacy routing protocols, such as OSPF, nor requires a
totally new forwarding mechanism, such as MPLS\@. These characteristics
are accomplished by aggregating the traffic flows destined for the same
egress into one commodity in the optimisation and using a hash based
forwarding mechanism. The aggregation also results in a reduction of
computational complexity which makes the algorithm feasible for on-line
load balancing. Another contribution is the optimisation objective
function which allows precise tuning of the tradeoff between load
balancing and total network efficiency",
URL="http://www.sics.se/cna/ipldopt/flowoptarch.pdf",
}

@INPROCEEDINGS{Albe02:Temporal,
AUTHOR="Lars Albertsson",
TITLE="Temporal Debugging and Profiling of Multimedia Applications",
BOOKTITLE="Multimedia Computing and Networking 2002",
EDITOR="Martin Kienzle and Prashant Shenoy",
SERIES="Proceedings of {SPIE}",
VOLUME=4673,
PAGES="196-207",
MONTH="JAN",
YEAR=2002,
ABSTRACT="We present a temporal debugger, capable of examining time flow
of applications in general-purpose computer systems. The debugger is
attached to a complete system simulator, which models an entire
workstation in sufficient detail to run commodity operating systems and
workloads. Unlike traditional debuggers, a debugger operating on a
simulated system does not disturb the timing of the target program,
allowing reproducible experiments and large amounts of instrumentation
and monitoring without intrusion. We have implemented the temporal
debugger by modifying the GNU debugger to operate on applications in a
simulated Linux system. Debugger implementation is difficult because the
debugger expects application-related data, whereas the simulator
provides low-level data. We introduce a technique, virtual machine
translation, for mapping simulator data to the debugger by parsing
operating system data structures in the simulated system. The debugger
environment allows collection of performance statistics from multiple
abstraction levels: hardware, operating system, and application level.
We show how this data can be used to profile quality of service
performance of a video decoder. The debugger is used to detect display
jitter, and by correlating runtime statistics to image rendering time,
we expose deviations when the application is unable to render an image
in time, thereby locating the cause of the display jitter.",
URL="http://www.sics.se/~lalle/publications/multimedia\_applications.pdf",
}

@TECHREPORT{Alonso:Obj,
AUTHOR="J. Alonso and Henrik Abrahamsson and Bengt Ahlgren and Anders
Andersson and P. Kreuger",
TITLE="Objective functions for balance in traffic engineering",
INSTITUTION="SICS -- Swedish Institute of Computer Science",
NUMBER="T2002:05",
MONTH="MAY",
YEAR=2002,
ABSTRACT="We prove a result concerning objective functions that can be
used to obtain efficient and balanced solutions to the multi-commodity
network flow problem. This type of solution is of interest when routing
traffic in the Internet. A particular case of the result proved here
(see Corollary 2 below) was stated without proof in a previous paper.",
URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-T--2002-05--SE.pdf",
}

@TECHREPORT{Borg:elphant-flows,
AUTHOR="Cecilia Borg",
TITLE="Existence, Identification and Stability of Elephant flows in {IP}
Traffic",
INSTITUTION="SICS -- Swedish Institute of Computer Science",
NUMBER="T2002:13",
NOTE="Master thesis",
MONTH="AUG",
YEAR=2002,
ABSTRACT="Traffic on the Internet today is routed on the shortest path
to the destination. This is considered as the quickest path but if
traffic congestion occurs on the route, packets are dropped and the
traffic slows down due to the retransmission of the missing packets. If
the network resources could be more evenly utilised, some congestions
could be avoided and the problem with retransmissions could be reduced.
In order to balance the load evenly over a network, the load variation
has to be known and predictable. Other studies of IP traffic have shown
that a small number of flows carry the main part of the network traffic,
these flows are referred to as elephants. This property is studied in
this report and the stability of these flows is examined. By aggregating
with respect to the source and destination network of the traffic,
individual flows are easily identified. This report also discusses how
to identify the large flows during runtime in order to use their
properties when calculating the stability for the future traffic demand.
The traffic prediction is based on analysis of logged Internet traffic.
The report concludes that the phenomenon with elephant and mice flows
can be observed when aggregating traffic artificially by different
lengths of their network prefixes. When calculating future stability of
flows the network aggregation does not have a major impact.",
URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-T--2002-13--SE.pdf",
}

@TECHREPORT{Feen02:Asynchronous,
AUTHOR="Laura Feeney",
TITLE="An Asynchronous Power Save Protocol for Wireless Ad Hoc
Networks",
INSTITUTION="SICS -- Swedish Institute of Computer Science",
NUMBER="T2002:09",
NOTE="revised version February, 2003",
MONTH="JUL",
YEAR=2002,
ABSTRACT="This report describes a power save protocol for ad hoc
networks. The protocol is largely independent of the details of the
underlying MAC and is friendly toward any overlying energy-aware ad hoc
routing. A key advantage is that the protocol is fully asynchronous.
Neighbors that wish to communicate estimate the relative phase
difference between their sleep/wake cycles. A station uses this phase
information to order its pending transmissions to use the available
periods of overlap most efficiently. Stations can also adjust their
phase relationships to avoid contention and and reduce latency for delay
sensitive flows. The proposed protocol is defined in considerable detail
and it is argued that the protocol is likely to exhibit good energy
savings as well as acceptable network performance. The proposed protocol
is also carefully distinguished from related work in this area. Based on
these arguments, it is recommended that work continue to implement the
proposed protocol in a fully featured simulation environment and more
carefully study its effectiveness.",
URL="http://www.sics.se/~lmfeeney/publications/feeney03T2002\_9.pdf",
}

@INPROCEEDINGS{Feen02:Spontnet,
AUTHOR="Laura Feeney and Bengt Ahlgren and Assar Westerlund and Adam
Dunkels",
TITLE="Spontnet: Experiences in Configuring and Securing Small Ad Hoc
Networks",
BOOKTITLE="of The Fifth International Workshop on Network
Applicances({IWNA5})",
ADDRESS="Liverpool, UK",
MONTH="OCT",
YEAR=2002,
ABSTRACT="In contrast with work focusing on routing problems in mobile
ad hoc networks, this work addresses the problem of system configuration
in such networks. In particular, we are interested in ways to
instantiate the configuration infrastructure -- naming, addressing,
authentication, and key distribution -- needed to establish
small-to-medium scale ad hoc networks supporting collaborative
applications. We argue that, in such spontaneous networks,much of the
necessary infrastructure can be derived from the face-to-face human
interactions that these networks are intended to facilitate. This
approach has the additional advantage of being intuitive for the
non-expert user.",
URL="http://www.sics.se/~lmfeeney/publications/feeney02spontnet.pdf",
}

@INPROCEEDINGS{Fee:qos-aware-power,
AUTHOR="Laura Feeney",
TITLE="A {QoS} Aware Power Save Protocol for Wireless Ad Hoc Networks",
BOOKTITLE="First Mediterranean Workshop on Ad Hoc Networks({Med-Hoc Net
2002})",
ADDRESS="Sardenga, Italy",
MONTH="SEP",
YEAR=2002,
ABSTRACT="This paper describes a power save protocol for ad hoc
networks. The protocol is largely independent of the details of the
underlying MAC and friendly toward any overlying energy-aware ad hoc
routing. A key advantage of the protocol is that it is fully
asynchronous. Each station independently establishes a periodic
sleep/wake cycle. Neighbors that wish to communicate estimate the
relative phase difference between their sleep/wake cycles. A station
uses this phase information to order its pending transmissions so as to
maximize value with respect to some QoS function. A station can also
adjust its phase relationships to avoid contention and increase
effective bandwidth available to a flow, as well as reduce latency.",
URL="http://www.sics.se/~lmfeeney/publications/feeney02qosaware.pdf",
}

@TECHREPORT{Hags02:Sicsophone,
AUTHOR="Olof Hagsand and Ian Robin Marsh and Kjell Hanson",
TITLE="Sicsophone: A Low-Delay {Internet} Telephony Tool",
INSTITUTION="SICS -- Swedish Institute of Computer Science",
NUMBER="T2002:26",
MONTH="DEC",
YEAR=2002,
ABSTRACT="The end to end delay is a critical factor in the perceived
quality of service for Voice over IP applications. The described
solution is a complete system-level platform and complements QoS work in
the network and application areas. We describe a VoIP system that
couples the low level features of audio hardware with a jitter buffer
playout algorithm. Using the sound card directly eliminates intermediate
buffering as well as providing fine control over timers needed by a soft
real-time application such as VoIP. A statistical based approach for
inserting packets into audio buffers is used in conjunction with a
scheme for inhibiting unnecessary fluctuations in the system. We give
comparisons for the performance of the playout algorithm against
idealised playout conditions. We also present mouth to ear delay
measurements for selected VoIP applications and show that several
hundreds of milliseconds can be saved by using the techniques described
in this paper. A prototype for both UNIX and Windows platforms (NT and
9X) has been implemented, demonstrating that our system adapts to
network conditions whilst maintaining low delays.",
URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-T--2002-26--SE.pdf",
}

@INPROCEEDINGS{Mars02:Voip,
AUTHOR="Ian Robin Marsh and Fengyi Li",
TITLE="A {VoIP} Measurement Infra-structure",
BOOKTITLE="16th Nordic Teletraffic Seminar",
ADDRESS="Helsinki, Finland",
MONTH="AUG",
YEAR=2002,
ABSTRACT="Time, day, location and instantaneous network conditions
largely dictate the quality of Voice over IP calls. In this paper we
describe a VoIP measurement infrastructure to measure the delay, loss
and jitter of simulated phone calls on the Internet. We measure the
quality by transmitting a simulated voice call between chosen sites and
carefully recording the subsequent packet arrivals at the receiver. We
have gathered more than 25,000 sample VoIP sessions from nine global
sites. This is our second and more detailed attempt at measuring VoIP
quality. This second phase has also focused on the effects of packet
size, network asymmetry and silence suppression on measuring jitter,
delay and loss. We have made the sessions and tools available for future
investigations. Generally the quality of VoIP is excellent within the US
and Europe and has improved since our last measurements. Finally this
paper concludes with what we have learnt from two efforts of measuring
VoIP quality on Wide Area Networks.",
URL="http://www.sics.se/~ianm/Publications/nts16.pdf",
}

@PHDTHESIS{Voigt:phdthesis,
AUTHOR="Thiemo Voigt",
TITLE="Architectures for Service Differentiation in Overloaded
{Internet} Servers",
SCHOOL="Uppsala University",
ADDRESS="Uppsala, Sweden",
NOTE="DoCS 02/119, ISSN 0283-0574. Also as SICS Dissertation Series 30,
ISSN 1101-1335",
MONTH="MAY",
YEAR=2002,
}

@TECHREPORT{Voigt:docstech02,
AUTHOR="Andy Bavier and Thiemo Voigt and Mike Wawrzoniak and Larry
Peterson and Per Gunningberg",
TITLE="{SILK:} Scout Paths in the Linux Kernel",
INSTITUTION="Dept. of Information Technology, Uppsala University",
NUMBER="2002--009",
MONTH="FEB",
YEAR=2002,
}

@INPROCEEDINGS{Nesa02:Manetconf,
AUTHOR="Sanket Nesargi and Ravi Prakash",
TITLE="{MANETconf:} Configuration of Hosts in a Mobile Ad Hoc Network",
BOOKTITLE="IEEE INFOCOM",
YEAR=2002,
}

@INPROCEEDINGS{Fran02:Delivery,
AUTHOR="Matthias Frank and Hong-Yon Lach and Marc Vorwerk and Michael
Wolf",
TITLE="Delivery of {IP} Services to Vehicles -- the Path to
{OverDRiVE}",
BOOKTITLE="IST Summit",
YEAR=2002,
}

@INPROCEEDINGS{Kong02:Adaptive,
AUTHOR="Jiejun Kong and Kaixin Luo Haiyun andXu and Daniel Lihui Gu and
Mario Gerla and Songwu Lu",
TITLE="Adaptive Security for Multi-layer Ad-hoc Networks",
BOOKTITLE="Special Issue of Wireless Communications and Mobile
Computing",
EDITOR="John Wiley InterScience Press",
YEAR=2002,
}

@INPROCEEDINGS{Yi02:Security,
AUTHOR="Seung Yi and Prasad Naldurg and Robin Kravets",
TITLE="A Security-Aware Routing Protocol for Wireless Ad Hoc Networks",
BOOKTITLE="The 6th World Multi-Conference on Systemics, Cybernetics and
Informatics, SCI 2002",
YEAR=2002,
}

@ARTICLE{Lope02:Evaluation,
AUTHOR="A. Lopez and Jukka M J Manner and Andrej Mihailovic and Hector
Velayos and E. Hepworth and Y. Khouaja",
TITLE="Evaluation of Mobility and {QoS} Interactions",
JOURNAL="Computer Networks, The International Journal of Computer and
Telecommunications Networking",
VOLUME=38,
NUMBER=2,
PAGES="137-163",
YEAR=2002,
}

@ARTICLE{Beld02:Hierarchical,
AUTHOR="Elizabeth Belding-Royer",
TITLE="Hierarchical Routing in Ad hoc Mobile Networks",
JOURNAL="Wireless Communications and Mobile Computing",
YEAR=2002,
}

@ARTICLE{Sun02:Internet,
AUTHOR="Yuan Sun and Elizabeth Belding-Royer and Charles E. Perkins",
TITLE="{Internet} Connectivity for Ad Hoc Mobile Networks",
JOURNAL="Internation Journal of Wireless Information Networks special
issue on Mobile Ad hoc Networks",
YEAR=2002,
}

@ARTICLE{Lee02:Scalability,
AUTHOR="Sung-Ju Lee and Elizabeth M. Royer and Charles E. Perkins",
TITLE="Scalability Study of the Ad hoc On-Demand Distance Vector Routing
Protocol",
JOURNAL="International Journal on Network Management",
YEAR=2002,
}

@ARTICLE{Roye02:Transmission,
AUTHOR="Elizabeth M. Royer and Charles E. Perkins",
TITLE="Transmission Range Effects on {AODV} Multicast Communication",
JOURNAL="ACM Mobile Networks and Applications special issue on
Multipoint Communications in Wireless Mobile Networks",
YEAR=2002,
}

@MISC{Aror02:Simulation,
AUTHOR="Harpreet Arora and Harish Sethu",
TITLE="A Simulation Study of the Feasibility of Differentiated Services
Framework for {QoS} in Mobile Ad Hoc Networks",
HOWPUBLISHED="Drexel University",
NOTE="http://www.cs.man.ac.uk/\~tapselj0/paper2.pdf, accessed July 15
200",
YEAR=2002,
}

@INPROCEEDINGS{BasagniP02,
AUTHOR="Stefano Basagni and Chiara Petrioli",
TITLE="A Scatternet Formation Protocol for Ad hoc Networks of Bluetooth
Devices",
BOOKTITLE="IEEE Semiannual Vehicular Technology Conference, VTC Spring
2002",
ADDRESS="Birmingham, AL",
MONTH="May 6--9",
YEAR=2002,
}

@INPROCEEDINGS{PetrioliB02,
AUTHOR="Chiara Petrioli and Stefano Basagni",
TITLE="Degree-Constrained Multihop Scatternet Formation for Bluetooth
Networks",
BOOKTITLE="IEEE Globecom 2002",
ADDRESS="Taipei, Taiwan, R.O.C.",
MONTH="November 17--21",
YEAR=2002,
}

@MASTERSTHESIS{Lund02:Ad,
AUTHOR="David Lundberg",
TITLE="Ad hoc Protocol Evaluation and Experiences of Real World Ad Hoc
Networking Experiments",
SCHOOL="Department of Information Technology, Uppsala Univerrsity",
NOTE="http://user.it.uu.se/\~davidlu/thesis.pdf accessed August 200",
YEAR=2002,
}

@INPROCEEDINGS{Guo02:Performance,
AUTHOR="Song Guo and Oliver Yang",
TITLE="Performance of Backup Source Routing {(BSR)} in Mobile Ad Hoc
Networks",
BOOKTITLE="IEEE Wireless Networking Conference",
PAGES="440-444",
YEAR=2002,
}

@INPROCEEDINGS{Nika02:Quality,
AUTHOR="Navid Nikaein and Christian Bonnet and Yan Moret and Idris Rai",
TITLE="Quality of Service Routing Model for Mobile Ad hoc Networks",
BOOKTITLE="6th World Multiconference on Systemics, Cybernetics and
Informatics, SCI",
ADDRESS="Orlando, Florida, USA",
YEAR=2002,
}

@INPROCEEDINGS{Nika02:ALM,
AUTHOR="Navid Nikaein and Christian Bonnet",
TITLE="{ALM} - Adaptive Location Management Model Incorporating Fuzzy
Logic for Mobile Ad Hoc Networks",
BOOKTITLE="First Annual Mediterranean Ad Hoc Networking Workshop,
MED-HOC",
ADDRESS="Sardegna, Italy",
YEAR=2002,
}

@INPROCEEDINGS{Jian02:Review,
AUTHOR="Xia Jiang and Tracy Camp",
TITLE="A Review of Geocasting Protocols for a Mobile Ad Hoc Network",
BOOKTITLE="Grace Hoppe Celebration, GHC",
YEAR=2002,
}

@ARTICLE{Camp02:Adaptive,
AUTHOR="Tracy Camp and Yolanda Liu",
TITLE="An Adaptive Mesh-based Protocol for Geocast Routing",
JOURNAL="Journal of Parallel and Distributed Computing: Special Issue on
Mobile Ad-hoc Networking and Computing",
YEAR=2002,
}

@INPROCEEDINGS{Jian02:Multicasting,
AUTHOR="Hai Jiang and ShiXin Cheng and Yongmin He and Bo Sun",
TITLE="Multicasting Along Energy-efficient Meshes in Mobile Ad Hoc
Networks",
BOOKTITLE="IEEE Wireless Communications and Networking Conference",
VOLUME=2,
PAGES="807-811",
YEAR=2002,
}

@INPROCEEDINGS{Chen02:Enhancement,
AUTHOR="Ling Chen and Kaining Lu and Zhigang Jin and Bing Liang",
TITLE="Enhancement of the On-Demand Multicast Routing Protocol in the Ad
Hoc Network",
BOOKTITLE="IEEE Canadian Conference on Electrical and Computer
Engineering",
VOLUME=3,
PAGES="1511-1515",
YEAR=2002,
}

@INPROCEEDINGS{Hu02:SEAD,
AUTHOR="Yih-Chun Hu and David B. Johnson and Adrian Perrig",
TITLE="{SEAD:} Secure Efficient Distance Vector Routing for Mobile
Wireless Ad Hoc Networks",
BOOKTITLE="Fourth IEEE Workshop on Mobile Computing Sustems and
Applications",
PAGES="3-13",
YEAR=2002,
}

@INPROCEEDINGS{Buch02:Nodes,
AUTHOR="Sonja Buchegger and Jean-Yves Le Boudec",
TITLE="Nodes Bearing Grudges: Towards Routing Security, Fairness and
Robustness in Mobile Ad Hoc Networks",
BOOKTITLE="Tenth Euromicro Workshop on Parallel, Distributed and
Network-based Processing",
YEAR=2002,
}

@INPROCEEDINGS{Buch02:Performance,
AUTHOR="Sonja Buchegger and Jean-Yves Le Boudec",
TITLE="Performance Analysis of the {CONFIDANT} Protocol (Cooperation Of
Nodes: Fairness In Dynamic Ad-hoc NeTworks)",
BOOKTITLE="IEEE/ACM Symposium on Mobile Ad Hoc Networking and Computing,
MobiHOC",
YEAR=2002,
}

@ARTICLE{Noel02:Multicast,
AUTHOR="Thomas Noel and Jean-Jacques Pansiot",
TITLE="A Multicast Architecture for Mobile Nodes",
JOURNAL="International Journal of Computer and Information Science",
VOLUME=3,
NUMBER=2,
YEAR=2002,
}

@MASTERSTHESIS{Shi02:Supporting,
AUTHOR="Xiaolei Shi",
TITLE="Supporting {IP} Multicast Streaming for Mobile Ad Hoc Stations",
SCHOOL="University Ulm, Germany",
YEAR=2002,
}

@INPROCEEDINGS{Papa02:Path,
AUTHOR="Panagiotis Papadimitratos and Zygmunt J. Haas and E. Gun Sirer",
TITLE="Path Set Selection in Mobile Ad Hoc Networks",
BOOKTITLE="Third ACM International Symposium on Mobile Ad Hoc Networking
and Computing, Mobihoc 2002",
PAGES="1-11",
YEAR=2002,
}

@INPROCEEDINGS{Mari02:Routing,
AUTHOR="Mahesh K. Marina and Samir Das",
TITLE="Routing Performance in the Presence of Unidirectional Links in
Multihop Wireless Networks",
BOOKTITLE="Third ACM International Symposium on Mobile Ad Hoc Networking
and Computing, Mobihoc 2002",
PAGES="12-23",
YEAR=2002,
}

@INPROCEEDINGS{Das02:Dynamic,
AUTHOR="Subir Das and B.S Manoj and Chandra Murthy",
TITLE="A Dynamic Core Based Multicast Routing Protocol for Ad Hoc
Wireless Networks",
BOOKTITLE="Third ACM International Symposium on Mobile Ad Hoc Networking
and Computing, Mobihoc 2002",
PAGES="24-35",
YEAR=2002,
}

@INPROCEEDINGS{Zhan02:Integrated,
AUTHOR="Yongguang Zhang and Wei Li",
TITLE="An Integrated Environment for Testing Mobile Ad-Hoc Networks",
BOOKTITLE="Third ACM International Symposium on Mobile Ad Hoc Networking
and Computing, Mobihoc 2002",
PAGES="104-111",
YEAR=2002,
}

@INPROCEEDINGS{Alzo02:Message,
AUTHOR="Khaled Alzoubi and Peng-Jun Wan and Ophir Frieder",
TITLE="Message-Optimal Connected Dominating Sets in Mobile Ad Hoc
Networks",
BOOKTITLE="Third ACM International Symposium on Mobile Ad Hoc Networking
and Computing, Mobihoc 2002",
PAGES="157-164",
YEAR=2002,
}

@INPROCEEDINGS{Will02:Comparison,
AUTHOR="Brad Williams and Tracy Camp",
TITLE="Comparison of Broadcasting Techniques for Mobile Ad Hoc
Networks",
BOOKTITLE="Third ACM International Symposium on Mobile Ad Hoc Networking
and Computing, Mobihoc 2002",
PAGES="194-205",
YEAR=2002,
}

@INPROCEEDINGS{Vaid02:Weak,
AUTHOR="Nitin Vaidya",
TITLE="Weak Duplicate Address Detection in Mobile Ad Hoc Networks",
BOOKTITLE="Third ACM International Symposium on Mobile Ad Hoc Networking
and Computing, Mobihoc 2002",
PAGES="206-216",
YEAR=2002,
}

@INPROCEEDINGS{Wang02:Improving,
AUTHOR="Feng Wang and Yongguang Zhang",
TITLE="Improving {TCP} Performance over Mobile Ad-Hoc Networks with
Out-of-Order Detection and Response",
BOOKTITLE="Third ACM International Symposium on Mobile Ad Hoc Networking
and Computing, Mobihoc 2002",
PAGES="217-225",
YEAR=2002,
}

@INPROCEEDINGS{Fleu02:Service,
AUTHOR="Eric Fleury and Hend Koubaa",
TITLE="Service Location Protocol Overhead in the Random Graph Model for
Ad Hoc Networks",
BOOKTITLE="Seventh International Symposium on Computer and
Communications, ISCC 2002",
PAGES="49-54",
YEAR=2002,
}

@INPROCEEDINGS{Jelg02:Multipoint,
AUTHOR="Christophe Jelger",
TITLE="Multipoint et Mobilite: Optimisations pour {IPv6}",
BOOKTITLE="Quatriemes Rencontres Francophones sur les Aspects
Algorithmiques des Telecommunications, Algotel'02",
ADDRESS="Meze, France",
MONTH="Mai",
YEAR=2002,
}

@ARTICLE{Basa02:Special,
AUTHOR="Stefano Basagni and Sung-Ju Lee",
TITLE="Special Issue: Mobile Ad Hoc Networking - Research, Trends and
Applications",
JOURNAL="Wireless Communications and Mobile Computing",
VOLUME=2,
NUMBER=5,
YEAR=2002,
}

@ARTICLE{Ephr02:Ad,
AUTHOR="Anthony Ephremides",
TITLE="Ad Hoc Networks: Not an Ad Hoc Field Anymore",
JOURNAL="Wireless Communications and Mobile Computing",
VOLUME=2,
NUMBER=5,
YEAR=2002,
}

@ARTICLE{Perk02:Internet,
AUTHOR="Charles E. Perkins and Jari Malinen and Ryuji Wakikawa and
Anders Nilsson and Antti J. Tuominen",
TITLE="{Internet} Connectivity for Mobile Ad Hoc Networks",
JOURNAL="Wireless Communications and Mobile Computing",
VOLUME=2,
NUMBER=5,
YEAR=2002,
}

@ARTICLE{Camp02:Survey,
AUTHOR="Tracy Camp and Jeff Boleng and Vanessa Davies",
TITLE="A Survey of Mobility Models for Ad Hoc Networks Research",
JOURNAL="Wireless Communications and Mobile Computing",
VOLUME=2,
NUMBER=5,
YEAR=2002,
}

@ARTICLE{Perk02:Survey,
AUTHOR="Dmitri Perkins and Herman Hughes",
TITLE="A Survey on Quality-of-Service Support for Mobile Ad Hoc
Networks",
JOURNAL="Wireless Communications and Mobile Computing",
VOLUME=2,
NUMBER=5,
YEAR=2002,
}

@ARTICLE{Kong02:Adaptive,
AUTHOR="Jiejun Kong and Haiyun Luo and Kaixin Xu and Daniel Lihui Gu and
Mario Gerla and Songwu Lu",
TITLE="Adaptive Security for Multilevel Ad Hoc Networks",
JOURNAL="Wireless Communications and Mobile Computing",
VOLUME=2,
NUMBER=5,
YEAR=2002,
}

@INPROCEEDINGS{Sult02:Migratory,
AUTHOR="Florin Sultan and Kiran Srinivasan and Deepa Iyer and Liviu
Iftode",
TITLE="Migratory {TCP:} Connection Migration for Service Continuity in
the {Internet}",
BOOKTITLE="ICDCS 2002",
YEAR=2002,
}

@INPROCEEDINGS{Dahi02:Secure,
AUTHOR="Bridget Dahill and Kimaya Sazgiri and Brian N Levine and
Elizabeth Belding-Royer and Clay Shields",
TITLE="A Secure Routing Protocol for Ad Hoc Networks",
BOOKTITLE="10th Conference on Network Protocols",
YEAR=2002,
}

@INBOOK{Tsen02:Handbook,
AUTHOR="Yu-Chee Tseng and Wei-Kuo Liao and S. Felix Wu",
TITLE="Handbook of Wireless Networks and Mobile Computing",
EDITOR="Ivan Stojmenovic",
CHAPTER="Location Updates for Efficient Routing in Ad Hoc Networks",
PUBLISHER="Wiley",
PAGES="451-471",
YEAR=2002,
}

@INPROCEEDINGS{Albe02:Security,
AUTHOR="P. Albers and O. Camp",
TITLE="Security in Ad Hoc Networks: A General Intrusion Detection
Architecture Enhancing Trust Based Approaches",
BOOKTITLE="First International Workshop on Wireless Information Systems,
4th International Conference on Enterprise Information Systems",
YEAR=2002,
}

@ARTICLE{Venk02:Strategies,
AUTHOR="Lakshmi Venkatraman and Dakshi Agrawal",
TITLE="Strategies for Enhancing Routing Security in Protocols for Mobile
Ad Hoc Networks",
JOURNAL="Journal on Parallel and Distributed Computing",
YEAR=2002,
}

@INPROCEEDINGS{Pagt02:Performance,
AUTHOR="Theodoros Pagtzis and Charles E. Perkins",
TITLE="Performance Issues for Localized {IP} Mobility Management",
BOOKTITLE="10th International Conference on Networks, ICON 2002",
PAGES="211-216",
YEAR=2002,
}

@INPROCEEDINGS{Pagt02:Model,
AUTHOR="Theodoros Pagtzis and Peter Kirstein",
TITLE="A Model for Proactive Seamless {IP} Mobility and Mobility-hop
Routing",
BOOKTITLE="10th International Conference on Networks, ICON 2002",
PAGES="217-222",
YEAR=2002,
}

@INPROCEEDINGS{Lin02:Dynamic,
AUTHOR="Tao Lin and Scott Midkiff and Jahng Park",
TITLE="A Dynamic Topology Switch for the Emulation of Wireless Mobile Ad
Hoc Networks",
BOOKTITLE="WLN 2002",
ADDRESS="Authors with Virginia Polytechnic Institute",
NOTE="Accessed November 15th at
http://io.irean.vt.edu/\~tlin/WLN2002\\_A103\\_Lin\\_Midkiff\\_Par",
YEAR=2002,
}

@PHDTHESIS{Khou02:Une,
AUTHOR="Youssef Khouaja",
TITLE="Une Methode de Controle par le Reseau Appliquee a la Gestion
Hierarchique de la Mobilite {IPv6}",
SCHOOL="Informatique, Traitement du Signal et Telecommunications,
Institut de Formation en Informatique et Communication",
ADDRESS="Rennes, France",
YEAR=2002,
}

@ARTICLE{Pagt02:Proactive,
AUTHOR="Theodoros Pagtzis and Peter Kirstein and Stephen Hailes",
TITLE="Proactive Seamless Mobility Management for Future {IP} Radio
Access Networks",
JOURNAL="Journal of Computer Communications Special Issue on 3G Wireless
and Beyond",
MONTH="Fall",
YEAR=2002,
}

@ARTICLE{Romd02:IP,
AUTHOR="Imed Romdhani and Mounir Kellil and Hong-Yon Lach and
Abdelmadjid Bouabdallah and Hatem Bettaher",
TITLE="{IP} Mobile Multicast: Challenges, Solutions and Open Issues",
JOURNAL="IEEE Transactions on Mobile Computing",
MONTH="Submitted October 2002",
YEAR=2002,
}

@ARTICLE{Habe02:Fuzzy,
AUTHOR="J. Habetha and B. Walke",
TITLE="Fuzzy rule-based mobility and load management for self-organizing
wireless networks",
JOURNAL="Journal of Wireless Information Networks, Special Issue on
Mobile Ad Hoc Networks (MANETs): Standards, Research, Applications",
VOLUME=9,
NUMBER=2,
PAGES="119-140",
YEAR=2002,
URL="AccessedFebruary2003athttp://www.comnets.rwth-aachen.de/cnroot\_engl.html",
}

@ARTICLE{Lin02:Scalable,
AUTHOR="Chunhung Lin",
TITLE="Scalable Multicast Protocol in {IP-based} Mobile Networks",
JOURNAL=wln,
VOLUME=8,
PAGES="27-36",
YEAR=2002,
}

@TECHREPORT{Dhar02:INORA,
AUTHOR="D. Dharmaraju and A. Roy-Chowdury and P. Hovareshti and John S.
Baras",
TITLE="{INORA} - A Unified Signaling and Routing Protocol in Mobile
AdHoc Networks",
TYPE="Technical Research Report",
INSTITUTION="Center for Satellite and Hybrid Communication Networks,
University of Maryland",
NUMBER="CSHCN TR 2002-18, ISR TR 2002-33",
YEAR=2002,
URL="{http://bellatrix.isr.umd.edu/TechReports/CSHCN/2002/CSHCN\_TR\_2002-18/CSHCN\_TR\_2002-18.pdfaccessedMarch2003}",
}

@INPROCEEDINGS{Camp02:Performance,
AUTHOR="Tracy Camp and Jeff Boleng and Brad Williams and Lucas Wilcox
and William Navidi",
TITLE="Performance Comparison of Two Location Based Routing Protocols
for Ad Hoc Networks",
BOOKTITLE="IEEE INFOCOM",
YEAR=2002,
}

@INPROCEEDINGS{Haas02:Gossip,
AUTHOR="Zygmunt J. Haas and Joseph Halpern and Lianyuan Li",
TITLE="Gossip-based Ad Hoc Routing",
BOOKTITLE="IEEE INFOCOM",
YEAR=2002,
}

@INPROCEEDINGS{Rama02:Routing,
AUTHOR="Ramu Ramamurthy and Jean-Francois Labourdette and Sid Chaudhuri
and Raphael Levy and Pambos Charalambous and Chad Dennis",
TITLE="Routing Lightpaths in Optical Mesh Networks with Express Links",
BOOKTITLE="Opical Fiber Communications (OFC)",
ORGANIZATION="IEEE",
YEAR=2002,
LANGUAGE="English",
ABSTRACT="We examine the routing of shared-mesh protected lightpaths in
optical networks with express links. Express links are modeled using
Shared Risk Groups, and the performance of different cost settings for
express links are studied.",
URL="http://www-ee.engr.ccny.cuny.edu/www/web/ellinas/ExpressLinks\_OFC2002.pdf",
}

@ARTICLE{Elli02:Restoration,
AUTHOR="Georgios Ellinas and Eric Bouillet and Ramu Ramamurthy and
Jean-Francois Labourdette and Sid Chaudhuri",
TITLE="Restoration in Layered Architectures with a {WDM} Mesh Optical
Layer",
JOURNAL="Annual Review of Communications for the International
Engineering Consortium (IEC)",
YEAR=2002,
LANGUAGE="English",
URL="http://www-ee.engr.ccny.cuny.edu/www/web/ellinas/IEC\_Ellinas.pdf",
}

@INPROCEEDINGS{Akya02:Reliability,
AUTHOR="Ahmet A. Akyamaç and Sudipta Sengupta and Jean-François
Labourdette and Sid Chaudhuri and Stephen French",
TITLE="Reliability in Single Domain vs. Multi Domain Optical Mesh
Networks",
BOOKTITLE="NFOEC",
YEAR=2002,
LANGUAGE="English",
ABSTRACT="Network reliability is an important element of a service level
agreement and is typically evaluated based on  the  number  of 
unavailable  minutes  per  year.  The  widespread belief  is  that 
networks  with  faster restoration times are more reliable, created by
the assumption that fast restoration from a failure leads to smaller
down time. This is not necessarily the case since it has been shown that
reliability may have little to do with the restoration speed when the
restoration time is small compared to the mean time to repair of the
failed elements. In this paper, we compare the reliability of optical
mesh networks with multi domain restoration  and  single  domain 
restoration  using  both  dedicated mesh protection  and  shared  mesh
restoration, and show that splitting a network into multiple domains
increases the overall reliability.",
}

@PROCEEDINGS{Boud02:MPLS,
AUTHOR="Ali Boudani and Bernard Cousin",
TITLE="{MPLS}",
YEAR=2002,
LANGUAGE="English",
}

@TECHREPORT{Genn02:Evolution,
AUTHOR="J. Gennari and Mark A. Musen and R. W. Fergerson and W. E.
Grosso and M. Crubézy and H. Eriksson and N. F. Noy and S.-C. Tu",
TITLE="Evolution of Protégé: An Environment for Knowledge-Based Systems
Development",
INSTITUTION="Stanford University",
YEAR=2002,
LANGUAGE="English",
ABSTRACT="The Protégé project has come a long way since Mark Musen first
built the Protégé metatool for knowledge-based systems in 1987. The
original tool was a small application, aimed at building
knowledge-acquisition tools for a few specialized programs in medical
planning. From this initial tool, the Protégé system has evolved into a
durable, ex-tensible platform for knowledge-based systems development
and research. The current version, Protégé-2000, can be run on a variety
of platforms, supports customized user-interface extensions,
incorporates the Open Knowledge Base Connectivity (OKBC) knowledge
model, interacts with standard storage formats such as relational
databases, XML, and RDF, and has been used by hundreds of individuals
and research groups. In this paper, we follow the evolution of the
Protégé project through 3 distinct re-implementations. We describe our
overall methodology, our design decisions, and the lessons we have
learned over the duration of the project. We believe that our success is
one of infra-structure: Protégé is a flexible, well-supported, and
robust development environment. Using Protégé, developers and domain
experts can easily build effective knowledge-based systems, and
researchers can explore ideas in a variety of knowledge-based domains.",
}

@ARTICLE{Yuen02:Optimal,
AUTHOR="Wing Ho Yuen and Chi Wan Sung and Wing Wong",
TITLE="Optimal Price Decrement Strategy for {Internet} Based Dutch
Auctions",
JOURNAL="Communications in Information and Systems",
NOTE="Volume 2, Number 4, Dec 2002",
YEAR=2002,
LANGUAGE="English",
}

@INPROCEEDINGS{Schu0207:Emergency,
AUTHOR="Henning Schulzrinne and Knarig Arabshian",
TITLE="Emergency calls and notifications",
BOOKTITLE="ITCom",
ADDRESS="Boston, Massachusetts",
DAYS=29,
MONTH="July/August",
YEAR=2002,
}

@TECHREPORT{Mori0201:Analysis,
AUTHOR="Tatsuya Mori and Ryoichi Kawahara and Shozo Naito",
TITLE="Analysis of Non-Gaussian Nature of Network Traffic",
TYPE="technical report",
INSTITUTION="arXiv",
NUMBER="cs/0201004",
NOTE="IEICE General Conference 2002, Tokyo, Japan, March 2002",
MONTH=jan,
YEAR=2002,
KEYWORDS="Networking and Internet Architecture",
ABSTRACT="To study mechanisms that cause the non-Gaussian nature of
network traffic, we analyzed IP flow statistics.  For greedy flows in
particular, we investigated the hop counts between source and
destination nodes, and classified applications by the port number.  We
found that the main flows contributing to the non-Gaussian nature of
network traffic were HTTP flows with relatively small hop counts
compared with the average hop counts of all flows.",
URL="http://arXiv.org/abs/cs/0201004",
}

@ARTICLE{Blan0201:Making,
AUTHOR="Ethan Blanton and Mark Allman",
TITLE="On Making {TCP} More Robust to Packet Reordering",
JOURNAL=ccr,
VOLUME=32,
NUMBER=1,
MONTH=jan,
YEAR=2002,
ABSTRACT="Previous research indicates that packet reordering is not a
rare event on some Internet paths.  Reordering can cause performance
problems for TCP's fast retransmission algorithm, which uses the arrival
of duplicate acknowledgments to detect segment loss.  Duplicate
acknowledgments can be caused by the loss of a segment or by the
reordering of segments by the network.  In this paper we illustrate the
impact of reordering on TCP performance.  In addition, we show the
performance of a conservative approach to ``undo'' the congestion
control state changes made in conjunction with spurious retransmissions.
Finally, we propose several alternatives to dynamically make the fast
retransmission algorithm more tolerant of the reordering observed in the
network and assess these algorithms.",
URL="http://roland.grc.nasa.gov/~mallman/papers/tcp-reorder-ccr.ps",
}

@ARTICLE{Vill0201:Wireless,
AUTHOR="Luis Villasenor and Sophia Tsakiridou and Luis Orozco-Barbosa
and Louise Lamont",
TITLE="Performance analysis of wireless {ATM/AAL2} over a burst error
channel",
JOURNAL=comcom,
VOLUME=25,
NUMBER=1,
PAGES="1-8",
MONTH=jan,
YEAR=2002,
REFERENCES=15,
KEYWORDS="ATM adaptation layer 2 (AAL2); burst errors; Gilbert-Elliott
model; wireless ATM",
ABSTRACT="Recent growth in cellular networks has motivated research on
broadband access technologies for the support of diverse services over
wireless networks. Wireless asynchronous transfer mode (WATM) has been
proposed as a transport solution for next generation wireless and
personal communication networks and ATM adaptation layer 2 (AAL2) has
been identified suitable for the support of low data rate and delay
sensitive voice traffic generated in cellular networks. In this paper,
we study the performance of AAL2 over a burst error wireless channel.
Analytical expressions for performance measures of interest are derived
for the Gilbert-Elliott channel and numerical results are presented to
demonstrate the effect of burst errors on the AAL2 frame structure and
the AAL2 performance.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Soon0201:ABR,
AUTHOR="N. Hock Soon and N. Sundararajan and P. Saratchandran",
TITLE="{ABR} traffic management using minimal resource allocation
(neural) networks",
JOURNAL=comcom,
VOLUME=25,
NUMBER=1,
PAGES="9-20",
MONTH=jan,
YEAR=2002,
REFERENCES=17,
KEYWORDS="ABR flow control; RBF network; ERICA; OPNET",
ABSTRACT="This paper presents an adaptive available bit rate (ABR)
traffic management scheme in asynchronous transfer mode (ATM) networks
using the newly developed minimal resource allocation network (MRAN).
MRAN generates a minimal radial basis function (RBF) neural network by
adding and pruning the hidden neurons based on the input data and is
well suited for on-line adaptive control of time varying nonlinear
systems. In this paper, the ATM traffic is modeled using the network
simulation package OPNET. The performance of MRAN-controller is compared
with the conventional ABR control scheme explicit rate indication with
congestion avoidance (ERICA) for different traffic scenarios such as
bursty and Variable Bit Rate (VBR) traffic. Results indicate that
MRAN-controller performs better than ERICA by keeping the queue length
and delay to a minimum while maintaining a higher link utilization and
throughput.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Stri0201:Packet,
AUTHOR="Aaron David Striegel and G. Manimaran",
TITLE="Packet scheduling with delay and loss differentiation",
JOURNAL=comcom,
VOLUME=25,
NUMBER=1,
PAGES="21-31",
MONTH=jan,
YEAR=2002,
REFERENCES=20,
KEYWORDS="differentiated services; packet scheduling; delay
differentiation; loss differentiation",
ABSTRACT="To support quality of service over the Internet, the
Differentiated Services model has been proposed recently by the IETF. In
the Differentiated Services model, flows with similar qualities of
service (QoS) requirements are aggregated into classes in order to
counter the scalability problem faced by the Integrated Services model.
There have been several models proposed for service differentiation. The
relative differentiated service model is one among them in which an
assurance is given that `higher classes will be better, or at least no
worse, than lower classes'. Packet delay and packet loss are two general
quality metrics under which the differentiation can take place. In this
paper, we propose three schedulers based on the relative differentiated
service model, namely, delay only, loss only, and both delay and loss
schedulers. To evaluate the performance of the proposed schedulers, we
have conducted extensive simulation studies (both per-hop and
end-to-end) under uniform and non-uniform traffic loads. Our simulation
studies show that the delay only and loss only schedulers differentiate
effectively only in delay and loss, respectively, and the combined delay
and loss scheduler differentiates effectively in both delay and loss.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Kon0201:Conformance,
AUTHOR="O. Koné",
TITLE="Conformance testing to real-time communications systems",
JOURNAL=comcom,
VOLUME=25,
NUMBER=1,
PAGES="32-45",
MONTH=jan,
YEAR=2002,
REFERENCES=46,
KEYWORDS="protocol engineering; conformance testing; real-time system;
ITU-T Z500 standard",
ABSTRACT="Real-time requirements appear in the specifications of new
evolving systems such as multimedia applications or embedded systems.
Testing is an experimental method aimed at checking the correctness of
some implementation and its conformance to some standard specification.
At present, standardization institutions are being interested in a
formal framework for the development of real-time communications
systems. Some ISO working groups are proposing formalisms to describe
these systems, while other working groups are proposing formalisms to
describe real-time test cases. But few works exist on conformance
testing aspects, against time-dependencies that bridge the gap between
the two previous activities. The contribution of this paper is the
proposition of a complete method to the design of tests against
real-time communications systems. The proposed method complies to the
ITU-T Z500 standard on tests development and we show that the tests
designed by our method are sound and exhaustive. The test construction
process is also illustrated with an example of time-dependent
protocol.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Yang0201:Multipoint,
AUTHOR="Shutang Yang and Shengsheng Yu and Jingli Zhou and Qi Han",
TITLE="Multipoint communications with speech mixing over {IP} network",
JOURNAL=comcom,
VOLUME=25,
NUMBER=1,
PAGES="46-55",
MONTH=jan,
YEAR=2002,
REFERENCES=14,
KEYWORDS="multipoint communications; speech scheduling and mixing
system; delayless subband AEC",
ABSTRACT="Multipoint communications makes it possible to exchange
information among a set of participants and also the key technique to
realize a distributed multiparty collaboration communications system. In
this paper, a multipoint communications strategy is discussed based on
our H.323 multipoint conferencing system. A new architecture, Speech
Scheduling and Mixing System (SSMS), is proposed for speech mixing, and
its key techniques, such as the synchronous control of real time
speeches, the pre-fetching mechanism of speech data, and the method of
buffer flush are discussed in order to guarantee the continuity of the
mixed speech in a limited complexity. Moreover, echo problem in the
conferencing system is observed and a delayless subband AEC is used to
cancel acoustic echo. Simulations show that our H.323 system sounds
better in the multipoint conferencing mode than those video conferencing
products available, such as Microsoft Netmeeting, which is based on the
same H.323 specification.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Chin0201:MCoRe,
AUTHOR="Kwan-Wu Chin and Mohan Kumar",
TITLE="{MCoRe:} an adaptive scheme for rerouting multicast connections
in mobile {ATM} networks",
JOURNAL=comcom,
VOLUME=25,
NUMBER=1,
PAGES="56-73",
MONTH=jan,
YEAR=2002,
REFERENCES=29,
KEYWORDS="multicast; connection rerouting; mobile networks; ATM",
ABSTRACT="In this paper we propose multicast connection rerouting
(MCoRe), a novel scheme for efficient multicasting in mobile
asynchronous transfer mode (ATM) networks. We investigate and evaluate
McoRe's performance in mobile ATM networks in the presence of mobile
source fand/or receivers. In the past, multicasting from and to mobile
hosts in mobile ATM networks has not received much attention from
researchers. MCoRe is based on active network (AN) technologies, where
the computation required for rerouting connections is performed at
switches. Due to intra-network processing, MCoRe is efficient, requires
minimal buffer requirements, has low handoff latency and high reuse, and
incurs low signaling overheads. Apart from that, MCoRe preserves cell
ordering, prevents cell duplication and minimizes cell loss during
source or receiver migration. We show how shortest path tree adapts to
source migration without incurring high signaling overheads. With MCoRe,
source migration is transparent to the multicast group members and does
not entail reconstruction of existing multicast tree. We also show how
receiver migration is achieved and how cell ordering is preserved, when
the receiver rejoins the multicast session.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Pati0201:Efficient,
AUTHOR="H. K. Pati and R. Mall and I. Sengupta",
TITLE="An efficient bandwidth reservation and call admission control
scheme for wireless mobile networks",
JOURNAL=comcom,
VOLUME=25,
NUMBER=1,
PAGES="74-83",
MONTH=jan,
YEAR=2002,
REFERENCES=25,
KEYWORDS="handoff; bandwidth reservation; call admission control;
quality of service (QoS); wireless cellular networks",
ABSTRACT="With increasing use of mobile units for various applications,
it has become imperative to provide services with quality of service
(QoS) guarantees. Efficient utilization of the available bandwidth is an
important issue in any QoS provisioning scheme. To this end, we propose
techniques for bandwidth reservation and call admission control for
wireless mobile networks. Our proposed techniques utilize the available
bandwidth efficiently to provide QoS guarantee with reduced new call
rejection and handoff call blocking. We have analyzed the performance of
our scheme through extensive simulation studies. The results appear
promising.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Hnni0201:Trends,
AUTHOR="Marko Hännikäinen and Timo Hämäläinen and Markku Niemi and Jukka
Saarinen",
TITLE="Trends in personal wireless data communications",
JOURNAL=comcom,
VOLUME=25,
NUMBER=1,
PAGES="84-99",
MONTH=jan,
YEAR=2002,
REFERENCES=46,
KEYWORDS="personal wireless communications; quality of service;
bluetooth; wireless local area network; GSM; UMTS",
ABSTRACT="This paper gives an overview of the background, current
status, and ongoing trends in wireless personal data communications. The
driving force behind the future development is proven to be the
convergence of multimedia content, the Internet, and wireless mobile
devices. Network technologies from global coverage to short-range
personal area networks are reviewed focusing on the most prospective
standardisation and specification efforts. Future wireless services will
be implemented using several network technologies, due to which the
portability of services across networks is the most important issue.
Especially the support for Quality of Service is emphasised in each
wireless network. In a discussion, winners and losers are examined from
the global convergence point of view.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Hunt0201:Review,
AUTHOR="Ray Hunt",
TITLE="A review of quality of service mechanisms in {IP-based} networks
{¯¯} integrated and differentiated services, multi-layer switching,
{MPLS} and traffic engineering",
JOURNAL=comcom,
VOLUME=25,
NUMBER=1,
PAGES="100-108",
MONTH=jan,
YEAR=2002,
REFERENCES=32,
KEYWORDS="QoS (quality of service); differentiated services (DiffServ);
integrated services (IntServ); BM (bandwidth manager); multi-later
switching; MPLS (multi-protocol label switching); traffic engineering",
ABSTRACT="ISPs are facing the challenge of offering improved quality of
service (QoS) to their customers. No longer is best effort delivery with
no service guarantee acceptable for many applications. Although ATM has
provided a limited solution by way of service classes, such a solution
pre-supposed an underlying ATM network which - in the case of pure IP
traffic - may not be the case. Rather IP traffic requires a degree of
engineering into service classes (differentiated services, DiffServ) as
well as a break from traditional layer three-based routing. Although
access to virtually unlimited bandwidth via WDM and Photonic Networks
may potentially offer a solution to the QoS issue, access to such
services on a universal basis is not a services class paradigm and using
a label switching technique is seen as an appropriate medium term
solution. Further, label switching offers a simple and efficient
mechanism for IP traffic engineering, multi-service functionality and
scalability. This paper examines a number of service classifications and
solutions, which aim to provide a realistic QoS solution. In particular
it addresses Integrated and DiffServ, multi-layer switching and MPLS,
which forms the basis of DiffServ as it allows ISPs to deliver new
services not easily supportable by conventional IP routing
infrastructure. Finally the paper makes some important observations
about traffic engineering.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Kuma0201:Static,
AUTHOR="M. Kumar and Puneet Kumar",
TITLE="Static lightpath establishment in {WDM} networks - New {ILP}
formulations and heuristic algorithms",
JOURNAL=comcom,
VOLUME=25,
NUMBER=1,
PAGES="109-114",
MONTH=jan,
YEAR=2002,
REFERENCES=18,
KEYWORDS="WDM; wavelength routing; wavelength assignment; lightpath;
wavelength-graph",
ABSTRACT="This paper considers Wavelength Division Multiplexing (WDM)
networks, which employ wavelength routing switches that enable the
establishment of lightpaths through the network between node-pairs.
Conventional Routing and Wavelength Assignment (RWA) algorithms for
Static Lightpath Establishment (SLE) are based on traditional
circuit-switched networks where routing and wavelength assignment steps
are decoupled. In this paper, we propose new Integer Linear Program
(ILP) formulations for maximizing network throughput for two different
types of traffic patterns namely, uniform and non-uniform. In the
proposed formulations, routing and wavelength assignment steps are
tightly coupled, unlike earlier proposed formulations. However, for
large size networks solving the ILP formulations can easily overwhelm
the capabilities of today's state-of-art computing facilities. Hence, we
propose two heuristic algorithms based on wavelength-graph for
maximizing network throughput. Simulation studies indicate that the
heuristic approach gives performance close to the optimal solution
obtained using ILP based solution.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Shar0201:Finite,
AUTHOR="Vinod Sharma and Jorma Virtamo",
TITLE="A finite buffer queue with priorities",
JOURNAL=pe,
VOLUME=47,
NUMBER=1,
PAGES="1-22",
MONTH=jan,
YEAR=2002,
KEYWORDS="finite buffer queue; MMPP arrival process; priority classes",
ABSTRACT="We consider a queue with finite buffer where the buffer size
limits the amount of work that can be stored in the queue. The arrival
process is a Poisson or a Markov modulated Poisson process. The service
times (packet lengths) are i.i.d. with a general distribution. Our queue
models the systems in the Internet more realistically than the usual
M/GI/1/K queue which restricts the number of packets in the buffer
rather than the buffer content (the number of bits). We obtain the
stability, the rates of convergence to the stationary distribution and
functional limit theorems for this system. In addition, we also obtain
algorithms to compute the stationary density of the workload process,
the waiting times and the probability of packet loss. Next, we study the
queue with two priority classes. The higher priority traffic has
preemptive-resume priority. For sharing the buffer, we consider two
cases. In the first case, the buffer is shared by both the classes
without any priority. In the second case, the buffer is partitioned into
two groups, one reserved for each class. For this system also we obtain
all the results mentioned for the single class traffic.",
URL="http://www.elsevier.com/locate/peva",
}

@ARTICLE{Nald0201:Mixture,
AUTHOR="Maurizio Naldi",
TITLE="A mixture model for the connection holding times in the
Video-on-Demand service",
JOURNAL=pe,
VOLUME=47,
NUMBER=1,
PAGES="23-41",
MONTH=jan,
YEAR=2002,
KEYWORDS="traffic models; mixture models; holding time;
video-on-demand",
ABSTRACT="A fundamental traffic parameter for the design of a network
supporting the Video-on-Demand service is the connection holding time.
This holding time is usually characterized by its average value and,
possibly, by its probability density function (pdf). In this paper, a
model is proposed for this density, consisting of a mixture of Gaussian
pdf's, whose parameters are estimated through the combination of the
K-means algorithm and of a recursive likelihood maximization procedure.
The model has been applied to a data set extracted from a video
catalogue. Exponential and log-normal models have been fitted to the
same data set by comparison. For all three models, the chi-square
statistic and the Akaike Information Criterion result to be much lower
for the mixture model than for the other two. In addition, the shape of
the mixture pdf resembles more closely the multimodal characteristic of
the empirical data. This results have been obtained with a mixture of
limited complexity, being made up of a small number of Gaussian
components (three or four).",
URL="http://www.elsevier.com/locate/peva",
}

@ARTICLE{Kama0201:Blocking,
AUTHOR="Ahmed E. Kamal and Anwar Alyatama",
TITLE="Blocking probabilities in circuit-switched wavelength division
multiplexing networks under multicast service",
JOURNAL=pe,
VOLUME=47,
NUMBER=1,
PAGES="43-71",
MONTH=jan,
YEAR=2002,
KEYWORDS="optical networks; wavelength division multiplexing; multicast
service; circuit switching; blocking probability; markov process;
analysis",
ABSTRACT="We evaluate the call-blocking probabilities in optical
networks which support multicast (or multipoint) service. Due to the
difficulty of the problem, we restrict our attention to the case of
completely connected networks, for which the blocking probabilities act
as a lower bound for other topologies. Nodes may, or may not be equipped
with wavelength converters. In both cases, routing can be done either
directly, using one hop, or indirectly, and even in the latter case the
number of hops can be either restricted to two hops, or unrestricted. We
evaluate the blocking probability by first estimating the load offered
to each link, and then use the iterative-reduced load approximation
method to refine this estimate. Using this estimate, we then obtain the
probabilities of blocking and success. Numerical examples are presented,
and are compared to simulation.",
URL="http://www.elsevier.com/locate/peva",
}

@TECHREPORT{Lepa0201:Speed,
AUTHOR="Joel Lepak and M. Crescimanno",
TITLE="Speed of light measurement using ping",
TYPE="arXiv technical report",
INSTITUTION="arXiv",
ADDRESS="Youngstown, Ohio",
NUMBER="YSU-CPIP/102-02, phy",
MONTH=jan,
YEAR=2002,
KEYWORDS="ping; speed of light; physics education",
ABSTRACT="We report on a very simple and inexpensive method for
determining the speed of an electrical wave in a transmission line. The
method consists of analyzing the roundtrip time for ethernet packets
between two computers. It involves minimal construction, straightforward
mathematics and displays the usefulness of stochastic resonance in
signal recovery. Using basic electrical properties of category-five
cable students may use their measurements to determine the speed of
light in the vacuum to within a few percent.",
URL="http://xxx.lanl.gov/abs/physics/0201053",
}

@TECHREPORT{Rous0201:CUP,
AUTHOR="Mema Roussopoulos and Mary G. Baker",
TITLE="{CUP:} Controlled Update Propagation in Peer-to-Peer Networks",
TYPE="technical report",
INSTITUTION="arXiv",
NUMBER="cs.NI/0202008",
MONTH=jan,
YEAR=2002,
KEYWORDS="Networking and Internet Architecture",
ABSTRACT="Recently the problem of indexing and locating content in
peer-to-peer networks has received much attention.  Previous work
suggests caching index entries at intermediate nodes that lie on the
paths taken by search queries, but until now there has been little focus
on how to maintain these intermediate caches.  This paper proposes CUP,
a new comprehensive architecture for Controlled Update Propagation in
peer-to-peer networks.  CUP asynchronously builds caches of index
entries while answering search queries.  It then propagates updates of
index entries to maintain these caches.  Under unfavorable conditions,
when compared with standard caching based on expiration times, CUP
reduces the average miss latency by as much as a factor of three.  Under
favorable conditions, CUP can reduce the average miss latency by more
than a factor of ten.  CUP refreshes intermediate caches, reduces query
latency, and reduces network load by coalescing bursts of queries for
the same item.  CUP controls and confines propagation to updates whose
cost is likely to be recovered by subsequent queries.  CUP gives
peer-to-peer nodes the flexibility to use their own incentive-based
policies to determine when to receive and when to propagate updates.
Finally, the small propagation overhead incurred by CUP is more than
compensated for by its savings in cache misses.",
URL="http://arXiv.org/abs/cs/0202008",
}

@ARTICLE{Lewi0201:Migration,
AUTHOR="Lundy Lewis and Pradeep Kumar Ray",
TITLE="On the Migration from Enterprise Management to Integrated Service
Level Management",
JOURNAL=ieeenet,
VOLUME=16,
NUMBER=1,
MONTH=jan,
YEAR=2002,
REFERENCES=12,
ABSTRACT={Enterprise management is concerned with the integrated
management of enterprise-wide applications with underlying network and
systems management. Service level management (SLM) provides a mechanism
for linking business requirements with the specification of integrated
management systems. SLM is popular in the industry, although the meaning
of "service" varies depending on to whom one is talking. Sometimes a
service is understood with respect to networking elements alone (e.g.,
router throughput), sometimes in terms of application performance (e.g.,
packet latency), and sometimes in terms of user perception (e.g., URL
response time). In this article we provide a multi-agent framework for
integrated SLM that subsumes these different approaches into a single
comprehensive top-down management system from a high-level business
perspective. This multi-agent-based system is illustrated with a case
study of a typical enterprise in the United States, showing how
enterprise management is migrating to the concept of service
management.},
URL="http://www.comsoc.org/ni/Public/2002/Jan/index.html",
}

@ARTICLE{Rabh0201:Integrated,
AUTHOR="Fethi Rabhi and Boualem Benatallah",
TITLE="An Integrated Service Architecture for Managing Capital Market
Systems",
JOURNAL=ieeenet,
VOLUME=16,
NUMBER=1,
MONTH=jan,
YEAR=2002,
REFERENCES=24,
ABSTRACT="This article studies current developments and trends in the
area of capital market systems. In particular, it defines the trading
lifecycle and the activities associated with it. The article then
investigates opportunities for the integration of legacy systems and
existing communication protocols through distributed integrated services
that correspond to established business processes. These integrated
services link to basic services such as an exchange, a settlement, or a
registry service. Examples of such integrated services include pre-trade
services (e.g., analytics) or post-trade services (e.g., surveillance).
The article then presents the various levels of integration in capital
market systems and discusses the standards in place. It establishes that
most interactions occur at a low level of abstraction such as the
network (e.g., TCP/IP), data format (e.g., FIX, XML), and middleware
levels (e.g., CORBA). Finally, the article discusses a software
development methodology based on the use of design patterns. These
design patterns address the essential aspects of managing integrated
services in a technology-independent fashion. These aspects are service
wrapping, service composition, service contracting, service discovery,
and service execution. The objective of the methodology is to facilitate
the rapid development of new integrated services that correspond to
emerging business opportunities.",
URL="http://www.comsoc.org/ni/Public/2002/Jan/index.html",
}

@ARTICLE{Luo0201:Multi,
AUTHOR="Yuan Luo and Kecheng Liu and Darryl N. Davis",
TITLE="A Multi-Agent Decision Support System for Stock Trading",
JOURNAL=ieeenet,
VOLUME=16,
NUMBER=1,
MONTH=jan,
YEAR=2002,
REFERENCES=28,
ABSTRACT="A distributed problem solving system can be characterized as a
group of individual cooperating agents running to solve common problems.
As dynamic application domains continue to grow in scale and complexity,
it becomes more difficult to control the purposeful behavior of agents,
especially when unexpected events may occur. This article presents an
information and knowledge exchange framework to support distributed
problem solving. From the application viewpoint the article concentrates
on the stock trading domain; however, many presented solutions can be
extended to other dynamic domains. It addresses two important issues:
how individual agents should be interconnected so that their resources
are efficiently used and their goals accomplished effectively; and how
information and knowledge transfer should take place among the agents to
allow them to respond successfully to user requests and unexpected
external situations. The article introduces an architecture, the MASST
system architecture, which supports dynamic information and knowledge
exchange among the cooperating agents. The architecture uses a dynamic
blackboard as an interagent communication paradigm to facilitate factual
data, business rule, and command exchange between cooperating MASST
agents. The critical components of the MASST architecture have been
implemented and tested in the stock trading domain, and have proven to
be a viable solution for distributed problem solving based on
cooperating agents.",
URL="http://www.comsoc.org/ni/Public/2002/Jan/index.html",
}

@ARTICLE{Bout0201:Projecting,
AUTHOR="Raouf Boutaba and Andreas Polyrakis",
TITLE="Projecting Advanced Enterprise Network and Service Management to
Active Networks",
JOURNAL=ieeenet,
VOLUME=16,
NUMBER=1,
MONTH=jan,
YEAR=2002,
REFERENCES=19,
ABSTRACT="Active networks is a promising technology that allows us to
control the behavior of network nodes by programming them to perform
advanced operations and computations. Active networks are changing
considerably the scenery of computer networks and, consequently, affect
the way network management is conducted. Current management techniques
can be enhanced and their efficiency can be improved, while novel
techniques can be deployed. This article discusses the impact of active
networks on current network management practice by examining network
management through the functional areas of fault, configuration,
accounting, performance and security management. For each one of these
functional areas, the limitations of the current applications and tools
are presented, as well as how these limitations can be overcome by
exploiting active networks. To illustrate the presented framework,
several applications are examined. The contribution of this work is to
analyze, classify, and assess the various models proposed in this area,
and to outline new research directions.",
URL="http://www.comsoc.org/ni/Public/2002/Jan/index.html",
}

@ARTICLE{Glit0201:Mobile,
AUTHOR="Roch H. Glitho and Edgar Olougouna and Samuel Pierre",
TITLE="Mobile Agents and Their Use for Information Retrieval: A Brief
Overview and an Elaborate Case Study",
JOURNAL=ieeenet,
VOLUME=16,
NUMBER=1,
MONTH=jan,
YEAR=2002,
REFERENCES=21,
ABSTRACT="Mobile agents emerged in the mid-1990s, and have raised
considerable interest in the research community. The proponents
associate several benefits with their use. However, there are still very
few quantitative measurements to back the claimed benefits. This article
is devoted to mobile agents and their use for information retrieval. We
provide a brief overview and an elaborate case study. The overview
introduces the concept of mobile agent, enumerates the claimed benefits,
and reviews the hindrances to widescale deployment. It also discusses
the state of the art of mobile-agent-based information retrieval,
including the very few quantitative studies that exist. Our case study
is on information retrieval from electronic calendars for multiparty
event scheduling. Many events require the participation of several
parties. Prior knowledge of the date when most (if not all) targeted
participants are available is often a prerequisite for scheduling them.
However, identifying this date can easily turn into a nightmare,
especially when the number of targeted participants is large. Nowadays,
electronic agendas (e.g., MS Outlook) are stored on servers. An
application can access them, retrieve information on the availability of
the targeted participants, and derive the date from the information. In
the case study, a mobile agent is dispatched in the network, instead of
retrieving the information using the client/server paradigm. The agent
visits the servers, accesses the agendas, retrieves the information, and
identifies the date. Finding a date suitable for several potential
participants may require the rescheduling of some events that have been
previously arranged by some participants. We propose the use of agents
that act as the personal agents of the participants for the negotiation
inherent to this rescheduling. The measurements we have made indicate
clearly that the mobile-agent-based approach outperforms its
client/server counterpart even when the latter is optimized. These
results can easily be transposed to most information retrieval
applications, and demonstrate, for this specific application domain, the
performance benefit associated with mobile agents. We now dispatch a
single agent in the network. In the future, we will dispatch several
agents. Mobile multi-agent systems raise several challenging issues we
would like to tackle in further work.",
URL="http://www.comsoc.org/ni/Public/2002/Jan/index.html",
}

@TECHREPORT{Sast0201:CYRF,
AUTHOR="Nishanth R. Sastry and Simon Lam",
TITLE="{CYRF:} A Framework for Window-based Unicast Congestion Control",
TYPE="Technical Report",
INSTITUTION="Department of Computer Sciences, University of Texas",
ADDRESS="Austin, Texas",
NUMBER="TR-02-09",
MONTH=jan,
YEAR=2002,
KEYWORDS="Congestion control; fairness; TCP; TCP-friendly",
ABSTRACT="This work presents a comprehensive theoretical framework of
window based congestion control protocols called CYRF (for Choose Your
Response Function) that are designed to converge to fairness and
efficiency.  We first derive a sufficient condition for convergence to
fairness.  Using this, we show how fair window increase/decrease
policies can be constructed from suitable pairs of monotonically
non-decreasing functions.  We also give a new characterization of
TCP-friendliness and simple rules for smooth CYRF flows to be
TCP-friendly.  Specific protocols that meet the needs of a given
situation can be designed within this framework.  We experimentally
investigate two CYRF protocols for streaming media-like applications:
LOG, a protocol suitable for applications that need to trade-off between
smoothness and aggressiveness, and SIGMOID, which is designed to be
``TCP-friendly'' even in a network with drop-tail queues (unlike other
non-linear window based protocols).",
URL="http://www.cs.utexas.edu/ftp/pub/techreports/tr02-09.ps.Z",
}

@TECHREPORT{Cabl0201:Dynamic,
AUTHOR="Cable Television Laboratory",
TITLE="PacketCable dynamic quality-of-service specification",
TYPE="Specification",
INSTITUTION="{Cable Television Laboratory}",
NUMBER="PKT-SP-DQOS I03 0201",
MONTH=jan,
YEAR=2002,
KEYWORDS="QoS; RSVP; resource reservation",
ABSTRACT="This specification describes a dynamic Quality-of-Service
(QoS) mechanism for the PacketCable project.  CableLabs has issued this
specification to facilitate design and field-testing leading to the
manufacture and interoperability of conforming hardware and software by
multiple vendors.  PacketCable is a set of protocols developed to
deliver Quality of Service enhanced communications services using
packetized data transmission technology to a consumer's home over the
cable network.  PacketCable utilizes a network superstructure that
overlays the two-way data-ready cable television network.  While the
initial service offerings in the PacketCable product line are
anticipated to be Packet Voice and Packet Video, the long term project
vision encompasses a large family of packet-based services.",
URL="http://www.packetcable.com/specs/PKT-SP-DQOS-I03-020116.pdf",
}

@MASTERSTHESIS{Dixo0201:Performance,
AUTHOR="Douglas Dixon and Katrin Sjöberg",
TITLE="Performance Study of a Broadband Wireless Local Area Network",
SCHOOL="Halmstad University, School of Information Science, Computer and
Electrical Engineering",
ADDRESS="Sweden",
MONTH=jan,
YEAR=2002,
KEYWORDS="802.11; wireless LAN",
ABSTRACT="The wireless data communication standard IEEE 802.11a only
supports best effort traffic when using the Distributed Coordination
Function (DCF) as media access method.  By building a realistic
simulation model of the IEEE 802.11a including a radio channel model,
the performance of IEEE 802.11a will be evaluated when loading the
system with intense file transfers using TCP/IP and less intense
time-critical Voice over IP (VoIP) traffic (i.e.  Internet telephony). A
wireless channel, compared to a wired channel, is an unpredictable media
for packet transmission, because of signal strength variations and
interference.  This is why the IEEE 802.11a supports fragmentation and
link adaptation.  These mechanisms are studied with respect to the
Quality of Service (QoS) parameters latency, packet loss, and bandwidth,
for the different traffic scenarios.  The IEEE 802.11a does not specify
QoS guarantees.  However the simulations using VoIP have shown that the
standard well meets the QoS requirements for VoIP traffic.  A VoIP
system should not have latency greater than 150 ms in one direction or
the conversation becomes difficult to follow.  The IEEE 802.11a standard
has delays far below this level and actually in the order of hundreds of
microseconds.",
}

@TECHREPORT{NENA0201:ALI,
AUTHOR="{National Emergency Number Assocation (NE}",
TITLE="{NENA} Recommended Formats \& Protocols For {ALI} Data Exchange,
{ALI} Response \& {GIS} Mapping",
TYPE="Standard",
INSTITUTION="NENA",
ADDRESS="Washington, DC",
NUMBER="NENA-02-010",
MONTH=jan,
YEAR=2002,
KEYWORDS="911; emergency calls; geolocation",
ABSTRACT="This document sets forth NENA standard formats for Automatic
Location Identification (ALI) data exchange between Service Providers
and Data Base Management System Providers, a GIS data model, a Data
Dictionary, and formats for data exchange between the ALI Database and
PSAP Controller equipment.  Movement of ALI data between Service
Providers and/or Data Base Management System Providers is a necessary
and common activity for the activation of E9-1-1 systems.  Means of
moving such data is varied and many.  This document contains data
exchange formats and data protocols recommended for creation and
transporting of 9-1-1 data.  This recommendation advocates the use of
one of two common protocols (KERMIT and NDM) for use in the near term
and with a move toward one common protocol (TCP/IP) in the future.  The
recommendation unfolded in this manner with the recognition that as a
goal NENA acknowledges the advantage of one protocol, but that existing
systems are in place so an evolution plan must be put in place and that
no single protocol can satisfy all applications.",
URL="http://www.nena.org/9-1-1TechStandards/Standards\_PDF/NENA\%2002-010.PDF",
}

@ARTICLE{Stam0201:Space-time,
AUTHOR="Anastasios Stamoulis and Zemin Liu and Georgios B. Giannakis",
TITLE="Space-Time Block-Coded {OFDMA} With Linear Precoding for
Multirate Services",
JOURNAL="Transactions on Signal Processing",
MONTH=jan,
YEAR=2002,
LANGUAGE="English",
}

@ARTICLE{Chia0201:Need,
AUTHOR="Tsun-Chieh Chiang and Vijay Gurbani and John B. Reid",
TITLE="The Need for Third-Party Call Control",
JOURNAL=bltj,
VOLUME=7,
NUMBER=1,
MONTH=jan,
YEAR=2002,
LANGUAGE="English",
KEYWORDS="SIP; 3PCC; call control",
ABSTRACT="This letter examines third-party call control (3PCC) and its
application to new services. The evolution of networks and services that
has driven the need for 3PCC capabilities is examined along with some of
the new service concepts that may make use of 3PCC. Also discussed is
ongoing work within Lucent Technologies in the area of 3PCC and service
concepts that make use of 3PCC",
}

@ARTICLE{Dian0201:Session,
AUTHOR="Janet R. Dianda and Vijay Gurbani and Mark Jones",
TITLE="Session Initiation Protocol Services Architecture",
JOURNAL=bltj,
VOLUME=7,
NUMBER=1,
PAGES="3-23",
MONTH=jan,
YEAR=2002,
LANGUAGE="English",
KEYWORDS="SIP services",
ABSTRACT="The session initiation protocol (SIP) is a unifying protocol
for providing integrated telephony and Internet types of services, such
as Web, presence, instant messaging, and chat. To provide for the
integration of these disparate types of services, considerations must be
given from a network point of view. However, little attention has been
given in the literature to identify the network elements required to
provide these services or the mechanisms for integrating these different
types of services for end users. This paper describes a network-level
services architecture for SIP, including network functions and entities
needed to support the services integration. We will discuss how services
can be incorporated at different levels in the network, and the types of
services typically created at each of these levels. We will also
describe a service access and mediation function, which blends disparate
types of services in creating a seamless and rewarding user
experience.",
URL="http://www.lucent.com/livelink/0900940380044982\_White\_paper.pdf",
}

@INPROCEEDINGS{Papa0201:Secure,
AUTHOR="Panagiotis Papadimitratos and Zygmunt J. Haas",
TITLE="Secure Routing for Mobile Ad Hoc Networks",
BOOKTITLE="SCS Communication Networks and Distributed Systems Modeling
and Simulation Conference, CNDS 2002",
ADDRESS="San Antonio, TX",
MONTH=jan,
YEAR=2002,
}

@INPROCEEDINGS{Scho0201:Modeling,
AUTHOR="Wolfgang Schonfeld and Andreas Meissner and Holger Kirchner",
TITLE="Modeling {IP-Based} Mobility Management",
BOOKTITLE="Communication Networks and Distributed Systems Modeling and
Simulation Conference, CNDS 2002 (Part of the 2002 SCS Western
Multiconference on Computer Simulation)",
ADDRESS="San Antonio, Texas",
MONTH=jan,
YEAR=2002,
}

@INPROCEEDINGS{Wang0201:Bluenet,
AUTHOR="Shie-Yuan Wang and R. Thomas and Zygmunt J. Haas",
TITLE="Bluenet - A New Scatternet Formation Scheme",
BOOKTITLE="35th International Conference on System Science, HICSS 35",
ADDRESS="Big Island, Hawaii",
MONTH=jan,
YEAR=2002,
}

@ARTICLE{Liu0201:Unified,
AUTHOR="Jiangchuan Liu and Qian Zhang and Bo Li and Wenwu Zhu and Jun
Zhang",
TITLE="A Unified Framework for Resource Discovery and QoS-Aware Provider
Selection in Ad Hoc Networks",
JOURNAL="Mobile Computing and Communications Review",
VOLUME=6,
NUMBER=1,
PAGES="13-21",
MONTH=jan,
YEAR=2002,
}

@ARTICLE{Zhen0201:Case,
AUTHOR="Rong Zheng and Ye Ge and Jennifer Hou and Sandy R. Thuel",
TITLE="A Case for Mobility Support with Temporary Home Agents",
JOURNAL="Mobile Computing and Communications Review",
VOLUME=6,
NUMBER=1,
PAGES="32-46",
MONTH=jan,
YEAR=2002,
}

@TECHREPORT{Tsch0201:LUNAR,
AUTHOR="Christian Tschudin and Richard Gold",
TITLE="{LUNAR} Lightweight Underlay Network Ad-Hoc Routing",
INSTITUTION="Department of Computer Systems of Uppsala University and
FhG Fokus",
ADDRESS="Uppsala, Sweden and Berlin, Germany",
NOTE="{http://www.docs.uu.se/docs/research/projects/selnet/lunar/lunar.pdf
accessed August 2002}",
MONTH=jan,
YEAR=2002,
}

@ARTICLE{Stoj0201:Dominating,
AUTHOR="Ivan Stojmenovic and M. Seddigh and J. Zunic",
TITLE="Dominating Sets and Neighbor Elimination Based Broadcasting
Algorithms in Wireless Networks",
JOURNAL=ieeepds,
VOLUME=13,
NUMBER=1,
PAGES="14-25",
MONTH=jan,
YEAR=2002,
}

@INPROCEEDINGS{Dres0201:Qos,
AUTHOR="Falko Dressler",
TITLE="{QoS} considerations on {IP} multicast services",
BOOKTITLE="International Conference on Advances in Infrastructure for
Electronic Business, Education, Science, and Medicine on the Internet
(SSGRR)",
ADDRESS="L'Aquila, Italy",
MONTH=jan,
YEAR=2002,
LANGUAGE="English",
URL="http://net.informatik.uni-tuebingen.de/~dressler/publications/ssgrr-2002w-abstract\_en.html,http://net.informatik.uni-tuebingen.de/~dressler/publications/ssgrr-2002w.pdf",
}

@ARTICLE{Ziou0202:CSMA,
AUTHOR="Eustathia Ziouva and Theodore A. Antonakopoulos",
TITLE="{CSMA/CA} performance under high traffic conditions: throughput
and delay analysis",
JOURNAL=comcom,
VOLUME=25,
NUMBER=3,
PAGES="313-321",
MONTH=feb,
YEAR=2002,
REFERENCES=5,
KEYWORDS="carrier sense multiple access with collision avoidance;
wireless LANs; distributed coordination function",
ABSTRACT="The IEEE802.11 standard for wireless local area networks is
based on the CSMA/CA protocol for supporting asynchronous data
transfers. CSMA/CA uses an acknowledgment mechanism for verifying
successful transmissions and optionally, a handshaking mechanism for
decreasing collisions overhead. In both cases, an exponential backoff
mechanism is used. This work investigates the theoretical performance of
both mechanisms in terms of throughput and delay under traffic
conditions that correspond to the maximum load that the network can
support in stable conditions. We present extensive numerical results in
order to highlight the effect of the backoff mechanism parameters on
network performance for both mechanisms.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{He0202:TCP,
AUTHOR="Xiaoning He and Hao Che",
TITLE="{TCP} performance analysis and optimization over {DMT} based
{ADSL} system",
JOURNAL=comcom,
VOLUME=25,
NUMBER=3,
PAGES="322-328",
MONTH=feb,
YEAR=2002,
REFERENCES=18,
KEYWORDS="asymmetric digital subscriber loop; discrete multi-tone;
water-filling; transmission control protocol; performance analysis",
ABSTRACT="This paper studies the transmission control protocol (TCP)
performance over a discrete multi-tone (DMT) based asymmetric digital
subscriber loop (ADSL) network. The impact of DMT subchannel bit loading
on the TCP throughput performance is studied. The simulation results
show that there is a threshold for the signal-to-noise ratio (SNR) gap
or bit error rate (BER) above which TCP throughput drops quickly. This
threshold takes its value in a wide range depending on the TCP
round-trip time as well as channel noises. This suggests that it would
be insufficient to set a fixed target BER at, e.g. 10-7, when
calculating the number of bits to be loaded in each subchannels.
Instead, the bit loading should take TCP performance into account.
Finally a dynamic bit loading scheme is proposed, which jointly
optimizes the channel bit rate and TCP throughput performance.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Esco0202:Novel,
AUTHOR="Jorge Escorcia and Dipak Ghosal and Dilip Sarkar",
TITLE="A novel cache distribution heuristic algorithm for a mesh of
caches and its performance evaluation",
JOURNAL=comcom,
VOLUME=25,
NUMBER=3,
PAGES="329-340",
MONTH=feb,
YEAR=2002,
REFERENCES=27,
KEYWORDS="heuristic algorithm; internet topology; NetCache; world wide
web",
ABSTRACT="The widespread use of the Internet has created two problems:
document retrieval latency and network traffic. Caching of documents
`close' to users has helped alleviate both problems. Different caching
policies have been proposed/implemented to make best use of limited
available cache at each caching server. A mesh of caching servers, aided
by different data diffusion algorithms and the natural hierarchical
structure of the Internet topology, has increased `virtual' size of
cache. Yet the size of available cache is small compared to the total
size of all documents served, and remains a major resource constraint.
In this work, we looked at how to improve document download time, by
distributing a fixed amount of total storage in a network or mesh of
caches. The intuition behind our cache distribution approach is to give
more storage to the caching nodes in the network, which experience more
traffic, in the hope that this will reduce the average latency of
document retrieval in the network. A heuristic was developed to estimate
traffic at each cache of a network. From this traffic estimation, each
cache then receives a corresponding percentage of the total storage
capacity of the network. Through extensive simulation it is found that
the proposed cache distribution algorithm can reduce latency up to 80\%
over prior work that includes both Harvest-type and demand-driven data
diffusion algorithms. Furthermore, the best improvement was achieved in
a cache range that corresponds to practical, real world cache ranges.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Pate0202:Current,
AUTHOR="Avnish Patel",
TITLE="Current status and future directions of software architectures
for telecommunications",
JOURNAL=comcom,
VOLUME=25,
NUMBER=2,
PAGES="121-132",
MONTH=feb,
YEAR=2002,
REFERENCES=33,
KEYWORDS="telecommunications; software architecture; TMN; CORBA; TINA;
JAIN; Jini",
ABSTRACT="Telecommunication software is notoriously complex and
expensive. Developers of telecommunication applications have to satisfy
numerous, often conflicting, user requirements and cope with the
universe of telecommunication protocols, hardware platforms, and network
architectures. The only way to overcome these difficulties, to deliver
high quality services, and to keep up with the pace at which new
telecommunication technologies are introduced, is to use efficient
software architectures. What will software architectures for future
telecommunication systems look like? What will be required from them? Do
existing architectures fulfil these demands? This paper analyses general
and specific requirements for telecommunication software and reviews
several recent architectures for telecommunication systems.
Subsequently, a view is put forward as to how these architectures should
evolve to support the variety of technologies and applications of the
future.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Trig0202:Service,
AUTHOR="Sebastiano Trigila and Ferdinando Lucidi and Kimmo E.E.
Raatikainen",
TITLE="A service architecture for fixed and mobile convergence",
JOURNAL=comcom,
VOLUME=25,
NUMBER=2,
PAGES="133-148",
MONTH=feb,
YEAR=2002,
REFERENCES=44,
ABSTRACT="This paper discusses an architecture to cope with the
technical complexity of the global system resulting from the world-wide
interworking of mobile and fixed networks of different technologies, for
the provision of multimedia services, in a liberalised and deregulated
environment. The architecture represents the convergence of two
frameworks that had progressed independently until the mid 1990s: (a)
service architectures for a global information infrastructure; and (b)
mobile communications systems. The need for the convergence of mobile
and fixed networks at service control and management level is a key
issue in the telecommunications environment. The existence of a generic
service layer spanning a set of heterogeneous networks (fixed and
wireless) promises several advantages for greater flexibility and
efficiency in service development and deployment, compared to those
obtainable with network-specific service creation practice. The TINA-C
has established an architecture that has the potential and momentum to
respond to such challenges. However, several adjustments and refinements
in both the TINA network and services architectures appear necessary
when addressing mobility. The approach presented here was envisaged by
the EC/ACTS research project DOLMEN, which took as a basis the TINA
architecture and enhanced it in the perspective of world-wide mobility
service provisioning in a multi-provider environment. The paper shows
how requirements stemming from personal mobility and terminal mobility
are reflected in relevant changes and extensions of TINA, namely: a new
Business Model (including also the role of Terminal Provider), two new
computational components (User Agent Home and User Agent Visited), the
concept of Retailer Federation, new ways to model and manage terminal
mobility at CORBA level (the DPE model chosen by TINA) by means of
ad-hoc defined interoperability bridges and new object referencing
schemes, and finally, suitable models to represent handover in the TINA
Network Resource Architecture.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Vand0202:Generic,
AUTHOR="Filip Vandermeulen and Brecht Vermeulen and Piet Demeester and
Frank Steegmans and Steven Vermeulen",
TITLE="A generic architecture for management and control of end-to-end
quality of service over multiple domains",
JOURNAL=comcom,
VOLUME=25,
NUMBER=2,
PAGES="149-168",
MONTH=feb,
YEAR=2002,
REFERENCES=35,
ABSTRACT="Currently, service providers and network operators are
exploring new business opportunities that can be found in offering
packages of advanced highly customized services to both residential and
corporate subscribers. The semantics of these services will be more
sophisticated, their access will be better controlled, their usage will
be more flexible in time (scheduled) and space (mobile access), and
their delivery will be possible with different grades of Quality of
Service (QoS). Multimedia services such as video conferencing, distance
learning, tele surgery, or dynamic and scheduled trunk provisioning,
subject to certain Subject Level Agreements (e.g. corporate VPNs), are
just a few examples of services with higher semantics. Although these
services could have a high market potential, their implementation and
delivery are hampered by the lack of an efficient, flexible and
integrated network and service management system. Particularly, in the
network management domain we encounter the following three problems.
First, the setup of multimedia streams with end-to-end QoS over multiple
administrative business domains is impossible without adequate
federating mechanisms between network management systems. Secondly,
dynamic and flexible interworking mechanisms between different
technology domains is ubiquitous for the automatic provisioning of
trails over a set of heterogeneous networked systems (e.g. from ATM in
the access to IP in the core, from MPLS to DWDM, or from Frame Relay to
ATM). Third, management of end-to-end QoS is not only a matter of
network QoS. Management of QoS in end terminals and end devices or at a
web server is an integral part of the global QoS delivery process. The
Telecommunications Information Networking Architecture (TINA) has
defined a distributed and integrated computational platform for the
management and delivery of QoS based services. This paper starts from a
state of the art TINA system and elaborates potential enhancements and
extensions in order to bring a solution for each of the three previous
issues.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Adam0202:Continuous,
AUTHOR="Dionisis Adamopoulos and George Pavlou and Constantine A.
Papandreou",
TITLE="Continuous media support in the distributed component object
model",
JOURNAL=comcom,
VOLUME=25,
NUMBER=2,
PAGES="169-182",
MONTH=feb,
YEAR=2002,
REFERENCES=25,
ABSTRACT="The demand for a great variety of sophisticated
telecommunications services with multimedia characteristics is
increasing. This trend highlights the need for the efficient creation of
distributed programs with multimedia data exchanges running on
distributed processing environments. Therefore, it is necessary to
support the object-oriented development of distributed multimedia
applications in a flexible manner. This paper recognises Microsoft's
Distributed Component Object Model (DCOM) as a key potential technology
in the area of service engineering and examines a structured approach to
enhance it for the handling of continuous media streams through the
design and implementation of a collection of suitable multimedia support
services. The proposed approach focuses on the modelling of continuous
media communications in DCOM and is validated through the design and
implementation of a multimedia conferencing service. Though the approach
is targeted to DCOM, the paper lays a set of concrete concepts for
realising stream interfaces in distributed object platforms.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Bahn0202:Replica,
AUTHOR="Hyokyung Bahn and Hyunsook Lee and Sam Noh and Sang Min and Kern
Koh",
TITLE="Replica-aware caching for Web proxies",
JOURNAL=comcom,
VOLUME=25,
NUMBER=3,
PAGES="183-188",
MONTH=feb,
YEAR=2002,
REFERENCES=15,
KEYWORDS="proxy; caching; replica; MD5; world wide web",
ABSTRACT="A significant percentage of Web objects are replicas. For
example, a vast majority of image files such as banners, buttons, and
logos are duplicated throughout the WWW. Nevertheless, Web caching
systems generally treat the replicas as different objects because they
have different URLs. In this paper, we propose a simple and efficient
way to manage the replicated objects for Web proxy caches. In the
proposed scheme, the MD5 checksum, together with the size of an object,
forms an identifier of a Web object that can distinguish replicas.
Experimental results show that the proposed scheme significantly
improves the cache hit rate and the byte hit rate by removing the
redundant objects from the cache and reflecting the popularity of
objects more precisely.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Rodr0202:Extension,
AUTHOR="Guillermo Rodríguez and Pedro Merino and María-del-Mar
Gallardo",
TITLE="An extension of the ns simulator for active network research",
JOURNAL=comcom,
VOLUME=25,
NUMBER=3,
PAGES="189-197",
MONTH=feb,
YEAR=2002,
REFERENCES=12,
KEYWORDS="active networks; programmable networks; protocol simulation",
ABSTRACT="Active Networks (ANs) represent a new paradigm of computer
network, which will enable new Internet applications and services and
improve end-to-end performance of the existing ones. However, ANs being
an emerging technology, there is still a significant lack of tools for
the design and evaluation of active network protocols. In particular,
network simulators have proven to be very valuable tools and they have
been widely used in the Internet research community. In this paper, we
present a novel extension for the well-known network simulator ns to
incorporate AN support. Our solution is versatile yet powerful,
providing a consistent framework for researchers to design and evaluate
active protocols.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Luo0202:Enabling,
AUTHOR="Mon-Yen Luo and Chu-Sing Yang",
TITLE="Enabling fault resilience for web services",
JOURNAL=comcom,
VOLUME=25,
NUMBER=3,
PAGES="198-209",
MONTH=feb,
YEAR=2002,
REFERENCES=55,
KEYWORDS="fault resilience; WWW; internet service",
ABSTRACT="Today, a successful Internet service is absolutely critical to
be up 100 percent of the time. Server clustering is the most promising
approach to meet this requirement. However, the existing Web
server-clustering solutions can merely provide high availability derived
from its redundant nature, but offer no guarantee about fault resilience
for the service. In this paper, we address this problem by implementing
an innovative mechanism that enables a Web request to be smoothly
migrated and recovered on another working node in the presence of server
failure. We will show that the request migration and recovery could be
efficiently achieved in the manner of user transparency. The achieved
capability of fault resilience is important and essential for a variety
of critical services (e.g. E-commerce), which are increasingly
widespread in use. Our approach takes an important step towards
providing a highly reliable Web service.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Safw0202:Infrastructure,
AUTHOR="Ahmed Safwat and Hossam Hassanein",
TITLE="Infrastructure-based routing in wireless mobile ad hoc networks",
JOURNAL=comcom,
VOLUME=25,
NUMBER=3,
PAGES="210-224",
MONTH=feb,
YEAR=2002,
REFERENCES=12,
KEYWORDS="wireless mobile ad hoc communications; multi-hop networks;
wireless mobile infrastructure; routing; quality of Service; performance
evaluation",
ABSTRACT="In this paper, we propose a new protocol for wireless mobile
ad hoc communications, which establishes a dynamic wireless mobile
infrastructure to mimic and maintain the operation of the fixed
infrastructure in cellular networks, namely, the Virtual Base Stations
(VBS) infrastructure-creation protocol. In the VBS protocol, a mobile
station is elected from a set of nominees to act as a temporary base
station within its zone. Mobile stations elected as VBS are used to
track other mobile stations in the ad hoc network. Moreover, we propose
a novel routing protocol, namely, VBS routing. VBS routing utilizes the
mobility-tracking mechanism of the VBS infrastructure-creation protocol,
to route packets from a source node to a destination node. The new
routing protocol is shown to outperform existing ad hoc routing
protocols in terms of packet delivery and routing load. The VBS
architecture would facilitate the development of a comprehensive and
promising framework for Quality of Service (QoS) management in wireless
mobile ad hoc networks once the proper integration of the MAC protocol
with the routing and call admission control mechanisms is established.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Kork0202:Efficient,
AUTHOR="Turgay Korkmaz and Marwan Krunz and Spyros Tragoudas",
TITLE="An efficient algorithm for finding a path subject to two additive
constraints",
JOURNAL=comcom,
VOLUME=25,
NUMBER=3,
PAGES="225-238",
MONTH=feb,
YEAR=2002,
REFERENCES=36,
KEYWORDS="path selection; additive constraints; QoS routing; lagrangian
techniques",
ABSTRACT="One of the key issues in providing end-to-end
quality-of-service (QoS) guarantees in packet networks is how to
determine a feasible path that satisfies a number of QoS constraints.
For two or more additive constraints, the problem of finding a feasible
path is NP-complete that cannot be exactly solved in polynomial time.
Accordingly, several heuristics and approximation algorithms have been
proposed for this problem. Many of these algorithms suffer from either
excessive computational cost or low performance. In this paper, we
provide an efficient approximation algorithm for finding a path subject
to two additive constraints. The worst-case computational complexity of
this algorithm is within a logarithmic number of calls to Dijkstra's
shortest path algorithm. Its average complexity is even much lower than
that, as demonstrated by simulation experiments. The performance of the
proposed algorithm is justified via theoretical bounds that are provided
for the optimal version of the path selection problem. To achieve
further performance improvement, several extensions to the basic
algorithm are also provided at very low computational cost. Extensive
simulations are used to demonstrate the high performance of the proposed
algorithm and to contrast it with other path selection algorithms.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Raja0202:Packet,
AUTHOR="Srini Rajagopal and Martin Reisslein and Keith W. Ross",
TITLE="Packet multiplexers with adversarial regulated traffic",
JOURNAL=comcom,
VOLUME=25,
NUMBER=3,
PAGES="239-253",
MONTH=feb,
YEAR=2002,
REFERENCES=27,
KEYWORDS="buffer-bandwidth tradeoff curve; call admission control; leaky
bucket; quality-of-service guarantees; resource allocation; statistical
multiplexing; worst-case sources",
ABSTRACT="We consider a finite-buffer packet multiplexer to which
traffic arrives from several independent sources. The traffic from each
of the sources is regulated, i.e. the amount of traffic that can enter
the multiplexer is constrained by known regulator constraints. The
regulator constraints depend on the source and are more general than
those resulting from cascaded leaky buckets. We assume that the traffic
is adversarial to the extent permitted by the regulators. For lossless
multiplexing, we show that if the original multiplexer is lossless it is
possible to allocate bandwidth and buffer to the sources so that the
resulting segregated systems are lossless. For lossy multiplexing, we
use our results for lossless multiplexing to estimate the loss
probability of the multiplexer. Our estimate involves transforming the
original system into two independent resource systems, and using
adversarial sources for the two independent resources to obtain a bound
on the loss probability of the transformed system. We show that the
adversarial sources are not extremal on¯off sources, even when the
regulator consists of a peak rate controller in series with a leaky
bucket. We explicitly characterize the form of the adversarial source
for the transformed problem. We also provide numerical results for the
case of the simple regulator.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Hong0202:CORBA,
AUTHOR="Won-Kyu Hong and Choong-Seon Hong",
TITLE="The {CORBA-based} unified event management framework in
multi-layer networks",
JOURNAL=comcom,
VOLUME=25,
NUMBER=3,
PAGES="254-264",
MONTH=feb,
YEAR=2002,
REFERENCES=14,
KEYWORDS="event management; inter-domain management; network monitoring;
CORBA; OMG notification service",
ABSTRACT="An efficient integrated event management is a great concern to
a telecommunications industry. An integrated event management across
multi-layer networks is much more complex than that across a specific
layer network. Although there are several event management frameworks
[Ericsson Research Canada March (2000); Integrated Network Management ¯¯
Proceedings of the Fourth International Symposium on Integrated Network
Management (1995) 290¯301; Integrated Network Management ¯¯ Proceedings
of the Fourth International Symposium on Integrated Network Management
(1995) 278¯289], each of them is designed to apply only a specific
single layer network. The frameworks are the cause of a lack of
scalability and of the difficulties of integrated event management of
multi-layer networks. On the other hand, CORBA Notification Service (NS)
[OMG, CORBA Services: Common Object Service Specification March (1995);
OMG, The Common Object Request Broker: Architecture and Specification
July (1995)] is a promising event propagation platform to build an
integrated event management for multi-layer networks, but its
performance is not sufficient for bulk events in such networks. This
paper proposes the unified event management framework that can uniformly
be applicable to multi-layer networks of ATM, Frame Relay (FR) and IP
without any customization or modification. In order to define such a
framework, this paper proposes a common network model and an event
information model that is commonly applicable to the multi-layer
networks, which identifies the meaning and relationship of information
manipulated by the framework. This paper also suggests an event queue
management scheme to improve the insufficient performance of CORBA NS
stemmed mainly from its persistency property. Replacing this with the
proposed queue management scheme and comparing the event management
performance of the framework with that of CORBA NS, this paper will show
that former gives a much higher event propagation performance than that
of the latter.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Vida0202:Methodology,
AUTHOR="José-Ramón Vidal and Luis Guijarro",
TITLE="A methodology for developing simulation models of {ATM} networks
in {SDL} language",
JOURNAL=comcom,
VOLUME=25,
NUMBER=3,
PAGES="265-287",
MONTH=feb,
YEAR=2002,
REFERENCES=15,
KEYWORDS="specification and description language; network modelling;
multilayer simulation; asynchronous transfer mode; traffic management",
ABSTRACT="This paper describes a modelling methodology based on formal
description techniques (FDTs). This methodology develops simulation
models designed to evaluate asynchronous transfer mode (ATM) networks.
The purpose of such networks is to integrate multiple communication
services by providing a variety of service classes with different
characteristics, making a wide range of adaptation protocols and traffic
management mechanisms necessary. All these mechanisms and their
interactions are usually evaluated by means of simulation, but this
requires complex simulation models to be developed. Our proposal is
based on specification and description language (SDL), and using its
object-oriented capabilities to systematically develop simulation
models, including many combinations of the mechanisms under study, to
any degree of complexity. In order to demonstrate its use, the
simulation results were applied in a significant case study.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Bens0202:Dynamical,
AUTHOR="Abderrahim Benslimane and Abdelhafid Abouaissa",
TITLE="Dynamical grouping model for distributed real time causal
ordering",
JOURNAL=comcom,
VOLUME=25,
NUMBER=3,
PAGES="288-302",
MONTH=feb,
YEAR=2002,
REFERENCES=21,
KEYWORDS="multimedia application; delta-causality order; group
communication systems; multicast; delay jitter; synchronization
protocol",
ABSTRACT="This paper proposes a hierarchical architecture of
communication allowing scalability in the case of multimedia
applications such as teleconferencing where there is a large number of
participants. From an unspecified communication network, we propose to
decompose the system into local groups. Each local group is defined as a
finite set of processes, which computes by performing some capacity
tests. The proposed architecture guarantees a dynamic reconfiguration
between local group members. Over this architecture, we present a real
time synchronization protocol which allows to solve the problems of
delay jitter and local clocks drift, and ensures real-time causal
delivery. The protocol computes also the global delivery time of
messages for the group multicast. We show that the proposed architecture
reduces the buffer size and the use of the bandwidth compared to a
direct connection architecture (complete graph between senders and
receivers). To illustrate our purpose, we have implemented a
tele-teaching application over LAN Emulation.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Wang0202:High,
AUTHOR="Pi-Chung Wang and Chia-Tai Chan and Yaw-Chung Chen",
TITLE="High-performance {IP} routing table lookup",
JOURNAL=comcom,
VOLUME=25,
NUMBER=3,
PAGES="303-312",
MONTH=feb,
YEAR=2002,
REFERENCES=14,
KEYWORDS="IP routing; classless interdomain routing; pipeline
technique",
ABSTRACT="Nowadays, the commonly used table lookup scheme for IP routing
is based on the so-called classless interdomain routing (CIDR). With
CIDR, routers must find out the best matching prefix (BMP) for IP
packets forwarding, which complicates the IP lookup. Currently, this
process is mainly done in software and several schemes have been
proposed for hardware implementation. Since the IP lookup performance is
a major design issue for the new generation routers, in this article we
propose a fast IP address lookup scheme, which significantly reduces the
forwarding table to fit into SRAM with very low cost. It can also be
implemented in hardware using the pipeline technique. By using our
proposed method, the required memory space can be 90¯170 Kb less than
the previous scheme and three memory accesses for a lookup in the worst
case. When implemented in hardware pipeline architecture, our mechanism
can achieve one routing lookup per memory access.",
URL="http://www.elsevier.com/locate/comcom",
}

@TECHREPORT{Gunt0202:Hypernets,
AUTHOR="Neil J. Gunther",
TITLE="Hypernets -- Good (G)news for Gnutella",
TYPE="technical report",
INSTITUTION="arXiv",
NUMBER="cs.PF/0202019",
MONTH=feb,
YEAR=2002,
KEYWORDS="Performance; distributed; parallel; and cluster Computing;
information retrieval; networking and Internet architecture",
ABSTRACT="Criticism of Gnutella network scalability has rested on the
bandwidth attributes of the original interconnection topology:  a Cayley
tree.  Trees, in general, are known to have lower aggregate bandwidth
than higher dimensional topologies e.g., hypercubes, meshes and tori.
Gnutella was intended to support thousands to millions of peers. Studies
of interconnection topologies in the literature, however, have focused
on hardware implementations which are limited by cost to a few thousand
nodes.  Since the Gnutella network is virtual, hyper-topologies are
relatively unfettered by such constraints.  We present performance
models for several plausible hyper-topologies and compare their query
throughput up to millions of peers.  The virtual hypercube and the
virtual hypertorus are shown to offer near linear scalability subject to
the number of peer TCP/IP connections that can be simultaneously kept
open.",
URL="http://arXiv.org/abs/cs/0202019",
}

@TECHREPORT{Cama0202:Signalling,
AUTHOR="Gonzalo Camarillo and Henning Schulzrinne and Raimo Kantola",
TITLE="Signalling Transport Protocols",
TYPE="Technical report",
INSTITUTION="Dept. of Computer Science, Columbia University",
ADDRESS="New York",
NUMBER="CUCS-002-02",
MONTH=feb,
YEAR=2002,
LANGUAGE="English",
KEYWORDS="SIP; SCTP; TCP",
ABSTRACT="SCTP is a newly developed transport protocol tailored for
signalling transport. Whereas in theory SCTP is supposed to achieve a
much better performance than TCP and UDP, at present there are no
ex-perimental results showing SCTPs real benefits. This paper analyzes
SCTPs strengths and weaknesses and provides simulation results. We
implemented SIP on top of UDP, TCP and SCTP in the network simulator and
compared the three transport protocols under different network
conditions.",
URL="http://www.cs.columbia.edu/~library/TR-repository/reports/reports-2002/cucs-002-02.pdf",
}

@TECHREPORT{Papa0202:Performance,
AUTHOR="Maria Papadopouli and Henning Schulzrinne",
TITLE="Performance of data dissemination and message relaying in mobile
ad hoc networks",
TYPE="Technical Report",
INSTITUTION="Dept. of Computer Science, Columbia University",
ADDRESS="New York, New York",
NUMBER="CUCS-004-02",
MONTH=feb,
YEAR=2002,
KEYWORDS="ad-hoc networks; peer-to-peer",
ABSTRACT="This paper presents 7DS, a novel peer-to-peer resource sharing
system.  7DS is an architecture, a set of protocols and an
implementation enabling the exchange of data among peers that are not
necessarily connected to the Internet.  Peers can be either mobile or
stationary.  We focus on three different facets of cooperation, namely,
data sharing, message relaying and network connection sharing.  7DS
enables wireless devices to discover, disseminate, relay information
among each other to increase the data access.  We evaluate via extensive
simulations the effectiveness of our system for data dissemination and
message relaying among mobile devices with a large number of user
mobility scenarios.  We model several general data dissemination
approaches and investigate the effect of the wireless coverage range,
7DS host density, and cooperation strategy among the mobile hosts as a
function of time.  We also present a power conservation mechanism that
is beneficial, since it increases the power savings, without degrading
the data dissemination.  Using theory from random walks, random
environments and diffusion of controlled processes, we model one of
these data dissemination schemes and show that the analysis confirms the
simulation results for this scheme.",
URL="http://www.cs.columbia.edu/~library/TR-repository/reports/reports-2002/cucs-004-02.ps.gz",
}

@TECHREPORT{Cisc0202:SIP,
AUTHOR="{Cisco Systems}",
TITLE="{SIP:} The Promise Becomes Reality",
TYPE="White paper",
INSTITUTION="{Cisco Systems}",
ADDRESS="San Jose, California",
MONTH=feb,
YEAR=2002,
KEYWORDS="SIP; Internet telephony",
ABSTRACT="This paper discusses the SIP protocol and its suitability as
the foundation for next-generation networks, defines the role of SIP in
a multiprotocol network, discusses the evolution of Cisco SIP products
and solutions, and reviews a variety of revenue-generating services
currently being deployed.",
URL="http://www.sipcenter.com/files/Cisco\_sipbc\_wp.pdf",
}

@ARTICLE{Coff0202:Growth,
AUTHOR="K. G. Coffman and A. M. Odlyzko",
TITLE="Growth of the {Internet}",
JOURNAL="Optical Fiber Telecommunications",
VOLUME="IV",
NUMBER="B",
PAGES=44,
MONTH=feb,
YEAR=2002,
REFERENCES=53,
ABSTRACT="The Internet is the main cause of the recent explosion of
activity in optical fiber telecommunications. The high growth rates
observed on the Internet, and the popular perception that growth rates
were even higher, led to an upsurge in research,development, and
investment in telecommunications. The telecom crash of 2000 occurred
when investors realized that transmission capacity in place and under
construction greatly exceeded actual traffic demand. This chapter
discusses the growth of the Internet and compares it with that of other
communication services. \% It also presents speculations about future
developments. Internet traffic is growing, approximately doubling each
year. There are reasonable arguments that it will continue to grow at
this rate for the rest of this decade. If this happens, then in a few
years, we may have a rough balance between supply and demand.",
URL="http://www.dtc.umn.edu/~odlyzko/doc/oft.internet.growth.pdf",
}

@INPROCEEDINGS{Coar0202:Performance,
AUTHOR="Cristian Coarfa and Peter Druschel and Dan Wallach",
TITLE="Performance Analysis of {TLS} Web Servers",
BOOKTITLE="Network and Distributed System Security Symposium",
MONTH=feb,
YEAR=2002,
REFERENCES=27,
KEYWORDS="TLS; performance analysis; web server",
ABSTRACT="TLS is the protocol of choice for securing today’s ecommerce
and online transactions, but adding TLS to a web server imposes a
significant overhead relative to an insecure web server on the same
platform.  We perform a comprehensive study of the performance costs of
TLS.  Our methodology is to profile TLS web servers with tracedriven
workloads, replacing individual components inside TLS with no-ops, and
measuring the observed increase in server throughput.  We estimate the
relative costs of each component within TLS, predicting the areas for
which future optimizations would be worthwhile.  Our results we show
that RSA accelerators are effective for e-commerce site workloads,
because they experience low TLS session reuse.  Accelerators appear to
be less effective for sites where all the requests are handled by a TLS
server, thus having higher session reuse rate; investing in a faster CPU
might prove more effective.",
URL="http://www.isoc.org/isoc/conferences/ndss/02/proceedings/papers/coarfa.pdf",
}

@TECHREPORT{Ludd0202:Location,
AUTHOR="Brendan Ludden and Andrew Pickford and John Medland Britisch and
Hank Johnson and Francois Brandon and Lars Erik Axelsson and Knut
Viddal-Ervik and Bert Dorgelo",
TITLE="Report on implementation issues related to access to location
information by emergency services {(E112)} in the European Union",
TYPE="Final Report",
INSTITUTION="Coordination Group on Access to Information Services for
Emergency Services (CGALIES)",
MONTH=feb,
YEAR=2002,
KEYWORDS="911; emergency services; 112",
ABSTRACT="Each year in the European Union, several millions of citizens
dial an emergency call number to access emergency services.  Due to the
increasing penetration of mobile telephony in the society, the share of
emergency calls emanating from mobile networks is continuously growing
and the fact is that today, many mobile callers in an emergency
situation are not able to indicate the precise location for a optimum
response.  Due to its nature, Emergency communications is particularly
an area where information needs to pass across public and private sector
boundaries.",
URL="http://europa.eu.int/comm/environment/civil/pdfdocs/cgaliesfinalreportv1\_0.pdf",
}

@ARTICLE{Nahu0202:Performance,
AUTHOR="Erich Nahum and Tsipora Barzilai",
TITLE="Performance Issues in {WWW} Servers",
JOURNAL=ieanep,
VOLUME=10,
NUMBER=1,
MONTH=feb,
YEAR=2002,
LANGUAGE="English",
KEYWORDS="performance;server;HTTP;TCP",
ABSTRACT="This paper evaluates performance issues in WWW servers on
UNIX-style platforms. While other work has focused on reducing the use
of kernel primitives, we consider ways in which the operating system and
the network protocol stack can improve support for high-performance WWW
servers. We study techniques in 3 categories: new socket functions,
per-byte optimizations, and per-connection optimizations. We examine two
proposed socket functions, acceptex() and sendfile(), comparing
sendfile()''s effectiveness with an mmap()/writev() combination. We show
how \\sendfile provides the necessary semantic support to eliminate
copies and checksums in the kernel, and quantify the utility of the
function''s header and close options. We also present mechanisms to
reduce the number of packets exchanged in an HTTP transaction, both
increasing server performance and reducing network utilization, without
compromising interoperability. We evaluate these issues with a
high-performance WWW server, using IBM AIX workstations connected over
100 mbps Ethernet, driven by the WebStone and SURGE WWW server workload
generators. Microbenchmark results using WebStone show that our
combination of mechanisms can improve server throughput by up to 64
percent, and can eliminate up to 33 percent of the packets in an HTTP
exchange. Macrobenchmark results with SURGE show an aggregate increase
in server throughput of 25 percent.",
URL="http://www.research.ibm.com/people/n/nahum/publications/ton02-www-camera.pdf",
}

@MANUAL{Su0202:Mobile,
AUTHOR="Gong Su and Jason Nieh",
TITLE="Mobile Communication with Virtual Network Address Translation",
EDITION="CUCS-003-02",
ORGANIZATION="Department of Computer Science, Columbia University",
ADDRESS="New York, NY",
MONTH=feb,
YEAR=2002,
LANGUAGE="English",
}

@ARTICLE{Lodh0202:Text,
AUTHOR="H. Lodhi and C. Saunders and J. Shawe-Taylor and N. Cristianini
and C. Watkins",
TITLE="Text Classification using String Kernels",
JOURNAL="Journal of Machine Learning Research",
VOLUME=2,
PAGES="419-444",
MONTH=feb,
YEAR=2002,
LANGUAGE="English",
}

@ARTICLE{Camp0202:Comparison,
AUTHOR="Andrew T Campbell and Javier Gomez and Seung-Hoon Kim and Zoltán
Richárd Turányi and Chieh-Yih Wan and Andras Valko",
TITLE="Comparison of {IP} Micro-Mobility Protocols",
JOURNAL="IEEE Wireless Communications Magazine",
VOLUME=9,
NUMBER=1,
MONTH=feb,
YEAR=2002,
}

@TECHREPORT{Shen0202:Interrogation,
AUTHOR="Chien-Chung Shen and Girish Borkar and Sundaram Rajagopalan and
Chaiporn Jaikaeo",
TITLE="Interrogation-Based Relay Routing for Ad hoc Satellite Networks",
INSTITUTION="Computer and Information Sciences, University of Delaware",
ADDRESS="Newark, DE 19716",
MONTH=feb,
YEAR=2002,
}

@INPROCEEDINGS{Mont0202:Statistically,
AUTHOR="Gabriel Montenegro and Claude Castelluccia",
TITLE="Statistically Unique and Cryptographically Verifiable {(SUCV)}
Identifiers and Addresses",
BOOKTITLE="NDSS '02",
MONTH=feb,
YEAR=2002,
}

@ARTICLE{Dovr0202:Proportional,
AUTHOR="Constantinos Dovrolis and Dimitrios Stiliadis and Parmesh
Ramanathan",
TITLE="Proportional Differentiated Services: Delay Differentiation and
Packet Scheduling",
JOURNAL=ieanep,
VOLUME=10,
NUMBER=1,
PAGES="12-26",
MONTH=feb,
YEAR=2002,
LANGUAGE="English",
REFERENCES=34,
KEYWORDS="Dynamic priorities; quality of service; resource management
algorithms",
ABSTRACT="The proportional differentiation model provides the network
operator with the 'tuning knobs' for adjusting the per-hop
quality-of-service (QoS) ratios between classes, independent of the
class loads. This paper applies the proportional model in the
differentiation of queueing delays, and investigates appropriate packet
scheduling mechanisms. Starting from the proportional delay
differentiation (PDD) model, we derive the average queueing delay in
each class, show the dynamics of the class delays under the PDD
constraints, and state the conditions in which the PDD model is
feasible. The feasibility model of the model can be determined from the
average delays that result with the strict priorities scheduler. We then
focus on scheduling mechanisms that can implement the PDD model, when it
is feasible to do so. The proportional average delay (PAD) scheduler
meets the PDD constraints, when they are feasible, but it exhibits a
pathological behavior in short timescales. The waiting time priority
(WTP) scheduler, on the other hand, approximates the PDD model closely,
even in the short timescales of a few packet departures, but only in
heavy load conditions. PAD and WTP serve as motivation for the third
scheduler, called hybrid proportional delay (HPD). HPD approximates the
PDD model closely, when the model is feasible, independent of the class
load distribution. Also, HPD provides predictable delay differentiation
even in short timescales.",
URL="http://ieeexplore.ieee.org/iel5/90/21263/00986503.pdf?isNumber=21263\&prod=JNL\&arnumber=986503\&arSt=12\&ared=26\&arAuthor=Dovrolis\%2C+C.\%3B+Stiliadis\%2C+D.\%3B+Ramanathan\%2C+P.",
}

@ARTICLE{Reis0202:Framework,
AUTHOR="Martin Reisslein and Keith W. Ross and Srinivas Rajagopal",
TITLE="A Framework for Guaranteeing Statistical {QoS}",
JOURNAL=ieanep,
VOLUME=10,
NUMBER=1,
PAGES="27-42",
MONTH=feb,
YEAR=2002,
LANGUAGE="English",
REFERENCES=56,
KEYWORDS="bufferless multiplexing; call admission control; end-to-end
QoS; multimedia traffic; regulated traffic; statistical multiplexing;
statistical QoS; traffic smoothing",
ABSTRACT="Continuous-media traffic (i.e., audio and video) can tolerate
some loss but have rigid delay constraints. A natural QoS requirement
for a continuous-media connection is a prescribed limit on the fraction
of traffic that exceeds an end-to-end delay constraint. We propose and
analyze a framework that provides such a statistical QoS guarantee to
traffic in a packet-switched network. Providing statistical guarantees
in a network is a notoriously difficult problem because traffic flows
lose their original statistical characterizations at the outputs of
queues. Our scheme uses bufferless statistical multiplexing combined
with cascaded leaky buckets for smoothing and traffic contracting. This
scheme along with a novel method for bounding the loss probability gives
a tractable framework for providing end-to-end statistical QoS. Using
MPEG video traces, we present numerical results that compare the
connection-carrying capacity of our scheme with that of guaranteed
service schemes (i.e., no loss) using GPS and RCS. Our numerical work
indicates that our scheme can support significantly more connections
without introducing significant traffic loss.",
URL="http://ieeexplore.ieee.org/iel5/90/21263/00986511.pdf?isNumber=21263\&prod=JNL\&arnumber=986511\&arSt=27\&ared=42\&arAuthor=Reisslein\%2C+M.\%3B+Ross\%2C+K.W.\%3B+Rajagopal\%2C+S.",
}

@ARTICLE{Cobb0202:Preserving,
AUTHOR="Jorge Cobb",
TITLE="Preserving Quality of Service Guarantees in Spite of Flow
Aggregation",
JOURNAL=ieanep,
VOLUME=10,
NUMBER=1,
PAGES="43-53",
MONTH=feb,
YEAR=2002,
LANGUAGE="English",
REFERENCES=31,
KEYWORDS="flow aggregation; quality of service; real-time scheduling",
ABSTRACT="We investigate how quality of service may be guaranteed to a
flow of packets in the presence of flow aggregation. For efficiency,
multiple flows, known as the constituent flows, are merged together
resulting in a single aggregate flow. After the network node where the
aggregation occurs, packet schedulers are aware of the aggregate flow,
but are unaware of its constituent flows. In spite of this, we show that
quality of service may be guaranteed to the constituent flows, provided
the aggregation is performed fairly. When the delay bound of a flow is
de-coupled from the flow's reserved rate, flow aggregation preserves the
delay bound. When the delay bound of a flow is coupled to the flow's
reserved rate, flow aggregation preserves, and in some cases improves,
the delay bound.",
URL="http://ieeexplore.ieee.org/iel5/90/21263/00986522.pdf?isNumber=21263\&prod=JNL\&arnumber=986522\&arSt=43\&ared=53\&arAuthor=Cobb\%2C+J.A.",
}

@ARTICLE{Yan0202:Qos,
AUTHOR="Shuqian Yan and Michalis Faloutsos and Anindo Banerjea",
TITLE="QoS-Aware Multicast Routing for the Internet: The Design and
Evaluation of {QoSMIC}",
JOURNAL=ieanep,
VOLUME=10,
NUMBER=1,
PAGES="54-66",
MONTH=feb,
YEAR=2002,
LANGUAGE="English",
REFERENCES=56,
KEYWORDS="multicast routing; protocol evaluation; quality of service",
ABSTRACT="One of the main problems of the current Internet
infrastructure is its inability to provide services at consistent
quality-of-service (QoS) levels. At the same time, many emerging
Internet applications, such as teleeducation, and teleconferencing,
require multicast protocols that will provide the necessary QoS. In this
paper, we propose QoSMIC, a multicast routing protocol for the Internet,
that provides QoS-sensitive paths in a scalable, resource-efficient, and
flexible way. QoSMIC differs from the previous protocols in that it
identifies multiple paths and selects the one that can provide the
required QoS. Two other key advantages of QoSMIC are its flexibility and
adaptivity. First, the distribution tree does not have to be rooted at a
preselected core router. Second, we can tradeoff between efficiency
metrics depending on our needs; for example, we can tradeoff routing
efficiency for a reduction in the control messages. Extensive
simulations show that our protocol improves the resources utilization
and the end-to-end performance compared to the current protocols.
Specifically, our protocol reduces the call blocking probability by a
factor of six and reduces the end-to-end delay by as much as 90\%
compared to the PIM protocol.",
URL="http://ieeexplore.ieee.org/iel5/90/21263/00986530.pdf?isNumber=21263\&prod=JNL\&arnumber=986530\&arSt=54\&ared=66\&arAuthor=Shuqian+Yan\%3B+Faloutsos\%2C+M.\%3B+Banerjea\%2C+A.",
}

@ARTICLE{Zhan0202:Scalable,
AUTHOR="Xi Zhang and Kang Shin and Debanjan Saha and Dilip Kandlur",
TITLE="Scalable Flow Control for Multicast {ABR} Services in {ATM}
Networks",
JOURNAL=ieanep,
VOLUME=10,
NUMBER=1,
PAGES="67-85",
MONTH=feb,
YEAR=2002,
LANGUAGE="English",
REFERENCES=19,
KEYWORDS="alpha-control; ABR; ATM; buffer control; feedback-soft
synchronization (SSP); flow control; multicast; multicast flow control;
RTT variations; scalability; second-order rate control; target buffer
occupancy",
ABSTRACT="We propose a flow-control scheme for multicast ABR services in
ATM networks. At the heart of the proposed scheme is an optimal
second-order rate control algorithm, called the \α-control,
designed to deal with the variation in RM-cell round-trip time (RTT)
resulting from dynamic drift of the bottleneck in a multicast tree.
Applying two-dimensional rate control, the proposed scheme makes the
rate process converge to the available bandwidth of the connection's
most congested link sensed by the traffic source. It also confines the
buffer occupancy to a target regime bounded by a finite buffer capacity
as the system enters the equilibrium state. It works well irrespective
of the topology of the multicast tree. Using the fluid analysis, we
model the proposed scheme and analyze the system dynamics for multicast
ABR traffic. We study the convergence properties and derive the
optimal-control conditions for the \α-control. The analytical
results show that the scheme is stable and efficient in the sense that
both the source rate and bottleneck queue length rapidly converge to a
small neighborhood of the designated operating point. We present
simulation results which verify the analytical observations. The
simulation experiments also demonstrate the superiority of the proposed
scheme to the other schemes in dealing with RM-cell RTT and
link-bandwidth variations, achieving fairness in both buffer and
bandwidth occupancies, and enhancing average throughput.",
URL="http://ieeexplore.ieee.org/iel5/90/21263/00986538.pdf?isNumber=21263\&prod=JNL\&arnumber=986538\&arSt=67\&ared=85\&arAuthor=Xi+Zhang\%3B+Shin\%2C+K.G.\%3B+Saha\%2C+D.\%3B+Kandlur\%2C+D.D.",
}

@ARTICLE{Gau0202:Multicast,
AUTHOR="Rung-Hung Gau and Zygmunt J. Haas and Bhaskar Krishnamachari",
TITLE="On Multicast Flow Control for Heterogeneous Receivers",
JOURNAL=ieanep,
VOLUME=10,
NUMBER=1,
PAGES="86-101",
MONTH=feb,
YEAR=2002,
LANGUAGE="English",
REFERENCES=52,
KEYWORDS="multicast; flow control; partition; optimization",
ABSTRACT="In this paper, we study the impact of heterogeneous receivers
on the throughput of multicast flow control and propose a new multicast
flow control algorithm to optimally partition group members into
multiple subgroups. Our main contributions are as follows. First, we
cast the multicast flow control problem in the Internet as the list
partition problem and then prove that the list partition problem is
equivalent to the optimal paging problem in cellular networks. The
result is not only interesting in itself but also essential to derive
the first known analytical bounds for the throughput of multicast flow
control. Furthermore, we propose an algorithm to solve not only the list
partition problem but also the optimal paging problem and the problem of
bulk data transfer using multiple multicast groups. The complexity of
our algorithm is one order less than the best known algorithm designed
only for the problem of bulk data transfer using multiple multicast
groups in the literature. While earlier work uses simulations to justify
the usage of multiple subgroups to deliver information to a large amount
of receivers in heterogeneous networks, we provide the first analytical
support.",
URL="http://ieeexplore.ieee.org/iel5/90/21263/00986549.pdf?isNumber=21263\&prod=JNL\&arnumber=986549\&arSt=86\&ared=101\&arAuthor=Rung-Hung+Gau\%3B+Haas\%2C+Z.J.\%3B+Krishnamachari\%2C+B.",
}

@ARTICLE{Lore0202:Optimal,
AUTHOR="Dean H. Lorenz and Ariel Orda",
TITLE="Optimal Partition of {QoS} Requirements on Unicast Paths and
Multicast Trees",
JOURNAL=ieanep,
VOLUME=10,
NUMBER=1,
PAGES="102-114",
MONTH=feb,
YEAR=2002,
LANGUAGE="English",
REFERENCES=26,
KEYWORDS="broadband networks; convex costs; multicast; QoS partitioning;
QoS-dependent costs; routing; unicast",
ABSTRACT="We investigate the problem of optimal resource allocation for
end-to-end QoS requirements on unicast paths and multicast trees.
Specifically, we consider a framework in which resource allocation is
based on local QoS requirements at each network link, and associated
with each link is a cost function that increases with the severity of
the QoS requirement. Accordingly, the problem that we address is how to
partition an end-to-end QoS requirement into local requirements, such
that the overall cost is minimized. We establish efficient (polynomial)
solutions for both unicast and multicast connections. These results
provide the required foundations for the corresponding QoS routing
schemes, which identify either paths or trees that lead to minimal
overall cost. In addition, we show that our framework provides better
tools for coping with other fundamental multicast problems, such as
dynamic tree maintenance.",
URL="http://ieeexplore.ieee.org/iel5/90/21263/00986559.pdf?isNumber=21263\&prod=JNL\&arnumber=986559\&arSt=102\&ared=114\&arAuthor=Lorenz\%2C+D.H.\%3B+Orda\%2C+A.",
}

@ARTICLE{Medd0202:Impact,
AUTHOR="Aref Meddeb and Andre Girard and Catherine Rosenberg",
TITLE="The Impact of Point-to-Multipoint Traffic Concentration on
Multirate Networks Design",
JOURNAL=ieanep,
VOLUME=10,
NUMBER=1,
PAGES="115-124",
MONTH=feb,
YEAR=2002,
LANGUAGE="English",
REFERENCES=17,
KEYWORDS="ATM; IP; multicast; network design; routing; traffic
concentration; trees",
ABSTRACT="We consider the problem of multirate network design with
point-to-multipoint communications. We give a mathematical formulation
for this problem. Using approximations, we show that traffic
concentration on a small number of links significantly reduces the cost
of the network. We then propose a heuristic based on the traffic
concentration principle to solve the network design problem
approximately. Because this heuristic no longer requires advanced
knowledge of demand matrices, we explain how it can be used as the basis
for real-time design procedures. By means of numerical results, we show
that this heuristic yields nearly optimal solutions.",
URL="http://ieeexplore.ieee.org/iel5/90/21263/00986568.pdf?isNumber=21263\&prod=JNL\&arnumber=986568\&arSt=115\&ared=124\&arAuthor=Meddeb\%2C+A.\%3B+Girard\%2C+A.\%3B+Rosenberg\%2C+C.",
}

@ARTICLE{Mao0202:Loss,
AUTHOR="Guoqiang Mao and Daryoush Habibi",
TITLE="Loss Performance Analysis for Heterogeneous {ONOFF} Sources With
Application to Connection Admission Control",
JOURNAL=ieanep,
VOLUME=10,
NUMBER=1,
PAGES="125-138",
MONTH=feb,
YEAR=2002,
LANGUAGE="English",
REFERENCES=38,
KEYWORDS="ATM; bufferless fluid flow model; measurement based CAC; QoS;
stochastic ordering theory",
ABSTRACT="The bufferless fluid flow model (BFFM) is often used in the
literature for loss performance analysis. We propose an efficient and
effective means of investigating cell loss using the BFFM. We define the
cell loss rate function (CLRF) and use it to characterize the loss
performance of traffic sources in the BFFM. Stochastic ordering theory
is used to study the CLRF. The introduction of the stochastic ordering
theory not only simplifies the theoretical analysis but also makes it
possible to extend the scope of applications and theoretical analysis
presented. A cell loss upper bound for heterogeneous on-off sources is
proposed. The proposed cell loss upper bound is tighter than those
previously proposed in the literature. A connection admission control
(CAC) scheme using online measurements is designed based on the cell
loss upper bound. Extensive simulation is carried out to study the
performance of the CAC scheme. Particular attention is paid to the
impact of inaccuracies in user-declared traffic parameters on the
performance of the CAC scheme. Simulation results indicate that the
proposed CAC scheme can ensure QoS guarantee, is robust to inaccuracies
in declared traffic parameters, and is capable of achieving high link
utilization.",
URL="http://ieeexplore.ieee.org/iel5/90/21263/00986575.pdf?isNumber=21263\&prod=JNL\&arnumber=986575\&arSt=125\&ared=138\&arAuthor=Guoqiang+Mao\%3B+Habibi\%2C+D.",
}

@ARTICLE{Vara0202:Error,
AUTHOR="Srivatsan Varadarajan and Hung Q. Ngo and Jaideep Srivastava",
TITLE="Error Spreading: A Perception-Driven Approach to Handling Error
in Continuous Media Streaming",
JOURNAL=ieanep,
VOLUME=10,
NUMBER=1,
PAGES="139-152",
MONTH=feb,
YEAR=2002,
LANGUAGE="English",
REFERENCES=30,
KEYWORDS="bursty error; error spreading; multimedia",
ABSTRACT="With the growing popularity of the Internet, there is
increasing interest in using it for audio and video transmission.
Perceptual studies of audio and video viewing have shown that viewers
find bursty losses, mostly caused by congestion, to be the most annoying
disturbance, and hence these are critical issues to be addressed for
continuous media streaming applications. Classical error handling
techniques have mostly been geared toward ensuring that the transmission
is correct, with no attention to timeliness. For isochronous traffic
like audio and video, timeliness is a key criterion, and given the high
degree of content redundancy, some loss of content is quite acceptable.
We introduce the concept of error spreading, which is a transformation
technique that permutes the input sequence of packets (from a continuous
stream of data) before transmission. The packets are unscrambled at the
receiving end. The transformation is designed to ensure that bursty
losses in the transformed domain get spread all over the sequence in the
original domain, thus improving the perceptual quality of the stream.
Our error spreading idea deals with both cases where the stream has or
does not have inter-frame dependencies. We next describe a continuous
media transmission protocol and experimentally validate its performance
based on this idea. We also show that our protocol can be used
complementary to other error handling protocols.",
URL="http://ieeexplore.ieee.org/iel5/90/21263/00986585.pdf?isNumber=21263\&prod=JNL\&arnumber=986585\&arSt=139\&ared=152\&arAuthor=Varadarajan\%2C+S.\%3B+Ngo\%2C+H.Q.\%3B+Srivastava\%2C+J.",
}

@ARTICLE{Méda0202:Generalized,
AUTHOR="Muriel Médard and Richard Barry and Steven Finn and Wenbo He and
Steven Lumetta",
TITLE="Generalized Loop-Back Recovery in Optical Mesh Networks",
JOURNAL=ieanep,
VOLUME=10,
NUMBER=1,
PAGES="153-164",
MONTH=feb,
YEAR=2002,
LANGUAGE="English",
REFERENCES=41,
KEYWORDS="WDM; loop-back; network restoration; mesh networks",
ABSTRACT="Current means of providing loop-back recovery, which is widely
used in SONET, rely on ring topologies, or on overlaying logical ring
topologies upon physical meshes. Loop-back is desirable to provide rapid
preplanned recovery of link or node failures in a bandwidth-efficient
distributed manner. We introduce generalized loop-back, a novel scheme
for performing loop-back in optical mesh networks. We present an
algorithm to perform recovery for link failure and one to perform
generalized loop-back recovery for node failure. We illustrate the
operation of both algorithms, prove their validity, and present a
network management protocol algorithm, which enables distributed
operation for link or node failure. We present three different
applications of generalized loop-back. First, we present heuristic
algorithms for selecting recovery graphs, which maintain short maximum
and average lengths of recovery paths. Second, we present WDM-based
loop-back recovery for optical networks where wavelengths are used to
back up other wavelengths. We compare, for WDM-based loop-back, the
operation of generalized loop-back operation with known ring-based ways
of providing loop-back recovery over mesh networks. Finally, we
introduce the use of generalized loop-back to provide recovery in a way
that allows dynamic choice of routes over preplanned directions.",
URL="http://ieeexplore.ieee.org/iel5/90/21263/00986592.pdf?isNumber=21263\&prod=JNL\&arnumber=986592\&arSt=153\&ared=164\&arAuthor=Medard\%2C+M.\%3B+Barry\%2C+R.A.\%3B+Finn\%2C+S.G.\%3B+Wenbo+He\%3B+Lumetta\%2C+S.S.",
}

@ARTICLE{Dese0202:Discrete,
AUTHOR="Bernadette Desert and Hans Daduna",
TITLE="Discrete time tandem networks of queues: Effects of different
regulation schemes for simultaneous events",
JOURNAL=pe,
VOLUME=47,
NUMBER="2-3",
PAGES="73-104",
MONTH=feb,
YEAR=2002,
LANGUAGE="English",
REFERENCES=34,
KEYWORDS="Early arrivals; Late arrivals; Departure first; Arrival first;
State dependent arrivals; State dependent service; Arrival theorem;
Sojourn time distribution; Littles formula; Simultaneous events; Product
form distribution",
ABSTRACT="We consider tandem networks of discrete time Bernoulli servers
with state dependent service rates and a state dependent Bernoulli
arrival stream at the first node of the tandem. We investigate the
effects of different regulation schemes for simultaneous events (e.g.
joint arrivals and departures at some node, or joint departures at
different nodes) on the performance behaviour of the network. The most
serious effects occur with respect to arrival theorems which describe
the distribution of the other customers present in the network and seen
by an arriving customer, or observed by a customer during a jump inside
the network. We prove necessary and sufficient conditions on the
regulation scheme for a customer to observe always the time stationary
behaviour of the network during his jumps. It turns out that we have to
distinguish between local and global control for the regulation of
simultaneous jumps. For different arrival schemes we compute the joint
sojourn time distribution for a customer traversing the tandem. As a
consequence we identify from this a regulation scheme which is known in
the literature, where Littles formula cannot be applied directly.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-456BWWG-1-D4\&\_cdi=5663\&\_orig=browse\&\_coverDate=02\%2F28\%2F2002\&\_sk=999529997\&view=c\&wchp=dGLbVzz-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=9ee4adaf5919005f2760077ffac611e8\&ie=f.pdf",
}

@ARTICLE{Greg0202:Modeling,
AUTHOR="J. A. Gregorio and R. Beivide and F. Vallejo",
TITLE="Modeling of interconnection subsystems for massively parallel
computers",
JOURNAL=pe,
VOLUME=47,
NUMBER="2-3",
PAGES="105-129",
MONTH=feb,
YEAR=2002,
LANGUAGE="English",
REFERENCES=43,
KEYWORDS="Interconnection subsystem; Massively parallel computers;
Stochastic Petri nets; Hardware message router; Performance evaluation;
Simulation",
ABSTRACT="The analysis, design and evaluation of the interconnection
subsystem for massively parallel architectures is normally carried out
using computer simulation tools, requiring elevated computational costs.
Moreover, in some cases, these simulation processes show serious
difficulties when both experiments and results have to be reproduced by
other research or design teams. This work shows the suitability of the
use of formal representation methods, like DSPN (stochastic Petri nets
with deterministic and exponential firing times), for the description of
the message routers, focusing on two important features. Firstly, the
possibility of obtaining network performance indicators through the
simulation of the obtained models with a lower computational cost than
using conventional techniques; in some cases, analytical results can
also be obtained. And secondly, making the basic parameters of the
network design relatively independent of the router implementation
features, thus simplifying the method of establishing the behavior of
new router structures. This approach has been successfully applied to
the analysis of both symmetrical torus and asymmetrical mesh
interconnection topologies, with virtual cut-through flow control,
oblivious routing and random traffic. It should be noted that most
modern parallel computers employ a local buffer space big enough to
store at least a complete packet. Two different functional router
structures have been used in each case: transit buffers located at the
input or at the output router links.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-456BWWG-2-45\&\_cdi=5663\&\_orig=browse\&\_coverDate=02\%2F28\%2F2002\&\_sk=999529997\&view=c\&wchp=dGLbVzz-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=a24542f6ebd116e8b40a058b0c73cc75\&ie=f.pdf",
}

@ARTICLE{Harr0202:Asymptotic,
AUTHOR="Peter Harrison and Sérgio Coury",
TITLE="On the asymptotic behaviour of closed multiclass queueing
networks",
JOURNAL=pe,
VOLUME=47,
NUMBER="2-3",
PAGES="131-138",
MONTH=feb,
YEAR=2002,
LANGUAGE="English",
REFERENCES=9,
KEYWORDS="Queueing networks; Multiple classes; Normalising constant;
Asymptotic analysis; Stochastic networks",
ABSTRACT="An expression for the generating function of the normalising
constant is obtained for a closed, multiclass Markovian queueing network
in terms of similar functions for networks with one fewer class. In this
way a recursive algorithm can be implemented to calculate normalising
constants, and hence, many performance measures, in terms of the
normalising constant function for single class networks, which is well
understood. The technique is illustrated for a simple two-class network
and explains simply some interesting asymptotic properties.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-44CH30W-1-5T\&\_cdi=5663\&\_orig=browse\&\_coverDate=02\%2F28\%2F2002\&\_sk=999529997\&view=c\&wchp=dGLbVzz-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=f77001357e1c2acb9363f947f96a3f38\&ie=f.pdf",
}

@ARTICLE{Ho0202:Analytical,
AUTHOR="Julian Ho and Samar Singh and Neeraj Sharma",
TITLE="Analytical models for Replicate-At-Send multicasting in
shared-memory switches",
JOURNAL=pe,
VOLUME=47,
NUMBER="2-3",
PAGES="139-162",
MONTH=feb,
YEAR=2002,
LANGUAGE="English",
REFERENCES=32,
KEYWORDS="Analytical modelling; ATM switching; Multicasting;
Shared-memory",
ABSTRACT="Shared-memory switches are still in commercial use and in the
future will possibly be used in large-scale multistage architectures.
The need to handle multicasting is also growing. In this paper
analytical models are presented for shared-memory switches with the
Replicate-At-Send-distinct address queue multicast scheme. Models for
both Random (Bernoulli) and Bursty (Correlated) traffic sources are
presented. The models are accurate for various loads, with different
ratios of multicast traffic and a range of fanout sizes. They can be
further extended to analyse more complex multicast schemes or multistage
architectures.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-44J6NSW-1-57\&\_cdi=5663\&\_orig=browse\&\_coverDate=02\%2F28\%2F2002\&\_sk=999529997\&view=c\&wchp=dGLbVzz-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=f7b448a6825e72d33e9a4a49f4c5bf20\&ie=f.pdf",
}

@ARTICLE{Abda0202:Sensitivity,
AUTHOR="Haïscam Abdallah and Moulaye Hamza",
TITLE="On the sensitivity analysis of the expected accumulated reward",
JOURNAL=pe,
VOLUME=47,
NUMBER="2-3",
PAGES="163-179",
MONTH=feb,
YEAR=2002,
LANGUAGE="English",
REFERENCES=25,
KEYWORDS="Computing system; Expected accumulated reward; Sensitivity;
Uniformization; IRK3",
ABSTRACT="This paper deals with the sensitivity computation of the
expected accumulated reward of Markov models. Very often, we are facing
the problem of the computation time, especially when the Markov process
is stiff. We consider the standard uniformization method for which the
global error may be easily bounded. Because the time complexity of this
method becomes large when the stiffness increases, we then suggest an
ordinary differential equations method, the third-order implicit
RungeKutta method. After providing a new way of writing the system of
equations to be solved, we apply this method with a stepsize choice
different from the classical one in order to accelerate the algorithm
execution. This method is interesting for stiff Markov models but
unfortunately, it is difficult to control the global error. We propose a
new approach based on the uniformized power technique. This method will
save computation time if the mission time is long and the state space is
not too large. Moreover, this method integrates an efficient error
control mechanism. The time complexities of the three methods are
compared via a concrete example.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-44J6NSW-2-C0\&\_cdi=5663\&\_orig=browse\&\_coverDate=02\%2F28\%2F2002\&\_sk=999529997\&view=c\&wchp=dGLbVzz-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=ae745fe7501f27823b5b36493eef03bc\&ie=f.pdf",
}

@ARTICLE{Mamo0202:Stochastic,
AUTHOR="Mouad Ben Mamoun and Nihal Pekergin",
TITLE="Stochastic delay bounds of fair queuing policies by analyzing
weighted round robin-related policies",
JOURNAL=pe,
VOLUME=47,
NUMBER="2-3",
PAGES="181-196",
MONTH=feb,
YEAR=2002,
LANGUAGE="English",
REFERENCES=12,
KEYWORDS="Fair queuing policies; Stochastic comparison; Sample-path
stochastic ordering",
ABSTRACT={We propose to apply the stochastic comparison method to
evaluate the delay characteristics of generalized processor sharing
(GPS)-related fair queuing (FQ) policies in a stochastic setting. These
policies have complex dynamics, and their delays are evaluated through
deterministic worst-case bounds under the leaky bucket-constrained
traffics. Our approach consists to define "bounding" weighted round
robin (WRR)-related policies for some GPS-related policies: under the
same arrival process, the departure instants under the bounding policy
are later or equal to the departure instants under the FQ policy for
each cell. This sample-path comparison allows us to establish the
stochastic comparison of delay distributions in the strong stochastic
ordering sense. By defining WRR-related policies as bounding policies,
we are able to carry out the Markovian analysis. Since our approach lets
us to take into account explicitly the arrival process, the proposed
bounds give more insight on delay characteristics than the deterministic
bounds.},
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-44SKDF0-1-5R\&\_cdi=5663\&\_orig=browse\&\_coverDate=02\%2F28\%2F2002\&\_sk=999529997\&view=c\&wchp=dGLbVzz-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=9939c542f0e4229995b353ada011ae96\&ie=f.pdf",
}

@ARTICLE{Suár0202:New,
AUTHOR="A. Suárez-González and J. C. López-Ardao and C. López-García and
M. Fernández-Veiga and R. Rodríguez-Rubio and M. E. Sousa-Vieira",
TITLE="A new heavy-tailed discrete distribution for {LRD} M/G/infinite
sample generation",
JOURNAL=pe,
VOLUME=47,
NUMBER="2-3",
PAGES="197-219",
MONTH=feb,
YEAR=2002,
LANGUAGE="English",
REFERENCES=28,
KEYWORDS="M/G/infinite processes; Long-range dependence; Self-similar
processes; Synthetic generation; Pareto distribution",
ABSTRACT="Several traffic measurement reports have convincingly shown
the presence of self-similarity at the packet level in current networks,
inducing as a result a revolution in the stochastic modeling of traffic.
The essence of this behavior can be adequately captured by several
classes of self-similar stochastic processes. But the use of these in
performance analysis has opened new problems and research issues, also
in simulation studies where the efficient generation of synthetic sample
paths with self-similar properties is one of the fundamental concerns.
In this paper, we present a flexible and efficient generator of
self-similar traces, based on a simple M/G/ model which uses a new
heavy-tailed discrete distribution.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-44TVFD9-1-BH\&\_cdi=5663\&\_orig=browse\&\_coverDate=02\%2F28\%2F2002\&\_sk=999529997\&view=c\&wchp=dGLbVzz-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=8b4e6fdfba446ec2d16db16e881ea465\&ie=f.pdf",
}

@ARTICLE{Yuen0202:Sensitivity,
AUTHOR="Raymond H. M. Yuen and Asrar U. Sheikh",
TITLE="On the sensitivity of {IMT-DS} performance to system parameters",
JOURNAL="Wireless Personal Communications",
VOLUME="vol. 20",
NUMBER=2,
PAGES="163-178",
MONTH=feb,
YEAR=2002,
LANGUAGE="English",
KEYWORDS="IMT-DS, UTRA, Rake receiver, interleaver, Doppler, BER",
}

@ARTICLE{Shei0202:Channel,
AUTHOR="Asrar U. Sheikh and S. F. Hau",
TITLE="Channel Impulse Response Measurements and Interpretations",
JOURNAL="Wireless Personal Communications",
VOLUME=21,
NUMBER=2,
PAGES="219-228",
MONTH=feb,
YEAR=2002,
LANGUAGE="English",
KEYWORDS="Radio Propagation, channel modeling, impulse response,
urban,",
}

@INPROCEEDINGS{Amin0202:Observations,
AUTHOR="Lisa Amini and Henning Schulzrinne",
TITLE="Observations from Router-level {Internet} Traces",
BOOKTITLE="DIMACS Workshop on Internet and WWW Measurement, Mapping and
Modeling",
ADDRESS="Piscataway, New Jersey",
DAYS=13,
MONTH=feb,
YEAR=2002,
KEYWORDS="Internet measurements; AS; BGP",
}

@ARTICLE{Kang0203:Object,
AUTHOR="Jussi Kangasharju and James Roberts and Keith W. Ross",
TITLE="Object replication strategies in content distribution networks",
JOURNAL=comcom,
VOLUME=25,
NUMBER=4,
PAGES="376-383",
MONTH=mar,
YEAR=2002,
REFERENCES=15,
KEYWORDS="optimal replication strategies; content distribution networks;
peer-to-peer networks; cooperation",
ABSTRACT="Recently, the Internet has witnessed the emergence of content
distribution networks (CDNs). In this paper, we study the problem of
optimally replicating objects in CDN servers. In our model, each
Internet autonomous system (AS) is a node with finite storage capacity
for replicating objects. The optimization problem is to replicate
objects so that when clients fetch objects from the nearest CDN server
with the requested object, the average number of ASs traversed is
minimized. We formulate this problem as a combinatorial optimization
problem. We show that this optimization problem is NP complete. We
develop four natural heuristics and compare them numerically using real
Internet topology data. We find that the best results are obtained with
heuristics that have all the CDN servers cooperating in making the
replication decisions. We also develop a model for studying the benefits
of cooperation between nodes, which provides insight into peer-to-peer
content distribution.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Rado0203:Topology,
AUTHOR="Pavlin Radoslavov and Ramesh Govindan and Deborah Estrin",
TITLE="Topology-informed {Internet} replica placement",
JOURNAL=comcom,
VOLUME=25,
NUMBER=4,
PAGES="384-392",
MONTH=mar,
YEAR=2002,
REFERENCES=24,
KEYWORDS="content distribution network; replica placement algorithms;
router fanout",
ABSTRACT="Recently, several studies have looked into the problem of
replicated server placement on the Internet. Some of those studies have
demonstrated that there exists a replica placement algorithm that can
perform within a factor of 1.1¯1.5 of the optimal solution. However,
this particular greedy algorithm requires detailed knowledge about
network topology, and knowledge about expected client locations on the
topology. One of these previous studies has also looked at
topology-informed replica placement. They consider placing replicas at
highly connected nodes in the Autonomous System level graph. In this
paper, we extend their work by investigating the performance of
topology-informed placement on Internet router-level topology. In our
evaluation, we consider approximated policy-based paths, and examine the
sensitivity of our results to different client placements. We find that
topology-informed replica placement methods can achieve average client
latencies which are within a factor of 1.1¯1.2 of the greedy algorithm,
but only if the placement method is designed carefully.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Bili0203:CDN,
AUTHOR="Alexandros Biliris and Chuck Cranor and Fred Douglis and Michael
Rabinovich and Sandeep Sibal and Oliver Spatscheck and Walter Sturm",
TITLE="{CDN} brokering",
JOURNAL=comcom,
VOLUME=25,
NUMBER=4,
PAGES="393-402",
MONTH=mar,
YEAR=2002,
REFERENCES=15,
KEYWORDS="content distribution networks (CDN); content distribution
internetworking (CDI); world wide web (www); domain name system (DNS)",
ABSTRACT="Content distribution networks (CDNs) increase the capacity of
individual Web sites and attempt to deliver content from caches that are
located `closer' to end-users than the origin servers that provide the
content. CDN brokering provides CDNs a way to interoperate by allowing
one CDN to intelligently redirect clients dynamically to other CDNs.
This paper describes the goals, architecture, and performance of a CDN
brokerage system. Our system has been deployed on the Internet on a
provisional basis, and our architectural ideas have helped advance the
evolution of Internet standards for interoperating CDNs.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Rost0203:Cyclone,
AUTHOR="Stanislav A. Rost and John W. Byers and Azer Bestavros",
TITLE="The Cyclone Server Architecture: streamlining delivery of popular
content",
JOURNAL=comcom,
VOLUME=25,
NUMBER=4,
PAGES="403-412",
MONTH=mar,
YEAR=2002,
REFERENCES=33,
KEYWORDS="TCP; FEC; webserver; popularity; concurrency; digital
fountain; tornado codes",
ABSTRACT={We propose a new web server architecture optimized for
delivery of large, popular files. Delivery of such files currently pose
a scalability problem for conventional content providers, which must
devote server-side resources in direct proportion to the high
multiprogramming level induced by a set of these connections. While use
of scalable multicast may remedy this problem some day, multicast is
rarely supported in today's wide-area infrastructure. Our approach
alleviates many of the most serious scalability problems by developing
new server-side mechanisms capable of managing a large set of TCP
connections transporting the same content. The strategy we employ relies
on the use of fast forward error correcting (FEC) codes to generate
encodings of popular content, of which only a small sliding window is
cached in memory at any time instant. The concurrent TCP connections
then access the content only from this shared window, which is globally
useful to all clients. Our method hinges on eliminating unscalable TCP
retransmission buffers, as we can "retransmit" fresh encoding packets in
lieu of the originals with no performance degradation and with no
modifications to client TCP stacks. Ultimately, our Cyclone server
capitalizes on concurrency to maximize sharing of state across different
request threads while minimizing context switching, disk I/O, thrashing
under high load and the cache memory footprint. In this paper, we
describe the design and prototype implementation of our approach as a
Linux kernel subsystem.},
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Vers0203:Joint,
AUTHOR="Olivier Verscheure and Chitra Venkatramani and Pascal Frossard
and Lisa Amini",
TITLE="Joint server scheduling and proxy caching for video delivery",
JOURNAL=comcom,
VOLUME=25,
NUMBER=4,
PAGES="413-423",
MONTH=mar,
YEAR=2002,
REFERENCES=20,
KEYWORDS="content distribution networks; streaming media; server
scheduling; partial caching; batch patching; SLA",
ABSTRACT="We consider the delivery of video assets over a best-effort
network, possibly through a caching proxy located close to the clients
generating the requests. We are interested in the joint server
scheduling and prefix/partial caching strategy that minimizes the
aggregate transmission rate over the backbone network (i.e. average
output server rate) under a cache of given capacity. We present multiple
schemes to address various service levels and client resources by
enabling bandwidth and cache space tradeoffs. We also propose an
optimization algorithm selecting the working set of asset prefixes. We
detail algorithms for practical implementation of our schemes.
Simulation results show that our scheme dramatically outperforms the
full caching technique.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Lee0203:Interactive,
AUTHOR="Sung-Ju Lee and Wei-Ying Ma and Bo Shen",
TITLE="An interactive video delivery and caching system using video
summarization",
JOURNAL=comcom,
VOLUME=25,
NUMBER=4,
PAGES="424-435",
MONTH=mar,
YEAR=2002,
REFERENCES=31,
KEYWORDS="streaming media delivery; web caching; content distribution
networks",
ABSTRACT="With the advance of high-speed network technologies, the
availability and popularity of streaming media content over the Internet
has grown rapidly in recent years. The delivery and caching of streaming
media must be handled in a different fashion than that of traditional
non-streaming objects such as HTML or image files, because of its
distinct characteristics and user viewing patterns. We propose a novel
scheme that provides users with the video summary (a number of key-frame
images) before they download the file, and options for them to select
the starting playback position. We introduce the content analysis
service to achieve these functionalities. The video content analysis
performs shot boundary detection, key-frame selection, and face
detection and tracking. The results of the processing are a segmented
video sequence and an XML-based meta-data describing the video content.
We also design a caching system that utilizes our video abstraction and
summarization technique. Our integrated video delivery and caching
system combines content-aware segmentation, prefix caching, prefetching,
and cooperative caching. We describe how our scheme can be applied in
three proposed caching architectures.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Doyl0203:Trickle,
AUTHOR="Ronald P. Doyle and Jeffrey S. Chase and Syam Gadde and Amin
Vahdat",
TITLE="The Trickle-Down Effect: Web Caching and Server Request
Distribution",
JOURNAL=comcom,
VOLUME=25,
NUMBER=4,
PAGES="345-356",
MONTH=mar,
YEAR=2002,
REFERENCES=18,
KEYWORDS="Zipf; web proxy cache; URL hashing; load balancing; request
distribution",
ABSTRACT="Web proxies and Content Delivery Networks (CDNs) are widely
used to accelerate Web content delivery and to conserve Internet
bandwidth. These caching agents are highly effective for static content,
which is an important component of all Web-based services. This paper
explores the effect of ubiquitous Web caching on the request patterns
seen by other components of an end-to-end content delivery architecture,
including Web server clusters and interior caches. In particular, object
popularity distributions in the Web tend to be Zipf-like, but caches
disproportionately absorb requests for the most popular objects,
changing the reference properties of the filtered request stream in
fundamental ways. We call this the trickle-down effect. This paper uses
trace-driven simulation and synthetic traffic patterns to illustrate the
trickle-down effect and to investigate its impact on other components of
a content delivery architecture, focusing on the implications for
request distribution strategies in server clusters.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Kell0203:Thin,
AUTHOR="Terence Kelly",
TITLE="Thin-client Web access patterns: Measurements from a
cache-busting proxy",
JOURNAL=comcom,
VOLUME=25,
NUMBER=4,
PAGES="357-366",
MONTH=mar,
YEAR=2002,
REFERENCES=39,
KEYWORDS="world wide web; webTV; client trace; browser trace;
instrumentation; workload characterization; duplicate suppression; hit
rates; cache simulation; success function; LRU stack distance; lognormal
models",
ABSTRACT="This paper describes a new technique for measuring Web client
request patterns and analyzes a large client trace collected using the
new method. In this approach, a modified proxy intercepts requests and
serves all responses to clients marked uncacheable, effectively
disabling browser caches and allowing the proxy to record requests that
would otherwise result in silent browser cache hits. WebTV Networks used
a `cache-busting proxy' to collect an unusually large and detailed
anonymized Web client trace in September 2000. It contains over 347
million requests for over 36 million documents by over 37,000 clients
and spans 16 days. By most measures, it is two orders of magnitude
larger than existing Web client traces. We compare cache-busting proxies
with conventional client instrumentation and use the WebTV trace to
explore browser cache performance, reference locality, and document
aliasing. We present the aggregate browser cache success function (hit
rate vs. cache size) of the entire client population and discuss design
implications for memory- and bandwidth-constrained Web clients. For the
workload studied, eliminating redundant data transfers would increase
browser cache hit rates by 35¯45\% over their current levels. A simple
and practical technique for eliminating redundant transfers is
described. Document sharing across client reference streams is so strong
that the hit rate of a shared proxy cache could exceed 57\% even if
browser caches were infinitely large.",
URL="http://www.elsevier.com/locate/comcom",
}

@ARTICLE{Venk0203:Potential,
AUTHOR="Arun Venkataramani and Praveen Yalagandula and Ravindranath
Kokku and Sadia Sharif and Mike Dahlin",
TITLE="The potential costs and benefits of long-term prefetching for
content distribution",
JOURNAL=comcom,
VOLUME=25,
NUMBER=4,
PAGES="367-375",
MONTH=mar,
YEAR=2002,
REFERENCES=26,
KEYWORDS="long-term prefetching; web caching; prefetch threshold;
content distribution",
ABSTRACT="This paper examines the costs and potential benefits of
long-term prefetching for content distribution. In traditional
short-term prefetching, caches use recent access history to predict and
prefetch objects likely to be referenced in the near future. In
contrast, long-term prefetching uses long-term steady state object
access rates and update frequencies to identify objects to replicate to
content distribution locations. Compared to demand caching, long-term
prefetching increases network bandwidth and disk space costs but may
benefit a system by improving hit rates. Using analytic models and
trace-based simulations, we examine algorithms for selecting objects for
long-term prefetching. We find that although the Zipf-like popularity
distribution of web objects makes it challenging to prefetch enough
objects to significantly improve hit rates, systems can achieve
significant benefits at modest costs by focusing on long-lived
objects.",
URL="http://www.elsevier.com/locate/comcom",
}

@TECHREPORT{Schu0203:SIPstone,
AUTHOR="Henning Schulzrinne and Sankaran Narayanan and Jonathan Lennox
and Michael Doyle",
TITLE="{SIPstone} - Benchmarking {SIP} Server Performance",
TYPE="Technical Report",
INSTITUTION="Department of Computer Science, Columbia University",
ADDRESS="New York, New York",
NUMBER="CUCS-005-02",
MONTH=mar,
YEAR=2002,
KEYWORDS="SIP; voice-over-IP; performance metrics; benchmarking;
signaling",
ABSTRACT="SIP-based Internet telephony systems need to be appropriately
dimensioned, as the call and registration rate can reach several
thousand requests a second.  This draft proposes an initial simple set
of metrics for evaluating and benchmarking the performance of SIP proxy,
redirect and registrar servers.  The benchmark SIPstone-A expresses a
weighted average of these metrics.",
URL="http://www.cs.columbia.edu/~library/TR-repository/reports/reports-2002/cucs-005-02.pdf",
}

@TECHREPORT{Bush0203:Active,
AUTHOR="Stephen Francis Bush",
TITLE="Active Virtual Network Management Prediction: Complexity as a
Framework for Prediction, Optimization, and Assurance",
TYPE="technical report",
INSTITUTION="arXiv",
NUMBER="cs.NI/0203014",
NOTE="Proceedings of the 2002 DARPA Active Networks Conference and
Exposition (DANCE 2002), May 29-31, 2002, San Francisco, California,
USA",
MONTH=mar,
YEAR=2002,
KEYWORDS="Computational Complexity; Networking and Internet
Architecture",
ABSTRACT="Research into active networking has provided the incentive to
re-visit what has traditionally been classified as distinct properties
and characteristics of information transfer such as protocol versus
service; at a more fundamental level this paper considers the blending
of computation and communication by means of complexity.  The specific
service examined in this paper is network self-prediction enabled by
Active Virtual Network Management Prediction.  Computation/communication
is analyzed via Kolmogorov Complexity.  The result is a mechanism to
understand and improve the performance of active networking and Active
Virtual Network Management Prediction in particular.  The Active Virtual
Network Management Prediction mechanism allows information, in various
states of algorithmic and static form, to be transported in the service
of prediction for network management.  The results are generally
applicable to algorithmic transmission of information.  Kolmogorov
Complexity is used and experimentally validated as a theory describing
the relationship among algorithmic compression, complexity, and
prediction accuracy within an active network.  Finally, the paper
concludes with a complexity-based framework for Information Assurance
that attempts to take a holistic view of vulnerability analysis.",
URL="http://arXiv.org/abs/cs/0203014",
}

@TECHREPORT{Andr0203:Source,
AUTHOR="Matthew Andrews and Antonio Fernandez and Ashish Goel and Lisa
Zhang",
TITLE="Source Routing and Scheduling in Packet Networks",
TYPE="technical report",
INSTITUTION="arXiv",
NUMBER="cs/0203030",
MONTH=mar,
YEAR=2002,
KEYWORDS="Networking and Internet Architecture; Distributed; Parallel;
and Cluster Computing",
ABSTRACT="We study routing and scheduling in packet-switched networks.
We assume an adversary that controls the injection time, source, and
destination for each packet injected.  A set of paths for these packets
is admissible if no link in the network is overloaded.  We present the
first on-line routing algorithm that finds a set of admissible paths
whenever this is feasible.  Our algorithm calculates a path for each
packet as soon as it is injected at its source using a simple shortest
path computation.  The length of a link reflects its current congestion.
We also show how our algorithm can be implemented under today's Internet
routing paradigms.  When the paths are known (either given by the
adversary or computed as above) our goal is to schedule the packets
along the given paths so that the packets experience small end-to-end
delays.  The best previous delay bounds for deterministic and
distributed scheduling protocols were exponential in the path length. In
this paper we present the first deterministic and distributed scheduling
protocol that guarantees a polynomial end-to-end delay for every packet.
 Finally, we discuss the effects of combining routing with scheduling. 
We first show that some unstable scheduling protocols remain unstable no
matter how the paths are chosen.  However, the freedom to choose paths
can make a difference.  For example, we show that a ring with parallel
links is stable for all greedy scheduling protocols if paths are chosen
intelligently, whereas this is not the case if the adversary specifies
the paths.",
ANNOTE="preliminary version of this paper appeared in the Proceedings of
the 42th IEEE Annual Symposium on Foundations of Computer Science, FOCS
2001",
URL="http://arXiv.org/abs/cs/0203030",
}

@ARTICLE{Misr0203:IDMP,
AUTHOR="Archan Misra and Subir Das and Ashutosh Dutta and Anthony
McAuley and Sajal Das",
TITLE="{IDMP} based Fast-handoff and Paging in {IP} based {4G} Mobile
Networks",
JOURNAL=ieeecm,
MONTH=mar,
YEAR=2002,
KEYWORDS="4G wireless Network; Vertical handoff; Mobility;
Fast-handoff",
ABSTRACT="In this paper, we consider the use of our recently proposed
Intra-Domain Mobility Management Protocol (IDMP) in generation (4G)
mobile networks. On evaluating the heterogeneous access technologies,
cellular layouts and application characteristics of 4G environments, we
realize a need to reduce both the handoff latency and the frequency of
mobility-related signaling. We first present IDMP's fast intra-domain
handoff mechanism that uses a duration-limited, proactive packet
`multicasting' solution. We quantify the expected buffering requirements
of our proposed multicasting scheme for typical 4G network
characteristics and compare it with alternative IP-based fast handoff
solutions. We also present a paging scheme under IDMP that replicates
the current cellular paging structure. Our paging mechanism supports
generic paging strategies and can significantly reduce the
mobility-related IP signaling load.",
URL="http://www.cs.columbia.edu/~dutta/research/ieee-com.pdf",
}

@TECHREPORT{Cisc0203:How,
AUTHOR="{Cisco Systems}",
TITLE="How to add {MSN} Messenger services for {PC-to-phone}
functionality to Cisco Packet Voice Networks",
TYPE="White paper",
INSTITUTION="{Cisco Systems}",
ADDRESS="San Jose, California",
MONTH=mar,
YEAR=2002,
KEYWORDS="SIP; MSN Messenger; VoIP; packet voice; Internet telephony;
Microsoft",
ABSTRACT="The MSN Voice.Net service is a new opportunity for ITSPs to
bring billing minutes to their networks.  This document will explain how
to add MSN Messenger to a VoIP network.",
URL="http://www.sipcenter.com/files/Cisco\_mpcph\_wp.pdf",
}

@TECHREPORT{Cisc0203:Understanding,
AUTHOR="{Cisco Systems}",
TITLE="Understanding Packet Voice Protocols",
TYPE="White paper",
INSTITUTION="{Cisco Systems}",
ADDRESS="San Jose, California",
MONTH=mar,
YEAR=2002,
KEYWORDS="VoIP; Internet telephony; MGCP; SIP; H.323",
ABSTRACT="This paper provides some guidance and understanding of these
VoIP protocols, and tries to clarify some of the confusion in the
marketplace.",
URL="http://www.sipcenter.com/files/Cisco\_UPVP\_wp.pdf",
}

@TECHREPORT{Cisc0203:H.323,
AUTHOR="{Cisco Systems}",
TITLE="{H.323} and {SIP} Integration",
TYPE="White paper",
INSTITUTION="{Cisco Systems}",
ADDRESS="San Jose, California",
MONTH=mar,
YEAR=2002,
KEYWORDS="H.323; SIP; Internet telephony; protocol translation",
ABSTRACT="This white paper will address current techniques available to
address issues regarding the interoperability and coexistence of H.323
and SIP in packet telephony networks.",
URL="http://www.sipcenter.com/files/Cisco\_sh23g\_wp.pdf",
}

@INPROCEEDINGS{Padm0203:Case,
AUTHOR="Venkat N. Padmanabhan and Kay Sripanidkulchai",
TITLE="The Case for Cooperative Networking",
BOOKTITLE="1st International Workshop on Peer-to-Peer Systems (IPTPS)",
ADDRESS="Cambridge, MA, USA",
MONTH=mar,
YEAR=2002,
KEYWORDS="peer-to-peer networks; flash crowd",
ABSTRACT="In this paper, we make the case for Cooperative Networking
(CoopNet) where end-hosts cooperate to improve network performance
perceived by all.  In CoopNet, cooperation among peers complements
traditional client-server communication rather than replacing it.  We
focus on the Web flash crowd problem and argue that CoopNet offers an
effective solution.  We present an evaluation of the CoopNet approach
using simulations driven by traffic traces gathered at the MSNBC website
during the flash crowd that occurred on September 11, 2001.",
URL="http://www.research.microsoft.com/~padmanab/projects/CoopNet/",
}

@INPROCEEDINGS{Komo0203:Impact,
AUTHOR="Olufemi Komolafe and David Harle and David Cotter",
TITLE="Impact of graph theoretic network parameters on the design of
regular virtual topologies for optical packet switching",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="2827-2831",
MONTH=mar,
YEAR=2002,
REFERENCES=19,
ABSTRACT="The design of regular virtual topologies to facilitate optical
packet switching in networks with arbitrary physical topologies is
studied. Due to the intractable nature of the problem, two different
artificial intelligence based heuristics are used to find favourable
solutions expeditiously. The impact that the spread of the degree of
physical topology nodes has on the quality of solutions obtained is
investigated. Two important counter-intuitive findings emerge from this
paper. Firstly, increasing the spread of the nodal degree in the
physical topology leads to an improvement in the quality of initial
non-optimised (or random) solutions. Secondly and conversely, increasing
the spread of nodal degree has a detrimental impact on the final
optimised solutions obtained. Both these surprising conclusions are
explained by introducing novel estimates for the initial cost and the
margin for improvement on this cost. The results produced in this paper
are interesting and are applicable to the design of regular virtual
topologies in generic physical topologies and additionally, suggest
principles that are applicable to the wider area of telecommunication
network design.",
URL="http://yasu.cc.columbia.edu:2377/iel5/7828/21518/00997358.pdf?isNumber=21518\&prod=CNF\&arnumber=997358\&arSt=2827\&ared=2831+vol.5\&arAuthor=Komolafe\%2C+O.\%3B+Harle\%2C+D.\%3B+Cotter\%2C+D.",
}

@INPROCEEDINGS{McKe0203:Tracking,
AUTHOR="Kathleen McKeown and Regina Barzilay and David Evans and
Vasileios Hatzivassiloglou and Judith L. Klavans and Ani Nenkova and
Carl Sable and Barry Schiffman",
TITLE="Tracking and Summarizing News on a Daily Basis with Columbia''''s
Newsblaster",
BOOKTITLE="Human Language Technology Conference",
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
URL="http://newsblaster.cs.columbia.edu/papers/hlt-blaster.pdf",
}

@TECHREPORT{Ahn0203:Adaptive,
AUTHOR="Jong-Suk Ahn and John Heidmann",
TITLE="An Adaptive {{FEC}} Algorithm for Mobile Wireless Networks",
TYPE="technical report",
INSTITUTION="USC/ISI",
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
ABSTRACT="Wireless  mobile  networks  tend  to  drop  a large  portion 
of  packets  due  to  propagation  errors.    To improve  reliability 
over  noisy  wireless  channels,  wireless networks  can  employ 
forward  error  correction  (FEC) techniques. Static FEC algorithms,
however, can degrade the performance  by  poorly  matching  their 
overhead  to  the degree of the underlying channel error, especially
when the channel  path  loss  rate  fluctuates  widely.  This  paper
investigates the benefits of an adaptable FEC mechanism for wireless 
networks  with  severe  packet  loss. We  show  that our  adaptive  FEC 
technique  improves  the  performance  by dynamically  tuning  FEC 
strength  to  the  current  amount  of wireless channel loss. We
quantify these benefits through a hybrid  simulation  integrating 
packet-level  simulation  with bit-level  details  and  validate  the 
simulation model  through experimentation.",
URL="http://www.isi.edu/~johnh/PAPERS/Ahn02a.pdf",
}

@TECHREPORT{Ande0203:iLBC,
AUTHOR="Soren Andersen and Alan Duric",
TITLE="{{IETF} {AVT} {WG}} draft-andersen-ilbc-00",
TYPE="Presentation",
INSTITUTION="Global IP Sound",
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
URL="http://www.ietf.org/proceedings/02mar/slides/avt-6.pdf",
}

@TECHREPORT{Zand0203:Reliable,
AUTHOR="Victor Zandy and Barton P. Miller",
TITLE="Reliable Network Connections",
INSTITUTION="Wisconsin University",
MONTH=mar,
YEAR=2002,
ANNOTE="http://www.cs.wisc.edu/paradyn/papers/#rocks",
}

@TECHREPORT{Rein0203:Survey,
AUTHOR="Pierre Reinbold and Olivier Bonaventure",
TITLE="A Survey of {IP} Micro-mobility Protocols",
TYPE="Technical Report",
INSTITUTION="Facultes Universitaires Notre-Dame de la Paix",
ADDRESS="Namur, Belgium",
NUMBER="Infonet-2002-06",
NOTE="http://www.infonet.fundp.ac.be/doc/tr/Infonet-TR-2002-06.html
accessed August 2002",
MONTH=mar,
YEAR=2002,
}

@TECHREPORT{Cout0203:Effects,
AUTHOR="Douglas De Couto and Daniel Aguayo and Benjamin A. Chambers and
Robert Morris",
TITLE="Effects of Loss Rate on Ad Hoc Wireless Routing",
TYPE="Technical Report",
INSTITUTION="MIT Laboratory for Computer Science",
NUMBER="MIT-LCS-TR-836",
MONTH=mar,
YEAR=2002,
}

@TECHREPORT{Sult0203:Autonomous,
AUTHOR="Florin Sultan and Aniruddha Bohra and Liviu Iftode",
TITLE="Autonomous Transport Protocols for Content-based Networks",
TYPE="Technical Report",
INSTITUTION="Rutgers University",
NUMBER="DCS-TR-479",
MONTH=mar,
YEAR=2002,
}

@INPROCEEDINGS{Chiu0203:Network,
AUTHOR="Fabio Chiussi and Denis Khotimsky and Santosh Krishnan",
TITLE="A Network Architecture for {MPLS-Based} Micro-Mobility",
BOOKTITLE="IEEE Wireless Communications and Networking Conference, WCNC
'02",
ADDRESS="Orlando, FL",
MONTH=mar,
YEAR=2002,
}

@TECHREPORT{Ivan0203:Mobile,
AUTHOR="Will Ivancic",
TITLE="Mobile Networking -- Enabling Homeland Security via Rapidly
Deployable, Secure Communications",
INSTITUTION="NASA Glenn Research Center",
NOTE="{http://roland.grc.nasa.gov/\~ivancic/papers\\_presentations/Mobile\\_Networking\\_White\\_Paper.pdf
accessed November 2002}",
MONTH=mar,
YEAR=2002,
}

@INPROCEEDINGS{Boui0203:Enhanced,
AUTHOR="Eric Bouillet and Jean-Francois Labourdette and Ramu Ramamurthy
and Sid Chaudhuri",
TITLE="Enhanced Algorithm Cost Model to Control tradeoffs in
Provisioning Shared Mesh Restored Lightpaths",
BOOKTITLE="optical Fiber Communications (OFC)",
ADDRESS="Anaheim, CA",
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
KEYWORDS="shared protection",
ABSTRACT="In this write-up we propose an algorithm-centered metric to
vary the weight put on the solutions cost and on the average backup
lengths while selecting a primary-backup pair from a set of candidate
routes. We assess the effect of our metric on these two contradicting
objectives and show that it offers the leverage to achieve the desired
compromise.",
URL="http://www-ee.engr.ccny.cuny.edu/www/web/ellinas/EnhancedCost\_OFC2002.pdf",
}

@TECHREPORT{Zhao0203:Flexible,
AUTHOR="Weibin Zhao and Henning Schulzrinne",
TITLE="A Flexible and Efficient Protocol for Multi-Scope Service
Registry Replication",
INSTITUTION="Dept. of Computer Science, Columbia University",
ADDRESS="New York, New York",
NUMBER="CUCS-016-02",
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
KEYWORDS="Service directory; SLP; mSLP; replication; anti-entropy",
ABSTRACT="Service registries play an important role in service discovery
systems by accepting service registrations and answering service
queries; they can serve a wide range of purposes, such as membership
services, lookup services, and search services. To provide fault
tolerant, and enhance scalability, availability and performance, service
registries often need to be replicated. In this paper, we present Swift
(Selective anti-entropy WIth FasT update propagation), a flexible and
efficient protocol for multi-scope service registry replication. As
consistency is a less of concern compared with availability in service
registry replication, we choose to build Swift on top of anti-entropy to
support high availability replication. Swift makes two contributions as
follows. First, it defines a more general and flexible form of
anti-entropy called selective anti-entropy, which extends the
applicability of anti-entropy from full replication to partial
replication by selectively reconciling inconsistent states between two
replicas, and improves anti-entropy efficiency by fine controlling
update propagation within each subset. Selective anti-entropy is the
first that we are aware of in using anti-entropy to support generic
partial replication. Secondly, Swift integrates service registry overlay
networks with selective antientropy. Different topologies, such as full
mesh and spanning tree, can be used for constructing service registry
overlay networks. These overlay networks are used to propagate new
updates quickly so as to minimize inconsistency among replicas. We have
implemented Swift for replicating multi-scope Directory Agents in the
Service Location Protocol. Our experience shows that Swift is flexible,
efficient, and lightweight.",
URL="http://www1.cs.columbia.edu/~library/TR-repository/reports/reports-2002/cucs-016-02.pdf",
}

@TECHREPORT{Milo0203:Peer,
AUTHOR="Dejan Milojicic and Vana Kalogeraki and Rajan M Lukose and Kiran
Nagaraja and Jim Pruyne and Bruno Richard and Sami Rollins and Zhichen
Xu",
TITLE="Peer-to-Peer Computing",
TYPE="technical report",
INSTITUTION="Technical Publications Department, HP Labs Research
Library",
NUMBER="HPL-2002-57 20020315",
NOTE="http://www.hpl.hp.com/techreports/2002/HPL-2002-57.html",
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
ABSTRACT="The term peer-to-peer refers to a class of systems and
applications that employ distributed resources to perform a critical
function in a decentralized manner. With the pervasive deployment of
computers, P2P is increasingly receiving attention in research, product
development, and investment circles. This interest ranges from
enthusiasm, through hype, to disbelief in its potential. Some of the
benefits of a P2P approach include: improving scalability by avoiding
dependency on centralized points; eliminating the need for costly
infrastructure by enabling direct communication among clients; and
enabling resource aggregation. This survey reviews the field of P2P
systems and applications by summarizing the key concepts and giving an
overview of the most important systems. Design and implementation issues
of P2P systems are analyzed in general, and then revisited for each of
the case studies described in Section 6. This survey will help people
understand the potential benefits of P2P in the research community and
industry. For people unfamiliar with the field it provides a general
overview, as well as detailed case studies. It is also intended for
users, developers, and information technologies maintaining systems, in
particular comparison of P2P solutions with alternative architectures
and models.",
URL="http://www.hpl.hp.com/techreports/2002/HPL-2002-57.html",
}

@INPROCEEDINGS{Ratn0203:Routing,
AUTHOR="Sylvia Ratnasamy and Scott Shenker and Ion Stoica",
TITLE="Routing Algorithms for {DHTs:} Some Open Questions",
BOOKTITLE="International Workshop on Peer-to-Peer Systems (IPTPS)",
PUBLISHER="IEEE",
ADDRESS="Cambridge, MA, USA",
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
ABSTRACT="We first (very) briefly review the routing algorithms used in
the various DHT systems. We then discuss various issues related to
routing: state-efficiency tradeoff, resilience to failures, routing
hotspots, geography and heterogeneity.",
URL="http://www.cs.rice.edu/Conferences/IPTPS02/",
}

@INPROCEEDINGS{Harr0203:Complex,
AUTHOR="Matthew Harren and Joseph Hellerstein and Ryan Huebsch and Boon
Loo and Scott Shenker and Ion Stoica",
TITLE="Complex queries in {DHT-based} peer-to-peer networks",
BOOKTITLE="International Workshop on Peer-to-Peer Systems (IPTPS)",
PUBLISHER="IEEE",
ADDRESS="Cambridge, MA, USA",
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
URL="http://www.cs.rice.edu/Conferences/IPTPS02",
}

@ARTICLE{Dani0203:IEEE,
AUTHOR="Edgar Danielyan",
TITLE="{IEEE} 802.11",
JOURNAL=ipj,
VOLUME=5,
NUMBER=1,
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
REFERENCES=14,
ABSTRACT="Introduced in 1997, the IEEE Standard 802.11 for wireless
local-area networks has seen modifications and improvements in the past
years and is promising a brighter wireless future, so yearned for by
many of us. However, during its lifetime, the standard also has had a
few setbacks, which are reminders that nothing is perfect in this world,
much less in networking. This article provides a brief but comprehensive
introduction to IEEE 802.11 wireless networking, its present and future,
and highlights some of its security, performance, and safety aspects.",
URL="http://www.cisco.com/warp/public/759/ipj\_5-1/ipj\_5-1\_ieee\_80211.html",
}

@ARTICLE{Flei0203:Code,
AUTHOR="Eric Fleischman",
TITLE="Code Signing",
JOURNAL=ipj,
VOLUME=5,
NUMBER=1,
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
REFERENCES=25,
ABSTRACT="Code signing is a common mechanism that authors of executable
code use to assert their authorship of that code and to provide
integrity assurance to the users of the code that an unauthorized third
party has not subsequently modified the code in any way. Code signing is
widely used to protect software that is distributed over the Internet.
It is also widely used for mobile code security, being a core element of
the mobile code security systems of both Microsoft's ActiveX and
JavaSoft's Java applet systems. Despite this widespread use, common
misunderstandings have arisen concerning the actual security benefits
provided by code signing. This article addresses this issue. It explains
how code signing works, including its dependence upon underlying Public
Key Infrastructure (PKI) technologies.",
URL="http://www.cisco.com/warp/public/759/ipj\_5-1/ipj\_5-1\_code\_signing.html",
}

@ARTICLE{Squi0203:Optimal,
AUTHOR="Mark S. Squillante and Cathy Xia and Li Zhang",
TITLE="Optimal scheduling in queuing network models of high-volume
commercial web sites",
JOURNAL=pe,
VOLUME=47,
NUMBER=4,
PAGES="223-242",
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
REFERENCES=26,
KEYWORDS="Brownian approximations; Multiclass queues; Scheduling theory;
Heavy traffic analysis; Dynamic policies",
ABSTRACT="The optimal control of various performance-based measures in
high-volume commercial web sites requires a fundamental understanding of
the interactions between the diverse set of Internet services that
support customer needs and the different importance levels of these
services to both the customer and the e-commerce merchant. We present
here a study of the control policy for each server in a multiclass
queuing network that maximizes a particular function of profit, or
minimizes a particular function of cost, across the different classes of
Internet services.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-45C14V0-2-7S\&\_cdi=5663\&\_orig=browse\&\_coverDate=03\%2F31\%2F2002\&\_sk=999529995\&view=c\&wchp=dGLbVtb-zSkzS\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=161acbb9fcb76884a4d3bfca7a933db1\&ie=f.pdf",
}

@ARTICLE{Houc0203:Call,
AUTHOR="David Houck and Gopal Meempat",
TITLE="Call admission control and load balancing for voice over {IP}",
JOURNAL=pe,
VOLUME=47,
NUMBER=4,
PAGES="243-253",
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
REFERENCES=7,
KEYWORDS="QoS; Congestion management; VoIP",
ABSTRACT="IP networks are traditionally designed to support a
best-effort service, with no guarantees on the reliable and timely
delivery of packets. With the migration of real-time applications such
as voice onto IP-based platforms, the existing IP network capabilities
become inadequate to provide the quality-of-service (QoS) levels that
the end-users are accustomed to. While new protocols such as DiffServ
and MPLS allow some amount of traffic prioritization, guaranteed QoS
requires call admission control. This paper reviews several possible
implementations and shows simulation results for one promising method
that makes efficient use of the network and is scalable to large
networks.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-45C14V0-3-F\&\_cdi=5663\&\_orig=browse\&\_coverDate=03\%2F31\%2F2002\&\_sk=999529995\&view=c\&wchp=dGLbVtb-zSkzS\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=0f4cf300173f0d59fa67939b75d85a48\&ie=f.pdf",
}

@ARTICLE{Malh0203:Traffic,
AUTHOR="Rishabh Malhotra and D. Dey and E. van Doorn and A. M. J.
Koonen",
TITLE="Traffic modeling in a reconfigurable broadband nomadic computing
environment",
JOURNAL=pe,
VOLUME=47,
NUMBER=4,
PAGES="255-267",
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
REFERENCES=15,
KEYWORDS="Traffic modeling; Nomadic computing; Mt/G/ queues; Network
reconfiguration",
ABSTRACT="Reconfiguring a network to counter variations in traffic is
expected to greatly enhance optimal usage of network resources. But an
important input to this method is the traffic fluctuations themselves.
We have developed two models for this purpose to describe the
time-dependent variations in traffic at a base station in a nomadic
computing, wireless environment. The first model is rather simple and
does not take into account details of human behavior. It takes into
account the probabilities of choosing different applications. The model
is also analyzed and experimented with to identify the important input
parameters. The second model, a refined version of the first model,
takes into account details of relevant human behavior (in the context of
a wireless nomadic computing environment). Finally, we have compared the
two models on the basis of their complexity and validity in different
situations.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6V13-44N00M3-1-1K\&\_cdi=5663\&\_orig=browse\&\_coverDate=03\%2F31\%2F2002\&\_sk=999529995\&view=c\&wchp=dGLbVtb-zSkzS\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=579a63d7bead27dabf3292b84a76653c\&ie=f.pdf",
}

@ARTICLE{Shim0203:Causally,
AUTHOR="Kazunoori Shimamura and K. Tanaka and M. Takizawa",
TITLE="Causally ordered delivery of multimedia objects",
JOURNAL=comcom,
VOLUME=25,
NUMBER=5,
PAGES="437-444",
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
REFERENCES=20,
KEYWORDS="Group communication; Multimedia communication; Distributed
systems; Causally ordered delivery",
ABSTRACT="In distributed applications such as teleconferences, a group
of multiple processes are cooperating, where messages exchanged among
the processes are required to be causally delivered. The processes are
exchanging kinds of multimedia objects in addition to traditional text
data. Since the multimedia messages are longer than traditional messages
and are structured, it takes such a longer time that a communication
event cannot be considered to be atomic. In this paper, we discuss new
types of causally precedent relations among multimedia objects
transmitted in the network. We discuss a protocol to causally deliver
multimedia objects in a group of multiple processes. We also show the
evaluation of the protocol.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-43X1X17-1-11\&\_cdi=5624\&\_orig=browse\&\_coverDate=03\%2F15\%2F2002\&\_sk=999749994\&view=c\&wchp=dGLbVzb-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=f2ba86f6e82f43d52652a5f875601029\&ie=f.pdf",
}

@ARTICLE{Mous0203:Simple,
AUTHOR="G. I. Mousadis and T. Tsiligirides",
TITLE="A simple {ER} identification with congestion avoidance {(SERICA)}
algorithm to support some {TCP} differentiated services over the {ABR}
traffic",
JOURNAL=comcom,
VOLUME=25,
NUMBER=5,
PAGES="445-463",
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
REFERENCES=14,
KEYWORDS="ER-based switch algorithm; ABR traffic; ATM networks; TCP
applications; Differentiated Services; Traffic management; SERICA; Real
Traffic Cell Flow Processing",
ABSTRACT="SERICA is a new ER-based with congestion avoidance switch
algorithm of the ERICA class schemes, which has been developed in order
to regulate the ABR traffic of an ATM network. The prime issues of such
an algorithmic scheme are the minimization of the oscillating behavior
of the solution path and the buffer overflow avoidance. In a
steady-state, these issues are achieved by presenting a stable focus
operational point of O(1) complexity with zero cell loss. SERICA
algorithm is tested and evaluated on a network model with multiple
configuration alternatives allowing the Virtual Source/Virtual
Destination (VS/VD) property. High performance is obtained as a result
of the throughput maximization under prescribed levels of queuing
delays. According to the negotiated traffic descriptor SERICA may also
determine the level of the non-conformed cells the user may expect.
Thus, it may be easily applied as a TCP algorithm, in order to
facilitate the use of some differentiated services over the ABR traffic.
Finally, the existing end-to-end TCP protocol may be enhanced, since the
proposed algorithm provides a suitable rate-based control mechanism for
the TCP management.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-43X8946-6-2T\&\_cdi=5624\&\_orig=browse\&\_coverDate=03\%2F15\%2F2002\&\_sk=999749994\&view=c\&wchp=dGLbVtz-zSkWW\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=0b590b848686a05839def81bf55784b7\&ie=f.pdf",
}

@ARTICLE{Pier0203:Tabu,
AUTHOR="Samuel Pierre and Fabien Houéto",
TITLE="A tabu search approach for assigning cells to switches in
cellular mobile networks",
JOURNAL=comcom,
VOLUME=25,
NUMBER=5,
PAGES="464-477",
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
REFERENCES=24,
KEYWORDS="Cellular networks; Mobile networks; Cell assignment; Tabu
search; Heuristic methods",
ABSTRACT="This paper proposes a tabu search approach for assigning cells
to switches in wireless cellular networks. This problem is NP-hard and
consequently cannot be practically solved by exact methods for real size
networks. We first establish a new mathematical equivalence between the
assignment problem and the well-known p-fixed hub location problem. From
this equivalence as a basis for a heuristic method, initial solutions
have been generated. Then, some flexible and powerful moves, a gain
structure and its update procedures are defined and used to improve
these initial solutions and generate near optimal final solutions. To
evaluate the performance of this approach, we define two lower bounds
for the global optimum, which are used as reference to assess the
quality of the obtained solutions. Computational experiments show that
our approach generally provides better results than those generated by
other traditional heuristics found in the literature, especially for
large-scale networks with more than 50 cells and 3 switches.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-44WYV09-1-6S\&\_cdi=5624\&\_orig=browse\&\_coverDate=03\%2F15\%2F2002\&\_sk=999749994\&view=c\&wchp=dGLbVzz-zSkzS\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=aaf596ecb0671bbac624b548359d716f\&ie=f.pdf",
}

@ARTICLE{Jian0203:Efficient,
AUTHOR="Ming-Hong Jiang and Rong-Hong Jan and Chu-Fu Wang",
TITLE="An efficient multiple-path routing protocol for ad hoc networks",
JOURNAL=comcom,
VOLUME=25,
NUMBER=5,
PAGES="478-484",
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
REFERENCES=17,
KEYWORDS="Ad hoc networking; Dynamic routing; Mobile networking",
ABSTRACT="An ad hoc network is a cooperative engagement of a collection
of mobile hosts that requires no intervening of any centralized access
point or existing infrastructure. Each mobile host, operating as a
specialized router, forwards packets from other mobile hosts. The
possibility of fast movement of mobile hosts means network topologies
may change frequently. Thus, applying traditional routing schemes to ad
hoc networks is inappropriate. In this paper, we present an efficient
routing protocol called the multiple next hops (MNH) routing protocol,
which is based on the ad hoc on-demand distance vector (AODV) routing
protocol for ad hoc networks. The proposed MNH protocol establishes
multiple paths for a route discovery procedure, thus conserving network
bandwidth and reducing route reconstruction times when routing paths
fail. Numerical experiments are given to show the effectiveness of the
MNH routing protocol.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-442HTJB-1-1C\&\_cdi=5624\&\_orig=browse\&\_coverDate=03\%2F15\%2F2002\&\_sk=999749994\&view=c\&wchp=dGLbVlz-zSkWA\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=53baf47e9792f340cad02d44d3af945f\&ie=f.pdf",
}

@ARTICLE{Sree0203:Design,
AUTHOR="Niladhuri Sreenath and P. Rao and G. Mohan and C. Siva Ram
Murthy",
TITLE="Design of survivable {WDM} networks for carrying {ATM} traffic",
JOURNAL=comcom,
VOLUME=25,
NUMBER=5,
PAGES="485-500",
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
REFERENCES=18,
KEYWORDS="Wavelength-routed optical networks; Wavelength division
multiplexing; ATM networks; Logical topology design; Restoration network
design",
ABSTRACT="Wavelength-division multiplexed networks using
wavelength-routing are considered to be potential candidates for the
next generation of wide-area backbone networks. In these networks,
messages are carried in all-optical form using lightpaths. ATM is a
widespread architecture and it is natural to extend the two-level
connection architecture of ATM to the three-level connection
architecture of optical-ATM networks. The three-level connection
architecture is realized by providing a LP network under the virtual
path network, to meet the bandwidth requirements of the virtual paths
(VPs). Fault handling in these networks is of prime importance due to
the nature and volume of traffic that these networks carry. Faults can
be handled by rerouting the failed LPs in such a way that, failures are
transparent to the VPs at the upper layer. Our work aims at designing a
LP network with fault tolerance capability for an ATM network with an
underlying optical layer. The primary network is designed with the
objective of minimizing the number of fibers. The restoration network is
designed to survive single link failures with the objective of
minimizing the number of fibers. We develop design methods based on
heuristics, and verify their effectiveness through simulation
experiments.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-442HTJB-5-2C\&\_cdi=5624\&\_orig=browse\&\_coverDate=03\%2F15\%2F2002\&\_sk=999749994\&view=c\&wchp=dGLbVzb-zSkWW\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=04519cd6b7bc77891b7193051f942173\&ie=f.pdf",
}

@ARTICLE{Zhou0203:Effect,
AUTHOR="Luying Zhou and Pat S. Y. Chan and R. Radhakrishna Pillai",
TITLE="Effect of {TCP/LLC} protocol interaction in {GPRS} networks",
JOURNAL=comcom,
VOLUME=25,
NUMBER=5,
PAGES="501-506",
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
REFERENCES=13,
KEYWORDS="TCP; LLC; Protocol interference; GSM; GPRS",
ABSTRACT="The interference between retransmissions at the Logical Link
Control (LLC) protocol and the Transmission Control Protocol (TCP) in a
General Packet Radio Services (GPRS) network is studied in this paper by
means of simulations. The factors that contribute to the TCP/LLC
protocol interference are discussed. The results show that in the
presence of wireless link errors, LLC protocol does not cause severe
interference with TCP but will enhance the network performance when the
LLC parameters are set properly.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-44WYV09-2-13\&\_cdi=5624\&\_orig=browse\&\_coverDate=03\%2F15\%2F2002\&\_sk=999749994\&view=c\&wchp=dGLbVlz-zSkzk\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=07a79509648aa3b50f9bdcd3a1adf9e0\&ie=f.pdf",
}

@ARTICLE{Li0203:Performance,
AUTHOR="Wei Li and Kia Makki and Niki Pissinou",
TITLE="Performance analysis of a {PCS} network with state dependent
calls arrival processes and impatient calls",
JOURNAL=comcom,
VOLUME=25,
NUMBER=5,
PAGES="507-515",
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
REFERENCES=34,
KEYWORDS="Dependent calls arrival processes; PCS network with impatient
call; Mobility",
ABSTRACT="This paper studies the behavior of performance evaluation for
a personal communication services (PCS) network, in which the calls
arrival process may depend on the number of calls in the target cells.
Each cell of the PCS network consists of a finite channel and a buffer
(with finite or infinite size) for handoff calls. The handoff calls
having to wait in the buffer for further communication may become
impatient and leave the system if their waiting time exceeds their own
patience. The mobilities of the portables are characterized by the
random cell residence times of the portables. For insight into the
effect of dependent calls arrival processes and the impatient calls on
PCS network performance, we propose an analytical model and obtain the
expressions for the following interesting conventional and new
performance measures: the new call blocking probability, handoff call
failure probability and the forced termination probability of a handoff
call; the quasi and actual waiting time of a handoff call in the buffer;
the actual call holding time of a new call; and the blocking period of
time of the new calls and the handoff calls etc. We also provide an
algorithm to compare these blocking probabilities and the arrival rates
for handoff calls. Some special cases of our model used in previous
traffic models of wireless and/or wireline communications are discussed.
The results presented in this paper can provide guidelines for field
data processing on updated PCS network design and performance
evaluation.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-43X8946-2-1P\&\_cdi=5624\&\_orig=browse\&\_coverDate=03\%2F15\%2F2002\&\_sk=999749994\&view=c\&wchp=dGLbVlz-zSkzS\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=386a9fa72256fcfbf2bf2ef88734b120\&ie=f.pdf",
}

@ARTICLE{Chun0203:Design,
AUTHOR="Li Chunlin and Lu Zhengding and Li Layuan",
TITLE="Design and implementation of a distributed computing environment
model for object-oriented networks programming",
JOURNAL=comcom,
VOLUME=25,
NUMBER=5,
PAGES="516-521",
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
REFERENCES=20,
KEYWORDS="Distributed computing environment; Software component;
Object-oriented network programming; Java",
ABSTRACT="This paper presents a Java-based distributed computing
environment (JDCE) model. First, a framework of the proposed JDCE model
is described, and the processes for implementing the model are given,
which can consist of three processes, i.e., find process, connect
process and locate process. The find process belongs to the
network-level protocol, and the connect process and locate process
belong to the object-level protocols. The availability of the JDCE model
for object-oriented network programming is then discussed. The
availability and efficiency of the model have been verified by
illustrating an example. Finally, some remarks and conclusions are
given. The study shows that the proposed JDCE model can raise the level
of abstraction for network or distributed system programming, from the
network protocol level to the object interface level. This model can
make it unnecessary for the provider of software components or services
to agree on network level protocols that allow their software components
to interact, and provides a mechanism to enable smooth adding, removal,
and finding of software components and services on the network.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-43WTKC3-1-K\&\_cdi=5624\&\_orig=browse\&\_coverDate=03\%2F15\%2F2002\&\_sk=999749994\&view=c\&wchp=dGLbVzb-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=6bc8acf9e25e3033e7bd4bfda0c7e90b\&ie=f.pdf",
}

@ARTICLE{Sark0203:Single,
AUTHOR="Jahangir H. Sarker and Seppo Halme",
TITLE="Single channel occupied voice and multi-channel occupied {HSCSD}
over {GSM}",
JOURNAL=comcom,
VOLUME=25,
NUMBER=5,
PAGES="522-533",
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
REFERENCES=26,
KEYWORDS="Call blocked; Call rejection; GSM; HSCSD; Random access;
Traffic channel",
ABSTRACT="Random access and traffic channel parts are utilized,
respectively, for call establishment and information transmission in the
uplink direction, comprising mobile to base station of the Global System
for Mobile Communication (GSM) networks. Voice (V) and High Speed
Circuit Switched Data (HSCSD) calls use two parallel random access parts
and a common traffic channel part where a V call occupies a single
traffic channel and a HSCSD call occupies a multiple number of traffic
channels. A call is either rejected or blocked if it is unsuccessful
either in the random access part or in the traffic channel part. The
optimum number of random access slots is directly proportional to the
average access arrival rate. According to the specification, four types
of retransmission cut-off policies can be executed in the random access
part wherein only one type can provide almost zero call rejection
probability, pertaining to a limited amount of traffic arrival rate per
random access slot. A complete analysis for the traffic channel
utilization and call blocking probability for V and HSCSD calls with an
exact number of random access slots in collaboration with four different
types of retransmission cut-off schemes is introduced. The overall call
success probability is devised resorting to call rejection and call
blocking probabilities. Results demonstrate that the overall call
success probability can be independent of random access part up to a
certain call arrival rate if a special type of retransmission cut-off is
utilized.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-4412RNR-1-23\&\_cdi=5624\&\_orig=browse\&\_coverDate=03\%2F15\%2F2002\&\_sk=999749994\&view=c\&wchp=dGLbVtz-zSkWz\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=d3f66980e6a5b994a4c34669bd14f1b1\&ie=f.pdf",
}

@ARTICLE{Chan0203:Adaptive,
AUTHOR="Ben-Jye Chang and Hsien-Kang Chung and Ren-Hung Hwang",
TITLE="Adaptive crankback schemes for hierarchical {QoS} routing in
{ATM} networks",
JOURNAL=comcom,
VOLUME=25,
NUMBER=5,
PAGES="534-543",
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
REFERENCES=14,
KEYWORDS="Hierarchical routing; Aggregation scheme; PNNI; Crankback;
MDP",
ABSTRACT="To reduce routing information and achieve scalability in large
ATM networks, ATM Private Network-to-Network Interface (PNNI) adopts
hierarchical routing. For efficient routing, a large ATM network is
decomposed into subnetworks called Peer Groups (PG), which advertise
aggregated routing information only. Because of lack of precision in the
aggregated information, a call set up message on a chosen route can be
rejected. When an ATM node discovers that a call set up message cannot
proceed due to insufficient resources, a back-tracking procedure called
crankback is initiated against call blocking. Although crankback reduces
blocking probability, it also causes additional overhead, such as longer
setup delay. Consequently, this study proposes two approaches to reduce
crankback overhead. The first approach adds extra information to the
setup message, referred to as Crankback Information Stack (CIS), to
reduce crankback overhead. Meanwhile, the other approach, referred to as
Cost Threshold (CT), uses the aggregated path cost and the cost
information of previously rejected call setup message to determine
whether call setup should be tried on the next alternate path. The
simulation results herein demonstrate that both of the proposed
approaches significantly reduce crankback overhead, while the
combination of the CIS and CT approach achieves further improvement.",
URL="http://www.sciencedirect.com/science?\_ob=MImg\&\_imagekey=B6TYP-442HTJB-2-2H\&\_cdi=5624\&\_orig=browse\&\_coverDate=03\%2F15\%2F2002\&\_sk=999749994\&view=c\&wchp=dGLbVlb-zSkWW\&\_acct=C000002018\&\_version=1\&\_userid=18704\&md5=748bffb4cbb238e83001dec484a3cff9\&ie=f.pdf",
}

@ARTICLE{Choi0203:Associativity,
AUTHOR="Yongjin Choi and Daeyeon Park",
TITLE="Associativity Based Clustering and Query Stride for On-demand
Routing Protocols in Ad Hoc Networks",
JOURNAL=jcn,
VOLUME=4,
NUMBER=1,
PAGES="4-13",
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
ABSTRACT="An ad hoc network is a collection of wireless mobile nodes
without the support of a stationary infrastructure. In ad hoc networks,
each node acts as a router to support multiple hops to overcome limited
range of packet radios. While a variety of routing protocols have been
developed recently, a class of routing schemes called on-demand
protocols have attracted a lot of attentions due to their low routing
overhead. However, their efficiency is limited by the enormous query
flooding overhead and the route acquisition latency. In this paper, we
propose two new schemes ?Associativity Based Clustering (ABC) and Query
Stride (QS) which offer benefits to on-demand protocols by surmounting
those limitations. First, ABC provides a proactive routing information
on associatively-stable nodes in the network. Thus, nodes can
communicate immediately with a node in ABC without any queryreply
exchange. Second, QS enables a query to be flooded to the whole network
with a minimum number of broadcasts. While ABC reduces the route
acquisition latency, QS saves the bandwidth in flooding. Although ABC
and QS can be used independently, the combined effect is even greater
since they provide complementary benefits sharing common overhead.",
}

@ARTICLE{Siso0203:Preferred,
AUTHOR="Rajendra Sisodia and B.S Manoj and C. Siva Ram Murthy",
TITLE="A Preferred Link Based Routing Protocol for Wireless Ad Hoc
Networks",
JOURNAL=jcn,
VOLUME=4,
NUMBER=1,
PAGES="14-21",
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
ABSTRACT="Routing protocols in wireless ad hoc networks experience high
control overhead due to frequent path breaks that occur due to mobility
of nodes, which leads to flooding of control packets throughout the
network. We propose a preferred link based routing protocol that reduces
flooding of control packets by selectively allowing some nodes to
forward the packets using a preferred list. We propose two algorithms to
compute the preferred list. The first algorithm computes the preferred
list based on neighbor¯s degree. The second algorithm computes the
preferred list based on stability information. Simulation results
illustrate their performance and demonstrate their good behavior
compared to other protocols. They also show that the stability based
algorithm finds more stable paths while the neighbor's degree based
algorithm has least control overhead.",
}

@ARTICLE{Alzo0203:Distributed,
AUTHOR="Khaled Alzoubi and Peng-Jun Wan and Ophir Frieder",
TITLE="Distributed Heuristics for Connected Dominating Sets in Wireless
Ad Hoc Networks",
JOURNAL=jcn,
VOLUME=4,
NUMBER=1,
PAGES="22-29",
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
ABSTRACT="A connected dominating set (CDS) for a graph G(V,E) is a
subset Vt of V , such that each node in V- Vt is adjacent to some node
in Vt, and Vt induces a connected subgraph. CDSs have been proposed as a
virtual backbone for routing in wireless ad hoc networks. However, it is
NP-hard to find a minimum connected dominating set (MCDS). An
approximation algorithm for MCDS in general graphs has been proposed in
the literature with performance guarantee of 3+in Delta where Delta is
the maximal nodal degree [1]. This algorithm has been implemented in
distributed manner in wireless networks [2]?4]. This distributed
implementation suffers from high time and message complexity, and the
performance ratio remains 3 + in Delta. Another distributed algorithm
has been developed in [5], with performance ratio of O(n). Both
algorithms require two-hop neighborhood knowledge and a message length
of Ohm(Delta). On the other hand, wireless ad hoc networks have a unique
geometric nature, which can be modeled as a unitdisk graph (UDG), and
thus admits heuristics with better performance guarantee. In this paper
we propose two destributed heuristics with constant performance ratios.
The time and message complexity for any of these algorithms is O(n) and
O(n log n), respectively. Both of these algorithms require only
single-hop neighborhood knowledge, and a message length of O(1).",
}

@ARTICLE{Hsu0203:Multihop,
AUTHOR="Yu-Ching Hsu and Ying-Dar Lin",
TITLE="Multihop Cellular: A Novel Architecture for Wireless Data
Communications",
JOURNAL=jcn,
VOLUME=4,
NUMBER=1,
PAGES="30-39",
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
ABSTRACT="This work presents a novel architecture, Multihop Cellular
Network (MCN), for wireless communications. MCN preserves the benefit of
conventional single-hop cellular networks (SCN) where the service
infrastructure is constructed by fixed bases or access points (APs), and
it also incorporates the flexibility of ad-hoc networks where wireless
transmission through mobile stations in multiple hops is allowed. MCN
can reduce the required number of bases or APs and improve the
throughput performance, while limiting path vulnerability encountered in
ad-hoc networks. In addition, MCNand SCN are analyzed, in terms of mean
hop count, hopby-hop throughput, end-to-end throughput, and mean number
of channels (i.e., simultaneous transmissions) under different traffic
localities and transmission ranges. Numerical results demonstrate that
throughput of MCN exceeds that of SCN and the former also increases as
the transmission range decreases. The above results can be accounted for
by the different orders, linear and square, at which mean hop count and
mean number of channels increase, respectively.",
}

@ARTICLE{Hou0203:Cluster,
AUTHOR="Ting-Chao Hou and Tzu-Jane Tsai",
TITLE="On the Cluster Based Dynamic Channel Assignment for Multihop Ad
Hoc Networks",
JOURNAL=jcn,
VOLUME=4,
NUMBER=1,
PAGES="40-47",
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
ABSTRACT="In order to ensure an efficient network control for mobile ad
hoc networks, nodes are usually aggregated into clusters to provide a
convenient framework. However, an important issue on how to properly
assign channels over a multi-cluster structure has not been studied in
depth. In this paper, we first propose a new clustering algorithm to
facilitate subsequent channel assignment. Each cluster has one
clusterhead. Between clusterheads, there are gateways that relay control
information and help eliminate the hidden terminal problem. Then two
dynamic channel assignment (DCA) strategies are designed to make the
best use of available channels by taking advantage of the spatial reuse
concept. One strategy tries approaching a compact-channel pattern so
that the channel reuse efficiency can be enhanced. On the other hand,
the other strategy tries reducing the control overhead on the channel
assignment so that the users can have a lower power consumption. We
evaluate our cluster structure via simulation in terms of cluster
stability and overheads. Furthermore, the two DCA strategies are
compared to provide a guideline on how to trade off between the channel
reuse efficiency and the control overhead.",
}

@ARTICLE{Wu0203:Multipath,
AUTHOR="Kui Wu and Janelle Harms",
TITLE="Multipath Routing for Mobile Ad Hoc Networks",
JOURNAL=jcn,
VOLUME=4,
NUMBER=1,
PAGES="48-58",
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
ABSTRACT="A Mobile Ad hoc NETwork(MANET) is a collection of wireless
mobile computers forming a temporary network without any existing wire
line infrastructure. Due to the dynamic nature of network topologies and
the resource constraints, routing in MANETs is a challenging task.
Multipath routing can increase end-to-end throughput and provide load
balancing in wired networks.However, its advantage is not obvious in
mobile ad hoc networks because the traffic flows along the multiple
paths may interfere with each other. In addition, without accurate
knowledge of topology, finding multiple node-disjoint paths is
difficult. In this paper, we propose two on-demand methods to
effectively search for multiple node-disjoint paths and present the path
selection criteria. Compared with Dynamic Source Routing (DSR) and the
Diversity Injection method, our methods can find more node-disjoint
paths and thus provide source nodes with more choices to select good
quality multiple paths. We also perform simulation studies on the
proposed approaches. The simulation results show that our multipath
routing methods can reduce the frequency of route discoveries and
balance network loads. In addition, our Heuristic Redirection multipath
routing method can reduce control overheads, improve end-to-end delay,
and provide fair energy consumption among mobile hosts. The purpose of
this paper is to present the advantages as well as the challenges of
deploying multipath routing in mobile ad hoc networks.",
}

@ARTICLE{Wu0203:Calculating,
AUTHOR="Jie Wu and Fei Dai and Ming Gao and Ivan Stojmenovic",
TITLE="On Calculating Power-Aware Connected Dominating Sets for
Efficient Routing in Ad Hoc Wireless Networks",
JOURNAL=jcn,
VOLUME=4,
NUMBER=1,
PAGES="59-70",
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
ABSTRACT="Efficient routing among a set of mobile hosts (also called
nodes) 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 searching space for a route is reduced to nodes in
the set. A set is dominating if all the nodes in the system are either
in the set or neighbors of nodes in the set. Wu and Li [1] proposed a
simple and efficient distributed algorithm for calculating connected
dominating set in ad hoc wireless networks, where connections of nodes
are determined by geographical distances of nodes. In general, nodes in
the connected dominating set consume more energy in order to handle
various bypass traffics than nodes outside the set. To prolong the life
span of each node, and hence, the network by balancing the energy
consumption in the network, nodes should be alternated in being chosen
to form a connected dominating set. In this paper, we propose a method
of calculating power-aware connected dominating set. Our simulation
results show that the proposed approach outperforms several existing
approaches in terms of life span of the network.",
}

@ARTICLE{Choi0203:Secure,
AUTHOR="Mi-Jung Choi and James W. Hong",
TITLE="A Secure Web-based Global Management System for {Firewall/VPN}
Devices",
JOURNAL=jcn,
VOLUME=4,
NUMBER=1,
PAGES="71-78",
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
ABSTRACT="A firewall is a security device placed between a private
network and a public network such as the Internet. It is designed to
protect the private network resources from unauthorized user access.
Today, various firewalls are widely used in many places (e.g., Internet
data centers, company headquarters, branch office, telecommuters¯
homes). What is desperately needed is a management system that can
easily configure, monitor and manage multisite deployed firewalls from a
central location. For flexibility, such a management system must be
divided into components and needs to use an open management protocol,
such as the Simple Network Management Protocol (SNMP). Yet the SNMP has
a security defect. Further, the proposed standard Management Information
Base (MIB) for firewalls is insufficient for supporting centralized
global management of a lot of firewall devices. In this paper, we
present the design and implementation of a secureWeb and SNMPbased
global firewall management system. We have focused on two aspects: 1)
extending the existing proposed standard MIB to support the
configuration and monitoring of hundreds or thousands of firewall and
VPN devices; 2) providing secure communication among global manager
system components in order to provide secure firewall management. We
also present our work on developing our firewall global manager (FGM) on
commercial firewall/VPN devices.",
}

@ARTICLE{Shei0203:Robust,
AUTHOR="Asrar U. Sheikh and Faisal Ali Shah",
TITLE="A Robust {mopt-LMS} Algorithm for Tracking of Fading Channels",
JOURNAL="Wireless Communications and Mobile Computing",
VOLUME=2,
NUMBER=2,
PAGES="215-223",
MONTH=mar,
YEAR=2002,
LANGUAGE="English",
}

@INPROCEEDINGS{:,
AUTHOR="Andrzej Duda and J. Antonio García-Macías and Franck Rousseau
and Gilles Berger-Sabbatel and Leyla Toumi",
TITLE="Providing DiffServ Quality of Service in 802.11b Networks",
BOOKTITLE="2nd Swedish Workshop on Wireless Ad-hoc Networks",
ADDRESS="Stockholm, Sweden",
DAYS=5,
MONTH=mar,
YEAR=2002,
KEYWORDS="802.11b; wireless LAN; QoS",
URL="http://wireless.kth.se/adhoc02/proceedings/Duda.pdf",
}

@INPROCEEDINGS{Schu0203:Quality,
AUTHOR="Henning Schulzrinne and Wenyu Jiang",
TITLE="Quality of service - applications",
BOOKTITLE="NSF ITR Quality of Service Workshop",
ADDRESS="Annapolis, Maryland",
DAYS=15,
MONTH=mar,
YEAR=2002,
KEYWORDS="quality of service",
URL="http://www.cs.columbia.edu/~hgs/papers/qos-apps.ppt",
}

@INPROCEEDINGS{Schu0203:Interdomain,
AUTHOR="Henning Schulzrinne",
TITLE="Interdomain and end-to-end {QoS} issues",
BOOKTITLE="NSF ITR Quality of Service Workshop",
ADDRESS="Annapolis, Maryland",
DAYS=15,
MONTH=mar,
YEAR=2002,
KEYWORDS="quality of service",
URL="http://www.cs.columbia.edu/~hgs/papers/qos-ee.ppt",
}

@TECHREPORT{Mend0204:Session,
AUTHOR="Paulo Mendes and Henning Schulzrinne and Edmundo Monteiro",
TITLE="Session-Aware Popularity-based Resource Allocation Across Several
Differentiated Service Domains",
TYPE="Technical Report",
INSTITUTION="Columbia University",
NUMBER="CUCS-009-02",
MONTH=apr,
YEAR=2002,
REFERENCES=25,
KEYWORDS="fairness; multimedia; multicast; differentiated services;
scalablevideo sessions; signaling protocol",
ABSTRACT="The Differentiated Services model (DS) maps traffic into
network services that have different quality levels. However, inside
each service flows can be treated unfairly, since the DS model has no
policy to distribute the service bandwidth between all sessions that
compose the service aggregate traffic. Our goal is to study a signaling
protocol that fairly distributes the resources reserved for each DS
service between scalable multimedia sessions in a multicast network
environment, where scalable sources divide session traffic in
hierarchical layers, sending each layer to different multicast groups.
We present a signaling protocol called Session-Aware Popularity Resource
Allocation (SAPRA)that allows the distribution of DS services resources
along sessions path, based upon the receiver population of each session.
Simulations show that SAPRA protocol has small bandwidth overhead, is
efficient updating the resources allocated to each session and also
supplying receivers with reports about the quality level of their
session.",
URL="http://www.cs.columbia.edu/~library/TR-repository/reports/reports-2002/cucs-009-02.ps.gz",
}

@TECHREPORT{Doro0204:Accelerated,
AUTHOR="S. N. Dorogovtsev and J. F. F. Mendes",
TITLE="Accelerated growth of networks",
TYPE="technical report",
INSTITUTION="arXiv",
NUMBER="cond-mat/0204102",
NOTE="Contribution to `Handbook of Graphs and Networks:  From the Genome
to the Internet', eds.  S.  Bornholdt and H.G.  Schuster (Wiley-VCH,
Berlin, 2002)",
MONTH=apr,
YEAR=2002,
KEYWORDS="Statistical Mechanics; Networking and Internet Architecture",
ABSTRACT="In many real growing networks the mean number of connections
per vertex increases with time.  The Internet, the Word Wide Web,
collaboration networks, and many others display this behavior.  Such a
growth can be called accelerated.  We show that this acceleration
influences distribution of connections and may determine the structure
of a network.  We discuss general consequences of the acceleration and
demonstrate its features applying simple illustrating examples.  In
particular, we show that the accelerated growth fairly well explains the
structure of the Word Web (the network of interacting words of human
language).  Also, we use the models of the accelerated growth of
networks to describe a wealth condensation transition in evolving
societies.",
URL="http://arXiv.org/abs/cond-mat/0204102",
}

@TECHREPORT{Doro0204:Principles,
AUTHOR="S. N. Dorogovtsev and J. F. F. Mendes and A. N. Samukhin",
TITLE="Principles of Statistical Mechanics of Random Networks",
TYPE="technical report",
INSTITUTION="arXiv",
NUMBER="cond-mat/0204111",
MONTH=apr,
YEAR=2002,
KEYWORDS="Statistical Mechanics; Networking and Internet Architecture;
Mathematical Physics; Adaptation and Self-Organizing Systems",
ABSTRACT="We develop a statistical mechanics approach for random
networks.  We construct equilibrium statistical ensembles of random
networks, obtain their partition functions and main characteristics.  We
find simple dynamical construction procedures that produce equilibrium
uncorrelated random networks with an arbitrary degree distribution.  It
follows from our theory that in equilibrium networks, fat-tailed degree
distributions may exist only starting from some critical average number
of connections of a vertex, in a phase with a condensate of edges.",
URL="http://arXiv.org/abs/cond-mat/0204111",
}

@TECHREPORT{Das0204:Fair,
AUTHOR="Abhimanyu Das and Deboyjoti Dutta and Ahmed Helmy",
TITLE="Fair Stateless Aggregate Traffic Marking using Active Queue
Management Techniques",
TYPE="technical report",
INSTITUTION="arXiv",
NUMBER="cs/0204011",
MONTH=apr,
YEAR=2002,
KEYWORDS="Networking and Internet Architecture",
ABSTRACT="In heterogeneous networks such as today's Internet, the
differentiated services architecture promises to provide QoS guarantees
through scalable service differentiation.  Traffic marking is an
important component of this framework.  In this paper, we propose two
new aggregate markers that are stateless, scalable and fair.  We
leverage stateless Active Queue Management (AQM) algorithms to enable
fair and efficient token distribution among individual flows of an
aggregate.  The first marker, Probabilistic Aggregate Marker (PAM), uses
the Token Bucket burst size to probabilistically mark incoming packets
to ensure TCP-friendly and proportionally fair marking.  The second
marker, Stateless Aggregate Fair Marker (F-SAM) approximates fair
queueing techniques to isolate flows while marking packets of the
aggregate.  It distributes tokens evenly among the flows without
maintaining per-flow state.  Our simulation results show that our
marking strategies show upto 30\% improvement over other commonly used
markers while marking flow aggregates.  These improvements are in terms
of better average throughput and fairness indices, in scenarios
containing heterogeneous traffic consisting of TCP (both long lived
elephants and short lived mice) and misbehaving UDP flows.  As a bonus,
F-SAM helps the mice to win the war against elephants.",
URL="http://arXiv.org/abs/cs/0204011",
}

@TECHREPORT{Adam0204:Local,
AUTHOR="Lada A. Adamic and Rajan M Lukose and Bernardo A. Huberman",
TITLE="Local Search in Unstructured Networks",
TYPE="technical report",
INSTITUTION="arXiv",
NUMBER="cond-mat/0204181",
NOTE="from `Handbook of Graphs and Networks:  From the Genome to the
Internet', eds.  S.  Bornholdt and H.G.  Schuster (Wiley-VCH, Berlin,
2002",
MONTH=apr,
YEAR=2002,
KEYWORDS="Disordered Systems and Neural Networks; Statistical Mechanics;
Networking and Internet Architecture",
ABSTRACT="We review a number of message-passing algorithms that can be
used to search through power-law networks.  Most of these algorithms are
meant to be improvements for peer-to-peer file sharing systems, and some
may also shed some light on how unstructured social networks with
certain topologies might function relatively efficiently with local
information.  Like the networks that they are designed for, these
algorithms are completely decentralized, and they exploit the power-law
link distribution in the node degree.  We demonstrate that some of these
search algorithms can work well on real Gnutella networks, scale
sub-linearly with the number of nodes, and may help reduce the network
search traffic that tends to cripple such networks.",
URL="http://arXiv.org/abs/cond-mat/0204181",
}

@TECHREPORT{Zhen0204:Intelligent,
AUTHOR="Qingguo Zheng and Ke Xu and Weifeng Lv and Shilong Ma",
TITLE="Intelligent Search of Correlated Alarms for {GSM} Networks with
Model-based Constraints",
TYPE="technical report",
INSTITUTION="arXiv",
NUMBER="cs/0204055",
NOTE="9th IEEE International Conference on Telecommunications, June
2002, Beijing, China",
MONTH=apr,
YEAR=2002,
KEYWORDS="Networking and Internet Architecture; Artificial
Intelligence",
ABSTRACT="In order to control the process of data mining and focus on
the things of interest to us, many kinds of constraints have been added
into the algorithms of data mining.  However, discovering the correlated
alarms in the alarm database needs deep domain constraints.  Because the
correlated alarms greatly depend on the logical and physical
architecture of networks.  Thus we use the network model as the
constraints of algorithms, including Scope constraint, Inter-correlated
constraint and Intra-correlated constraint, in our proposed algorithm
called SMC (Search with Model-based Constraints).  The experiments show
that the SMC algorithm with Inter-correlated or Intra-correlated
constraint is about two times faster than the algorithm with no
constraints.",
URL="http://arXiv.org/abs/cs/0204055",
}

@TECHREPORT{Menc0204:Navigating,
AUTHOR="Filippo Menczer",
TITLE="Navigating the Small World Web by Textual Cues",
TYPE="technical report",
INSTITUTION="arXiv",
NUMBER="cs/0204054",
MONTH=apr,
YEAR=2002,
KEYWORDS="Information Retrieval; Networking and Internet Architecture",
ABSTRACT="Can a Web crawler efficiently locate an unknown relevant page?
While this question is receiving much empirical attention due to its
considerable commercial value in the search engine community
[Cho98,Chakrabarti99,Menczer00,Menczer01], theoretical efforts to bound
the performance of focused navigation have only exploited the link
structure of the Web graph, neglecting other features
[Kleinberg01,Adamic01,Kim02].  Here I investigate the connection between
linkage and a content-induced topology of Web pages, suggesting that
efficient paths can be discovered by decentralized navigation algorithms
based on textual cues.",
URL="http://arXiv.org/abs/cs/0204054",
}

@INPROCEEDINGS{Hsu0204:Deflection,
AUTHOR="Ching-Fang Hsu and Te-Lung Liu and Nen-Fu Huang",
TITLE="On the deflection routing in {QoS} supported optical
burst-switched networks",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="2786-2790",
MONTH=apr,
YEAR=2002,
REFERENCES=15,
ABSTRACT="Generally speaking, buffer requirement is not vital for
JET-based optical burst switching (OBS). However, if deflection routing
is enabled, optical buffers are necessary to solve the insufficient
offset time problem. Another solution, which can alleviate buffering, is
to lengthen offset time in the beginning. As previous work indicated, a
burst with extra offset time has higher priority than that without extra
offset time and quality of service (QoS) can be accomplished in this
way. Therefore, we investigate the performance of deflection routing in
prioritized JET-based optical burst-switched networks. A queuing model
is proposed to approximate loss probability. We also evaluate the impact
of deflection routing in Arpanet-2 topology by simulation.",
URL="http://ieeexplore.ieee.org/iel5/7828/21518/00997350.pdf?isNumber=21518\&prod=CNF\&arnumber=997350\&arSt=2786\&ared=2790+vol.5\&arAuthor=Ching-Fang+Hsu\%3B+Te-Lung+Liu\%3B+Nen-Fu+Huang",
}

@TECHREPORT{Bout0204:Impact,
AUTHOR="Catherine Boutremans and Gianluca Iannaccone and Christophe
Diot",
TITLE="Impact of link failures on {VoIP} performance",
TYPE="Technical Report",
INSTITUTION="EPFL",
ADDRESS="Lausanne, Switzerland",
NUMBER=200215,
MONTH=apr,
YEAR=2002,
KEYWORDS="IS-IS; routing; VoIP; reliability",
ABSTRACT="We use active and passive traffic measurements to identify the
issues involved in the deployment of a voice service over a tier-1 IP
backbone network.  Our findings indicate that no specific handling of
voice packets (i.e.  QoS differentiation) is needed in the current
backbone but new protocols and mechanisms need to be introduced to
provide a better protection against link failures.  We discover that
link failures may be followed by long periods of routing instability,
during which packets can be dropped because forwarded along invalid
paths.  We also identify the need for a new family of quality of service
mechanisms based on fast protection of traffic and high availability of
the service rather than performance in terms of delay and loss.",
URL="http://icwww.epfl.ch/publications/documents/IC\_TECH\_REPORT\_200215.pdf",
}

@INPROCEEDINGS{Kwon0204:TCP,
AUTHOR="Minseok Kwon and Sonia Fahmy",
TITLE="{TCP} Increase/Decrease Behavior with Explicit Congestion
Notification {(ECN)}",
BOOKTITLE=icc,
ADDRESS="New York, New York, USA",
PAGES="2335-2340",
MONTH=apr,
YEAR=2002,
REFERENCES=30,
KEYWORDS="TCP congestion control; explicit congestion notification
(ECN); random early detection (RED); active queue management; additive
increase multiplicative decrease (AIMD)",
ABSTRACT="We investigate the effect of TCP Explicit Congestion
Notification (ECN) with a new response strategy that is more aggressive
in the short term, but preserves TCP long term behavior, without
modifying the router marking rate. A less aggressive ECN decrease gives
more incentives for end systems to become ECN-compliant, as ECN serves
as an early warning sign in this case. Our analysis and simulation
results demonstrate the effectiveness of the new algorithm in improving
throughput and reducing fluctuations. We model a multiple bottleneck
scenario with various types of traffic, and evaluate the effect of a
number of parameters, including TCP flavor, increase/decrease
parameters, buffer size, and random early detection (RED) parameters.",
URL="http://www.cs.purdue.edu/homes/fahmy/papers/ecn-icc.pdf",
}

@INPROCEEDINGS{Vaid0204:Fast,
AUTHOR="P. P. Vaidyanathan and Bojan Vrcelj",
TITLE="Fast and robust blind-equalization based on cyclic prefix",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="1-5",
MONTH=apr,
YEAR=2002,
REFERENCES=11,
ABSTRACT="The cyclic pre\fix is commonly used in the context of
frequency domain equalization in DMT channels. In this paper we observe
that it can be used in more general contexts and show its advantages in
blind equalization, especially for non minimum phase channels.",
URL="http://ieeexplore.ieee.org/iel5/7828/21514/00996805.pdf?isNumber=21514\&prod=CNF\&arnumber=996805\&arSt=1\&ared=5\&arAuthor=Vaidyanathan\%2C+P.P.\%3B+Vrcelj\%2C+B.",
}

@INPROCEEDINGS{Frag0204:Finite,
AUTHOR="Christina Fragouli and Naofal Al-Dhahir and William Turin",
TITLE="Finite-alphabet constant-amplitude training sequence for
multiple-antenna broadband transmissions",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="6-10",
MONTH=apr,
YEAR=2002,
REFERENCES=8,
ABSTRACT="We propose a method to identify training sequences for
multiple-antenna transmissions over quasi-static frequencyselective
channels. These sequences are constructed to belong to a standard
constant-amplitude 
 -PSK constellation (such as BPSK, QPSK etc) to
simplify the transmitter/receiver implementation. Many practical systems
use training of predetermined length. Optimal sequences do not exist for
all training sequence lengths and constellation alphabets. The proposed
method allows us to identify training sequences that belong to a
standard constellation for an arbitrary training sequence length and an
arbitrary number of unknown channel taps. Performance bounds derived
indicate that these sequences achieve near-optimum performance.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996806.pdf?isNumber=21514\&prod=CNF\&arnumber=996806\&arSt=6\&ared=10\&arAuthor=Fragouli\%2C+C.\%3B+Al-Dhahir\%2C+N.\%3B+Turin\%2C+W.",
}

@INPROCEEDINGS{Lian0204:Higher,
AUTHOR="Jing Liang and Zhi Ding",
TITLE="Higher order statistical approach for channel estimation using
matrix pencils",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="11-15",
MONTH=apr,
YEAR=2002,
REFERENCES=11,
ABSTRACT="In this work, we study the blind identi\fication of
single input single output linear \finite impulse response (FIR)
channels via output higher-order cumulant information. Our aim is to
\find simple and effective approaches for channel estimation. The
proposed algorithms identify channel impulse response by solving a
cumulant matrix pencil. Compared with several existing linear
approaches, the new methods are computationally simpler and less
sensitive to channel order over-estimation. We also present simulation
results that demonstrate the robustness of the new methods to various
channel conditions in practical applications.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996807.pdf?isNumber=21514\&prod=CNF\&arnumber=996807\&arSt=11\&ared=15\&arAuthor=Jing+Liang\%3B+Zhi+Ding",
}

@INPROCEEDINGS{DAmi0204:Multipath,
AUTHOR="A. A. D'Amico and Umberto Mengali and Michele Morelli",
TITLE="Multipath channel estimation for the uplink of a {DS-CDMA}
system",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="16-20",
MONTH=apr,
YEAR=2002,
REFERENCES=11,
ABSTRACT="This paper investigates channel estimation in the uplink of a
DS-CDMA system. The transmission medium is characterized by the presence
of multipath components and the parameters of interest are the delays
and complex gains of the propagation paths. We propose a new method for
estimating the channel parameters of a user entering the system. The
method is based on the maximum likelihood criterion and exploits a
training sequence. In comparison with other estimation algorithms it has
two advantages. First, it reduces a complicated multidimensional
optimization problem to a sequence of one-dimensional problems.
Secondly, it has better capability to resolve closelyspaced multipath
components. Computer simulations are used to assess its performance. It
is found that it is resistant to multiuser interference and can be
effectively used in third generation mobile cellular networks.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996808.pdf?isNumber=21514\&prod=CNF\&arnumber=996808\&arSt=16\&ared=20\&arAuthor=D\%27Amico\%2C+A.A.\%3B+Mengali\%2C+U.\%3B+Morelli\%2C+M.",
}

@INPROCEEDINGS{Fu0204:Blind,
AUTHOR="Hongyi Fu and S. Attallah",
TITLE="Blind channel and carrier offset estimation in multiuser {CDMA}",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="21-25",
MONTH=apr,
YEAR=2002,
REFERENCES=8,
ABSTRACT="The problem of CDMA multiuser detection in the presence of a
small residual carrier is considered in this paper. Subspace-based
approaches are employed for channel estimationand signal demodulation.
The channel response and carrier offset are estimated separately in
order to avoid the computational complexity of joint estimation of two
parameters. The simulation results show that the separate estimation
approach results in lower BER than a previous subspace-based joint
estimation algorithm does for a large range of carrier offsets which are
generally considered in practical applications. Adaptive channel
estimation in a time-variant channel is also considered. A novel
adaptive algorithm for subspace estimation, namely NOOja algorithm, is
used to track the channel variations with time. NOOja algorithm is
applicable for both signal and noise subspace tracking and offers
advantages of better orthogonality and numerical stability than previous
tracking algorithms without any significant increase in computational
complexity. It is shown that NOOja algorithm exhibits good tracking
performance in a time-variant channel.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996809.pdf?isNumber=21514\&prod=CNF\&arnumber=996809\&arSt=21\&ared=25\&arAuthor=Hongyi+Fu\%3B+Attallah\%2C+S.",
}

@INPROCEEDINGS{Slim0204:Channel,
AUTHOR="S. B. Slimane",
TITLE="Channel estimation for {HIPERLAN/2} with transmitter diversity",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="26-30",
MONTH=apr,
YEAR=2002,
REFERENCES=8,
ABSTRACT="In this paper we propose a channel estimation technique for
OFDM based systems, such as HIPERLAN/2 and IEEE 802.11a, with
transmitter diversity. The proposed technique estimates all channel
frequency responses, corresponding to each transmitter and receiver
antenna pair, required for space-time processing in this OFDM based
system. This technique is able to extract the channel state information
for two transmitter antennas using the same preamble as defined in the
standard of HIPERLAN/2. The feasibility of this channel estimation
method is made possible by exploiting the structure of the OFDM
modulation scheme. The results showed that the accuracy provided by this
proposed method is comparable to that obtained when a single transmitter
antenna is used.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996810.pdf?isNumber=21514\&prod=CNF\&arnumber=996810\&arSt=26\&ared=30\&arAuthor=Slimane\%2C+S.B.",
}

@INPROCEEDINGS{Fock0204:Low,
AUTHOR="Gunnar Fock and Peter Schulz-Rittich and A. Schenke and Heinrich
Meyr",
TITLE="Low complexity high resolution subspace-based delay estimation
for {DS-CDMA}",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="31-35",
MONTH=apr,
YEAR=2002,
REFERENCES=11,
ABSTRACT="In this paper we consider the problem of estimating the
propagation delays of a synchronous directsequence code division
multiple access (DS-CDMA) system operating over a multipath fading
channel. In a mobile receiver, the task of delay estimation can be
divided into an acquisition of all multipath delays and subsequent
tracking of the individual delays e.g. with a RAKE structure. Both tasks
are especially challenging in indoor scenarios which commonly exhibit
low delay-spread and thus require a high resolution of the estimation
algorithms. A novel delay acquisition algorithm is presented in this
paper, which is able to resolve multipaths whose delay difference is
below one chip duration with high probability of acquisition and low
computational complexity. It is based on a decomposition of the
time-averaged correlation matrix of the output of a sliding correlator
into signal and noise subspaces, with subsequent MUSIC spectrum
computation and maximum search. Theperformance of the algorithm is
assessed by means of computer simulations.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996811.pdf?isNumber=21514\&prod=CNF\&arnumber=996811\&arSt=31\&ared=35\&arAuthor=Fock\%2C+G.\%3B+Schulz-Rittich\%2C+P.\%3B+Schenke\%2C+A.\%3B+Meyr\%2C+H.",
}

@INPROCEEDINGS{Zakh0204:Maximum,
AUTHOR="Y. V. Zakharov and V. M. Baronkin and T. C. Tozer",
TITLE="Maximum likelihood frequency estimation in multipath rayleigh
sparse fading channels",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="36-40",
MONTH=apr,
YEAR=2002,
REFERENCES=6,
ABSTRACT="Maximum likelihood (ML) data-aided frequency estimation in
multipath Rayleigh fading channels with sparse impulse responses is
investigated. We solve this problem under the assumption that the
autocorrelation matrix of the pilot signal can be approximated by a
diagonal matrix, the fading of different path amplitudes are independent
from each other, and the additive noise is white and Gaussian. The ML
frequency estimator is shown to be based on combining nonlinear
transformed path periodograms.We have found the nonlinear function for
the two cases: known and unknown fading variances. The new frequency
estimators lead, in particular cases, to known ML frequency estimators
for non-sparse multipath fading channels. Exploiting the sparseness of
the channel impulse response is shown to significantly reduce the
threshold signal-to-noise ratio (SNR) at which the frequency error
departs from the Cramer-Rao lower bound. However, precise knowledge of
the channel sparseness is not required in order to realise this
improvement. The assumption of a diagonal autocorrelation matrix is
shown to affect the accuracy performance only at high SNRs which however
can often be outside the SNRs of interest.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996812.pdf?isNumber=21514\&prod=CNF\&arnumber=996812\&arSt=36\&ared=40\&arAuthor=Zakharov\%2C+Y.V.\%3B+Baronkin\%2C+V.M.\%3B+Tozer\%2C+T.C.",
}

@INPROCEEDINGS{Ueda0204:High,
AUTHOR="K. Ueda and Hiroshi Ochi and J. Okello and Y. Itoh",
TITLE="A high-speed architecture for {CMA} blind equalizer",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="41-43",
MONTH=apr,
YEAR=2002,
REFERENCES=1,
ABSTRACT="In this paper, we propose an architecture for pipelined FIR
ADF based on the CMA (Constant Modulus Algorithm), which is a kind of
blind equalizer. One of the features of proposed architecture, is its
latency, which is independent of the number of taps of coefficients, and
whose value is always fixed to a single clocking period. As of the
critical path, the proposed method has a shorter path in comparison with
conventional CMA using the direct form FIR ADF. Thus, an improvement in
the processing speed and a lower power consumption can be attained. Some
computer simulation are shown to verify the effectiveness of the
proposed method.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996813.pdf?isNumber=21514\&prod=CNF\&arnumber=996813\&arSt=41\&ared=43\&arAuthor=Ueda\%2C+K.\%3B+Ochi\%2C+H.\%3B+Okello\%2C+J.\%3B+Itoh\%2C+Y.",
}

@INPROCEEDINGS{Lu0204:Bayesian,
AUTHOR="Ben Lu and Xiaodong Wang",
TITLE="Bayesian blind turbo receiver for coded {OFDM} systems with
frequency offset and frequency-selective fading",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="44-48",
MONTH=apr,
YEAR=2002,
REFERENCES=23,
ABSTRACT="The design of blind receiver for coded orthogonal
frequency-division multiplexing (OFDM) communication systems in the
presence of frequency offset and frequency-selective fading is
investigated. The proposed blind receiver iterates between a Bayesian
demodulation stage and a maximum a posteriori(MAP) channel decoding
stage; and the extrinsic a posteriori probabilities of data symbols are
iteratively exchanged between these two stages to achieve successively
improved performance. The Bayesian demodulator computes the a posteriori
data symbol probabilities, based on the received signals(without knowing
or explicitly estimating the frequency offset and the fading channel
states), by using the Markov chain Monte Carlo (MCMC) techniques. In
particular, two MCMC methods, namely, the Metropolis-Hastings algorithm
and the Gibbs sampler, are studied for this purpose. Computer simulation
results show that the proposed Bayesian blind turbo receiver can achieve
good performance and it is robust against modeling mismatch.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996814.pdf?isNumber=21514\&prod=CNF\&arnumber=996814\&arSt=44\&ared=48\&arAuthor=Lu\%2C+B.\%3B+Xiaodong+Wang",
}

@INPROCEEDINGS{Chen0204:Maximum,
AUTHOR="Biao Chen and Hao Wang",
TITLE="Maximum likelihoo estimation of {OFDM} carrier frequency offset",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="49-53",
MONTH=apr,
YEAR=2002,
REFERENCES=9,
ABSTRACT="Blind estimation of the OFDM carrier frequency o\ffset
(CFO) is studied in this paper. Maximum likelihood estimation is
developed in the presence of virtual carrier. It turned out that the
resulting estimator has an identical form to that of a previously
proposed blind estimation scheme by Liu and Tureli [1]. We explain,
using the projection argument, why these two estimators are equivalent.
For improved CFO estimation performance, mutliple OFDM blocks can be
utilized. Alternatively receiver diversity may be used in the CFO
estimation. We show that in both cases, the estimator again reduces to
the form similar to that of the MUSIC-like algorithm as in [1].
Performance improvement is shown using both the Cramer Rao Lower Bound
and numerical examples.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996815.pdf?isNumber=21514\&prod=CNF\&arnumber=996815\&arSt=49\&ared=53\&arAuthor=Biao+Chen\%3B+Hao+Wang",
}

@INPROCEEDINGS{Tkac0204:Noise,
AUTHOR="A. Tkacenko and P. P. Vaidyanathan",
TITLE="Noise optimized eigenfilter design of time-domain equalizers for
{DMT} systems",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="54-58",
MONTH=apr,
YEAR=2002,
REFERENCES=11,
ABSTRACT="The design of time-domain equalizers or TEQs for discrete
multitone modulation (DMT) systems has recently received much attention.
In this paper, we present a generalization of one such design method
which takes into account the noise observed in a DMT channel.
Furthermore, we show how this generalization can be used for the design
of fractionally spaced equalizers or FSEs. Experimental results are
presented showing that our design method performs better than other
known techniques.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996816.pdf?isNumber=21514\&prod=CNF\&arnumber=996816\&arSt=54\&ared=58\&arAuthor=Tkacenko\%2C+A.\%3B+Vaidyanathan\%2C+P.P.",
}

@INPROCEEDINGS{Gini0204:Blind,
AUTHOR="Georgios Ginis and Yeheskel Bar-Ness and John Cioffi",
TITLE="Blind adaptive {MIMO} decision feedback equalization using givens
rotations",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="59-63",
MONTH=apr,
YEAR=2002,
REFERENCES=16,
ABSTRACT="An adaptive method is proposed for Multiple-Input-
Multiple-Output (MIMO) Decision Feedback Equalization (DFE) in the
absence of channel knowledge at the receiver and without requiring a
training sequence. The Zero-Forcing (ZF) DFE is shown to consist of an
orthogonal matrix(feedforward section) and an upper triangular matrix
(feedback section). The feedforward matrix is expressed as the
multiplication of Givens rotations terms, where each term is
characterized by a rotation angle. An adaptive algorithm is presented
for the blind determination of the unknown angles and of the elements of
the feedback matrix. The adaptation criteria are decorrelation
conditions, which are similar to those previously proposed in [1], [2].
Simulation results are included demonstrating the performance of the
method.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996817.pdf?isNumber=21514\&prod=CNF\&arnumber=996817\&arSt=59\&ared=63\&arAuthor=Ginis\%2C+G.\%3B+Bar-Ness\%2C+Y.\%3B+Cioffi\%2C+J.M.",
}

@INPROCEEDINGS{Glav0204:Equalization,
AUTHOR="M. Glavin and E. V. Jones",
TITLE="Equalization of a dynamic channel with forward error correction
using an adaptive precoder",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="64-68",
MONTH=apr,
YEAR=2002,
REFERENCES=16,
ABSTRACT="In high-speed communications systems the task of channel
equalization can be quite demanding. One of the most common and most
powerful equalization algorithms is the Decision Feedback Equalizer
(DFE). In certain cases though, the DFE is not powerful enough to give
the required performance margin on its own, and a Forward Error
Correction (FEC) scheme must be employed to give an extra boost in
performance. The introduction of the FEC in itself creates problems for
the DFE which is compensated for by the use of a precoder. In steady
state, this does not affect the overall performance of the system, but
in a situation where the channel is subject to change, the precoding
scheme runs into difficulty. This paper describes a modification to the
conventional fixed precoder to allow the precoder to adapt slowly in a
dynamic channel environment. Also shown here is a new method of dealing
with a dynamic channel by maintaining an active DFE in the receiver,
purely for the purpose of adapting the precoder coefficients during
runtime. The technique is applied to Digital Subscriber Line (DSL)
transmission at 1.544 Mbit/s, using coded 16-PAM modulation.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996818.pdf?isNumber=21514\&prod=CNF\&arnumber=996818\&arSt=64\&ared=68\&arAuthor=Glavin\%2C+M.\%3B+Jones\%2C+E.",
}

@INPROCEEDINGS{Cari0204:Recovery,
AUTHOR="D. Cariolaro and Lorenzo Favalli",
TITLE="Recovery of {ISI} channels using multiresolution wavelet
equalization",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="74-78",
MONTH=apr,
YEAR=2002,
REFERENCES=8,
ABSTRACT="Equalization of ISI is usually performed in the time domain.
In fact it is difficult to operate in the frequency domain since with
the usual spectral techniques based on the Fourier correspondence
between temporal and frequency components is lost in the transformation.
In this paper we present an application of the Wavelet transform that
exploits the joint time-frequency representation of this transform to
equalize channels affected by ISI. It is shown that using the
description of wavelets as filters, and exploiting the multispectral
decomposition of the received signal, the ISI can be dramatically
reduced reasoning in terms of ”bandwidth” and ”filter gains”.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996820.pdf?isNumber=21514\&prod=CNF\&arnumber=996820\&arSt=74\&ared=78\&arAuthor=Cariolaro\%2C+D.\%3B+Favalli\%2C+L.",
}

@INPROCEEDINGS{Niss0204:Adaptive,
AUTHOR="Mauri Nissila and Subbarayan Pasupathy",
TITLE="Adaptive baum-welch algorithms for frequency-selective fading
channels",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="79-83",
MONTH=apr,
YEAR=2002,
REFERENCES=14,
ABSTRACT="In this paper, the problem of adaptive equalization of the
time-varying frequency-selective channel is studied by using the
adaptive Baum-Welch algorithm. In particular, blind LMS and blind RLS
channel estimators are derived and they are combined with the well-known
forward-backward processing SISO algorithm for known channels. An
application of the proposed algoritms to the iterative
“turbo-processing” receivers illustrated how the blind LMS and blind RLS
estimators can efficiently utilize the extrinsic information obtained
from the decoder SISO in order to enhance their estimation accuracy.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996821.pdf?isNumber=21514\&prod=CNF\&arnumber=996821\&arSt=79\&ared=83\&arAuthor=Nissila\%2C+M.\%3B+Pasupathy\%2C+S.",
}

@INPROCEEDINGS{Dane0204:Multiscale,
AUTHOR="Fred Daneshgaran and Massimiliano Laddomada",
TITLE="Multiscale iterative {LBG} clustering for {SIMO} channel
identification",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="84-88",
MONTH=apr,
YEAR=2002,
REFERENCES=8,
ABSTRACT="This paper deals with the problem of channel identification
for Single Input Multiple Output (SIMO) slow fading channels using
clustering algorithms. The received data vectors of the SIMO model are
spread in clusters because of the AWGN noise. Each cluster is centered
around the ideal channel output labels without noise. Starting from the
Markov SIMO channel model, simultaneous maximum-likelihood estimation of
the input vector and the channel coefficients reduces to one of
obtaining the values of this pair that minimizes the sum of the
Euclidean norms between the received and the estimated output vectors.
Viterbi algorithm can be used for this purpose provided the trellis
diagram of the Markov model can be labeled with the noiseless channel
outputs. The problem of identification of the ideal channel outputs,
which is the focus of this paper, is then equivalent to designing a
Vector Quantizer (VQ) from a training set corresponding to the observed
noisy channel outputs. The Linde-Buzo-Gray (LBG)-type clustering
algorithms [1] could be used to obtain the noiseless channel output
labels from the noisy received vectors. This paper looks at two critical
issues with regards to the use of VQ for channel identification. The
first has to deal with the applicability of this technique in general.
We present theoretical results showing the conditions under which the
technique may be applicable. The second aims at overcoming the codebook
initialization problem by proposing a novel approach which attempts to
make the first phase of the channel estimation faster than the classical
codebook initialization methods.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996822.pdf?isNumber=21514\&prod=CNF\&arnumber=996822\&arSt=84\&ared=88\&arAuthor=Daneshgaran\%2C+F.\%3B+Laddomada\%2C+M.",
}

@INPROCEEDINGS{Guen0204:DD,
AUTHOR="Mamoun Guenach and Luc Vandendorpe",
TITLE="Performance analysis of {DA} and {DD} multiuser tap weight
estimators for short code {DS-CDMA} systems",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="89-93",
MONTH=apr,
YEAR=2002,
REFERENCES=5,
ABSTRACT="In this paper we investigate the performance of three
multiuser tap weight estimators for multipath channels in Data Aided
(DA) and Decision Directed modes for a BPSK DS-CDMA reverse link. The
tap weights are estimated using different algorithms working separately
or jointly in order to obtain good estimates as required for coherent
detection or synchronization purposes. The performance of these
algorithms and their sensitivity to the observation window, to the delay
estimation error and to the difference between successive delays are
investigated. A comparison between Hadamard and Gold codes is also
included in this paper. The mean squared estimation error (MSEE) is
computed and compared to the Cram`er-Rao Lower Bound (CRLB).",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996823.pdf?isNumber=21514\&prod=CNF\&arnumber=996823\&arSt=89\&ared=93\&arAuthor=Guenach\%2C+M.\%3B+Vandendorpe\%2C+L.",
}

@INPROCEEDINGS{Gald0204:LMS,
AUTHOR="J. F. Galdino and Ernesto Pinto and M. de Alencar",
TITLE="Performance of the {LMS} algorithm on the estimation of
time-varying channels",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="94-98",
MONTH=apr,
YEAR=2002,
REFERENCES=5,
ABSTRACT="The performance of the least-mean-square (LMS) algorithm on
the estimation of time-varying channels is analytically evaluated, using
the estimation error correlation matrix andt he mean square error (MSE)
as parameters. Expressions for those parameters are obtainedfr om a set
of hypotheses usually adopted in the communication systems context. The
channel is modeled as a wide sense stationary discrete time stochastic
\field with known autocorrelation. The expression for the steady
state MSE is particularizedassum ing wide sense stationary-uncorrelated
scattering WSS-US) channel model. Several estimates of MSE curves
obtained by computer simulation are comparedwith analytical results for
validation purposes. A very good agreement between simulated and
analytical results is shown.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996824.pdf?isNumber=21514\&prod=CNF\&arnumber=996824\&arSt=94\&ared=98\&arAuthor=Galdino\%2C+J.F.\%3B+Pinto\%2C+E.L.\%3B+de+Alencar\%2C+M.S.",
}

@INPROCEEDINGS{Lee0204:Coordinated,
AUTHOR="Yen-Chi Lee and Yucel Altunbasak and R. M. Mersereau",
TITLE="A coordinated multiple description scalar quantizer and error
concealment algorithm for error resilient video streaming over lossy
channels",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="99-103",
MONTH=apr,
YEAR=2002,
REFERENCES=5,
ABSTRACT="Historically, multiple description coding (MDC) and
post-processing error concealment (ECN) algorithms for video have
evolved separately. Although multiple description coding provides a way
to make the video quality degrade gracefully in the presence of packet
losses, the resulting quality may be unsatisfactory when only one
description is used to reconstruct the signal. This paper proposes a
coordinated application of multiple description scalar quantizer (MDSQ)
and error concealment, where the smoothness of the video signal helps to
compensate for the loss of descriptions. This joint optimization results
in significant improvements in reconstructed video quality over
independent use of MDSQ.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996825.pdf?isNumber=21514\&prod=CNF\&arnumber=996825\&arSt=99\&ared=103+vol.1\&arAuthor=Yen-Chi+Lee\%3B+Altunbasak\%2C+Y.\%3B+Mersereau\%2C+R.M.",
}

@INPROCEEDINGS{Shar0204:Fast,
AUTHOR="A. Sharifinejad and H. Mehrpour",
TITLE="A fast full search block matching algorithm using three window
search based on the statistical analysis of the motion vectors",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="104-108",
MONTH=apr,
YEAR=2002,
REFERENCES=18,
ABSTRACT="The removal of temporal redundancy for reducing the bit rate
of videos is the most time consuming part of video encoders. Our
proposed algorithm, TWS, improves the encoder's speed by at least 42
times with respect to the full search algorithm. Moreover, not only TWS
(just like the full search algorithm) maintains MSE to its minimum
value, but it also retains the encoded videos' compression rate at the
highest. The development of the proposed algorithm is based on the
statistical data of motion vectors which are extracted from 5 long video
sequences. According to the length of motion vectors, it is observed
that they can be grouped in three distinctive ranges which constitutes
the foundation for having three search windows in TWS. The TWS algorithm
unlike the other fast algorithms does not have the problem of
convergence towards the local minima of the distortion function. Our
proposed algorithm has almost the same MSE values as the FS algorithm.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996826.pdf?isNumber=21514\&prod=CNF\&arnumber=996826\&arSt=104\&ared=108+vol.1\&arAuthor=Sharifinejad\%2C+A.\%3B+Mehrpour\%2C+H.",
}

@INPROCEEDINGS{Seo0204:Rate,
AUTHOR="Kwang-deok Seo and Seong-cheol Heo and Jae-kyoon Kim",
TITLE="A rate control algorithm based on adaptive {R-Q} model for
{MPEG-1} to {MPEG-4} transcoding in {DCT} domain",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="109-113",
MONTH=apr,
YEAR=2002,
REFERENCES=9,
ABSTRACT="This paper proposes an adaptive rate control algorithm for
MPEG-1 to MPEG-4 transcoder for video transmission over networks of
different capacities and characteristics. It is based on an adaptive R-Q
model to follow the new target bit-rate of a transcoded bitstream. In
R-Q modeling, the R-Q characteristics predicted from a previous picture
of the same picture type are used in combination with the R-Q data
measured for the current picture. To overcome the quantizer mismatch
between MPEG-1 and MPEG-4 syntax, a gradual adaptation function is
applied. It is shown that the adaptive R-Q model-based rate control can
efficiently control the output bit-rate to match the target bit
budget.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996827.pdf?isNumber=21514\&prod=CNF\&arnumber=996827\&arSt=109\&ared=113+vol.1\&arAuthor=Kwang-deok+Seo\%3B+Seong-cheol+Heo\%3B+Jae-kyoon+Kim",
}

@INPROCEEDINGS{Ota0204:Speech,
AUTHOR="Y. Ota and Mio Suzuki and Y. Tsuchinaga and M. Tanaka and
Shigenobu Sasaki",
TITLE="Speech coding translation for {IP} and {3G} mobile integrated
network",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="114-118",
MONTH=apr,
YEAR=2002,
REFERENCES=8,
ABSTRACT="As a novel technique for IP and 3G mobile integrated networks,
we propose a speech coding translation scheme that can improve the
speech quality of intercommunication among different speech coding
standards, such as G.729 of VoIP and AMR of IMT-2000. Through the direct
conversion of transmission parameters, this scheme improves speech
intelligibility with reduced processing delay compared with conventional
schemes, which consist of auxiliary decoding and asynchronous
re-encoding. A subjective test by 40 non-experts shows that the proposed
scheme significantly improves the subjective speech quality by a
probability of 99\%. And processing delay in one-way transmission is
reduced by 25 ms.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996828.pdf?isNumber=21514\&prod=CNF\&arnumber=996828\&arSt=114\&ared=118+vol.1\&arAuthor=Ota\%2C+Y.\%3B+Suzuki\%2C+M.\%3B+Tsuchinaga\%2C+Y.\%3B+Tanaka\%2C+M.\%3B+Sasaki\%2C+S.",
}

@INPROCEEDINGS{Yang0204:Decision,
AUTHOR="Jingnong Yang and Yihan Li",
TITLE="A decision-feedback equalizer with tentative chip feedback for
the downlink of wideband {CDMA}",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="119-123",
MONTH=apr,
YEAR=2002,
REFERENCES=9,
ABSTRACT="We investigate a chip-level minimum mean-square-error (MMSE)
decision-feedback equalizer (DFE) for the downlink receiver of wideband
code-division multiple-access (CDMA) systems using long scrambling code
over frequency-selective channels. The DFE uses the tentative decision
of the current symbol as feedback. The proposed DFE performs better than
the chip-level linear equalizers (LE) and the DFE that feeds back only
the symbols already decided. The performance gain increases with
signal-to-noise ratio (SNR), but decreases with the number of active
users. The performance of these different equalizers is compared through
simulation of symbol-level MSE over a fixed channel.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996829.pdf?isNumber=21514\&prod=CNF\&arnumber=996829\&arSt=119\&ared=123+vol.1\&arAuthor=Jingnong+Yang\%3B+Li\%2C+Y.",
}

@INPROCEEDINGS{Li0204:Blind,
AUTHOR="Xiaohua Li and Taewoo Han",
TITLE="Blind channel identification and equalization for precoded
communication systems",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="124-128",
MONTH=apr,
YEAR=2002,
REFERENCES=5,
ABSTRACT="By employing the correlation of the multirate filterbank
precoded signals, new methods are proposed for blind channel
identification/equalization, blind direct equalization and blind
synchronization. Both batch and adaptive algorithms are developed
utilizing the correlation cancelling techniques. The new algorithms have
broader applications than many existing ones. Their computational
complexity is lower and can even be O(N). Simulations demonstrate their
good performance.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996830.pdf?isNumber=21514\&prod=CNF\&arnumber=996830\&arSt=124\&ared=128+vol.1\&arAuthor=Xiaohua+Li\%3B+Taewoo+Han",
}

@INPROCEEDINGS{Pana0204:Convergence,
AUTHOR="C. M. Panazio and Joao M. T. Romano",
TITLE="On the convergence of a new joint {DFE} \& decoding procedure for
blind decision directed {LMS} equalization",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="129-133",
MONTH=apr,
YEAR=2002,
REFERENCES=9,
ABSTRACT="Adaptive equalization is a classical technique for mitigating
ISI in unknown or time varying channels. The decision-feedback equalizer
(DFE) is considered to be an efficient approach in many types of
channels where linear equalizers fail. Unfortunately, it suffers from
error propagation phenomena. In order to reduce such effect, the present
paper deals with the joint application of both equalization and decoding
process in the receiver. The main contributions are the proposal of a
new joint DFE and decoding configuration which works in a blind decision
directed (DD) context and the study of the corresponding error surfaces
behavior, and the assessment of the convergence rate. The proposed
technique is shown to be effective for the so-called bad channels class,
which makes the conventional DD-DFE ill-converge when its weights are
initialized with zeros.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996831.pdf?isNumber=21514\&prod=CNF\&arnumber=996831\&arSt=129\&ared=133+vol.1\&arAuthor=Panazio\%2C+C.M.\%3B+Romano\%2C+J.M.T.",
}

@INPROCEEDINGS{Lee0204:Effect,
AUTHOR="Yumin Lee and Jyh-Hau Chen",
TITLE="The effect of channel estimator memory mismatch on the
performance of {MLSE} in wireless data communications",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="134-138",
MONTH=apr,
YEAR=2002,
REFERENCES=8,
ABSTRACT="The maximum likelihood sequence estimator (MLSE) has been
shown to be an effective measure against inter-symbol interference. An
estimate of the discrete-time equivalent channel is usually required in
order to perform sequence estimation. In practice, the length (or
memory) of the channel is unknown to the receiver for wireless
communication channels. In this paper, upper and lower bounds for the
performance loss due to channel estimator memory mismatch are derived
for unbiased estimators, while approximate expressions for the
irreducible BER floor caused by channel estimator memory mismatch are
derived for biased estimators. Simulation results are also provided for
random channels to verify the correctness of the analysis.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996832.pdf?isNumber=21514\&prod=CNF\&arnumber=996832\&arSt=134\&ared=138+vol.1\&arAuthor=Yumin+Lee\%3B+Jyh-Hau+Chen",
}

@INPROCEEDINGS{Du0204:Fast,
AUTHOR="K.-L. Du and Kwang-Tin Cheng and M. N. S. Swamy",
TITLE="A fast neural beamformer for antenna arrays",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="139-144",
MONTH=apr,
YEAR=2002,
REFERENCES=10,
ABSTRACT="A fast neuro-beamformer is presented in this paper. The new
algorithm is based on the radial-basis function network. To meet
real-time requirement, we customize the basis function for fast
computation, and apply a recursive least square learning rule to speed
up the network training. By comparing the effects of center location and
distribution, we can achieve a minimum network for recalling. The
network recalling does not require the knowledge of
direction-of-arrival, and thus the method is a blind method.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996833.pdf?isNumber=21514\&prod=CNF\&arnumber=996833\&arSt=139\&ared=144+vol.1\&arAuthor=Du\%2C+K.-L.\%3B+Cheng\%2C+K.K.M.\%3B+Swamy\%2C+M.N.S.",
}

@INPROCEEDINGS{Du0204:Iterative,
AUTHOR="K.-L. Du and M. N. S. Swamy",
TITLE="An iterative blind cyclostationary beamforming algorithm",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="145-148",
MONTH=apr,
YEAR=2002,
REFERENCES=9,
ABSTRACT="The cross-correlation neural network proposed in Diamantaras
and Kung (1994) is an efficient iterative method for singular value
decomposition. In this paper, we propose an iterative blind
cyclostationary beamforming algorithm, which is inspired by the
cross-correlation neural model. It can be used to extract signals with
cyclostationarity. The new algorithm is a gradient decent-based method.
It is fast, simple, and easy to implement. Simulation shows that it can
provide good performance as long as the learning rate is suitably
selected.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996834.pdf?isNumber=21514\&prod=CNF\&arnumber=996834\&arSt=145\&ared=148+vol.1\&arAuthor=Du\%2C+K.-L.\%3B+Swamy\%2C+M.N.S.",
}

@INPROCEEDINGS{Sell0204:Novel,
AUTHOR="F. Sellone and L. Lo Presti",
TITLE="A novel optimum {SINR} beamforming in flat fading macrocells",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="149-154",
MONTH=apr,
YEAR=2002,
REFERENCES=13,
KEYWORDS="optimum sinr beamforming; direction of arrival; multipath;
wireless communications; flat fading channels",
ABSTRACT="In the array processing literature several statistically
optimum beamformers have been proposed, to cope with the problem of
optimal source separation. Optimum signal to interference plus noise
power ratio (SINR) beamforming is probably one of the best techniques
because it can circumvent most of the drawbacks of other beamforming
techniques, but, in many already proposed approaches, the knowledge of
the correlation matrices of the desired and the interference signals, is
simply assumed. Unfortunately, the estimation might not be easily
evaluated in practical scenarios wherein both kind of signals are
simultaneously present at the receiver. In this paper we propose a novel
direction of arrival (DOA) driven statistically optimum SINR beamformer
whose aim is to exploit the inherent structure of the signal space. The
beamformer response is optimized in such a way that power contributions
of signals belonging to the desired signal subset (DSS) are maximized at
the beamformer output, while power contributions of signals belonging to
the complementary subset, named the rejected signal subset (RSS) and to
the noise are minimized. In addition, a practical way to estimate the
correlation matrices of desired and rejected signals is also provided,
along with a closed form of the optimum weight vector characterizing the
beamformer. This proposed technique yields to a family of SINR optimum
beamformers, parameterized by different partitions of the DOA set.
Another important feature of our technique is its inherent modularity,
that makes it suitable for a parallel hardware implementation, so that
real-time applications can be carried out.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996835.pdf?isNumber=21514\&prod=CNF\&arnumber=996835\&arSt=149\&ared=154+vol.1\&arAuthor=Sellone\%2C+F.\%3B+Lo+Presti\%2C+L.",
}

@INPROCEEDINGS{Lim0204:Channel,
AUTHOR="Chae-Hyun Lim and Sung-Hoon Moon and Young-il Kim and Dong-Seog
Han",
TITLE="Channel capacity enhancement using virtual array elements in
smart antenna systems",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="155-159",
MONTH=apr,
YEAR=2002,
REFERENCES=8,
ABSTRACT="A smart antenna system using virtual array elements is
proposed to increase the channel capacity of mobile communication
systems. The proposed smart antenna system increases the degree of
freedom using virtual array elements generated by complex conjugations
of real array elements signals and sign compensations using the
orthogonality between the user identification codes in the I and Q
channels. The performance of the proposed system is analyzed under
cdma2000 specifications in urban cell environments.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996836.pdf?isNumber=21514\&prod=CNF\&arnumber=996836\&arSt=155\&ared=159+vol.1\&arAuthor=Chae-Hyun+Lim\%3B+Sung-Hoon+Moon\%3B+Young-Il+Kim\%3B+Dong-Seog+Han",
}

@INPROCEEDINGS{Alam0204:New,
AUTHOR="F. Alam and Donghee Shim and Brian Woerner",
TITLE="A new low-complexity {beamformer-RAKE} receiver for {WCDMA}",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="160-164",
MONTH=apr,
YEAR=2002,
REFERENCES=10,
ABSTRACT="We demonstrate the performance of a beamformer-RAKE receiver
at the uplink of a wideband code division multiple access (WCDMA)
system. The receiver employs maximum signal to interference and noise
ratio (MSINR) criterion to form its beams in the spatial domain. We
propose a new iterative algorithm to solve the generalized eigenvalue
problem (GE) resulting from the MSINR beamforming criterion. This
algorithm, termed adaptive matrix inversion (AMI), has linear
computational complexity with the number of antenna elements. We show
the performance gain compared to that of another proposed method.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996837.pdf?isNumber=21514\&prod=CNF\&arnumber=996837\&arSt=160\&ared=164+vol.1\&arAuthor=Alam\%2C+F.\%3B+Donghee+Shim\%3B+Woerner\%2C+B.D.",
}

@INPROCEEDINGS{Damm0204:Beamforming,
AUTHOR="A. Dammann and R. Raulefs and Stefan Kaiser",
TITLE="Beamforming in combination with space-time diversity for
broadband {OFDM} systems",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="165-171",
MONTH=apr,
YEAR=2002,
REFERENCES=10,
ABSTRACT="We investigate broadband OFDM systems which apply beamforming
in combination with different space-time diversity techniques. Various
beamforming scenarios with transmitter and/or receiver sided beamforming
are considered. Space-time diversity is obtained by cyclic delay
diversity (CDD) in order to artificially shape the spectrum of the
received signal. Thus, an advantageous distribution of the errors before
a Viterbi channel decoder is obtained. Simulation results for the bit
error rate performance are presented and compared for OFDM systems
applying different beamforming scenarios and CDD in a Rayleigh fading
channel. Maximum ratio combining (MRC) of the signals received on
multiple beams/antennas is also taken into account in the performance
analysis.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996838.pdf?isNumber=21514\&prod=CNF\&arnumber=996838\&arSt=165\&ared=171+vol.1\&arAuthor=Dammann\%2C+A.\%3B+Raulefs\%2C+R.\%3B+Kaiser\%2C+S.",
}

@INPROCEEDINGS{Wang0204:Multi,
AUTHOR="Yiping Wang and Mehmet Yavuz and A. Chheda",
TITLE="On multi-cell interference and capacity of the {CDMA} forward
link with tracking beam antennae",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="172-176",
MONTH=apr,
YEAR=2002,
REFERENCES=12,
ABSTRACT="The use of narrow tracking beam antennas at base stations
provides a way to increase the capacity of CDMA cellular systems. The
realistic capacity evaluation of such a system is still a challenge
since multi-cell interference is hard to model, especially considering
real-time power control and soft handoff. This paper proposes and
compares both an analytical and a simulation approach in calculating
multi-cell interference in the CDMA forward link with a transmission
tracking beam antenna. The analytical method assumes a constant required
E/sub b//N/sub 0/ for all users in the system to maintain a given
quality of service, while the simulation approach takes the CDMA soft
(and softer) handoff gain into account. The results show that the latter
yields a more realistic interference power profile. To evaluate the
capacity gain of the tracking beam system, the interference power
profile is incorporated into an IS-2000 symbol-level user motion
simulation. The simulations show that narrow tracking beam antennas can
provide about 2.7 times capacity gain over a conventional tri-sector
system.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996839.pdf?isNumber=21514\&prod=CNF\&arnumber=996839\&arSt=172\&ared=176+vol.1\&arAuthor=Yiping+Wang\%3B+Yavuz\%2C+M.\%3B+Chheda\%2C+A.",
}

@INPROCEEDINGS{Wu0204:Use,
AUTHOR="Haidong Wu and Jiangzhou Wang",
TITLE="On the use of lattice algorithm for adaptive antennas",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="177-181",
MONTH=apr,
YEAR=2002,
REFERENCES=8,
ABSTRACT="Adaptive antenna arrays have been widely studied to reduce
multiuser interference by spatial suppression. The lattice algorithm,
based on least square estimation, is investigated to realize adaptive
antenna beamforming. Both analytical and simulation results show that
this algorithm not only has fast convergence, but also good multiuser
interference suppression performance. Furthermore, the antenna weights
iteration processes are discussed in different multiuser interference
conditions.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996840.pdf?isNumber=21514\&prod=CNF\&arnumber=996840\&arSt=177\&ared=181+vol.1\&arAuthor=Haidong+Wu\%3B+Jiangzhou+Wang",
}

@INPROCEEDINGS{Hent0204:Effective,
AUTHOR="Pertti Henttu",
TITLE="Effective interference suppression using short overlapping
regions of data and {SVD}",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="182-186",
MONTH=apr,
YEAR=2002,
REFERENCES=12,
KEYWORDS="svd; wide band interference; nbi; short data record; overlap",
ABSTRACT="The interference suppression (IS) capability of a frequency
hopping spread spectrum communication system can be increased by using
additional IS algorithms. In this paper a new interference suppression
algorithm called short overlapping singular value decomposition (SOSVD)
is described. Many of the existing blind IS algorithms perform
unsatisfactorily when interference is wideband. It is shown by
simulations that the performance of the proposed SOSVD method clearly
exceeds the performance of the blind recursive least squares (RLS)
directed interpolation filter in a wideband interference environment.
The computational complexity of the proposed method is tolerable because
the size of the SVD input matrix is small and constant.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996841.pdf?isNumber=21514\&prod=CNF\&arnumber=996841\&arSt=182\&ared=186+vol.1\&arAuthor=Henttu\%2C+P.",
}

@INPROCEEDINGS{Kim0204:Frame,
AUTHOR="Jung-Jin Kim and Young-Jae Ryu and Hae-Sock Oh and Dong-Seog
Han",
TITLE="Frame selection algorithm with adaptive {FFT} input for {OFDM}
systems",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="187-191",
MONTH=apr,
YEAR=2002,
REFERENCES=9,
ABSTRACT="Orthogonal frequency division multiplexing (OFDM) systems
transmit a cyclic prefix, called a guard-interval, which is inserted in
front of the effective symbol period along with signals copied from some
of the last parts in the effective symbol period. This guard-interval is
then used to reduce distortions which are due to multipath conditions.
However, conventional OFDM systems produce intersymbol interference
(ISI) under severe multipath or pre-ghost channel conditions even though
they accurately estimate the effective symbol period. Accordingly, the
current paper proposes a frame selection algorithm for a fast Fourier
transform (FFT) operation in the OFDM receiver to remove the ISI
produced in conventional OFDM systems under multipath conditions. The
proposed algorithm replaces some of the rear parts of the effective
symbol period with some of the guard-interval as an FFT input frame. The
replaced period for the FFT input frame is changed according to the
multipath environment. Four estimation methods for determining the
replaced period are also presented. The proposed algorithm can increase
the receiver performance by more than 3 dB under multipath conditions in
a terrestrial digital video broadcasting (DVB-T) system without changing
the equalization method.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996842.pdf?isNumber=21514\&prod=CNF\&arnumber=996842\&arSt=187\&ared=191+vol.1\&arAuthor=Jung-Jin+Kim\%3B+Young-Jae+Ryu\%3B+Hae-Sock+Oh\%3B+Dong-Seog+Han",
}

@INPROCEEDINGS{Wang0204:Aided,
AUTHOR="Yu Wang and Erchin Serpedin and R. Ciblat",
TITLE="Non-data aided feedforward estimation of {PSK-modulated} carrier
frequency offset",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="192-196",
MONTH=apr,
YEAR=2002,
REFERENCES=12,
ABSTRACT="This paper examines the asymptotic (large sample) performance
of a family of non-data aided feedforward (NDA FF) nonlinear
least-squares (NLS) type carrier frequency estimators for burst-mode
phase shift keying (PSK) modulations transmitted through AWGN and flat
Rician-fading channels. The asymptotic performance of these estimators
is established in a closed-form expression and compared with the
modified Cramer-Rao bound (MCRB). A best linear unbiased estimator
(BLUE), which exhibits the lowest asymptotic variance within the family
of NDA FF NLS-type estimators, is also proposed.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996843.pdf?isNumber=21514\&prod=CNF\&arnumber=996843\&arSt=192\&ared=196+vol.1\&arAuthor=Wang\%2C+Y.\%3B+Serpedin\%2C+E.\%3B+Ciblat\%2C+R.",
}

@INPROCEEDINGS{Wies0204:Signal,
AUTHOR="Ami Wiesel and J. Goldberg and H. Messer",
TITLE="Non-data-aided signal-to-noise-ratio estimation",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="197-201",
MONTH=apr,
YEAR=2002,
REFERENCES=13,
ABSTRACT="Non-data-aided (NDA) signal-to-noise-ratio (SNR) estimation is
considered for binary phase shift keying systems where the data samples
are governed by a normal mixture distribution. Inherent estimation
accuracy limitations are examined via a simple, closed-form
approximation to the associated Cramer-Rao bound which eliminates the
need for numerical integration. The expectation-maximization algorithm
is proposed to iteratively maximize the NDA likelihood function.
Simulation results show that the resulting estimator offers statistical
efficiency over a wider range of scenarios than previously published
methods.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996844.pdf?isNumber=21514\&prod=CNF\&arnumber=996844\&arSt=197\&ared=201+vol.1\&arAuthor=Wiesel\%2C+A.\%3B+Goldberg\%2C+J.\%3B+Messer\%2C+H.",
}

@INPROCEEDINGS{Guil0204:Bit,
AUTHOR="F. Guilloud and E. Boutillon and J. L. Danger",
TITLE="Bit error rate calculation for a multiband non-coherent on-off
keying demodulation",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="202-206",
MONTH=apr,
YEAR=2002,
REFERENCES=7,
ABSTRACT="The purpose of this paper is to calculate the bit error rate
(BER) of a multiband non-coherent on-off keying (OOK) demodulation. The
results fit perfectly the simulations of the system. It allows us to
study the influence of the filter and the decimation factor on the
modulation performance. It is also possible to optimize the system by
means of other criteria (e.g. system complexity, jammer sensitivity),
thus avoiding time consuming simulations.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996845.pdf?isNumber=21514\&prod=CNF\&arnumber=996845\&arSt=202\&ared=206+vol.1\&arAuthor=Guilloud\%2C+F.\%3B+Boutillon\%2C+E.\%3B+Danger\%2C+J.L.",
}

@INPROCEEDINGS{Lee0204:Channel,
AUTHOR="Yumin Lee and Pinchieh Huang",
TITLE="Channel interpolation and {MMSE} multi-input multi-output
frequency-domain {DFE} for wireless data communications using {OFDM}",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="207-211",
MONTH=apr,
YEAR=2002,
REFERENCES=7,
ABSTRACT="The cyclic prefix (CP) is typically employed in conventional
orthogonal frequency division multiplex (OFDM) transmission systems. The
CP, however, consumes bandwidth and power, and is undesirable for
applications such as wireless communications. We propose an MMSE
multi-input multi-output frequency domain decision-feedback equalizer
(MIMO FDDFE). A novel channel interpolation algorithm is also proposed.
Simulation results show that, with the proposed algorithm, an OFDM
system without CP actually outperforms a conventional OFDM system with
CP in both bit error rate (BER) and bandwidth efficiency.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996846.pdf?isNumber=21514\&prod=CNF\&arnumber=996846\&arSt=207\&ared=211+vol.1\&arAuthor=Yumin+Lee\%3B+Pinchieh+Huang",
}

@INPROCEEDINGS{Mert0204:Redundant,
AUTHOR="A. Mertins",
TITLE="Design of redundant {FIR} precoders for arbitrary channel lengths
based on an {MMSE} criterion",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="212-216",
MONTH=apr,
YEAR=2002,
REFERENCES=12,
ABSTRACT="The joint design of transmitter and receiver for multichannel
data transmission over dispersive channels is considered. In particular,
the practically important case where the transmitter consists of FIR
filters and the channel impulse response has arbitrary length is
addressed. The design criterion is the minimization of the mean squared
error at the receiver output under the constraint of a fixed transmit
power. The proposed algorithm allows a straightforward transmitter
design and yields (in general) a near-optimal solution for the transmit
filters. Under certain conditions, the exact solution for the optimal
transmitter is obtained.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996847.pdf?isNumber=21514\&prod=CNF\&arnumber=996847\&arSt=212\&ared=216+vol.1\&arAuthor=Mertins\%2C+A.",
}

@INPROCEEDINGS{Vrce0204:Pre,
AUTHOR="Bojan Vrcelj and R. R. Vaidyanathan",
TITLE="Pre- and post-processing for optimal noise reduction in cyclic
prefix based channel equalizers",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="217-221",
MONTH=apr,
YEAR=2002,
REFERENCES=10,
ABSTRACT="Cyclic prefix based equalizers are widely used for high-speed
data transmission over frequency selective channels. Their use in
conjunction with DFT filterbanks is especially attractive, given the low
complexity of implementation. Some examples include the DFT-based DMT
systems. We consider a general cyclic prefix based system for
communication and show that the equalization performance can be improved
by simple pre- and post-processing aimed at reducing the noise at the
receiver. This processing is done independently of the ISI cancellation
performed by the frequency domain equalizer.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996848.pdf?isNumber=21514\&prod=CNF\&arnumber=996848\&arSt=217\&ared=221+vol.1\&arAuthor=Vrcelj\%2C+B.\%3B+Vaidyanathan\%2C+R.R.",
}

@INPROCEEDINGS{Fuji0204:Pseudo,
AUTHOR="Masaaki Fujii",
TITLE="Pseudo-orthogonal multibeam-time transmit diversity for
{OFDM-CDMA}",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="222-226",
MONTH=apr,
YEAR=2002,
REFERENCES=14,
ABSTRACT="This paper proposes using a quasi-orthogonal (QO) full-rate
space-time block code (STBC) and a fixed multibeam transmit array with
low sidelobes for orthogonal frequency-division multiplexing
code-division multiple access (OFDM-CDMA) downlink transmission. The
proposed beam-time transmit diversity orthogonalizes signals between
adjoining beams with a QO-STBC and suppresses unorthogonalized signals
between separated beams with beam forming. Simulation results
demonstrate that the proposed scheme retains orthogonality in narrow
angular spread environments and provides two-beam diversity combining
when a user is located between beams. In addition, the proposed scheme
can alleviate multiuser interference (MUI) by allocating several users
into different symbols in a QO-STBC matrix while assigning them all to
the same spreading code.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996849.pdf?isNumber=21514\&prod=CNF\&arnumber=996849\&arSt=222\&ared=226+vol.1\&arAuthor=Fujii\%2C+M.",
}

@INPROCEEDINGS{Li0204:Error,
AUTHOR="Zexian Li and Matti Latva-aho",
TITLE="Error probability for {MC-CDMA} in Nakagami-m fading channels
using equal gain combining",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="227-231",
MONTH=apr,
YEAR=2002,
REFERENCES=16,
ABSTRACT="In this paper, a new practical method for determining the
bit-error rate (BER) of equal gain combining (EGC) receivers for
multicarrier code-division multiple-access (MC-CDMA) systems is
presented. This new method is based on an alternative Gaussian
approximation (AGA) and it applies to the system with multiple active
users in frequency selective Nakagami-m fading channels. This new
procedure takes advantage of an alternate integral representation of the
conditional BER along with characteristic functions. The AGA method has
the advantage of simplicity in expression and computational efficiency.
The accuracy of the proposed approach is demonstrated with computer
simulations in a fading channel.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996850.pdf?isNumber=21514\&prod=CNF\&arnumber=996850\&arSt=227\&ared=231+vol.1\&arAuthor=Zexian+Li\%3B+Latva-aho\%2C+M.",
}

@INPROCEEDINGS{Rist0204:Jammer,
AUTHOR="Tapani Ristaniemi and K. Raju and J. Karhunen",
TITLE="Jammer mitigation in {DS-CDMA} array system using independent
component analysis",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="232-236",
MONTH=apr,
YEAR=2002,
REFERENCES=7,
ABSTRACT="In this paper we consider blind interference mitigation in
direct sequence spread spectrum communication system under intentional
jamming. Belouchrani et al. (2000) present a general framework in which
blind source separation (BSS) techniques are utilized to enhance
conventional detection. However, only second order statistics were
utilized which makes the scheme vulnerable to temporally uncorrelated
information or jamming signals. In this paper we remove this
disadvantage by utilizing BSS based on independent component analysis
(ICA). Numerical examples are given to evaluate achieved performance
gains.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996851.pdf?isNumber=21514\&prod=CNF\&arnumber=996851\&arSt=232\&ared=236+vol.1\&arAuthor=Ristaniemi\%2C+T.\%3B+Raju\%2C+K.\%3B+Karhunen\%2C+J.",
}

@INPROCEEDINGS{Mons0204:,
AUTHOR="P. Monsen",
TITLE="100 \% channel reuse in orthogonal multiple-access systems",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="237-241",
MONTH=apr,
YEAR=2002,
REFERENCES=11,
ABSTRACT="The uplink of a multicell synchronous multiple access system
is investigated. Users within a cell are separated by use of orthogonal
waveforms that generally remain orthogonal even in multipath conditions.
These waveforms are reused in adjacent antenna beam sectors or adjacent
cells to achieve a unity reuse factor. Interference protection is
achieved even when beam cross-attenuation is small through
error-correction coding and interleaving, modulation hopping,
equalization of other user interference, and use of a single axis
modulation such as binary phase-shift-keying. Reuse of channels in
adjacent cells serviced by different base stations is supported by a
macrodiversity technique in which signals from adjacent base stations
are transferred over fixed communication links for interference
processing at the desired user base station. Simulations at the same
throughput rate for fixed and fading environments establish the superior
performance of BPSK over conventional quadrature PSK with unity reuse.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996852.pdf?isNumber=21514\&prod=CNF\&arnumber=996852\&arSt=237\&ared=241+vol.1\&arAuthor=Monsen\%2C+P.",
}

@INPROCEEDINGS{Mirb0204:Blind,
AUTHOR="A. Mirbagheri and Young Yoon",
TITLE="A blind adaptive receiver for interference suppression and
multipath reception in long-code {DS-CDMA}",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="242-246",
MONTH=apr,
YEAR=2002,
REFERENCES=15,
ABSTRACT="This paper examines a blind adaptive implementation of a
recently proposed linear minimum mean square error (LMMSE) receiver for
code-division multiple-access (CDMA) systems with aperiodic spreading
sequences in multipath channels. The receiver has been previously shown
to perform multiple-access interference (MAI) suppression and multipath
diversity combining. The adaptive implementation is based on a
fractionally spaced equalizer (FSE) whose taps are updated by the leaky
constant modulus algorithm (LCMA) in the cold start and the
decision-directed least-mean-square (DD-LMS) algorithm when the channel
eye is opened. The LCMA adds a quadratic constraint, defined as the
squared norm of the FSE weight vector, to the constant modulus (CM) cost
function. Simulation results show that the LCMA with a uniform
initialization strategy (all taps equally set to a small non-zero value)
acquires all paths associated with the desired user, suppresses MAI, and
opens the channel eye for the DD-LMS algorithm to converge to the
proximity of the MMSE solution.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996853.pdf?isNumber=21514\&prod=CNF\&arnumber=996853\&arSt=242\&ared=246+vol.1\&arAuthor=Mirbagheri\%2C+A.\%3B+Yoon\%2C+Y.C.",
}

@INPROCEEDINGS{Yang0204:Constrained,
AUTHOR="Hayoung Yang and Daesik Hong and Changeon Kang and Branka
Vucetic",
TITLE="Constrained adaptive space-time diversity receivers for multiuser
{WCDMA} systems",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="247-251",
MONTH=apr,
YEAR=2002,
REFERENCES=8,
ABSTRACT="This paper concentrates on developing and analyzing advanced
space-time multiuser receivers for WCDMA forward link. Through exploring
the multiuser interference and utilizing the space-time diversity, an
optimum diversity receiver, called a constrained adaptive space-time
diversity combiner (C-ASTDC), is proposed. To mitigate the disadvantages
of the full-rank multiple antenna system, such as computational
complexity and increased difficulty to accurately tune the algorithm, a
reduced form of C-ASTDC is also proposed. This paper concentrates on
developing and analyzing advanced space-time multiuser receivers for
WCDMA forward link. Through exploring the multiuser interference and
utilizing the space-time diversity, an optimum diversity receiver,
called a constrained adaptive space-time diversity combiner (C-ASTDC),
is proposed. To mitigate the disadvantages of the full-rank multiple
antenna system, such as computational complexity and increased
difficulty to accurately tune the algorithm, a reduced form of C-ASTDC
is also proposed.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996854.pdf?isNumber=21514\&prod=CNF\&arnumber=996854\&arSt=247\&ared=251+vol.1\&arAuthor=Hayoung+Yang\%3B+Daesik+Hong\%3B+Changeon+Kang\%3B+Vucetic\%2C+B.",
}

@INPROCEEDINGS{Tsen0204:Fuzzy,
AUTHOR="Shu-Ming Tseng and Yibin Zheng and Yao-Teng Hsu and Meng-Chou
Chang",
TITLE="Fuzzy adaptive parallel interference cancellation and vector
channel prediction for {CDMA} in fading channels",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="252-256",
MONTH=apr,
YEAR=2002,
REFERENCES=6,
ABSTRACT="We propose a fuzzy PIC multiuser detection/vector channel
prediction scheme in Rayleigh fading channels. The vector channel
prediction is based on the first-order auto-regressive model and the
expectation-maximization algorithm. The signal-to-interference ratio and
signal-to-noise ratio are estimated from the vector channel model's
parameters, and we adapt the weight of each interference cancellation
path via fuzzy inference mechanism. The proposed fuzzy PIC and vector
channel prediction cooperate in a way that fuzzy PIC' some input
parameters come from the channel predictor and fuzzy PIC makes the
channel predictor more accurate at the next stage. Computing weights via
the fuzzy adaptive method adds insignificant complexity because it
involves only table lookup. The overall complexity is still linear in
the number of users. The simulation results show that the proposed fuzzy
PIC/vector channel prediction scheme performs better than previous
improved PIC schemes in Rayleigh fading channels.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996855.pdf?isNumber=21514\&prod=CNF\&arnumber=996855\&arSt=252\&ared=256+vol.1\&arAuthor=Shu-Ming+Tseng\%3B+Yibin+Zheng\%3B+Yao-Teng+Hsu\%3B+Meng-Chou+Chang",
}

@INPROCEEDINGS{Lao0204:Comparison,
AUTHOR="D. Lao and Alexander Haimovich",
TITLE="Performance comparison of multiple-symbol differential detection
and optimum combining",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="257-261",
MONTH=apr,
YEAR=2002,
REFERENCES=12,
ABSTRACT="The performance of multiple symbol differential detection
(MSDD) over Rayleigh diversity channels and in the presence of cochannel
interference is compared with that of optimum combining (OC). For this
purpose, we derive the asymptotic expressions for the approximate upper
bound of the bit error probability of MSDD for multiple phase shift
keying modulation. Similar asymptotic expressions are derived for OC.
These relatively simple expressions provide a clear insight into the
performance of MSDD and OC. Through analysis and simulation results, we
show that as the observation interval increases, the performance of MSDD
approaches that of OC (with differential encoding).",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996856.pdf?isNumber=21514\&prod=CNF\&arnumber=996856\&arSt=257\&ared=261+vol.1\&arAuthor=Lao\%2C+D.\%3B+Haimovich\%2C+A.M.",
}

@INPROCEEDINGS{Xu0204:Spatial,
AUTHOR="Hong Xu and M. Gans and D. Chizhik and Jing Ling and P. W.
Wolniansky and R. A. Valenzuela",
TITLE="Spatial and temporal variations of {MIMO} channels and impacts on
capacity",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="262-264",
MONTH=apr,
YEAR=2002,
REFERENCES=18,
ABSTRACT="This paper presents analysis for spatial and temporal
variations of multiple-input-multiple-output (MIMO) channels at the
mobile. The channel study is based on the narrowband measurements at
2.11 GHz in Manhattan, New York with 16 transmitting antennas and 16
receiving antennas. Doppler spread and angle of arrival (AOA) are
derived from the temporal correlation of field components. The results
show that the AOA at the mobile is not uniformly distributed. The
restricted AOA distribution results in approximately twice the
correlation distance and correlation time than the predicted values from
the Jakes (1974) model. The measured median coherence time is at least a
few seconds for stationary channels, and 90 ms at a mobile pedestrian
speed of 3 km/hr. These observations hold for both vertically and
horizontally polarized antennas. The measured median RMS angular spread
at the mobile is 22.5/spl deg/ for horizontally polarized antennas and
25.5/spl deg/ for vertically polarized antennas.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996857.pdf?isNumber=21514\&prod=CNF\&arnumber=996857\&arSt=262\&ared=266+vol.1\&arAuthor=Xu\%2C+H.\%3B+Gans\%2C+M.\%3B+Chizhik\%2C+D.\%3B+Ling\%2C+J.\%3B+Wolniansky\%2C+P.\%3B+Valenzuela\%2C+R.",
}

@INPROCEEDINGS{Badd0204:Accurate,
AUTHOR="K. E. Baddour and Norman C. Beaulieu",
TITLE="Accurate simulation of multiple cross-correlated fading
channels",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="267-271",
MONTH=apr,
YEAR=2002,
REFERENCES=21,
ABSTRACT="Vector autoregressive stochastic models are proposed for the
synthesis of multiple Rayleigh fading processes with specified
autocorrelation and cross-correlation functions. This capability is
desirable, for example, to permit realistic performance assessments of
space-time modem designs by enabling the simulation of
space-time-selective mobile radio channel models. The utility of the
simulation approach is demonstrated by the accurate generation of some
bandlimited vector Rayleigh processes.",
URL="VectorautoregressivestochasticmodelsareproposedforthesynthesisofmultipleRayleighfadingprocesseswithspecifiedautocorrelationandcross-correlationfunctions.Thiscapabilityisdesirable,forexample,topermitrealisticperformanceassessmentsofspace-timemodemdesignsby",
}

@INPROCEEDINGS{Soma0204:Modeling,
AUTHOR="P. Soma and D. Baum and Vinko Erceg and Rajeev Krishnamoorthy
and Arogyaswami Paulraj",
TITLE="Analysis and modeling of multiple-input multiple-output {(MIMO)}
radio channel based on outdoor measurements conducted at 2.5 {GHz} for
fixed {BWA} applications",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="272-276",
MONTH=apr,
YEAR=2002,
REFERENCES=9,
ABSTRACT="This paper summarizes our 2/spl times/2 multiple-input
multiple-output (MIMO) fixed wireless outdoor propagation measurements
at 2.48 GHz conducted in the suburban residential areas of San Jose,
California. We report on various channel characteristics such as path
loss, Ricean K-factor, cross-polarization-discrimination (XPD) and
channel capacity. We present simple models for these characteristics,
focusing on excess loss dependency and, derived from that, the variation
with distance. Also, we introduce an idea for a generalized MIMO channel
model based on these modeled channel characteristics and the correlation
properties between them. Path loss results show that blockage due to
buildings or foliage causes an excess loss of 35.45 dB compared to free
space propagation at a distance of 1 km. The narrowband K-factor
distribution matches previously reported results. The XPD of the total
received signal varies from -10 to 15 dB at various locations. The
K-factor and XPD were found to be very much dependent on excess loss due
to blockage conditions at various distances.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996859.pdf?isNumber=21514\&prod=CNF\&arnumber=996859\&arSt=272\&ared=276+vol.1\&arAuthor=Soma\%2C+P.\%3B+Baum\%2C+D.S.\%3B+Erceg\%2C+V.\%3B+Krishnamoorthy\%2C+R.\%3B+Paulraj\%2C+A.J.",
}

@INPROCEEDINGS{Moli0204:Generic,
AUTHOR="Andreas Molisch",
TITLE="A generic model for {MIMO} wireless propagation channels",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="277-282",
MONTH=apr,
YEAR=2002,
REFERENCES=17,
ABSTRACT="We study the MIMO wireless channel, and derive a generic
channel model that we believe has the ability to explain all important
effects, including (i) interdependency of directions-of-arrival and
directions-of-departure, (ii) large delay and angle dispersion by
propagation via far clusters, (iii) rank reduction of the transfer
function matrix. We point out the relevant propagation effects, and
propose a geometry-based model that includes the relevant effects. The
required parameters for the complete definition of the model are
enumerated, and typical simulation results for urban macrocells are
presented.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996860.pdf?isNumber=21514\&prod=CNF\&arnumber=996860\&arSt=277\&ared=282+vol.1\&arAuthor=Molisch\%2C+A.F.",
}

@INPROCEEDINGS{Imre0204:Multi,
AUTHOR="Sándor Imre and F. Balazs",
TITLE="Non-coherent multi-user detection based on quantum search",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="283-287",
MONTH=apr,
YEAR=2002,
REFERENCES=17,
KEYWORDS="multi-user detection; grover's algorithme; quantum computing;
quantum signal processing",
ABSTRACT="3G and 4G mobile systems are based on CDMA technology. In
order to increase the efficiency of CDMA receivers a large amount of
effort is invested to develop suitable multi-user detector techniques.
However, at this moment there are only suboptimal solutions available
because of the rather high complexity of optimal detectors. One of the
possible receiver technologies can be the quantum assisted computing
devices which allows high level parallelism in computation. The first
commercial devices are estimated by 2004, which meets the advent of 3G
and 4G systems. We introduce a novel quantum computation based quantum
multi-user detection (QMUD), employing Grover's (see Bell Labs, April
1999)search algorithm, which provides optimal solution. The proposed
algorithm is robust to any kind of noise/suboptimal solutions.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996861.pdf?isNumber=21514\&prod=CNF\&arnumber=996861\&arSt=283\&ared=287+vol.1\&arAuthor=Imre\%2C+S.\%3B+Balazs\%2C+F.",
}

@INPROCEEDINGS{Hwan0204:Multistage,
AUTHOR="Chien-Hwa Hwang and Chang-Su Kim and Chih-Hung Kuo",
TITLE="Analysis of multistage linear parallel interference cancellation
in {CDMA} systems using graphical representation",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="288-292",
MONTH=apr,
YEAR=2002,
REFERENCES=10,
ABSTRACT="The bit error probability of the multistage linear parallel
interference canceller in a long-code code division multiple access
(CDMA) system is analyzed with a graphic approach in this research. The
decision statistic is modelled as a Gaussian random variable, whose mean
and variance can be expressed as functions of moments of (R-I), where R
is the correlation matrix of the signature sequences. Since the
complexity of calculating these moments increases rapidly with the
growth of the stage index, a graphical representation of moments is
developed to facilitate the computation. Propositions are presented to
relate the moment calculation problem to several well known problems in
graph theory, i.e., the coloring, the graph decomposition, the
biconnected component, and the Euler tour problems. It is shown that the
analytic results of the bit error probability match well with simulation
results.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996862.pdf?isNumber=21514\&prod=CNF\&arnumber=996862\&arSt=288\&ared=292+vol.1\&arAuthor=Chien-Hwa+Hwang\%3B+Chang-Su+Kim\%3B+Kuo\%2C+C.-C.J.",
}

@INPROCEEDINGS{Li0204:Group,
AUTHOR="Junqiang Li and Khaled Ben Letaief and Zhigang Cao",
TITLE="A group oriented soft iterative multiuser detection for coded
multi-carrier {CDMA} systems",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="293-297",
MONTH=apr,
YEAR=2002,
REFERENCES=14,
ABSTRACT="The system capacity and performance of MC-CDMA communication
systems can be significantly enhanced by jointly employing MAP-based
multiuser detection (MUD) and channel decoding techniques. In this
paper, a group oriented soft iterative MUD based on the combination of
smart antennas and iterative MAP-based MUD is presented. The proposed
method is featured as a novel technique for further increasing the
system capacity and performance. It is demonstrated that the performance
of the proposed algorithm with low complexity can approach that of a
signal user coded MC-CDMA system with an antenna array in AWGN and
frequency selective fading channels.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996863.pdf?isNumber=21514\&prod=CNF\&arnumber=996863\&arSt=293\&ared=297+vol.1\&arAuthor=Junqiang+Li\%3B+Letaief\%2C+K.B.\%3B+Zhigang+Cao",
}

@INPROCEEDINGS{Nord0204:Low,
AUTHOR="Alessandro Nordio and M. C. Hernandez and Giuseppe Caire",
TITLE="Design and performance of a low-complexity iterative multiuser
joint decoder based on Viterbi decoding and parallel interference
cancellation",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="298-302",
MONTH=apr,
YEAR=2002,
REFERENCES=13,
ABSTRACT="We propose a low-complexity multiuser joint parallel
interference cancellation (PIC) decoder for direct-sequence CDMA. An
estimate of the multiple-access interference (MAI) signal is formed by
weighting the hard decisions produced by hard-output Viterbi decoders.
Such MAI interference estimate is subtracted from the received signal in
order to improve decoding in the next iteration. By using asymptotic
performance analysis of random-spreading CDMA, we optimize the feedback
weights at each iteration. Then, we consider two performance limitation
factors: the bias of residual interference and the ping-pong effect. We
propose then a modification of the basic PIC algorithm, which allows
higher channel load and/or faster convergence to the single-user
performance. The main conclusion of this work is that, in most practical
cases, SISO decoders are not needed to attain very high spectral
efficiency, and simple conventional Viterbi decoding suffices for most
practical settings.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996864.pdf?isNumber=21514\&prod=CNF\&arnumber=996864\&arSt=298\&ared=302+vol.1\&arAuthor=Nordio\%2C+A.\%3B+Hernandez\%2C+M.\%3B+Caire\%2C+G.",
}

@INPROCEEDINGS{Zhu0204:Adaptive,
AUTHOR="Hao Zhu and Guohong Cao and George Kesidis and Chita Das",
TITLE="An adaptive power-conserving service discipline for Bluetooth An
adaptive power-conserving service discipline for Bluetooth",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="303-307",
MONTH=apr,
YEAR=2002,
REFERENCES=9,
ABSTRACT="Bluetooth is a new short-range radio technology to form a
small wireless system. In most of the current Bluetooth products, the
master polls the slaves in a round robin manner and it may waste a
significant amount of power. We propose an adaptive power conserving
scheme to address this problem. The proposed solution schedules each
flow based on its predictive rate and achieves power optimization based
on a low-power mode existing in Bluetooth standard. Unlike other
research work related to low-power, we also consider QoS of each flow.
Theoretical analyses verify that our scheme can achieve throughput
guarantees, delay guarantees, and fairness guarantees. Simulation
results demonstrate that our scheme can save a significant amount of
power compared to the round robin scheme and it shows that there exists
a tradeoff between power and delay under various traffic models.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996865.pdf?isNumber=21514\&prod=CNF\&arnumber=996865\&arSt=303\&ared=307+vol.1\&arAuthor=Hao+Zhu\%3B+Guohong+Cao\%3B+Kesidis\%2C+G.\%3B+Das\%2C+C.",
}

@INPROCEEDINGS{Chui0204:Novel,
AUTHOR="T. Y. Chui and F. Thaler and W. G. Scanlon",
TITLE="A novel channel modeling technique for performance analysis of
Bluetooth baseband packets",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="308-312",
MONTH=apr,
YEAR=2002,
REFERENCES=10,
ABSTRACT="Short-range wireless links are susceptible to high bit error
rate (BER) conditions due to physical layer impairments such as human
body obstruction, multipath fading and clutter. The resulting network
performance will depend on physical layer aspects such as the degree of
forward error correction and packet size. This paper introduces a new
novel discrete event simulation technique to model the performance of a
Bluetooth piconet under variable loading and BER conditions. Critical
points for proper packet types selection in Bluetooth were identified.
The throughput and packet delay statistics were also simulated for a
2-slave Bluetooth piconet. Results show that, when the BER changes from
10/sup -6/ to 10/sup -4/, the one-way delay for 5-slot unprotected
packet type increases dramatically, in this case from 53 ms to 373 ms
for 90\% of packets transmitted. However, the delay of 5-slot protected
packet types remain constant for the same range of BER conditions (90\%
of packets with a delay of 77 ms or less).",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996866.pdf?isNumber=21514\&prod=CNF\&arnumber=996866\&arSt=308\&ared=312+vol.1\&arAuthor=Chui\%2C+T.Y.\%3B+Thaler\%2C+F.\%3B+Scanlon\%2C+W.G.",
}

@INPROCEEDINGS{Mazz0204:Packet,
AUTHOR="Franco Mazzenga and Dajana Cassioli and Pierpaolo Loreti and
Francesco Vatalaro",
TITLE="Evaluation of packet loss probability in Bluetooth networks",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="313-317",
MONTH=apr,
YEAR=2002,
REFERENCES=7,
ABSTRACT="We provide a closed-form expression for the packet loss
probability in Bluetooth networks accounting for capture effects due to
propagation losses. The effectiveness of the proposed approach is
assessed comparing the analytical results with those obtained from Monte
Carlo simulations. By considering different scenarios, we show the
dependence of results on the geometry and on the characteristics of the
environment. It is observed that packet loss probability can
significantly change with the position of the reference receiver in the
area, as well as with the extension of the served area as compared with
the coverage area of the receiver.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996867.pdf?isNumber=21514\&prod=CNF\&arnumber=996867\&arSt=313\&ared=317+vol.1\&arAuthor=Mazzenga\%2C+F.\%3B+Cassioli\%2C+D.\%3B+Loreti\%2C+P.\%3B+Vatalaro\%2C+F.",
}

@INPROCEEDINGS{Joha0204:Rendezvous,
AUTHOR="Per Johansson and Rohit Kapoor and A. Kazantzidis and Mario
Gerla",
TITLE="Rendezvous scheduling in Bluetooth scatternets",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="318-324",
MONTH=apr,
YEAR=2002,
REFERENCES=11,
ABSTRACT={Bluetooth scatternets are formed by interconnecting Bluetooth
piconets in an ad-hoc fashion and consists typically of the handheld
electronic devices from one or more user(s). Thus, scatternets may be
used to form and interconnect ad-hoc Bluetooth personal area networks
(PANs). The inter-piconet Bluetooth units, i.e. the gateways
interconnecting the piconets in a scatternet, need to time division
multiplex their presence in each of their piconets. This requires an
inter-piconet scheduling (IPS) algorithm, operating in each
inter-piconet unit in order to efficiently coordinate its presence with
other Bluetooth units. In this paper an IPS algorithm based on periodic
rendezvous points is proposed and analyzed with simulations, The
algorithm is called maximum distance rendezvous point (MDRP) and
utilizes the Bluetooth SNIFF functionality to establish the periodic
rendezvous points between gateways and their peer nodes. Simulation
results show that TCP works well with MDRP, but the large round trip
delays caused by the inter-piconet gateway nodes give a slowly growing
flow control window for TCP. The latter will in particular have an
impact on the TCP performance in scatternets hosting "thin" (embedded)
clients with limited dynamic memory capacity.},
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996868.pdf?isNumber=21514\&prod=CNF\&arnumber=996868\&arSt=318\&ared=324+vol.1\&arAuthor=Johansson\%2C+P.\%3B+Kapoor\%2C+R.\%3B+Kazantzidis\%2C+A.\%3B+Gerla\%2C+M.",
}

@INPROCEEDINGS{Sun0204:Training,
AUTHOR="Qinfang Sun and Donald Cox and Angel Lozano and H. Huang",
TITLE="Training-based channel estimation for continuous flat fading
{BLAST}",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="325-329",
MONTH=apr,
YEAR=2002,
REFERENCES=12,
KEYWORDS="blast; channel estimation; training; fading; interpolation;
sub-optimal detection",
ABSTRACT="The Bell Labs layered space-time (BLAST) architecture provides
high capacity wireless communications in rich scattering environments.
Training sequences are transmitted periodically to estimate the channel.
We compare the performance without channel tracking to the performance
with interpolation-based channel tracking. The optimal training
interval, training length and the maximum throughput are found through
computer simulations for both schemes as functions of the Doppler
frequency and the number of antennas. We show that the throughput is
significantly improved with channel tracking for fast continuous fading
channels. However channel tracking increases the computation complexity
for data detection. A sub-optimal detection algorithm with lower
complexity is proposed and investigated.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996869.pdf?isNumber=21514\&prod=CNF\&arnumber=996869\&arSt=325\&ared=329+vol.1\&arAuthor=Qinfang+Sun\%3B+Cox\%2C+D.C.\%3B+Lozano\%2C+A.\%3B+Huang\%2C+H.C.",
}

@INPROCEEDINGS{Zhu0204:Layered,
AUTHOR="Xu Zhu and Ross Murch",
TITLE="Layered space-time equalization of multiple-input multiple-output
frequency selective channels",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="330-334",
MONTH=apr,
YEAR=2002,
REFERENCES=10,
ABSTRACT="We propose a layered space-time equalization (LSTE)
architecture for multiple-input multiple-output (MIMO) frequency
selective channels, based on the MIMO delayed decision feedback sequence
estimation (MIMO-DDFSE) scheme. At each stage of detection, the
MIMO-DDFSE is employed to tentatively detect a group of selected signal
streams, and among them a sub-group of the best signal streams in the
MMSE sense are output and are cancelled from the received signals. It is
shown that this structure outperforms the previously developed LSTE
structure based on the multiple-input single-output decision feedback
equalization (MISO-DFE) scheme.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996870.pdf?isNumber=21514\&prod=CNF\&arnumber=996870\&arSt=330\&ared=334+vol.1\&arAuthor=Xu+Zhu\%3B+Murch\%2C+R.D.",
}

@INPROCEEDINGS{Zha0204:Modified,
AUTHOR="Wei Zha and S. D. Blostein",
TITLE="Modified decorrelating decision-feedback detection of {BLAST}
space-time system",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="335-339",
MONTH=apr,
YEAR=2002,
REFERENCES=10,
ABSTRACT="We propose a stable and reduced-complexity detection method
for the Bell Labs layered space-time (BLAST) coding system. The existing
iterative nulling and cancellation algorithm for BLAST has high
computational complexity and requires repeated matrix pseudo-inverse
calculation which may lead to numerical instability. A square-root
algorithm was proposed by other researchers to reduce complexity and
improve numerical stability. In this paper, to further reduce
complexity, we modify the decorrelating decision-feedback CDMA multiuser
detection method and apply it to BLAST. Similar to the square-root
algorithm, numerical stable unitary transformations are performed on the
Cholesky-decomposed matrices to reorder the detection and cancellation
steps. However, our method exploits a symmetry property in the
triangularization process, which may further improve the numerical
stability and reduce computational complexity over that of the
square-root algorithm. In the simulation results, the impact of the
reordering on performance is demonstrated.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996871.pdf?isNumber=21514\&prod=CNF\&arnumber=996871\&arSt=335\&ared=339+vol.1\&arAuthor=Wei+Zha\%3B+Blostein\%2C+S.D.",
}

@INPROCEEDINGS{Li0204:Parallel,
AUTHOR="Yuan Li and Zhi-Quan Luo",
TITLE="Parallel detection for {V-BLAST} system",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="340-344",
MONTH=apr,
YEAR=2002,
REFERENCES=2,
ABSTRACT="Previous studies unveiled that huge channel capacity can be
achieved by employing multi-element antenna arrays at both transmitter
and receiver. Foschini et.al. proposed a vertical Bell Laboratories
layered space-time (V-BLAST) system with a detection algorithm based on
decision feedback. This system is computationally efficient and yet
supporting a high data rate. However, the detection algorithm shows
unsatisfactory performance when an equal number of antennas are employed
at both ends. In this paper, a parallel detection algorithm is proposed
to improve the performance in such scenarios. The detector consists of
many low complexity sub-detectors, all of them operating in parallel on
a sub-channel matrix. By selecting the submatrix appropriately the
overall performance can be improved substantially.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996872.pdf?isNumber=21514\&prod=CNF\&arnumber=996872\&arSt=340\&ared=344+vol.1\&arAuthor=Yuan+Li\%3B+Zhi-Quan+Luo",
}

@INPROCEEDINGS{Jans0204:Power,
AUTHOR="G. J. M. Janssen and Jens Zander",
TITLE="Power control and stepwise removal algorithms for a narrowband
multiuser detector in a cellular system",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="345-350",
MONTH=apr,
YEAR=2002,
REFERENCES=10,
KEYWORDS="multiuser detection; cellular radio system; transmitter power
control; capacity",
ABSTRACT="With a narrowband multiuser detector (MUD), multiple users can
simultaneously share the same channel without using a bandwidth
expanding signature code when sufficient power differences at the
receiver are maintained. In this paper, we estimate the capacity that
can be achieved in a hypothetical cellular system with centralized power
control, using a narrowband MUD based on successive cancellation. The
power control algorithm is adapted to multiple users per channel in a
cell. Capacity results from simulations based on user removal are
presented for three removal algorithms. It is shown that the narrowband
MUD has a significant potential for capacity gain due to a tighter
packing of users in a channel.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996873.pdf?isNumber=21514\&prod=CNF\&arnumber=996873\&arSt=345\&ared=350+vol.1\&arAuthor=Janssen\%2C+G.J.M.\%3B+Zander\%2C+J.",
}

@INPROCEEDINGS{Berg0204:Power,
AUTHOR="Fredrik Berggren and S. B. Slimane",
TITLE="Power allocation for a simple successive interference
cancellation scheme in a multi-rate {DS-CDMA} system",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="351-355",
MONTH=apr,
YEAR=2002,
REFERENCES=11,
ABSTRACT="We investigate a multi-rate receiver utilizing soft feedback
successive interference cancellation. To be able to meet the QoS
requirements for each user, the multiuser detection is done in
conjunction with power control. For this, we introduce a power control
scheme that takes into account the respective QoS requirements and the
impact of imperfect interference cancellation. We derive the minimum
power solution, from which distributed iterative power control
algorithms are suggested. It is found that the rate of convergence of
the power control can be accelerated if the cancellation efficiency
parameter can be directly incorporated into the power update. We also
address the capacity resulting from this receiver in terms of the notion
of effective bandwidth.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996874.pdf?isNumber=21514\&prod=CNF\&arnumber=996874\&arSt=351\&ared=355+vol.1\&arAuthor=Berggren\%2C+F.\%3B+Ben+Slimane\%2C+S.",
}

@INPROCEEDINGS{Agra0204:Power,
AUTHOR="Avneesh Agrawal and Jeffrey Andrews and John Cioffi and Teresa
Meng",
TITLE="Power control for successive interference cancellation with
imperfect cancellation",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="356-360",
MONTH=apr,
YEAR=2002,
LANGUAGE="English",
REFERENCES=15,
ABSTRACT="This paper proposes and analyzes an iterative power control
scheme for use with successive interference cancellation (SIC) in the
presence of cancellation errors. SIC is shown by Andrews and Meng (see
IEEE Transactions On Wireless Communications, Oct. 2001), to increase
the capacity of cellular CDMA systems significantly, even if the signal
cancellation is imperfect due to estimation errors. However, an
important complication of SIC relative to conventional CDMA receivers is
that a specific non-uniform distribution of powers must be assigned to
the users in order for the system to function robustly. This paper
proposes a simple up/down distributed iterative power control scheme for
DS-CDMA systems employing SIC. We analyze its feasibility region and
prove that it converges to close to the optimum solution even in the
presence of estimation errors. The total received power is shown to be a
reliable metric for admission control. This analysis considers both
multi-rate CDMA where each user has a different target
signal-to-interference-and-noise ratio (SINR), and asynchronous power
control where user power updates occur asynchronously.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996875.pdf?isNumber=21514\&prod=CNF\&arnumber=996875\&arSt=356\&ared=360+vol.1\&arAuthor=Agrawal\%2C+A.\%3B+Andrews\%2C+J.\%3B+Cioffi\%2C+J.\%3B+Meng\%2C+T.",
}

@INPROCEEDINGS{Zhao0204:Adaptive,
AUTHOR="Qing Zhao and D. K. Borah",
TITLE="Adaptive iterative {CDMA} multiuser detection in unknown
multipath channels",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="361-365",
MONTH=apr,
YEAR=2002,
REFERENCES=8,
ABSTRACT="This paper presents an adaptive iterative (turbo) receiver for
coded asynchronous CDMA systems. This receiver consists of a soft-input
soft-output (SISO) multiuser detector, which is implemented in the
weighted least squares (WLS) sense with the BCJR algorithm, and a bank
of SISO channel decoders. All parameters needed for the receiver are
estimated or adaptively obtained. Simulation results show that in a
multicellular environment the proposed adaptive turbo receiver
outperforms the matched filtered turbo receiver in terms of bit error
rate (BER) performance. It is observed that the turbo principle allows
significant reduction in training overhead. As the SNR increases, the
adaptive receiver's BER performance is found to approach the optimal WLS
receiver's performance.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996876.pdf?isNumber=21514\&prod=CNF\&arnumber=996876\&arSt=361\&ared=365+vol.1\&arAuthor=Qing+Zhao\%3B+Borah\%2C+D.K.",
}

@INPROCEEDINGS{Mukh0204:Resource,
AUTHOR="Sarit Mukherjee and Harish Viswanathan",
TITLE="Resource allocation strategies for linear symmetric wireless
networks with relays",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="366-370",
MONTH=apr,
YEAR=2002,
REFERENCES=7,
ABSTRACT="We study optimal time-allocation strategies for a cellular
architecture with relays that can store and forward information from the
base station to the terminals on the downlink and from the terminals to
the base station on the uplink and determine the consequent capacity
gains. We focus on the case when the cellular structure is
one-dimensional and evaluate the sensitivity of the capacity gains to
key system parameters such as relay power, self-noise, relay location
and terminal locations. We show that the optimal time allocation problem
on both uplink and downlink with the objective of maximizing the maximum
common throughput of all the users in the cell, can be formulated as a
linear program. We derive several analytical conditions that any optimal
allocation must satisfy yielding simpler linear programs. We also
present a sub-optimal allocation algorithm that does not require the
solution of a linear program.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996877.pdf?isNumber=21514\&prod=CNF\&arnumber=996877\&arSt=366\&ared=370+vol.1\&arAuthor=Mukherjee\%2C+S.\%3B+Viswanathan\%2C+H.",
}

@INPROCEEDINGS{Chun0204:Resource,
AUTHOR="Young-uk Chung and Dong-Ho Cho",
TITLE="A resource allocation algorithm using frequency borrowing in
hierarchical {CDMA} cellular systems",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="371-375",
MONTH=apr,
YEAR=2002,
REFERENCES=6,
ABSTRACT="The great increase of the number of users requires efficient
management of the spectrum. In hierarchical cellular systems based on
CDMA, the frequency borrowing resource allocation (FBRA) algorithm is
proposed to allocate frequency spectrum more efficiently. This algorithm
lends frequency spectrum of macrocell to microcells when mass hot spot
occurred. We analyze the interference to signal ratio and reverse link
capacity in case of using the proposed algorithm. Based on the result,
the algorithm performance is evaluated in view of blocking, the handoff
refused probability, and the spectrum efficiency. The numerical result
shows that the proposed algorithm can increase the capacity and solve
the mass hot spot problem.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996878.pdf?isNumber=21514\&prod=CNF\&arnumber=996878\&arSt=371\&ared=375+vol.1\&arAuthor=Young-uk+Chung\%3B+Dong-Ho+Cho",
}

@INPROCEEDINGS{Qiu0204:Results,
AUTHOR="Xiaoxin Qiu and Li Fung Chang and Zoran Kostic and T. E. Clifton
I. I. I and Neelesh Mehta and L. J. Greenstein and Kapil Chawla and J.
Whitehead",
TITLE="Some performance results for the downlink shared channel in
{WCDMA}",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="376-380",
MONTH=apr,
YEAR=2002,
REFERENCES=10,
ABSTRACT="We study the data performance of WCDMA systems using the
downlink shared channel (DSCH) by investigating the impact of loading,
rate adaptation and power control for the typical urban (TU) channel. We
conclude that, using DSCH, high speed data transmissions can be achieved
if the offered traffic load is well controlled. We discuss a heuristic
rate adaptation algorithm that adapts the transmission rate based upon
the perceived user performance in previous frames. We show that the
performance of the rate adaptation is significantly better than that for
the fixed-rate allocation policy.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996879.pdf?isNumber=21514\&prod=CNF\&arnumber=996879\&arSt=376\&ared=380+vol.1\&arAuthor=Qiu\%2C+X.\%3B+Chang\%2C+L.\%3B+Kostic\%2C+Z.\%3B+Willis\%2C+T.M.\%2C+III\%3B+Mehta\%2C+N.\%3B+Greenstein\%2C+L.J.\%3B+Chawla\%2C+K.",
}

@INPROCEEDINGS{Kim0204:Scheduling,
AUTHOR="Meejoung Kim and Chung Gu Kang and In-Chan Choi and R. R. Rao",
TITLE="Scheduling scheme of packet length-based group-wise transmission
for integrated voice/data service in burst-switching {DS/CDMA} system",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="381-385",
MONTH=apr,
YEAR=2002,
REFERENCES=10,
ABSTRACT="This paper proposes a new packet rate scheduling scheme for a
non-real time data service over the uplink of a burst switching-based
direct sequence code division multiple access (DS/CDMA) system to
support the integrated voice/data service. We consider the most general
form of optimization problem formulation to determine the optimal number
of transmission-time groups along with their data rates, which minimize
the average packet transmission delay. An ordered packet length-based
group-wise transmission (OLGT) scheme is proposed as a simple heuristic
solution approach to this problem and present some analytical results
for performance comparison with other possible schemes.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996880.pdf?isNumber=21514\&prod=CNF\&arnumber=996880\&arSt=381\&ared=385+vol.1\&arAuthor=Meejoung+Kim\%3B+Chung+Gu+Kang\%3B+In-Chan+Choi\%3B+Rao\%2C+R.R.",
}

@INPROCEEDINGS{Blum0204:Optimum,
AUTHOR="R. S. Blum and Jack H. Winters",
TITLE="On optimum {MIMO} with antenna selection",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="386-390",
MONTH=apr,
YEAR=2002,
REFERENCES=9,
ABSTRACT="Wireless communication systems with transmit and receive
antenna arrays are studied when antenna selection is used. A case with
very limited feedback of information from the receiver to the
transmitter is considered, where the only information fed back is the
selected subset of transmit antennas to be employed. It is shown that
the optimum signaling, for the largest ergodic capacity of a single
isolated link with given interference and antenna selection, is
generally different from that which is optimum without antenna selection
for some range of signal-to-noise ratios (SNRs). In cases with
interference, the improvement obtained from using the true optimum
signaling approach tends to increase for this range of SNRs. Further,
the optimum approach for cases without antenna selection tends to be
optimum in fewer cases as interference power is increased.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996881.pdf?isNumber=21514\&prod=CNF\&arnumber=996881\&arSt=386\&ared=390+vol.1\&arAuthor=Blum\%2C+R.S.\%3B+Winters\%2C+J.H.",
}

@INPROCEEDINGS{Kang0204:MIMO,
AUTHOR="Ming Kang and Mohamed-Slim Alouini",
TITLE="Performance analysis of {MIMO} systems with cochannel
interference over Rayleigh fading channels",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="391-395",
MONTH=apr,
YEAR=2002,
REFERENCES=12,
ABSTRACT="Relying on the Khatri distribution of the largest eigenvalue
of certain quadratic forms in complex Gaussian vectors, we develop an
analytical framework for the performance analysis of
multiple-input-multiple output (MIMO) systems subject to cochannel
interference and operating over Rayleigh fading channels. We consider
interference limited systems in which the number of interferers exceeds
or is equal to the number of receiving antenna elements and we present
new closed-form expressions for the probability density function of the
output signal-to-interference ratio and for the MIMO system outage
probability. When applicable, these expressions are compared to the
special case which dealt with the performance of
single-input-multiple-output (SIMO) systems (see Shah, A. and Haimovich,
A.M., IEEE Transactions Communication, vol.46, p.473-9, 1998). These
analytical results are validated by Monte-Carlo simulations and as an
illustration of the mathematical formalism some numerical examples for
particular cases of interest are plotted and discussed. The results show
that, given a fixed number of total antenna elements and cochannel
interferers, (i) SIMO systems always outperform
multiple-input-single-output systems and (ii) it is preferable to
distribute the number of antenna elements evenly between the transmitter
and the receiver for optimum performance.",
URL="http://ieeexplore.ieee.org/iel5/7828/21514/00996882.pdf?isNumber=21514\&prod=CNF\&arnumber=996882\&arSt=391\&ared=395+vol.1\&arAuthor=Kang\%2C+M.\%3B+Alouini\%2C+M.-S.",
}

@INPROCEEDINGS{Erce0204:Capacity,
AUTHOR="Vinko Erceg and P. Soma and D. Baum and Arogyaswami Paulraj",
TITLE="Capacity obtained from multiple-input multiple-output channel
measurements in fixed wireless environments at 2.5 {GHz}",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="396-400",
MONTH=apr,
YEAR=2002,
REFERENCES=10,
ABSTRACT="We present capacity, envelope correlation coefficient, and
condition number statistics obtained from 2/spl times/2 multiple-input
multiple-output (MIMO) fixed wireless radio channel measurements using
dual-polarized antennas. To calculate the capacity, we assume that the
transmitter has no knowledge about the channel. The experimental
capacity results are compared to the information-theoretic channel
capacity obtained from Monte Carlo simulations. Both theoretical results
and experimental results show that depending on the temporal K-factor,
rank of the constant matrix, envelope correlation coefficients of the
variable matrix, and cross-polarization discrimination, the capacity can
assume range of values for a given average SNR. The envelope correlation
coefficients were found to be less than 0.42 for the 90\% of cases. The
condition numbers were found to be less than 10 for the majority of
cases.",
URL="http://ieeexplore.ieee.org/iel5/7828/21514/00996883.pdf?isNumber=21514\&prod=CNF\&arnumber=996883\&arSt=396\&ared=400+vol.1\&arAuthor=Erceg\%2C+V.\%3B+Soma\%2C+P.\%3B+Baum\%2C+D.S.\%3B+Paulraj\%2C+A.J.",
}

@INPROCEEDINGS{Medl0204:Linear,
AUTHOR="Abdelkader Medles and Dirk Slock",
TITLE="Linear precoding for spatial multiplexing {MIMO} systems: blind
channel estimation aspects",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="401-405",
MONTH=apr,
YEAR=2002,
REFERENCES=8,
ABSTRACT="For the case of white uncorrelated inputs, most of the blind
multichannel identification techniques are not very robust and only
allow one to estimate the channel up to a number of ambiguities,
especially in the MIMO case. On the other hand, all current standardized
communication systems employ some form of known inputs to allow channel
estimation. The channel estimation performance in those cases can be
optimized by a semiblind approach which exploits both training and blind
information. When the inputs are colored and have sufficiently different
spectra, the MIMO channel may become blindly identifiable up to one
constant phase factor per input, and this under looser conditions on the
channel. For the case of spatial multiplexing, possible cooperation
between the channel inputs allows for more complex MIMO source
prefiltering that may allow blind MIMO channel identification up to just
one global constant phase factor. We introduce semiblind criteria that
are motivated by the Gaussian ML approach. They combine a training based
weighted least-squares criterion with a blind criterion based on linear
prediction. A variety of blind criteria are considered for the various
cases of source coloring.",
URL="http://ieeexplore.ieee.org/iel5/7828/21514/00996884.pdf?isNumber=21514\&prod=CNF\&arnumber=996884\&arSt=401\&ared=405+vol.1\&arAuthor=Medles\%2C+A.\%3B+Slock\%2C+D.T.M.",
}

@INPROCEEDINGS{Smit0204:Gaussian,
AUTHOR="Philip Smith and Mansoor Shafi",
TITLE="On a {Gaussian} approximation to the capacity of wireless {MIMO}
systems",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="406-410",
MONTH=apr,
YEAR=2002,
REFERENCES=7,
ABSTRACT="We consider the capacity of a single user t /spl rarr/ /spl
tau/ MIMO wireless system in a Rayleigh or Ricean fading environment. It
is known that a certain central limit theorem exists which states (under
certain conditions) that the distribution of the standardized capacity
is asymptotically Gaussian as r /spl rarr/ /spl infin/, t /spl rarr/
/spl infin/ and /spl tau//t /spl rarr/ y for some constant y. However we
demonstrate the surprising accuracy of a Gaussian approximation to the
capacity for virtually all values of /spl tau/ and t. In order to
investigate the accuracy of the Gaussian fit we derive the variance of
the capacity in the Rayleigh fading case.",
URL="http://ieeexplore.ieee.org/iel5/7828/21514/00996885.pdf?isNumber=21514\&prod=CNF\&arnumber=996885\&arSt=406\&ared=410+vol.1\&arAuthor=Smith\%2C+P.J.\%3B+Shafi\%2C+M.",
}

@INPROCEEDINGS{Ng0204:Simplified,
AUTHOR="Ka-Wai Ng and R.-G. Cheng and Ross Murch",
TITLE="A simplified bit allocation for {V-BLAST} based {OFDM} {MIMO}
systems in frequency selective fading channels",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="411-415",
MONTH=apr,
YEAR=2002,
REFERENCES=10,
ABSTRACT="This paper presents a simplified bit allocation algorithm for
OFDM multiple-input multiple-output (MIMO) systems that uses V-BLAST as
a detection algorithm. The advantage of our approach is that only
minimal feedback of information back to the transmitter is required
while still maintaining good performance. We demonstrate by computer
simulation that the proposed simplified bit allocation algorithm can
significantly improve the system performance and still maintain a
reasonable feedback loading compared to the traditional V-BLAST for an
OFDM MIMO system in a frequency selective fading channel model.",
URL="http://ieeexplore.ieee.org/iel5/7828/21514/00996886.pdf?isNumber=21514\&prod=CNF\&arnumber=996886\&arSt=411\&ared=415+vol.1\&arAuthor=Ka-Wai+Ng\%3B+Cheng\%2C+R.S.\%3B+Murch\%2C+R.D.",
}

@INPROCEEDINGS{Muns0204:MMSE,
AUTHOR="M. Munster and Lajos Hanzo",
TITLE="{MMSE} channel prediction assisted symbol-by-symbol adaptive
{OFDM}",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="416-420",
MONTH=apr,
YEAR=2002,
REFERENCES=13,
ABSTRACT="Subband adaptive orthogonal frequency division multiplexing
(OFDM) constitutes an effective method of compensating for the frequency
selective fading incurred by mobile receivers. The channel transfer
function estimation error increases both as a function of the Doppler
frequency and that of the subband modem mode signalling delay. This
leads to a degradation of the system's performance. In this article a
2D-MMSE channel-predictor is investigated as a means of compensating for
these effects, which incorporates the scheme proposed Tufvesson,
Faulkner and Maseng, (see IEEE Proc. of 6th International Workshop on
Intelligent Signal Processing and Communications Systems, Melbourne,
Australia, p.57-33, November 1998) into an adaptive OFDM scheme.",
URL="http://ieeexplore.ieee.org/iel5/7828/21514/00996887.pdf?isNumber=21514\&prod=CNF\&arnumber=996887\&arSt=416\&ared=420+vol.1\&arAuthor=Munster\%2C+M.\%3B+Hanzo\%2C+L.",
}

@INPROCEEDINGS{Neck0204:Totally,
AUTHOR="M. C. Necker and Gordon Stuber",
TITLE="Totally blind channel estimation for {OFDM} over fast varying
mobile channels",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="421-425",
MONTH=apr,
YEAR=2002,
REFERENCES=8,
ABSTRACT="A blind channel estimation scheme for OFDM is proposed. The
algorithm is based on the ML-principle and features a very fast
convergence rate. No reference symbols are needed to resolve the phase
ambiguity. Simulations show the performance in mobile environments at
high Doppler frequencies and short to medium delay spreads. The proposed
approach maximizes the spectral efficiency by avoiding any reference
symbols or pilots, and it minimizes the BER by using a non-differential
modulation scheme.",
URL="http://ieeexplore.ieee.org/iel5/7828/21514/00996888.pdf?isNumber=21514\&prod=CNF\&arnumber=996888\&arSt=421\&ared=425+vol.1\&arAuthor=Necker\%2C+M.C.\%3B+Stuber\%2C+G.L.",
}

@INPROCEEDINGS{Lo0204:Convolutional,
AUTHOR="Edward C. Lo and Khaled Ben Letaief",
TITLE="Convolutional double accumulate codes with iterative decoding for
broadband {OFDM} wireless communications",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="426-430",
MONTH=apr,
YEAR=2002,
REFERENCES=11,
ABSTRACT="Orthogonal frequency division multiplexing (OFDM) is robust to
inter-symbol interference and offers delay diversity that avoids large
time-domain interleavers which in turn induce long encoding and decoding
latency. We consider a high code-rate differentially modulated OFDM
system for broadband wireless communications. By treating the
differential modulation scheme as a rate-1 recursive convolutional code,
turbo decoding can be applied and numerical results show very good
performance, compared to that of the traditional coded coherent
modulation schemes. With an extra differential code, large coding gains
are achieved, without bandwidth expansion, for both the bit error rate
(BER) and frame error rate (FER) in the AWGN channel while significant
FER gain can be achieved in broadband frequency-selective radio channels
with only a few iterations.",
URL="http://ieeexplore.ieee.org/iel5/7828/21514/00996889.pdf?isNumber=21514\&prod=CNF\&arnumber=996889\&arSt=426\&ared=430+vol.1\&arAuthor=Lo\%2C+E.S.\%3B+Letaief\%2C+K.B.",
}

@INPROCEEDINGS{Abra0204:TDoA,
AUTHOR="Andrea Abrardo and Giuliano Benelli and C. Maraffon and A.
Toccafondi",
TITLE="Performance of {TDoA-based} radiolocation techniques in {CDMA}
urban environments",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="431-435",
MONTH=apr,
YEAR=2002,
REFERENCES=12,
KEYWORDS="cellular wcdma; position location",
ABSTRACT="The performance of radiolocation systems which make use of
observed time difference of arrival techniques is investigated. We refer
to a classical third generation WCDMA wireless system where measurements
are performed in the direct connection (from base station to mobile).
The system performance is evaluated by using a ray-tracing technique to
characterize the behaviour of typical urban environments.",
URL="http://ieeexplore.ieee.org/iel5/7828/21514/00996890.pdf?isNumber=21514\&prod=CNF\&arnumber=996890\&arSt=431\&ared=435+vol.1\&arAuthor=Abrardo\%2C+A.\%3B+Benelli\%2C+G.\%3B+Maraffon\%2C+C.\%3B+Toccafondi\%2C+A.",
}

@INPROCEEDINGS{Chen0204:Signal,
AUTHOR="Yongguang Chen and Hisashi Kobayashi",
TITLE="Signal strength based indoor geolocation",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="436-439",
MONTH=apr,
YEAR=2002,
REFERENCES=6,
ABSTRACT="We have investigated the indoor geolocation based on signal
strength modeling. Linear, compensated linear, and multiple regression
methods have been applied to set up signal strength models by using
simulated data. We have also analyzed this modeling method to better
understand the relation between the location error and the signal
strength error. Some important results have been obtained to help us
determine proper placement of access points (APs) and evaluate the range
of location error. A simulation experiment has been conducted based on
typical parameters of IEEE802.11b MAC.",
URL="http://ieeexplore.ieee.org/iel5/7828/21514/00996891.pdf?isNumber=21514\&prod=CNF\&arnumber=996891\&arSt=436\&ared=439+vol.1\&arAuthor=Yongguang+Chen\%3B+Kobayashi\%2C+H.",
}

@INPROCEEDINGS{Choi0204:Adaptive,
AUTHOR="Woo-Jin Choi and",
TITLE="An adaptive location registration scheme with dynamic mobility
classification",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="440-444",
MONTH=apr,
YEAR=2002,
REFERENCES=8,
ABSTRACT="An adaptive location registration scheme is proposed for
wireless cellular networks. A high speed mobile on a highly directed
path does not need to update its location as long as the mobile
maintains its speed and direction since the network can predict the
location of the mobile using the mobile's speed and direction
information. On the other hand, for a mobile doing a random walk, the
location prediction using the speed and direction information is
inefficient in terms of the signaling cost and prediction accuracy. With
this observation, we dynamically classify mobiles based on the
predictability of their trajectory. A mobile with predictable trajectory
is prescribed a predictive distance-based location update scheme and a
mobile with random trajectory is prescribed a (non-predictive)
distance-based location update scheme. The performance of the adaptive
scheme is compared with the predictive and non-predictive schemes.",
URL="http://ieeexplore.ieee.org/iel5/7828/21514/00996892.pdf?isNumber=21514\&prod=CNF\&arnumber=996892\&arSt=440\&ared=444+vol.1\&arAuthor=Woo-Jin+Choi\%3B+Tekinay\%2C+S.",
}

@INPROCEEDINGS{Mark0204:Robust,
AUTHOR="B. L. Mark and Z. R. Zaidi",
TITLE="Robust mobility tracking for cellular networks",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="445-449",
MONTH=apr,
YEAR=2002,
REFERENCES=8,
ABSTRACT="We propose a robust estimation algorithm for tracking the
location and dynamic motion of a mobile unit in a cellular network. The
underlying mobility model is a dynamic linear system driven by a
discrete command process that determines the mobile unit's acceleration.
The command process is modeled as a semi-Markov process over a finite
set of acceleration levels. Our proposed tracking algorithm is based on
a modified Kalman filter in combination with an efficient hidden
semi-Markov model (HSMM) estimation algorithm to estimate the parameters
of the command process. Numerical results show that the proposed
tracking algorithm performs accurately over a wide range of mobility
parameter values.",
URL="http://ieeexplore.ieee.org/iel5/7828/21514/00996893.pdf?isNumber=21514\&prod=CNF\&arnumber=996893\&arSt=445\&ared=449+vol.1\&arAuthor=Mark\%2C+B.L.\%3B+Zaidi\%2C+Z.R.",
}

@INPROCEEDINGS{Gore0204:Statistical,
AUTHOR="Dhananjay Gore and Robert Heath and Arogyaswami Paulraj",
TITLE="Statistical antenna selection for spatial multiplexing systems",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="450-454",
MONTH=apr,
YEAR=2002,
REFERENCES=15,
ABSTRACT="Spatial multiplexing is a signaling strategy for achieving
high spectral efficiencies in communication links that employ multiple
transmit and multiple receive antennas. In such systems, it is desirable
to use only a subset of the available transmit and/or receive antennas
to reduce cost and complexity. We address the problem of optimal antenna
subset selection in spatial multiplexing systems when only the
second-order statistics of the channel are available. We derive
selection criteria for both the maximum likelihood and zero forcing
receivers, motivated by minimizing the average symbol error rate. We
characterize the antenna selection gain and show that both coding gain
and diversity gain is possible. We then use Monte Carlo simulations to
validate our analysis.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996894.pdf?isNumber=21514\&prod=CNF\&arnumber=996894\&arSt=450\&ared=454+vol.1\&arAuthor=Gore\%2C+D.\%3B+Heath\%2C+R.\%3B+Paulraj\%2C+A.",
}

@INPROCEEDINGS{Song0204:Comparison,
AUTHOR="Guocong Song and Ke Gong",
TITLE="Performance comparison of optimum beamforming and spatially
matched filter in power-controlled {CDMA} systems",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="455-459",
MONTH=apr,
YEAR=2002,
REFERENCES=9,
ABSTRACT="The performance of power-controlled CDMA with smart antennas
is investigated. In contrast to traditional analyses, by considering the
interaction between beamforming and power control as well as the
correlation of all transmitter powers caused by power control, this
paper provides a theoretical framework for analyzing the performance of
joint power control and beamforming. Two major typical smart antennas
are compared, and it is shown that optimum beamforming is more effective
in improving the capacity of CDMA systems than the spatially matched
filter, especially in the situations of multiple quality of service
requirements or non-uniform user distribution.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996895.pdf?isNumber=21514\&prod=CNF\&arnumber=996895\&arSt=455\&ared=459+vol.1\&arAuthor=Guocong+Song\%3B+Ke+Gong",
}

@INPROCEEDINGS{Chan0204:New,
AUTHOR="A. M. Chan and Inkyu Lee",
TITLE="A new reduced-complexity sphere decoder for multiple antenna
systems",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="460-464",
MONTH=apr,
YEAR=2002,
REFERENCES=10,
ABSTRACT="Sphere decoding for multiple antenna systems has been shown to
achieve near-ML performance with low complexity. However, the
achievement of such an excellent performance-complexity tradeoff is
highly dependent on the initial choice of sphere radius. We present a
new sphere decoding algorithm which is even less computationally complex
than the original sphere decoder. Moreover, the complexity of the new
sphere decoder is relatively insensitive to the initial choice of sphere
radius. Thus, by making the choice of radius sufficiently large, the ML
solution is guaranteed with low complexity, even for large
constellations. In our simulations, we show that with 4 transmit and 4
receive antennas and 64-QAM, our new sphere decoding algorithm achieves
the exact ML solution with approximately a factor of 3.5 reduction in
complexity when compared to the original sphere decoder, and a factor of
10/sup 5/ reduction when compared to brute-force ML decoding.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996896.pdf?isNumber=21514\&prod=CNF\&arnumber=996896\&arSt=460\&ared=464+vol.1\&arAuthor=Chan\%2C+A.M.\%3B+Inkyu+Lee",
}

@INPROCEEDINGS{Gao0204:Differential,
AUTHOR="Chunjun Gao and Alexander Haimovich",
TITLE="A differential detection scheme for {DS/CDMA} spatial diversity",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="465-469",
MONTH=apr,
YEAR=2002,
REFERENCES=11,
ABSTRACT="A differential detection scheme for a multiple-input
multiple-output (MIMO) DS/CDMA link is presented, where neither the
transmitters nor the receivers know the channel state information (CSI).
The transmission provides for full spatial diversity gain by a simple
detection scheme, which is the natural extension of differential
detection combined with an orthogonal transmit diversity (OTD) approach.
Moreover, a capacity analysis for this scheme is illustrated. The
capacity analysis and simulation results show that 3 dB loss is paid for
differential detection compared to coherent detection.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996897.pdf?isNumber=21514\&prod=CNF\&arnumber=996897\&arSt=465\&ared=469+vol.1\&arAuthor=Chunjun+Gao\%3B+Haimovich\%2C+A.M.",
}

@INPROCEEDINGS{Goro0204:Robust,
AUTHOR="Alexei Gorokhov and Jean-Paul M.G. Linnartz",
TITLE="Robust {OFDM} receivers for dispersive time varying channels:
equalisation and channel acquisition",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="470-474",
MONTH=apr,
YEAR=2002,
REFERENCES=14,
ABSTRACT="In orthogonal frequency division multiplexing (OFDM), time
variations of a fading multipath environment lead to a loss of
orthogonality between the subcarriers and thereby limit the achievable
throughput. This paper suggests a general framework for a controlled
removal of intercarrier interference (ICI) and channel acquisition. The
core idea behind our method is to use a finite Taylor expansion for the
time-varying frequency response along with the known statistical
properties of mobile radio channels. Channel acquisition and ICI removal
are accomplished in the frequency domain and allow for any desired
tradeoff between the residual ICI level, the required training for
channel acquisition and processing complexity.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996898.pdf?isNumber=21514\&prod=CNF\&arnumber=996898\&arSt=470\&ared=474+vol.1\&arAuthor=Gorokhov\%2C+A.\%3B+Linnartz\%2C+J.-P.",
}

@INPROCEEDINGS{Gong0204:Efficient,
AUTHOR="Yi Gong and Khaled Ben Letaief",
TITLE="An efficient space-frequency coded wideband {OFDM} system for
wireless communications",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="475-479",
MONTH=apr,
YEAR=2002,
REFERENCES=14,
ABSTRACT="A space-frequency coded OFDM system for high-speed
transmission over wireless links is proposed. The analytical expression
for the error event probability of such space-frequency coded OFDM
system is derived in slow, spatial and frequency selective fading
channels. The design criteria of TCM codes for the proposed system are
then developed and discussed. It is shown that the proposed
space-frequency coded OFDM with low trellis complexity can efficiently
exploit the available diversity resources of the fading channel, while
in conventional space-frequency coded OFDM systems, space-time trellis
codes with very high trellis complexity are required to make full use of
the diversity resources. Simulation results show that at a FER of 10/sup
-2/, the proposed scheme outperforms the traditional space-frequency
coded OFDM by 2-4 dB at an equal trellis complexity and spectral
efficiency.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996899.pdf?isNumber=21514\&prod=CNF\&arnumber=996899\&arSt=475\&ared=479+vol.1\&arAuthor=Gong\%2C+Y.\%3B+Letaief\%2C+K.B.",
}

@INPROCEEDINGS{Gera0204:Interference,
AUTHOR="Diakoumis Gerakoulis and P. Salmi",
TITLE="An interference suppressing {OFDM} system for wireless
communications",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="480-484",
MONTH=apr,
YEAR=2002,
REFERENCES=8,
ABSTRACT={The orthogonal frequency division multiplexed (OFDM) system
introduced here, termed interference suppressing OFDM (IS-OFDM), has the
capabilities of suppressing narrowband interference in wideband wireless
applications. The IS-OFDM encodes each transmitted symbol in all
frequency bins. Each frequency bin then "contains" all transmitted
symbols which are distinguished and separated from each other by
orthogonal Hadamard sequences. The IS-OFDM can provide a point-to-point
wireless link without spreading the incoming data rate. In addition, the
IS-OFDM has all the advantages of the ordinary OFDM, which is shown to
be a special case of the IS-OFDM. We present the IS-OFDM system design
and evaluate its performance in the presence of narrowband interference
and AWGN channel.},
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996900.pdf?isNumber=21514\&prod=CNF\&arnumber=996900\&arSt=480\&ared=484+vol.1\&arAuthor=Gerakoulis\%2C+D.\%3B+Salmi\%2C+P.",
}

@INPROCEEDINGS{Digg0204:Intercarrier,
AUTHOR="Suhas Diggavi and Naofal Al-Dhahir and Anastasios Stamoulis",
TITLE="Intercarrier interference in {MIMO} {OFDM}",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="485-489",
MONTH=apr,
YEAR=2002,
REFERENCES=16,
ABSTRACT="We examine multicarrier transmission over time-varying
channels. We first develop the model for such a transmission scheme and
focus particularly on OFDM-based schemes. We analyze the impact of
time-variation within a transmission block which could arise both from
Doppler spread of the channel and from synchronization errors. We
propose a time-domain approach to mitigate the effects of such
time-variations. This approach reduces to the familiar single-tap
frequency-domain equalizer when the channel is block time-invariant. We
also develop this in the context of multiple transmit and receive
antennas and specialize the receiver to space-time block-coded systems.
Finally we provide numerical results.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996901.pdf?isNumber=21514\&prod=CNF\&arnumber=996901\&arSt=485\&ared=489+vol.1\&arAuthor=Diggavi\%2C+S.\%3B+Al-Dhahir\%2C+N.\%3B+Stamoulis\%2C+A.",
}

@INPROCEEDINGS{Shon0204:Proposal,
AUTHOR="Takashi Shono and Keisuke Uehara and Shuji Kubota",
TITLE="Proposal and evaluation of system diversity for software defined
radio",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="490-496",
MONTH=apr,
YEAR=2002,
REFERENCES=14,
ABSTRACT="This paper proposes the concept of system diversity on
software defined radio (SDR) and investigates the effectiveness of
system diversity by using a concrete simulation model. System diversity
allows the wireless communication system to be dynamically changed in
addition to the signal processing algorithm or modulation/coding scheme
being used. To clarify the validity of system diversity, we examine a
system simulation model consisting of three wireless communication
systems; algorithms are introduced to show how system diversity can be
controlled using the QoS parameters of the received signal level, the
data transmission rate and the channel capacity. The process by which
system diversity switching is triggered is elucidated and a practical
example is introduced. Simulation results confirm that system diversity
offers higher performance in terms of data throughput and system channel
capacity than existing wireless communication systems.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996902.pdf?isNumber=21514\&prod=CNF\&arnumber=996902\&arSt=490\&ared=496+vol.1\&arAuthor=Shono\%2C+T.\%3B+Uehara\%2C+K.\%3B+Kubota\%2C+S.",
}

@INPROCEEDINGS{Gray0204:Object,
AUTHOR="A. A. Gray and Chung-Nan Lee and P. Arabshahi and J.
Srinivasan",
TITLE="Object-oriented reconfigurable processing for wireless networks",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="497-501",
MONTH=apr,
YEAR=2002,
REFERENCES=16,
ABSTRACT={We present an outline of reconfigurable processor technologies
and design methods with emphasis on an object-oriented approach and on
both full and partial dynamic reconfiguration. A specific, broadly
applicable architecture for implementing a software reconfigurable
network processor for wireless communication applications is presented;
a prototype of which is currently operating in the laboratory. This
architecture, with its associated object oriented design methods and
partial reconfiguration techniques, enables rapid prototyping and rapid
implementation of communications and navigation signal processing
functions, provides long-life communications infrastructure and results
in dynamic operation within networks with heterogeneous nodes, as well
as compatibility with other networks. This work builds upon numerous
advances in the commercial industry, as well as military software radio
developments, to space-based radios and network processing. The
development of such radios and the network processor presented here
requires the correct combination of processing methods ("objects") to be
defined and appropriate dynamic reconfiguration techniques to be
developed as a function of system goals and operating parameters.},
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996903.pdf?isNumber=21514\&prod=CNF\&arnumber=996903\&arSt=497\&ared=501+vol.1\&arAuthor=Gray\%2C+A.A.\%3B+Lee\%2C+C.\%3B+Arabshahi\%2C+P.\%3B+Srinivasan\%2C+J.",
}

@INPROCEEDINGS{Rumm0204:End,
AUTHOR="R. Rummler and A. H. Aghvami",
TITLE="End-to-end {IP} multicast for software upgrades of reconfigurable
user terminals within {IMT-2000/UMTS} networks",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="502-506",
MONTH=apr,
YEAR=2002,
REFERENCES=13,
ABSTRACT="The paper proposes a viable technique for performing software
upgrades of reconfigurable user terminals across the entire public land
mobile network (PLMN) of an IMT-2000/UMTS network. The proposed solution
utilizes over-the-air software downloads in conjunction with IP
multicast as the enabling technology. The paper describes in detail the
interaction required between logical network elements within the PLMN in
order to perform the software upgrade on a set of targeted terminals.
The limitations of the proposed technique are outlined and the paper
addresses possible schemes for facilitating the presented solution and
improving its scalability to large networks.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996904.pdf?isNumber=21514\&prod=CNF\&arnumber=996904\&arSt=502\&ared=506+vol.1\&arAuthor=Rummler\%2C+R.\%3B+Aghvami\%2C+A.H.",
}

@INPROCEEDINGS{Wong0204:RF,
AUTHOR="Sew Kin Wong and Sze Wei Lee and Moh Lim Sim",
TITLE="{RF} transceiver design and performance analysis for {WCDMA} user
equipment",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="507-511",
MONTH=apr,
YEAR=2002,
REFERENCES=7,
ABSTRACT="A performance analysis of an RF transceiver for UTRA/FDD WCDMA
user equipment through simulation is presented. The main building blocks
of this transceiver are power amplifier (PA), low noise amplifier (LNA),
automatic gain control amplifiers (AGCs), mixers, modulator,
demodulator, frequency synthesizers (oscillators and phase lock loop)
and variable gain power amplifier driver. All these components are
commercially available. Critical RF characteristics of the transceiver,
such as adjacent channel leakage power ratio (ACLR), maximum output
power, noise figure (NF), gain, 3/sup rd/ order input intercept point
(IIP3) and selectivity, were analysed based on commercial standard dual
conversion transmitter and heterodyne receiver architectures. Results
obtained from this simulation could be used as a design methodology for
future RF transceiver implementation.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996905.pdf?isNumber=21514\&prod=CNF\&arnumber=996905\&arSt=507\&ared=511+vol.1\&arAuthor=Sew+Kin+Wong\%3B+Sze+Wei+Lee\%3B+Moh+Lim+Sim",
}

@INPROCEEDINGS{Clar0204:Outdoor,
AUTHOR="Martin Clark and Kin K. Leung and Bruce McNair and Zoran
Kostic",
TITLE="Outdoor {IEEE} 802.11 cellular networks: radio link performance
Outdoor {IEEE} 802.11 cellular networks: radio link performance",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="512-516",
MONTH=apr,
YEAR=2002,
LANGUAGE="English",
REFERENCES=11,
ABSTRACT="We explore the feasibility of designing an outdoor cellular
network based on the IEEE 802.11 standard, which was developed
originally for wireless local-area networks. For channels typical in
cellular networks, we study the radio link power budget and, via
simulation, the bit-error performance of three kinds of receiver: (1)
the constrained RAKE, which is limited to a 1 /spl mu/s multipath span;
(2) the full RAKE, which uses the full multipath channel information;
(3) the ideal equalizer, the performance of which is represented by the
matched filter bound. Our link budget reveals that the maximum cell
radius in an outdoor 802.11 network ranges from 0.7 to 3 km, about half
that supported by WCDMA and EDGE networks. For an RMS delay spread of 1
/spl mu/s, typical for urban-area cells of this size, our simulation
results show that the conventional constrained RAKE receiver may yield a
satisfactory performance. The improved receivers, however, yield 1-5 dB
gain over the constrained implementation. Combining these results with
those in a companion paper on the MAC protocol (see Leung, K.K. et al.,
ibid., p.595-599), we conclude that an 802.11 based cellular network
with a cell radius of a few km is feasible.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996906.pdf?isNumber=21514\&prod=CNF\&arnumber=996906\&arSt=512\&ared=516+vol.1\&arAuthor=Clark\%2C+M.V.\%3B+Leung\%2C+K.K.\%3B+McNair\%2C+B.\%3B+Kostic\%2C+Z.",
}

@INPROCEEDINGS{Yip0204:Impacts,
AUTHOR="Kun-Wah Yip and Tung-Sang Ng and Yik-Chung Wu",
TITLE="Impacts of multipath fading on the timing synchronization of
{IEEE} 802.11a wireless {LANs}",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="517-521",
MONTH=apr,
YEAR=2002,
REFERENCES=11,
ABSTRACT="The timing-synchronization performance of IEEE 802.11a
wireless LANs on multipath Rician fading channels is investigated.
Simulation results yield the following observations. A higher Rician
factor gives a better performance. At low signal-to-noise conditions,
the multipath-diversity gain enables an improvement in the
synchronization performance but at high signal-to-noise conditions,
irreducible probabilities of synchronization failure, which cannot be
reduced even if the signal power is increased, occur. A more dispersive
channel gives a poorer synchronization performance, and the performance
is poor for Rayleigh fading environments.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996907.pdf?isNumber=21514\&prod=CNF\&arnumber=996907\&arSt=517\&ared=521+vol.1\&arAuthor=Kun-Wah+Yip\%3B+Tung-Sang+Ng\%3B+Yik-Chung+Wu",
}

@INPROCEEDINGS{Tari0204:Development,
AUTHOR="M. F. Tariq and Y. Baltaci and Tony Horseman and Marshall Butler
and Andrew Nix",
TITLE="Development of an {OFDM} based high speed wireless {LAN} platform
using the {TI} C6x {DSP}",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="522-526",
MONTH=apr,
YEAR=2002,
REFERENCES=5,
ABSTRACT="Coded orthogonal frequency division multiplexing (COFDM) is
currently specified in all three of the world's 5 GHz wireless LAN
standards (HIPERLAN/2, IEEE 802.11a and MMAC HiSWANa). This technology
was chosen due to its robustness at high data rates in a frequency
selective multipath channel. Each standard operates using adaptive
subband quadrature amplitude modulation (QAM) and offers a maximum data
rate of 54 Mbits/s over a 20 MHz channel. This paper describes a
real-time DSP implementation of an asynchronous OFDM based high speed
WLAN system. The software reconfigurable OFDM based platform is
developed around the Texas Instruments fixed point TMS320C6201 DSP. The
physical layer DSP performance is evaluated and compared for an indoor
channel against floating point C++ based simulations. Data throughput
and complexity estimates are generated from the resulting hardware
platform. Finally, a video based communications application is developed
to operate over the demonstrator. Results indicate that the fixed point
DSP solution can operate within 0.5 dB of the floating point simulation
in an AWGN channel. For the indoor fading channel, an implementation
loss of around 2.5 dB was observed.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996908.pdf?isNumber=21514\&prod=CNF\&arnumber=996908\&arSt=522\&ared=526+vol.1\&arAuthor=Tariq\%2C+M.F.\%3B+Baltaci\%2C+Y.\%3B+Horseman\%2C+T.\%3B+Butler\%2C+M.\%3B+Nix\%2C+A.",
}

@INPROCEEDINGS{Wieg0204:Higher,
AUTHOR="D. A. Wiegandt and Carl Nassar",
TITLE="Higher-speed, higher-performance 802.11a wireless {LAN} via
carrier-interferometry orthogonal frequency division multiplexing",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="527-532",
MONTH=apr,
YEAR=2002,
REFERENCES=12,
ABSTRACT="WLANs (wireless local area networks) have emerged as a
powerful architecture capable of supporting the requirements of
broadband wireless communications. The IEEE 802.11a 5 GHz WLAN standard
employs OFDM in its physical layer. This paper introduces carrier
interferometry OFDM to the current 802.11a WLAN, and demonstrates that
the corresponding small changes to the traditional OFDM scheme lead to
notable improvements in probability of error performances and a doubling
in throughput. Calling the modified WLAN system pseudo-orthogonal
carrier-interferometry WLAN (or PO-CI-WLAN for short), we show that in
office buildings, at a bit error rate of 10/sup -3/, PO-CI-WLAN offers a
3 dB performance gain over the IEEE 802.11a 5 GHz WLAN and
simultaneously doubles the throughput.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996909.pdf?isNumber=21514\&prod=CNF\&arnumber=996909\&arSt=527\&ared=532+vol.1\&arAuthor=Wiegandt\%2C+D.A.\%3B+Nassar\%2C+C.R.",
}

@INPROCEEDINGS{Nico0204:Reduced,
AUTHOR="Monica Nicoli and Mikael Sternad and Umberto Spagnolini and A.
Ahlen",
TITLE="Reduced-rank channel estimation and tracking in time-slotted
{CDMA} systems",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="533-537",
MONTH=apr,
YEAR=2002,
REFERENCES=10,
ABSTRACT="This paper investigates the estimation and tracking of time
varying propagation channels in the uplink of a time slotted CDMA
system. An antenna array is adopted at the base station. Both the
estimation and tracking are performed by exploiting the low-rank nature
of the channel matrix. The accuracy of the estimate is improved by using
a multi-slot approach: the slowly varying component of the low-rank
channel is estimated from the observation of successive midambles
(inter-slot tracking), while the fast varying component is updated over
the burst interval in decision-directed mode (intra-slot tracking).",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996910.pdf?isNumber=21514\&prod=CNF\&arnumber=996910\&arSt=533\&ared=537+vol.1\&arAuthor=Nicoli\%2C+M.\%3B+Sternad\%2C+M.\%3B+Spagnolini\%2C+U.\%3B+Ahlen\%2C+A.",
}

@INPROCEEDINGS{Wu0204:High,
AUTHOR="Zhiqiang Wu and Carl Nassar and Suihua Lu",
TITLE="High capacity high performance {DS-CDMA} via advances in chip
shaping",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="538-543",
MONTH=apr,
YEAR=2002,
REFERENCES=8,
ABSTRACT="This paper introduces a novel chip shaping scheme increasing
the network capacity in DS-CDMA systems without any increase in.
bandwidth or chip rate, and without performance degradation. The chip
shape corresponds to an interferometry pattern created by the
superposition of N carriers. Two sets of orthogonal chip shapes with
minimum inter-chip interference are positioned pseudo-orthogonally (in
time) within a single symbol duration, allowing the novel system to
support many more chips in the same symbol duration and bandwidth.
Simulations performed over Rayleigh fading channels indicate the new
chip shaping (and corresponding detection strategy) enables 100\% gains
in DS-CDMA network capacity without any loss in performance. With the
exception of chip shape and receiver design, this new system retains all
the features of a conventional DS-CDMA system.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996911.pdf?isNumber=21514\&prod=CNF\&arnumber=996911\&arSt=538\&ared=543+vol.1\&arAuthor=Zhiqiang+Wu\%3B+Nassar\%2C+C.R.\%3B+Suihua+Lu",
}

@INPROCEEDINGS{Shi0204:New,
AUTHOR="Qicai Shi and R. J. O'Dea and F. E. Martin",
TITLE="A new chip-level differential detection system for {DS-CDMA}",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="544-547",
MONTH=apr,
YEAR=2002,
REFERENCES=10,
ABSTRACT="In this paper we mathematically prove that if the original
spreading Pseudo-Noise (PN) code is an m-sequence or a Gold-sequence,
then the chip-by-chip differential decoding (CBCDD) sequence of the
original PN code is a cyclic shift version of the original PN sequence.
By utilizing this property, we design a new chip-level differential
detection system for DS-CDMA, which does not require any chip-level
differential encoding in the transmitter. We demonstrate simplicity of
implementation and robust operation in the presence of carrier frequency
shift.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996912.pdf?isNumber=21514\&prod=CNF\&arnumber=996912\&arSt=544\&ared=547+vol.1\&arAuthor=Qicai+Shi\%3B+O\%27Dea\%2C+R.J.\%3B+Martin\%2C+F.",
}

@INPROCEEDINGS{Merc0204:Rate,
AUTHOR="Alejandra Mercado and Ke Liu",
TITLE="Rate control for {DS-CDMA} wireless systems using power control
and orthogonally coded substreams",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="548-552",
MONTH=apr,
YEAR=2002,
REFERENCES=9,
ABSTRACT="There is an increase of multimedia applications in wireless
networks. The increase in data transmission requirements for some
multimedia applications poses a problem for the service providers who
must overcome the high interference environment to provide this higher
transmission rate. One method to service multimedia users is by
splitting their data streams into separately coded substreams. We
propose an algorithm to choose the optimal number of substreams for each
multimedia user and to use power control techniques to control the rate
of each substream.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996913.pdf?isNumber=21514\&prod=CNF\&arnumber=996913\&arSt=548\&ared=552+vol.1\&arAuthor=Mercado\%2C+A.\%3B+Liu\%2C+K.J.R.",
}

@INPROCEEDINGS{Zhou0204:Optimal,
AUTHOR="Shengli Zhou and Georgios Giannakis",
TITLE="Optimal transmitter eigen-beamforming and space-time block coding
based on channel correlations",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="553-557",
MONTH=apr,
YEAR=2002,
REFERENCES=12,
ABSTRACT="Optimal transmitter designs obeying the water-filling
principle are well-documented, and widely applied when the propagation
channel is deterministically known and regularly updated at the
transmitter. Because channel state information may be costly or
impossible to acquire in rapidly varying wireless environments, we
develop in this paper statistical water-filling approaches for
stationary random fading channels. The resulting optimal designs require
only knowledge of the channel's second order statistics that do not
require frequent updates, and can be easily acquired. Optimality refers
to minimizing a tight bound on the symbol error rate. Applied to a
multiple transmit-antenna paradigm, the optimal precoder turns out to be
a generalized eigen-beamformer with multiple beams pointing to
orthogonal directions along the eigenvectors of the channel's covariance
matrix, and with proper power loading across the beams. Coupled with
orthogonal space time block codes, two-directional eigen-beamforming
emerges as a more attractive choice than conventional one-directional
beamforming, with uniformly better performance, and without rate
reduction or complexity increase.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996914.pdf?isNumber=21514\&prod=CNF\&arnumber=996914\&arSt=553\&ared=557+vol.1\&arAuthor=Shengli+Zhou\%3B+Giannakis\%2C+G.B.",
}

@INPROCEEDINGS{Rouq0204:Orthogonal,
AUTHOR="S. Rouquette and S. Merigeault and K. Gosse",
TITLE="Orthogonal full diversity space-time block coding based on
transmit channel state information for 4 Tx antennas",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="558-562",
MONTH=apr,
YEAR=2002,
REFERENCES=11,
ABSTRACT="In this paper we consider the design of space-time block codes
to benefit from multiple antennas at the emitter and possibly at the
receiver. Theory of orthogonal designs has shown that such codes can not
simultaneously be orthogonal, of rate 1, with full diversity order, for
more than 2 transmit antennas. We propose in this paper to exploit
channel state information available at the emitter to overcome this
limitation and we describe a new rate 1 coding scheme with full
diversity for 3 or 4 transmit antennas. This scheme is an orthogonal one
thanks to transmit weights, which allow to use a simple linear receiver
having optimal performance. The performance of the code is assessed by
simulations in the 5 GHz OFDM-based WLAN environment (HIPERLAN/2). The
practical interest of such approach is finally discussed.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996915.pdf?isNumber=21514\&prod=CNF\&arnumber=996915\&arSt=558\&ared=562+vol.1\&arAuthor=Rouquette\%2C+S.\%3B+Merigeault\%2C+S.\%3B+Gosse\%2C+K.",
}

@INPROCEEDINGS{Safa0204:Space,
AUTHOR="Zoltan Safar and Ke Liu",
TITLE="Space-time trellis code construction for fast fading channels",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="563-567",
MONTH=apr,
YEAR=2002,
REFERENCES=7,
ABSTRACT="The need for bandwidth- and power-efficient wireless
communication systems has raised considerable interest in space-time
codes. In this work, we propose a systematic space-time code
construction procedure for fast fading channels. The method can be used
to design space-time codes for an arbitrary number of transmit antennas
and any memoryless modulation. We introduce a new design criterion that
ensures full spatial diversity and develop the code design method based
on this criterion. The flexibility of the proposed approach is
demonstrated by designing space-time trellis codes for 2, 3 and 4
transmit antennas with QPSK, 8PSK and 4ASK modulations.",
URL="Theneedforbandwidth-andpower-efficientwirelesscommunicationsystemshasraisedconsiderableinterestinspace-timecodes.Inthiswork,weproposeasystematicspace-timecodeconstructionprocedureforfastfadingchannels.Themethodcanbeusedtodesignspace-timecodesforanarbitrar",
}

@INPROCEEDINGS{Leus0204:Space,
AUTHOR="Geert Leus and Frederik Petre and Marc Moonen",
TITLE="Space-time chip equalization for space-time coded downlink
{CDMA}",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="568-572",
MONTH=apr,
YEAR=2002,
REFERENCES=7,
ABSTRACT="In downlink CDMA, frequency-selectivity destroys the
orthogonality of the user signals and introduces multi-user interference
(MUI). A space-time chip equalizer is an attractive tool to restore the
orthogonality of the user signals and suppress MUI. Recently, efficient
pilot-based methods have been developed to design such a space-time chip
equalizer. In this paper, we show how these pilot-based methods can be
generalized to space-time coded downlink CDMA. As space-time coded
downlink CDMA transmission scheme, we consider the conventional
single-antenna downlink CDMA transmission scheme followed by a
space-time block code for single-carrier block transmissions that
exploits the maximum achievable diversity in a frequency-selective
fading channel. Simulation results show improved performance over a
pilot-based space-time RAKE-type receiver applied to the space-time
coded downlink CDMA transmission schemes that were proposed for the UMTS
and IS-2000 W-CDMA standards.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996917.pdf?isNumber=21514\&prod=CNF\&arnumber=996917\&arSt=568\&ared=572+vol.1\&arAuthor=Leus\%2C+G.\%3B+Petre\%2C+F.\%3B+Moonen\%2C+M.",
}

@INPROCEEDINGS{Atta0204:Reverse,
AUTHOR="R. A. Attar and E. Esteves",
TITLE="A reverse link outer-loop power control algorithm for cdma2000
{1xEV} systems",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="573-578",
MONTH=apr,
YEAR=2002,
REFERENCES=9,
ABSTRACT="Reverse link outer-loop power control (ROLPC) algorithms
developed for voice systems operate based on a continuous stream of
packets (CRC events) to adjust the power control setpoint. Due to
burstiness of data traffic a mechanism to distinguish between idle
periods and data transmissions is necessary in systems optimized for
data communications. In addition, such algorithms are unable to track
changes in channel conditions during long idle periods. The proposed
algorithm is designed to conservatively adapt to the channel in the
absence of packets, with fast convergence at the start of a
transmission. A parameterized algorithm is described with analysis and
simulation results to justify baseline parameters. The performance of
the algorithm for continuous and bursty TCP/IP traffic is presented.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996918.pdf?isNumber=21514\&prod=CNF\&arnumber=996918\&arSt=573\&ared=578+vol.1\&arAuthor=Attar\%2C+R.A.\%3B+Esteves\%2C+E.",
}

@INPROCEEDINGS{Ozug0204:Multiobjective,
AUTHOR="Timucin Ozugur",
TITLE="Multiobjective hierarchical location and routing area
optimization in {GPRS} and {UMTS} networks",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="579-584",
MONTH=apr,
YEAR=2002,
REFERENCES=9,
ABSTRACT="We propose four-layer optimization for UMTS coverage area: (i)
cell-oriented intra-SGSN layer, which is optimized RA areas covering the
intra-SGSN signaling cost, paging cost and RA load balancing, (ii)
RA-oriented intra-MSC layer, which is optimized location areas covering
the intra-MSC signaling cost and LA load balancing,(iii) RA-oriented
inter-SGSN layer, which is optimized SGSN coverage areas covering the
inter-SGSN signaling cost, RNC and SGSN load balancing, (iv) LA-oriented
inter-MSC layer, which is optimized MSC coverage areas covering the
inter-MSC signaling cost and MSC load balancing. We first calculate the
multi-objective cost functions for each layers in UMTS, namely
intra-SGSN and inter-SGSN layers. We then simulate an UMTS network using
the niched Pareto genetic algorithm, which deals with multiple
objectives by incorporating the concept of Pareto domination in its
selection operator, and applying a niching pressure to spread its
population out along the Pareto optimal tradeoff surface. We also define
geographical footprints, and its impact on the network cost.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996919.pdf?isNumber=21514\&prod=CNF\&arnumber=996919\&arSt=579\&ared=584+vol.1\&arAuthor=Ozugur\%2C+T.",
}

@INPROCEEDINGS{Fork0204:Capacity,
AUTHOR="I. Forkel and B. Wegmann and Egon Schulz",
TITLE="On the capacity of a {UTRA-TDD} network with multiple services",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="585-589",
MONTH=apr,
YEAR=2002,
REFERENCES=9,
ABSTRACT="UMTS Terrestrial Radio Access (UTRA) in time division duplex
(TDD) mode is a combination of time division multiple access (TDMA) and
code division multiple access (CDMA). Radio resources are disposed in
the time as well as in the code domain and allow a variable allocation
to either uplink or downlink transmission. With this characteristic,
UTRA-TDD allows to flexibly adapt the physical channel and radio frame
structure to various kinds of services in different environments and
traffic conditions. Depending on the choice of radio resource management
(RRM) algorithms, this paper focuses on simulative capacity estimation
in a typical micro-cellular dense urban environment with a service mix
of speech and Internet data traffic.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996920.pdf?isNumber=21514\&prod=CNF\&arnumber=996920\&arSt=585\&ared=589+vol.1\&arAuthor=Forkel\%2C+I.\%3B+Wegmann\%2C+B.\%3B+Schulz\%2C+E.",
}

@INPROCEEDINGS{Kies0204:Enhancements,
AUTHOR="Mario Kiessling and S. A. Mujtaba",
TITLE="Performance enhancements to the {UMTS} {(W-CDMA)} initial cell
search algorithm",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="590-594",
MONTH=apr,
YEAR=2002,
REFERENCES=11,
ABSTRACT={The purpose of the cell search algorithm in UMTS is to
estimate the spreading code of the serving base-station and its
corresponding timing offset. The search procedure consists of 3
sequential and distinct stages: (1) slot-boundary synchronization, (2)
frame-boundary synchronization with code-group identification, and (3)
scrambling code identification. Algorithms that have appeared in
literature for cell search have confined the "code-time" estimation in
each stage to a single hypothesis. Furthermore, these algorithms have
neither considered the benefits of oversampling, nor the detrimental
effects of non-ideal sampling that may arise due to clock jitter and/or
residual frequency offset. We study the performance benefits of
estimating multiple "code-time" hypotheses in each stage of the
cell-search process. In addition, we also study the effect of
oversampling and non-ideal sampling. Our results indicate that, in the
presence of non-ideal sampling, performance improves significantly if
the received signal is oversampled by a factor of 4 or more. We also
show that estimating 4 "code-time" hypotheses instead of 1 in the
cell-search stages reduces the search-time (i.e. the code-acquisition
time) considerably, in particular at low SINR.},
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996921.pdf?isNumber=21514\&prod=CNF\&arnumber=996921\&arSt=590\&ared=594+vol.1\&arAuthor=Kiessling\%2C+M.\%3B+Mujtaba\%2C+S.A.",
}

@INPROCEEDINGS{Leun0204:Outdoor,
AUTHOR="Kin K. Leung and Bruce McNair and Len Cimini and Jack H.
Winters",
TITLE="Outdoor {IEEE} 802.11 cellular networks: {MAC} protocol design
and performance",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="595-599",
MONTH=apr,
YEAR=2002,
LANGUAGE="English",
REFERENCES=13,
ABSTRACT="We explore the feasibility of designing an outdoor cellular
network based on the IEEE 802.11 specification. Since the standard is
intended for wireless local-area networks (WLAN), there are many
technical challenges when applying the air interface to the outdoor
environment. We study how the 802.11 medium access control (MAC)
protocol can be applied and how it performs in the outdoor network. By
exploiting the fact that timeout intervals are not explicitly specified,
without modifying the standard, we propose a new timing structure for
the distribution coordination function (DCF) and the handshake of
request-to-send (RTS) and clear-to-send (CTS) to handle increased signal
propagation delay in the outdoor network. We find that the DCF and
RTS/CTS protocols as specified in the standard continue to work properly
for a link distance up to 6 km. Our analysis reveals that the DCF
performance degrades slightly in the 802.11 network with a cell size of
6 km when compared with the 600 m WLAN. Thus, as far as the MAC protocol
is concerned, the 802.11 outdoor, cellular network with 6 km cell size
is feasible.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996922.pdf?isNumber=21514\&prod=CNF\&arnumber=996922\&arSt=595\&ared=599+vol.1\&arAuthor=Leung\%2C+K.K.\%3B+McNair\%2C+B.\%3B+Cimini\%2C+L.J.\%2C+Jr.\%3B+Winters\%2C+J.H.",
}

@INPROCEEDINGS{Yeh0204:Support,
AUTHOR="Jing-Yuan Yeh and Chienhua Chen",
TITLE="Support of multimedia services with the {IEEE} 802-11 {MAC}
protocol",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="600-604",
MONTH=apr,
YEAR=2002,
REFERENCES=9,
ABSTRACT="In order to meet the growing requirement in bandwidth for
multimedia services in an IEEE 802.11 wireless local area network, we
propose four polling schemes (RR, FIFO, priority, and priority-ELF
schemes) combined with the point coordination function (PCF) to improve
the utilization of the wireless channel and support certain quality of
service (QoS) of multimedia traffic. We introduce the proposed polling
schemes, and also evaluate their performance based on simulations.
Although both RR and FIFO schemes have better performance than the pure
distributed coordination function (DCF) scheme generally, their
performances may be affected by some traffic patterns. We also show that
the priority and priority-ELF schemes are sufficient to maintain the QoS
of multimedia traffic. As errors occur, the priority-ELF scheme achieves
higher utilization of the wireless channel.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996923.pdf?isNumber=21514\&prod=CNF\&arnumber=996923\&arSt=600\&ared=604+vol.1\&arAuthor=Jing-Yuan+Yeh\%3B+Chienhua+Chen",
}

@INPROCEEDINGS{Wu0204:IEEE,
AUTHOR="Haitao Wu and Shiduan Cheng and Yong Peng and Keping Long and
Jian Ma",
TITLE="{IEEE} 802.11 distributed coordination function {(DCF):} analysis
and enhancement",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="605-609",
MONTH=apr,
YEAR=2002,
REFERENCES=8,
KEYWORDS="ieee 802.11; csma/ca; dcf; analysis",
ABSTRACT="Being a part of IEEE project 802, the 802.11 medium access
control (MAC) is used to support asynchronous and time bounded delivery
of radio data packets. It is proposed that a distributed coordination
function (DCF), which uses carrier sense multiple access with collision
avoidance (CSMA/CA) and binary slotted exponential backoff, be the basis
of the IEEE 802.11 WLAN MAC protocols. This paper proposes a throughput
enhancement mechanism for DCF by adjusting the contention window (CW)
resetting scheme. Moreover, an analytical model based on Markov chain is
introduced to compute the enhanced throughput of 802.11 DCF. The
accuracy of the model and the enhancement of the proposed scheme are
verified by elaborate simulations.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996924.pdf?isNumber=21514\&prod=CNF\&arnumber=996924\&arSt=605\&ared=609+vol.1\&arAuthor=Haitao+Wu\%3B+Shiduan+Cheng\%3B+Yong+Peng\%3B+Keping+Long\%3B+Jian+Ma",
}

@INPROCEEDINGS{Sheu0204:Highly,
AUTHOR="Shiann-Tsong Sheu and Yihjia Tsai and Jenhui Chen",
TITLE="A highly reliable broadcast scheme for {IEEE} 802.11 multi-hop ad
hoc networks",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="610-615",
MONTH=apr,
YEAR=2002,
REFERENCES=12,
ABSTRACT="In wired networks, the broadcast data packets can be easily
and safely delivered to destinations. Nevertheless, it is a big
challenge to transfer the broadcast frames over the IEEE 802.11 based
multi-hop ad hoc wireless networks due to the high bit error rate, the
high collision probability, and the lake of acknowledgement (ACK).
Unfortunately, most of routing protocols need the broadcast function to
exchange important information between nodes. From our observations, the
efficiency of the routing protocol, such as dynamic source routing (DSR)
and ad-hoc on-demand distance vector (AODV), finding the path from
source to destination is strongly depending on the supported broadcast
scheme in the underlying media access control (MAC) protocol. In this
paper, we first investigate the uncertain broadcast problem in the IEEE
802.11 MAC protocol while delivering the necessary broadcast frames.
Since no acknowledgement will be sent by any recipient of the broadcast
frame in IEEE 802.11 MAC protocol, we propose a highly reliable
broadcast scheme to solve such uncertain problem. The proposed scheme,
which is still compatible with standard, can efficiently minimize
bandwidth consumption as well as propagation delay.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996925.pdf?isNumber=21514\&prod=CNF\&arnumber=996925\&arSt=610\&ared=615+vol.1\&arAuthor=Shiann-Tsong+Sheu\%3B+Yihjia+Tsai\%3B+Jenhui+Chen",
}

@INPROCEEDINGS{Je0204:Acquisition,
AUTHOR="Hui Won Je and Oh-Soon Shin and Kwang Y. Lee",
TITLE="Acquisition for {DS/CDMA} systems with multiple antennas in
frequency-selective fading channels",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="616-620",
MONTH=apr,
YEAR=2002,
REFERENCES=6,
ABSTRACT="A code acquisition scheme is proposed for DS/CDMA systems with
multiple antennas. The proposed scheme employs a new search scheme,
referred to as sparse search, to utilize multipath signals in reducing
mean acquisition time over frequency-selective fading channels. The mean
acquisition time performance of the proposed scheme is analyzed and
evaluated in frequency-selective Rayleigh fading channels. The
performance of the proposed scheme is compared with that of the
conventional one. Numerical results show that the proposed acquisition
scheme outperforms the conventional one, and that the performance
improvement becomes greater as the number of resolvable paths increases.
The effects of configuration of multiple antennas and receiver
complexity on mean acquisition time are also investigated.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996926.pdf?isNumber=21514\&prod=CNF\&arnumber=996926\&arSt=616\&ared=620+vol.1\&arAuthor=Hui+Won+Je\%3B+Oh-Soon+Shin\%3B+Kwang+Bok+Lee",
}

@INPROCEEDINGS{Shin0204:Use,
AUTHOR="Oh-Soon Shin and Kwang Y. Lee",
TITLE="Use of multiple antennas for {DS/CDMA} code acquisition",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="621-625",
MONTH=apr,
YEAR=2002,
REFERENCES=10,
ABSTRACT="The effective use of multiple antennas is investigated for
code acquisition. A generalized acquisition scheme is proposed for
DS/CDMA systems with multiple antennas. The proposed scheme provides
means of a trade-off between two important factors determining the mean
acquisition time, which are referred to as combining gain and search
time, respectively. The performance of the proposed acquisition scheme
is analyzed in frequency-selective Rayleigh fading channels. In the
analysis, the effects of spatial fading correlations on acquisition
performance are considered. The mean acquisition time performance is
evaluated for various environments, and the configuration of multiple
antennas is investigated to reduce the mean acquisition time. The
effects of spatial correlation on mean acquisition time are also
investigated. The mean acquisition time is found to decrease
significantly as the number of antenna elements increases. It is found
that various parameters such as the number of antenna elements,
operating signal-to-interference ratio (SIR), and the number of
resolvable paths should be considered in determining configuration of
multiple antennas to reduce mean acquisition time.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996927.pdf?isNumber=21514\&prod=CNF\&arnumber=996927\&arSt=621\&ared=625+vol.1\&arAuthor=Oh-Soon+Shin\%3B+Kwang+Bok+Lee",
}

@INPROCEEDINGS{Yang0204:Wideband,
AUTHOR="Lie-Liang Yang and Lajos Hanzo",
TITLE="Performance of wideband {CDMA} using space-time spreading over
multipath Nakagami fading channels",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="626-630",
MONTH=apr,
YEAR=2002,
REFERENCES=7,
ABSTRACT="In this contribution the performance of wideband code-division
multiple-access (W-CDMA) systems using space-time spreading (STS) based
transmit diversity is investigated, when frequency-selective Nakagami-m
fading channels, multiuser interference and background noise are
considered. The analysis and numerical results suggest that significant
diversity gain can be achieved by employing several transmit antennas
or/and by combining several multipath components. Furthermore, both the
transmit diversity and the frequency-selective diversity appear to have
the same order of importance.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996928.pdf?isNumber=21514\&prod=CNF\&arnumber=996928\&arSt=626\&ared=630+vol.1\&arAuthor=Lie-Liang+Yang\%3B+Lajos+Hanzo",
}

@INPROCEEDINGS{Wu0204:Despreading,
AUTHOR="Xiaofu Wu and Cong Ling and Haige Xiang",
TITLE="Despreading chip waveform design for coherent delay-locked
tracking in {DS/SS} systems",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="631-635",
MONTH=apr,
YEAR=2002,
REFERENCES=3,
ABSTRACT="In this paper, the effect of unmatched despreading chip
waveforms for locally generated early and late despreading codes in a
coherent delay-locked loop (CDLL) for DS/SS systems is investigated.
Linear and nonlinear theories are employed to evaluate the performance
of the CDLL. Based on linear theory, optimum despreading chip waveforms
are pursued in the sense of minimizing root mean square (RMS) tracking
error with both time limited (full response) and time unlimited
constraints. Nonlinear analysis shows that the use of designed chip
waveforms reduces RMS tracking error and increase mean time to lose lock
(MTLL). Both rectangular and sinc chip pulse-shaping waveforms are
considered as two widely used examples. It is also found that the
designed despreading chip waveforms are optimized for any specified
early-late spacing.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996929.pdf?isNumber=21514\&prod=CNF\&arnumber=996929\&arSt=631\&ared=635+vol.1\&arAuthor=Xiaofu+Wu\%3B+Cong+Ling\%3B+Haige+Xiang",
}

@INPROCEEDINGS{Siwa0204:Improved,
AUTHOR="S. Siwamogsatham and Michael Fitz",
TITLE="Improved high-rate space-time codes via concatenation of expanded
orthogonal block code and {M-TCM}",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="636-640",
MONTH=apr,
YEAR=2002,
REFERENCES=22,
ABSTRACT="In this paper, we propose a new technique for designing an
improved high-rate space-time code. The proposed code construction is
based on a typical concatenation of a space-time block code and an outer
TCM/MTCM encoder. However, unlike the existing STB-MTCM schemes which
are rate-lossy, the proposed technique produces higher-rate space-time
codes by expanding the cardinality of the available orthogonal
space-time signal points before concatenating with an outer M-TCM
encoder. The set partitioning concept is then employed to realize large
coding gains. Here, we present design examples for the 2-transmitter and
3-transmitter cases. The new space-time codes considerably outperform
the existing designs. Furthermore, signal orthogonality is exploited to
keep decoding complexity of the proposed construction relatively low.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996930.pdf?isNumber=21514\&prod=CNF\&arnumber=996930\&arSt=636\&ared=640+vol.1\&arAuthor=Siwamogsatham\%2C+S.\%3B+Fitz\%2C+M.P.",
}

@INPROCEEDINGS{Zhan0204:Adaptive,
AUTHOR="Xiaoxia Zhang and Michael Fitz",
TITLE="An adaptive soft-output receiver in space-time coding with
continuous phase modulation",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="646-651",
MONTH=apr,
YEAR=2002,
REFERENCES=12,
ABSTRACT="Space-time coding has shown great promise for digital
transmission in wireless communication links, especially when the
channel response is known at the receiver. Combined with continuous
phase modulation (CPM), better bandwidth and power efficiency can be
obtained. But without the perfect channel state information, the high
performance of space-time CPM system can be greatly degraded due to the
channel estimation errors. In this paper we present an adaptive soft
algorithm which performs joint channel estimation and data detection for
space-time CPM system. Properly designed pilot symbols are inserted at
the very beginning to give a good initial estimate of the channels. This
soft demodulator is further applied to the interleaved space-time CPM
system to yield better performance with moderate complexity. Simulation
results show that the receiver can often achieve near-coherent
performance in quasi-static fading as well as in relatively fast
fading.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996932.pdf?isNumber=21514\&prod=CNF\&arnumber=996932\&arSt=646\&ared=651+vol.1\&arAuthor=Xiaoxia+Zhang\%3B+Fitz\%2C+M.P.",
}

@INPROCEEDINGS{Swin0204:Closed,
AUTHOR="A. L. Swindlehurst",
TITLE="Closed-form blind and semi-blind estimation of linear receivers
for space-time coding",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="652-657",
MONTH=apr,
YEAR=2002,
REFERENCES=17,
ABSTRACT="This paper exploits a special class of space-time codes in
which linearly transformed versions of a given data sequence are
transmitted from multiple antennas. Several recently proposed codes,
including space-time block codes, are members of this class. The
redundancy introduced by the transformations imposes structure on the
received data that under certain conditions can be exploited for direct
blind (and semi-blind) estimation of a linear zero-forcing receiver that
recovers the original data sequence. If the transmitted symbols are
constant modulus, the space-time code structure can be exploited by the
analytic constant modulus (ACM) algorithm to simplify the separation of
multiple co-channel users. If each user employs a different code or only
one user is present, the ACM joint diagonalization step can be
eliminated even though multiple constant modulus data streams are
received.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21514/00996933.pdf?isNumber=21514\&prod=CNF\&arnumber=996933\&arSt=652\&ared=657+vol.1\&arAuthor=Lee+Swindlehurst\%2C+A.",
}

@INPROCEEDINGS{Abde0204:Posteriori,
AUTHOR="F. Abdelkefi and Pierre Duhamel and Florence Alberge",
TITLE="A posteriori control of complex Reed Solomon decoding with
application to impulse noise cancellation in {HIPERLAN/2}",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="259-263",
MONTH=apr,
YEAR=2002,
REFERENCES=8,
ABSTRACT="In OFDM systems, pilot tones are emitted for synchronization
or channel estimation purposes. These pilot tones are generally
scattered among the information ones. Our approach is to use these pilot
tones as syndromes, in order to correct impulse noise. We previously
proposed (see Abdelkefi, F. et al., ISSPA, 2001) a decoding algorithm in
three steps: (1) estimate the amount of impulse noise; (2) seek the
location; (3) correct the errors. A protection subsystem was introduced
after the decoding operation in order to detect malfunction. Indeed, we
added a control step which is able to estimate carefully whether the
decoding procedure has worked correctly. We now explain this a
posteriori control which is based on the hypothesis test. This approach
is new in impulse noise cancellation in multicarrier transmission. The
efficiency of this technique is also corroborated with simulations in
the practical context of HIPERLAN/2.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996939.pdf?isNumber=21515\&prod=CNF\&arnumber=996939\&arSt=659\&ared=663+vol.2\&arAuthor=Abdelkefi\%2C+F.\%3B+Duhamel\%2C+P.\%3B+Alberge\%2C+F.",
}

@INPROCEEDINGS{Tosa0204:Simplified,
AUTHOR="F. Tosato and P. Bisaglia",
TITLE="Simplified soft-output demapper for binary interleaved {COFDM}
with application to {HIPERLAN/2}",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="664-668",
MONTH=apr,
YEAR=2002,
REFERENCES=8,
ABSTRACT="A comparison in the performance between hard- and
soft-decision Viterbi decoding, with application to the HIPERLAN/2
standard, is presented. The results show that when channel state
information (CSI) is included in the generation of the soft-decision
information, the soft-decision method greatly outperforms the hard
method. Moreover, a simplified algorithm for the soft-output demapper
for the 16-QAM and 64-QAM constellations is developed, which allows the
complexity of the demapper to be maintained at almost the same level for
all the possible modes of HIPERLAN/2.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996940.pdf?isNumber=21515\&prod=CNF\&arnumber=996940\&arSt=664\&ared=668+vol.2\&arAuthor=Tosato\%2C+F.\%3B+Bisaglia\%2C+P.",
}

@INPROCEEDINGS{Lahi0204:Battery,
AUTHOR="Kanishka Lahiri and A. Raghunathan and Subhrakanti Dey",
TITLE="Battery-efficient architecture for an 802.11 {MAC} processor",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="669-674",
MONTH=apr,
YEAR=2002,
REFERENCES=22,
ABSTRACT={Rapid growth in the complexity of wireless devices,
communication protocols, and applications, combined with slow
improvements in battery technologies, have created a "battery gap" that
is only projected to increase with advances in wireless communication
technologies and applications. Conventional approaches to bridging this
gap exploit low-power network protocols and handset architectures.
However, it is now well known that minimizing the total energy or
average power drawn from a battery does not necessarily lead to
maximizing battery life, calling for new battery-driven approaches to
protocol and hardware design. We present a battery-efficient
architecture for an 802.11 MAC processor, which incorporates a new
battery-driven approach to power management. The MAC processor employs a
novel on-chip bus architecture that is capable of regulating the profile
of the current drawn by the system, enabling battery discharge at high
efficiencies. The proposed battery friendly MAC processor architecture
enables significant increases in battery capacity and lifetime, while
minimizing performance impacts. Further, the developed architecture
provides mechanisms that allow for trade-offs between battery life and
performance, and can be configured to adapt the power management
techniques based on the network traffic characteristics.},
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996941.pdf?isNumber=21515\&prod=CNF\&arnumber=996941\&arSt=669\&ared=674+vol.2\&arAuthor=Lahiri\%2C+K.\%3B+Raghunathan\%2C+A.\%3B+Dey\%2C+S.",
}

@INPROCEEDINGS{Ozug0204:Optimal,
AUTHOR="Timucin Ozugur",
TITLE="Optimal {MAC-layer} fairness in 802.11 networks",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="675-681",
MONTH=apr,
YEAR=2002,
REFERENCES=10,
ABSTRACT="This paper covers the MAC sublayer fairness in the 802.11
networks. We first summarize the basic sublayer functionality specified
by the 802.11 DCF-MAC standard. Then, the modified time-based media
access method is proposed to provide an optimal fair access in any given
wireless topology. The modified time-based method is based on our
previously proposed time-based media access method. Although the
time-based method significantly eliminates the fairness problem, they
cannot provide the optimal fair access. By the introduction of the
modified time-based method, not only it provides the optimal fairness,
but also the need of estimating the weight factor is eliminated. The
modified and time-based methods require periodic link information from
the local neighboring stations. We also propose an information update
procedure to exchange link information using a polling mechanism to
employ the proposed method.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996942.pdf?isNumber=21515\&prod=CNF\&arnumber=996942\&arSt=675\&ared=681+vol.2\&arAuthor=Ozugur\%2C+T.",
}

@INPROCEEDINGS{Chen0204:Block,
AUTHOR="Sunder Hui Chen and Lajos Hanzo",
TITLE="Block-adaptive kernel-based {CDMA} multiuser detection",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="682-686",
MONTH=apr,
YEAR=2002,
REFERENCES=21,
ABSTRACT="The paper investigates the application of a recently
introduced learning technique, referred to as the relevance vector
machine (RVM), to construct a block-adaptive kernel-based nonlinear
multiuser detector (MUD) for direct-sequence code-division
multiple-access (DS-CDMA) signals transmitted through multipath
channels. It is demonstrated that the RVM MUD is capable of closely
matching the performance of the optimal Bayesian one-shot detector, with
the aid of a significantly more sparse kernel representation than that
required by the state-of-the-art support vector machine (SVM)
technique.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996943.pdf?isNumber=21515\&prod=CNF\&arnumber=996943\&arSt=682\&ared=686+vol.2\&arAuthor=Chen\%2C+S.\%3B+Hanzo\%2C+L.",
}

@INPROCEEDINGS{Buch0204:Stability,
AUTHOR="Robert Buche and H. J. Kushner",
TITLE="Stability and control of mobile communication systems with
time-varying channels",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="687-693",
MONTH=apr,
YEAR=2002,
REFERENCES=10,
KEYWORDS="power allocation; time allocation; time-varying channels;
non-markovian scaled system; perturbed liapunov function method",
ABSTRACT={The authors consider the forward link of a one-cell mobile
communications system with a single transmitter, a fixed number (K) of
mobiles, and randomly time-varying channels. Data arrives at the base in
some random way (which might have a bursty character) and is queued
according to the destination until transmitted. We consider CDMA with
control over the bit interval and power per bit, TDMA with control over
the time allocated, bit interval, and power per bit. The control problem
is the allocation of power and time to the K queues to assure stability
of the queues. The control decisions are made at the beginning of the
(small) scheduling intervals. The Liapunov function based stability
methods are used to determine time and power allocations. The system and
channel process are scaled by speed. Under a stability assumption on the
fluid model obtained from the "mean drift," and some other natural
conditions, it is shown that the scaled physical system can be
controlled to be stable, uniformly in the speed, for fast enough speeds.
Owing to the non-Markov nature of the problem, we use the perturbed
Liapunov function method in order to obtain the control allocations.
Each such function corresponds loosely to a performance criteria for
some optimization problem. Part of the power of the analysis is due to
the rather general conditions under which it works.},
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996944.pdf?isNumber=21515\&prod=CNF\&arnumber=996944\&arSt=687\&ared=693+vol.2\&arAuthor=Buche\%2C+R.\%3B+Kushner\%2C+H.J.",
}

@INPROCEEDINGS{Kafl0204:MC,
AUTHOR="P. L. Kafle and Abu B Sesay",
TITLE="On the performance of {MC-CDMA} with interleaved concatenated
coding and interference cancellation for high-rate data transmission",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="694-698",
MONTH=apr,
YEAR=2002,
REFERENCES=8,
ABSTRACT="A coded wideband MC-CDMA system is considered for
high-bit-rate data transmission in a typical outdoor environment with
Rayleigh multipath fading. First, two powerful interleaved concatenated
coding techniques, turbo and serially concatenated convolutional codes
(SCCC) codes are applied in the downlink system and important
conclusions are derived on their relative performance behavior in this
type of system. Simulation results indicate some of the relative merits
of SCCC on achieving very low error rates, with relative mitigation of
error floor behavior at the typical BER range of interest for wireless
data applications. Next, the more critical uplink system is considered,
which requires a multiuser detection technique in combination with
powerful coding to achieve similar performance. Successive interference
cancellation with SCCC coding is presented, with computation of optimal
log-likelihood ratios required for this type of interference
cancellation followed by SCCC decoding. Application of SCCC coding and
interference cancellation has improved the system performance
significantly even in the fully loaded case. Based on these results, the
combination of SCCC coding and successive cancellation is found to be
attractive for high-rate data transmission in the uplink MC-CDMA.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996945.pdf?isNumber=21515\&prod=CNF\&arnumber=996945\&arSt=694\&ared=698+vol.2\&arAuthor=Kafle\%2C+P.L.\%3B+Sesay\%2C+A.B.",
}

@INPROCEEDINGS{Chen0204:Enhanced,
AUTHOR="Wanshi Chen and Urbashi Mitra",
TITLE="An enhanced correlation matrix estimation scheme for blind
adaptive {MMSE} receiver",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="699-703",
MONTH=apr,
YEAR=2002,
REFERENCES=11,
ABSTRACT="An improved correlation matrix estimation scheme for blind
adaptive MMSE receivers for DS-CDMA communications was proposed by Chen
and Mitra (see IEEE Journal on Selected Areas on Communications, vol.19,
p.1531-43, 2001). Blind adaptive MMSE receivers with the estimation
scheme not only maintain the merit of robustness against fading, but
achieve performance comparable to the training-sequence based adaptive
MMSE receivers. This paper presents an enhanced version of the improved
correlation matrix estimation scheme for blind adaptive MMSE detection,
which results in a better convergence and tracking property and
noticeably improved performance than the original scheme of Chen and
Mitra. Theoretical analysis is performed for the flat fading case which
predicts the advantages of the new scheme. Detailed computer simulations
are also carried out to verify the performance of blind adaptive MMSE
receivers with the new estimation scheme.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996946.pdf?isNumber=21515\&prod=CNF\&arnumber=996946\&arSt=699\&ared=703+vol.2\&arAuthor=Wanshi+Chen\%3B+Mitra\%2C+U.",
}

@INPROCEEDINGS{Zhan0204:Correlated,
AUTHOR="Qinqing Zhang",
TITLE="Correlated Nakagami channels with different fading parameters: a
generic characterization with applications",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="704-708",
MONTH=apr,
YEAR=2002,
REFERENCES=7,
ABSTRACT="Appropriate description of correlated Nakagami (1960) channels
is indispensable to many applications in wireless communications such as
spatial diversity reception and RAKE receivers. Three essential
parameters for generic correlated Nakagami fading channels are
correlation, average power and fading parameter. The fading parameter
reflects the severity of the fading. The correlated model for
Nakagami-faded powers widely used in wireless communications, however,
is subject to a severe restriction requiring all fading parameters to be
identical. In wireless communications, the fading parameters of
different diversity branches can be different as the result of different
propagation conditions. We derive a generic characteristic function (CF)
for correlated Nakagami powered signals allowing all parameters to be
arbitrary. The application of the new theory is illustrated by studying
the error performance of an MPSK system with maximum ratio combining.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996947.pdf?isNumber=21515\&prod=CNF\&arnumber=996947\&arSt=704\&ared=708+vol.2\&arAuthor=Zhang\%2C+Q.T.",
}

@INPROCEEDINGS{Pop0204:Wide,
AUTHOR="M. F. Pop and Norman C. Beaulieu",
TITLE="Design of wide-sense stationary sum-of-sinusoids fading channel
simulators",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="709-716",
MONTH=apr,
YEAR=2002,
REFERENCES=15,
KEYWORDS="simulation; multipath channels; fading",
ABSTRACT={It was recently shown (see Pop, M.F. and Beaulieu, N.C., IEEE
Transactions Communication, 2001) that Jakes' sum-of-sinusoids Rayleigh
fading simulator (see Jakes, W.C., "Microwave Mobile Communications",
IEEE Press, 1994) is not wide-sense stationary when averaged across the
ensemble of physical fading channels. Here, a wide-sense stationary
sum-of-sinusoids simulator design is presented and its stochastic
behaviour is analyzed. Analytical expressions for the envelope and phase
probability density functions and the simulator output signal
autocorrelation function are given. These are used to obtain some design
rules that relate the quality of the simulator output to the number of
low-frequency oscillators, or equivalently sinusoids, used in the
simulator. Our results contradict a common belief that the quality of
the simulator output is related to the total number of multipath
components. Rather, the quality is shown to depend on the number of
distinct Doppler frequency shifts and it cannot be improved by using
more multipath components that do not represent distinct Doppler
frequency shifts.},
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996948.pdf?isNumber=21515\&prod=CNF\&arnumber=996948\&arSt=709\&ared=716+vol.2\&arAuthor=Pop\%2C+M.F.\%3B+Beaulieu\%2C+N.C.",
}

@INPROCEEDINGS{Chen0204:Optimal,
AUTHOR="Dongyan Chen and Yiguang Hong and K. S. Trivedi",
TITLE="Optimal estimation of training interval for channel
equalizations",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="717-721",
MONTH=apr,
YEAR=2002,
REFERENCES=13,
ABSTRACT="An optimal training equalization for wireless communication is
proposed and analyzed. By our scheme, the training of the equalizer is
carried out periodically, with the training interval optimized for a
maximal channel utilization. A closed-form expression for the optimal
training interval is derived via a semi-Markov process (SMP) which
requires knowledge of the channel equalization failure time
distribution. A statistical estimation algorithm is presented and
applied to adaptively estimate and track the optimal interval when the
failure time distribution is not available. Numerical results show that
by choosing the optimal training interval, the channel utilization can
be improved, and the statistical estimation algorithm can effectively
approach the optimal solution with a reasonable number of failure time
data points.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996949.pdf?isNumber=21515\&prod=CNF\&arnumber=996949\&arSt=717\&ared=721+vol.2\&arAuthor=Dongyan+Chen\%3B+Yiguang+Hong\%3B+Trivedi\%2C+K.S.",
}

@INPROCEEDINGS{Yu0204:Linear,
AUTHOR="Kevin Yu and Andrea Goldsmith",
TITLE="Linear models and capacity bounds for continuous phase
modulation",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="722-726",
MONTH=apr,
YEAR=2002,
REFERENCES=9,
ABSTRACT="We derive upper bounds on the capacity of an additive Gaussian
noise channel with continuous phase modulation (CPM). We propose an MMSE
approximation to Laurent's (1986) linear decomposition using an
arbitrary number of filtered, linearly modulated pulses. Using this
linear modulation structure, we derive capacity bounds for both white
and colored noise channels with CPM modulation by showing the system is
equivalent to a multiple access channel (MAC) with intersymbol
interference (ISI). The rate sum capacity of this cooperative MAC is
used for the upper bound. Numerical results are presented for a channel
using CPM with both white and colored noise. The bounds show a
significant gap between a channel using CPM and a channel with
unconstrained modulation.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996950.pdf?isNumber=21515\&prod=CNF\&arnumber=996950\&arSt=722\&ared=726+vol.2\&arAuthor=Yu\%2C+K.C.\%3B+Goldsmith\%2C+A.J.",
}

@INPROCEEDINGS{Sun0204:Blind,
AUTHOR="Wei Sun and Hongbin Li",
TITLE="Blind channel identification for multicarrier {CDMA} systems with
transmit diversity",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="727-731",
MONTH=apr,
YEAR=2002,
REFERENCES=14,
ABSTRACT="Uniting the strengths of multicarrier (MC) modulation and code
division multiple access (CDMA), MC-CDMA systems are of great interest
for future broadband transmissions. We consider the problem of channel
identification and signal detection/combining schemes for MC-CDMA
systems which are equipped with multiple transmit antennas and
space-time (ST) coding to provide transmit diversity gain to the
receiver. In particular, we present a subspace-based blind channel
identification algorithm for such systems. We extend several signal
combining schemes, including the maximum ratio combining (MRC) and the
equal gain combining (EGC), which are often utilized in conventional
single-transmit-antenna based MC-CDMA systems, to ST-coded MC-CDMA
(STC-MC-CDMA) systems. Numerical examples are presented to evaluate and
compare the proposed channel identification and signal combining
techniques.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996951.pdf?isNumber=21515\&prod=CNF\&arnumber=996951\&arSt=727\&ared=731+vol.2\&arAuthor=Wei+Sun\%3B+Hongbin+Li",
}

@INPROCEEDINGS{Hwan0204:Efficient,
AUTHOR="Keun Chul Hwang and Kwang Y. Lee",
TITLE="Efficient weight vector representation for closed-loop transmit
diversity",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="732-736",
MONTH=apr,
YEAR=2002,
REFERENCES=20,
ABSTRACT="For a closed-loop transmit (Tx) diversity, the Tx weights are
calculated at a receiver, and fed back to a transmitter. As the number
of Tx antennas increases, the potential gain of closed-loop Tx diversity
may be significant. However, the amount of feedback information linearly
increases, and the performance improvement of a closed-loop Tx diversity
system may not be as significant as expected due to delay in feedback
process. Thus, an efficient Tx weight representation, which can reduce
the amount of feedback information, is needed. A Tx weight vector
representation is presented, and its performance is analyzed.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996952.pdf?isNumber=21515\&prod=CNF\&arnumber=996952\&arSt=732\&ared=736+vol.2\&arAuthor=Keun+Chul+Hwang\%3B+Kwang+Bok+Lee",
}

@INPROCEEDINGS{Hued0204:Markovian,
AUTHOR="M. R. Hueda",
TITLE="On the Markovian approximation for block-errors in {DS-CDMA}
transmissions over slow fading channels with multicarrier transmit
diversity",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="737-741",
MONTH=apr,
YEAR=2002,
REFERENCES=11,
ABSTRACT="We show that block errors in multicarrier DS-CDMA (MC-CDMA)
systems with transmit diversity operating over slow fading channels are
accurately modeled by a Markov process. Although earlier contributions
have shown that packet transmission over radio channels can be modeled
by Markov processes, error models for DS-CDMA systems using multicarrier
transmit diversity, convolutional coding with soft-decision Viterbi
decoding, and RAKE diversity fingers with maximal ratio combining, have
not been reported so far. A major contribution of this work is a novel
method to estimate the parameters of the Markov model. Comparisons with
results of detailed simulations of the entire system confirm that this
is an excellent packet-level error model for MC-CDMA with transmit
diversity.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996953.pdf?isNumber=21515\&prod=CNF\&arnumber=996953\&arSt=737\&ared=741+vol.2\&arAuthor=Hueda\%2C+M.R.",
}

@INPROCEEDINGS{Zeka0204:Merging,
AUTHOR="Seyed Zekavat and Carl Nassar and S. Shattil",
TITLE="Merging {DS-CDMA} (with {CI} chip shapes) and oscillating-beam
smart antenna arrays: exploiting transmit diversity, frequency diversity
and directionality Merging {DS-CDMA} (with {CI} chip shapes) and
oscillating-beam smart antenna arrays: exploiting transmit div",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="742-747",
MONTH=apr,
YEAR=2002,
REFERENCES=13,
ABSTRACT="We merge a smart antenna array with CI/DS-CDMA, a novel
implementation of DS-CDMA where chips have a shape referred to as the CI
(carrier interferometry) chip shape and are decomposable into N
narrowband frequency components. In the antenna array, by applying
suitable time-varying phases to the elements, we create small movement
(oscillation) in the antenna array's pattern, while steering the main
lobe to the position of the intended user. The oscillating antenna
pattern creates a time-varying channel with a controllable coherence
time. This, in turn, provides transmit diversity in the form of a time
diversity gain at the mobile receiver side. Thus, at the receiver, three
stages of combining are available: 1) combining time components of the
received signal within symbol duration T/sub S/ (each experiencing a
different fade) to enhance performance via time diversity; 2) combining
frequency components which make up the CI/DS-CDMA chip to enhance the
performance via frequency diversity; 3) combining across chips to
eliminate interfering users. Employing CI/DS-CDMA with the proposed
smart antenna at the base station, we achieve: 1) very high capacity via
the merger of SDMA (directionality of antenna array) and CDMA; 2) very
high performance via the construction of receivers that exploit both
transmit diversity and frequency diversity. We focus on the performance
benefits of the proposed system.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996954.pdf?isNumber=21515\&prod=CNF\&arnumber=996954\&arSt=742\&ared=747+vol.2\&arAuthor=Zekavat\%2C+S.A.\%3B+Nassar\%2C+C.R.\%3B+Shattil\%2C+S.",
}

@INPROCEEDINGS{Welb0204:Importance,
AUTHOR="Matt Welborn and J. McCorkle",
TITLE="The importance of fractional bandwidth in ultra-wideband pulse
design",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="753-757",
MONTH=apr,
YEAR=2002,
REFERENCES=6,
ABSTRACT="Ultra-wideband (UWB) communications systems provide extremely
high data rates while using low transmit power relative to narrowband
systems. Previous research concludes that such systems have
characteristics that make them appropriate for high-speed wireless
network applications. One of the distinguishing aspects of the UWB
signal is an extremely high fractional bandwidth when compared with
conventional narrowband systems. This paper describes how a large
fractional bandwidth leads to lower worst-case fading in the presence of
multipath for UWB communications systems, thereby providing a
significant advantage for a low-power wireless systems. Also included
are measurements made using an actual UWB communications systems showing
the magnitude of signal strength variations due to multipath
interference.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996956.pdf?isNumber=21515\&prod=CNF\&arnumber=996956\&arSt=753\&ared=757+vol.2\&arAuthor=Welborn\%2C+M.\%3B+McCorkle\%2C+J.",
}

@INPROCEEDINGS{Yang0204:Multistage,
AUTHOR="Lie-Liang Yang and Lajos Hanzo",
TITLE="Multistage frequency-hopping assisted ultra-wideband
multiple-access communications",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="748-752",
MONTH=apr,
YEAR=2002,
ABSTRACT="Ultra-wideband (UWB) systems having a bandwidth on the order
of a Gigahertz have received wide attention both in the USA and in
Europe. A novel UWB multiple access scheme based on the well-known
family of frequency-hopping multiple access (FHMA) techniques is
proposed, where the associated FH is implemented using multistage
frequency hopping multiple access, or MS/UWB FHMA. We highlight the
principles of the proposed MS/UWB FHMA communication system, investigate
the associated spectrum assignment, the FH strategy, the applicable
signal detection schemes as well as the achievable bit error rate (BER)
performance. Our study shows that MS/UWB FHMA is capable of supporting
an extremely high number of users, while employing relatively simple
receivers.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996955.pdf?isNumber=21515\&prod=CNF\&arnumber=996955\&arSt=748\&ared=752+vol.2\&arAuthor=Lie-Liang+Yang\%3B+Hanzo\%2C+L.http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996955.pdf?isNumber=21515\&prod=CNF\&a",
}

@INPROCEEDINGS{Huan0204:Performances,
AUTHOR="Xiaojing Huang and Yunxin Li",
TITLE="Performances of impulse train modulated ultra-wideband systems",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="758-762",
MONTH=apr,
YEAR=2002,
REFERENCES=14,
ABSTRACT="This paper analyzes the performances of three impulse train
modulated ultra-wideband (UWB) communications systems in an additive
white Gaussian noise (AWGN) channel. First, the mathematical models for
describing biphase, pulse position and hybrid modulated ultra-wideband
signals are developed and the decision rules for detecting them with
only AWGN interference are proposed. Then, the exact formulae of the bit
error probabilities of these UWB systems and their closed-form
approximations are derived. Finally, the derived formulae are applied to
optimize the modulation parameter of a Gaussian monocycle UWB impulse
radio.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996957.pdf?isNumber=21515\&prod=CNF\&arnumber=996957\&arSt=758\&ared=762+vol.2\&arAuthor=Xiaojing+Huang\%3B+Yunxin+Li",
}

@INPROCEEDINGS{Cass0204:Low,
AUTHOR="Dajana Cassioli and Moe Win and Francesco Vatalaro and Andreas
Molisch",
TITLE="Performance of low-complexity {RAKE} reception in a realistic
{UWB} channel",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="763-767",
MONTH=apr,
YEAR=2002,
REFERENCES=19,
ABSTRACT="We evaluate the link performance of an ultra-wide band (UWB)
system using reduced-complexity RAKE receivers, which are based on
either partial combining (called PRAKE) or selective combining (called
SRAKE). The first is suboptimum and combines the first arriving
multipath components, while the second combines the strongest multipath
components. We use a statistical tapped-delay-line channel model that is
based on extensive measurement campaigns, and reflects both small-scale
and large-scale variations of the channel. Through semi-analytical
evaluations of the bit error probability, we show that the simpler PRAKE
receiver is almost as good as the SRAKE even for a small number of
fingers. We show how this behavior can be related to the channel
characteristics.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996958.pdf?isNumber=21515\&prod=CNF\&arnumber=996958\&arSt=763\&ared=767+vol.2\&arAuthor=Cassioli\%2C+D.\%3B+Win\%2C+M.Z.\%3B+Vatalaro\%2C+F.\%3B+Molisch\%2C+A.F.",
}

@INPROCEEDINGS{Jean0204:Source,
AUTHOR="M. Jeanne and J. C. Carlach and Pierre Siohan and L. Guivarch",
TITLE="Source and joint source-channel decoding of variable length
codes",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="768-772",
MONTH=apr,
YEAR=2002,
REFERENCES=9,
ABSTRACT="Several publications have shown that joint source-channel
decoding (JSCD) could be a powerful technique for taking advantage of
residual source redundancy. Furthermore, it appeared that the principle
could also be successfully applied to variable length codes (VLCs). This
paper gives an in-depth analysis of a new method proposed by Guivarch,
Carlach and Siohan (see Data Compression Conference (DCC), Snowbird,
Utah, USA, Mar. 2000, p.83-92) and Guivarch, Siohan and Carlach (see
International Communication Conference (ICT), Acapulco, Mexico, May
2000, p.872-76) to provide a low complexity soft decoding of VLCs with
and without channel coding. Furthermore we also present new results
obtained in a video coding context, using a VLC table from the MPEG4
video standard. Compared to separated decoding systems, the gain in
signal to noise ratio varies from 0.3 dB up to 2 dB.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996959.pdf?isNumber=21515\&prod=CNF\&arnumber=996959\&arSt=768\&ared=772+vol.2\&arAuthor=Jeanne\%2C+M.\%3B+Carlach\%2C+J.C.\%3B+Siohan\%2C+P.\%3B+Guivarch\%2C+L.",
}

@INPROCEEDINGS{Wang0204:Turbo,
AUTHOR="Chia-Jiu Wang and D. J. Sklar",
TITLE="Performance of a turbo coded system with {DPSK} modulation using
enhanced decoding metrics and matched channel side information",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="773-777",
MONTH=apr,
YEAR=2002,
REFERENCES=7,
ABSTRACT="The classical turbo decoding algorithm is based on the
assumption that the input sequence to the decoder has been disturbed by
a noise process that has a Gaussian distribution. For a DPSK waveform,
the output statistics of a differentially coherent demodulator is
nonGaussian. When this sequence is fed directly into the turbo decoder,
particularly under a fading environment, the mismatch between decoder
algorithm assumptions and actual input statistics can result in
significant decoder performance degradation. This paper investigates the
bit error performance for such a mismatch for the DPSK waveform.
Techniques for forming enhanced turbo-decoding metrics with biased
channel side information (CSI) are proposed. Using these new metrics,
error performance in fading conditions is shown to improve
significantly.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996960.pdf?isNumber=21515\&prod=CNF\&arnumber=996960\&arSt=773\&ared=777+vol.2\&arAuthor=Wang\%2C+C.C.\%3B+Sklar\%2C+D.J.",
}

@INPROCEEDINGS{Wu0204:Optimal,
AUTHOR="Yao-Jun Wu and H. Ogiwara",
TITLE="Optimal design of trellis coded quantization based on reliability
information of turbo trellis coded modulation",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="778-782",
MONTH=apr,
YEAR=2002,
REFERENCES=12,
ABSTRACT="Turbo trellis-coded modulation (TCM) with code matched
interleaver (CMI) is applied to develop a trellis coded quantization
(TCQ). It can been shown that TCQ of memoryless Gaussian sources results
in substantial improvement of performance with iterative decoding of
turbo TCM and iterative optimization of minimum overall distortion
between the source input and decoding output. Numerical results indicate
substantial improvement of performance because optimal TCQ based on
turbo TCM can be achieved at moderate to high signal-to-noise ratio
(SNR) on an additive white Gaussian noise (AWGN) channel for a
memoryless Gaussian source and a memoryless uniform source.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996961.pdf?isNumber=21515\&prod=CNF\&arnumber=996961\&arSt=778\&ared=782+vol.2\&arAuthor=Yao-Jun+Wu\%3B+Ogiwara\%2C+H.",
}

@INPROCEEDINGS{Perr0204:Huffman,
AUTHOR="L. Perros-Meilhac and Catherine Lamy-Bergot",
TITLE="Huffman tree based metric derivation for a low-complexity
sequential soft {VLC} decoding",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="783-787",
MONTH=apr,
YEAR=2002,
REFERENCES=15,
ABSTRACT={This paper considers VLC decoding algorithms based on MAP
sequence estimation techniques, using residual source redundancy to
provide channel error correction. These algorithms rely on soft values
available at the entrance of the VLC decoder. We present a new soft VLC
decoding algorithm based on a sequential decoding technique that is very
efficient in terms of decoding complexity. The application of the
considered soft decoding algorithms to practical decoding of MPEG-4
texture information packets under the assumption of an unequal
protection scheme is investigated. The algorithm performance is
evaluated on the well-known "Foreman" video sequence. Simulation results
show that the proposed algorithm provides approximately the same
performance as all existing soft decoding algorithms while exhibiting a
significantly lower complexity.},
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996962.pdf?isNumber=21515\&prod=CNF\&arnumber=996962\&arSt=783\&ared=787+vol.2\&arAuthor=Perros-Meilhac\%2C+L.\%3B+Lamy\%2C+C.",
}

@INPROCEEDINGS{Ling0204:Linear,
AUTHOR="Cong Ling and Xiaofu Wu",
TITLE="Linear prediction receiver for differential space-time modulation
over time-correlated Rayleigh fading channels",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="788-791",
MONTH=apr,
YEAR=2002,
REFERENCES=14,
ABSTRACT="Space-time codes increase the transmission rate of a
communication system in fading channels significantly. The decoding of
space-time codes generally depends on perfect channel estimation.
Differential space-time modulation (DSTM) can work, in a noncoherent
manner, over continuously fading channels. However, it exhibits an
irreducible error floor in time-correlated fading channels. The impact
of correlated Rayleigh fading on DSTM is investigated, and a
decision-feedback linear prediction receiver for DSTM is presented.
Computer simulations show that the linear prediction receiver reduces
the error floor substantially.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996963.pdf?isNumber=21515\&prod=CNF\&arnumber=996963\&arSt=788\&ared=791+vol.2\&arAuthor=Cong+Ling\%3B+Xiaofu+Wu",
}

@INPROCEEDINGS{Al0204:Blind,
AUTHOR="A. K. S. Al-Bayati and S. Prakriya and Sushil Prasad",
TITLE="Blind space-time constrained minimum variance detection of
{DS/CDMA} signals",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="792-796",
MONTH=apr,
YEAR=2002,
REFERENCES=10,
ABSTRACT="Constrained minimum variance (CMV) detection has been proposed
for blind multiuser detection of DS/CDMA signals in multipath channels.
We suggest a new approach for implementing the CMV detection when an
antenna array is used at the receiver. A simple technique is used for
restricting the domain of the CMV detector to a smaller subspace based
on signals directions of arrivals (DOAs), in a beamformer-like
formulation. The proposed technique requires prior knowledge of only the
timing of the desired user's signal. It is seen that the proposed
subspace restriction is useful for accurate path DOA estimation followed
by efficient data detection in heavily loaded systems and over small
block sizes of the input signal. This makes this method suitable for
slowly time varying channels.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996964.pdf?isNumber=21515\&prod=CNF\&arnumber=996964\&arSt=792\&ared=796+vol.2\&arAuthor=Al-Bayati\%2C+A.K.S.\%3B+Prakriya\%2C+S.\%3B+Prasad\%2C+S.",
}

@INPROCEEDINGS{Scho0204:Noncoherent,
AUTHOR="Robert Schober and P. S. Pasupathy",
TITLE="Noncoherent space-time equalization",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="797-801",
MONTH=apr,
YEAR=2002,
REFERENCES=12,
ABSTRACT="In this paper, noncoherent equalization is combined with
multiple receive antennas. The resulting noncoherent space-time
equalization (NSTE) schemes are analyzed and compared with the
corresponding coherent receivers. In particular, noncoherent linear
equalization (NLE) and noncoherent decision-feedback equalization (NDFE)
are considered. For both NLE and NDFE novel approximations for the
signal-to-distortion ratio (SDR) are given and verified by simulations.
It is shown that NSTE can suppress interfering users and exploit
diversity as effectively as coherent STE. However, NSTE is more robust
against channel phase variations than coherent STE combined with
synchronization.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996965.pdf?isNumber=21515\&prod=CNF\&arnumber=996965\&arSt=797\&ared=801+vol.2\&arAuthor=Schober\%2C+R.\%3B+Pasupathy\%2C+P.S.",
}

@INPROCEEDINGS{Sime0204:Multi,
AUTHOR="Osvaldo Simeone and Umberto Spagnolini",
TITLE="Multi-slot estimation of space-time channels",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="802-806",
MONTH=apr,
YEAR=2002,
REFERENCES=7,
ABSTRACT="In mobile communications, the multipath space-time channel has
some fast-varying (faded amplitudes of the paths) and slowly-varying
(delays and directions of arrival) features. We propose to estimate the
channel from limited-length training sequences by exploiting these
different varying rates without explicitly computing delays and
directions of arrival. Therefore, the multi-slot channel estimate is
composed of two terms: the slowly-varying space-time bases estimated
from L consecutive slots and the fast-varying amplitudes estimated on a
slot-by-slot basis. Performance analysis and simulations confirm the
expected benefits of the multi-slot approach and demonstrate that for
large L the mean square error (MSE) on the channel estimate depends only
on the number of fast-varying parameters.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996966.pdf?isNumber=21515\&prod=CNF\&arnumber=996966\&arSt=802\&ared=806+vol.2\&arAuthor=Simeone\%2C+O.\%3B+Spagnolini\%2C+U.",
}

@INPROCEEDINGS{Yang0204:Block,
AUTHOR="Liuqing Yang and Georgios Giannakis",
TITLE="Block-spreading codes for impulse radio multiple access through
{ISI} channels",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="807-811",
MONTH=apr,
YEAR=2002,
REFERENCES=12,
ABSTRACT="Transmitting digital information using ultra-short pulses,
impulse radio (IR) has received increasing interest for multiple access
(MA). Analog IRMA utilizes pulse-position modulation (PPM) and random
time-hopping codes to mitigate inter-symbol interference (ISI) and
suppress multiuser interference (MUI) statistically. We develop an
all-digital IRMA scheme that relies on block-spreading and judiciously
designed transceiver pairs to eliminate MUI deterministically, and
regardless of ISI multipath effects.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996967.pdf?isNumber=21515\&prod=CNF\&arnumber=996967\&arSt=807\&ared=811+vol.2\&arAuthor=Liuqing+Yang\%3B+Giannakis\%2C+G.B.",
}

@INPROCEEDINGS{Yoon0204:Optimum,
AUTHOR="Young Yoon and Ryuji Kohno",
TITLE="Optimum multi-user detection in ultra-wideband {(UWB)}
multiple-access communication systems",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="812-816",
MONTH=apr,
YEAR=2002,
REFERENCES=16,
ABSTRACT="This paper investigates multi-user detection in
multiple-access communication systems based on ultrawideband (UWB)
technology. As user numbers increase and the bandwidth to pulse
repetition frequency (PRF) decreases, multiple-access interference (MAI)
is expected to adversely affect system capacity and performance. The
paper presents a framework for the design of multi-user detectors and
proposes the optimum multi-user detector for UWB. Numerical examples
illustrate the performance of the optimum detector versus that of the
conventional single-user UWB detector.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996968.pdf?isNumber=21515\&prod=CNF\&arnumber=996968\&arSt=812\&ared=816+vol.2\&arAuthor=Yoon\%2C+Y.C.\%3B+Kohno\%2C+R.",
}

@INPROCEEDINGS{Iaco0204:Multiple,
AUTHOR="M. S. Iacobucci and M.-G. Di Benedetto",
TITLE="Multiple access design for impulse radio communication systems",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="817-820",
MONTH=apr,
YEAR=2002,
REFERENCES=4,
ABSTRACT="We address the problem of designing time hopping codes for
impulse radio multiple access communication systems. Time hopping
techniques are first reviewed, including a new code that Iacobucci and
Di Benedetto (see Proc. International Symposium 3G Infrastructure and
Services, Athens, Greece,July 200) proposed for time hopping, and
performance in terms of cyclic correlation properties are given.
Advantages and disadvantages of different time hopping codes in terms of
resource assignment for multiple access communication systems are
analyzed and discussed.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996969.pdf?isNumber=21515\&prod=CNF\&arnumber=996969\&arSt=817\&ared=820+vol.2\&arAuthor=Iacobucci\%2C+M.S.\%3B+Di+Benedetto\%2C+M.-G.",
}

@INPROCEEDINGS{Guo0204:Wavelet,
AUTHOR="Dong Guo and Xiaodong Wang and Rong Chen",
TITLE="Wavelet-based sequential Monte Carlo blind receivers in fading
channels with unknown channel statistics",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="821-825",
MONTH=apr,
YEAR=2002,
REFERENCES=7,
ABSTRACT="An adaptive Bayesian receiver for blind detection in
flat-fading channels was developed in Chen et al. (2000), based on the
sequential Monte Carlo methodology. That work is built on a parametric
modelling of the fading process in the form of a state-space model, and
assumes the knowledge of the second-order statistics of the fading
channel. In this paper, we develop a nonparametric approach to the
problem of blind detection in fading channels, without assuming any
knowledge of the channel statistics. The basic idea is to decompose the
fading process using a wavelet basis, and to use the sequential Monte
Carlo technique to track both the wavelet coefficients and the
transmitted symbols. A novel resampling-based wavelet shrinkage
technique is proposed to dynamically choose the number of wavelet
coefficients to best fit the fading process. Under such a framework,
blind detectors for flat-fading channels are developed. Simulation
results are provided to demonstrate the excellent performance of the
proposed blind adaptive receivers.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996970.pdf?isNumber=21515\&prod=CNF\&arnumber=996970\&arSt=821\&ared=825+vol.2\&arAuthor=Dong+Guo\%3B+Xiaodong+Wang\%3B+Rong+Chen",
}

@INPROCEEDINGS{Frag0204:Effect,
AUTHOR="Christina Fragouli and Naofal Al-Dhahir and William Turin",
TITLE="Effect of spatio-temporal channel correlation on the performance
of space-time codes",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="826-830",
MONTH=apr,
YEAR=2002,
REFERENCES=8,
ABSTRACT="The determinant and rank criteria used for space-time code
design apply at high SNR. Code design metrics developed for low SNR
assume a channel autocorrelation matrix with equal eigenvalues, which
does not hold in many practical scenarios. This paper shows that a
space-time code designed to ensure full diversity at high SNR can suffer
significant degradation when implemented at low-to-medium SNR because of
the channel autocorrelation profile. We examine the effect of the
channel autocorrelation matrix on a space-time code's performance and
discuss how knowledge of this matrix can be used for code design,
particularly from the aspect of space-time trellis code minimum memory
requirements. Our discussion applies to both flat-fading and
frequency-selective channels that are treated in a unified manner.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996971.pdf?isNumber=21515\&prod=CNF\&arnumber=996971\&arSt=826\&ared=830+vol.2\&arAuthor=Fragouli\%2C+C.\%3B+Al-Dhahir\%2C+N.\%3B+Turin\%2C+W.",
}

@INPROCEEDINGS{Holl0204:Optimal,
AUTHOR="T. Holliday and Andrea Goldsmith",
TITLE="Optimal power control and source-channel coding for delay
constrained traffic over wireless channels",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="831-835",
MONTH=apr,
YEAR=2002,
REFERENCES=12,
ABSTRACT="A novel dynamic programming formulation is proposed for
computing optimal power control, source coding, and channel coding
policies when the source traffic has tight delay constraints. Our
solution minimizes power consumption subject to constraints on delay for
all channel gains. This provides a much tighter delay bound than an
average delay constraint, averaged over time varying channel gains. We
present numerical results that show the tighter delay constraints come
at a significant cost in terms of power consumption. However, we also
show this power penalty can be greatly mitigated through optimal
source-channel coding.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996972.pdf?isNumber=21515\&prod=CNF\&arnumber=996972\&arSt=831\&ared=835+vol.2\&arAuthor=Holliday\%2C+T.\%3B+Goldsmith\%2C+A.",
}

@INPROCEEDINGS{Desa0204:Unequal,
AUTHOR="V. Desai and Brian Classon and Y. W. Blankenship and J. D.
Johnson",
TITLE="Unequal error protection design using convolutional codes",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="836-840",
MONTH=apr,
YEAR=2002,
REFERENCES=7,
ABSTRACT="The introduction of adaptive multi-rate (AMR) speech coders in
wireless standards, such as GSM, imposes new challenges for forward
error correction (FEC) design. Traditional FEC techniques of providing
unequal error protection (UEP) may not maximize performance for a given
set of design requirements, such as complexity limits. This paper
introduces a new FEC technique that improves error correction
performance while satisfying complexity constraints. This technique is
applied to the new wideband AMR standard for a performance and
complexity comparison.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996973.pdf?isNumber=21515\&prod=CNF\&arnumber=996973\&arSt=836\&ared=840+vol.2\&arAuthor=Desai\%2C+V.\%3B+Classon\%2C+B.\%3B+Blankenship\%2C+Y.W.\%3B+Johnson\%2C+J.",
}

@INPROCEEDINGS{Boch0204:SIR,
AUTHOR="Holger Boche and Martin Schubert",
TITLE="{SIR} balancing for multiuser downlink beamforming - a
convergence analysis",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="841-845",
MONTH=apr,
YEAR=2002,
REFERENCES=11,
ABSTRACT="The downlink spectral efficiency of interference limited
wireless systems can be drastically increased by employing multiuser
transmit beamforming at the base station. The goal is the joint
optimization of the user transmission powers and the beamforming
weights. An important problem is to find the range where a feasible
solution can be expected. Recently, it has been shown (see Boche, H. and
Schubert, M., European Transactions on Telecom., vol.12, no.5, p.417-26,
2001) that this problem is equivalent to the minimization of the maximum
eigenvalue of the system coupling matrix. An iterative scheme to solve
this min-max type problem was proposed by G. Montalbano and D.T.M. Slock
(see Proc. IEEE ICUPC, 1998), but no convergence analysis was given. We
analyze the convergence behavior of the algorithm and extend the results
to the more general case of individual QoS requirements. It is shown
that the iteration sequence is strictly monotonically decreasing as long
as the global optimum is not reached. This proves the optimality of the
algorithm and provides valuable insight into the analytical structure of
the problem.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996974.pdf?isNumber=21515\&prod=CNF\&arnumber=996974\&arSt=841\&ared=845+vol.2\&arAuthor=Boche\%2C+H.\%3B+Schubert\%2C+M.",
}

@INPROCEEDINGS{Abra0204:MLSE,
AUTHOR="Andrea Abrardo",
TITLE="Non-coherent {MLSE} detection for {CDMA} multiple-antenna
systems",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="846-850",
MONTH=apr,
YEAR=2002,
REFERENCES=9,
KEYWORDS="mlse non-coherent detection; antenna arrays; ds-cdma systems",
ABSTRACT="Non-coherent detection of DS-CDMA signals which make use of
M-DPSK modulation in presence of antenna arrays is considered. Firstly,
the optimum non-coherent MLSE detection rule is derived for a K
dimension DS-CDMA vectorial channel assuming perfect single-user
beamforming. Then, in order to exploit the advantages of non-coherent
detection fully, a detector which dispenses with array vector estimation
is derived. Simulation results show that both the proposed non-coherent
detectors succeed in noticeably improving performance by means of
antenna arrays. In particular, for the second proposed scheme, this
performance improvement can be achieved without any channel state
estimation, thus resulting in a fully incoherent detection.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996975.pdf?isNumber=21515\&prod=CNF\&arnumber=996975\&arSt=846\&ared=850+vol.2\&arAuthor=Abrardo\%2C+A.",
}

@INPROCEEDINGS{Baum0204:Downlink,
AUTHOR="Thomas Baumgartner and Thomas Neubauer and Ernst Bonek",
TITLE="Performance of downlink beam switching for {UMTS} {FDD} in the
presence of angular spread",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="851-855",
MONTH=apr,
YEAR=2002,
REFERENCES=14,
ABSTRACT="We present a simple beam switching scheme to increase the
downlink capacity of the UMTS FDD-mode. At the base station, this method
only requires one additional transceiver chain, i.e. a separate one for
each beam, a beamforming network and a uniform linear array. The mobiles
need no changes at all. We analyze the performance of our method by
means of system level simulations for different angular spreads. We
found an increase in downlink capacity of more than 75\% over a
conventional 3-sectored system for small direction of departure spreads.
Compared to a 6-sectored system our scheme gives a capacity gain of more
than 25\% for small direction of departure spreads.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996976.pdf?isNumber=21515\&prod=CNF\&arnumber=996976\&arSt=851\&ared=855+vol.2\&arAuthor=Baumgartner\%2C+T.\%3B+Neubauer\%2C+T.\%3B+Bonek\%2C+E.",
}

@INPROCEEDINGS{Ma0204:Accurate,
AUTHOR="Yao Ma and Qinqing Zhang and Subbarayan Pasupathy",
TITLE="Accurate evaluation for M-phase signaling over arbitrary
correlated fading channels",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="856-860",
MONTH=apr,
YEAR=2002,
REFERENCES=13,
KEYWORDS="m-ary phase shift keying (mpsk); mdpsk; rician and nakagami
channels; error probability; multichannel diversity",
ABSTRACT="The central issue to the error probability analysis of M-phase
signaling is to determine the phase distribution of the received signal.
In this paper, we take a novel approach by formulating the phase
distribution in terms of joint moment generating functions (MGFs) of the
real and imaginary parts of the decision variable at the receiver
output. We further derive fast convergent formulas by using the
two-dimensional (2-D) inverse Laplace transform enabling us to
accurately evaluate the phase distribution. The new technique is very
general, taking into account the effects of arbitrary diversity order,
symbol alphabet size M, and arbitrary diversity branch correlation.
Numerical results are also presented for illustration.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996977.pdf?isNumber=21515\&prod=CNF\&arnumber=996977\&arSt=856\&ared=860+vol.2\&arAuthor=Yao+Ma\%3B+Zhang\%2C+Q.T.\%3B+Pasupathy\%2C+S.",
}

@INPROCEEDINGS{Zhan0204:Multiuser,
AUTHOR="Yingjun Zhang and Khaled Ben Letaief",
TITLE="Multiuser subcarrier and bit allocation along with adaptive cell
selection for {OFDM} transmission",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="861-865",
MONTH=apr,
YEAR=2002,
REFERENCES=7,
ABSTRACT="A dynamic multiuser subcarrier-and-bit allocation algorithm
with low computational complexity for wideband OFDM downlink
transmission is proposed to exploit the multiuser diversity in this
paper. Our objective is to maximize the overall spectral efficiency in
terms of the number of bits per subcarrier while simultaneously
satisfying the requirements on each user's data rate, bit error rate
(BER), and the total transmit power. Our results show that the proposed
dynamic subcarrier-and-bit allocation algorithm offers about 6 dB
performance gain over OFDM using adaptive modulation with fixed
subcarrier allocation. Since outages may occur when users happen to be
located near the boundary of the cell, a novel adaptive cell selection
scheme is proposed to further reduce the probability of outage. Our
results show that the probability of outage can be reduced by one order
of magnitude.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996978.pdf?isNumber=21515\&prod=CNF\&arnumber=996978\&arSt=861\&ared=865+vol.2\&arAuthor=Yingjun+Zhang\%3B+Letaief\%2C+K.B.",
}

@INPROCEEDINGS{Shar0204:New,
AUTHOR="Masoud Sharif and M. Gharavi-Alkhansari and B. Khalaj",
TITLE="New results on the peak power of {OFDM} signals based on
oversampling",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="866-871",
MONTH=apr,
YEAR=2002,
REFERENCES=15,
ABSTRACT="In this paper, we introduce a new bound for the peak of the
continuous envelope of an OFDM signal based on the maximum of its
corresponding oversampled sequence, that is considerably tighter than
the recent results presented in Sharif and Khalaj (2001). The proposed
bound is then used as the basis of our study in two parts. In the first
part, we find an upper bound for the regrowth of the peak of the
digitally clipped oversampled sequence after discrete to continuous
conversion. We also show that for oversampling rates greater than /spl
pi///spl radic/2, the peak regrowth percentage depends only on
oversampling rate, regardless of the number of subcarriers. In the
second part, we propose new and tight relative error bounds for
computation of the peak power using two main methods: the oversampled
inverse fast Fourier transform (IFFT) and the method introduced for
coded systems by Tarokh and Jafarkhani (2000).",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996979.pdf?isNumber=21515\&prod=CNF\&arnumber=996979\&arSt=866\&ared=871+vol.2\&arAuthor=Sharif\%2C+M.\%3B+Gharavi-Alkhansari\%2C+M.\%3B+Khalaj\%2C+B.H.",
}

@INPROCEEDINGS{Nata0204:Novel,
AUTHOR="Balasubramaniam Natarajan and Carl Nassar and Steve Shattil",
TITLE="Novel multi-carrier implementation of {FSK} for bandwidth
efficient, high performance wireless systems",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="872-876",
MONTH=apr,
YEAR=2002,
REFERENCES=11,
ABSTRACT="In traditional BFSK, two distinct carrier frequencies are used
to represent binary '1' and binary '0'. In this paper, we propose
transmitting multiple, orthogonal, in-phase sub-carriers around two
carrier frequencies to represent the binary information. We demonstrate
that this technique is spectrally efficient when compared to traditional
BFSK. Performance and data rate benefits are also demonstrated in both
non-coherent and novel coherent reception techniques. Moreover, while
traditional BFSK is not employed in channels that are frequency
selective, we show that with coherent reception, the new FSK scheme can
be used in frequency selective channels to exploit frequency diversity
benefits.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996980.pdf?isNumber=21515\&prod=CNF\&arnumber=996980\&arSt=872\&ared=876+vol.2\&arAuthor=Natarajan\%2C+B.\%3B+Nassar\%2C+C.R.\%3B+Shattil\%2C+S.",
}

@INPROCEEDINGS{Webe0204:Multi,
AUTHOR="K. Weber and W. Skones and R. Harnden and C. Talbott and M.
Keller and Kenneth Johnson and David Martin and M. Kintis",
TITLE="A multi-carrier base station receiver using a delta-sigma
oversampling {A/D} converter",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="877-881",
MONTH=apr,
YEAR=2002,
REFERENCES=5,
ABSTRACT="This paper presents the results of work at TRW in developing a
multi-carrier receiver for cellular base station applications. Replacing
existing single carrier receivers with a multi-carrier receiver has the
potential to significantly increase the capacity of existing mobile
phone networks and reduce the cost per carrier. Implementation of a
multi-carrier receiver has been limited by the large dynamic range
requirements for GSM/EDGE and WCDMA standards, with the GSM 900 MHz band
presenting the greatest challenge. TRW is leveraging several proprietary
technologies that enable and facilitate this development, including the
latest product in a series of high performance analog-to-digital
converters (ADCs). The stressing requirements for very high dynamic
range (up to 108 dB SNR), wide bandwidth, and high linearity are met by
employing a delta-sigma ADC that redefines the state-of-the-art. TRW's
world-class InP process is used to fabricate devices capable of the high
level of oversampling needed to satisfy the demanding performance
values. We describe the receiver architecture and present preliminary
test results from our first engineering model, demonstrating the
practicality of a multi-carrier receiver for cellular base stations.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996981.pdf?isNumber=21515\&prod=CNF\&arnumber=996981\&arSt=877\&ared=881+vol.2\&arAuthor=Weber\%2C+K.B.\%3B+Skones\%2C+W.\%3B+Harnden\%2C+R.\%3B+Talbott\%2C+C.\%3B+Keller\%2C+M.\%3B+Johnson\%2C+K.\%3B+Martin\%2C+D.R.\%3B+",
}

@INPROCEEDINGS{Jant0204:Power,
AUTHOR="R. Jantti and Seong-Lyun Kim",
TITLE="Power control with partially known link gain matrix",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="882-886",
MONTH=apr,
YEAR=2002,
REFERENCES=15,
ABSTRACT="In power control, convergence rate is one of the most
important criteria that can determine the practical applicability of a
given algorithm. The convergence rate of power control is especially
important when propagation and traffic conditions are changing rapidly.
To track these changes, the power control algorithm must converge
quickly. The purpose of this paper is to generalized the existing power
control framework such that we can utilize partially known link gain
information in improving the convergence speed. For this purpose, block
power control (BPC) is suggested with its convergence properties. BPC is
centralized within each block in the sense that it exchanges link gain
information within the same block. However, it is distributed in a
block-wise manner and no information is exchanged between different
blocks. Depending on availability of link gain information, a block can
be any set of users, and even consist of a single user. Computational
experiments are carried out on a DS-CDMA system, illustrating how BPC
utilizes available link gain information in increasing the convergence
speed of the power control.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996982.pdf?isNumber=21515\&prod=CNF\&arnumber=996982\&arSt=882\&ared=886+vol.2\&arAuthor=Jantti\%2C+R.\%3B+Seong-Lyun+Kim",
}

@INPROCEEDINGS{Shan0204:Wireless,
AUTHOR="Nemmara K. Shankaranarayanan and Ashish Rastogi and zhimei
jiang",
TITLE="Performance of a wireless data network with mixed interactive
user workloads",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="887-890",
MONTH=apr,
YEAR=2002,
REFERENCES=6,
ABSTRACT="Wireless data networks will have a mix of user workloads since
there will be a variety of wireless data terminal devices. Using
computer simulation, we study the performance of an EDGE-based packet
wireless network with various combinations of Web and dataphone users.
We provide an understanding of the performance of a shared channel with
mixed user workloads, and show that the number of users that can be
supported can be determined using simple rules based on average traffic
statistics.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996983.pdf?isNumber=21515\&prod=CNF\&arnumber=996983\&arSt=887\&ared=890+vol.2\&arAuthor=Shankaranarayanan\%2C+N.K.\%3B+Rastogi\%2C+A.\%3B+Zhimei+Jiang",
}

@INPROCEEDINGS{Bian0204:Improving,
AUTHOR="Giuseppe Bianchi and Ilenia Tinnirello",
TITLE="Improving load balancing mechanisms in wireless packet networks",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="891-895",
MONTH=apr,
YEAR=2002,
REFERENCES=8,
ABSTRACT="This paper provides a comparative performance evaluation of
various load balancing schemes in cellular packet networks. With respect
to circuit switched networks, wireless packet technology adds the
further issue of quality of service of accepted connections. In fact,
with packet technology, transmission error performance does not uniquely
depend on the perceived channel quality, but it can be improved by
adopting a scheduling mechanism enforcing fast retransmission of
corrupted packets. The result is that throughput can be traded off with
QoS experienced by an admitted flow. This paper proposes new
packet-level load balancing mechanisms. In addition to the number of
calls admitted in a cell, our schemes use supplementary packet level
information, expressed in terms of effective resource consumption of
each individual call when retransmission mechanisms are employed.
Simulation results prove the superiority of our proposed schemes with
respect to traditional load balancing schemes.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996984.pdf?isNumber=21515\&prod=CNF\&arnumber=996984\&arSt=891\&ared=895+vol.2\&arAuthor=Bianchi\%2C+G.\%3B+Tinnirello\%2C+I.",
}

@INPROCEEDINGS{Hwan0204:Adaptive,
AUTHOR="Chan-Soo Hwang and Yungsoo Kim",
TITLE="An adaptive modulation method for multicast communications of
hierarchical data in wireless networks",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="896-900",
MONTH=apr,
YEAR=2002,
REFERENCES=12,
ABSTRACT="The difference in link condition of multicast users makes it
difficult to use adaptive modulation in multicast communications over
wireless channels. Therefore, the physical layer mode is usually adapted
to the worst case link condition. We propose a new adaptive modulation
method for multicast communications. The method separates data into
hierarchical layers according to its importance and transmits the layers
of data in the same frame adaptively. The base layer is transmitted at
the lowest data rate while the higher layers are transmitted at higher
rates. The number of slots for each physical layer mode is optimized and
a simple closed form solution is obtained. Simulation results for 5 GHz
wireless LAN show that the proposed method attains higher data rates
with lower outage probability than the conventional non-uniform phase
shift keying (PSK) scheme.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996985.pdf?isNumber=21515\&prod=CNF\&arnumber=996985\&arSt=896\&ared=900+vol.2\&arAuthor=Chan-Soo+Hwang\%3B+Yungsoo+Kim",
}

@INPROCEEDINGS{Aspl0204:Clustering,
AUTHOR="H. Asplund and Andreas Molisch and M. Steinbauer and N. Mehta",
TITLE="Clustering of scatterers in mobile radio channels-evaluation and
modeling in the {COST259} directional channel model Clustering of
scatterers in mobile radio channels-evaluation and modeling in the
{COST259} directional channel model",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="901-905",
MONTH=apr,
YEAR=2002,
REFERENCES=24,
ABSTRACT="We analyze the clustering of scatterers in mobile radio
channels, i.e, the fact that scatterers are usually not located
uniformly in the whole coverage area, but tend to occur in clusters.
While this has been recognized for some time, a realistic model for this
phenomenon has been lacking up to now. We first analyze measurements to
extract the distribution of the number of observed clusters. We then
present a model that reflects not only this distribution, but also
reproduces the appearance and disappearance of clusters as the mobile
station moves through the cell. Our approach has been adopted as an
important part of the COST259 directional channel model, a standard
model for directional mobile radio channels. Finally, we discuss the
implications of the model for the system performance of CDMA and SDMA
systems.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996986.pdf?isNumber=21515\&prod=CNF\&arnumber=996986\&arSt=901\&ared=905+vol.2\&arAuthor=Asplund\%2C+H.\%3B+Molisch\%2C+A.F.\%3B+Steinbauer\%2C+M.\%3B+Mehta\%2C+N.B.",
}

@INPROCEEDINGS{Chon0204:Joint,
AUTHOR="C. C. Chong and David Laurenson and C.-W. Tan and Steve
McLaughlin and Mark Beach and A. Nix",
TITLE="Joint detection-estimation of directional channel parameters
using the {2-D} frequency domain {SAGE} algorithm with serial
interference cancellation",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="906-910",
MONTH=apr,
YEAR=2002,
REFERENCES=10,
ABSTRACT="In this paper, the serial interference cancellation (SIC)
technique and the frequency domain SAGE (FD-SAGE) algorithm are jointly
used to detect and estimate the radio channel parameters of interest.
The implementation of the SAGE algorithm in the frequency domain is
novel. Furthermore, the parallel interference cancellation (PIC)
technique in the standard SAGE algorithm is replaced by the SIC
technique. The SIC technique demonstrates more stable performance
especially in a multipath rich environment. The two-dimensional (2-D)
FD-SAGE algorithm and the SIC technique are introduced and their
performance demonstrated by using real indoor channel measurement data
to jointly estimate the number of multipath components (MPCs), their
time-of-arrivals (TOAs), angle-of-arrivals (AOAs) and complex
amplitudes. Their performance is evaluated and compared using synthetic
data and results using 2-D unitary ESPRIT (another form of
super-resolution algorithm).",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996987.pdf?isNumber=21515\&prod=CNF\&arnumber=996987\&arSt=906\&ared=910+vol.2\&arAuthor=Chong\%2C+C.C.\%3B+Laurenson\%2C+D.I.\%3B+Tan\%2C+C.M.\%3B+McLaughlin\%2C+S.\%3B+Beach\%2C+M.A.\%3B+Nix\%2C+A.R.",
}

@INPROCEEDINGS{El0204:Channel,
AUTHOR="H. M. El-Sallabi and Henry Bertoni and P. Vainikainen",
TITLE="Channel characterization for {CDMA} {RAKE} receiver design for
urban environment",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="911-915",
MONTH=apr,
YEAR=2002,
REFERENCES=6,
ABSTRACT="Future mobile communication systems based on DS-CDMA require
detailed characterization of the radio channel in the multipath delay
domain (for short, the path domain). CDMA system designers need channel
information in the form of RAKE fingers for successful receiver design.
This work presents analysis of measurement results for obtaining active
RAKE fingers and their characteristics.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996988.pdf?isNumber=21515\&prod=CNF\&arnumber=996988\&arSt=911\&ared=915+vol.2\&arAuthor=El-Sallabi\%2C+H.M.\%3B+Bertoni\%2C+H.L.\%3B+Vainikainen\%2C+P.",
}

@INPROCEEDINGS{Zhan0204:Indoor,
AUTHOR="Ji Zhang and Yu-Ching Huang",
TITLE="Indoor channel characteristics comparisons for the same building
with different dielectric parameters",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="916-920",
MONTH=apr,
YEAR=2002,
REFERENCES=10,
ABSTRACT="With various building dielectric parameters, simulation
results obtained using a ray-tracing method for both the narrowband and
wideband indoor channel characterisation are presented. Effects of
different building dielectric parameters on the channel characteristics
are shown for the same building in terms of the predicted path-loss and
RMS delay spread (/spl tau//sub rms/) of the channel impulse response.
Simulation results demonstrate that channel /spl tau//sub rms/ is more
sensitive to the building dielectric parameters compared with the
path-loss characteristic. This indicates that the information on
building dielectric parameters with higher accuracy is required for
indoor channel /spl tau//sub rms/ prediction.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996989.pdf?isNumber=21515\&prod=CNF\&arnumber=996989\&arSt=916\&ared=920+vol.2\&arAuthor=Zhang\%2C+J.T.\%3B+Huang\%2C+Y.",
}

@INPROCEEDINGS{Wu0204:Time,
AUTHOR="Xiaojun Wu and Qinye Yin and Jianguo Zhang and Ke Deng",
TITLE="Time-domain multiuser detection for {MC-CDMA} systems without
cyclic prefix",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="921-925",
MONTH=apr,
YEAR=2002,
LANGUAGE="English",
REFERENCES=9,
ABSTRACT="In multicarrier code-division multiple access (MC-CDMA)
systems over the finite impulse response (FIR) channel, a usual approach
for combating the resultant hostile intersymbol interference (ISI) is
via addition of a cyclic prefix (CP) to each transmitted data block.
However, ISI is eliminated at the cost of reduction in spectral
efficiency. In order to recover spectral efficiency, it is meaningful to
investigate MC-CDMA systems without CP. This paper explores the
multiuser detection for the MC-CDMA system without CP. We interpret the
MC-CDMA system without CP as an equivalently time-domain ISI-corrupted
direct sequence (DS-) CDMA system with specific spreading codes.
Successively, based on this representation, a time-domain linear minimum
mean square error (MMSE) multiuser detection scheme is derived for the
MC-CDMA system without CP. Computer simulations illustrate both the
validity and the overall performance of the proposed multiuser detection
scheme.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996990.pdf?isNumber=21515\&prod=CNF\&arnumber=996990\&arSt=921\&ared=925+vol.2\&arAuthor=Xiaojun+Wu\%3B+Qinye+Yin\%3B+Hanguo+Zhang\%3B+Ke+Deng",
}

@INPROCEEDINGS{Wang0204:Improved,
AUTHOR="Chin-Liang Wang and Kuo-Ming Wu and Kwei-Liang Hwang",
TITLE="An improved power control scheme with adaptive interference
suppression for {DS-CDMA} wireless communications",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="926-930",
MONTH=apr,
YEAR=2002,
REFERENCES=9,
ABSTRACT="We propose a low-complexity distributed power control scheme
with adaptive interference suppression for direct-sequence code-division
multiple access wireless communication systems. The proposed method can
be regarded as an improved version of the adaptive power control scheme
presented by Wang et al. (see Proc. 2000 IEEE International Symp.
Circuit and System (ISCAS 2000), Sydney, Australia, May 2001, p.286-89).
In the proposed structure, a new strategy is developed for estimating
the required parameters for power control such that extra power
consumption due to improper measuring can be alleviated. Computer
simulation results support that the improved power control scheme
performs much better than the original one, where both involve the same
order of complexity. As compared to the complicated instantaneous
minimum mean-squared error (MMSE) scheme presented by Ulukus and Yates
(see ACM Wireless Networks, vol.4, p.489-96, 1998), the proposed
adaptive method achieves similar convergence performance but involves
much less complexity.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996991.pdf?isNumber=21515\&prod=CNF\&arnumber=996991\&arSt=926\&ared=930+vol.2\&arAuthor=Chin-Liang+Wang\%3B+Kuo-Ming+Wu\%3B+Kwei-Liang+Hwang",
}

@INPROCEEDINGS{Zhu0204:Power,
AUTHOR="Jianming Zhu and Yeheskel Bar-Ness",
TITLE="Power allocation algorithm in {MC-CDMA}",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="931-935",
MONTH=apr,
YEAR=2002,
REFERENCES=6,
ABSTRACT="We propose an algorithm to allocate power among subcarriers in
an MC-CDMA system. The optimal power allocation coefficients turn out to
be the maximum eigenvalue eigenvector of the modified projection matrix
orthogonal to the interference signal subspace. We also present a simple
on-off control algorithm to decrease feedback information.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996992.pdf?isNumber=21515\&prod=CNF\&arnumber=996992\&arSt=931\&ared=935+vol.2\&arAuthor=Jianming+Zhu\%3B+Bar-Ness\%2C+Y.",
}

@INPROCEEDINGS{Xhaf0204:Theoretical,
AUTHOR="A. Xhafa and O. Tonguz and A. G. Cepni and D. D. Stancil and P.
V. Nikitin and D. Brodtkorb",
TITLE="Theoretical estimates of {HVAC} duct channel capacity for
high-speed {Internet} access",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="936-939",
MONTH=apr,
YEAR=2002,
REFERENCES=9,
KEYWORDS="internet access; indoor propagation; heating; ventilation; and
air conditioning systems for wireless transmission",
ABSTRACT={We report theoretical channel capacity estimates of heating,
ventilation, and air-conditioning (HVAC) ducts based on multi-carrier
transmission that uses M-QAM modulation and measured channel responses
at 2.4 GHz Industrial, Scientific, and Medical (ISM) band. It is shown
that, data rates in excess of 1 Gbps are possible over distances up to
500 m in "matched" ducts (one can think of "matched" ducts as
user-friendly ducts, since "matching" can, in principle, eliminate all
the multipath reflections in HVAC ducts). Our work also shows that data
rates in excess of 300 Mbps are possible over distances up to 500 m even
in the presence of significant multipath reflections.},
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996993.pdf?isNumber=21515\&prod=CNF\&arnumber=996993\&arSt=936\&ared=939+vol.2\&arAuthor=Xhafa\%2C+A.E.\%3B+Tonguz\%2C+O.Z.\%3B+Cepni\%2C+A.G.\%3B+Stancil\%2C+D.D.\%3B+Nikitin\%2C+P.V.\%3B+Brodtkorb\%2C+D.",
}

@INPROCEEDINGS{Chen0204:Energy,
AUTHOR="Po-Ning Chen and Bob O'Dea and Ed Callaway",
TITLE="Energy efficient system design with optimum transmission range
for wireless ad hoc networks",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="945-952",
MONTH=apr,
YEAR=2002,
REFERENCES=7,
ABSTRACT="In ad hoc networks, devices are required to self-organize
themselves into a network without previously established infrastructure.
The kind of ad hoc network we consider is made up of a multitude of
relatively low mobility, short range, wireless devices, pervasively
deployed throughout the environment. One of the most important design
criteria for this type of network is energy efficiency. This paper looks
at the energy efficiency aspect of the system design. Specifically, this
paper looks at the optimum one-hop transmission distance that will
minimize the total system energy. The analysis assumes that the
individual devices do not have power control, but that the transmission
range of all the devices as a group can be varied in the design stage.
The results show that the optimum one-hop transmission distance is
independent of the physical network topology, the number of transmission
sources, and the total transmission distance. It only depends on the
propagation environment and the device parameters. With this result,
some system design trade offs can be made to minimize the total system
energy. We discuss what these parameters are, how they interact with
each other, and how they can be used to obtain an energy efficient
wireless system. We also discuss the implications this result has for
future developments of low bit rate, short range, and highly dense
wireless devices for ad hoc networks.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996995.pdf?isNumber=21515\&prod=CNF\&arnumber=996995\&arSt=945\&ared=952+vol.2\&arAuthor=Chen\%2C+P.\%3B+O\%27Dea\%2C+B.\%3B+Callaway\%2C+E.",
}

@INPROCEEDINGS{Yuan0204:Collision,
AUTHOR="Maria C. Yuang and B. C. Lo and Jinghu Chen",
TITLE="A collision resolution paradigm for random access channel control
in multi-access wireless networks",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="953-959",
MONTH=apr,
YEAR=2002,
REFERENCES=20,
ABSTRACT="The random access channel (RACH) incurs a collision if more
than one user make signaling requests over the same time slot, spreading
code, or antenna element, in TDMA, CDMA, or SDMA wireless networks,
respectively. We propose a hexanary-feedback collision resolution
paradigm (HFCRP), capable of leveraging access efficiency of the RACH
for all above wireless networks. HFCRP performs incremental contention
resolution, managing a small subset of users at a time via a two-phase
process. In the first phase, a group of users is probabilistically
admitted, with a negligible probability of the group size greater than
five. In the second phase, all users in the group are efficiently
resolved. The two-phase process is augmented with hexanary feedback
control facilitated by an envelope-PDF-based multi-user estimator (MR)
implemented at the physical layer. Significantly, the MR measures the
exact number of transmitting users (zero to five) in a contention slot
by matching the envelope PDFs histograms of received signals to a
library of pre-constructed PDFs. These six outcomes comprise the
hexanary feedback being broadcast to users during the real-time
operation of the two-phase process. Analytic and simulation results
delineate that, performing in conjunction with the MR, HFCRP achieves
high performance with respect to maximum stable throughput, saturated
throughput, access delay, and blocking probability.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996996.pdf?isNumber=21515\&prod=CNF\&arnumber=996996\&arSt=953\&ared=959+vol.2\&arAuthor=Yuang\%2C+M.C.\%3B+Lo\%2C+B.C.\%3B+Chen\%2C+J.Y.",
}

@INPROCEEDINGS{Zoch0204:Cell,
AUTHOR="A. Zoch and G. Fettweis",
TITLE="Cell search performance analysis for {W-CDMA}",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="940-944",
MONTH=apr,
YEAR=2002,
REFERENCES=10,
ABSTRACT="Due to the main advantages of spread spectrum techniques such
as good performance in frequency selective channels, high data rate and
capacity flexibility, W-CDMA has been selected as transmission
technology for 3G cellular systems. With respect to the overall system
performance, the initial synchronization of the locally generated PN
sequence with the received signal is a critical task. In order to
simplify the process of downlink signal acquisition, which is also
referred to as cell search, a three step approach is employed for the
FDD mode. An analytic approach for performance analysis of W-CDMA cell
search in flat Rayleigh fading channels is presented. By deriving the
probability density functions (PDF) of the test hypotheses, the stage
transition probabilities and the important performance measure mean
acquisition time are determined. Based on these results the impact of
system and algorithm parameters on the cell search performance is
investigated. The reliability of the presented approach is confirmed by
Monte Carlo simulations.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996994.pdf?isNumber=21515\&prod=CNF\&arnumber=996994\&arSt=940\&ared=944+vol.2\&arAuthor=Zoch\%2C+A.\%3B+Fettweis\%2C+G.P.",
}

@INPROCEEDINGS{Wito0204:Optimization,
AUTHOR="S. Witosurapot and Jim Lambert and Iradj Ouveysi",
TITLE="Optimization flow control for aggregate traffic handling in the
differentiated services {Internet}",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="965-969",
MONTH=apr,
YEAR=2002,
REFERENCES=10,
ABSTRACT="We advocate the use of random exponential marking (REM) - an
optimization flow control approach - as an extension to the assured
forwarding (AF) service of differentiate services Internet that is
well-suited to adaptive applications. The main features are that it
offers per-flow signaling, hence allows for end-to-end adaptive users,
but enables routers to work on aggregate flows so that the network is
scalable. It allows the network to offer reliable service assurances via
a distributed optimization algorithm, without introducing special
protocols or requiring routers to have access of individual user
requirements. Apart from these features, it provides an incentive for
users to cooperate so that optimum performance can be accomplished.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996998.pdf?isNumber=21515\&prod=CNF\&arnumber=996998\&arSt=965\&ared=969+vol.2\&arAuthor=Witosurapot\%2C+S.\%3B+Lambert\%2C+J.\%3B+Ouveysi\%2C+I.",
}

@INPROCEEDINGS{Tart0204:Random,
AUTHOR="Sandra Tartarelli and Albert Banchs",
TITLE="Random early marking: improving {TCP} performance in DiffServ
assured forwarding",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="970-975",
MONTH=apr,
YEAR=2002,
REFERENCES=13,
ABSTRACT="In the context of active queue management, intelligent
dropping algorithms have been proposed to achieve a better link
utilization with TCP. We apply this research to the problem of achieving
a better utilization of a customer's contracted throughput when it is
sending a TCP traffic aggregate. We propose a scheme, random early
marking (REM), that improves the throughput of a TCP aggregate by early
marking some packets as out. The proper configuration of REM has been
analyzed from a control theoretical standpoint. Simulation results show
that REM leads to a significant improvement in a wide range of
environments.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00996999.pdf?isNumber=21515\&prod=CNF\&arnumber=996999\&arSt=970\&ared=975+vol.2\&arAuthor=Tartarelli\%2C+S.\%3B+Banchs\%2C+A.",
}

@INPROCEEDINGS{Chas0204:IP,
AUTHOR="Christophe Chassot and Fabien Garcia and Guillaume Auriol and
André Lozes and Emmanuel Lochin and Pascal Anelli",
TITLE="Performance analysis for an {IP} Differentiated Services
network",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="976-980",
MONTH=apr,
YEAR=2002,
REFERENCES=20,
ABSTRACT="Research reported here deals with a communication architecture
with guaranteed end-to-end quality of service (QoS) in an IPv6
environment providing differentiated services within a single DiffServ
domain. The article successively presents the design principles and
services of the proposed architecture, their implementation over a
national platform, and experimental measurements evaluating the QoS
provided at the user level.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00997000.pdf?isNumber=21515\&prod=CNF\&arnumber=997000\&arSt=976\&ared=980+vol.2\&arAuthor=Chassot\%2C+C.\%3B+Garcia\%2C+F.\%3B+Auriol\%2C+G.\%3B+Lozes\%2C+A.\%3B+Lochin\%2C+E.\%3B+Anelli\%2C+P.",
}

@INPROCEEDINGS{ODon0204:Novel,
AUTHOR="A. J. O'Donnell and Harish Sethu",
TITLE="A novel, practical pricing strategy for congestion control and
differentiated services",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="986-990",
MONTH=apr,
YEAR=2002,
REFERENCES=13,
ABSTRACT="Pricing is an effective tool to control congestion and achieve
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 at close to peak
efficiency, 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. In addition, it utilizes a user-centric approach where a user is
not charged a higher price unless preferential service is actually
delivered.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00997002.pdf?isNumber=21515\&prod=CNF\&arnumber=997002\&arSt=986\&ared=990+vol.2\&arAuthor=O\%27Donnell\%2C+A.J.\%3B+Sethu\%2C+H.",
}

@INPROCEEDINGS{Jian0204:Proportional,
AUTHOR="Yong Jiang and Jianping Wu and Ke Xu",
TITLE="Proportional fairness scheduling on tandem network",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="991-995",
MONTH=apr,
YEAR=2002,
REFERENCES=15,
ABSTRACT="We study packet scheduling algorithms that satisfy multiple
performance objectives simultaneously. We have realized the proportional
fairness principle based QoS model, which defines both delay and loss
rate requirements of a class, to include fairness. The resulting
proportional fairness scheduling algorithms on a tandem network
formalize the goals of the network performance, user's QoS requirements
and system fairness, and expose the fundamental tradeoffs between these
goals. In particular, it is difficult to provide these objects
simultaneously. By performing simulation and measurement experiments, we
evaluate the proportional fairness of the algorithm.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00997003.pdf?isNumber=21515\&prod=CNF\&arnumber=997003\&arSt=991\&ared=995+vol.2\&arAuthor=Yong+Jiang\%3B+Jianping+Wu\%3B+Ke+Xu",
}

@INPROCEEDINGS{Cave0204:Fairness,
AUTHOR="Dirceu Cavendish and Marcello Lajolo and Hongbo Liu",
TITLE="On the evaluation of fairness for input queue switches",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="996-1000",
MONTH=apr,
YEAR=2002,
REFERENCES=19,
ABSTRACT="Packet switches are required to support quality of service
(QoS), that is, the capability to differentiate packet servicing on a
flow basis, ensuring switching objectives such as guaranteed throughput
and bounded switching delays. The core of a packet switch is a switch
fabric, which is typically available as a single chip or chip set.
Currently, these chip sets do not support QoS features, such as required
packet service rates. We develop a framework based on performance
indicators for evaluating a packet switch with respect to fairness
performance. In conjunction with a robust simulation environment, we
analyze the performance of two well known core packet schedulers.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00997004.pdf?isNumber=21515\&prod=CNF\&arnumber=997004\&arSt=996\&ared=1000+vol.2\&arAuthor=Cavendish\%2C+D.\%3B+Lajolo\%2C+M.\%3B+Hongbo+Liu",
}

@INPROCEEDINGS{Wang0204:New,
AUTHOR="Bin Wang and Xu Su and Chi-Ming Chen",
TITLE="A new bandwidth guaranteed routing algorithm for {MPLS} traffic
engineering",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="1001-1005",
MONTH=apr,
YEAR=2002,
REFERENCES=11,
ABSTRACT="In this paper, we present a new online algorithm for
dynamically routing bandwidth guaranteed label switched paths (LSPs).
LSP set-up requests are represented in terms of a pair of ingress and
egress routers as well as its bandwidth requirement, and arrive one by
one. There is no a priori knowledge regarding future LSP set-up requests
and their characteristics. Our proposed algorithm considers not only the
importance of critical links, but also the degree of their importance to
routing possible future LSP set-up requests by characterizing their
normalized bandwidth contribution to routing future LSP demands.
Moreover, link residual bandwidth information, i.e., the link's
capability of routing future LSPs, is also incorporated. Simulation
results show that our proposed algorithm performs better than the best
known bandwidth guaranteed routing algorithm, the minimum interference
routing algorithm, in terms of LSP rejection rate under both static and
dynamic LSP set-up request arrivals.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00997005.pdf?isNumber=21515\&prod=CNF\&arnumber=997005\&arSt=1001\&ared=1005+vol.2\&arAuthor=Bin+Wang\%3B+Xu+Su\%3B+Chen\%2C+C.L.P.",
}

@INPROCEEDINGS{Kao0204:Generic,
AUTHOR="Ling-Chih Kao and Zsehong Tsai",
TITLE="Performance analysis of a generic {GMPLS} switching architecture
with flush capability",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="1006-1010",
MONTH=apr,
YEAR=2002,
REFERENCES=11,
KEYWORDS="gmpls; switching; routing; performance analysis",
ABSTRACT="The performance of a GMPLS (generalized multiprotocol label
switching) architecture with flush capability is studied. For this
switching architecture, we propose a queueing model that includes the
control plane, the switching buffer mechanism, and the flush mechanism.
The flush capability is included to reduce the out-of-sequence problem
due to dynamic path changes. The behavior of aggregated streams, the
label-setup and release policies, and the mechanisms for efficient
resource allocation are all covered. With the proposed model, one can
select appropriate parameters for the label-setup policy and the
label-release policy to match the traffic load and network environment.
Key performance metrics, such as throughput, label-setup rate, and fast
path bandwidth utilization, can all be evaluated by this mathematical
model. Numerical results and simulations are used to verify the accuracy
of our proposed queueing model. Finally, the trade-off among these
performance metrics can be observed as well.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00997006.pdf?isNumber=21515\&prod=CNF\&arnumber=997006\&arSt=1006\&ared=1010+vol.2\&arAuthor=Ling-Chih+Kao\%3B+Zsehong+Tsai",
}

@INPROCEEDINGS{Liu0204:Novel,
AUTHOR="Jiangchuan Liu and Qian Zhang and Wenwu Zhu and Jun Zhang and Bo
Li",
TITLE="A novel framework for QoS-aware resource discovery in mobile ad
hoc networks",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="1011-1016",
MONTH=apr,
YEAR=2002,
REFERENCES=25,
ABSTRACT="With the rising popularity of network-based applications and
the potential use of mobile ad hoc networks in civilian life, an
efficient resource discovery service is needed in such networks for
quickly locating resource providers. In addition, to improve user
experience, QoS awareness is also crucial. We identify the challenges
when basic resource discovery techniques for the Internet are used in
mobile ad hoc networks. We then propose a framework that provides a
unified solution to the discovery of resources and QoS-aware selection
of resource providers. The key entities of this framework are a set of
self-organized discovery agents. These agents manage the directory
information of resources using hash indexing. They also dynamically
partition the network into domains and collect intra- and inter-domain
QoS information to select appropriate providers. Simulation results show
that our framework improves the QoS delivered to the clients, while the
cost and response time are kept at a low level.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00997007.pdf?isNumber=21515\&prod=CNF\&arnumber=997007\&arSt=1011\&ared=1016+vol.2\&arAuthor=Jiangchuan+Liu\%3B+Qian+Zhang\%3B+Wenwu+Zhu\%3B+Jun+Zhang\%3B+Bo+Li",
}

@INPROCEEDINGS{Wang0204:Group,
AUTHOR="K. H. Wang and Baochun Li",
TITLE="Group mobility and partition prediction in wireless ad-hoc
networks",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="1017-1021",
MONTH=apr,
YEAR=2002,
REFERENCES=5,
ABSTRACT="In wireless ad-hoc networks, network partitioning occurs when
the mobile nodes move with diverse patterns and cause the network to
separate into completely disconnected portions. Network partitioning is
a wide-scale topology change that can cause sudden and severe
disruptions to ongoing network routing and upper layer applications. Its
occurrence can be attributed to the aggregate group motion exhibited in
the movements of the mobile nodes. By exploiting the group mobility
pattern, we can predict the future network partitioning, and thus
minimize the amount of disruption. We propose a new characterization of
group mobility, based on existing group mobility models, which provides
parameters that are sufficient for network partition prediction. We then
demonstrate how partition prediction can be made using the mobility
model parameters and illustrate the applicability of the prediction
information. Furthermore, we use a simple but effective data clustering
algorithm that, given the velocities of the mobile nodes in an ad-hoc
network, can accurately determine the mobility groups and estimate the
characteristic parameters of each group.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00997008.pdf?isNumber=21515\&prod=CNF\&arnumber=997008\&arSt=1017\&ared=1021+vol.2\&arAuthor=Wang\%2C+K.H.\%3B+Baochun+Li",
}

@INPROCEEDINGS{Shah0204:Predictive,
AUTHOR="S. H. Shah and Klara Nahrstedt",
TITLE="Predictive location-based {QoS} routing in mobile ad hoc
networks",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="1022-1027",
MONTH=apr,
YEAR=2002,
REFERENCES=9,
ABSTRACT="In mobile ad hoc networks, the locations and resource-richness
of mobile nodes vary dynamically. The information used for routing by
traditional routing protocols becomes obsolete due to node mobility. To
overcome this problem, a predictive location-based QoS routing scheme is
needed. We present a location-delay prediction scheme, based on a
location-resource update protocol, which assists a QoS routing protocol.
Simulation results show that our approach can predict the location at a
given instant in the future with a high degree of accuracy.",
URL="http://osiyou.cc.columbia.edu:2377/iel5/7828/21515/00997009.pdf?isNumber=21515\&prod=CNF\&arnumber=997009\&arSt=1022\&ared=1027+vol.2\&arAuthor=Shah\%2C+S.H.\%3B+Nahrstedt\%2C+K.",
}

@INPROCEEDINGS{Ali0204:Set,
AUTHOR="Syed Zahid Ali",
TITLE="A set partitioning approach for cellular planning of mobile radio
network",
BOOKTITLE=icc,
ADDRESS="New York, NY, USA",
PAGES="1028-1032",
MONTH=apr,
YEAR=2002,
REFERENCES=9,
KEYWORDS="set theory; optimization methods; graph theory; networks;
planning; terrain factors",
ABSTRACT="In the design of radio networks, the problem of cellular
planning is of critical importance. The present paper addresses the
problem of determining the minimum number of base stations required to
cover a design area, the associated optimal cell sizes, and the best
topographical configurations for the cells, while meeting system
performance requirements. The problem is formulated as a set
partitioning problem, where the requirements of radio coverage,
non-uniform traffic distribution, and topographical constraints are
taken into account. A highly efficient branch and bound algorithm is
then used to obtain the guaranteed optimal solution. By considering a
range of benchmark network problems that have appeared in the
literature, it is shown that the proposed technique has a significantly
superior performance to other known te