Mr. Krishna Pandit Profile

Krishna Pandit

at Technische Univ Darmstadt

SPIE Involvement:

Author

Publications (1)

This will count as one of your downloads.

You will have access to both the presentation and article (if available).

DOWNLOAD NOW

This content is available for download via your institution's subscription. To access this item, please sign in to your personal account.

Email or Username Forgot your username?

Password Forgot your password?

Show

Keep me signed in

No SPIE account? Create an account

Proceedings Article | 16 January 2006 Paper

A transform for network calculus and its application to multimedia networking

Krishna Pandit, Jens Schmitt, Claus Kirchner, Ralf Steinmetz

Proceedings Volume 6071, 607109 (2006) https://doi.org/10.1117/12.642411

KEYWORDS: Convolution, Multimedia, Calculus, Network architectures, Analytical research, Clouds, Lawrencium, Switches, Network security, Algorithms

Read Abstract +

The rapid increase of multimedia traffic has to be accounted for when designing IP networks. A key characteristic of multimedia traffic is that it has strict Quality of Service (QoS) requirements in a heterogeneous manner. In such a setting, scheduling by service curves is a useful method as it allows for assigning each flow exactly the service it requires. When hosting heterogeneous multimedia traffic, the utilization of packet-switched networks can be increased by using bandwidth/delay decoupled scheduling disciplines. It has been shown in previous work how optimal network service curves are obtained with them. A basic result from Network Calculus is that the network service curve is obtained by the min--plus convolution of the node service curves. We state a theorem on the min--plus convolution in this work, which simplifies the computation of the min--plus convolution of service curves. The theorem follows from the continuous ΓΔ-transform, which we develop. With this theorem, we derive the optimal service curves for the nodes along a path. Further, we show how the admission control can be improved when networks are designed based on service curves. Considering one node, reallocating the service curves leads to admitting more flows. Then we point out scenarios where sub-optimal allocation of service curves in a node can increase the number of admitted flows to the network. The key results are accompanied by numerical examples. On a broader scale, this paper advances the research in analytically modeling packet-switched networks by pointing out novel properties and a new application of Network Calculus.

My Library

You currently do not have any folders to save your paper to! Create a new folder below.

Folder Name

Folder Description

View contact details

UPDATE YOUR PROFILE

Is this your profile? Update it now.

Sign into your SPIE.org account

Don’t have a profile and want one?

Create an account on SPIE.org

Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks. You are receiving this notice because your organization may not have SPIE eBooks access.*

*Shibboleth/Open Athens users─please sign in to access your institution's subscriptions.

To obtain this item, you may purchase the complete book in print or electronic format on SPIE.org.

ORGANIZATIONAL
Sign in with credentials provided by your organization.

Organizational Username

Organizational Password

Show/Hide Password

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members:

Non-members: ADD TO CART

Keywords/Phrases

Search In:

Publication Years