Extensive research effort is ongoing in energy-efficient Internet-based communications. Optical Flow Switching (OFS)
and Optical Burst Switching (OBS) offer potentially efficient alternatives to IP-router-based networks for large data
transactions, but significant challenges remain. OFS requires each user to install expensive core network technology,
limiting application to highly specialized nodes. OBS can achieve higher scalability but burst assembly/disassembly
procedures reduce power efficiency. Finally both OFS and OBS use all-optical switching technologies for which energy
efficiency and flexibility remain subject to debate.
Our study aims at combining the advantages of both OBS and OFS while avoiding their shortcomings. We consider
using a two-way resource reservation protocol for periodic concatenations of large (e.g. 1 Mb) packets or Media Frames
(MFs). These chains of MFs (MFCs) are semi-transparent with a periodicity referred to as the “transparency degree”.
Each MFC is assembled and stored at an end-user machine during the resource reservation procedure and is then
switched and buffered electronically along its path. The periodic configuration of each MFC enables interleaving of
several chains using buffering only to align the MFs in each MFC in time, largely reducing the buffer requirements with
respect to OBS. This periodicity also enables a simple scheduling algorithm to schedule large transactions with minimal
control plane processing, achieving link utilization approaching 99.9%.
In summary, results indicate that implementing optical burst switching techniques in the electronic domain is a
compelling path forward to high-throughput power-efficient networking.

Electronic implementation of optical burst switching techniques

Demand for high-bandwidth services is rapidly increasing, placing current network infrastructure under significant stress. Many interesting approaches have been studied in order to cope with this growth, but most require major redesigns of current network architectures as well as large-scale hardware redeployments. Recently, the Big File Protocol (BFP), a network protocol designed to efficiently handle large file transactions, was proposed to provide improvements over traditional IP protocols (TCP/UDP) in terms of bandwidth utilization and end-toend delay. This paper presents an integration strategy for BFP within the currently deployed optical transport network (OTN) transport infrastructure relying as much as possible on current hardware and functions, thereby minimizing the deployment impact. Simulation results show capacity utilization improvement of more than 40% relative to TCP.

Big file protocol for OTN and ethernet transport systems

Much of the growth in bandwidth demand and power consumption in today’s Internet is driven by the transport of large media files. This work presents a power-efficient overlay network specifically designed using electronic burst switching for these large files. The two approaches are presented in which electronic bursts or media frames (MF) containing >1Mb are routed in a manner similar to UDP or concatenated into periodic semi-transparent chains and routed using a two-way reservation protocol. Utilization, blocking, delay and buffer size are compared to UDP/IP by means of simulation. Both approaches dramatically reduce header-related power consumption. Concatenation also reduces significantly the amount of buffer space required. A representative router design is evaluated showing a potential energy saving of roughly 80% relative to standard IP routers.

Power-efficient Electronic Burst Switching for Large File Transactions

Depuis quelques annees, il y a un reel changement dans les usages des reseaux en termes d'applications vehiculees ainsi que dans leur nombre. On voit apparaitre de plus en plus d'applications contraintes en termes de delai, comme par exemple la telephonie sur IP, ainsi que d'applications gourmandes en ressources comme par exemple le Srteaming Video. La croissance en volume de ces applications copmmence a poser des problemes de congestion dasn les reseaux filiares et sans fil. Les operateurs reseaux doivent etre capables d'absorber ces changements de trafic, de faire face a cette demande de plus en plus intensive en bande passante et de fournir une bonne qualite (QoS) aux applications. Cela necessite des mecanismes intellignets en termes d'ordonnancement et de gestion des files d'attente, de controle d'admission, de controle de debit et/ou de routage. L'objectif initial de cette these etati d'aboutir a la conception d'une nouvelle architecture de traitement et de gestion du trafic et de la qualite de service pour le controle d'admission. Plus precisement nous presentons une nouvelle solution pour le controle d'admission qui repose sur l'elaboration en continu d'un plan de connaissance et sur la modelisatio automatique du comportement d'un lien reseau par une file d'attente monoserveur. Norte solution doit permettre d'offrir une garantie probabiliste d'un parametre de performance QoS qui peut etre le delai d'attente moyen des paquets dans le buffer du lien ou le taux de perte. Nous avons evalue les performances de notre nouveau contro^le d'admission par simulation en considerant diverses conditions possibles de trafic. Lers resultats obtenus indiquent que la solution proposee permet d'atteindre un controle d'admission ni trop conservateur, ni trop permissif. En outre, notre solution offre l'avantage de se baser uniquement sur une connaisssance acquise au cours du temps et permet ainsi de s'affranchir d'un parametrage complique des parametres comme c'est le cas pour les solutions classiques de controle d'admission

Plan de connaissance pour les réseaux sémantiques : application au contrôle d'admission

Looking into the future, this paper presents the effects of having packets of large sizes, called XLFrames (XLFs), in a network. The analysis is motivated by the fact that the Internet is soon to witness stupendous amounts of traffic that have to be processed and switched at amplifying line rates; and this brings forth multiple challenges in the form of energy efficiency, network performance and end-host performance. Increasing the size of packets in the Internet has far-reaching incentives that otherwise appear hard to achieve. We foresee an Internet that multiplexes both packets (sand) and XLFs (rocks). As a first step, we analyse the effects of introducing XLFs in a network, and find the following: (i) the amount of packet-header processing is greatly reduced, (ii) while the fair multiplexing of XLFs with standard packets can be achieved using a careful queue management in routers.

/pdf/from-packets-to-xlframes-sand-and-rocks-for-transfer-of-mice-1umxuxynjj.pdf

From Packets to XLFrames: Sand and Rocks for Transfer of Mice and Elephants

Routing game presents an interesting framework to analyse the practical problem of source routing in the Internet. It is particularly useful in quantifying the inefficiency of selfish user behavior that results in any transportation network without any central authority. This game assumes that the only user criteria for decision making is path cost. In this work, we take a step further, and model a routing game where user decision is based not only on path but also on time. We show that, under convex cost functions, this new routing game over time can be mapped to the classical routing game, thereby presenting a model that can exploit well-established results in the subject. Using a simple example, we demonstrate the usefulness of the model, and motivate the need for resource coordination to minimize inefficiency or cost.

https://hal.inria.fr/inria-00383573/document

Extending Routing Games to Flows over Time

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

Eitan Altman

Author Tools

Chat about Author

Papers

From Packets to XLFrames: Sand and Rocks for Transfer of Mice and Elephants

Extending Routing Games to Flows over Time