Palanivel Kodeswaran dissertation defense, 10am 1/31/11

 

Palanivel Kodeswaran will defend his Ph.D. dissertation, "On the use of context and policies in declarative networked systems", at 10:00am on Monday, 31 January in ITE 325. The research was directed by Professor Anupan Joshi. The defense is open to the public.

Abstract: Managing complex networks while ensuring that certain high level goals such as security are met is a complicated process. This is evidenced by the recent Internet outages caused by operators misconfiguring BGP routers. Clearly, there is a growing need to separate the high level goals/policies from the low level mechanisms that implement the various services. We propose a declarative framework for specifying and enforcing high level policies in networks. The declarative framework offers flexibility in terms of specifying the higher level goals rather than focusing on the lower level mechanisms employed in the implementation, and robustness in terms of recovering from failure. One of the key building blocks of our framework is to allow applications to expose their semantics, thereby allowing the underlying network to exploit the semantics and provide better-than-best-effort service where possible. Our framework employs semantic web languages such as OWL and RDF to formally express application and network specifications, and thereby leverages the inherent reasoning and conflict resolution capabilities of these languages. Once the applications and networks are formally specified in our framework, operators can write adaptation policies to jointly adapt the application and network layers in response to changing network conditions. Our experiments with video over wireless show that the joint adaptation provides higher performance compared to no adaptation as well as application/network layer alone adaptation. Furthermore, the adaptation policies are easy to express in our framework and can be dynamically changed at run time. We also show how our framework can be used to automatically configure BGP routers. High level organizational routing policies can be captured in our framework through appropriate ontological specifications. These specifications which can then be checked for correctness are automatically compiled into appropriate low level BGP configurations by our framework and installed on the routers. Furthermore, the logical basis of our specifications enables reasoning, and routers can engage in an argumentation with their neighbors to diagnose and recover from routing misconfigurations through policy controlled reconfigurations. In cases where the argumentation protocol does not converge or the reconfiguration needed is not permitted by policy, the network administrator is alerted along with a log of the argumentation protocol executed so far, helping in isolating the location and cause of failure.

Global Game Jam at UMBC, 28-30 January

 

2011 Global Game Jam

UMBC will be the Baltimore host site for the 2011 Global Game Jam, an international computer game making festival taking place this coming weekend, January 28th-30th. This is a 48 hour event, where teams from around the globe work to each develop a complete game over one weekend. The first year had 54 sites in 23 countries. Last year, there were 124 sites in 34 countries. The Baltimore site is open to participants at all skill levels, and it is not necessary to be a UMBC student to register. Thanks to generous support by Next Century there is no registration fee for the UMBC site. Participation will be limited to the first 40 registrants.

The jam will start at 5:00pm on Friday 28 January in the UMBC GAIM Lab, ECS room 005a. At that time, the theme for this year's games will be announced, and we'll brainstorm game ideas and form into teams. There is no need to come as a team: each individual has an equal chance to pitch their game ideas, and you can join the team whose game you like best. Teams will have until 3:00pm on Sunday 30 January to develop their games. We'll have demos of each game and selection of local awards, wrapping up by 5:00pm Sunday.

1 28 29 30