||Christer will present a talk entitled "Performance Analysis
of Multihomed Mobile IP in Wireless Networks". A short abstract is below.|
This talk describes a multihomed Mobile IP extension that enables mobile
hosts to register multiple care-of-addresses at the home agent in order to
enhance the performance of wireless networks and improved connectivity of
mobile hosts. A prototype is described and a simulator evaluation
demonstrates performance and efficiency of the proposed approach. A
comparison of agent selection strategies is also presented.
|We show how to use RAMBO as a processor which permits us
to perform bitwise operation on a word: Boolean operations, shifts
and rotations. All of them in constant time. Here we use several
topologies of RAMBO: Twin, Circle, Line, and Tail.|
||Håkan will present "A Robust and Fast Algorithm for Computing
Exact and Approximate Shortest Visiting Routes.|
Abstract: Given a simple n-sided polygon in the plane with a boundary
partitioned into subchains some of which are convex and colored, we consider
the following problem: Which is the shortest route (closed path) contained
in the polygon that passes through a given point on the boundary and
intersects at least one vertex in each of the colored subchains?
We present an optimal algorithm that solves this problem in O(n) time.
Previously it was known how to solve the problem optimally when each
colored subchain contains one vertex only. Moreover, we show that a
solution computed by the algorithm is at most a factor (2+c)/c times longer
than the overall shortest route that intersects the subchains (not just
at vertices) if the minimal distance between vertices of different
subchains is at least c times the maximal length of an edge of a subchain.
Without such a bound its length can be arbitrarily longer. Furthermore,
it is known that algorithms for computing such overall shortest routes
suffer from numerical problems. Our algorithm is not subject to such
Anna will present a talk entitled "Browsing
Thumbnails: A Comparison of Three Techniques". The abstract is
We conducted a usability study comparing three different browser
alternatives (iconic, zoom-and-pan, and fisheye) for an
electronic bulletin board containing thumbnails of notes. The iconic
browser behaves in the manner of a standard windowing system. The
zoom-and-pan browser allows the user to pan over a note and zoom to a
readable size. The fisheye browser was an implementation of the bifocal
view. We conducted an experiment where twenty-one subjects performed
browsing tasks with each browser. We found that users performed best with
the iconic browser and that young people (20-25) were significantly
faster than older (31-53).
Fredrik will present some current research topics related to
range-sum and k-selection. The problems include maximum subsequence,
k'th smallest subsequence with and without preprocessing and
range-selection. All, but the first, are open research problems.
Helena will present a talk entitled "Adaptive Treshold-Based
Admission Control for IP Networks". The abstract is below:
Today´s Internet carries a wide variety of applications with different
demands on forwarding quality. Applications such as telephony and video
conferencing are delay and loss sensitive. Within the area of QoS, the
Differentiated Services (DiffServ) architecture provides building blocks
for creation of multiple forwarding services.
"Bandwidth Brokers" can by the concept of centralized resources and
signaling with e.g. RSVP, control DiffServ forwarding classes. A resource
manager monitoring the routing topology can performe per-link admission
control by limiting committed bit-rates through admission tresholds.
The challange is to find the treshold value that adopts to the load of
a link at all times, and thereby maximize the utilization of available
bandwidth. Is it possible to "overbook" the resources and still be able
to guarantee maximum loss-rate?
||In this seminar, Mats will present his early research on
simulating Highspeed Downlink Shared Channels (HS-DSCH) in WCDMA. WCDMA
is the 3G standard adopted by ETSI and HS-DSCH is a channel designed
especially for highspeed bursty traffic, i.e. Internet traffic. Mats will
also talk about visulizing the results since He believes visulization can
be a powerful tool in validation and verification. Since the work is
preliminary the intention is to have a discussion about the process of
validating and verifying simulation results. Paper to read:
Expanding Confidence in
Network Simulations, J. Heidemann, K. Mills and S. Kumar.|
||Thomas will talk about how the LC-trie data structure
can be used for IP address lookup applications. Improvements of the
algorithm and how it has been adapted for hardware implementation will
also be presented. Hopefully there will be some time for discussion
about issues related to the data structure.|
||Andreas will present a talk entitled "Issues with the Split
Naming/Forwarding Network Architecture."
||Mikael will present a talk entitled "What is the Best
Way of Spending Memory Accesses for Longest Prefix Match and
2-Dimensional Address Classification".
||Thomas will present a summary of his work from
the fall in a seminar entitled "Extending Tree-Maps to 3D: A
||Johan will present the current state of his research in
a talk entitled "Disputes in Policy Based Path-Vector Routing".
||Tomas will talk about his work on clustering algorithms for
wireless ad-hoc networks. A new clustering algorithm has been implemented
and compared with an existing one in simulations.
||Dr. Peter Sjödin
|At 1400 in A3001. Peter Sjödin will present a
talk entitled "Architectures for future routers--challenges and
opportunities", which is part of a Vinova application. |
will be ca. 20 minutes with 10-15 minutes for questions.
|At 1300 in A3001 Richard will present
a talk entitled "Underlay Networks". Richard is a graduate
student at Uppsala University. Abstract|
||Tomas will present a practice talk of "Usability of Mobile Phones".
The paper has been accepted for publication at HFT 2004. This short presentation
as the time limit is 20 minutes. Abstract|
||Pierre will be presenting his Licentiate thesis, Improving
Network Layer Reaction Times on Nov. 25th. The presentation will be a
practice for it. [Abstract,
Thesis in PDF]|
||Anders will lead the discussion of a paper from
MobiCom 2003 Amit Jardosh, Elizabeth M. Belding-Royer, Kevin
C. Almeroth, and Subhash Suri. Towards Realistic Mobility
Models for Mobile Ad hoc Networks. In the Proceedings of MobiCom,
San Diego, CA, September 2003.
||Prof. Mikael Rönnqvist
|Professor Rönnqvist is with the Division of Optimization,
Linköping University and is here as discussant for Tomas Berglund's
Licentiate. He will hold a seminar entitled "Route Planning in Swedish
Forestry". The seminar will be held Thursday, Oct. 30 in D770 from 13-14.
& Johan Karlsson
|Fredrik and Johan will present two papers from
the ESA 2003 conference.
Fredrik will present
Kinetic Dictionaries: How to Shoot a Moving Target by Mark
de Berg. The paper considers upper and lower bounds for the one
dimensional dictionary with time-dependent point locations.
Johan will present
Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting by
Therese Biedl, Erik D. Demaine, Alexander Golynski, Joseph D. Horton,
Alejandro López-Ortiz, Guillaume Poirier and Claude-Guy Quimper.
||Tomas will present his Lic. thesis, Path-Planning
with Obstacle-Avoiding Minimum Curvature Variation B-Splines, on Oct. 30.
This seminar will be a practice presentation for the real event.
||Prof. Mats Björkman
||Professor Björkman is from Mälardalens
Högskola and is here as discussant for Anders Lindgren's
licentiate defense. He will talk about the bandwidth measurement
research being conducted at Mälardalen.|
||Tomas will present a study of cell phone usability
undertaken by Anna, Fredrik, Tomas Johansson, and himself as part of my
HCI class last spring. The study has been accepted for publication at
HFT 2004. Abstract|
||Seminars presented during the 2002/3 school year can be
seen on last