METFAC-2.1 is a software tool for stochastic modeling using Markov reward models, i.e. continuous-time Markov chains with a reward rate structure on their state space. The tool has been developed under the direction of Prof. Juan A. Carrasco and offers many state-of-the-art numerical methods as well as simulation methods.

The talk will cover recent results on cooperative communication schemes for ad hoc and sensor networks. We will first discuss the offline computation of optimal policies for multi-hop virtual MISO transmission for distributed ad hoc networks in the presence of channel impairments such as path loss and multipath fading. Thus, we will elaborate on heuristic and opportunistic routing policies, by comparing their performance to that of optimal routing.

The increasing adoption of Software Defined Networking, and OpenFlow in particular, brings great hope for increasing extensibility and lowering costs of deploying new network functionality. A key component in these networks is the OpenFlow agent, a piece of software that a switch runs to enable remote programmatic access to its forwarding tables. While testing high-level network functionality, the correct behavior and interoperability of any OpenFlow agent are taken for granted. However, existing tools for testing agents are not exhaustive nor systematic, and only check that the agent’s basic functionality works. In addition, the rapidly changing and sometimes vague OpenFlow specifications can result in multiple implementations that behave differently.

Mobile communications networks have been evolved through multiple technologies over a period of several decades, to a stage that they become very complicated in the context of resource control and management. The heterogeneous next generation mobile network (NGMN) now includes a variety of network technologies and topologies incorporating with one another to provide a wide range of services; operate in a variety of channel conditions and environments; and within a single universal end user device. NGMN will need to be offered as an integrated system, and to promote interoperability among networks, offer global coverage and seamless mobility, enable the use of a universal handheld terminal, and enhance service quality compared to current wired networks. NGMN will be the infrastructure of the true mobile Internet.

We focus on collaborative video streaming in wired overlay networks using low cost network codes. We propose a scheme that builds on both rateless codes and network coding in order to improve the system throughput and the video quality at clients. Our hybrid coding algorithm permits to efficiently exploit the available source and path diversity, without the need either for expensive routing or for scheduling algorithms.

If you would like more information about Dr. Tiago Camilo, please visit his Linkedin profile: http://www.linkedin.com/in/tiagocamilo

More information about Nokia Siemens Networks

On Wednesday, the 13th of November, will take place the next meeting of ESNOG/GORE (España Network Operators Group / Grupo de Operadores de Red Españoles), at the Polytechnic School (Leganés Campus) of the University Carlos III of Madrid (UC3M). The meeting is sponsored by the Cátedra Telefónica de la UC3M and ESPANIX (Punto neutro Español de Internet). This is a workshop that will schedule a series of lectures and panel discussions on Internet at the network level.

This seminar builds on your basic knowledge of computer networks from an introductory computer networks class or equivalent. It covers mathematical and algorithmic foundations of the essential networking functions of data transfer, transfer control, and management. Essential concepts of some techniques, such as optimization, control theory, queuing theory, and their application to networks are covered.

Dr. Kenichi Mase, Dr. Toshini Tsuboi and Dr. Hiromi Ueda will visit Institute IMDEA Networkson Monday September 20th and will take the opportunity to present their research lines. The overall talk will last about 45 minutes, including questions and answers, and it will be divided in the following three 15 minute slots:

A great deal of of interesting work was done in the 1970s in generalizing shortest path algorithms to a wide class of semirings also called "path algebras" or "dioids". Although the evolution of Internet Routing protocols does not seem to have taken much inspiration from this work, recent "reverse engineering" efforts have demonstrated that an algebraic approach is very useful for both understanding existing protocols and for exploring the design space of future Internet routing protocols. This course is intended teach participants the basic concepts needed to understand this approach. No previous background will be assumed.