@UNPUBLISHED{Ghos9412:Integrated,
AUTHOR="Ghosh, Atanu and Crowcroft, Jon and Fry, Michael and Handley, Mark",
INSTITUTION="University College London",
ADDRESS="London",
TITLE="Integrated Layer Video Decoding and Application Layer Framed
Secure Login: General Lessons from Two or Three Very Different
Applications",
NOTE="do not distribute",
MONTH=dec,
YEAR=1994,
ABSTRACT="We describe three protocol stack designs and
implementations. These were carried out for the lessons that can be
learned concerning the use of the principles of application layer
framing and integrated layer processing when taking a vertical cut
through a whole stack. Previous work in this area has often only
looked at single or pairs of layers.",
KEYWORDS="application layer framing; ALP; integrated layer processing;
ILP",
REFERENCES=17,
ENTRYBY=Sc
}

@UNPUBLISHED{Zimm9501:Pmm,
AUTHOR="Zimmermann, Edward C.",
INSTITUTION="Basis Systems Networks",
TITLE="Minor modifications to pmm",
NOTE="Added locking and syslog",
MONTH=jan,
YEAR=1995,
KEYWORDS="NeVoT; pmm",
URL="mailto://edz@bsn.com",
ENTRYBY=Sc
}

@ARTICLE{Ahn95:Optimal,
AUTHOR="Ahn, David S. and Lee, Sang and Lee, Myung J.",
TITLE="Optimal buffer allocation for nonblocking ATM switches via
effective cell loss analysis",
JOURNAL=ieanep,
YEAR=1995,
KEYWORDS="ATM; cell loss",
ENTRYBY=Sc
}

@UNPUBLISHED{Gorm9507:IBCN,
AUTHOR="Gorman, Bernard",
INSTITUTION="Cray Communications",
ADDRESS="Technical University Berlin",
TITLE="IBCN QoS Managment demonstrations 1995 -- Participating
Projects: TOMQAT \& ICM",
NOTE="Slides",
MONTH=sep,
YEAR=1995,
DAY=7,
KEYWORDS="TOMQAT; ICM; quality of service",
ENTRYBY=Sc
}

@TECHREPORT{Kris9401:MFTP,
AUTHOR="Kristol, David M.",
TITLE="MFTP - mercantile {FTP}",
INSTITUTION="AT\&T Bell Laboratories",
ADDRESS="Murray Hill, New Jersey",
TYPE="Technical Memorandum",
MONTH=jan,
YEAR=1994,
KEYWORDS="ftp; Internet; security; charging; electronic commerce",
ENTRYBY=Sc
}

@TECHREPORT{Kris9407:Weaving,
AUTHOR="David M. Kristol and Henning G. Schulzrinne",
TITLE="Weaving AT\&T into the world-wide web: rapid entry into
information services",
INSTITUTION="AT\&T Bell Laboratories",
ADDRESS="Murray Hill, New Jersey",
TYPE="Technical Memorandum",
MONTH=jan,
YEAR=1994,
KEYWORDS="WWW; Internet; information services",
ENTRYBY=Sc
}

@TECHREPORT{Turn9512:Dynaflow,
AUTHOR="Turner, Jonathan and Parulkar, Guru and Varghese, George",
TITLE="Dynaflow switching: an advanced networking concept for dynamic,
flexible, robust high performance networks",
INSTITUTION="Computer Science Department, Washington University",
ADDRESS="St. Louis",
TYPE="Proposal Abstract",
MONTH=dec,
YEAR=1995,
KEYWORDS="ATM; dynaflow switching; Ypsilon",
ANNOTE="combination of hard and soft state; compare Ypsilon switch",
ENTRYBY=Sc
}

@TECHREPORT{Agga9804:Flexible,
AUTHOR="Sudhir Aggarwal and Sanjoy Paul and Daniel Massey and Daniela
Calderaru",
TITLE="A flexible protocol architecture for multi-party conferencing:
from design to implementation",
INSTITUTION="Bell Labs, Lucent Technologies",
ADDRESS="Murray Hill, NJ",
TYPE="Technical Memorandum",
MONTH=apr,
YEAR=1998,
NUMBER="11345-980423-03TM",
ABSTRACT="Multicast routing, once dominated by a single routing
protocol, is becoming increasingly diverse. It is generally agreed taht
at least three routing protocols, PIM, DVMRP, and CBT will be widely
deployed and must interoperate. This signals a shift from the Mbone as
one large domain to a collection of administrative domains where each
domain selects its own multicast routing protocol. This paper proposes
another multicast routing protocol, CSM, that is suited for domains that
implement OSPF as the unicast routing protocol. CSM is targeted towards
(sparse) multicast conferencing and online discussion groups.
Characteristics of such discussion groups include any member being a
speaker or listener and dynamic changes in the group membership. CSM is
furthermore well suited for domains with mobile hosts because its basic
architecture can support a mobile environment. CSM is based on the use
of a shared, close-to-optimal Steiner tree for interconnecting group
members. A key component of the design is that it dynamically and
reliably shifts to a different tree as changes warrant. CSM supports
rudimentary entry control for security and permits application
assistance over routing decisions (termed Application Assisted Routing).
This paper describes the architecture of CSM as well as a prototype
implementation. Several CSM routers have been interconnected to form a
Multicast Steiner Backbone (Msbone). Standard applications such as vat,
vic, and wb have been modified to run on Msbone. CSM is designed to
connect to the Mbone via interoperation with DVMRP, and as
interoperation standards develop it should be capable of implementing
these standards.",
KEYWORDS="multicast; routing; application assisted routing; Steiner
tree; conferencing; Internet; tree switching; Mbone",
ENTRYBY=Sc
}

@TECHREPORT{Sute9710:RAP,
AUTHOR="Bernhard Suter",
TITLE="RAP -- a lightweight rate allocation protocol",
INSTITUTION="Bell Laboratories",
ADDRESS="Holmdel, New Jersey",
TYPE="Internal memorandum",
MONTH=oct,
YEAR=1997,
ABSTRACT="The question on how to provide differentiated services in an
IP based network has become an area of both strong research and business
interest. Integrating service differentiation into the now purely
best-effort Internet requires a major overhaul of architecture models
and frameworks. Several models are being pursued: requested per-flow
end-to-end QoS in a connection or semi-connection-oriented mode,
per-class service based on fields in the packet header (e.g., TOS,
etc.), new routing and forwarding models or a mix of the above. Most
attention has been given to the IETF int-serv model and the RSVP
end-to-end state establishment protocol. RSVP is using signaling
messages to establish state in routers by requesting specific service
(as defined by the int-serv model) for a given packet flow characterized
by a filter rule. Despite the fact that the per-flow model has limited
scalability in terms of packet classification and message processing
complexity without flow aggregation the proposed RAP scheme follows the
same basic model as RSVP (end-to-end per-flow QoS through signaling).
However, RAP tries to ease implementation and deployment through drastic
simplifications in terms of features, flexibility, protocol state,
requirements and complexity. RAP is designed with regard to what is
available for QoS support in current advanced router designs and how a
maximum of these features can be easily made available to users. The QoS
guarantees provided by RAP are gradual: routers should provide the level
of QoS guarantees that they are capable of and applications can try to
make best use of whatever is offered by the network.",
KEYWORDS="resource reservation; quality of service",
ENTRYBY=Sc
}

@INPROCEEDINGS{Bomm00:Design,
AUTHOR="Ethendranath Bommaiah and Katherine Guo and Markus Hofmann and
Sanjoy Paul",
INSTITUTION="Bell Labs",
TITLE="Design and implementation of a caching system for streaming media
over the Internet",
BOOKTITLE=infocom,
ADDRESS="Tel Aviv, Israel",
MONTH=apr,
YEAR=2000,
ENTRYBY=Sc
}

@TECHREPORT{Shai00:Routing,
AUTHOR="Aman Shaikh and Lampros Kalampoukas and Rohit Duhe and Anujan Varma",
TITLE="Routing stability in congested networks: experimentation and
analysis",
INSTITUTION="Bell Labs, Lucent Technologies",
ADDRESS="Murray Hill, NJ",
TYPE="Technical Memorandum",
MONTH=may,
YEAR=2000,
NUMBER="10009671-000515",
ABSTRACT="Loss of routing protocol messages due to network congestion
can cause peering session failures in routers, leading to route flaps
and routing instabilities. We study the effects of traffic overload on
routing protocols by quantifying the stability and robustness properties
of two common Internet routing protocols, OSPF and BGP, when the routing
control traffic is not isolated from data traffic. We develop analytical
models to quantify the effect of congestion on the robustness of OSPF
and BGP as a function of the traffic overload factor, queuing delays,
and packet sizes. We perform extensive measurements in an experimental
network of routers to validate the analytical results. Subsequently we
use the analytical framework to investigate the effect of factors that
are difficult to incorporate into an experimental setup, such as wide
range of link propagation delays and packet dropping policies. Our
results show that increased queueing and propagation delays adversely
affect BGP's resilience to congestion, in spite of its use of a reliable
transport protocol. Our findings demonstrate the importance of selective
treatment of routing protocol messages from other traffic, by using
scheduling and utilizing buffer management policies in the routers, to
achieve stable and robust network operation.",
KEYWORDS="routing; congestion; BGP; OSPF; analysis; modeling",
ENTRYBY=Sc
}

@TECHREPORT{Thue0005:Transient,
AUTHOR="Sandra R. Thuel and Luca Salgarelli and Ram Ramjee and Kannan
Varadhan and Tom La Porta",
TITLE="Transient tunneling for dynamic home addressing on mobile hosts",
INSTITUTION="Bell Labs, Lucent Technologies",
ADDRESS="Murray Hill, NJ",
TYPE="Technical Memorandum",
MONTH=may,
YEAR=2000,
NUMBER="10009669-000505-01TM",
ABSTRACT="Dynamic home addressing has lately become a popular and viable
approach for configuring mobile IP hosts. This paper introduces a method
for these hosts to dynamically acquire a home address through DHCP when
powering up in a foreign network, referred to as the Transient
Tunnelling (TT) procedure. Our procedure solves a recently observed
problem, namely, that mobile hosts cannot rely on conventional
broadcasting procedures to properly discover an addressing server in
their home network. While leveraging the growing DHCP code-base, our
procedure requires no changes to protocol changes and only minor changes
to server implementations. We evaluate its performance through a
preliminary implementation and show its acceptable impact on host
power-up latency. Alternative solutions are discussed along with other
issues related to dynamic addressing on mobile hosts such as wireless
bandwidth usage.",
KEYWORDS="IP host configuration; dynamic addressing; mobility
management; mobile IP; DHCP",
ENTRYBY=Sc
}

@TECHREPORT{Ng0012:Performance,
AUTHOR="Ng, Wee Teck and Hillyer, Bruce K and White, Brian",
TITLE="Performance Comparison of IDE and SCSI Disks",
INSTITUTION="Bell Labs",
ADDRESS="Murray Hill, New Jersey",
TYPE="Lucent Internal Technical Document",
MONTH=dec,
YEAR=2000,
NUMBER="ITD-00-40535K",
ABSTRACT="It is widely believed that the IDE disks found in PCs are
inexpensive but slow, whereas the SCSI disks used in servers and
workstations are faster, more reliable, and more manageable.  The belief
that current IDE disks have performance and reliability disadvantages
has been called into question by several recent reports.  Thus we
consider the possibility of achieving tremendous cost advantages by
using IDE disks as the foundation of a storage system.  In this paper,
we give an extensive performance comparison of IDE and SCSI disks.  We
measure their performance on a variety of micro benchmarks and macro
benchmarks, and we explain these results with the help of kernel
instrumentation and device activity traces collected by a SCSI analyzer. 
We consider the impact of several factors, including sequential vs. 
random workloads, file system enhancements such as journaling and Soft
Updates, I/O scheduling in the kernel vs.  in the disk drive (as enabled
by tagged queuing), and the use of RAID technology to obtain I/O
parallelism.  In our testbed we find that the IDE disk is faster than
the SCSI disk for sequential I/O, but the SCSI disk is faster for random
I/O.  We also observe that the random I/O performance deficit of the IDE
disk is partly overcome by kernel I/O scheduling, and is further
mitigated by scheduling in the drive (as enabled by tagged queuing), and
by the use of journaling and Soft Updates.  Taken as a whole, our
results lead us to conclude t at RAID systems based on IDE drives can be
both faster and significantly less expensive than SCSI RAID systems.",
KEYWORDS="SCSI; IDE; disk performance",
URL="http://infoview.lucent.com/cgi-bin/dbsearch/3?key=744467136",
ENTRYBY=Sc
}

@TECHREPORT{Shim0106:Mobility,
AUTHOR="Eunsoo Shim",
TITLE="Eunsoo Shim",
INSTITUTION="Columbia University",
ADDRESS="New York",
TYPE="PhD proposal",
MONTH=jun,
YEAR=2001,
ABSTRACT="This proposal presents a research agenda for mobility
management in wireless IP networks. The proposed research comprises two
parts. First, we investigate a fast handoff mechanism, NeighborCasting,
that utilizes the information about the neighboring access points. We
investigate the handoff latency and the traffic overhead occurring in
the mechanism and its applications, in particular, in heterogeneous
wireless IP networks. Second, we investigate a hierarchical mobility
management scheme, Gateway Agent Clustering, that provides scalability
and reliability. Both mechanisms are extensions of the mobile IP
framework.",
KEYWORDS="mobility; handoff",
ENTRYBY=Sc
}

@INPROCEEDINGS{Lenn0002:Call,
AUTHOR="Jonathan Lennox and Henning Schulzrinne",
INSTITUTION="Columbia University",
SPEAKER="Jonathan Lennox",
TITLE="The Call Processing Language: User Control of Internet Telephony
Services",
BOOKTITLE="Lucent Technologies XML Day",
ADDRESS="Murray Hill, NJ",
DAYS="28",
MONTH=feb,
YEAR=2000,
KEYWORDS="call processing; CPL; XML",
URL="http://www.cs.columbia.edu/~lennox/xmlday1.pdf",
ENTRYBY=jl
}

@ARTICLE{Cama03:Evaluation,
AUTHOR="Gonzalo Camarillo and Henning Schulzrinne and Raimo Kantola",
TITLE="Evaluation of Transport Protocols for the Session Initiation Protocol",
JOURNAL=ieeenet,
YEAR=2003,
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
experimental results showing SCTP's real benefits.  This paper analyzes
SCTP's 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.",
KEYWORDS="SCTP; SIP",
ENTRYBY=Sc
}

@ARTICLE{Mend03:How,
AUTHOR="Paulo Mendes and Henning Schulzrinne and Edmundo Monteiro",
TITLE="How to increase the efficiency of receiver-driven adaptive
mechanisms in a new generation of {IP} networks",
JOURNAL=comcom,
VOLUME=26,
YEAR=2003,
ENTRYBY=Sc
}

@MISC{Nieh0109:Columbia,
AUTHOR="Jason Nieh and Henning Schulzrinne and Edward Coffman and Predrag
Jelenkovic and Dan Rubenstein",
TITLE="The {Columbia} Hotspot Rescue Service",
MONTH=sep,
YEAR=2001,
NOTE="NSF ANI-0117738",
ENTRYBY=Sc
}

@MISC{Schu0009:Internet,
AUTHOR="Henning Schulzrinne",
TITLE="Internet Telephony Services and Mobile
Multimedia Services",
MONTH=sep,
YEAR=2000,
NOTE="NSF CAREER grant ANI-9958325",
ENTRYBY=Sc
}

@MISC{Fein0109:Infrastructure,
AUTHOR="Steve Feiner and Peter Allen and Henning Schulzrinne",
TITLE="Infrastructure for Context-Aware Wireless Network
Applications",
MONTH=sep,
YEAR=2001,
NOTE="NSF grant ANI-0099184",
ENTRYBY=Sc
}

@MISC{Schu0209:Pervasive,
AUTHOR="Henning Schulzrinne and Gail E.  Kaiser and John R.  Kender and
Steven K.  Feiner and Kathleen R.  McKeown",
TITLE="{CISE} Research Infrastructure: Pervasive Pixels",
MONTH=sep,
YEAR=2002,
NOTE="NSF grant EIA-0202063",
URL="ftp://",
ENTRYBY=Sc
}